New Lower Bound Solidifies Quadratic Communication Barrier for Byzantine Consensus
This research proves that even randomized Byzantine Agreement protocols require quadratic communication complexity against adaptive adversaries, fundamentally limiting consensus scalability.
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.
Quadratic BFT Consensus Achieves Optimal Communication Complexity
SQuad introduces RareSync, a novel view synchronization primitive that reduces partially synchronous BFT communication complexity to the theoretical quadratic minimum.
Sub-Quadratic Sampling Secures Sharding, Advancing Decentralized Data Availability
A novel sub-quadratic data availability sampling technique enables asymptotically secure sharding, resolving the critical bottleneck for massive blockchain scaling.
