Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | Proofs of Space |
|---|---|
| What the text proposes | A proof that a machine reserved storage, not that it burned energy on a puzzle. The verifier checks a small challenge. Chia is a later system that pairs this idea with a verifiable delay. The paper is not Chia. |
| Who may write | Stefan Dziembowski, Sebastian Faust, Vladimir Kolmogorov and Krzysztof Pietrzak |
| What is settled | An initialization that fills disk with a structure the prover cannot recompute quickly. |
| Load-bearing assumption | A proof of space does not, by itself, stop a grinding attack on the challenge. Chia adds a delay function for that reason. This paper does not include that delay. |
| What this library says afterwards | Storage that is not dedicated can be rented. The economic assumption is not in the theorem. |
| Rights | Official external source only |