DEEP Commitments and Their Applications

Alan Szepieniec

Paper 2024/1752

DEEP Commitments and Their Applications

Alan Szepieniec, Neptune Cash

Abstract

This note studies a method of committing to a polynomial in a way that allows executions of low degree tests such as FRI to be batched and even deferred. In particular, it achieves (unlimited-depth) aggregation for STARKs.

Note: - catch missing term - add acknowledgements

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint.
Keywords: STARK SNARK zero-knowledge Reed-Solomon
Contact author(s): alan @ neptune cash
History: 2024-10-30: revised; 2024-10-27: received; See all versions
Short URL: https://ia.cr/2024/1752
License: CC BY

BibTeX

@misc{cryptoeprint:2024/1752,
      author = {Alan Szepieniec},
      title = {{DEEP} Commitments and Their Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/1752},
      year = {2024},
      url = {https://eprint.iacr.org/2024/1752}
}