BabySpartan: Lasso-based SNARK for non-uniform computation

ePrint Report: BabySpartan: Lasso-based SNARK for non-uniform computation

Srinath Setty, Justin Thaler

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 …

argument class computation eprint report justin large non property report systems