[논문 세미나] PACE: Fully Parallelizable BFT from Reproposable Byzantine Agreement
Author:
Haibin Zhang, Sisi Duan
Jounal/Conference:
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
source:
(archive) https://eprint.iacr.org/2022/020
(acm sigsac) https://dl.acm.org/doi/abs/10.1145/3548606.3559348
Presentation material:
[Abstract]
The classic asynchronous Byzantine fault tolerance (BFT) framework of Ben-Or, Kemler, and Rabin (BKR) and its descendants rely on reliable broadcast (RBC) and asynchronous binary agreement (ABA). However, BKR does not allow all ABA instances to run in parallel, a well-known performance bottleneck. We propose PACE, a generic framework that removes the bottleneck, allowing fully parallelizable ABA instances. PACE is built on RBC and reproposable ABA (RABA). Different from the conventional ABA, RABA allows a replica to change its mind and vote twice. We show how to efficiently build RABA protocols from existing ABA protocols and a new ABAprotocol that we introduce. Weimplement six new BFT protocols: three in the BKR framework, and three in the PACE framework. Via a deployment using 91 replicas on Amazon EC2 across five continents, we show that all PACE instantiations, in both failure-free and failure scenarios, significantly outperform their BKR counterparts, and prior BFT protocols such as BEAT and Dumbo, in terms of latency, throughput, latency vs. throughput, and scalability.
[Introduction]
- remove two-subphase bottleneck of BKR paradigm, improving throughput, latency, and scalability over past BKR frameworks and Dumbo.
