Proving Less, Verifying More: 3.5× Faster L2 Validity Proofs

Deriving L2 state inside a zkVM is expensive—these pipelines weren't designed for proving. We'll show how sparse techniques cut derivation costs by 6.5× (3.5× overall), using Optimism as a concrete example.