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 | The Swirlds Hashgraph Consensus Algorithm: Fair, Fast, Byzantine Fault Tolerance |
|---|---|
| What the text proposes | Baird's technical report on hashgraph: gossip about gossip, a virtual vote computed from the graph, and a fairness claim about the order of transactions. Hedera is the later public network that uses the algorithm under a governing council. |
| Who may write | Leemon Baird |
| What is settled | Events contain transactions plus hashes of earlier self-events and received events. The data structure is the hashgraph. |
| Load-bearing assumption | The report is not Hedera's council charter, fee schedule or token terms. |
| What this library says afterwards | A permissioned set of gossip peers is load-bearing. Opening the set changes the theorem you are allowed to quote. |
| Rights | Official external source only |