CertiK says it formally verified the zkWasm zero-knowledge virtual machine
CertiK told Finbold it used the Coq proof assistant to mathematically prove zkWasm's core circuits sound, covering the machine's full instruction set.
Why it matters
The claim, if it holds, covers a component that other systems sit on top of. Finbold says a flaw in these circuits would compromise every proof built on them, so a machine-checked soundness result narrows a risk that conventional audits cannot rule out. CertiK sells security services, so the result is also a product demonstration for the firm. Only Finbold has reported it and the proof has not been independently examined by the desk, so the significance is unconfirmed.
Key facts
CertiK's research team completed a formal verification of zkWasm using the Coq proof assistant.
Reported by Finbold
The verification translated zkWasm's Halo2 circuit logic into the Coq theorem prover and built machine-checked proofs that the circuits behave as intended.
Reported by Finbold
The mathematical proofs cover zkWasm's full instruction set.
Reported by Finbold
The verification establishes that every accepted computation trace represents a valid execution of the underlying program.
Reported by Finbold
The verification establishes that the prover cannot construct a proof for an invalid execution.
Reported by Finbold
CertiK shared the information with Finbold on September 28, 2026.
Reported by Finbold
zkWasm is a general-purpose zero-knowledge virtual machine that lets developers prove a WebAssembly program executed correctly without revealing the underlying computation.
Reported by Finbold
Finbold describes CertiK as the largest Web3 security services provider.
Reported by Finbold
What happened
CertiK, a Web3 security firm, told Finbold on September 28, 2026 that its research team completed a formal verification of zkWasm, a general-purpose zero-knowledge virtual machine that generates cryptographic proofs of program execution. According to Finbold, the team used the Coq proof assistant to translate zkWasm's Halo2 circuit logic into the Coq theorem prover and build machine-checked proofs that the circuits behave as intended, covering the machine's full instruction set. Finbold reports the work establishes two guarantees: that every accepted computation trace is a valid execution of the underlying program, and that the prover cannot construct a proof for an invalid execution. Finbold says the result goes beyond traditional audits or testing, which search for known bug patterns, and notes that a single flaw in the circuits underpinning a zero-knowledge virtual machine can silently undermine every proof built on it. No independent outlet has reported the work, and the proof itself, its scope and its artefacts were not available for review in the material the desk holds.
How the story developed
Affected entities
Original sources
| Publisher | Report | Role | Published |
|---|---|---|---|
| Finbold Crypto media | CertiK delivers mathematical proof of zkWasm correctness | Original |