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.
Falcon Protocol Achieves Low Latency Asynchronous Byzantine Fault Tolerance
A novel Graded Broadcast mechanism bypasses the agreement stage in aBFT, delivering high throughput and low latency under network uncertainty.
Formalizing Subjective Trust Assumptions for Resilient Decentralized Consensus
Introducing asymmetric Byzantine quorum systems, this work formally proves safety and liveness in networks where nodes choose their own trust sets.
Validated Strong BFT Consensus Unlocks Scalable Asynchronous State Machine Replication
A novel Validated Strong BFT model permits leader-based coordination in asynchronous networks, dramatically reducing message complexity for scalable SMR.
Revelation Mechanisms Enforce Truthful Consensus in Proof-of-Stake
A game-theoretic revelation mechanism, triggered by block disputes, establishes a unique subgame perfect equilibrium, eliminating dishonest forks and enhancing PoS security.
Simplex Consensus Achieves Provably Fast, Simple Byzantine Fault Tolerance
This simplified BFT protocol achieves faster finality and the easiest known liveness proof, setting a new standard for decentralized system speed and simplicity.
Sub-Quadratic Broadcast Protocol Re-Defines Dishonest-Majority BFT Communication
A new cryptographic broadcast protocol achieves sub-quadratic communication in dishonest-majority networks, fundamentally scaling BFT consensus.
Asynchronous BFT Achieves Throughput-Oblivious Latency and Censorship Resistance
This new aBFT protocol resolves the fundamental throughput-latency tension by concurrently executing transaction dissemination and agreement, ensuring robust censorship resistance.
Adaptive Byzantine Agreement Achieves Optimal Communication Complexity Based on Actual Faults
This new consensus protocol introduces adaptive communication complexity, scaling its message load to the actual fault count, which is asymptotically optimal for large-scale BFT systems.
