Proposal Explorer
ResetA verification proposal from the AI Verification Tech Map, from its records of 2026-10-08. https://trustbutveri.fyi/explorer/?mechanisms=M-0012,M-0001&implementations=M-0012:I-0006&chips=existing
Analysis
Applied filters: Chips: Existing chips only. Not set (Any): Prover, Verifier devices on site, Prover cooperation, Minimum readiness, Attack testing, Keep hidden from the verifier.
Overview
| Mechanism | Readiness | Open flaws |
|---|---|---|
| Model identity attestationTinfoil model identity (Modelwrap) | R3 | 1 critical2 significantFamily context below |
| Sampled inference recomputation | R3 | 3 significant1 minor |
- Open flaws: n critical n significant n minor
Claim coverageNo claims yet
Add claims to see which ones the mechanisms address.
Properties2 in production · 1 built for an adversarial prover
- In production
- R3 Model identity attestation for showing clients that the served weights match a committed hash
- R3 Sampled inference recomputation for checking untrusted workers' activations against the declared model, prompt and precision
- Built for an adversarial prover
- Sampled inference recomputation
- No new hardware needed
- Model identity attestation and Sampled inference recomputation
Attack testing2 mechanisms with published testing
Published attempts to break a system, including those that found failures. Testing history does not show that open flaws are resolved.
Limits1 mechanism with open critical findings · 1 family with findings to check · 2 mechanisms with open significant findings
- Open critical flaws
Inherits attacks on the underlying TEEs in Tinfoil model identity (Modelwrap)
Critical when model identity must hold against an operator with physical access to an affected host. Tinfoil documents physical attacks as an enclave limitation. These are hardware-class demonstrations, not a published break of Modelwrap or Tinfoil's deployed verification chain.
Tinfoil's model commitment and boot-time GPU check depend on the CPU attestation. The TEE findings distinguish Intel TDX forgery on DDR5, AMD SEV-SNP forgery on DDR4 in Battering RAM, and software-only RMPocalypse on platforms lacking AMD's fixes. TEE.fail recovered a guest OpenSSL key on AMD, not an AMD attestation key. Its GPU relay demonstration used an H100 with forged TDX evidence; it does not establish the same result for Tinfoil's H200 or B200 configurations. 2 3 6 7 8 9
Response: Tinfoil acknowledges the physical-access boundary. The TEE.fail authors report that Intel and AMD treat interposer attacks as outside their threat models and recommend physically secure servers. AMD reports firmware fixes for RMPocalypse.
Demonstrated attack · Critical · Open · Inherited finding. On the record · Related finding in TEE remote attestation for AI workloads
- Family findings
- Model identity attestation
Context for Tinfoil model identity (Modelwrap). These findings concern the family or other implementations; applicability must be checked against their stated scope.
Underlying attestation can be forged or relayed in Model identity attestation
Critical for the enclave route against an operator with physical access to affected hardware, or control of an unpatched SEV-SNP hypervisor. It does not apply to the recomputation route. 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. 2 6 7 8 9 10
Response: The TEE.fail authors report that physical interposer attacks are outside Intel's and AMD's threat models. AMD reports fixes for RMPocalypse.
Demonstrated attack · Critical · Open · Inherited finding. On the record · Related finding in TEE remote attestation for AI workloads
Related mechanism R1 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 flaw is mitigated. Add
Launch-state attestation does not by itself cover weights loaded later in Model identity attestation
Attestation measures launch state, and weights are read from disk after boot. A signature checked at load time does not stop a malicious hypervisor from altering the disk afterwards. Tinfoil reports mitigating this with dm-verity checks on every read. Unmeasured runtime configuration remains a general risk. 1 11
Theoretical argument · Significant · Mitigated. On the record
For private models, a user can confirm consistency but not content in Model identity attestation
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. 1 12
Open question · Significant · Open. On the record
Recomputation depends on trusted logging and randomness, and its tolerance leaves a covert channel in Model identity attestation
The recomputation variant assumes that every input, output and seed is logged correctly, and that the attacker can neither predict nor manipulate which messages are sampled for verification. Legitimate nondeterminism concentrates at a few token positions, and slow leaks within the tolerated slack remain possible. An independent study showed that an adversary who controls the prompts roughly doubles the bits leaked per token, reducing the exfiltration slowdown from 146–254 times under benign prompts to 60–118 times. The attack targets the exfiltration bound, not the check that outputs match the declared model. 13 14
Demonstrated attack · Significant · Open. On the record
Related mechanism R1 Network taps and certifiers: Taps are proposed to copy and hash traffic on the monitored links, reducing reliance on the prover's own log. This still depends on the monitored boundary and trusted capture. A pointer, not evidence that this flaw is mitigated. Add
Related mechanism R3 Deterministic and bit-exact inference: Bit-exact inference would remove the numerical tolerance that leaves this channel. A pointer, not evidence that this flaw is mitigated. Add
- Model identity attestation
- Open significant flaws
5 flaws in 2 mechanisms
Side channels, I/O leakage and denial of service are outside enclave protection in Tinfoil model identity (Modelwrap)
Tinfoil's documentation lists timing, power and electromagnetic side channels, host observation of access patterns and I/O, denial of service, supply-chain compromise and rollback as limitations. 2
Theoretical argument · Significant · Open. On the record
Private models can be checked only for consistency in Tinfoil model identity (Modelwrap)
For unpublished weights, the root hash appears in the attestation without the weights being exposed. Users can then confirm only that they get the same model each time. 1
Open question · Significant · Open. On the record
Tolerance for numerical noise leaves a covert channel in Sampled inference recomputation
Schemes that accept approximate matches can put an upper bound on an adversary's covert bandwidth, but they cannot close the channel. The weight-exfiltration detector cut exfiltratable information to under 0.5%, not to zero, on a 30-billion-parameter mixture-of-experts model under benign prompt traffic. Its authors called the channel's size under adversarial prompts an open empirical question. An independent study showed that an adversary who controls the prompts roughly doubles the bits leaked per token. Across six models, that cut the slowdown from 146–254 times under benign prompts to 60–118 times. The attack widens the exfiltration bound. It does not target the check that outputs match the declared model. 13 14 24
Demonstrated attack · Significant · Open. On the record
Related mechanism R3 Deterministic and bit-exact inference: Bit-exact inference would remove the numerical tolerance if exact replay can be deployed with the required weights and configuration. A pointer, not evidence that this flaw is mitigated. Add
Only recorded traffic is checked in Sampled inference recomputation
Recomputation checks that recorded, declared workloads are correct. It cannot show that the record is complete. The published schemes do not cover hidden workloads run on the same compute, or substituted work. Rinberg et al. say their exfiltration-detection scheme cannot stand alone. 13 25
Theoretical argument · Significant · Open. On the record
Related mechanism R1 Network taps and certifiers: Taps copy and hash all traffic on the monitored links, which bears on whether the traffic record is complete. They do not show what else ran on the same chips. A pointer, not evidence that this flaw is mitigated. Add
Some inference optimizations are not covered in Sampled inference recomputation
TOPLOC's authors state that it cannot detect speculative decoding in which a cheaper model does the decoding. They did not test whether it distinguishes types of key-value (KV) cache compression. DiFR was evaluated only on sampling from a single model. Its authors sketch an extension to one speculative-decoding algorithm but do not test it. 15 16
Theoretical argument · Significant · Open. On the record
- Open minor flaws
1 mechanism with minor findings
Mixed hardware widens the honest baseline in Sampled inference recomputation
When honest reference runs span different GPU types, the spread of benign scores grows. In DiFR's tests on Qwen3-30B-A3B, pooling A100 and H200 runs left Token-DiFR unable to separate the two smallest tested changes, a temperature of 1.1 instead of 1.0 and a simulated top-2 sampling bug, at the target false-positive rate, while cross-entropy separated them. Matched provider and verifier environments, or pooling that weights rare large deviations, restored detection. 15
Open question · Minor · Open. On the record
Possible additions2 for open flaws · 2 for dependencies
Mechanisms on the map that are not in the proposal. Pointers, not recommendations.
-
- Bears on the open significant flaw “Tolerance for numerical noise leaves a covert channel” in Sampled inference recomputation. Bit-exact inference would remove the numerical tolerance if exact replay can be deployed with the required weights and configuration.
-
- Bears on the open significant flaw “Only recorded traffic is checked” in Sampled inference recomputation. Taps copy and hash all traffic on the monitored links, which bears on whether the traffic record is complete. They do not show what else ran on the same chips.
- Sampled inference recomputation waits on it. In tap-based retrofit designs, recording all inference traffic needs network taps and recomputation servers that can ingest it, in the worst case one recomputation-server network interface per inference front-end interface.
-
- Model identity attestation waits on it. The underlying TEE attestation does not resist attackers with physical access to the host.
Dependencies1 missing prerequisite · 7 blockers
- Missing prerequisites
- R3 TEE remote attestation for AI workloads needed by Model identity attestation Add
- Blockers
7 blockers recorded
- Model identity attestation
- Sampled inference recomputation
- In tap-based retrofit designs, recording all inference traffic needs network taps and recomputation servers that can ingest it, in the worst case one recomputation-server network interface per inference front-end interface. Coverage & hidden compute. Waits on Network taps and certifiers 21 27
- In retrofit designs, the recomputation server must sit inside the prover's data centre, possibly under the prover's physical control, and still be protected from a compromised provider, which Amodo rates 'not on track'. Hardware trust 13 21
- No independent red-team of a recomputation consistency check has been published (the one independent attack study targets the weight-exfiltration bound), and Amodo rates recomputation red-teaming 'not started'. Adversarial validation 14 21
- Tolerance-based checks need calibration on trusted hardware and exact knowledge of the provider's sampling procedure, and in one prototype a sampling-implementation mismatch produced large spurious differences. Performance & compatibility 15 20
- The verifier needs the model weights, so checking a closed-weights model requires a trusted, confidential recomputation environment, which the retrofit designs place inside the prover's facility. Privacy & leakage 15 25 26
What the verifier sees1 unspecified · 2 depend on design
From the family or selected implementation's record.
- Model weights
Depends on the design for Model identity attestation and Sampled inference recomputation.
- Inputs and outputs
Depends on the design for Sampled inference recomputation.
Unspecified for Model identity attestation. Check the implementation record.
- Training data
Not involved: Model identity attestation and Sampled inference recomputation.
Exposure notes
- Model identity attestation, Tinfoil model identity (Modelwrap): Tinfoil describes downloaded weights for public-model verification and hash consistency for private models. This model-identity description does not specify input/output exposure. 1
- Sampled inference recomputation: Recomputation needs the weights and sampled requests inside the checking environment. For closed models, the record describes a trusted, confidential environment; disclosure to the verifier depends on that boundary. 15 25 26
Implementations8 systems
- Model identity attestation
- R2 Attestable Audits Research prototype, University of Cambridge
- R2 PAL*M Research prototype, University of Waterloo
- R3 Tinfoil model identity (Modelwrap) Product, Tinfoil
- Sampled inference recomputation
- R1 AI 2040 inference-only verification stack Proposed architecture, AI Futures Project
- R2 DiFR (Divergence From Reference) Research prototype
- R1 Low-trust AI compute verification system overview Proposed architecture, Machine Intelligence Research Institute
- R1 SASH confidential network logger Research prototype, Singapore AI Safety Hub (SASH)
- R3 TOPLOC Open-source project, Prime Intellect
Sources27 cited
- How Tinfoil Proves Exactly What Model Is Running, Tinfoil Team (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
- PAL*M: Property Attestation for Large Generative Models, P. Chantasantitam et al. (2026). 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
- 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
- DiFR: Inference Verification Despite Nondeterminism, A. Karvonen et al. (2025). Original
- TOPLOC: A Locality Sensitive Hashing Scheme for Trustless Verifiable Inference, J. M. Ong et al. (2025). Original
- PrimeIntellect-ai/toploc (GitHub repository), Prime Intellect (2025). Original
- INTELLECT-2: A Reasoning Model Trained Through Globally Decentralized Reinforcement Learning, Prime Intellect Team et al. (2025). Original
- adamkarvonen/difr (GitHub repository), A. Karvonen (2025). Original
- Scaling Recomputation Inference Verification, Amodo Design (2026). Original
- AI 2040 Plan A — Verification SITREP, Amodo Design (2026). Original
- SYNTHETIC-2 Release: Four Million Collaboratively Generated Reasoning Traces, Prime Intellect (2025). Original
- An Inference Verification Prototype — Stage 1, Amodo Design (2026). Original
- Bit-Exact AI Inference Verification Without Performance Tradeoffs, N. Cankaya (2026). Original
- Example Schemes for Verifying High-Stakes AI Agreements, Amodo Design (2026). Original
- A System Overview for Near-Term, Low-Trust AI Compute Verification, N. Cankaya (2026). Original
- Verification Plan, R. Dean (2026). 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.
23 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 readiness
How mature must each mechanism be?
- Any (selected)23 match
- R1 Proposed23 match
- R2 Demonstrated15 match
- R3 In production4 match
- R4 Deployment-ready0 match
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, readiness, assumptions and open flaws.
Mechanisms
A mechanism is a general technique for verifying claims. Its badge is its readiness level 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. Flaw counts are per mechanism. Summary counts name mechanisms with open findings, not a sum of attacks. Choosing an implementation narrows each row to that record's assessed use; family findings remain as context.
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 flaw or a dependency. They are pointers, not recommendations: each brings its own readiness level and flaws, and none is claimed to close a flaw. Links from flaws 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) design3 mechanismsProposed architecture, RAND