Thanks to Kevaundray Wedderburn, Alex Stokes, Tim Beiko, Mary Maller, Alexander Hicks, George Kadianakis, Dankrad Feist, and Justin Drake for feedback and review.
Ethereum is going each successful connected ZK. Eventually we expect to migrate to utilizing ZK proofs astatine each levels of the stack, from statement furniture signature aggregation to onchain privateness with lawsuit broadside proving, and upgrade the protocol to beryllium simpler and much zk-friendly. But the archetypal measurement volition beryllium an L1 zkEVM.
How we tin vessel an L1 zkEVM successful little than a year
The fastest and safest mode to vessel an L1 zkEVM is to commencement by giving validators the enactment to tally clients that, alternatively than re-executing execution payloads, statelessly verify aggregate (let’s accidental three) proofs generated by antithetic zkVMs each proving antithetic EVM implementations. Because impervious verification is truthful accelerated and impervious size truthful succinct, downloading and verifying aggregate proofs is precise tenable and allows america to use the aforesaid defence successful extent arsenic existing lawsuit diverseness to zkVMs.
For this program to initially verify execution proofs offchain, each we request from the protocol is immoderate signifier of pipelining successful Glamsterdam to let for much proving time.
Initially, we expect fewer validators to tally ZK clients. Over time, their information volition beryllium demonstrated successful production. With the EF besides putting resources into ceremonial verification, specification writing, audits, and bug bounties; we expect adoption volition dilatory increase.
When a supermajority of involvement is comfy moving ZK clients, we tin summation the state bounds to a level that would necessitate validators moving tenable hardware to verify proofs alternatively of re-executing blocks. Once each validators are verifying execution proofs, the aforesaid proofs tin besides beryllium utilized by an EXECUTE precompile for autochthonal zk-rollups.
Defining realtime proving for the L1
Our top vantage successful executing this program is the quality to harness the full zkVM manufacture towards making Ethereum by acold the largest ZK exertion successful the world. Many zkVMs are already proving Ethereum blocks and show breakthroughs are being announced connected a play basis.
In bid to support the security, liveness, and censorship-resistance properties of the L1 the Ethereum Foundation is proposing a standardized explanation of realtime proving for zkVM teams to enactment towards.
On the impervious strategy side, zkVMs targeting realtime proving should purpose for 128 bits of security, which we see the close semipermanent people for Ethereum L1. However, we are consenting to judge a minimum of 100 bits of information successful the archetypal months of deployment, to accommodate short-term engineering challenges successful reaching 128 bits. Proof size should stay nether 300KiB and indispensable not trust connected recursive wrappers that usage trusted setups. We expect impervious systems to determination to 128-bit information by the clip ZK clients are successful accumulation and to further tighten information requirements (e.g. regarding conjectures) arsenic proving clip decreases.
With the existent slot clip of 12 seconds and maximum clip to propagate information crossed the web of ~1.5 seconds, realtime means 10 seconds oregon less. We expect zkVMs to beryllium capable to beryllium astatine slightest 99% of mainnet blocks successful this window, with the process extremity (as good arsenic synthetic DOS vectors) mitigated successful aboriginal hard forks.
In bid to support the highest levels of liveness and censorship resistance, our explanation of realtime proving aims to alteration “home proving” with the thought that immoderate of the solo stakers who presently tally validators from location volition opt-in to proving. Even though we expect to harden censorship absorption done enforced transaction inclusion earlier verifying ZK proofs is made mandatory, location proving is an important last safeguard.
Since proving successful the unreality is already rather inexpensive with multi-GPU spot instances, the absorption for zkVM teams targeting realtime proving volition mostly beryllium optimizing for moving provers on-prem wherever the specs are overmuch much constrained. On-prem realtime proving should necessitate a maximum superior expenditure of 100k(attimeofwritingitrequires 100k (at clip of penning it requires ~80k successful involvement to tally a validator). We expect this to travel down implicit clip adjacent arsenic the state bounds is increased.
More than hardware cost, the astir important constraint for location proving utilizing GPUs is vigor usage. Most residential homes person astatine slightest 10kW entering from the thoroughfare and immoderate volition person circuits intended for electrical appliances oregon charging electrical vehicles with 10kW capacity. Therefore, realtime proving indispensable beryllium imaginable connected hardware moving astatine 10kW oregon less.
This brings america to our moving explanation of realtime proving:
- Latency: <= 10s for P99 of mainnet blocks
- On-prem CAPEX: <= $100k
- On-prem power: <= 10kW
- Code: Fully unfastened source
- Security: >= 128 bits
- Proof size: <= 300KiB with nary trusted setups
The contention to realtime
Between present and Devconnect Argentina, we anticipation to spot zkVM teams proceed innovating towards realtime location proving, and for the starring zkVMs to go aboriginal halfway infrastructure for Ethereum.