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 | Secure High-Rate Transaction Processing in Bitcoin |
|---|---|
| What the text proposes | At high block rates the longest chain throws away too much honest work. GHOST follows the heaviest subtree, so blocks off the main tip still count for the fork choice. |
| Who may write | Yonatan Sompolinsky and Aviv Zohar |
| What is settled | Choose the chain by the weight of the subtree, not by the number of blocks in a single path. |
| Load-bearing assumption | Heavier subtrees do not by themselves give fast finality. |
| What this library says afterwards | The paper is not PHANTOM and not SPECTRE. Those are blockDAG protocols with different ordering rules. |
| Rights | Official external source only |