Proposal Explorer
ResetA verification proposal from the AI Verification Tech Map, from its records of 2026-10-09. https://trustbutveri.fyi/explorer/?mechanisms=M-0003,M-0019,M-0017&chips=existing&tested=analysis
Analysis
Applied filters: Chips: Existing chips only; Attack testing: Published analysis. Not set (Any): Prover, Verifier devices on site, Prover cooperation, Minimum development status, Keep hidden from the verifier.
Overview
| Mechanism | Development | Security evidence | Open failures |
|---|---|---|---|
| Whole-workload recomputation (reproducible packets) ⚠ excluded by your filters: attack testing: none | Proposed | No published adversarial analysis recorded | none |
| Chip registries and manufacturing records | Proposed | Published security analysis | 1 significant |
| Tamper evidence for verifier devices | Research demo | Published security analysis | 2 significant |
- Open failures: n critical n significant n minor
- ⚠ Dimmed: excluded by your filters
Claim coverageNo claims yet
Add claims to see which ones the mechanisms address.
Properties1 built for an adversarial prover
- Built for an adversarial prover
- Tamper evidence for verifier devices
- No new hardware needed
- Chip registries and manufacturing records
- Not counted
- Excluded by your filters: Whole-workload recomputation (reproducible packets)
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.
- Chip registries and manufacturing records: Analysis
- Tamper evidence for verifier devices: Analysis
Limits4 scope limitations · 1 open question · 1 excluded by filters · 2 not yet demonstrated · 2 mechanisms with open significant failures
- Excluded by your filters
- Whole-workload recomputation (reproducible packets) Attack testing is none; the filter asks for at least published analysis.
- Open significant failures
3 failures in 2 mechanisms
Documents and serial numbers can be forged in Chip registries and manufacturing records
Avellar and Grunewald note that export documents can be forged, that companies can hide information behind obscure corporate structures, and that it may be possible to forge serial numbers on chips and racks. They recommend cryptographic attestation of a powered-on chip as an extra check. 8
Known failure · Theoretical argument · Significant · Open. On the record
Seals are often defeated with simple methods in Tamper evidence for verifier devices
Published defeats of general security seals. They warn about proposed verifier-device seals, but do not demonstrate defeat of an AI verification enclosure or sensor.
In 1996 a Los Alamos vulnerability assessment defeated all 94 security seals it examined, with 132 defeats in total, using rapid, inexpensive, low-tech methods. It found that seal cost did not predict security. In 2001 Johnston reported that high-tech seals are often easier to defeat than low-tech ones. 19 20
Known failure · Demonstrated attack · Significant · Open · Mechanism-class evidence. On the record
Attack classes outside published models in Tamper evidence for verifier devices
The radio compensation result is emulated using measured channel data under a known-reference attacker model. It is not a physical bypass demonstration against an AI verifier enclosure.
The authors of the batteryless cover say they cannot assess chemical-solvent attacks, which exceed their expertise, and deem cover removal impractical. Anti-Tamper Radio's reference can drift as the environment or measurement system ages; the authors suggest gradually renewing the reference. A 2025 follow-up by some of the same authors shows, by emulation on measured channel data, that an attacker who knows the reference channel and the needle's effect on it could inject a signal that cancels the change caused by a needle insertion. It proposes a reconfigurable intelligent surface that randomizes the channel as a countermeasure. 12 13 21
Known failure · Open question · Significant · Open · Mechanism-class evidence. On the record
- Scope limitations
Spare compute is outside the scheme in Whole-workload recomputation (reproducible packets)
The plan states that it does not verify that spare compute is not used for unapproved workloads, because this seems very challenging. Recomputation checks the correctness of declared work, not its completeness. 1 2
Scope limitation · Theoretical argument. On the record
Related mechanism Proposed Proofs of useful work for capacity accounting: Proposed as one input to accounting for spare capacity on declared hardware. A pointer, not evidence that this failure is mitigated. Add
Records cover only chips that were recorded in Chip registries and manufacturing records
A registry or commitment accounts only for chips entered into it. Cankaya asks how a verifier would know it had found all chips, or how much "dark compute" remains, and notes that a fraudulent original record would mean unregistered chips had been made in advance. Halstead and Larsen propose reconstructing earlier production by auditing upstream suppliers. 9 11
Scope limitation · Theoretical argument. On the record
Related mechanism Proposed Remote detection of data centres: Looks for large data centres that were never declared, which a registry cannot show. A pointer, not evidence that this failure is mitigated. Add
Insiders could alter records before they are fixed in Chip registries and manufacturing records
Cankaya argues that insiders who can photograph process secrets could also tamper with production records. A commitment makes changes after publication detectable, but it cannot show that the records were accurate when committed. 9
Scope limitation · Theoretical argument. On the record
Security depends on inspection protocols in Tamper evidence for verifier devices
An inspection and protocol requirement drawn from safeguards and enclosure studies, not a reported break of a deployed AI verifier.
Johnston argues that a seal is no better than the protocols for using it, and that inspectors are usually given little useful information on how to detect tampering. The Sandia survey notes that larger enclosures are hard to inspect fully and that sensor data must be authenticated. 17 20
Scope limitation · Theoretical argument · Mechanism-class evidence. On the record
- Open questions
Non-compliant work could be encoded inside compliant-looking packets in Whole-workload recomputation (reproducible packets)
The plan notes that an AI company might try to encode a non-compliant workload inside a workload that looks compliant on the surface. 1
Open question · Theoretical argument. On the record
- Not yet demonstrated
- Proposed Whole-workload recomputation (reproducible packets) and Proposed Chip registries and manufacturing records
Possible additions2 for dependencies
Mechanisms on the map that are not in the proposal. Pointers, not recommendations.
-
- Whole-workload recomputation (reproducible packets) waits on it. Workloads are not reproducible by default, and achieving reproducibility may cost performance.
-
- Whole-workload recomputation (reproducible packets) waits on it. All traffic must reach the recomputation server via network taps, and the server's integrity is critical.
Dependencies2 missing prerequisites · 11 blockers
- Missing prerequisites
- Operational use Deterministic and bit-exact inference needed by Whole-workload recomputation (reproducible packets) Add
- Proposed Network taps and certifiers needed by Whole-workload recomputation (reproducible packets) Add
- Blockers
11 blockers recorded
- Whole-workload recomputation (reproducible packets)
- Workloads are not reproducible by default, and achieving reproducibility may cost performance. Performance & compatibility. Waits on Deterministic and bit-exact inference 1
- Network packets are not individually reproducible by default; making them so may need considerable software, firmware and hardware work. Amodo rates this 'not on track'. Performance & compatibility 4
- All traffic must reach the recomputation server via network taps, and the server's integrity is critical. Hardware trust. Waits on Network taps and certifiers 1 4
- Recomputing training steps needs checkpoints: writing one at every step would cost more than 100% overhead, so Amodo's design needs a spare data-parallel replica that tracks the weights instead. Performance & compatibility 2
- Chip registries and manufacturing records
- No implementation of an AI chip registry has been publicly reported, and covering re-exports would need cooperation from re-exporters and foreign governments that may not be feasible everywhere. Access & governance 7 8
- Linking records to physical chips needs hard-to-spoof unique IDs and inspections. Hardware trust 7 8 9
- Chips produced before a registry starts must be reconstructed from supplier records. Coverage & hidden compute 9 11
- Tamper evidence for verifier devices
- No tamper-evident enclosure has been designed for AI verifier hardware at retrofit scale. Hardware trust 18
- Battery-backed designs add bulk, limit operating temperature (+10 °C to +35 °C for the IBM 4765) and complicate transport. Performance & compatibility 13
- Active monitoring needs power, and visual inspection of large enclosures faces access limits. Access & governance 17
- No evaluation has been published in the AI verification setting. Adversarial validation 18
- Whole-workload recomputation (reproducible packets)
What the verifier sees1 depend on design
From the family or selected implementation's record.
- Model weights
Depends on the design for Whole-workload recomputation (reproducible packets).
Not involved: Chip registries and manufacturing records and Tamper evidence for verifier devices.
- Inputs and outputs
Depends on the design for Whole-workload recomputation (reproducible packets).
Not involved: Chip registries and manufacturing records and Tamper evidence for verifier devices.
- Training data
Depends on the design for Whole-workload recomputation (reproducible packets).
Not involved: Chip registries and manufacturing records and Tamper evidence for verifier devices.
Exposure notes
- Whole-workload recomputation (reproducible packets): Recomputing sampled units needs weights and sampled inputs or training data inside the checking environment. The design depends on securing that environment; disclosure depends on its confidentiality boundary. 1 2
- Chip registries and manufacturing records: Records chip identities and owners; it does not handle model data.
- Tamper evidence for verifier devices: Protects verifier devices; it does not handle model data.
Implementations1 system
- Whole-workload recomputation (reproducible packets)
- Proposed AI 2040 inference-only verification stack Proposed architecture, AI Futures Project
- Chip registries and manufacturing records
- None on the map
- Tamper evidence for verifier devices
- Proposed AI 2040 inference-only verification stack Proposed architecture, AI Futures Project
Sources21 cited
- Verification Plan, R. Dean (2026). Original
- Example Schemes for Verifying High-Stakes AI Agreements, Amodo Design (2026). Original
- Scaling Recomputation Inference Verification, Amodo Design (2026). Original
- AI 2040 Plan A — Verification SITREP, Amodo Design (2026). Original
- Get Involved in Verification, AI Futures Project (2026). Original
- Proof-of-Learning is Currently More Broken Than You Think, C. Fang et al. (2023). Original
- Verifying International Agreements on AI: Six Layers of Verification for Rules on Large-Scale AI Development and Deployment, M. Baker et al. (2025). Original
- Near-Term Verification Methods for AI Chip Exports, B. Avellar & E. Grunewald (2026). Original
- TSMC most definitely has a golden record of all AI chips it made, N. Cankaya (2025). Original
- Hardware-Level Governance of AI Compute: A Feasibility Taxonomy for Regulatory Compliance and Treaty Verification, S. Ansari (2026). Original
- Covert AI Projects, B. Halstead & T. Larsen (2026). Original
- Anti-Tamper Radio: System-Level Tamper Detection for Computing Systems, P. Staat et al. (2022). Original
- Secure Physical Enclosures from Covers with Tamper-Resistance, V. Immler et al. (2019). Original
- ImpedanceVerif: On-Chip Impedance Sensing for System-Level Tampering Detection, T. Mosavirik et al. (2023). Original
- IBM 4765 Cryptographic Coprocessor Security Module: Security Policy, IBM Corporation (2012). Original
- PHYSEC SEAL: Change detection for maximum safety, PHYSEC GmbH (2026). Original
- Tamper-Indicating Enclosures, A Current Survey, H. A. Smartt & Z. N. Gastelum (2015). Original
- A System Overview for Near-Term, Low-Trust AI Compute Verification, N. Cankaya (2026). Original
- Physical Security and Tamper-Indicating Devices, R. G. Johnston & A. R. E. Garcia (1996). Original
- Tamper Detection for Safeguards and Treaty Monitoring: Fantasies, Realities, and Potentials, R. G. Johnston (2001). Original
- Anti-Tamper Radio Meets Reconfigurable Intelligent Surface for System-Level Tamper Detection, M. S. Tabar et al. (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.
22 of 25 mechanisms match · Clear all
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