Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As the Pipelined BFT
Yuan Lu, Zhenliang Lu, Qiang Tang
Abstract
An urgent demand of deploying BFT consensus (e.g., atomic broadcast) over the Internet is raised for implementing (permissioned) blockchain services. The deterministic (partial) synchronous protocols can be simple and fast in good network conditions, but are subject to denial-of-service (or even safety vulnerability) when synchrony assumption fails. Asynchronous protocols, on the contrary, are robust against the adversarial network, but are substantially more complicated and slower for the inherent use of randomness. Facing the issues, optimistic asynchronous atomic broadcast (Kursawe-Shoup, 2002; Ramasamy-Cachin, 2005) was proposed to improve the normal-case performance of the slow asynchronous consensus. They run a deterministic fastlane if the network condition remains good, and can fall back to a fully asynchronous protocol via a pace-synchronization mechanism (analog to view-change with asynchronous securities) if the fastlane fails. Unfortunately, existing pace-synchronization directly uses a heavy tool of asynchronous multi-valued validated Byzantine agreement (MVBA). When such fallback frequently occurs in the fluctuating wide-area network setting, the benefits of adding fastlane can be eliminated. We present Bolt-Dumbo Transformer (BDT), a generic framework for practical optimistic asynchronous atomic broadcast. At the core of BDT, we set forth a new fastlane abstraction that is simple and fast, while preparing honest parties to gracefully face potential fastlane failures caused by malicious leader or bad network. This enables a highly efficient pace-synchronization to handle fallback. The resulting design reduces a cumbersome MVBA to a variant of the conceptually simplest binary agreement only. Besides detailed security analyses, we also give concrete instantiations of our framework and implement them. Extensive experiments demonstrate that BDT can enjoy both the low latency of deterministic protocols (e.g. 2-chain version of HotStuff) and the robustness of state-of-the-art asynchronous protocols in practice.
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.
Cited by top-tier papers15
- HotStuff-1: Linear Consensus with One-Phase SpeculationDakai Kang, Suyash Gupta, Dahlia Malkhi, Mohammad SadoghiSIGMOD 2025 · 23 citations
- SharDAG: Scaling DAG-Based Blockchains Via Adaptive ShardingFeng Cheng, Jiang Xiao, Cunyang Liu, Shijie Zhang et al.ICDE 2024 · 20 citations
- Scalable Accountable Byzantine Agreement and BeyondPierre Civit, Daniel Collins, Vincent Gramoli, Rachid Guerraoui et al.S&P 2026 · 4 citations
- Chitu: Avoiding Unnecessary Fallback in Byzantine ConsensusRongji Huang, Xiangzhe Wang, Xiaofeng Yan, Lei Fan et al.USENIX ATC 2025 · 3 citations
- Ipotane: Balancing the Good and Bad Cases of Asynchronous BFTXiaohai Dai, Chaozheng Ding, Hai Jin, Julian Loss et al.NDSS 2026 · 3 citations
Builds on15
- 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
- Practical Asynchronous Distributed Key GenerationSourav Das, Thomas Yurek, Zhuolun Xiang, Andrew Miller et al.S&P 2022 · 136 citations
- DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth NetworksLei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan et al.NSDI 2022 · 120 citations
Related papers
- Speeding Dumbo: Pushing Asynchronous BFT Closer to PracticeBingyong Guo, Yuan Lu, Zhenliang Lu, Qiang Tang et al.NDSS 2022
- Dumbo: Faster Asynchronous BFT ProtocolsBingyong Guo, Zhenliang Lu, Qiang Tang, Jing Xu et al.CCS 2020 · 3 citations
- Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious LatencyYingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang et al.CCS 2022 · 72 citations
- ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic PathXiaohai Dai, Bolin Zhang, Hai Jin, Ling RenCCS 2023 · 20 citations
- Flexible Advancement in Asynchronous BFT ConsensusShengyun Liu, Wenbo Xu, Chen Shan, Xiaofeng Yan et al.SOSP 2023 · 19 citations
