Leaderless Epidemic Consensus Protocol Achieves Extreme-Scale Blockchain Decentralization
A new leaderless consensus protocol, leveraging epidemic communication, dramatically improves throughput and latency for extreme-scale decentralized networks.
Compiler Security Proof Unifies Formal Methods for Distributed Cryptography
This compiler security proof unifies formal methods to synthesize complex, secure distributed cryptographic protocols from simple sequential code, dramatically reducing implementation errors.
Dynamic Block Rewards Solve Consensus Timing Games and Restore Responsiveness
A new dynamic reward model eliminates selfish validator timing games, proving responsive consensus is possible through incentive alignment.
L1 Proposers Decentralize Rollup Sequencing Using Delegation and Preconfirmations
Based sequencing leverages the L1 validator set's economic security to credibly neutralize L2 sequencers, unlocking trust-minimized interoperability and high-performance preconfirmations.
Quantifying Fairness Granularity Mitigates MEV in Rollup Transaction Ordering
This mechanism introduces fairness granularity to FCFS sequencing, neutralizing network latency advantages and deterring spam for equitable transaction inclusion.
Proof of Quantum Work Secures Blockchain against Classical Intractability
A new consensus mechanism leverages quantum supremacy to create energy-efficient, classically intractable proof-of-work, fundamentally securing the next generation of decentralized systems.
Setchain Decouples Transaction Order for Massive Throughput Gains
The Setchain primitive relaxes strict total ordering into unordered epochs, enabling parallel processing for orders of magnitude higher throughput and sub-4-second finality.
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.
Post-Quantum Accumulators Enable Logarithmic Stateless Verification
Research introduces Isogeny-Based Accumulators, a post-quantum primitive that achieves logarithmic proof size for set membership, fundamentally securing stateless clients.
