Icarus: Achieving Performant Asynchronous BFT with Only Optimistic Paths
Xiaohai Dai, Yiming Yu, Sisi Duan, Rui Hao, Jiang Xiao, Hai Jin
Abstract
The emergence of blockchain technology has revitalized research interest in Byzantine Fault Tolerant (BFT) consensus, particularly asynchronous BFT due to its resilience against network attacks. To improve the performance of traditional asynchronous BFT, recent studies propose the dual-path paradigm: an optimistic path for efficiency under favorable situations and a pessimistic path-typically implemented through a Multi-valued Validated Byzantine Agreement (MVBA) protocol-to guarantee liveness in unfavorable situations. However, owing to the inherent complexity and inefficiency of the MVBA protocol, existing dual-path protocols exhibit high implementation complexity and poor performance in unfavorable situations. Moreover, the two constituent types within the dual-path paradigm-serial-path and parallel-path-each face additional limitations. Specifically, the serial-path type encounters difficulties in switching between the optimistic and pessimistic paths, whereas the parallel-path type discards blocks from one of the paths, resulting in bandwidth waste and reduced throughput. To address these limitations, we propose Icarus, a single-path asynchronous BFT protocol that exclusively leverages optimistic paths without pessimistic paths. The optimistic path ensures Icarus's efficiency under favorable situations. To guarantee liveness in unfavorable conditions, Icarus employs a rotating-chain mechanism: each node broadcasts a chain of blocks in parallel, and these chains take turns serving as the optimistic path in a round-robin fashion. Since non-faulty nodes' chains continuously grow, once a chain accumulating enough blocks becomes the optimistic path, its blocks can be committed, ensuring liveness even in unfavorable conditions. To maintain consistency during path transitions, Icarus introduces the Two-consecutive-validatedvalue Byzantine Agreement (tcv 2 -BA) protocol, which aligns heights of committed blocks on the previous path. We have verified Icarus's correctness through theoretical analysis and validated its high performance through various experiments.
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 2ae824b2-e739-4715-9372-a149d344b5c0Builds on13
- 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
- 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
- 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
- Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As the Pipelined BFTYuan Lu, Zhenliang Lu, Qiang TangCCS 2022 · 49 citations
- Flexible Advancement in Asynchronous BFT ConsensusShengyun Liu, Wenbo Xu, Chen Shan, Xiaofeng Yan et al.SOSP 2023 · 19 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
