MEV Minimization on L2: Solution Space and Design Constraints
summary
Argues that VDFs and cryptographic time‑locks sit in the practical sweet spot for MEV minimization on L2, outlining two concrete designs: time‑lock on encrypted submissions (hides content during sequencing but requires k openings and faces side‑channel risk) and VDF shuffle of open mempool (computes one delay per block vs k openings and uses VDF randomness to permute orders). Notes a real implementation, Vidu VDF service deployed on mainnet, and plans to add VDF built‑ins to Cairo; tradeoffs and a reconciliation protocol for instant execution plus delayed fairness are demonstrated.
AI-written summary · about
chapters (6)
related talks
18mMEVconomics for Modular Blockchain Stacks
26mWhat's New in MEV
16mMEVeconomics in L2 - A Closer Look at the Sequencer's Role and MEV
23mWhy You Should Be Optimistic About MEV
45mMEVconomic Panel: MEVconomic Security in Liquid and Restaking Protocols
34mPrivacy All the Way Down: Tackling MEV at Different Layers via. Cryptography
18mIt’s My MEV and I Want It Now
09mA2MM: Mitigating Frontrunning, Transaction Reordering and Consensus Instability