GKR extended to approximate interactive proofs over complex circuits
At constant soundness the verifier runs in (n+1) poly(L, log S, b); the honest prover needs O(S log S) complex operations.
Stories per day · 30 days
Relatedai-verification1approximate-arithmetic1complex-circuits1complexity-theory1fourier-sampling1gkr1oracles1quantum-computation1rewinding1scalable-oversight1zero-knowledge1
6 stories, newest first · one card per story
Stories tagged #interactive-proofs
Rewindable proofs proposed for scalable oversight without a truthful prover
The honest prover is linear in the original computation, and the verifier is nearly linear in input length after preprocessing.
Classical verifier checks a beyond-PH quantum language via an oracle
The public-coin protocol has perfect completeness and soundness error at most 1/4, with near-optimal message count.
Can AI Oversight Be Zero Knowledge?
Researchers prove interactive arguments for oracle-aided AI computations cannot, in general, be zero knowledge.
On quantum interactive proofs with a laconic prover
A complexity paper characterizes two-message quantum proofs with short prover messages via state distinguishability.
Human-LLM Deliberation as Interactive Proof: Conditions for Verifiability Without Transparency
A paper models human-LLM deliberation as an interactive proof with soundness bounds for accepting claims.