Paper 2024/872

Epistle: Elastic Succinct Arguments for Plonk Constraint System

Abstract

We study elastic SNARKs, a concept introduced by the elegant work of Gemini (EUROCRYPTO 2022). The prover of elastic SNARKs has multiple configurations with different time and memory tradeoffs and the output proof is independent of the chosen configuration. In addition, during the execution of the protocol, the space-efficient prover can pause the protocol and save the current state. The time-efficient prover can then resume the protocol from that state. Gemini constructs an elastic SNARK for R1CS. We present Epistle, an elastic SNARK for Plonk constraint system. For an instance with size $$, in the time-efficient configuration, the prover uses $$ cryptographic operations and $$ memory; in the space-efficient configuration, the prover uses $$ cryptographic operations and $$ memory. Compared to Gemini, our approach reduces the asymptotic time complexity of the space-efficient prover by a factor of $$. The key technique we use is to make the toolbox for multivariate PIOP provided by HyperPlonk (EUROCRYPTO 2023) elastic, with the most important aspect being the redesign of each protocol in the toolbox in the streaming model. We implement Epistle in Rust. Our benchmarks show that Epistle maintains a stable memory overhead of around $$ GB for instance sizes exceeding $$, while the time overhead shows a linear growth trend.