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 | Zyzzyva: Speculative Byzantine Fault Tolerance |
|---|---|
| What the text proposes | Replicas execute the leader's request speculatively and reply. If every replica agrees, the client is done. A disagreement starts a slower path that looks more like PBFT. |
| Who may write | Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement and Edmund Wong |
| What is settled | The fast path needs all replicas, not merely a quorum. |
| Load-bearing assumption | A fast path that needs every replica stalls when one is slow. |
| 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 |