Dumbo-NG: Fast Asynchronous BFT Consensus with Throughput-Oblivious Latency
Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, Zhenfeng Zhang
Abstract
Despite recent progresses of practical asynchronous Byzantinefault tolerant (BFT) consensus, the state-of-the-art designs still suffer from suboptimal performance. Particularly, to obtain maximum throughput, most existing protocols with guaranteed linear amortized communication complexity require each participating node to broadcast a huge batch of transactions, which dramatically sacrifices latency. Worse still, the 𝑓 slowest nodes' broadcasts might never be agreed to output and thus can be censored (where 𝑓 is the number of faults). Implementable mitigation to the threat either uses computationally costly threshold encryption or incurs communication blow-up by letting the honest nodes to broadcast redundant transactions, thus causing further efficiency issues. We present Dumbo-NG, a novel asynchronous BFT consensus (atomic broadcast) to solve the remaining practical issues. Its technical core is a non-trivial direct reduction from asynchronous atomic broadcast to multi-valued validated Byzantine agreement (MVBA) with quality property (which ensures the MVBA output is from honest nodes with 1/2 probability). Most interestingly, the new protocol structure empowers completely concurrent execution of transaction dissemination and asynchronous agreement. This brings about two benefits: (i) the throughput-latency tension is resolved to approach peak throughput with minimal increase in latency; (ii) the transactions broadcasted by any honest node can be agreed to output, thus conquering the censorship threat with no extra cost. We implement Dumbo-NG with using the current fastest GLL+22 MVBA with quality (NDSS'22) and compare it to the state-of-the-art asynchronous BFT with guaranteed censorship resilience including Dumbo (CCS'20) and . Along the way, we apply the techniques from Speeding-Dumbo to DispersedLedger (NSDI'22) and obtain an improved variant of DispersedLedger called sDumbo-DL for comprehensive comparison. Extensive experiments (over up to 64 AWS EC2 nodes across 16 AWS regions) reveal: Dumbo-NG realizes a peak throughput 4-8x over Dumbo, 2-4x over Speeding-Dumbo, and 2-3x over sDumbo-DL (for varying scales); More importantly, Dumbo-NG's latency, which is lowest among all tested protocols, can almost remain stable when throughput grows.
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 3d5ae8c8-94df-4d82-ad7e-15d9b30a58d2Cited by top-tier papers23
- Blockchain CensorshipAnton Wahrstätter, Jens Ernstberger, Aviv Yaish, Liyi Zhou et al.WWW 2024 · 60 citations
- Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As the Pipelined BFTYuan Lu, Zhenliang Lu, Qiang TangCCS 2022 · 49 citations
- Asynchronous Consensus without Trusted Setup or Public-Key CryptographySourav Das, Sisi Duan, Shengqi Liu, Atsuki Momose et al.CCS 2024 · 15 citations
- Autobahn: Seamless high speed BFTNeil Giridharan, Florian Suri-Payer, Ittai Abraham, Lorenzo Alvisi et al.SOSP 2024 · 13 citations
- Optimal Flexible Consensus and its Application to EthereumJoachim Neu, Srivatsan Sridhar, Lei Yang, David TseS&P 2024 · 12 citations
Builds on16
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi et al.CCS 2016 · 974 citations
- Narwhal and Tusk: a DAG-based mempool and efficient BFT consensusGeorge Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander SpiegelmanEuroSys 2022 · 259 citations
- Prism: Deconstructing the Blockchain to Approach Physical LimitsVivek Kumar Bagaria, Sreeram Kannan, David Tse, Giulia Fanti et al.CCS 2019 · 256 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
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
- DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth NetworksLei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan et al.NSDI 2022 · 120 citations
- Falcon: Advancing Asynchronous BFT Consensus for Lower Latency and Enhanced ThroughputXiaohai Dai, Chaozheng Ding, Wei Li, Jiang Xiao et al.VLDB 2025
- Bullshark: DAG BFT Protocols Made PracticalAlexander Spiegelman, Neil Giridharan, Alberto Sonnino, Lefteris Kokoris-KogiasCCS 2022 · 132 citations
