Paper 2023/474 Original: eprint.iacr.org/2023/474 ↗
eSTARK: Extending STARKs with Arguments
Abstract
STARK is a widely used transparent proof system that uses low-degree tests for proving the correctness of a computer program. STARK consumes an intermediate representation known as AIR that is more appropriate for programs with a relatively short and structured description. However, an AIR is not able to succinctly express non-equality constraints, leading to the incorporation of unwanted polynomials. We present the eSTARK protocol, a new probabilistic proof that generalizes the STARK family through the introduction of a more generic intermediate representa- tion called eAIR. We describe eSTARK in the polynomial IOP model, which com- bines the optimized version of the STARK protocol with the incorporation of three arguments into the protocol. We also explain various techniques that enhance the vanilla STARK complexity, including optimizations applied to polynomial computa- tions, and analyze the tradeoffs between controlling the constraint degree either at the representation of the AIR or inside the eSTARK itself.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2023-03-31: last updated
- 2023-03-31: published
- Short URL
- https://ia.cr/2023/474
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/474,
author = {Héctor Masip-Ardevol and Marc Guzmán-Albiol and Jordi Baylina-Melé and Jose Luis Muñoz-Tapia},
title = {eSTARK: Extending STARKs with Arguments},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/474},
year = {2023},
url = {https://eprint.iacr.org/2023/474}
}