Proposal Explorer
ResetA verification proposal from the AI Verification Tech Map, from its records of 2026-10-09. https://trustbutveri.fyi/explorer/?claims=C-0008,C-0005&mechanisms=M-0025&goal=G-0004
Analysis
Applied filters: none. Every filter is set to Any.
Overview
| Mechanism | Development | Security evidence | Open failures |
|---|---|---|---|
| Confidential multi-party verification | Research demo | Published security analysis | 2 significant |
- Open failures: n critical n significant n minor
Claim coverage1 of 2 claims addressed
For the goal Prevent catastrophic misuse. Each of its claims is marked direct or supporting.
- 1. Communication between compute groups is bounded Supporting
- Unaddressed
No mechanism in the proposal addresses it.
- 2. The declared model is the one being served Supporting
- Addressed
Aimed at it: Confidential multi-party verification
- Goal claims not in the proposal
- Outside this map
- Capability evaluations. Baker and colleagues describe mitigations as proportionate to evaluated risks. They leave improving model evaluations as a separate unsolved problem. M. Baker et al. 2025
- User identity. Cankaya's example rule separates whitelisted users from others. This map has no records for checking who a user is. N. Cankaya 2026
PropertiesNone recorded
- No new hardware needed
- Confidential multi-party verification
Attack testing1 mechanism 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.
- Confidential multi-party verification: Analysis
Limits3 scope limitations · 1 mechanism with open significant failures
- Claims not fully addressed
- Communication between compute groups is bounded No mechanism in the proposal addresses it.
- Open significant failures
2 failures in 1 mechanism
Released verdicts can leak information about private inputs in Confidential multi-party verification
Even a one-bit result can reveal more than intended. Abdelghafar and Kulp used the published evaluation of Auditor-in-a-Box, whose output filter is meant to disclose at most one bit. Given only the valid or invalid decision on a new request, a simple predictor identified which of two request sets it came from (borderline or proxy requests versus ordinary research requests) with 72.4% balanced accuracy, against 50% without the decision. In a second experiment, which distinguished reinforcement-learning workloads from others, several candidate one-bit reports revealed exact-workload information. 9
Known failure · Demonstrated attack · Significant · Open. On the record
Memory-bus interposition extracts attestation keys and forges attestations in Confidential multi-party verification
Applies to enclave workflows using affected Intel or AMD platforms, including Cove's TDX reference and the PySyft pilot's TDX and H100 stack. A physical host attacker who defeats the accepted trust root defeats that variant's confidentiality and veracity. These studies do not test the PySyft workflow or ZkAudit's cryptographic route.
The platform-specific attacks and fixes are collected in the TEE findings. Intel TDX attestations were forged with physical access to DDR5 systems and combined with H100 relay. AMD SEV-SNP attestation was defeated on DDR4 by Battering RAM and from malicious host software by RMPocalypse before AMD's fixes. 1 6 7 10 11 12 13 14
Response: The researchers report that Intel and AMD treat physical interposer attacks as out of scope. AMD reports firmware fixes for RMPocalypse.
Known failure · Demonstrated attack · Significant · 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
- Scope limitations
Guarantees depend on the host software stack and on review in Confidential multi-party verification
Cove's developers state that compromise of the Docker daemon, host kernel or TEE stack breaks all guarantees. They also state that Docker policy alone cannot prove that guest code cannot generate a quote if the platform exposes quote instructions globally, and that compiled workflow bundles are hashed and reviewable but not signed by a publisher key. 6
Scope limitation · Theoretical argument. On the record
Completeness is not established in Confidential multi-party verification
A confidential workflow proves facts about the records and models submitted to it. A governance analysis notes that an auditor also needs assurance that all activity is accounted for, since a host could start a second confidential virtual machine that uses a different model or bypasses monitoring. 15
Scope limitation · Theoretical argument. On the record
Related mechanism Research demo On-chip telemetry from timing, memory and performance counters: On-chip counters are a proposed route to evidence about everything a chip runs, which attestation of one workload does not give. A pointer, not evidence that this failure is mitigated. Add
Zero-knowledge audits reveal model architecture in Confidential multi-party verification
ZkAudit keeps weights and data secret but reveals the model architecture, and it does not protect against data poisoning. 7
Scope limitation · Theoretical argument. On the record
Possible additions2 for claim gaps · 1 for open failures · 2 for dependencies
Mechanisms on the map that are not in the proposal. Pointers, not recommendations.
-
- Aimed at claim 1, Communication between compute groups is bounded, which is unaddressed.
-
- Aimed at claim 1, Communication between compute groups is bounded, which is unaddressed.
-
- Bears on the open significant failure “Memory-bus interposition extracts attestation keys and forges attestations” in Confidential multi-party verification. A tamper-protected enclosure around the chip is the proposed answer when the party that holds the hardware may attack it physically.
-
- Confidential multi-party verification waits on it. Frontier inference typically needs the resources of several GPUs, and published confidential evaluations ran on a single server, so the double-blind pilot's authors name many-node confidential H100 or B200 clusters as the next milestone.
- Confidential multi-party verification waits on it. Trust rests on a small number of hardware vendors, and a per-CPU Intel attestation key has been extracted by physical attack.
-
- Confidential multi-party verification waits on it. Zero-knowledge audits have been shown on image classifiers and a recommender model, not language models at frontier scale, and a counterfactual audit of the recommender cost $8,456.
Dependencies1 missing prerequisite · 5 blockers
- Missing prerequisites
- Operational use TEE remote attestation for AI workloads needed by Confidential multi-party verification Add
- Blockers
5 blockers recorded
- Confidential multi-party verification
- Frontier inference typically needs the resources of several GPUs, and published confidential evaluations ran on a single server, so the double-blind pilot's authors name many-node confidential H100 or B200 clusters as the next milestone. Performance & compatibility. Waits on TEE remote attestation for AI workloads 1 4 15
- Zero-knowledge audits have been shown on image classifiers and a recommender model, not language models at frontier scale, and a counterfactual audit of the recommender cost $8,456. Performance & compatibility. Waits on Zero-knowledge proofs of inference 7
- Trust rests on a small number of hardware vendors, and a per-CPU Intel attestation key has been extracted by physical attack. Hardware trust. Waits on TEE remote attestation for AI workloads 10 15
- Parties must negotiate the plan or workflow and handle false positives and appeals, which the Auditor-in-a-Box authors list as open problems. Access & governance 16
- Released evidence must be designed to limit collateral leakage, which requires declaring protected properties in advance and calibrating on labelled executions. Privacy & leakage 9
- Confidential multi-party verification
What the verifier seesNo outright disclosure specified
From the family or selected implementation's record.
- Model weights
Hidden by Confidential multi-party verification.
- Inputs and outputs
Hidden by Confidential multi-party verification.
- Training data
Hidden by Confidential multi-party verification.
Exposure notes
- Confidential multi-party verification: Only the agreed result leaves the enclave or proof; this relies on trusted execution hardware or zero-knowledge proofs.
Implementations3 systems
- Confidential multi-party verification
- Research demo Attestable Audits Research prototype, University of Cambridge
- Research demo Cove Open-source project
- Research demo PySyft double-blind evaluations Research prototype, OpenMined
Sources16 cited
- Double Blind Evals: Resolving the Dual Confidentiality Dilemma in AI Safety Auditing, A. Trask et al. (2026). Original
- Confidential Space overview, Google Cloud (2026). Original
- Confidential Space release notes, Google Cloud (2026). Original
- Confidential computing can enable better frontier AI auditing, A. Tlaie Boria (2026). Original
- Cove: Compositional Multi-Party Confidential Workflows for Verifiable AI Governance, S. Ding et al. (2026). Original
- Cove: Compositional Multi-Party Confidential Workflows for Verifiable AI Governance (reference implementation), covehub (2026). Original
- Trustless Audits without Revealing Data or Models, S. Waiwitlikhit et al. (2024). Original
- Attestable Audits: Verifiable AI Safety Benchmarks Using Trusted Execution Environments, C. Schnabl et al. (2025). Original
- Privacy-Preserving AI Verification via Minimal Information Disclosure, S. Abdelghafar & G. Kulp (2026). Original
- TEE.fail: Breaking Trusted Execution Environments via DDR5 Memory Bus Interposition, J. Chuang et al. (2026). Original
- DDRop: Active Memory Interposer Attacks on Confidential VMs by Dropping DDR5 Writes, J. De Meulemeester 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
- Auditor-in-a-Box: Tools for Third-Party Auditing, R. Rinberg & B. Penchas (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.
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.
Prevent catastrophic misuse
Keep capable AI models from helping anyone carry out catastrophic attacks, such as biological or chemical ones.
Direct: Declared safeguards were applied during inference and Model weights have not left the facility.
Supporting: The declared model is the one being served and Communication between compute groups is bounded.
Outside this map: capability evaluations and user identity.
Change the goal
- 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 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