1. Introduction Lookup protocols are designed to handle specific operations that are challenging for SNARKs (Succinct Non-Interactive Arguments of Knowledge). Broadly speaking, these protocols enable one to prove a statement of the form: Given a table T={t_i},i=0,…,N−1 of distinct values (referred to as ‘rows’), and a list of lookups F={f_j}j=0,…,m−1 (which may…