We present a framework for building efficient folding-based SNARKs. First we develop a
new “uniformizing” compiler for NP statements that converts any poly-time computation to a …

Vector Oblivious Linear Evaluation (VOLE) supports fast and scalable interactive Zero-
Knowledge (ZK) proofs. Despite recent improvements to VOLE-based ZK, compiling proof …

We explore Zero-Knowledge Proofs (ZKPs) of statements expressed as programs written in
high-level languages, eg, C or assembly. At the core of executing such programs in ZK is the …

Zero-knowledge (ZK) proofs have been recently explored for the integrity of machine
learning (ML) inference. However, these protocols suffer from high computational overhead …

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 …

Proofs for machine computation prove the correct execution of arbitrary programs that
operate over fixed instruction sets (eg, RISC-V, EVM, Wasm). A standard approach for …

Existing protocols for proving the correct execution of a RAM program in zero-knowledge are
plagued by a processor expressiveness tradeo: supporting fewer instructions results in …

In recent years, cloud vendors have started to supply paid services for data analysis by
providing interfaces of their well-trained neural network models. However, customers lack …

Existing protocols for proving the correct execution of a RAM program in zero-knowledge are
plagued by a processor expressiveness tradeoff: supporting fewer instructions results in …

A memory checking argument enables a prover to prove to a verifier that it is correctly
processing reads and writes to memory. They are used widely in modern SNARKs …