Kernkonzepte
TetraBFT, a novel unauthenticated Byzantine fault tolerant protocol, achieves optimal resilience, constant local storage, optimal communication complexity, and reduced consensus latency compared to prior work.
Zusammenfassung
The paper presents TetraBFT, a novel unauthenticated Byzantine fault tolerant (BFT) consensus protocol that offers several compelling features:
Optimal resilience: TetraBFT requires only 3f+1 nodes to tolerate f Byzantine faults, which is the optimal resilience.
Constant local storage: TetraBFT uses only constant local storage per node, unlike prior protocols that require unbounded or quadratic storage.
Optimal communication complexity: TetraBFT has a worst-case quadratic communication complexity of O(n^2) bits per view, where n is the number of nodes.
Reduced latency: TetraBFT achieves a good-case latency of 5 message delays, outperforming the previous best unauthenticated protocol Information-Theoretic HotStuff (IT-HS) which had 6 message delays.
The authors provide a comprehensive security analysis, including formal verification using TLA+, to prove the safety and liveness properties of TetraBFT. They also extend TetraBFT to a multi-shot, pipelined consensus protocol, making it a practical solution for blockchain systems aiming for high efficiency.