Optimal Asynchronous Byzantine Agreement Achieves Minimum Communication Complexity
The new multi-valued Byzantine Agreement protocol achieves the theoretical minimum communication complexity, fundamentally improving decentralized system efficiency.
Epidemic Consensus Protocol Scales Blockchain Security beyond Leader-Based Limits
The Blockchain Epidemic Consensus Protocol leverages probabilistic message dissemination to achieve extreme-scale decentralization and superior latency.
Vanishing Polynomial Commitments Enable Post-Quantum Succinct Arguments and Recursive Folding
A novel commitment scheme utilizing vanishing polynomials unlocks the first lattice-based linear-time prover and polylogarithmic verifier succinct arguments.
Proof-Carrying Data Enables Scalable Verifiable Distributed Computation
Proof-Carrying Data is a cryptographic primitive enabling proofs to verify other proofs, compressing arbitrary computation history into a single, constant-size argument.
Uncertified DAG Consensus Achieves Sub-Second Asynchronous Byzantine Finality
This new asynchronous BFT protocol uses an uncertified DAG and a novel commit rule to shatter the latency barrier, enabling sub-second finality at high throughput.
Probabilistic BFT Achieves Optimal Latency with Sub-Quadratic Message Complexity
By relaxing to a probabilistic security model, ProBFT delivers optimal three-step latency and $O(nsqrt{n})$ message complexity, enabling practical BFT scalability.
Leaderless Epidemic Consensus Protocol Scales Decentralized Blockchain Networks
The Blockchain Epidemic Consensus Protocol (BECP) introduces a leaderless, probabilistic convergence model that fundamentally resolves the scalability and message complexity bottlenecks of classical BFT.
Dynamic Byzantine Detection Exceeds Classical One-Third Fault Tolerance
A new two-fold Byzantine consensus algorithm dynamically detects and isolates malicious nodes, fundamentally improving system resilience beyond the one-third fault constraint.
Two-Round DAG Consensus Achieves Ultra-Fast Finality through Security Trade-Off
Odontoceti is the first two-round DAG consensus protocol, leveraging a 20% fault tolerance to deliver sub-second finality and simplify distributed architecture.
