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 | Tendermint: Consensus without Mining |
|---|---|
| What the text proposes | A practical Byzantine-fault-tolerant state machine for a known validator set, with instant finality on commit. It became the consensus engine under Cosmos SDK chains. The 2014 note is the origin, not the current CometBFT specification. |
| Who may write | Jae Kwon |
| What is settled | Validators are known for the round. Voting weight is assigned, not discovered by hashing. |
| Load-bearing assumption | A named validator set is a governance object. The paper does not tell a venture who should hold the keys. |
| What this library says afterwards | Cosmos zones, IBC and the SDK are later. See the Cosmos paper for the network-of-ledgers claim. |
| Rights | Official external source only |