TY - GEN
T1 - MiAR-BFT
T2 - 26th ACM International Middleware Conference, Middleware 2025
AU - Zhang, Zhenyu
AU - Tong, Xing
AU - Zhang, Zhao
AU - Jin, Cheqing
N1 - Publisher Copyright:
© 2025 Copyright is held by the owner/author(s).
PY - 2025/12/14
Y1 - 2025/12/14
N2 - The leaderless consensus, also known as multi-leader consensus, drives the agreements on multiple blocks independently and simultaneously across instances, enhancing consensus throughput significantly. To resolve the conflicts between transactions, which access the same state, from various instances, a global ordering on these blocks is involved to establish a serializable execution sequence. However, this process suffers from the synchronization among instances, where the faster instances have to align with the delayed ones in each round, raising the overall commit latency. In this study, we propose MiAR-BFT, which achieves asynchronous running of instances by eliminating the round-based global ordering, thereby minimizing the impact of slower instances on overall performance. Additionally, MiAR-BFT exploits a synchronization mechanism to handle the execution of conflicting transactions, ensuring the global consistency without sacrificing the performance. The extensive evaluation confirms the advantage of MiAR-BFT over other state-of-the-art comparisons, reaching up to 3× higher throughput under network fluctuations or node imbalances.
AB - The leaderless consensus, also known as multi-leader consensus, drives the agreements on multiple blocks independently and simultaneously across instances, enhancing consensus throughput significantly. To resolve the conflicts between transactions, which access the same state, from various instances, a global ordering on these blocks is involved to establish a serializable execution sequence. However, this process suffers from the synchronization among instances, where the faster instances have to align with the delayed ones in each round, raising the overall commit latency. In this study, we propose MiAR-BFT, which achieves asynchronous running of instances by eliminating the round-based global ordering, thereby minimizing the impact of slower instances on overall performance. Additionally, MiAR-BFT exploits a synchronization mechanism to handle the execution of conflicting transactions, ensuring the global consistency without sacrificing the performance. The extensive evaluation confirms the advantage of MiAR-BFT over other state-of-the-art comparisons, reaching up to 3× higher throughput under network fluctuations or node imbalances.
KW - blockchain
KW - byzantine fault tolerance
KW - consensus
UR - https://www.scopus.com/pages/publications/105026703360
U2 - 10.1145/3721462.3730954
DO - 10.1145/3721462.3730954
M3 - 会议稿件
AN - SCOPUS:105026703360
T3 - Middleware 2025 - Proceedings of the 26th ACM International Middleware Conference
SP - 228
EP - 240
BT - Middleware 2025 - Proceedings of the 26th ACM International Middleware Conference
PB - Association for Computing Machinery, Inc
Y2 - 15 December 2025 through 19 December 2025
ER -