Proposal Explorer
ResetA verification proposal from the AI Verification Tech Map, from its records of 2026-10-09. https://trustbutveri.fyi/explorer/?mechanisms=M-0009,M-0016,M-0020,M-0017
Analysis
Applied filters: none. Every filter is set to Any.
Overview
| Mechanism | Development | Security evidence | Open failures |
|---|---|---|---|
| Hardware-enabled guarantees (flexHEG) and guarantee processors | Proposed | Published security analysis | 3 significant |
| Timed challenge-response and memory-occupation challenges | Research demo | Published security analysis | 1 significant |
| Remote detection of data centres | Proposed | Published security analysis | none |
| Tamper evidence for verifier devices | Research demo | Published security analysis | 2 significant |
- Open failures: n critical n significant n minor
Claim coverageNo claims yet
Add claims to see which ones the mechanisms address.
Properties4 built for an adversarial prover
- Built for an adversarial prover
- Hardware-enabled guarantees (flexHEG) and guarantee processors, Timed challenge-response and memory-occupation challenges, Remote detection of data centres and Tamper evidence for verifier devices
- No new hardware needed
- Timed challenge-response and memory-occupation challenges and Remote detection of data centres
Attack testing4 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.
Limits5 scope limitations · 3 open questions · 2 not yet demonstrated · 3 mechanisms with open significant failures
- Open significant failures
6 failures in 3 mechanisms
State attackers can likely defeat current secure enclosures in Hardware-enabled guarantees (flexHEG) and guarantee processors
The flexHEG authors write that "nation-state attackers can likely compromise the best current secure enclosures", and that the marginal cost of circumvention per device is hard to estimate. RAND similarly judges that anti-tamper measures "would not be insurmountable for a determined and well-resourced adversary", although they raise costs and can reveal tampering. 2 4
Known failure · Theoretical argument · Significant · Open. On the record
Firmware-only retrofits rely on Secure Boot, which fault injection can bypass in Hardware-enabled guarantees (flexHEG) and guarantee processors
Part II notes that the most common attack on Secure Boot replaces the firmware and applies a voltage glitch while the signature is being checked. It also notes that sophisticated actors may use microprobing or laser voltage probing to read key registers. 2
Known failure · Theoretical argument · Significant · Open. On the record
FLOP accounting can be laundered through external data in Hardware-enabled guarantees (flexHEG) and guarantee processors
Results of earlier or parallel workloads could be hidden in the "external data" fed to a device, which would falsify the total FLOP count unless the inputs are explained or time delays are imposed. 2
Known failure · Theoretical argument · Significant · Open. On the record
Remote memory narrows the timing margin in Timed challenge-response and memory-occupation challenges
Data-centre remote memory access returns in about 1–2 µs, against about 70–200 ns for local DRAM. The MIRI overview says verification of memory saturation depends on ruling out remote access by latency or physical disconnection. It names pre-staging data into local memory as the remaining evasion and proposes an unpredictable, capacity-filling challenge to close it. 7
Known failure · Theoretical argument · Significant · Open. On the record
Related mechanism Research demo Bandwidth limits and compartmentalization: Physical disconnection is proposed to exclude remote memory between the separated groups during a challenge. It depends on the isolation boundary being enforced. A pointer, not evidence that this failure is mitigated. Add
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. 28 29
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. 22 23 30
Known failure · Open question · Significant · Open · Mechanism-class evidence. On the record
- Scope limitations
Many important rules cannot be checked on-chip in Hardware-enabled guarantees (flexHEG) and guarantee processors
Malicious intent "is not a technical property observable on-chip", and misuse depends on what is done with a computation's results. A guarantee processor cannot easily tell whether a network is the whole system or one expert in a mixture-of-experts system. Part III judges that a fully local ruleset "may not be entirely feasible" for the same reason. 1 3
Scope limitation · Theoretical argument. On the record
Coverage stops at flexHEG-equipped chips in Hardware-enabled guarantees (flexHEG) and guarantee processors
Motivated actors will always be able to use some compute that is not flexHEG-equipped. Recalling existing consumer GPUs would likely be impractical, and reaching perfect coverage, or conclusively proving that no secret government data centres exist, would be "practically quite difficult". 1 3
Scope limitation · Open question. On the record
Related mechanism Proposed Chip registries and manufacturing records: Accounts for which chips exist and who holds them. A pointer, not evidence that this failure is mitigated. Add
Related mechanism Proposed Remote detection of data centres: Looks for undeclared facilities that hold other chips. A pointer, not evidence that this failure is mitigated. In the proposal.
Facilities can be disguised or hidden in Remote detection of data centres
Halstead and Larsen discuss two ways to hide a facility. One is to disguise it as a legitimate industrial site. The other is to build it underground, with cooling that avoids visible heat plumes. They note that the underground option requires bespoke engineering. 17
Scope limitation · Theoretical argument. On the record
Small sites may not be detectable in Remote detection of data centres
Halstead and Larsen conclude that a sufficiently small covert project could not be ruled out with confidence. In their estimates, the chance of detection is lower for smaller sites. Krawec notes that small data centres in existing buildings may lack the distinctive features of large facilities. 17 19
Scope limitation · Theoretical argument. On the record
Related mechanism Proposed Chip registries and manufacturing records: Accounts for chips from the fab onwards, which does not depend on a site being visible. A pointer, not evidence that this failure is mitigated. Add
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. 27 29
Scope limitation · Theoretical argument · Mechanism-class evidence. On the record
- Open questions
Supply-chain diversion and hidden backdoors in Hardware-enabled guarantees (flexHEG) and guarantee processors
Components could be diverted before a guarantee processor is added, and backdoors could be introduced during design or manufacturing. Open-source designs and physical scans of randomly selected chips are proposed as countermeasures. Part III proposes international oversight of production and extensive testing of a random sample of finished devices. 2 3
Open question · Open question. On the record
Related mechanism Proposed Chip registries and manufacturing records: Records each chip's identity and owner from the fab onwards, which bears on diversion before a guarantee processor is fitted. It does not address hidden backdoors. A pointer, not evidence that this failure is mitigated. Add
Error rates not quantified in Timed challenge-response and memory-occupation challenges
Monfared et al. show separable timing distributions. Their acceptance rule passes a GPU when its mean time per round stays at or below a chosen maximum, and an appendix outlines statistical tests for the proof-of-work puzzle. They leave hardware-specific threshold values to future work and report no false-positive or false-negative rates. 9
Open question · Open question. On the record
Search for unknown sites is undemonstrated in Remote detection of data centres
Krawec reports that telling data centres apart from other industrial facilities systematically is difficult. Automating detection would need large amounts of training imagery and a purpose-trained model. In Krawec's words, automated data-centre detection "remains primarily conceptual at present". 19
Open question · Open question. On the record
- Not yet demonstrated
- Proposed Hardware-enabled guarantees (flexHEG) and guarantee processors and Proposed Remote detection of data centres
- Need new chip designs
- Hardware-enabled guarantees (flexHEG) and guarantee processors
Possible additions1 for open failures · 3 for dependencies
Mechanisms on the map that are not in the proposal. Pointers, not recommendations.
-
- Bears on the open significant failure “Remote memory narrows the timing margin” in Timed challenge-response and memory-occupation challenges. Physical disconnection is proposed to exclude remote memory between the separated groups during a challenge. It depends on the isolation boundary being enforced.
- Timed challenge-response and memory-occupation challenges waits on it. Outside help, such as remote memory, must be excluded during challenges.
-
- Hardware-enabled guarantees (flexHEG) and guarantee processors waits on it. Governing all relevant chips depends on knowing where they are, through chip registries and detection of undeclared facilities.
-
- Hardware-enabled guarantees (flexHEG) and guarantee processors depends on it.
Dependencies2 missing prerequisites · 15 blockers
- Missing prerequisites
- Operational use TEE remote attestation for AI workloads needed by Hardware-enabled guarantees (flexHEG) and guarantee processors Add
- Proposed Chip registries and manufacturing records needed by Hardware-enabled guarantees (flexHEG) and guarantee processors Add
- Blockers
15 blockers recorded
- Hardware-enabled guarantees (flexHEG) and guarantee processors
- Integrated flexHEG needs substantial help from the accelerator manufacturer, and the authors estimate 3.7–7.9 years, from when the manufacturer starts work, for such hardware to displace other accelerators in frontier development. Access & governance 2
- State-level attackers who hold the hardware can likely compromise the best current secure enclosures. Hardware trust. Waits on Tamper evidence for verifier devices 2 4
- Rival states would need to trust the design and manufacture of guarantee processors and enclosures, for example through open design, redundant processors from each side or oversight of production. Hardware trust 1 3
- Restricting future rule updates would need a formal language for rules, which the authors judge most likely infeasible for early flexHEG versions. Protocol soundness 1
- Governing all relevant chips depends on knowing where they are, through chip registries and detection of undeclared facilities. Coverage & hidden compute. Waits on Chip registries and manufacturing records 3
- Timed challenge-response and memory-occupation challenges
- No network-level memory challenge across data-centre servers has been demonstrated. Adversarial validation 7
- Challenges that fill memory displace workloads; filling a pod's volatile memory takes tens of minutes and SSDs take hours. Performance & compatibility 7 9
- Outside help, such as remote memory, must be excluded during challenges. Coverage & hidden compute. Waits on Bandwidth limits and compartmentalization 7
- Remote detection of data centres
- Wide-area, automated detection of data centres is not yet practical and needs large training datasets. Coverage & hidden compute 19
- No measured detection or false-alarm rates for finding undeclared facilities have been published. Adversarial validation 17 19
- Recent high-resolution imagery is costly, is limited by weather and needs trained analysts. Access & governance 19
- Tamper evidence for verifier devices
- No tamper-evident enclosure has been designed for AI verifier hardware at retrofit scale. Hardware trust 7
- Battery-backed designs add bulk, limit operating temperature (+10 °C to +35 °C for the IBM 4765) and complicate transport. Performance & compatibility 23
- Active monitoring needs power, and visual inspection of large enclosures faces access limits. Access & governance 27
- No evaluation has been published in the AI verification setting. Adversarial validation 7
- Hardware-enabled guarantees (flexHEG) and guarantee processors
What the verifier seesNo outright disclosure specified
From the family or selected implementation's record.
- Model weights
Hidden by Hardware-enabled guarantees (flexHEG) and guarantee processors.
Not involved: Timed challenge-response and memory-occupation challenges, Remote detection of data centres and Tamper evidence for verifier devices.
- Inputs and outputs
Hidden by Hardware-enabled guarantees (flexHEG) and guarantee processors.
Not involved: Timed challenge-response and memory-occupation challenges, Remote detection of data centres and Tamper evidence for verifier devices.
Exposure notes
- Hardware-enabled guarantees (flexHEG) and guarantee processors: The guarantee processor sees the chip's traffic inside a sealed enclosure and reports only whether rules were kept.
- Timed challenge-response and memory-occupation challenges: Uses verifier-chosen challenges; it does not handle model data.
- Remote detection of data centres: Works from outside the facility; it does not handle model data.
- Tamper evidence for verifier devices: Protects verifier devices; it does not handle model data.
Implementations6 systems
- Hardware-enabled guarantees (flexHEG) and guarantee processors
- None on the map
- Timed challenge-response and memory-occupation challenges
- Proposed Data-centre memory challenging Proposed architecture, Machine Intelligence Research Institute
- Research demo GPU contention probes Research prototype
- Proposed Low-trust AI compute verification system overview Proposed architecture, Machine Intelligence Research Institute
- Research demo SAGE Research prototype
- Research demo VRAM-residency challenge Research prototype
- Remote detection of data centres
- None on the map
- Tamper evidence for verifier devices
- Proposed AI 2040 inference-only verification stack Proposed architecture, AI Futures Project
Sources30 cited
- Flexible Hardware-Enabled Guarantees for AI Compute, J. Petrie et al. (2025). Original
- Technical Options for Flexible Hardware-Enabled Guarantees, J. Petrie & O. Aarne (2025). Original
- International Security Applications of Flexible Hardware-Enabled Guarantees, O. Aarne & J. Petrie (2025). Original
- Hardware-Enabled Governance Mechanisms: Developing Technical Solutions to Exempt Items Otherwise Classified Under Export Control Classification Numbers 3A090 and 4A090, G. Kulp et al. (2024). Original
- Secure, Governable Chips: Using On-Chip Mechanisms to Manage National Security Risks from AI & Advanced Computing, O. Aarne et al. (2024). Original
- Hardware-Enabled Mechanisms for Verifying Responsible AI Development, A. O'Gara et al. (2025). Original
- A System Overview for Near-Term, Low-Trust AI Compute Verification, N. Cankaya (2026). Original
- Verification Plan, R. Dean (2026). Original
- Timing and Memory Telemetry on GPUs for AI Governance, S. K. Monfared et al. (2026). Original
- SAGE: Software-based Attestation for GPU Execution, A. Ivanov et al. (2023). Original
- SWATT: SoftWare-based ATTestation for Embedded Devices, A. Seshadri et al. (2004). Original
- Proofs of Space, S. Dziembowski et al. (2015). Original
- Secure Code Update for Embedded Devices via Proofs of Secure Erasure, D. Perito & G. Tsudik (2010). Original
- Software-Based Memory Erasure with Relaxed Isolation Requirements, S. Bursuc et al. (2024). Original
- On the Difficulty of Software-Based Attestation of Embedded Devices, C. Castelluccia et al. (2009). Original
- Refutation of "On the Difficulty of Software-Based Attestation of Embedded Devices", A. Perrig & L. van Doorn (2010). Original
- Covert AI Projects, B. Halstead & T. Larsen (2026). 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
- Tracking Hyperscale AI Data Center Growth with Satellite Imagery, C. Krawec (2026). Original
- Introducing the Frontier Data Centers Hub, Epoch AI (2025). Original
- AI Data Centers Documentation – Methodology, Epoch AI (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
- 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.
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