Prioritized Broadcast Slashes Asynchronous Consensus Communication Complexity.
A committee-based prioritized broadcast protocol cuts Byzantine consensus communication costs by $O(n)$, unlocking scalable asynchronous state replication.
Formal Analysis Improves Avalanche Consensus Latency and Security Trade-Off
Rigorous analysis of Snow consensus exposes an unfavorable latency-security trade-off, resolved by a protocol modification for superior performance.
Decentralized Fair Sequencing Using Verifiable Delay Functions and Threshold Cryptography
A novel mechanism leverages Verifiable Delay Functions and Threshold Cryptography to enforce first-come, first-served transaction ordering, fundamentally mitigating sequencer MEV risk.
External Adversary Model Secures Sleepy Proof-of-Stake Consensus
This work defines the external adversary model, proving sleepy Proof-of-Stake can securely withstand fully fluctuating node participation.
Biomimetic Sybil-Resistance Enables Four Orders of Magnitude Consensus Speed and Security
The first asymmetric Sybil-resistance method, Proof-of-Balance, adapts biological signaling to allow honest agents to retain network control without matching adversary's budget, yielding a 40,000x security and speed increase.
Formal Rewrites Safely Scale Byzantine Fault Tolerance Protocols Fivefold
A new formal model and rewrite methodology prove that decoupling and partitioning can safely achieve a fivefold throughput increase for BFT protocols.
Mysticeti Achieves Optimal Byzantine Consensus Latency by Uncertified DAGs
This new DAG-based Byzantine consensus protocol reaches the theoretical 3-round latency limit by eliminating explicit block certification, drastically accelerating finality for high-throughput chains.
Leaderless BFT Consensus Secures against Adaptive Adversaries and Centralization
Egalitarian BFT eliminates the predictable single leader, using a cryptographic lottery for simultaneous block proposal to achieve strong security against adaptive adversaries.
Optimal Byzantine Agreement Protocol Minimizes Communication Complexity Adaptively
New authenticated Byzantine agreement protocol achieves optimal $O(ft+t)$ communication complexity by adapting to the actual number of failures, significantly boosting SMR efficiency.
