The paper proposes a zero‑knowledge verification framework for frontier AI training, combining pre‑committed specifications, network observations, and live Merkle commitments to create a succinct proof layer via a zero‑knowledge virtual machine (zkVM). It outlines how proofs can verify BF16/FP32 semantics step‑by‑step, enforce policy‑relevant claims, and provide a governance‑auditable training record, while also discussing sampling guarantees, weight smuggling risks, and the relative robustness of global training budgets versus per‑run FLOP caps. The authors compare zkVMs, custom circuits, and interactive audits, and identify remaining research and engineering challenges for external contributors.
arXiv:2606. 05433v1 Announce Type: new Abstract: Frontier AI governance frameworks increasingly use cumulative training compute as the primary criterion for designating high-impact models, but enforcement rests on self-reporting because no technical verification primitive for training exists.
The paper introduces Open-1B, a language model trained under a new fully auditable regime that ensures every training operation is reproducible on heterogeneous commodity hardware with bitwise certainty. By enforcing a fixed order on sources of nondeterminism—GPU reductions, data batch ordering, and inter/intra-node communication—the authors enable auditors to replay and verify individual training steps on a single machine. The release includes the full pretraining dataset, all intermediate checkpoints, the training codebase, and an audit harness for step-by-step verification.
arXiv:2510. 16028v4 Announce Type: replace-cross Abstract: Neural networks increasingly run on hardware outside the user's control (cloud GPUs, inference marketplaces).
OVIG is an optimistic verification framework that audits AI training by replaying the process and comparing gradient differences against an empirically calibrated boundary. It treats any gradient difference exceeding this boundary as a malicious deviation. By partitioning training into stride‑s intervals and storing evidence only at interval endpoints, OVIG dramatically reduces off‑chain storage and transmission costs while maintaining zero attack success rate across language, vision, and diffusion workloads.
arXiv:2603. 18046v2 Announce Type: replace-cross Abstract: We present NanoZK, a zero-knowledge proof system for verifiable LLM inference: clients and third-party auditors check that a provider executed the advertised model on a committed input without learning weights or activations.
arXiv:2610.08258v1 Announce Type: new Abstract: Auditing the claimed outcomes of large language model (LLM) training is challenging when model weights and training data are private, while cryptograph...
Werracle is a zero‑storage on‑chain AI decision oracle that fits into a single 32‑byte EVM storage slot and uses procedural Mandelbrot dynamics to generate continuous non‑linear decision hyperplanes from a 24‑byte coordinate triplet. Implemented in pure Solidity bytecode with fixed‑point arithmetic, it evaluates a 16‑point Pareto micro‑grid in only 21,438 gas, achieving sub‑millisecond latency on Layer‑2 rollups. The protocol is formally verified with a 1,000‑test deterministic suite and is deployed live on an EVM devnet, demonstrated through a Uniswap v4 dynamic fee governor that adjusts liquidity provider fees in real time.
The paper introduces Numbat, a self‑contained machine‑learning stack implemented entirely in Zig with no external runtime dependencies. It covers tensor computation, automatic differentiation, neural‑network modules, mixed precision, multi‑GPU training, data loading, and monitoring, and exposes a stable C ABI with over 1,400 entry points and bindings for six languages. The authors verify the stack against a reference implementation at multiple levels, uncovering ten silent recipe divergences, and demonstrate its practical capability by training a 25.9M‑parameter YOLOv8m detector on COCO 2017, achieving a competitive mAP score and matching single‑GPU performance.
The paper introduces a privacy‑preserving zk‑SNARK audit framework that uses adversarial‑style probes to detect logit drift between an approved large language model and a modified deployment. It offers three probe families—token‑based (black‑box), embedding‑based (gray‑box), and stress probes (partial white‑box)—allowing users to balance sensitivity, access, and cost. Experiments across LLM architectures and GPU platforms show token‑based probes achieve the highest mean sensitivity while remaining practical in a black‑box setting, with Groth16 proving times scaling modestly from 1.02 to 1.78 seconds and constant proof size.
The paper investigates whether interactive arguments for oracle‑aided AI computations can be zero‑knowledge, meaning the verifier learns nothing beyond the correctness of the output. It proves that, in general, zero‑knowledge proofs for all oracle‑aided computations are impossible, even in the random oracle model, and this impossibility extends to debate protocols. However, if the oracle signs each answer with a cryptographic signature, then every oracle‑aided computation can be verified in zero‑knowledge with efficient provers and verifiers, assuming only collision‑resistant hash functions.
The paper "Beyond Training: A Feasibility Taxonomy for Inference-Time AI Governance" presents a taxonomy of twenty inference‑time mechanisms for monitoring, verification, and enforcement, each evaluated on a four‑point readiness scale using evidence from four vendors. It applies this taxonomy to a two‑dimensional adversary model and maps the mechanisms to four governance scenarios, finding that most mechanisms are commercially available but only adequate against cooperative or low‑to‑medium‑capability users, not high‑capability state‑level deployers. The study also links inference‑stage controls to hardware‑stage mechanisms through a substitution principle and reports a second‑rater reliability of 0.74. whyItMatters":"The work identifies the current gaps and readiness of inference‑time governance tools, highlighting that existing mechanisms are insufficient against powerful adversaries and thus informing future regulatory and technical development."
NanoProof is the first factorized execution‑guided theorem prover in Lean 4 whose training data, tooling, pipeline, and weights are all publicly released, enabling end‑to‑end reproducibility with open‑source resources. The authors provide a dataset of structured proof trees and a programmatic interaction tool for Lean 4, emphasizing compute efficiency to make training and evaluation more accessible. NanoProof achieves a 50.8% pass@16 on MiniF2F‑Test, outperforming comparable systems while using far less compute, demonstrating that such provers can be rebuilt from scratch with modest resources.