Brief Note: Fast Authenticated Byzantine Consensus
Ittai Abraham, Kartik Nayak, Ling Ren, Zhuolun Xiang

TL;DR
This paper introduces a new authenticated Byzantine fault-tolerant consensus protocol that achieves 2-round commit with fewer replicas than previous protocols, improving latency and resilience claims.
Contribution
It presents a 2-round BFT SMR protocol with fewer replicas, challenging prior optimality claims and optimizing for permissioned blockchain systems.
Findings
Achieves 2-round BFT consensus with n ≥ 5f-1 replicas.
For f=1, only 4 replicas are needed, reducing latency.
Refutes previous claims of optimal resiliency in similar protocols.
Abstract
Byzantine fault-tolerant (BFT) state machine replication (SMR) has been studied for over 30 years. Recently it has received more attention due to its application in permissioned blockchain systems. A sequence of research efforts focuses on improving the commit latency of the SMR protocol in the common good case, including PBFT with -round latency and and FaB with -round latency and . In this paper, we propose an authenticated protocol that solves -round BFT SMR with only replicas, which refutes the optimal resiliency claim made in FaB for needing for -round PBFT-style BFT protocols. For the special case when , our protocol needs only replicas, and strictly improves PBFT by reducing the latency by one round (even when one backup is faulty).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Cognitive Functions and Memory · Blockchain Technology Applications and Security
