Autobahn: Seamless high speed BFT
Neil Giridharan, Florian Suri-Payer, Ittai Abraham, Lorenzo Alvisi, Natacha Crooks
Abstract
Today's practical, high performance Byzantine Fault Tolerant (BFT) consensus protocols operate in the partial synchrony model. However, existing protocols are inefficient when deployments are indeed partially synchronous. They deliver either low latency during fault-free, synchronous periods (good intervals) or robust recovery from events that interrupt progress (blips). At one end, traditional, view-based BFT protocols optimize for latency during good intervals, but, when blips occur, can suffer from performance degradation (hangovers) that can last beyond the return of a good interval. At the other end, modern DAG-based BFT protocols recover more gracefully from blips, but exhibit lackluster latency during good intervals. To close the gap, this work presents Autobahn, a novel high-throughput BFT protocol that offers both low latency and seamless recovery from blips. By combining a highly parallel asynchronous data dissemination layer with a low-latency, partially synchronous consensus mechanism, Autobahn (𝑖) avoids the hangovers incurred by traditional BFT protocols and (𝑖𝑖) matches the throughput of state of the art DAG-based BFT protocols while cutting their latency in half, matching the latency of traditional BFT protocols.
• Computer systems organization → Dependable and fault-tolerant systems and networks; • Security and privacy → Distributed systems security.
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 c2198cdf-949b-437b-9158-89a86ec7d988Cited by top-tier papers15
- Shoal++: High Throughput DAG BFT Can Be Fast and Robust!Balaji Arun, Zekun Li, Florian Suri-Payer, Sourav Das et al.NSDI 2025 · 37 citations
- HotStuff-1: Linear Consensus with One-Phase SpeculationDakai Kang, Suyash Gupta, Dahlia Malkhi, Mohammad SadoghiSIGMOD 2025 · 23 citations
- Fides: Secure and Scalable Asynchronous DAG Consensus via Trusted ComponentsShaokang Xie, Dakai Kang, Hanzheng Lyu, Jianyu Niu et al.VLDB 2026 · 8 citations
- Chitu: Avoiding Unnecessary Fallback in Byzantine ConsensusRongji Huang, Xiangzhe Wang, Xiaofeng Yan, Lei Fan et al.USENIX ATC 2025 · 3 citations
- DAG of DAGs: Order-Fairness Made PracticalHeena Nagda, Sidharth Sankhe, Sakshi Sinha, Keon Attarha et al.SIGMOD 2026 · 2 citations
Builds on15
- 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
- Bullshark: DAG BFT Protocols Made PracticalAlexander Spiegelman, Neil Giridharan, Alberto Sonnino, Lefteris Kokoris-KogiasCCS 2022 · 132 citations
Related papers
- Ipotane: Balancing the Good and Bad Cases of Asynchronous BFTXiaohai Dai, Chaozheng Ding, Hai Jin, Julian Loss et al.NDSS 2026 · 3 citations
- Sync HotStuff: Simple and Practical Synchronous State Machine ReplicationIttai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren et al.S&P 2020 · 240 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
- DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth NetworksLei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan et al.NSDI 2022 · 120 citations
