Asynchronous BFT Scalability via Validated Strong Consensus Model
This new BFT consensus model maintains asynchronous security while achieving the linear view change efficiency of partially synchronous protocols.
Probabilistic BFT Achieves Optimal Latency with Sub-Quadratic Message Complexity
By relaxing to a probabilistic security model, ProBFT delivers optimal three-step latency and O(nsqrtn) message complexity, enabling practical BFT scalability.
Optimal Asynchronous BFT Decouples Consensus Cost from Transaction Size
A novel asynchronous BFT protocol achieves optimal communication efficiency by replacing large transaction broadcasts with constant-size feature value acknowledgments.