Optimal Latency Consensus Achieves $2delta$ Communication by Eliminating Inter-Replica Messaging
A new consensus notion, Pod, eliminates inter-replica communication to achieve physically optimal $2delta$ latency, unlocking ultra-fast, censorship-resistant distributed applications.
Prioritized Committee Mechanism Achieves Optimal Asynchronous Byzantine Agreement Complexity
A new committee-based protocol achieves simultaneous optimal time, message, and communication complexity for foundational asynchronous consensus.
Concurrent BFT Decouples Throughput and Latency, Eliminating Censorship
A new asynchronous BFT protocol concurrently executes dissemination and agreement, resolving the throughput-latency tradeoff and guaranteeing censorship resistance.
Optimal Asynchronous Byzantine Agreement Achieves Quadratic Communication Efficiency
A novel committee-based protocol reduces asynchronous Byzantine agreement communication from cubic to quadratic, enabling practical fault-tolerant state machine replication.
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.
Threshold Cryptography Secures Byzantine Consensus with Strong Order-Fairness
Themis introduces a threshold-encrypted commit-and-reveal scheme to enforce transaction order based on submission time, mitigating front-running with optimal linear complexity.
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.
Deterministic Bounds Secure Small Consensus Committees for Scalable Ledgers
New cryptographic sortition provides deterministic security bounds on adversarial influence, enabling constant-sized, efficient consensus committees.
Graded Common Subset Enables Linear Asynchronous Byzantine Consensus
Introducing the Graded Common Subset, this breakthrough mechanism achieves linear communication complexity, unlocking highly scalable, fully asynchronous Byzantine consensus for global decentralized systems.
