{"id":"bf07a6f7-dc7e-41f5-82a7-5f9ac330bb29","arxiv_id":"2611.17042","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"A four-layer framework and cross-system measurements reveal that the dominant cost of zero-knowledge proofs for AI workloads shifts with proof system and input length, with fixed-weight opening costs constant and memory capacity a binding constraint.","lead":"This paper presents a four-layer framework that connects verifiable AI workloads, proof systems, cryptographic kernels, and hardware platforms, and adds original measurements of six provers and seven kernels to identify where proof-generation costs actually go.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek/deepseek-v4-flash","headline":"No significant objection identified","rationale":"The reader's verdict is ACCEPT with HIGH confidence, and the weakest assumption identified is the generalizability beyond sumcheck-based provers. The paper itself states this limitation explicitly in Section IV-A: 'Full-scale coverage is mostly restricted to sumcheck-based provers; the non-sumcheck point is a CPU-only multilayer-perceptron block, and the commitment comparison is made on one transformer block.' The paper does not claim that its cost breakdowns apply to all proof systems; it presents them as measurements of specific systems and draws conclusions that are appropriately scoped. The central claim—that the dominant cost shifts with proof system and input length, that fixed-weight opening costs are stable, and that memory capacity is a first-order constraint—is well-supported by the measurements presented. The kernel profiling and roofline analysis are careful and provide new insights. The hardware review is thorough and identifies gaps in the literature. The paper is a significant contribution to understanding where costs go in verifiable AI proof generation, and it does not overclaim. Therefore, no adjustment to the verdict is needed. The agreement with the reader is 'agree' because the reader's weakest assumption is the same limitation the paper acknowledges, and the reader's verdict is appropriate.","tokens_in":29183,"tokens_out":687,"duration_ms":9324,"concrete_test":"If one wanted to test the generalizability of the cost trends beyond sumcheck-based provers, one could implement a hash-based prover (e.g., using Brakedown or Basefold commitments) for a small transformer block (e.g., 1 layer, 128 hidden dimension) and measure the cost breakdown using the paper's taxonomy. If the dominant cost categories differ substantially from those reported for sumcheck-based provers (e.g., if encoding and hashing dominate rather than sumcheck and lookup), then the paper's claim that 'no single cost dominates' would need qualification for that family. However, the paper already acknowledges this as a limitation and does not claim the trends hold for hash-based systems.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper is a measurement study and framework paper, not a derivation of a new cryptographic scheme or a claim of a universal law. Its central claim is that the cost profile of verifiable AI proof generation shifts with the proof system and input length, that fixed-weight opening costs are stable, and that memory capacity is a first-order constraint. The authors explicitly acknowledge the main limitation: full-scale coverage is mostly restricted to sumcheck-based provers, and the non-sumcheck point is a CPU-only MLP block. They do not overclaim generalizability beyond the measured systems. The measurements are carefully conducted, the limitations are clearly stated, and the conclusions are appropriately hedged. The paper's own sentences confirm that the authors are aware of the scope and do not assert universal applicability. Therefore, no load-bearing concern about the central argument arises from the evidence presented. The weakest assumption identified by the reader (generalizability beyond sumcheck-based provers) is the same limitation the paper itself states, and it is not a flaw in the argument but a scope condition. The paper's contribution is a well-executed measurement study and a useful framework, and it does not make unsupported claims.","agreement_with_reader":"agree"},"referee_report":null,"author_rebuttal":null,"desk_editor":{"model":"deepseek/deepseek-v4-flash","letter":"This paper is worth reading if you work on hardware for zero-knowledge proofs, especially for AI workloads. It does two things well. First, it provides a clean four-layer framework (workload → proof system → kernel → hardware) that organizes a messy literature. Second, it contributes original, careful measurements of six provers and seven kernels on real A100 GPUs, with a common cost taxonomy and roofline analysis using measured roofs. The key findings are that no single kernel dominates across systems, that fixed-weight opening costs are constant with input length, and that memory capacity (not just bandwidth) is a first-order constraint. The kernel profiling also corrects some folklore: low-degree sumcheck is instruction-issue-bound, not memory-bound, on this hardware.\n\nThe soft spots are real but contained. The measurements are mostly restricted to sumcheck-based provers; the authors say this explicitly. The non-sumcheck point is a CPU-only MLP block, and the commitment comparison is on one transformer block. So the framework's predictions for hash-based or lattice-based systems at scale remain untested. The engineering waterfall (Section IV-D) is interesting but inconclusive—the authors themselves say it does not bound the gains from hardware. The paper also leans heavily on the reader accepting that the four-layer framework is a contribution rather than a taxonomy; I think it is a useful organizational tool, but it is not a theoretical result.\n\nWho is this for? Hardware architects working on ZKP accelerators, and system builders who need to know where to optimize. The paper does not overclaim; it presents its findings as a starting point for workload-aware design. The measurements are reproducible (public code, documented methodology).\n\nRecommendation: This deserves a serious peer review. The measurements are solid, the limitations are stated, and the framework is useful even if incomplete. I would accept it with minor revisions—mostly asking for a clearer separation of what is measured versus what is extrapolated, and a note on whether the roofline analysis would change on H100 or AMD hardware. I would not desk-reject it.","headline":"Careful measurement study of ZKP costs for AI workloads; useful framework, honest about its sumcheck-only scope.","tokens_in":29939,"tokens_out":498,"duration_ms":8294},"pith_extraction":null,"created_at":"2026-11-13T07:10:55.096730+00:00","model_set":{"reader":"deepseek/deepseek-v4-flash"},"pipeline_version":"pith-pipeline@v1.4.1-daily-deepseek-or-medium","input_kind":null,"input_chars":null,"input_total_chars":null,"passes_missing":null,"published_standing":null,"published_confidence":null,"objection_audit":null,"run_record":null,"basis":{"kind":"not_recorded","source":null,"chars_given":null,"chars_total":null},"receipt":null,"falsifier":null,"supporting_citations":[],"lane_accuracy":{"status":"not yet measured","lane":{"model":"deepseek/deepseek-v4-flash","input_kind":null},"url":"https://pith.science/accuracy"},"review_version":1}