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 Honey Badger of BFT Protocols |
|---|---|
| What the text proposes | An asynchronous atomic broadcast. It does not wait for a timeout to make progress, and threshold encryption stops a leader from reading a batch and then dropping the transactions it dislikes. |
| Who may write | Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi and Dawn Song |
| What is settled | A common subset of each replica's proposed batch, built from reliable broadcast and a binary agreement. |
| Load-bearing assumption | This is not a proof-of-work chain and not a production client you can download under this name. |
| What this library says afterwards | Threshold keys are their own ceremony. Losing the dealer story loses the censorship claim. |
| Rights | Official external source only |