Proposal Explorer
ResetA verification proposal from the AI Verification Tech Map, from its records of 2026-10-09. https://trustbutveri.fyi/explorer/?mechanisms=M-0016,M-0012&coop=partial&cols=hardware
Analysis
Applied filters: Prover cooperation: Partial at most. Not set (Any): Prover, Verifier devices on site, Chips, Minimum development status, Attack testing, Keep hidden from the verifier.
Overview
| Mechanism | Development | Security evidence | Open failures | Hardware |
|---|---|---|---|---|
| Timed challenge-response and memory-occupation challenges ⚠ excluded by your filters: prover cooperation required | Research demo | Published security analysis | 1 significant | None |
| Hardware-attested weight binding ⚠ excluded by your filters: prover cooperation required | Operational use | Published attack testing | 1 critical | Existing features |
- 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.
PropertiesNone recorded
- Not counted
- Excluded by your filters: Timed challenge-response and memory-occupation challenges and Hardware-attested weight binding
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.
- Timed challenge-response and memory-occupation challenges: Analysis · excluded by filters
- Hardware-attested weight binding: Independent red-team · excluded by filters
Limits1 mechanism with open critical failures · 1 scope limitation · 1 open question · 2 excluded by filters · 1 mechanism with open significant failures
- Excluded by your filters
- Timed challenge-response and memory-occupation challenges Prover cooperation is required; the filter allows partial at most.
- Hardware-attested weight binding Prover cooperation is required; the filter allows partial at most.
- Open critical failures
Underlying attestation can be forged or relayed in Hardware-attested weight binding
Critical for weight binding against an operator with physical access to affected hardware, or with control of the hypervisor on an AMD SEV-SNP platform without AMD's fixes. PAL*M excludes physical attacks, and Tinfoil acknowledges this boundary.
The enclave route inherits the platform-specific TEE attestation failures. Intel TDX forgery and H100 relay were demonstrated with physical access and host control. Battering RAM defeated AMD SEV-SNP attestation on DDR4 servers; RMPocalypse did so from malicious host software on platforms without AMD's fixes. These demonstrate failures of the trust roots, not of each model-commitment protocol. 12 13 17 18 19 20
Response: The TEE.fail authors report that physical interposer attacks are outside Intel's and AMD's threat models. AMD reports fixes for RMPocalypse.
Known failure · Demonstrated attack · Critical · Open · Inherited finding. On the record · Related finding in TEE remote attestation for AI workloads
Related mechanism Proposed Hardware-enabled guarantees (flexHEG) and guarantee processors: A tamper-protected enclosure around the chip is the proposed answer when the party that holds the hardware may attack it physically. A pointer, not evidence that this failure is mitigated. Add
- Open significant failures
1 failure in 1 mechanism
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. 1
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
- Scope limitations
For private models, a user can confirm consistency but not content in Hardware-attested weight binding
When weights are not published, users can check that the same root hash is served each time, but not what the model is. Pairing the hash with an attested evaluation, as in Attestable Audits, is one proposed remedy. 11 22
Scope limitation · Open question. On the record
- Open questions
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. 3
Open question · Open question. On the record
Possible additions2 for open failures · 2 for dependencies
Mechanisms on the map that are not in the proposal. Pointers, not recommendations.
-
Excluded by filters: prover cooperation required
- Bears on the open critical failure “Underlying attestation can be forged or relayed” in Hardware-attested weight binding. A tamper-protected enclosure around the chip is the proposed answer when the party that holds the hardware may attack it physically.
-
Excluded by filters: prover cooperation required
- 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.
-
Excluded by filters: prover cooperation required
- Hardware-attested weight binding waits on it. Attestation that resists physical attackers, for the enclave variant.
Dependencies1 missing prerequisite · 4 blockers
- Missing prerequisites
- Operational use TEE remote attestation for AI workloads needed by Hardware-attested weight binding Add
- Blockers
4 blockers recorded
- Timed challenge-response and memory-occupation challenges
- No network-level memory challenge across data-centre servers has been demonstrated. Adversarial validation 1
- Challenges that fill memory displace workloads; filling a pod's volatile memory takes tens of minutes and SSDs take hours. Performance & compatibility 1 3
- Outside help, such as remote memory, must be excluded during challenges. Coverage & hidden compute. Waits on Bandwidth limits and compartmentalization 1
- Hardware-attested weight binding
- Attestation that resists physical attackers, for the enclave variant. Hardware trust. Waits on TEE remote attestation for AI workloads 17
- Timed challenge-response and memory-occupation challenges
What the verifier sees1 unspecified
From the family or selected implementation's record.
- Model weights
Hidden by Hardware-attested weight binding.
Not involved: Timed challenge-response and memory-occupation challenges.
- Inputs and outputs
Not involved: Timed challenge-response and memory-occupation challenges.
Unspecified for Hardware-attested weight binding. Check the implementation record.
- Training data
Not involved: Timed challenge-response and memory-occupation challenges and Hardware-attested weight binding.
Exposure notes
- Timed challenge-response and memory-occupation challenges: Uses verifier-chosen challenges; it does not handle model data.
- Hardware-attested weight binding: Verifiers check a hash commitment to the weights, carried in a hardware attestation, and need no access to the weights themselves. The mechanism does not specify whether prompts and outputs are disclosed to a verifier. It involves no training data. 11 12 22
Implementations8 systems
- 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
- Hardware-attested weight binding
- Research demo Attestable Audits Research prototype, University of Cambridge
- Research demo PAL*M Research prototype, University of Waterloo
- Operational use Tinfoil model identity (Modelwrap) Product, Tinfoil
Sources22 cited
- 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
- How Tinfoil Proves Exactly What Model Is Running, Tinfoil Team (2026). Original
- PAL*M: Property Attestation for Large Generative Models, P. Chantasantitam et al. (2026). Original
- A primer on secure enclaves, Tinfoil (2026). Original
- Backend infrastructure, Tinfoil (2026). Original
- How verification works in Tinfoil, Tinfoil (2026). Original
- modelwrap: Reproducible dm-verity read-only image of Huggingface models, Tinfoil (2026). Original
- TEE.fail: Breaking Trusted Execution Environments via DDR5 Memory Bus Interposition, J. Chuang et al. (2026). Original
- Battering RAM: Low-Cost Interposer Attacks on Confidential Computing via Dynamic Memory Aliasing, J. De Meulemeester et al. (2026). Original
- RMPocalypse: How a Catch-22 Breaks AMD SEV-SNP, B. Schlüter & S. Shinde (2025). Original
- SEV-SNP RMP Initialization Vulnerability (AMD-SB-3020), AMD (2025). Original
- On TEEs for Privacy-Preserving Monitoring in AI Governance, Gloria Z (2026). Original
- Attestable Audits: Verifiable AI Safety Benchmarks Using Trusted Execution Environments, C. Schnabl 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.
6 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