Set Byzantine Consensus Decouples Sequencing and Data Availability for L2 Rollups
Set Byzantine Consensus (SBC) enables a Decentralized Arranger to jointly manage L2 transaction inclusion and data availability, eliminating centralized sequencers.
Optimal DAG BFT Achieves Theoretical Minimum Latency
Mysticeti-C, a new DAG-BFT, achieves the theoretical three-round latency lower bound by eliminating block certification, unifying high throughput with instant finality.
Decentralized Rollup Sequencers Achieve Liveness and Censorship Resistance via Set Consensus
The Arranger primitive, built on Set Byzantine Consensus, eliminates the L2 centralization bottleneck, securing transaction ordering and liveness.
Algorithm NECTAR Secures Distributed Systems against Byzantine Partition Attacks
NECTAR introduces a Byzantine-fault-tolerant partition detection primitive, fundamentally securing consensus protocols against network segmentation attacks and enhancing liveness.
Mechanism Design Secures Decentralized Zero-Knowledge Prover Networks
Research translates ZK proving from a centralized bottleneck into a competitive, permissionless market, ensuring modular stack liveness and cost efficiency.
Decentralizing ZK-Rollup Proving with Verifiable Stake-Weighted Auctions
A Verifiable Prover Auction leverages stake and randomness to decentralize ZK-Rollup proof generation, mitigating censorship and single-point-of-failure risks.
L1 Proposers Decouple Rollup Sequencing for Maximum Decentralization
The Based Sequencing model shifts rollup transaction ordering to the L1 validator set, fundamentally inheriting L1 security and eliminating sequencer centralization risk.
Decoupling Finality and Verification Using Asynchronous Succinct State Proofs
Asynchronous Succinct State Proofs decouple high-latency state verification from fast consensus, achieving immediate finality and massive throughput scaling.
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.
