Plonkup scheme with multiple queries

ePrint Report: Plonkup scheme with multiple queries

Alexandr Bulkin, Tim Dokchitser

There is a line of 'lookup' protocols to show that all elements of a sequence $f\in{\mathbb F}^n$ are contained in a table $t\in{\mathbb F}^d$, for some field ${\mathbb F}$. Lookup has become an important primitive in Zero Knowledge Virtual Machines, and is used for range checks and other parts of the proofs of a correct program execution. In this note we give several variants of the protocol. We adapt …

eprint report important knowledge machines program protocols report tim virtual virtual machines zero knowledge