Proposal Explorer
ResetA verification proposal from the AI Verification Tech Map, from its records of 2026-10-09. https://trustbutveri.fyi/explorer/?mechanisms=M-0010,M-0022,M-0002&implementations=M-0022:I-0011
Analysis
Applied filters: none. Every filter is set to Any.
Overview
| Mechanism | Development | Security evidence | Open failures |
|---|---|---|---|
| On-chip telemetry from timing, memory and performance counters | Research demo | Published attack testing | 2 significant |
| Side-channel suppression for isolated facilitiesAI 2040 inference-only verification stack | Proposed | No published adversarial analysis recorded | 1 significantFamily context below |
| Deterministic and bit-exact inference | Operational use | Published security analysis | none |
- Open failures: n critical n significant n minor
Claim coverageNo claims yet
Add claims to see which ones the mechanisms address.
Properties1 with operational use · 2 built for an adversarial prover
- Operational use
- Operational use Deterministic and bit-exact inference for reproducing open-model inference from receipts in Gensyn's information-market service
- Built for an adversarial prover
- Side-channel suppression for isolated facilities and Deterministic and bit-exact inference
- No new hardware needed
- On-chip telemetry from timing, memory and performance counters and Deterministic and bit-exact inference
Attack testing2 mechanisms with published testing
Attack testing records published testing for this use. It does not by itself show independent review, a formal proof or that a deployed system is secure.
Limits1 family with findings to check · 6 scope limitations · 1 open question · 1 not yet demonstrated · 2 mechanisms with open significant failures
- Family findings
- Side-channel suppression for isolated facilities
Context for AI 2040 inference-only verification stack. Findings from the mechanism family appear here as context. They apply to an implementation only when its own record lists them, under the conditions stated there.
Supply-chain implants may evade inspection in Side-channel suppression for isolated facilities
Cankaya identifies malicious hardware embedded deep in purchased components as a residual risk that visual inspection and disassembly may not catch. He notes that radiographic examination under high-security standards could mitigate it. 13
Open question · Theoretical argument. On the record
Openings for airflow, power and optics weaken shielding in Side-channel suppression for isolated facilities
Cankaya notes that keeping attenuation high while passing high-power airflow, cabling and optical links adds complexity beyond existing shielded-enclosure specifications. 13
Scope limitation · Theoretical argument. On the record
Inspection assumptions may not hold in Side-channel suppression for isolated facilities
The design's statistical argument assumes that visual or disassembly inspection catches every flaw that is present in a sampled unit. Cankaya is unsure whether destructive teardowns are defence-dominant or offence-dominant. 13
Open question · Open question. On the record
- Side-channel suppression for isolated facilities
- Open significant failures
3 failures in 2 mechanisms
Adversarially disguised fine-tuning partly evades classification in On-chip telemetry from timing, memory and performance counters
Across 20 evasion strategy families in five monitor-evader rounds, the classifier's accuracy against the most challenging disguised workloads held out from training was 43–87%. White-box LoRA fine-tuning was the only evasion family detected less than half the time. The evaluation covered single nodes, PyTorch-level evasion and NVIDIA hardware. 3
Known failure · Demonstrated attack · Significant · Open. On the record
Counters leak information about protected workloads in On-chip telemetry from timing, memory and performance counters
Performance counters have been used as a side channel against TEEs, for example in CounterSEVeillance. NVIDIA disables performance counters in full confidential-computing mode, stating that they could provide an avenue for side-channel attacks. Richer counters for verification therefore pull against confidentiality. 4 5
Known failure · Theoretical argument · Significant · Open. On the record
A recomputation family degrades against prompt-controlling adversaries in AI 2040 inference-only verification stack
The plan's companion page names DiFR among the recomputation schemes being tested. An independent study found that Gumbel-based inference verification, the family that includes Token-DiFR, leaks roughly twice as many bits per token when the adversary chooses prompts that disrupt the text's structure, across six models of 1 to 32 billion parameters. The slowdown it imposes on a hidden-signalling adversary falls from 146–254 times under benign prompts to 60–118 times. The attack weakens the bound on hidden information in outputs, which the plan relies on to keep undeclared results from leaving. 6 7 11 12
Known failure · Demonstrated attack · Significant · Open. On the record
- Scope limitations
Software-read telemetry can be forged by the operator in On-chip telemetry from timing, memory and performance counters
NVML-based classification assumes trustworthy telemetry. Without a tamper-resistant read path, an authenticated telemetry channel and secure boot of the monitoring software, an operator who controls the full software stack could forge counter values. Monfared et al. start from the same premise: current GPUs expose little trusted telemetry and can be modified or virtualized. 1 3
Scope limitation · Theoretical argument. On the record
Related mechanism Proposed Hardware-enabled guarantees (flexHEG) and guarantee processors: A guarantee processor on the chip would give the tamper-resistant, authenticated telemetry path the flaw says is missing. A pointer, not evidence that this failure is mitigated. Add
Timing challenges do not identify the individual chip in On-chip telemetry from timing, memory and performance counters
GEMM and VDF challenges can be answered by identical GPUs elsewhere, and floating-point fingerprints distinguish GPU models, not individual devices. GPU virtualization adds timing leakage that prevents attributing compute use. 1
Scope limitation · Theoretical argument. On the record
The recomputation server must be trusted in AI 2040 inference-only verification stack
The plan calls the integrity of the recomputation server an extremely important aspect, and its argument that sampling verifies all outputs assumes that the server's computations and outputs can be trusted. The companion page notes that the server sits inside the prover's facility, possibly under the prover's physical control, and that hardening it against integrity attacks needs significant research. Amodo rates recomputation-server security as not on track. 6 7 9
Scope limitation · Theoretical argument. On the record
Spare compute is not verified in AI 2040 inference-only verification stack
The plan states that it does not verify that spare compute is unused for unapproved workloads, because this seems very challenging. It relies instead on side-channel bounds and memory wipes, so that the only results that persist are verified inference outputs. 6
Scope limitation · Theoretical argument. On the record
Some kernels remain genuinely nondeterministic in Deterministic and bit-exact inference
The bit-exact work separates kernels that are deterministic but not batch-invariant from truly nondeterministic ones that use atomic functions. Some integer de-quantization kernels use atomic additions and remain nondeterministic, so exact replay needs backends that avoid them. 14
Scope limitation · Open question. On the record
Cross-hardware replay relies on reverse-engineered, closed behaviour in Deterministic and bit-exact inference
Emulating one GPU's rounding on another requires reverse-engineering tensor-core arithmetic and modelling proprietary kernel choices. Hawkeye covers a subset of NVIDIA architectures and states that attention and other higher-level operations need further reverse engineering. For the bit-exact emulator, a proprietary Hopper kernel family is an open edge case. 14 16
Scope limitation · Open question. On the record
- Open questions
No quantified error rates or formal thresholds for timing primitives in On-chip telemetry from timing, memory and performance counters
Monfared et al. state that false-positive and false-negative rates are not quantified and leave hardware-specific formal thresholds to future work. 1
Open question · Open question. On the record
- Not yet demonstrated
- Proposed Side-channel suppression for isolated facilities
Possible additions7 for dependencies
Mechanisms on the map that are not in the proposal. Pointers, not recommendations.
-
- Side-channel suppression for isolated facilities waits on it. Checking that taps are correctly installed and stay in place at scale is not a solved problem, and hardening the recomputation server inside the prover's facility needs significant research.
-
- On-chip telemetry from timing, memory and performance counters waits on it. Shipping accelerators need a tamper-resistant, authenticated telemetry path.
-
- Side-channel suppression for isolated facilities waits on it. Memory wiping may use existing algorithms, but hardware testing is at an early stage.
-
- Side-channel suppression for isolated facilities waits on it. Passive optical taps work at 400G, but the 800G and 1600G line rates now arriving in data centres are undemonstrated.
-
- Side-channel suppression for isolated facilities waits on it. A fully reproducible inference stack needs substantial software and tooling, and per-packet network reproducibility may need considerable software, firmware and possibly hardware work.
-
- Side-channel suppression for isolated facilities depends on it.
-
- On-chip telemetry from timing, memory and performance counters depends on it.
Dependencies3 missing prerequisites · 14 blockers
- Missing prerequisites
- Operational use TEE remote attestation for AI workloads needed by On-chip telemetry from timing, memory and performance counters Add
- Operational use Sampled inference recomputation needed by Side-channel suppression for isolated facilities Add
- Proposed Whole-workload recomputation (reproducible packets) needed by Side-channel suppression for isolated facilities Add
- Blockers
14 blockers recorded
- On-chip telemetry from timing, memory and performance counters
- Shipping accelerators need a tamper-resistant, authenticated telemetry path. Hardware trust. Waits on Hardware-enabled guarantees (flexHEG) and guarantee processors 2 3
- NVIDIA's full confidential-computing mode disables the hardware performance counters its profiling tools use, so telemetry that needs them conflicts with it. Privacy & leakage 4 5
- Continuous challenge puzzles cost power and throughput on production workloads. Performance & compatibility 1
- Evaluation has not gone beyond single nodes, framework-level evasion and one vendor's hardware. Adversarial validation 3
- Side-channel suppression for isolated facilities
- A fully reproducible inference stack needs substantial software and tooling, and per-packet network reproducibility may need considerable software, firmware and possibly hardware work. Performance & compatibility. Waits on Whole-workload recomputation (reproducible packets) 7
- Passive optical taps work at 400G, but the 800G and 1600G line rates now arriving in data centres are undemonstrated. Performance & compatibility. Waits on Network taps and certifiers 7
- Checking that taps are correctly installed and stay in place at scale is not a solved problem, and hardening the recomputation server inside the prover's facility needs significant research. Hardware trust. Waits on Tamper evidence for verifier devices 7 9
- There is no plan yet for quickly scaling side-channel defences on a frontier cluster; only early theoretical pieces exist. Coverage & hidden compute. Waits on Side-channel suppression for isolated facilities 7
- Memory wiping may use existing algorithms, but hardware testing is at an early stage. Coverage & hidden compute. Waits on Memory wiping and proofs of secure erasure 7
- Robust red-teaming of recomputation schemes has not started, and most algorithm development remains academic. Adversarial validation 7 9
- Deterministic and bit-exact inference
- Batch-invariant kernels cost throughput: in Thinking Machines' Qwen3-8B test, an improved deterministic build took 42 s against 26 s for vLLM's default, and SGLang reports an average 34.35% slowdown on its FlashInfer and FlashAttention 3 backends. Performance & compatibility 15 17
- Coverage is incomplete: the bit-exact emulator targets dense blocks on NVIDIA GPUs and excludes mixture-of-experts inference and training, and vLLM's batch-invariant mode is in beta, with open work on AMD hardware and speculative decoding. Performance & compatibility 14 18 25
- Amodo's status page for the AI 2040 verification plan rates a reproducible inference stack for that plan as 'not started'. Performance & compatibility 9
- Exact replay requires the prover to disclose weights, software versions, parallelism and batch sizes to whoever recomputes. Privacy & leakage 14 24
- On-chip telemetry from timing, memory and performance counters
What the verifier sees1 unspecified · 2 depend on design
From the family or selected implementation's record.
- Model weights
Depends on the design for On-chip telemetry from timing, memory and performance counters and Deterministic and bit-exact inference.
Unspecified for Side-channel suppression for isolated facilities. Check the implementation record.
- Inputs and outputs
Depends on the design for On-chip telemetry from timing, memory and performance counters and Deterministic and bit-exact inference.
Unspecified for Side-channel suppression for isolated facilities. Check the implementation record.
- Training data
Depends on the design for On-chip telemetry from timing, memory and performance counters.
Not involved: Deterministic and bit-exact inference.
Unspecified for Side-channel suppression for isolated facilities. Check the implementation record.
Exposure notes
- On-chip telemetry from timing, memory and performance counters: Counters do not read weights or data, but richer counters can leak secrets through side channels.
- Side-channel suppression for isolated facilities, AI 2040 inference-only verification stack: This Explorer has no asset-specific exposure assessment for this implementation. Check its source and deployment assumptions.
- Deterministic and bit-exact inference: Exact replay needs the weights, configuration and replayed requests inside the recomputation environment. What the verifier sees depends on whether that environment keeps them confidential. 14 24
Implementations5 systems
- On-chip telemetry from timing, memory and performance counters
- None on the map
- Side-channel suppression for isolated facilities
- Proposed AI 2040 inference-only verification stack Proposed architecture, AI Futures Project
- Proposed Low-trust AI compute verification system overview Proposed architecture, Machine Intelligence Research Institute
- Proposed RAND secure inference data center (SIDC) design Proposed architecture, RAND
- Deterministic and bit-exact inference
- Research demo Batch-invariant inference kernels (Thinking Machines) Open-source project, Thinking Machines Lab
- Operational use Verde and RepOps (Gensyn) Product, Gensyn
- Proposed Low-trust AI compute verification system overview Proposed architecture, Machine Intelligence Research Institute
Sources25 cited
- Timing and Memory Telemetry on GPUs for AI Governance, S. K. Monfared et al. (2026). Original
- Guaranteeable Memory: An HBM-Based Chiplet for Verifiable AI Workloads, J. Petrie (2025). Original
- Detecting Hidden ML Training With Zero-Overhead Telemetry, R. Rahman & S. Tajdari (2026). Original
- On TEEs for Privacy-Preserving Monitoring in AI Governance, Gloria Z (2026). Original
- NVIDIA Secure AI with Blackwell and Hopper GPUs (White Paper), NVIDIA (2025). Original
- Verification Plan, R. Dean (2026). Original
- Get Involved in Verification, AI Futures Project (2026). Original
- Verifying international AI deals: Plan A, the state-of-play, and what you can do to help, T. Milton et al. (2026). Original
- AI 2040 Plan A — Verification SITREP, Amodo Design (2026). Original
- Fitting a Network TAP to our Inference Verification Prototype, Amodo Design (2026). Original
- Verifying LLM Inference to Detect Model Weight Exfiltration, R. Rinberg et al. (2025). Original
- Adversarial Entropy Inflation Against Gumbel-Based Inference Verification, N. Kezins (2026). Original
- Suppressing Side Channels in an Untrusted Data Center via Retrofitted Defenses, N. Cankaya (2026). Original
- Bit-Exact AI Inference Verification Without Performance Tradeoffs, N. Cankaya (2026). Original
- Defeating Nondeterminism in LLM Inference, H. He & Thinking Machines Lab (2025). Original
- Hawkeye: Reproducing GPU-Level Non-Determinism, E. Badash et al. (2026). Original
- Towards Deterministic Inference in SGLang and Reproducible RL Training, The SGLang Team (2025). Original
- Batch Invariance (vLLM documentation), vLLM project (2026). Original
- gensyn-ai/ree: Gensyn Reproducible Execution Environment (GitHub repository), Gensyn (2026). Original
- EigenCloud Brings Verifiable AI to Mass Market with EigenAI and EigenCompute Launches, EigenCloud (2025). Original
- Building Delphi: Pricing, Settlement, and Agentic Trading, D. Jedamski (2026). Original
- Reproducible Execution Environment (REE) (Gensyn documentation), Gensyn (2026). Original
- What is Delphi? (Delphi documentation), Gensyn (2026). Original
- A System Overview for Near-Term, Low-Trust AI Compute Verification, N. Cankaya (2026). Original
- [Feature]: Batch Invariant Feature and Performance Optimization (vLLM issue #27433), vLLM project contributors (2025). Original
Share the link to this proposal. This proposal is also available as plain text and JSON.
Filter mechanisms
Filters apply to mechanisms only. They describe the setting a proposal is for, and all are off by default. A mechanism that a filter rules out is flagged and does not count towards claim coverage. Selected implementations use their own record fields. A match means not excluded; conditional or unspecified exposure stays with a note. Passing a filter does not establish that the assumptions hold in a deployment.
All 25 mechanisms match.
Prover
How far can the party being checked be trusted?
The prover is the party being checked. Semi-trusted designs rely on part of its stack: usually the chip vendor's hardware root of trust, its firmware or counters, or its supply-chain records. Adversarial designs aim to hold even if it cheats wherever the checks allow, within their stated assumptions.
Keeps mechanisms whose threat model holds against at least this prover. Adversarial is the strongest assumption. Definitions
Verifier devices on site
May the verifier install its own hardware at the prover's sites?
Some mechanisms need a device the verifier owns or trusts at the prover's facility, such as a network tap, a bandwidth limiter or a sealed sensor. Choose Not allowed when the setting rules that out. Inspectors are not covered.
"Not allowed" removes mechanisms that need a retrofit device, such as a network tap or a sealed sensor. Definitions
Prover cooperation
How much must the prover take part?
Required: the prover takes part, for example by logging requests, producing proofs or opening records. Partial: some access, such as installing a device. Not required: works from outside, such as satellite imagery.
"Partial at most" removes mechanisms that need the prover's active participation. "Not required" keeps only those that work without it. Definitions
Chips
May the proposal depend on new chip designs?
New chip features take years to reach a deployed fleet and cover only chips made after they ship. Mechanisms that use shipping features, such as trusted execution environments or performance counters, stay.
"Existing chips only" removes mechanisms that need changes to future chip designs. Definitions
Minimum development status
Development status
A level describes the public evidence for a mechanism's stated use, not its cost or feasibility. R3 can still have open critical flaws.
Keeps mechanisms whose readiness level is at least this one. Definitions
Attack testing
How hard has each mechanism been attacked in public?
The strongest published attempt to break the mechanism for its verification use: a security analysis, red-teaming by its developers or collaborators, or a red team independent of them.
Keeps mechanisms whose strongest published attack testing is at least this. Definitions
Keep hidden from the verifier
What must the verifier never see? Choose any.
Model weights: the checked model's parameters. Inputs and outputs: the requests a deployed model serves and its responses. Training data: what a model was trained on. Each mechanism's exposure is the editors' reading of its record: shown, depends on the design (kept, with a note), hidden, not involved, or unspecified for a selected implementation. Code and configuration are not covered yet.
Removes mechanisms that show the asset to the verifier. Conditional or unspecified exposure stays with a note and needs checking against the privacy requirement.
Claims
A claim is something one party wants to verify about another party's AI hardware or software. Each claim's number shows how the proposal addresses it.
- Addressed. A mechanism in the proposal is aimed at this claim and is not excluded by the filters.
- Partly addressed. Only supporting mechanisms, or mechanisms aimed at it that the filters exclude.
- Unaddressed. No mechanism in the proposal addresses this claim.
Addressed means a mechanism in the proposal is aimed at the claim and is not excluded by your filters. It does not mean the claim is verified: check its assessed use, development status, security evidence, assumptions and findings.
Mechanisms
A mechanism is a general technique for verifying claims. Its badge is its development status for its stated use. An optional implementation choice narrows its assumptions, assessed use and claim links to that record. Lines join it to the claims it addresses. Click a line for details.Under its name it lists the claims it is aimed at or supports.
- Aimed at the claim: verifying it is a direct purpose of the mechanism.
- Supports the claim: helps verify it without being aimed at it.
- Faint: excluded by your filters, so it does not count towards claim coverage.
Overview
One row per mechanism in the proposal. Every mark comes from that mechanism's record, as listed in the panels below; what the verifier sees is the editors' reading of the record's text. Failure counts are per mechanism. Summary counts name mechanisms with open failures, not a sum of attacks. Choosing an implementation narrows each row to that record's assessed use; family findings remain as context. Findings are grouped as known failures, scope limitations and open questions. Only known failures count as failures. Counts are an inventory of published findings, not a risk score.
What the verifier sees
For model weights, inputs and outputs, and training data. This is the editors' reading of each mechanism's record (its threat model, how it works and its limitations), not a field of the record. Shown: the verifier sees it. Depends: on the design or variant, or the verifier sees only samples. Hidden: the verifier sees only commitments, hashes, proofs or results. Not involved: the record does not handle it. Unspecified: the selected implementation has no asset-specific assessment here.
Possible additions
Mechanisms on the map, not in the proposal, that the records connect to an unaddressed or partly addressed claim, an open failure or a dependency. They are pointers, not recommendations: each brings its own readiness level and findings, and none is claimed to close a failure. Links from failures are the editors' reading of the two records.
Start from a goal
A goal is something a rule or agreement about AI sets out to achieve. Choosing one loads the claims it needs verified. Your mechanisms and filters stay as they are.
- Cap frontier training2 direct, 3 supportingKeep every AI training run below an agreed amount of compute.
- Pause frontier AI development2 direct, 3 supportingStop new AI training runs and experiments for an agreed period, while existing models stay in service.
- Deploy only evaluated models2 direct, 3 supportingDeploy powerful AI models widely only after their risks have been evaluated and judged manageable.
- Prevent catastrophic misuse2 direct, 2 supportingKeep capable AI models from helping anyone carry out catastrophic attacks, such as biological or chemical ones.
- Prevent weight theft1 direct, 1 supportingKeep the weights of capable AI models from being copied out of the facilities that hold them.
- Enforce chip export controls1 directKeep export-controlled AI chips at the destinations they were authorised for.
Start from a published design
Choosing a design loads the mechanisms its record realises or depends on. If the proposal has no claims yet, it also loads the claims that record says the design addresses.
- AI 2040 inference-only verification stack7 mechanismsProposed architecture, AI Futures Project
- Low-trust AI compute verification system overview7 mechanismsProposed architecture, Machine Intelligence Research Institute
- RAND secure inference data center (SIDC) design2 mechanismsProposed architecture, RAND