DAG-Based BFT Protocol Achieves Optimal Latency without Common Primitives
This novel DAG-based BFT protocol achieves optimal three-round latency by eliminating reliable broadcast and common coin primitives, paving the way for hyper-efficient decentralized systems.
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.
Golden Ratio Defines Consensus Speed in Dynamic Networks
New theoretical work reveals that the golden ratio dictates the fault tolerance threshold required to achieve two-round Byzantine consensus in dynamic networks.
Hybrid Synchronous BFT Protocol Achieves Fifteen Times Lower Latency
The new hybrid synchronous system model differentiates message size for safety and liveness, enabling Byzantine Fault Tolerant protocols to dramatically reduce latency for high-performance decentralized systems.
