Paper 2024/653

Ipotane: Balancing the Good and Bad Cases of Asynchronous BFT

Xiaohai Dai, Huazhong University of Science and Technology
Chaozheng Ding, Huazhong University of Science and Technology
Hai Jin, Huazhong University of Science and Technology
Julian Loss, CISPA Helmholtz Center for Information Security
Ling Ren, University of Illinois at Urbana-Champaign
Abstract

State-of-the-art asynchronous Byzantine Fault Tolerance (BFT) protocols integrate a partially-synchronous optimistic path. Their ultimate goal is to match the performance of a partially-synchronous protocol in favorable situations and that of a purely asynchronous protocol in unfavorable situations. While prior works have excelled in favorable situations, they fall short when conditions are unfavorable. To address these shortcomings, a recent work, Abraxas (CCS'23), retains stable throughput in all situations but incurs very high worst-case latency in unfavorable situations due to slow detection of optimistic path failures. Another recent work, ParBFT (CCS'23) ensures good latency in all situations but suffers from reduced throughput in unfavorable situations due to the use of extra Asynchronous Binary Agreement (ABA) instances. We propose Ipotane, a protocol that attains performance comparable to partially-synchronous protocols in favorable situations and to purely asynchronous ones in unfavorable situations, in terms of both throughput and latency. Ipotane also runs two paths simultaneously: 2-chain HotStuff as the optimistic path and a new primitive Dual-functional Byzantine Agreement (DBA) for the pessimistic path. DBA packs the functionalities of biased ABA and Validated Asynchronous Byzantine Agreement (VABA). In Ipotane, each replica inputs 0 to DBA if its optimistic path is faster, and 1 if its pessimistic path is faster. DBA’s ABA functionality promptly signals the optimistic path’s failure by outputting 1, ensuring Ipotane’s low latency in unfavorable situations. Meanwhile, Ipotane executes DBA instances to continuously produce pessimistic blocks through their VABA functionality. Upon detecting a failure, Ipotane commits the last two pessimistic blocks to maintain high throughput. Moreover, Ipotane leverages DBA’s biased property to ensure the safety of committing pessimistic blocks. Extensive experiments validate Ipotane’s high throughput and low latency across all situations.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Published elsewhere. NDSS’26
DOI
10.14722/ndss.2026.230003
Keywords
Byzantine fault toleranceByzantine generalsconsensusblockchain
Contact author(s)
xhdai @ hust edu cn
chaozhengding @ hust edu cn
hjin @ hust edu cn
loss @ cispa de
renling @ illinois edu
History
2025-09-19: last of 7 revisions
2024-04-29: received
See all versions
Short URL
https://ia.cr/2024/653
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/653,
      author = {Xiaohai Dai and Chaozheng Ding and Hai Jin and Julian Loss and Ling Ren},
      title = {Ipotane: Balancing the Good and Bad Cases of Asynchronous {BFT}},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/653},
      year = {2024},
      doi = {10.14722/ndss.2026.230003},
      url = {https://eprint.iacr.org/2024/653}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.