Human-LLM Deliberation as Interactive Proof: Conditions for Verifiability Without Transparency

Excerpt

arXiv:2609.24895v1 Announce Type: new Abstract: When an LLM supplies an argument that a user could not readily construct, how can the user decide whether to accept its claim? Inspired by interactive proofs, we model human-LLM deliberation as an interaction between a prover with unrestricted internal search and a resource-bounded human verifier. The verifier requests and checks supporting details without access to the LLM's internal state. Passed checks accumulate evidence toward an acceptance th