Decoupled Time-Lock Commitments Enforce Fair Transaction Ordering
Introducing Decoupled Time-Lock Commitments, a new primitive that uses VDFs to cryptographically enforce a future transaction reveal, fundamentally eliminating proposer-side MEV.
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.
Adaptive Byzantine Agreement Optimizes Communication Complexity by Fault Count
This new BFT protocol dynamically scales communication cost based on actual faults, fundamentally improving the efficiency and practicality of decentralized consensus.
Mechanism Design Enforces Truthful Proof-of-Stake Consensus and Scalability
A new revelation mechanism, triggered by consensus disputes, mathematically enforces truthful block proposals to enhance Proof-of-Stake security and throughput.
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.
Graded Dispersal Simplifies BFT Protocols Reducing Complexity and Communication Overhead
Foundational BFT protocols are simplified through Graded Dispersal, a new primitive that cuts communication complexity by 40% and reduces consensus rounds.
Epidemic Consensus Protocol Unlocks Extreme-Scale Decentralization
A new consensus protocol leveraging epidemic-style communication eliminates fixed validators, achieving superior throughput and latency for extreme-scale networks.
Adaptive Byzantine Agreement Achieves Optimal Communication Parameterized by Actual Faults
This protocol introduces adaptive communication complexity to Byzantine Agreement, establishing tight theoretical bounds and optimizing consensus efficiency for real-world fault conditions.