🤖 AI Summary
This paper addresses the theoretical foundations and efficiency of correctness verification in verifiable computation. It proposes a unifying framework centered on low-degree polynomials to systematically trace the three-decade evolution—from the Cook–Levin theorem and sum-check protocols to the GKR hierarchical verifier and ZK-SNARKs. The work formally characterizes the mathematical essence of the GKR protocol as the cornerstone of modern verifiable computation and clarifies inherent limitations of NP proof systems. It introduces a two-tiered, progressive knowledge framework—designed both for newcomers and advanced researchers—and integrates core techniques including interactive proofs, knowledge complexity analysis, and low-degree polynomial commitments. The resulting paradigm provides theoretically grounded, practically actionable foundations for efficient and trustworthy outsourced computation. (136 words)
📝 Abstract
This survey provides a comprehensive examination of verifiable computing, tracing its evolution from foundational complexity theory to modern zero-knowledge succinct non-interactive arguments of knowledge (ZK-SNARKs). We explore key developments in interactive proof systems, knowledge complexity, and the application of low-degree polynomials in error detection and verification protocols. The survey delves into essential mathematical frameworks such as the Cook-Levin Theorem, the sum-check protocol, and the GKR protocol, highlighting their roles in enhancing verification efficiency and soundness. By systematically addressing the limitations of traditional NP-based proof systems and then introducing advanced interactive proof mechanisms to overcome them, this work offers an accessible step-by-step introduction for newcomers while providing detailed mathematical analyses for researchers. Ultimately, we synthesize these concepts to elucidate the GKR protocol, which serves as a foundation for contemporary verifiable computing models. This survey not only reviews the historical and theoretical advancements in verifiable computing over the past three decades but also lays the groundwork for understanding recent innovations in the field.