Caulk: Lookup Arguments in Sublinear Time

We present position-hiding linkability for vector commitment schemes: one can prove in zero knowledge that one or m values that comprise commitment all belong to the vector of size N committed to in . Our construction can be used for membership proofs and lookup arguments and outperforms all existing alternatives in prover time by orders of magnitude.