.png){kind=icon}
.png){kind=icon}
Return
Aurelia: Dynamic asynchronous BFT with bandwidth-efficient bootstrapping
.png){kind=icon}
OA
AI
DOI：10.1016/j.hcc.2026.100397.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Compressible Checkpoint Mechanism: We propose a compressible checkpoint mechanism utilizing BLS signature aggregation to help new participants in asynchronous dynamic BFT systems authenticate valid configurations with lower communication overhead. This method reduces the number of signatures in the checkpoint chain from O(T) to 1 (where T is the number of reconfigurations) and reduces the total chain size to approximately one-third of the baseline. • Bandwidth-Efficient State Synchronization: We introduce a Verifiable Information Dispersal (VID) based mechanism integrating erasure coding and Merkle accumulators, decoupling data availability from replication and reducing the communication complexity of history retrieval from O(nT|B|) to O(T|B|) for each party. • Integrated Dynamic BFT Protocol: We integrate the optimized bootstrapping mechanisms into the asynchronous dynamic BFT framework, with existing Asynchronous Common Subset and Asynchronous Distributed Key Reconfiguration. This holistic design achieves significant bandwidth savings under long-term execution, improving the system’s scalability and sustainability for open networks.
Keywords:
Asynchronous BFT
Dynamic participation
Signature aggregation
State synchronization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
H
IF:
3
Papers:
239
Citations:
407
View more organizations