Set Byzantine Consensus Decouples Rollup Sequencing from Centralized Control
The research introduces Set Byzantine Consensus to construct a Decentralized Arranger, fundamentally solving rollup centralization by separating transaction content agreement from final ordering.
Set Byzantine Consensus Decentralizes Rollup Sequencing and Data Availability
Set Byzantine Consensus introduces a new primitive for L2s, enabling a decentralized 'arranger' service to eliminate sequencer centralization and censorship risk.
Asymmetric DAG Consensus Unlocks Constant Finality with Local Trust Assumptions
By extending DAG-Rider to use asymmetric quorums, this work achieves constant-time BFT finality under realistic, locally defined trust models.
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.
Secure Timestamp Primitive Rethinks Consensus Fairness in Asynchronous Networks
Researchers introduce a novel, corruption-resistant timestamp primitive, enabling consensus protocols to reliably record transaction submission time, which fundamentally mitigates censorship and MEV risk.
Distributed Threshold Encryption Mitigates MEV for Provably Fair Transaction Ordering
Distributed threshold encryption conceals transaction content from block producers, enforcing fair ordering and eliminating front-running opportunities.
Batch-Processing Mechanism Design Eliminates AMM Arbitrage and MEV Opportunities
This application-layer mechanism achieves arbitrage resilience by batching all transactions, fundamentally removing miner extractable value from AMMs.
Threshold Encryption Eliminates MEV at Consensus Layer
Blockchain Integrated Threshold Encryption cryptographically conceals transaction data until finality, making front-running impossible and securing decentralized finance.
Staked Randomness Secures Rollup Sequencers Preventing Censorship and Centralization
Staked Randomness Sequencer (SRS) uses VRF-weighted stake to select L2 sequencers, eliminating the single point of failure and unlocking true censorship resistance.
Application-Layer Mechanism Design Achieves Strategy Proofness for Automated Market Makers
Researchers devised a new AMM mechanism that uses a constant potential function to eliminate MEV, achieving provable strategy proofness at the application layer.
RediSwap Mechanism Captures MEV and LVR, Redistributing Value to Users and LPs
This mechanism design breakthrough internalizes arbitrage within AMMs, capturing MEV to provide superior execution and fair value distribution.
Fino Protocol Achieves MEV Protection on High-Throughput DAG Consensus
Fino embeds blind order-fairness into DAG-BFT with zero message overhead, securing high-throughput systems against transaction reordering attacks.
Application-Layer Mechanism Design Guarantees Strategy Proofness for AMMs
By shifting MEV mitigation from consensus to smart contract design, a new mechanism guarantees strategy proofness and arbitrage resilience for automated market makers.
Cryptography Circumvents TFM Impossibility for Fair Decentralized Systems
Game theory proves a fundamental impossibility in transaction fee mechanisms, which is solved by cryptographic primitives that enforce fair ordering and privacy.
Cryptographic Fairness: Verifiable Shuffle Mechanism for MEV-Resistant Execution
A Verifiable Shuffle Mechanism cryptographically enforces transaction fairness, eliminating front-running by decoupling ordering from block production.
Active Block Producers Preclude Incentive-Compatible Transaction Fee Mechanisms
An impossibility proof shows no single TFM can align incentives for both users and active MEV-extracting block producers, mandating external design augmentation.
New AMM Mechanism Achieves Arbitrage Resilience and Strategy Proofness
A new AMM mechanism uses a constant potential function to guarantee arbitrage resilience, shifting MEV mitigation to the application layer.
