Problem
Research questions and friction points this paper is trying to address.
PCP Theorem
Graph 3-coloring
Polynomial-sized Proof
Verification
Low-degree Testing
A Simple Algebraic Proof of the PCP Theorem
🤖 AI Summary
本文通过代码连接、多项式插值和乘法等简单方法，提供了一个简洁的PCP定理代数证明，特别地，使用一种新的编码方式克服了低度测试的瓶颈。
📝 Abstract
We give the simplest known algebraic proof of the PCP theorem, involving only ingredients like code concatenation, polynomial interpolation, and polynomial multiplication. Specifically, we prove that graph 3-coloring has a polynomial-sized proof that can be verified by a verifier tossing logarithmically many coins and querying a constant number of bits in the proof. In particular, our proof does not involve any PCP compositions; notably, it does not invoke the NP-completeness of any fixed problem, such as SAT or 3-coloring, in the construction of the verifier. The main innovation in our work is a clean, coding theoretic, way to encode univariate polynomials that allows us to implement ``low-degree testing'' using just a constant number of bits of queries. Insights from recent attempts to simplify the PCP proof by the authors (STOC 2026) and Goldreich (ECCC 2025) allow us to observe that low-degree was the key bottleneck in converting previous algebraic constructions of the PCP verifier into a constant query PCP. Thus, by overcoming this bottleneck, we get the full PCP verifier using elementary and self-contained steps. As concrete support for the claimed simplicity, we include the full pseudocode of the PCP verifier, assuming finite field arithmetic, and a full description of the completeness (aka ``honest'') prover, assuming multivariate polynomial arithmetic including interpolation and evaluation, that fit in about a page each.
Innovation
Methods, ideas, or system contributions that make the work stand out.
algebraic proof
code concatenation
polynomial interpolation
low-degree testing
🔎 Similar Papers
No similar papers found.
