Speeding Dumbo: Pushing Asynchronous BFT Closer to Practice
Bingyong Guo, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, Zhenfeng Zhang
Abstract
—Asynchronous BFT consensus can implement ro- bust mission-critical decentralized services network without rely-ing on any form of timing assumption. Starting from the work of HoneyBadgerBFT (CCS 2016), several studies tried to push asynchronous BFT towards practice. In a recent work of Dumbo (CCS 2020), they redesigned the protocol backbone and used one multi-valued validated Byzantine agreement (MVBA) to replace n concurrent asynchronous binary agreement (ABA) protocols and dramatically improved the performance. Despite those efforts, asynchronous BFT protocols remain to be slow, and in particular, the latency is still quite large. There are two reasons contributing to the inferior performance: (1) the reliable broadcast (RBC) protocols still incur substantial costs; (2) the MVBA protocols are quite complicated and heavy, and all existing constructions need dozens of rounds and take the majority of the overall latency. We first present a new construction of asynchronous BFT that replaces RBC instance with a cheaper broadcast component. It not only reduces the O ( n 3 ) message complexity incurred by n RBCs to O ( n 2 ) , but also saves up to 67% communications (in the presence of a fair network scheduler). Moreover, our technical core is a new MVBA protocol, Speeding MVBA, which is concretely more efficient than all existing MVBAs. It requires only 6 rounds in the best case and expected 12 rounds in the worst case (by contrast, several dozens of rounds in the MVBA from Cachin et al. [12] and the recent Dumbo-MVBA [33], and around 20 rounds in the MVBA from Abraham et al. [4]). Our new technique of the construction might be of independent interests. We implemented Speeding Dumbo and did extensive tests among up to 150 EC2 t2.medium instances evenly allocated in 15 AWS regions across the globe. The experimental results show that Speeding Dumbo reduces the latency to about a half of Dumbo’s, and also doubles the throughput of Dumbo, through all system scales from 4 nodes to 150 nodes. We also did tests to benchmark individual components such as the broadcasts and the MVBA protocols, which may be of interests for future improvements.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 540461b8-3247-4cb7-829b-460a3e55049dCited by top-tier papers20
- Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious LatencyYingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang et al.CCS 2022 · 72 citations
- Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As the Pipelined BFTYuan Lu, Zhenliang Lu, Qiang TangCCS 2022 · 49 citations
- Scaling Blockchain Consensus via a Robust Shared MempoolFangyu Gai, Jianyu Niu, Ivan Beschastnikh, Chen Feng et al.ICDE 2023 · 25 citations
- Asynchronous Consensus without Trusted Setup or Public-Key CryptographySourav Das, Sisi Duan, Shengqi Liu, Atsuki Momose et al.CCS 2024 · 15 citations
- Pando: Extremely Scalable BFT Based on Committee SamplingXin Wang, Haochen Wang, Haibin Zhang, Sisi DuanNDSS 2026 · 8 citations
Builds on7
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi et al.CCS 2016 · 974 citations
- BEAT: Asynchronous BFT Made PracticalSisi Duan, Michael K. Reiter, Haibin ZhangCCS 2018 · 255 citations
- Sync HotStuff: Simple and Practical Synchronous State Machine ReplicationIttai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren et al.S&P 2020 · 240 citations
- Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold SignaturesEleftherios Kokoris-Kogias, Dahlia Malkhi, Alexander SpiegelmanCCS 2020 · 107 citations
- On the Optimality of Optimistic ResponsivenessNibesh Shrestha, Ittai Abraham, Ling Ren, Kartik NayakCCS 2020 · 47 citations
Related papers
- Dumbo: Faster Asynchronous BFT ProtocolsBingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu et al.CCS 2020 · 3 citations
- Falcon: Advancing Asynchronous BFT Consensus for Lower Latency and Enhanced ThroughputXiaohai Dai, Chaozheng Ding, Wei Li, Jiang Xiao et al.VLDB 2025
- ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic PathXiaohai Dai, Bolin Zhang, Hai Jin, Ling RenCCS 2023 · 20 citations
- Chitu: Avoiding Unnecessary Fallback in Byzantine ConsensusRongji Huang, Xiangzhe Wang, Xiaofeng Yan, Lei Fan et al.USENIX ATC 2025 · 3 citations
- DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth NetworksLei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan et al.NSDI 2022 · 120 citations
