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 | Scaling Nakamoto Consensus to Thousands of Transactions per Second |
|---|---|
| What the text proposes | Keep every block in a directed acyclic graph. A pivot chain picks a total order. Honest blocks that lost the race still contribute security and transactions. |
| Who may write | Chenxing Li, Peilun Li, Dong Zhou, Wei Xu, Fan Long and Andrew Chi-Chih Yao |
| What is settled | Blocks point at more than one parent. |
| Load-bearing assumption | The paper's throughput is a model, not a promise for a later network. |
| 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 |