evm.fast asks for a provable ceiling on block verification work
The Ethereum Foundation introduces an open challenge to bound verification work mathematically, with modest hardware as a design goal.

The Ethereum Foundation has introduced evm.fast, an open challenge to establish mathematically guaranteed bounds on the work required to verify an Ethereum block. Its announcement describes a leaderboard where contributors compete to tighten those bounds regardless of a block’s contents. The project is built on Yukon with zkSecurity, Verity Lab and Yukon Research.
That is a different question from whether a particular benchmark finishes quickly. A worst-case bound asks how demanding a valid input can become, including inputs chosen to stress verification. For client developers and proof-system builders, a tighter bound could make hardware requirements and resource budgets easier to reason about. That is a potential engineering benefit, rather than a measured production improvement announced here.
The Foundation frames inexpensive, predictable verification on modest hardware as the objective. The announcement does not establish that the challenge has already achieved its final bound or changed Ethereum’s live protocol. Regional formal-methods teams can evaluate the challenge as a concrete research contribution, keeping the distinction between a proved limit and an observed runtime.