Automated Liveness Verification Reduces Proof Burden for Distributed Protocols
LVR soundly reduces complex liveness proofs to simpler safety property checks using automated ranking function synthesis, accelerating foundational protocol verification.
Formalizing Accountable Liveness for Provable Consensus Security and Validator Punishment
Introducing Accountable Liveness and the $x$-partially-synchronous model to formally identify and punish consensus-stalling nodes, strengthening BFT security.
Asymmetric Trust DAG Consensus Achieves Constant-Round Asynchronous Agreement
This research introduces the first DAG-based consensus using asymmetric quorums, allowing nodes' subjective trust assumptions to secure high-performance asynchronous protocols.
Adaptive Byzantine Agreement Achieves Optimal Communication Complexity by Tracking Real Faults
The new BFT protocol dynamically scales communication cost based on actual faults, overcoming classic $O(n^2)$ bounds for truly scalable decentralized systems.
Epidemic Consensus Protocol Scales Blockchains by Eliminating Fixed Leaders
The Blockchain Epidemic Consensus Protocol (BECP) achieves probabilistic convergence without leaders, fundamentally unlocking massive-scale decentralized network architecture.
Uncertified DAG Consensus Protocol Achieves Optimal Three-Round Latency
Mysticeti-C is the first DAG-based Byzantine consensus protocol to reach the theoretical lower bound of three message rounds, enabling sub-second finality.
Deterministic Bounds Secure Committee Selection beyond Probabilistic Guarantees
A new cryptographic sortition model introduces deterministic bounds on adversarial committee influence, enabling smaller, more efficient, and verifiably secure consensus groups.
