Due to Arantxa Zapico, Benedikt Wagner, and Dmitry Khovratovich from the EF cryptography staff for his or her contributions, and to Ladislaus, Kev, Alex, and Marius for the cautious overview and suggestions.
The zkEVM ecosystem has been sprinting for a yr. And it labored! We crossed the end line for real-time proving!
Now comes the subsequent section: constructing one thing mainnet-grade.
From pace to safety
In July, we printed 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 below 10 seconds on course {hardware}.
Whereas the most important 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 as we speak depend on unproven mathematical conjectures to hit their safety targets. Over the previous months, STARK safety has been going via loads, with foundational conjectures getting mathematically disproven by researchers. Every conjecture that falls takes bits of safety with it: what was marketed as 100 bits may truly be 80.
The one affordable path ahead is provable safety, and 128 bits stays the goal. It is the safety degree advisable by standardization our bodies and validated by real-world computational milestones.
For zkEVMs, this is not educational. A soundness situation isn’t like different safety points. If an attacker can forge a proof, they’ll forge something: mint tokens from nothing, rewrite state, steal funds. For an L1 zkEVM securing a whole bunch of billions of {dollars}, the safety margin isn’t negotiable.
Three Milestones
For us, safety and proof dimension are each crucial—however they’re additionally in pressure. 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 constantly, we created soundcalc: a device that estimates zkVM safety primarily based on the newest cryptographic safety bounds and proof system parameters. It is a residing device and we plan to maintain integrating the newest analysis and identified assaults.
By this deadline, taking part zkEVM groups ought to have their proof system parts and all of their circuits built-in with soundcalc. This provides us a standard floor for the safety assessments that comply with. (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)Remaining proof dimension ≤ 600 KiBCompact 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)Remaining proof dimension ≤ 300 KiBFormal safety argument for the soundness of the recursion structure
Latest cryptographic and engineering advances make hitting the above milestones tractable: compact polynomial dedication schemes like WHIR, methods like JaggedPCS, a little bit of grinding, and a well-structured recursion topology can all contribute to a viable path ahead.
Recursion is especially price highlighting. Fashionable zkEVMs contain many circuits composed with recursion in customized methods, with a number of glue in between. Every staff does it otherwise. Documenting this structure and its soundness is crucial for the safety of the whole system.
The trail ahead
There is a strategic purpose to lock in on zkEVM safety now.
Securing a transferring goal is difficult. As soon as groups have hit these targets and zkVM architectures stabilize, the formal verification work we have been investing in can attain its full potential. By H-star, we hope the proof system layer could have principally settled. Not frozen eternally, however steady sufficient to formally confirm crucial 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 yr 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’ll.
On our finish:
In January, we’ll publish a publish clarifying and formalizing the milestones above.We are going to comply with up with a technical publish outlining proof system methods for reaching the safety and proof dimension targets.On the identical time, we shall be updating Ethproofs to mirror this shift: highlighting safety alongside efficiency.We’re right here to assist all through this course of. Attain out to the EF cryptography staff.
The efficiency dash is over. Now let’s strengthen the foundations.
