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.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
STARKSNARKzero-knowledgeReed-Solomon
Contact author(s)
alan @ neptune cash
History
2024-10-28: approved
2024-10-27: received
See all versions
Short URL
https://ia.cr/2024/1752
License
Creative Commons Attribution
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}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.