$\mathsf{Zinc}$: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers

Albert Garreta; Hendrik Waldner; Katerina Hristova; Luca Dall'Ava

Paper 2025/316

: Succinct Arguments with Small Arithmetization Overheads from IOPs of Proximity to the Integers

Albert Garreta, Nethermind Research

Hendrik Waldner

, Nethermind Research

Katerina Hristova

Luca Dall'Ava

Abstract

We introduce , a hash-based succinct argument for integer arithmetic. 's goal is to provide a practically efficient scheme that bypasses the arithmetization overheads that many succinct arguments present. These overheads can be of orders of magnitude in many applications. By enabling proving statements over the integers, we are able to arithmetize many operations of interest with almost no overhead. This includes modular operations involving any moduli, not necessarily prime, and possibly involving multiple moduli in the same statement. In particular, allows to prove statements for the ring for arbitrary . Importantly, and departing from prior work, our schemes are purely code and hash-based, and do not require hidden order groups. In its final form, operates similarly to other hash-based schemes using Brakedown as their PCS, and at the same time it benefits from the arithmetization perks brought by working over (and ) natively. At its core, is a succinct argument for proving relations over the rational numbers , even though when applied to integer statements, an honest prover and verifier will only operate with small integers. consists of two main components: 1) -, a framework for proving algebraic statements over the rationals by reducing modulo a randomly chosen prime , followed by running a suitable PIOP over (this is similar to the approach taken in prior works, with the difference that we use localizations of to enable prime modular projection); and 2) , a Brakedown-type polynomial commitment scheme built from an IOP of proximity to the integers, a novel primitive that we introduce. The latter primitive guarantees that a prover is using a polynomial with coefficients close to being integral. With these two primitives in place, one can use a lookup argument over the rationals to ensure that the witness contains only integer elements.

Note: Fixed typos and added orcid information.

Metadata

Available format(s): PDF
Publication info: Preprint.
Keywords: succinct arguments zk-proof SNARK Polynomial Commitment Schemes ring arithmetic
Contact author(s): albert @ nethermind io
hendrik waldner @ nethermind io
katherina hristova @ gmail com
lucadallava work @ gmail com
History: 2025-02-28: last of 9 revisions; 2025-02-21: received; See all versions
Short URL: https://ia.cr/2025/316
License: CC BY

BibTeX

@misc{cryptoeprint:2025/316,
      author = {Albert Garreta and Hendrik Waldner and Katerina Hristova and Luca Dall'Ava},
      title = {$\mathsf{Zinc}$: Succinct Arguments with Small Arithmetization Overheads from {IOPs} of Proximity to the Integers},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/316},
      year = {2025},
      url = {https://eprint.iacr.org/2025/316}
}