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 | OHIE: Blockchain Scaling Made Simple |
|---|---|
| What the text proposes | Run many parallel Nakamoto chains. A block is assigned to a chain by its hash. The safety argument stays close to bitcoin's, and the throughput is the sum. |
| Who may write | Haifeng Yu, Ivica Nikolić, Ruomu Hou, Prateek Saxena and Joseph Bonneau |
| What is settled | Parallel chains are not shards with their own trust assumptions. |
| Load-bearing assumption | The paper's throughput is a model. |
| 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 |