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.
Revelation Mechanisms Enforce Truthful Consensus Equilibrium
Mechanism design introduces dispute-triggered revelation protocols into PoS, ensuring validators propose truthful blocks as the unique subgame perfect equilibrium, fundamentally enhancing security and scalability.
Efficient Validated Agreement Bridges Complexity Gap for Secure State Replication
New signature-free validated Byzantine agreement protocols achieve optimal bit complexity, securing progress and external validity for high-performance state machine replication.
Deterministic Bounds Secure Constant-Size Committees, Strengthening Decentralized Consensus Architecture
Foundational research replaces probabilistic committee security with deterministic bounds, enabling smaller, more efficient consensus groups for scalable systems.
Proof of Crowdsourcing Work Transforms Wasted Mining Energy into Useful Computation
Proof of Crowdsourcing Work (PoCW) leverages miner computation for general crowdsourced tasks, establishing a dual-purpose, energy-efficient consensus mechanism.
Rondo Protocol Achieves Optimal Linear Complexity for Decentralized Randomness Beacon Sharing
Rondo introduces batched asynchronous verifiable secret sharing with partial output, cutting message complexity to linear for scalable, reconfigurable randomness beacons.
Quadratic BFT Consensus Achieves Optimal Communication Complexity
SQuad introduces RareSync, a novel view synchronization primitive that reduces partially synchronous BFT communication complexity to the theoretical quadratic minimum.
Adaptive Byzantine Agreement Reduces Communication Complexity Based on Actual Faults
A new synchronous protocol achieves adaptive word complexity in Byzantine Agreement, scaling communication with actual faults to unlock efficient, fault-tolerant consensus.
Scalable Distributed Randomness via Insertion-Secure Accumulators
Research demonstrates a scalable distributed randomness beacon by enforcing verifiable inclusion of all entropy contributions using insertion-secure accumulators.
