Icarus: Achieving Performant Asynchronous BFT with Only Optimistic Paths
Xiaohai Dai, Yiming Yu, Sisi Duan, Rui Hao, Jiang Xiao, Hai Jin
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper13
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi 等CCS 2016 · 被引用 974 次
- Narwhal and Tusk: a DAG-based mempool and efficient BFT consensusGeorge Danezis, Lefteris Kokoris-Kogias, Alberto Sonnino, Alexander SpiegelmanEuroSys 2022 · 被引用 259 次
- BEAT: Asynchronous BFT Made PracticalSisi Duan, Michael K. Reiter, Haibin ZhangCCS 2018 · 被引用 255 次
- Sync HotStuff: Simple and Practical Synchronous State Machine ReplicationIttai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren 等S&P 2020 · 被引用 240 次
- Bullshark: DAG BFT Protocols Made PracticalAlexander Spiegelman, Neil Giridharan, Alberto Sonnino, Lefteris Kokoris-KogiasCCS 2022 · 被引用 132 次
相关 Paper
- Ipotane: Balancing the Good and Bad Cases of Asynchronous BFTXiaohai Dai, Chaozheng Ding, Hai Jin, Julian Loss 等NDSS 2026 · 被引用 3 次
- Bolt-Dumbo Transformer: Asynchronous Consensus As Fast As the Pipelined BFTYuan Lu, Zhenliang Lu, Qiang TangCCS 2022 · 被引用 49 次
- Flexible Advancement in Asynchronous BFT ConsensusShengyun Liu, Wenbo Xu, Chen Shan, Xiaofeng Yan 等SOSP 2023 · 被引用 19 次
- Falcon: Advancing Asynchronous BFT Consensus for Lower Latency and Enhanced ThroughputXiaohai Dai, Chaozheng Ding, Wei Li, Jiang Xiao 等VLDB 2025
- ParBFT: Faster Asynchronous BFT Consensus with a Parallel Optimistic PathXiaohai Dai, Bolin Zhang, Hai Jin, Ling RenCCS 2023 · 被引用 20 次
