Dynamic asynchronous Byzantine Fault-Tolerant (BFT) protocols provide strong consistency guarantees in open networks with unbounded communication delays and evolving membership, making them a fundamental building block for long-lived distributed systems. However, efficiently and securely bootstrapping new nodes remains a key scalability obstacle, as existing solutions rely on checkpoint chains with linearly growing collections of threshold signatures and bandwidth-intensive full-state replication.This paper presents Aurelia, a bandwidth-efficient dynamic asynchronous BFT protocol that overcomes these limitations. Aurelia introduces a compressible checkpoint mechanism that aggregates accumulated threshold signatures into a constant-sized proof, effectively compressing the total proof chain size to approximately one-third of the baseline. Furthermore, it employs a distributed state synchronization protocol based on Verifiable Information Dispersal, enabling new nodes to reconstruct historical consensus results without full replication. We show that Aurelia preserves the safety and liveness properties of Atomic Broadcast under a hybrid fault model, while significantly improving the communication efficiency of node joining. These results demonstrate that dynamic asynchronous BFT can be deployed efficiently in long-term, large-scale systems.
原文链接
分享
引用
