vkproof: Succinct verification of indexed verifying keys using modular compilation and polynomial fingerprinting

Antonio Mejias Gil; Xueqin Zhao

Paper 2026/581

vkproof: Succinct verification of indexed verifying keys using modular compilation and polynomial fingerprinting

Antonio Mejias Gil

, Provable

Xueqin Zhao, Chengdu Neusoft University

Abstract

We introduce vkproof, a preprocessing SNARG which enables verification of the Varuna verifying key (or that of any similar proof system based on Marlin [Chi+20]) for the R1CS compiled from a given higher-level program. It has constant proof size and affords linear verifier costs in the number of instructions of the program rather than the density of the compiled R1CS, which makes it especially appealing in contexts where complex-to-arithmetise functions (such as hashing) appear as program instructions frequently. This verifier succinctness is achieved through modular compilation of programs and the use of fingerprints to verify polynomial correctness. We augment the algebraic holographic proof (AHP) model of Marlin by allowing oracles to witness polynomials in the instance and queries to linear combinations of indexed polynomials, resulting in a primitive we refer to as extended algebraic holographic proofs (eAHP).

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: SNARKs prolynomial commitment schemes algebraic holographic proofs program arithmetization R1CS
Contact author(s): antonio @ provable com
zhaoxueqin @ nsu edu cn
History: 2026-03-24: approved; 2026-03-24: received; See all versions
Short URL: https://ia.cr/2026/581
License: CC BY

BibTeX

@misc{cryptoeprint:2026/581,
      author = {Antonio Mejias Gil and Xueqin Zhao},
      title = {vkproof: Succinct verification of indexed verifying keys using modular compilation and polynomial fingerprinting},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/581},
      year = {2026},
      url = {https://eprint.iacr.org/2026/581}
}