Asymmetric Trust DAG Consensus Achieves Constant-Time Finality
The new common core primitive enables asynchronous DAG consensus to achieve constant-time finality under heterogeneous, asymmetric trust assumptions.
Irrational Resilience Thresholds Characterize Optimal Latency for Sleepy Consensus
Researchers found that optimal consensus latency in dynamic systems is governed by irrational thresholds, like the Golden Ratio, redefining security limits.
Epidemic Consensus Protocol Unlocks Extreme-Scale, Leaderless Blockchain Decentralization
The Blockchain Epidemic Consensus Protocol (BECP) re-engineers distributed agreement using probabilistic message dissemination, enabling extreme-scale, leaderless network security.
Practical Asynchronous BFT Protocol Achieves High Performance and Simplicity
Alea-BFT uses a two-stage pipeline with a designated leader to combine classical BFT efficiency with asynchronous network resilience, enabling practical adoption.
Validated Strong Consensus Protocol Simplifies Asynchronous Blockchain Architecture
A new BFT model allows asynchronous leader-based coordination, achieving linear view changes and making large-scale asynchronous ledgers practical.
Revelation Mechanisms Enforce Truthful Consensus in Proof-of-Stake Networks
Mechanism design introduces revelation games to Proof-of-Stake, ensuring a unique truthful equilibrium that fundamentally mitigates coordination failures and dishonest forks.
Verifiable Functions Forge Decentralized Consensus Eliminating Predictability and Centralization
PoVF introduces a novel consensus mechanism combining two verifiable functions to guarantee provably fair leader election and eliminate centralization risk.
Strong Byzantine Agreement Achieves Adaptive Word Complexity for Scalable Consensus
The STRONG protocol resolves the quadratic communication cost of Byzantine Agreement by achieving adaptive word complexity, making consensus practically viable for large-scale distributed systems.
Hybrid Synchronous BFT Protocol Achieves Fifteen Times Lower Latency
The new hybrid synchronous system model differentiates message size for safety and liveness, enabling Byzantine Fault Tolerant protocols to dramatically reduce latency for high-performance decentralized systems.
Epidemic Consensus Protocol Unlocks Fully Decentralized Extreme-Scale Blockchain Systems
The Blockchain Epidemic Consensus Protocol (BECP) uses local information exchange to achieve global agreement, fundamentally solving the scalability challenge for massively decentralized networks.
Adaptive Byzantine Agreement Achieves Optimal Communication Based on Actual Faults
Adaptive Byzantine Agreement minimizes consensus overhead by scaling communication complexity to the actual number of network faults, not the theoretical maximum.
New Lower Bounds Define Communication Limits for Dishonest-Majority Broadcast Protocols
This research establishes fundamental communication lower bounds for randomized Byzantine broadcast in dishonest-majority networks, framing the ultimate scalability limits.
Adaptive Byzantine Agreement Achieves Optimal Fault-Parameterized Communication
Foundational consensus theory bypasses the quadratic communication lower bound, proving scalability can be proportional to actual network faults.
Signature-Free Asynchronous Byzantine Agreement Achieves Optimal Communication Complexity
This new signature-free asynchronous Byzantine agreement protocol achieves the theoretical optimal communication complexity for unauthenticated consensus.
Epidemic Consensus Protocol Unlocks Extreme-Scale Decentralization
A new consensus protocol leveraging epidemic-style communication eliminates fixed validators, achieving superior throughput and latency for extreme-scale networks.
Post-Quantum Cryptography Secures Blockchain Consensus against Quantum Threats
Integrating NIST-standardized lattice-based cryptography into consensus algorithms is the necessary architectural shift ensuring long-term ledger security against future quantum adversaries.
Efficient Validated Agreement Bridges Complexity Gap for Secure State Replication
New signature-free validated Byzantine agreement protocols achieve optimal bit complexity, securing progress and external validity for high-performance state machine replication.
New Asynchronous Key Generation Protocol Boosts Decentralized Security Efficiency
A novel Asynchronous Distributed Key Generation protocol drastically lowers the computational cost of threshold cryptosystems, enabling robust, fast decentralized key management.
Zero-Knowledge Proof of Training Secures Decentralized Federated Learning
Researchers introduced Zero-Knowledge Proof of Training, a zk-SNARK-based consensus that privately validates machine learning contributions, resolving the privacy-efficiency trade-off in decentralized AI.
Optimistic Byzantine Agreement Achieves Linear Communication Complexity for Scalability
This optimistic consensus design fundamentally challenges the quadratic communication lower bound, enabling optimal scalability for distributed state machine replication.
Hybrid BFT Model Achieves Low-Latency Synchronous Consensus
AlterBFT introduces a hybrid synchronous model, leveraging empirical message size latency to dramatically reduce consensus delay in distributed systems.