Isabelle/STARK: A Formalization of zk-STARK in Isabelle/HOL
Logic in Computer Science
2026-08-03 v1 Software Engineering
Abstract
This report describes an Isabelle/HOL formalization of a STARK-style transparent proof protocol. The development contains an executable model of the prover and verifier, a finite probabilistic state monad with a weakest-precondition calculus, a zero-failure honestcompleteness theorem, and a staged soundness theorem with an explicit probability bound. The report is written for readers with a formal-methods background. It gives enough cryptographic context to explain the protocol, but its main emphasis is the formal model, the decomposition of the proofs, and the Isabelle source locations of the principal definitions and theorems.
Cite
@article{arxiv.2608.01965,
title = {Isabelle/STARK: A Formalization of zk-STARK in Isabelle/HOL},
author = {Diego Marmsoler},
journal= {arXiv preprint arXiv:2608.01965},
year = {2026}
}