Adaptive Byzantine Agreement Achieves Optimal Communication Complexity with Few Faults
A new Byzantine Agreement protocol achieves optimal $O(n+t cdot f)$ adaptive communication complexity, scaling cost by actual faults, not maximum potential faults.
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.
