# Proof of space

This article relies too much on references to primary sources. (March 2018) |

**Proof of space** (**PoS**) is a type of consensus algorithm achieved by demonstrating one's legitimate interest in a service (such as sending an email) by allocating a non-trivial amount of memory or disk space to solve a challenge presented by the service provider. The concept was formulated in 2013 by Dziembowski *et al.*^{[1]}^{[2]} and (with a different formulation) by Ateniese *et al.*.^{[3]}^{[4]}

Proofs of space are very similar to proofs of work (PoW), except that instead of computation, storage is used to earn cryptocurrency. Proof-of-space is different from memory-hard functions in that the bottleneck is not in the number of memory access events, but in the amount of memory required.

After the release of Bitcoin, alternatives to its PoW mining mechanism were researched, and PoS was studied in the context of cryptocurrencies. Proofs of space are seen as a fairer and greener alternative by blockchain enthusiasts due to the general-purpose nature of storage and the lower energy cost required by storage, but they have been criticized for increasing demand for storage. Several theoretical and practical implementations of PoS have been released and discussed, such as SpaceMint, Signum, and Chia.

## Concept description[edit]

A proof-of-space is a piece of data that a prover sends to a verifier to prove that the prover has reserved a certain amount of space. For practicality, the verification process needs to be efficient, namely, consume a small amount of space and time. For security, it should be hard for the prover to pass the verification if it does not actually reserve the claimed amount of space.

One way of implementing PoS is by using hard-to-pebble graphs.^{[2]}^{[5]} The verifier asks the prover to build a labeling of a hard-to-pebble graph. The prover commits to the labeling. The verifier then asks the prover to open several random locations in the commitment.

### Proof of storage[edit]

A **proof of storage** (also **proof of retrievability**, **proof of data possession**) is related to a proof-of-space, but instead of showing that space is available for solving a puzzle, the prover shows that space is actually used to store a piece of data correctly at the time of proof.

Cryptocurrencies intended to assign value to store data use some form of this system; examples include Chives, Storj, Sia, Filecoin, and Arweave.

### Proof of capacity[edit]

A **proof of capacity** is a system where miners are allowed to pre-calculate ("plot") PoW functions and store them onto the HDD. It is generally only used by Signum(formerly burstcoin).^{[6]}

### Proof of space-time[edit]

A **proof of space-time** (**PoST**) is a proof that shows the prover has spent an amount of time keeping the reserved space unchanged. Its creators reason that the cost of storage is inextricably linked not only to its capacity, but to the time in which that capacity is used. It is related to a proof-of-storage (but without necessarily storing any useful data), although the Moran-Orlov construction also allows a tradeoff between space and time.^{[7]}

## Uses[edit]

Proofs of space could be used as an alternative to proofs of work in the traditional client puzzle applications such as anti-spam measures and denial of service attack prevention. Proof-of-Space has also been used for malware detection, by determining whether the L1 cache of a processor is empty (e.g., has enough space to evaluate the PoS routine without cache misses) or contains a routine that resisted being evicted.^{[8]}^{[9]}

Proofs of space have been developed further in several concept papers and in one live cryptocurrency implementation.

### Signum (formerly Burstcoin)[edit]

Proof of capacity consumes disk space rather than computing resources to mine a block. Unlike PoW, where the miners keep changing the block header and hash to find the solution, proof of capacity (as implemented by Burstcoin, and developed further by Signum) generates random solutions, also called plots, using the Shabal cryptographic algorithm in advance and stores it on hard drives. This stage is called plotting and it may take days or even weeks depending on the storage capacity of the drive. In the next stage - mining, miners match their solutions to the most recent puzzle and the node with the fastest solution gets to mine the next block.^{[10]}^{[11]}

### SpaceMint[edit]

In 2015, a paper proposed a cryptocurrency called SpaceMint.^{[12]} It attempts to solve some of the practical design problems associated with the pebbling-based PoS schemes. In using PoS for decentralized cryptocurrency, the protocol has to be adapted to work in a non-interactive protocol since each individual in the network has to behave as a verifier.^{[12]}

### Chia[edit]

In 2018, a proposed cryptocurrency Chia presented two papers presenting a new protocol based on proof of space^{[13]} and proof of time.^{[14]}

In February of 2021, Chia published a white paper outlining its business and has since launched its mainnet and Chia coin (XCH) using the Proof of Space Time concept. The spacetime model of Chia also depends on "plotting" (generation of proof-of-space files) to the storage medium to solve a puzzle.^{[15]}

Unlike many proof-of-storage cryptocurrencies, Chia plots do not store any useful data. Also, Chia's proof-of-time method for plotting has raised concerns over shortened lifespans of solid-state drives due to the intensity of write activity involved in plot generation (typically, plotting occurs on an SSD and then the finished plots are transferred to a hard disk drive for long-term storage).^{[16]}

### Spacemesh[edit]

In 2019, a paper was released by Tal Moran and Ilan Orlov proposing a new protocol based on proof of space-time.

Spacemesh is unique due to its use of a blockmesh, rather than a blockchain. While a blockchain is a chain of single blocks, a blockmesh makes use of a directed acyclic graph (DAG) composed of layers, with each layer containing many blocks.

## References[edit]

- ↑
*Dziembowski, Stefan; Faust, Sebastian; Kolmogorov, Vladimir; Pietrzak, Krzysztof (2013). "Proofs of Space". Cryptology Eprint Archive*https://eprint.iacr.org/2013/796 - ↑
^{2.0}^{2.1}Dziembowski, Stefan; Faust, Sebastian; Kolmogorov, Vladimir; Pietrzak, Krzysztof (2015).*Proofs of Space*. Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference. Vol. 9216. pp. 585–605. - ↑ Ateniese, Giuseppe; Bonacina, Ilario; Faonio, Antonio; Galesi, Nicola (2014). "Proofs of Space: When Space is of the Essence". https://eprint.iacr.org/2013/805
- ↑
Ateniese, Giuseppe; Bonacina, Ilario; Faonio, Antonio; Galesi, Nicola (2014). "Proofs of Space: When Space is of the Essence".
**8642**: 538–557.`{{cite journal}}`

: Cite journal requires`|journal=`

(help) - ↑
Ren, Ling; Srinivas, Devadas (2016). "Proof of Space from Stacked Expanders" (PDF).
`{{cite journal}}`

: Cite journal requires`|journal=`

(help) - ↑ "Proof of capacity (PoC)".
- ↑ Moran, Tal; Orlov, Ilan (2019). "Simple Proofs of Spacetime and Rational Proofs of Storage" (PDF).
- ↑ Jakobsson, Markus; Stewart, Guy (2013). "Mobile Malware: Why the Traditional AV Paradigm is Doomed, and How to Use Physics to Detect Undesirable Routines, BlackHat" (PDF). S2CID 16726066. Archived from the original (PDF) on 18 March 2018.
`{{cite journal}}`

: Cite journal requires`|journal=`

(help) - ↑ Markus Jakobsson Secure Remote Attestation
*Cryptology ePrint Archive.*Retrieved 8 January 2018. - ↑ Wahab, Abdul; Waqas, Memood (October 2018). "Survey of Consensus Protocols".
*Survey of Consensus Protocols*: 6. arXiv:1810.03357. Bibcode:2018arXiv181003357W. - ↑ Salimitari, Mehrdad; Chatterjee, Mainak (September 2018). "An Overview of Blockchain and Consensus Protocols for IoT Networks".
*An Overview of Blockchain and Consensus Protocols for IoT Networks*: III–G. arXiv:1809.05613. - ↑
^{12.0}^{12.1}Park et al. SpaceMint: A Cryptocurrency Based on Proofs of Space.*Cryptology ePrint Archive.*Retrieved 31 October 2016. - ↑
Abusalah, Hamza; Alwen, Jo\"{e}l; Cohen, Bram; Khilko, Danylo; Pietrzak, Krzysztof; Reyzin, Leonid (2017). "Beyond Hellman's Time-Memory Trade-Offs with Applications to Proofs of Space" (PDF).
`{{cite journal}}`

: Cite journal requires`|journal=`

(help) - ↑ Cohen, Bram; Pietrzak, Krzysztof. "Simple Proofs of Sequential Work" (PDF).
*Simple Proofs of Sequential Work*. - ↑ Hoffman, Gene (10 February 2021). "The Chia Business Whitepaper".
*Chia Network*. Chia. Retrieved 1 May 2021. - ↑ Lilly, Paul (11 May 2021). "Chia mining can wreck a 512GB SSD in as little as 6 weeks".
*PC Gamer*. Archived from the original on 17 May 2021. Retrieved 19 May 2021.

## External links[edit]

- Chives website
- Chives Swap
- Chives Explorer
- Signum Network web site
- Signum Community Website Documentation
- Chia web site