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 | In Search of an Understandable Consensus Algorithm |
|---|---|
| What the text proposes | A strong leader accepts entries, replicates them in order, and commits only when a majority of the current term has stored them. |
| Who may write | Diego Ongaro and John Ousterhout |
| What is settled | Terms are numbered epochs. At most one leader per term. |
| Load-bearing assumption | Raft assumes a known set, or an explicit membership change. |
| What this library says afterwards | A reading of the public document. Not a copy of it, and not a claim about a later network that reused the name. |
| Rights | Official external source only |