Theoretical computer science · Oct 6, 2026
A quasilinear PCP theorem for PPAD
Resolves the quasilinear PCP-for-PPAD conjecture. An End-of-Line instance of length N reduces to numerical circuit constraints of total length such that any polynomially encoded rational assignment satisfying all but a fixed fraction to fixed accuracy yields an endpoint solution. Such assignments always exist, giving robust local verification with only quasilinear size overhead.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model