Welcome to the resource topic for 2023/066
Title:
Plonkup scheme with multiple queries
Authors: Alexandr Bulkin, Tim Dokchitser
Abstract: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 it to the situation when there are multiple lookups with the same table (as is usually the case with range checks), and handle also ‘bounded lookup’ that caps the number of repetitions.
ePrint: https://eprint.iacr.org/2023/066
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .