Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them

ePrint Report: Natively Compatible Super-Efficient Lookup Arguments and How to Apply Them

Matteo Campanelli, Dario Fiore, Rosario Gennaro

Lookup arguments allow an untrusted prover to commit to a vector $\vec f \in \mathbb{F}^n$ and show that its entries reside in a predetermined table $\vec t \in \mathbb{F}^N$. One of their key applications is to augment general-purpose SNARKs making them more efficient on subcomputations that are hard to arithmetize. In order for this "augmentation" to work out, a SNARK and a …

commit eprint report report super untrusted vec vector