Channel (broadcasting)

Computer network

Mathematics

Latency (audio)

Distributed computing

Replication (statistics)

Statistics

Epistemology

Mathematical analysis

Philosophy

Byzantine fault tolerance

Synchronization (alternating current)

sync

Computer science

Simple (philosophy)

Real-time computing

Fault tolerance

Telecommunications

Upper and lower bounds

Synchronous solutions for Byzantine Fault Tolerance (BFT) can tolerate up to minority faults. In this work, we present Sync HotStuff, a surprisingly simple and intuitive synchronous BFT solution that achieves consensus with a latency of 2Δ in the steady state (where Δ is a synchronous message delay upper bound). In addition, Sync HotStuff ensures safety in a weaker synchronous model in which the synchrony assumption does not have to hold for all replicas all the time. Moreover, Sync HotStuff has optimistic responsiveness, i.e., it advances at network speed when less than one-quarter of the replicas are not responding. Borrowing from practical partially synchronous BFT solutions, Sync HotStuff has a two-phase leader-based structure, and has been fully prototyped under the standard synchrony assumption. When tolerating a single fault, Sync HotStuff achieves a throughput of over 280 Kops/sec under typical network performance, which is comparable to the best known partially synchronous solution.

Sync HotStuff: Simple and Practical Synchronous State Machine Replication