Uncertified DAG Consensus Achieves Optimal Three-Round Finality and Sub-Second Latency
The Mysticeti protocol uses uncertified DAG blocks and a novel commit rule to reach the theoretical three-round latency limit, unlocking true sub-second finality for high-throughput chains.
LLM Agents Shatter Classical BFT Bound via Confidence-Weighted Consensus
Confidence Probing-based Weighted BFT leverages LLM agents' inherent skepticism to exceed the classical $f < n/3$ fault tolerance limit, fundamentally enhancing consensus security.
Random Asynchronous Model Overcomes FLP Impossibility for Consensus Security
Redefining the asynchronous network model with non-adversarial scheduling circumvents the classic FLP impossibility, enabling provably live BFT consensus.
Mechanism Design Enforces Truthful Consensus Equilibrium in Proof-of-Stake
A game-theoretic revelation mechanism creates a unique, subgame perfect equilibrium for validating nodes to propose truthful blocks, structurally mitigating dishonest forking risks.
Decoupled Quorums Accelerate BFT Consensus and Transaction Finality
Minimmit, a new BFT protocol, separates the small quorum for view progression from the finality quorum, accelerating distributed systems.
Leaderless Asynchronous Consensus Achieves Optimal Complexity and Two-Round Finality
This leaderless BFT protocol, using a novel $O(n)$ threshold signature, achieves optimal resilience, linear communication, and two-round finality.
Cross-Cluster Consistent Broadcast Enables Efficient Replicated State Machine Interoperability
The new Cross-Cluster Consistent Broadcast (C3B) primitive and PICSOU protocol solve inter-RSM communication, achieving 24x better performance for decentralized systems.
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.
Asymmetric Trust DAG Consensus Achieves Constant-Round Asynchronous Agreement
This research introduces the first DAG-based consensus using asymmetric quorums, allowing nodes' subjective trust assumptions to secure high-performance asynchronous protocols.
