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.
Application-Layer Mechanism Design Achieves Provable MEV Elimination and Strategy Proofness
A novel AMM mechanism batch-processes transactions using a constant potential function, shifting MEV mitigation from consensus to application logic for provable incentive compatibility.
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.
Cross-Chain Arbitrage Centralizes MEV, Threatening Liveness and Finality Risks
Empirical analysis reveals cross-chain arbitrage drives vertical integration of sequencing, concentrating economic power and escalating systemic risks.
Decoupled Execution Separates Consensus from Verifiable State Commitment
Decoupled Execution separates probabilistic ordering from deterministic state execution, allowing independent scaling of throughput and storage capacity.
SAKA Mechanism Solves Incentive-Compatibility for Active Block Producers
Introducing the SAKA mechanism, this work circumvents TFM impossibility results by integrating MEV searchers to align incentives and guarantee approximate welfare.
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.
Time-Locked Commit-Reveal Ordering Fundamentally Secures Transaction Sequencing against MEV
Enforcing transaction ordering on encrypted, time-locked commitments eliminates content-based front-running, guaranteeing fair execution and market integrity.
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.
