Practical Asynchronous BFT Achieves Superior Performance through Designated Leader Pipelining
This protocol merges leader-driven efficiency with asynchronous resilience, creating a simple, high-performance BFT mechanism for real-world decentralized systems.
Censorship Resistance Inevitably Requires Two Additional Consensus Rounds
Formalizing Censorship Resistant Byzantine Broadcast proves a fundamental, two-round latency lower bound for protocols that eliminate leader-based censorship.
Formalizing Accountable Liveness for Provable Consensus Security and Validator Punishment
Introducing Accountable Liveness and the $x$-partially-synchronous model to formally identify and punish consensus-stalling nodes, strengthening BFT security.
Unifying Consensus Resilience Bounds under Adversary Majority
This research systematizes 16 consensus models to resolve conflicting security bounds, demonstrating safety up to 99% adversarial stake.
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.
Accountable Liveness Formalizes Proof-of-Stake Slashing for Network Stalling
A new theoretical model proves the conditions for formally punishing validators who stall transaction finality, strengthening PoS security foundations.
Accountable Safety Decouples Liveness and Finality in Proof-of-Stake Consensus
This research introduces Accountable Safety, a new PoS property that guarantees finality or provides cryptographic proof of validator misbehavior under minimal synchrony.
Formalizing Economic Security with Expensive to Attack in Absence of Collapse
A new EAAC property formally quantifies the economic security of consensus, proving that targeted slashing is only possible under strong synchronous network assumptions.
Formalizing Liveness Accountability Requires Honest Majority and Majority Synchrony
New theoretical framework precisely defines when and how consensus protocols can cryptographically blame nodes for stalling transaction finality.
