Paper 2023/1799
BabySpartan: Lasso-based SNARK for non-uniform computation
Abstract
Lasso (Setty, Thaler, Wahby, ePrint 2023/1216) is a recent lookup argument that ensures that the prover cryptographically commits to only "small" values. This note describes BabySpartan, a SNARK for a large class of constraint systems that achieves the same property. The SNARK is a simple combination of SuperSpartan and Lasso. The specific class of constraint systems supported is a generalization of so-called Plonkish constraint systems (and a special case of customizable constraint systems (CCS)). Whereas a recent work called Jolt (Arun, Setty, and Thaler, ePrint 2023/1217) can be viewed as an application of Lasso to uniform computation, BabySpartan can be viewed as applying Lasso to non-uniform computation.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Preprint.
- Keywords
- SNARKsproof systems
- Contact author(s)
-
srinath @ microsoft com
justin r thaler @ gmail com - History
- 2023-11-24: approved
- 2023-11-22: received
- See all versions
- Short URL
- https://ia.cr/2023/1799
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1799,
author = {Srinath Setty and Justin Thaler},
title = {BabySpartan: Lasso-based SNARK for non-uniform computation},
howpublished = {Cryptology ePrint Archive, Paper 2023/1799},
year = {2023},
note = {\url{https://eprint.iacr.org/2023/1799}},
url = {https://eprint.iacr.org/2023/1799}
}
