Evolution of Optimistic Rollup proofs
summary
Compares concrete proof designs: interactive bisection vs non‑interactive ZK methods, how EIP-4844 changes data‑availability costs and therefore proof size, and what actually runs today — a Go off‑chain prover plus an on‑chain Solidity verifier that can prove an OP stack claim for a real network but is not widely deployed. Describes a minimal proof VM, Canon MIPS VM, a planned RISC‑V alternative, the pre-image oracle interface, experimental OP program tooling, and that Arbitrum’s fraud‑proof path is already deployed while other proofs remain experimental.
AI-written summary · about
chapters (11)
- 0:00Introduction to fault proofs
- 1:04Mechanism of fault proofs
- 2:29Rollup architecture actors
- 4:46State transition process
- 7:49Security and client diversity
- 10:53History of scaling solutions
- 13:16OP stack and virtual machines
- 16:21Technical architecture design
- 19:15Canon and MIPS proofing
- 22:15Future and ZK integration
- 25:18Q&A session
related talks
01h 09mProofs - Practice 1
01h 07mProofs - Practice 2
28mThe wild world of Web3 rollups
44mTooling for building zkEVM: PIL and Circom
20mProvers Networks from First Principle
39mPrivacy and Evolution of SNARKs
33mAn Introduction to Zero Knowledge Proofs
53mProofs Without Evidence: Assurance on the Blockchain and Other Applications