Verifiable Delay Functions Secure Decentralized Randomness and Consensus Integrity
The Verifiable Delay Function is a cryptographic time-lock, enforcing a mandatory sequential computation to generate unbiasable randomness, thereby securing consensus leader election.
Optimal DAG BFT Achieves Theoretical Minimum Latency
Mysticeti-C, a new DAG-BFT, achieves the theoretical three-round latency lower bound by eliminating block certification, unifying high throughput with instant finality.
Concurrent Dual-Path Consensus Achieves Single-Round Block Finality
Votor, a new dual-path consensus mechanism, achieves block finality in a single network round-trip, dramatically reducing settlement latency by 32x.
Prudent Decoupling Secures Pipelined BFT Consensus against Liveness Attacks
The pBeeGees protocol decouples block commitment from view-consecutive certificates, resolving critical liveness flaws without adding computational overhead.
Asynchronous BFT Protocol Decouples Agreement to Achieve Low Latency
Falcon protocol introduces Graded Broadcast and partial sorting to bypass BFT's high-latency agreement stage, fundamentally boosting asynchronous throughput and stability.
Decentralized DPoS Sequencing Eliminates Rollup Centralization Risk
DPoS consensus decentralizes Layer 2 sequencers, replacing single points of failure with an elected committee and FCFS ordering for transaction fairness.
Set Byzantine Consensus Decouples Ordering to Decentralize Rollup Arrangers
The decentralized arranger uses Set Byzantine Consensus to agree on transaction sets, eliminating single-point-of-failure in L2 sequencing.
Lattice Verifiable Delay Function Achieves Practical Post-Quantum Consensus Security
Papercraft introduces the first practical lattice-based VDF, securing decentralized randomness and leader election against the imminent threat of quantum adversaries.
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.
