Asynchronous Partial Vector Agreement Enables Constant-Round Error-Free Byzantine Consensus
Introducing Asynchronous Partial Vector Agreement, a new primitive that enables information-theoretically secure Byzantine consensus with optimal constant-time round complexity.
Shunning Secret Sharing Enables Optimal Asynchronous Agreement against General Adversaries
A novel Shunning Secret Sharing primitive enables the first almost-surely terminating Byzantine Agreement protocol secure against general, computationally-unbounded adversaries.
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.
Prioritized Byzantine Agreement Achieves Optimal Asynchronous Consensus Complexity
Prioritized MVBA introduces a committee selection primitive to slash communication complexity from cubic to quadratic, enabling truly scalable asynchronous consensus.
Prioritized Committee Mechanism Achieves Optimal Asynchronous Byzantine Agreement Complexity
A new committee-based protocol achieves simultaneous optimal time, message, and communication complexity for foundational asynchronous consensus.
