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 | Vault: Fast Bootstrapping for the Algorand Cryptocurrency |
|---|---|
| What the text proposes | Vault compresses Algorand's state and the proofs a client needs so a bootstrapping node does not replay the entire history. |
| Who may write | Derek Leung, Adam Suhl, Yossi Gilad and Nickolai Zeldovich |
| What is settled | Bootstrapping is a data problem sitting beside consensus. |
| Load-bearing assumption | This does not make an uncertified state safe. |
| What this library says afterwards | A reading of the public paper. Not a copy, not a benchmark, and not a claim about any later network. |
| Rights | Official external source only |