We study interactive oracle proofs (IOPs) [BCS16,RRR16], which combine aspects of probabilistically checkable proofs (PCPs) and interactive proofs (IPs). We present IOP constructions and techniques that enable us to obtain tradeoffs in proof length versus query complexity that are not known to be achievable via PCPs or IPs alone. Our main results are:1. Circuit satisfiability has 3-round IOPs with linear proof length (counted in bits) and constant query complexity.2. Reed-Solomon codes have 2-round IOPs of proximity with linear proof length and constant query complexity.3. Tensor product codes have 1-round IOPs of proximity with sublinear proof length and constant query complexity.For all the above, known PCP constructions give quasilinear proof length and constant query complexity [BS08,Din07]. Also, for circuit satisfiability, [BKKMS13] obtain PCPs with linear proof length but sublinear (and super-constant) query complexity. As in [BKKMS13], we rely on algebraic-geometry codes to obtain our first resu but, unlike that work, our use of such codes is much "lighter" because we do not rely on any automorphisms of the code.We obtain our results by proving and combining "IOP-analogues" of tools underlying numerous IPs and PCPs:* Interactive proof composition. Proof composition [AS98] is used to reduce the query complexity of PCP verifiers, at the cost of increasing proof length by an additive factor that is exponential in the verifieru27s randomness complexity. We prove a composition theorem for IOPs where this additive factor is linear.* Sublinear sumcheck. The sumcheck protocol [LFKN92] is an IP that enables the verifier to check the sum of values of a low-degree multi-variate polynomial on an exponentially-large hypercube, but the verifieru27s running time depends linearly on the bound on individual degrees. We prove a sumcheck protocol for IOPs where this dependence is sublinear (e.g., polylogarithmic).Our work demonstrates that even constant-round IOPs are more efficient than known PCPs and IPs.
展开▼
