Volatile and Persistent Memory for zkSNARKs via Algebraic Interactive Proofs
Alex Ozdemir, Evan Laufer, Dan Boneh
IEEE Symposium on Security and Privacy 2025 · Day 3 · Zero Knowledge
This technical article delves into groundbreaking research presented at IEEE S&P 2025, focusing on a novel approach to enhance the efficiency of **Zero-Knowledge Succinct Non-Interactive Arguments of Knowledge (zkSNARKs)**. The talk, delivered by Alex Ozdemir and co-authored with Evan Laufer and Dan Boneh, addresses a critical bottleneck in current zkSNARK implementations: the inefficient handling of state manipulation, particularly Random Access Memory (RAM). By introducing a new computational model known as **Algebraic Interactive Proofs (AIPs)**, the researchers propose a reimagined pipeline for zkSNARK construction, promising substantial performance improvements for a wide range of properties that rely on memory operations.