The concept of using Lookup Tables (LUTs) instead of Boolean circuits is well-known and
been widely applied in a variety of applications, including FPGAs, image processing, and …

This paper introduces HyperNova, a recursive argument for proving incremental
computations whose steps are expressed with CCS (Setty et al. ePrint 2023/552), a …

In this informal note, we instantiate the Goldwasser-Kalai-Rothblum (GKR) protocol to prove
fractional sumchecks as present in lookup arguments based on logarithmic derivatives, with …

We present a protocol for checking the values of a committed polynomial $\phi (X) $ over a
multiplicative subgroup $ H\subset\mathbb {F} $ of size $ m $ are contained in a table …

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

We present Baloo, the first protocol for lookup tables where the prover work is linear on the
amount of lookups and independent of the size of the table. Baloo is built over the lookup …

A non-interactive zero-knowledge (NIZK) protocol allows a prover to non-interactively
convince a verifier of the truth of the statement without leaking any other information. In this …

Modern SNARK designs usually feature a frontend-backend paradigm: The frontend
compiles a user's program into some equivalent circuit representation, while the backend …

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 …

In this work we study Invertible Bloom Lookup Tables (IBLTs) with small failure probabilities.
IBLTs are highly versatile data structures that have found applications in set reconciliation …