Paper 2023/1660

FaBFT: Flexible Asynchronous BFT Protocol Using DAG

Yu Song, Shanghai Jiao Tong University
Yu Long, Shanghai Jiao Tong University
Xian Xu, East China University of Science and Technology
Dawu Gu, Shanghai Jiao Tong University

The Byzantine Fault Tolerance (BFT) protocol is a long-standing topic. Recently, a lot of efforts have been made in the research of asynchronous BFT. However, the existing solutions cannot adapt well to the flexible network environment, and suffer from problems such as high communication complexity or long latency. To improve the efficiency of BFT consensus in flexible networks, we propose FaBFT. FaBFT's clients can make their own assumptions about the network conditions, and make the most of their networks based on different network assumptions. We also use the BlockDAG structure and an efficient consistent broadcast protocol to improve the concurrency and reduce the number of steps in FaBFT. The comparison with other asynchronous BFT protocols shows that FaBFT has lower complexity and cancels the dependency on the view change. We prove that FaBFT is an atomic broadcast protocol in the flexible networks.

Available format(s)
Cryptographic protocols
Publication info
Byzantine Fault Tolerance ProtocolAsynchronous NetworkFlexible ConsensusDAG
Contact author(s)
sy_121 @ sjtu edu cn
longyu @ sjtu edu cn
xuxian @ ecust edu cn
dwgu @ sjtu edu cn
2023-10-27: last of 2 revisions
2023-10-26: received
See all versions
Short URL
Creative Commons Attribution-NonCommercial


      author = {Yu Song and Yu Long and Xian Xu and Dawu Gu},
      title = {FaBFT: Flexible Asynchronous BFT Protocol Using DAG},
      howpublished = {Cryptology ePrint Archive, Paper 2023/1660},
      year = {2023},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.