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 | Harmony Technical Whitepaper |
|---|---|
| What the text proposes | A sharded proof-of-stake design that combines a BFT-style consensus inside shards with a randomness scheme for assigning validators, aimed at keeping a single shard from being captured. |
| Who may write | Stephen Tse and the Harmony team |
| What is settled | Validators stake and are randomly assigned. Resharding is part of the security argument. |
| Load-bearing assumption | Do not treat the white paper's target throughput as a measured result. |
| What this library says afterwards | Randomness that is biasable recreates the shard-capture problem the design set out to avoid. |
| Rights | Official external source only |