Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil
share
We describe a protocol called `Hot-Stuff the Linear, Optimal-Resilience, One-Message BFT Devil' (in short, Hot-Stuff) for n = 3f+1 replicas, of which 2f+1 are honest, to agree on a replicated, ever-changing state. The protocol is always safe against a threshold f of Byzantine failures, even when the system is asynchronous. Progress is guaranteed under periods of synchrony. The per-round communication cost in Hot-Stuff is linear, hence O(n^2) overall cost to a decision during periods of synchrony, an improvement of O(n^2) over previous asynchronous BFT protocols. Hot-Stuff uses one type of message exchange, and is succinctly described in under twenty lines of pseudo-code.
READ FULL TEXT