Leaderless Asynchronous Consensus Achieves Optimal Speed and Resilience
Ocior, a new leaderless BFT protocol, achieves optimal resilience and two-round finality in asynchronous networks, eliminating leader-based centralization risk.
Dynamic Quorum Consensus Decouples BFT Security and Liveness Overhead
Adaptive Threshold Consensus dynamically adjusts finality quorums, radically minimizing communication complexity for highly decentralized BFT networks.
Optimal Asynchronous Consensus Resilience Using Complexity-Efficient Hash-Based Agreement
A new hash-based Multi-Valued Byzantine Agreement protocol achieves near-optimal fault tolerance with constant time complexity, enabling robust asynchronous consensus.
Leaderless Asynchronous Consensus Achieves Optimal Complexity and Two-Round Finality
This leaderless BFT protocol, using a novel $O(n)$ threshold signature, achieves optimal resilience, linear communication, and two-round finality.
Randomness, Efficiency, and Adaptive Security Form a Consensus Trilemma
New research formalizes a consensus trilemma, proving no protocol can be simultaneously efficient, adaptively secure, and minimize public randomness.
Cryptographic Leader Election Achieves Constant-Time, Fork-Free Block Production
Sassafras employs Ring-VRF and zk-SNARKs for semi-anonymous leader election, ensuring near-fork-free block production with $O(1)$ overhead.
