Paper 2026/458 Original: eprint.iacr.org/2026/458 ↗
The Art of Linearization: From a KZG’s Trick to a General Commitment Framework
Abstract
A useful linearization technique (or a trick) was introduced in the Marlin and Plonk SNARKs, which significantly reduces the number of KZG polynomial commitment openings a SNARK prover has to send. Subsequently, many other KZG-based protocols have taken advantage of it. We revisit and formalize this technique: – We define a Linearization Polynomial Commitment Scheme (LPCS) that abstracts their linearization technique. – We formalize LinKZG, a LPCS version of the KZG commitment scheme, and show that it achieves a weak form of extractability under a target group version of the ARSDH assumption. We show that Plonk is secure under the same assumption in the ROM. – We show how to construct LPCSs from any homomorphic polynomial commitment scheme. Thus, enabling the linearization technique also for those polynomial commitment schemes, and potentially improving the efficiency of many other SNARKs.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2026-03-05: last updated
- 2026-03-05: published
- Short URL
- https://ia.cr/2026/458
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2026/458,
author = {Janno Siim},
title = {The Art of Linearization: From a KZG’s Trick to a General Commitment Framework},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/458},
year = {2026},
url = {https://eprint.iacr.org/2026/458}
}