Skip to content
Research noteZK-2026-0217

A machine-checked soundness bound for GKR

An Ethereum Research post reports what it calls the first machine-checked soundness bound for GKR on general layered circuits.

2 minZero-Knowledge Proofs

A post on Ethereum Research describes StateSync-GKR, a project that its author says has produced the first machine-checked soundness bound for the GKR protocol on general layered circuits. GKR's appeal is that it commits only to a circuit's input and output and never to the layers in between, which makes it a natural tool for proving hash-heavy computation such as updates to a sparse Merkle tree.

The formal work is done in the Isabelle/HOL proof assistant. For circuits with linear, product and cube gates, Isabelle checks a soundness bound for the whole chain of layers, built on an existing sumcheck formalization in the Archive of Formal Proofs. The development has 20 theories in six sessions, 11,112 lines and 418 named statements. The bound is proved over a quartic extension of the 31-bit KoalaBear field, giving a denominator of about 2 to the 124.

The project also ties the model to the code. A soundness proof covers sparse-Merkle updates built on the bound, and Creusot contracts with recorded proofs relate selected functions of the Rust compiler, sumcheck engine and hash interface to the model. The author is explicit that this refinement is partial: discharging the relation between the Rust values and the model for the compiled verifier is the open last link. Notably, the design does not need a collision-resistant node hash; security reduces instead to position binding of the tree.

The engineering result is a faster prover that does not touch the proofs. Release 1.2 of the sparse prover runs 2.41 to 2.71 times faster while producing byte-identical proofs and leaving the Isabelle theories unchanged, and sparse booking keeps peak memory about 89 times below a dense reference. The details are in two accompanying arXiv papers.

Retold from Ethereum Research. This is a summary in our own words; follow the link for the original reporting.

Questions

What is GKR in zero-knowledge proofs?
A proof protocol for layered circuits that commits only to a circuit's input and output, not to the layers in between, which makes it attractive for proving hash-heavy computation.
What did StateSync-GKR prove in Isabelle/HOL?
A soundness bound for GKR on general layered circuits with linear, product and cube gates, over the whole layer chain, on top of an existing sumcheck formalization. The development runs to 11,112 lines and 418 named statements.

Read next

Across the network

Desks that share a zone with this one on the BITBRIEF coverage map.

Terms defined