Hotstuff
Resources
Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham
Cornell University, VMware Research, UNC-Chapel Hill
Contributions
HotStuff, a new protocol whose proposer incurs linear communication complexity (Linearity), and does not need to wait the maximal network delay (Optimistic Responsiveness).
A casting DLS, PBFT, Tendermint, Casper and HotStuff in the same framework.
Model checking by SPIN
Fatures
View-change VS Tendermint
Tendermint does not need "view-change" if the previous round succeeded
However, without "wait-for-∆", network failure or malicious leader can lock some validator slightly before the timout
Point: We cannot guarantee the existence of a set of$ 2f + 1validators (which intersects with the honest validator set) that keep the newly ceritified block as its view candidate
https://gyazo.com/495ed4132c277b76a07254b102ab56b5
On-chain QC
In Chained-Hotstuff, replicas send votes to the next Leader, and the leader includes QC on in proposal
Message complexity becomes$ O(n) (authenticator complexity is still$ O(n^2))
LibraBFT