Mohsen Ahmadvand
Zircuit (Monad)
EthCC[9]
Applied cryptography
Proving Less, Verifying More: 3.5× Faster L2 Validity Proofs
Talk
Wednesday, April 1st 2026
10:50 - 11:10
Monroe Stage
Description
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.
EthCC[8]
Zero Knowledge & Cryptography
Optimizing ZK-Rollups: Unlocking Cost-Effective Proving Infrastructure
Talk
Monday, June 30th 2025
10:40 - 11:00
Grant Stage
Description
ZK-rollups scale Ethereum but incur steep proving and gas fees. We propose a constraints-based model unifying TPS and finality to reduce overhead. Using the Z3 solver, we reveal cost-optimal solutions validated by real benchmarks.