- Rating
- 2
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents an interactive zero-knowledge prototype that connects three components: binding private inference weights to an approved model registration, verifying private Q12 GPT-2 generation and sampling, and authorizing hidden tool calls before execution.
The system uses a streamed Reed--Solomon link for model binding, authenticated lookup-based inference and parsing, and a policy check that issues a one-time capability for an accepted call. Experiments on GPT-2 Small show substantial speedups over matched internal baselines for model binding and fused Q12 verification, and seven bounded agent tasks demonstrate that authorized calls are executed while selected unauthorized calls are denied.
Critical strengths
1. The paper addresses two gaps that ordinary inference proofs do not solve.
Binding the actually consumed private weights to an approved registration and proving authorization of a generated action are both meaningful extensions beyond proving inference correctness alone.
2. The implementation and evaluation are unusually careful for a prototype.
The paper provides matched ablations, explicit trust boundaries, detailed soundness accounting, Q12--FP32 fidelity measurements, and a reproducible code artifact. I also appreciate that the authors clearly distinguish verified authorization from trusted tool execution.
Critical weaknesses
1. The end-to-end security guarantee is substantially weaker than the high-level framing may suggest.
The confidentiality argument assumes a semi-honest verifier, the registrar and gateway remain trusted, and tool execution itself is not proved. More importantly, the reported 40-bit target applies only to enumerated added checks rather than the full EMP/VOLE and cryptographic stack. For an authorization system, I would like to understand the cost of reaching a more conventional security level such as 80 or 128 bits.
2. The practical evaluation remains very narrow.
The prototype is evaluated only on Q12 GPT-2 Small with public prompts, bounded BPE call syntax, a trusted mock gateway, and seven handcrafted agent tasks. The full agent experiment also requires about 14 seconds per verified token and roughly 81 GiB of communication for 90 tokens. This establishes bounded feasibility, but not yet practical applicability to contemporary tool-using LLM agents or general JSON/MCP-style calls.
Questions for authors
Q1. What would the runtime and communication cost be if the added checks were parameterized for an 80-bit or 128-bit soundness target? Can the authors provide an end-to-end security statement that clearly separates the added-check error from the inherited backend and cryptographic assumptions?
Q2. How much of the proposed model-binding and authorization contribution is fundamentally new relative to combining zkAgent-style transcript verification with existing witness/commitment-linking techniques such as Artemis? A sharper statement of the irreducible technical novelty would help.
Q3. Can the authors provide evidence beyond the seven bounded tasks, for example more realistic JSON/MCP-style tool arguments or a larger model/configuration? Even a small additional experiment would help establish how much of the current design generalizes beyond the fixed parser and GPT-2 Small setting.