Due to Arantxa Zapico, Benedikt Wagner, and Dmitry Khovratovich from the EF cryptography crew for his or her contributions, and to Ladislaus, Kev, Alex, and Marius for the cautious evaluate and suggestions.
The zkEVM ecosystem has been sprinting for a 12 months. And it labored! We crossed the end line for real-time proving!
Now comes the subsequent part: constructing one thing mainnet-grade.
From velocity to safety
In July, we published a north-star definition for realtime proving. 9 months later, the ecosystem crushed it: proving latency dropped from 16 minutes to 16 seconds, prices collapsed 45×, and zkVMs now show 99% of all Ethereum blocks in underneath 10 seconds on track {hardware}.
Whereas the key efficiency bottlenecks have been cleared by the zkEVM groups, safety nonetheless stays the elephant within the room.
The case for 128-bit provable safety
Many STARK-based zkEVMs at present depend on unproven mathematical conjectures to hit their safety targets. Over the previous months, STARK safety has been going through a lot, with foundational conjectures getting mathematically disproven by researchers. Every conjecture that falls takes bits of safety with it: what was marketed as 100 bits would possibly really be 80.
The one affordable path forward is provable safety, and 128 bits stays the target. It is the safety degree recommended by standardization bodies and validated by real-world computational milestones.
For zkEVMs, this is not tutorial. A soundness problem is just not like different safety points. If an attacker can forge a proof, they will forge something: mint tokens from nothing, rewrite state, steal funds. For an L1 zkEVM securing a whole lot of billions of {dollars}, the safety margin is just not negotiable.
Three Milestones
For us, safety and proof dimension are each important—however they’re additionally in stress. Extra safety sometimes means bigger proofs, and proofs should keep sufficiently small to propagate throughout Ethereum’s P2P community reliably and in time.
We’re setting three milestones:
Milestone 1: soundcalc integration Deadline: Finish of February 2026
To measure safety persistently, we created soundcalc: a software that estimates zkVM safety primarily based on the newest cryptographic safety bounds and proof system parameters. It is a residing software and we plan to maintain integrating the newest analysis and identified assaults.
By this deadline, collaborating zkEVM groups ought to have their proof system parts and all of their circuits built-in with soundcalc. This offers us a standard floor for the safety assessments that observe. (For reference, see examples of earlier integrations: #1, #2)
Milestone 2: Glamsterdam Deadline: Finish of Might 2026
- 100-bit provable safety (as estimated by soundcalc)
- Ultimate proof dimension ≤ 600 KiB
- Compact description of recursion structure and sketch of its soundness
Milestone 3: H-star Deadline: Finish of 2026
- 128-bit provable safety (as estimated by soundcalc)
- Ultimate proof dimension ≤ 300 KiB
- Formal safety argument for the soundness of the recursion structure
Current cryptographic and engineering advances make hitting the above milestones tractable: compact polynomial dedication schemes like WHIR, strategies like JaggedPCS, a little bit of grinding, and a well-structured recursion topology can all contribute to a viable path ahead.
Recursion is especially value highlighting. Trendy zkEVMs contain many circuits composed with recursion in customized methods, with a number of glue in between. Every crew does it otherwise. Documenting this structure and its soundness is important for the safety of all the system.
The trail ahead
There is a strategic motive to lock in on zkEVM safety now.
Securing a shifting goal is tough. As soon as groups have hit these targets and zkVM architectures stabilize, the formal verification work we’ve been investing in can attain its full potential. By H-star, we hope the proof system layer may have largely settled. Not frozen ceaselessly, however secure sufficient to formally confirm important parts, finalize safety proofs, and write specs that match deployed code.
That is the inspiration that’s required to get to safe L1 zkEVMs.
Constructing foundations
A 12 months in the past, the query was whether or not zkEVMs may show quick sufficient. That query is answered. The brand new query is whether or not they can show soundly sufficient. We’re assured they will.
On our finish:
- In January, we’ll publish a publish clarifying and formalizing the milestones above.
- We’ll observe up with a technical publish outlining proof system strategies for reaching the safety and proof dimension targets.
- On the similar time, we will probably be updating Ethproofs to replicate this shift: highlighting safety alongside efficiency.
- We’re right here to assist all through this course of. Attain out to the EF cryptography crew.
The efficiency dash is over. Now let’s strengthen the foundations.
