Subvector Commitments for Prover-Efficient SNARKs
Arantxa Zapico
VideoAbstract:
We present a new subvector commitment scheme that supports native aggregation, enabling efficient proofs that a subset of values is correctly included in a previously committed vector. Our scheme is designed within the commit-and-prove SNARK framework and builds on the KZG polynomial commitment scheme. By strategically partitioning vectors into cosets and precomputing a small set of proofs, our construction allows the prover to later aggregate those proofs efficiently in time linear in the number of queried elements, independent of the vector’s total size. We demonstrate how our protocol can serve as a building block for scalable lookup arguments, offering new memory–computation tradeoffs in SNARK-based systems.
Bio:
Arantxa is a cryptography researcher at the Ethereum Foundation. She obtained her Ph.D. from Pompeu Fabra University in October 2022. Her research focuses on theoretical aspects of cryptography, with an emphasis on Blockchain technologies and zero knowledge proofs.