Differences

This shows you the differences between two versions of the page.

--- renter:renting [2017/03/24 20:53]
Luke Champine
+++ renter:renting [2018/01/04 08:31] (current)
Fornax [Uploading and Downloading] correction chunk sizes
@@ Line 1: / Line 1: @@
 ====== Renting ======
+//For a practical guide about how to use the UI for renting, check [[renter:using_the_ui_for_renting|Using the UI for renting]]//
+Renters pay hosts to store their data on the Sia network.
 ===== Contract Formation =====
-In order to store files on Sia, you must first form [[renter:contracts]] with various hosts. A contract sets aside a fixed amount of siacoins to be spent on storing and transferring data over a fixed period. The renter pays all the siacoins in advance, and any unused coins are returned to them at the end of the contract period.
+In order to store files on Sia, renters must first form [[renter:contracts]] with various hosts. A contract sets aside a fixed amount of siacoins to be spent on storing and transferring data over a fixed period. The renter pays all the siacoins in advance, and any unused coins are returned to them at the end of the contract period.
 To help facilitate this process, the Sia client allows users to set an //allowance//. An allowance specifies the maximum amount of siacoins to be spent, and the period (in blocks) in which they are spent. The client then intelligently chooses hosts and forms contracts with them such that each contract can store the same amount of data.
@@ Line 12: / Line 16: @@
 Sia uses encryption and erasure coding to ensure that files are private and remain available even if hosts go offline.
-The uploading process is as follows. First, the file is striped into //chunks// of 40MB. Reed-Solomon erasure coding is then applied on each chunk, expanding them into 30 //pieces// of 4MB. Erasure coding is like an M-of-N multisig protocol, but for data: out of //N// total pieces, only //M// are needed to recover the full 40MB chunk. This ensures a high level of redundancy, much greater than traditional replication.
+The uploading process is as follows. First, the file is striped into //chunks// of 40MiB. Reed-Solomon erasure coding is then applied on each chunk, expanding them into 30 //pieces// of 4MiB. Erasure coding is like an M-of-N multisig protocol, but for data: out of //N// total pieces, only //M// are needed to recover the full 40MiB chunk. This ensures a high level of redundancy, much greater than traditional replication.
 Each piece is then encrypted with the Twofish algorithm. It was one of the five finalists of the Advanced Encryption Standard contest, but it was not selected for standardization. Nonetheless, this algorithm is considered very secure.

User Tools

Site Tools

Differences

Page Tools