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 | Cryptocurrencies without Proof of Work |
|---|---|
| What the text proposes | The paper studies stake-based chain selection and the cost of signing every fork. It is one of the early formal attempts to replace work with a scarce key. |
| Who may write | Iddo Bentov, Ariel Gabizon and Alex Mizrahi |
| What is settled | Signing a second fork is cheap if the key is not bonded. |
| Load-bearing assumption | This is not Ouroboros and not Casper. |
| What this library says afterwards | A reading of the public document. Not a copy of it, and not a claim about a later network that reused the name. |
| Rights | Official external source only |