Expected Linear Round Synchronization: The Missing Link for Linear Byzantine SMR
This solves a critical bottleneck for Byzantine SMR protocols like HotStuff and Tendermint, enabling them to achieve linear message complexity overall, which is significant for scalable distributed systems.
The paper tackles the problem of round synchronization in Byzantine State Machine Replication (SMR) by presenting an algorithm that achieves expected linear message complexity and expected constant latency, addressing a previously open question.
State Machine Replication (SMR) solutions often divide time into rounds, with a designated leader driving decisions in each round. Progress is guaranteed once all correct processes synchronize to the same round, and the leader of that round is correct. Recently suggested Byzantine SMR solutions such as HotStuff, Tendermint, and LibraBFT achieve progress with a linear message complexity and a constant time complexity once such round synchronization occurs. But round synchronization itself incurs an additional cost. By Dolev and Reischuk's lower bound, any deterministic solution must have $Ω(n^2)$ communication complexity. Yet the question of randomized round synchronization with an expected linear message complexity remained open. We present an algorithm that, for the first time, achieves round synchronization with expected linear message complexity and expected constant latency. Existing protocols can use our round synchronization algorithm to solve Byzantine SMR with the same asymptotic performance.