Paper 2019/601

AuroraLight: Improved prover efficiency and SRS size in a Sonic-like system

Ariel Gabizon


Using ideas from the recent Aurora zk-STARK of Ben-Sasson et al. [BCRSVW, Eurocrypt 2019], we present a zk-SNARK with a universal and updatable SRS similar to the recent construction of Maller et al. [MBKM, 2019], called $\mathsf{Sonic}$. Compared to $\mathsf{Sonic}$, our construction achieves significantly better prover run time (less than half) and smaller SRS size (one sixth). However, we only achieve amortized succinct verification time for batches of proofs, either when the proofs are generated in parallel or in [MBKM]'s helper setting, and our proofs are longer than those of [MBKM] (but still contain a $\mathit{constant}$ number of field and group elements).

Available format(s)
Publication info
Preprint. MINOR revision.
zk-SNARKsupdatable SRSuniversal SRSpolynomial commitment schemes
Contact author(s)
ariel gabizon @ gmail com
2019-08-13: last of 3 revisions
2019-06-02: received
See all versions
Short URL
Creative Commons Attribution


      author = {Ariel Gabizon},
      title = {AuroraLight: Improved prover efficiency and SRS size in a Sonic-like system},
      howpublished = {Cryptology ePrint Archive, Paper 2019/601},
      year = {2019},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.