From Few to Many Faults: Optimal Adaptive Byzantine Agreement
New protocol achieves consensus with optimal message and round complexity, adapting to actual faults.
Deep Dive
Researchers Andrei Constantinescu, Marc Dufay, Anton Paramonov, and Roger Wattenhofer published 'From Few to Many Faults: Optimal Adaptive Byzantine Agreement.' Their deterministic protocol achieves optimal O(n·(f+1)) communication complexity and O(f+1) round complexity for synchronous systems with t < n/2. It adapts efficiency to the actual number f of Byzantine faults, unlike previous fixed-cost approaches. This enables more scalable and resilient distributed consensus for blockchains and cloud systems.
Why It Matters
Enables more efficient and scalable blockchain consensus and fault-tolerant cloud infrastructure by reducing communication overhead.