Volatile and Persistent Memory for zkSNARKs via Algebraic Interactive Proofs

ePrint Report: Volatile and Persistent Memory for zkSNARKs via Algebraic Interactive Proofs

Alex Ozdemir, Evan Laufer, Dan Boneh

In verifiable outsourcing, an untrusted server runs an expensive computation and produces a succinct proof (called a SNARK) of the results. In many scenarios, the computation accesses a RAM that the server maintains a commitment to (persistent RAM) or that is initially zero (volatile RAM). But, SNARKs for such scenarios are limited by the high overheads associated with existing techniques for RAM …

alex called computation dan eprint report evan memory outsourcing persistent proof report results server untrusted volatile zksnarks