Ideals, Gr""obner Bases, and PCPs

2025-11-05

AI Summary

This work resolves a long-standing challenge in probabilistically checkable proof (PCP) construction—namely, the necessity of multiple composition steps—by introducing the first PCP protocol requiring only a single composition. Methodologically, it designs a novel polynomial point-evaluation verification protocol grounded in Gröbner basis theory, replacing conventional sum-check primitives and enabling queries over broader point sets (e.g., ${0,1}^{m/c}_{leq 1}^c$, approximating Hamming balls). This reduces query complexity from $O(m)$ to an absolute constant $O_varepsilon(1)$ depending solely on the soundness error $varepsilon$. Consequently, for any $varepsilon > 0$, it achieves a PCP of size $2^{n^varepsilon}$. The approach unifies algebraic coding theory, ideal theory, and PCP techniques, markedly improving efficiency and advancing PCPs toward succinctness and deeper algebraic foundations.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability
• Machine Learning: Probabilistic Circuits and Graphical Models
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning

Application Category

• Security and Privacy: Large-scale security measurements
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

All known proofs of the PCP theorem rely on multiple"composition"steps, where PCPs over large alphabets are turned into PCPs over much smaller alphabets at a (relatively) small price in the soundness error of the PCP. Algebraic proofs, starting with the work of Arora, Lund, Motwani, Sudan, and Szegedy use at least 2 such composition steps, whereas the"Gap amplification"proof of Dinur uses $Theta(log n)$ such composition steps. In this work, we present the first PCP construction using just one composition step. The key ingredient, missing in previous work and finally supplied in this paper, is a basic PCP (of Proximity) of size $2^{n^epsilon}$, for any $epsilon>0$, that makes $O_epsilon(1)$ queries. At the core of our new construction is a new class of alternatives to"sum-check"protocols. As used in past PCPs, these provide a method by which to verify that an $m$-variate degree $d$ polynomial $P$ evaluates to zero at every point of some set $S subseteq mathbb{F}_q^m$. Previous works had shown how to check this condition for sets of the form $S = H^m$ using $O(m)$ queries with alphabet $mathbb{F}_q^d$ assuming $d geq |H|$. Our work improves this basic protocol in two ways: First we extend it to broader classes of sets $S$ (ones closer to Hamming balls rather than cubes). Second, it reduces the number of queries from $O(m)$ to an absolute constant for the settings of $S$ we consider. Specifically when $S = ({0,1}^{m/c}_{leq 1})^c$, we give such an alternate to the sum-check protocol with $O(1)$ queries with alphabet $mathbb{F}_q^{O(c+d)}$, using proofs of size $q^{O(m^2/c)}$. Our new protocols use insights from the powerful theory of Gr""obner bases to extend previously known protocols to these new settings with surprising ease. In doing so, they highlight why these theories from algebra may be of further use in complexity theory.

Problem

• Reducing PCP composition steps from multiple to just one
• Developing constant-query alternatives to sum-check protocols
• Extending algebraic verification to broader set classes using Gröbner bases

Innovation

• Single composition step PCP construction
• Constant query sum-check alternative protocol
• Gröbner bases theory for complexity extension