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 | Solana: A new architecture for a high performance blockchain |
|---|---|
| What the text proposes | Yakovenko's design note for a ledger that encodes the passage of time as a verifiable hash chain, called Proof of History, so that validators spend less effort agreeing on order. |
| Who may write | Anatoly Yakovenko |
| What is settled | Proof of History is a sequential hash. Checking it can be parallel; producing it cannot. |
| Load-bearing assumption | The paper's theoretical discussion of throughput is not a measurement of the live network, and this page will not repeat it as one. |
| What this library says afterwards | A verifiable clock still has a leader who produces it. Censorship and leader rotation are outside the clock. |
| Rights | Official external source only |