Some amortization techniques for FRI-based SNARKs

ePrint Report: Some amortization techniques for FRI-based SNARKs

Albert Garreta, Hayk Hovhanissyan, Aram Jivanyan, Ignacio Manzur, Isaac Villalobos, Michał Zając

We present two techniques to improve the computational and/or communication costs of STARK proofs: packing and modular split-and-pack.

Packing allows to generate a single proof of the satisfiability of several constraints. We achieve this by packing the evaluations of all relevant polynomials in the same Merkle leaves, and combining all DEEP FRI functions into a single randomized validity function. Our …

communication computational constraints eprint report isaac modular proof report single techniques