Optimal-Complexity Asynchronous Byzantine Agreement Achieves Near-Optimal Resilience
A novel hash-based protocol simultaneously achieves constant-time consensus and near-optimal Byzantine fault tolerance, resolving a core distributed systems tradeoff.
