Adaptive Byzantine Agreement Achieves Optimal Communication Complexity by Tracking Real Faults
The new BFT protocol dynamically scales communication cost based on actual faults, overcoming classic $O(n^2)$ bounds for truly scalable decentralized systems.
Sparse Network Byzantine Agreement Achieves Near-Linear Fault Tolerance
A new fully-distributed protocol utilizes Byzantine Random Walks to achieve near-linear fault tolerance in sparse networks, fundamentally securing real-world peer-to-peer architectures.
Adaptive Byzantine Agreement Achieves Optimal Fault-Parameterized Communication
Foundational consensus theory bypasses the quadratic communication lower bound, proving scalability can be proportional to actual network faults.
