Proposal Explorer
ResetA verification proposal from the AI Verification Tech Map, from its records of 2026-10-09. https://trustbutveri.fyi/explorer/?mechanisms=M-0013,M-0009,M-0022&hide=io
Analysis
Applied filters: Keep hidden from the verifier: inputs and outputs. Not set (Any): Prover, Verifier devices on site, Prover cooperation, Chips, Minimum development status, Attack testing.
Overview
| Mechanism | Development | Security evidence | Open failures |
|---|---|---|---|
| Network taps and certifiers | Proposed | Published security analysis | 2 significant |
| Hardware-enabled guarantees (flexHEG) and guarantee processors | Proposed | Published security analysis | 3 significant |
| Side-channel suppression for isolated facilities | Proposed | Published security analysis | none |
- Open failures: n critical n significant n minor
Claim coverageNo claims yet
Add claims to see which ones the mechanisms address.
Properties3 built for an adversarial prover
- Built for an adversarial prover
- Network taps and certifiers, Hardware-enabled guarantees (flexHEG) and guarantee processors and Side-channel suppression for isolated facilities
- Failures since mitigated
- Verifier dictionary attacks on hashes in Network taps and certifiers 1
Attack testing3 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.
Limits6 scope limitations · 3 open questions · 3 not yet demonstrated · 2 mechanisms with open significant failures
- Open significant failures
5 failures in 2 mechanisms
Output nondeterminism leaves covert capacity in Network taps and certifiers
Hashing cannot remove information hidden in the outputs themselves. The Secure Gateway Device paper estimates that about 0.1 bit per token remains even with seed-synchronized replay checks. For a 200k-GPU inference cluster at full load (2,000 tokens per GPU per second), that is about 40 Mbit/s of covert egress, enough to move a 1 TB model in under three days. The paper names this the core remaining challenge and points to deterministic replay or active scrubbing of hardware-induced entropy. An independent study found that an adversary who chooses the prompts roughly doubles the bits leaked per token under Gumbel-based inference verification; see Bounding unexplained information in outputs. 1 9
Known failure · Theoretical argument · Significant · Open. On the record
Related mechanism Operational use Deterministic and bit-exact inference: Deterministic replay is one of the two remedies the flaw's source names. A pointer, not evidence that this failure is mitigated. Add
Related mechanism Research demo Bounding unexplained information in outputs: Bounds the hidden information outputs can carry by measuring what the declared computation fails to predict. A pointer, not evidence that this failure is mitigated. Add
Residual side channels in simple passive setups in Network taps and certifiers
Amodo's analysis of its own tapped prototype lists unvalidated header fields, timing of permitted traffic and variation in response formatting as residual channels, and concludes that the passive tap must be replaced by an active one. 5
Known failure · Theoretical argument · Significant · Open. On the record
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. 12 14
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. 12
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. 12
Known failure · Theoretical argument · Significant · Open. On the record
- Scope limitations
Some links cannot be passively tapped in Network taps and certifiers
Cankaya notes that copper-connected scale-up domains (for example NVL72 racks and TPU v7 cubes) are much harder to tap than fibre, and that optical budgets make passive taps impractical on 400GBASE-SR8 multimode links. Amodo found no taps advertised for 53 GBaud links as of May 2026. 2 10
Scope limitation · Open question. On the record
Encrypted fabrics hide plaintext from both parties in Network taps and certifiers
Cankaya notes that with TEE-protected sessions whose keys are ephemeral and managed inside the TEE, neither the operator nor the manufacturer can recover session keys after the session, so tapped traffic could not be opened for recomputation. For other encrypted fabrics, the operator can retain keys. 2
Scope limitation · Open question. On the record
Completeness rests on physical monitoring left out of scope in Network taps and certifiers
The Secure Gateway Device paper assumes the facility is physically monitored, and states that the whole architecture depends on the device being the only communication channel. It names radio emanation, power-line signalling and thermal channels as covert channels beyond that scope. 1
Scope limitation · Open question. On the record
Related mechanism Proposed Side-channel suppression for isolated facilities: Addresses the radio, power-line and thermal channels that network-level designs leave out. A pointer, not evidence that this failure is mitigated. In the proposal.
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. 11 13
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". 11 13
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. Add
Openings for airflow, power and optics weaken shielding in Side-channel suppression for isolated facilities
Cankaya notes that keeping attenuation high while passing high-power airflow, cabling and optical links adds complexity beyond existing shielded-enclosure specifications. 17
Scope limitation · Theoretical argument. 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. 12 13
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
Supply-chain implants may evade inspection in Side-channel suppression for isolated facilities
Cankaya identifies malicious hardware embedded deep in purchased components as a residual risk that visual inspection and disassembly may not catch. He notes that radiographic examination under high-security standards could mitigate it. 17
Open question · Theoretical argument. On the record
Inspection assumptions may not hold in Side-channel suppression for isolated facilities
The design's statistical argument assumes that visual or disassembly inspection catches every flaw that is present in a sampled unit. Cankaya is unsure whether destructive teardowns are defence-dominant or offence-dominant. 17
Open question · Open question. On the record
- Not yet demonstrated
- Proposed Network taps and certifiers, Proposed Hardware-enabled guarantees (flexHEG) and guarantee processors and Proposed Side-channel suppression for isolated facilities
- Need new chip designs
- Hardware-enabled guarantees (flexHEG) and guarantee processors
Possible additions2 for open failures · 5 for dependencies
Mechanisms on the map that are not in the proposal. Pointers, not recommendations.
-
- Bears on the open significant failure “Output nondeterminism leaves covert capacity” in Network taps and certifiers. Deterministic replay is one of the two remedies the flaw's source names.
- Network taps and certifiers waits on it. Nondeterministic inference leaves covert capacity in outputs that hashing cannot remove.
-
- Bears on the open significant failure “Output nondeterminism leaves covert capacity” in Network taps and certifiers. Bounds the hidden information outputs can carry by measuring what the declared computation fails to predict.
-
- Network taps and certifiers waits on it. Taps and gateway devices need tamper-evident housing and physical monitoring so that traffic cannot bypass them.
- Hardware-enabled guarantees (flexHEG) and guarantee processors waits on it. State-level attackers who hold the hardware can likely compromise the best current secure enclosures.
-
- 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.
-
- Network taps and certifiers depends on it.
-
- Hardware-enabled guarantees (flexHEG) and guarantee processors depends on it.
Dependencies5 missing prerequisites · 1 shared foundation · 12 blockers
- Missing prerequisites
- Operational use Sampled inference recomputation needed by Network taps and certifiers Add
- Operational use Deterministic and bit-exact inference needed by Network taps and certifiers Add
- Research demo Tamper evidence for verifier devices needed by Network taps and certifiers Add
- 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
- Shared foundations
- Tamper evidence for verifier devices relied on by Network taps and certifiers and Hardware-enabled guarantees (flexHEG) and guarantee processors
- Blockers
12 blockers recorded
- Network taps and certifiers
- No complete verification tap has been demonstrated at production frontend link rates, and on the tested CPU no hash algorithm reached line rate with minimum-size frames. Performance & compatibility 10 18
- Nondeterministic inference leaves covert capacity in outputs that hashing cannot remove. Evidence binding. Waits on Deterministic and bit-exact inference 1
- Taps and gateway devices need tamper-evident housing and physical monitoring so that traffic cannot bypass them. Hardware trust. Waits on Tamper evidence for verifier devices 1 3
- Radio, power-line and thermal channels are not addressed by network-level designs. Coverage & hidden compute. Waits on Side-channel suppression for isolated facilities 1
- Red-teaming by specialists is called for but has not been reported. Adversarial validation 1
- 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 12
- State-level attackers who hold the hardware can likely compromise the best current secure enclosures. Hardware trust. Waits on Tamper evidence for verifier devices 12 14
- 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 11 13
- Restricting future rule updates would need a formal language for rules, which the authors judge most likely infeasible for early flexHEG versions. Protocol soundness 11
- 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 13
- Side-channel suppression for isolated facilities
- Network taps and certifiers
What the verifier sees1 depend on design
From the family or selected implementation's record.
- Model weights
Depends on the design for Network taps and certifiers.
Hidden by Hardware-enabled guarantees (flexHEG) and guarantee processors.
Not involved: Side-channel suppression for isolated facilities.
- Inputs and outputs
Depends on the design for Network taps and certifiers.
Hidden by Hardware-enabled guarantees (flexHEG) and guarantee processors.
Not involved: Side-channel suppression for isolated facilities.
- Training data
Depends on the design for Network taps and certifiers.
Hidden by Hardware-enabled guarantees (flexHEG) and guarantee processors.
Not involved: Side-channel suppression for isolated facilities.
Exposure notes
- Network taps and certifiers: Only hashes leave the site; records picked for a challenge are opened for replay at a verification facility.
- 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.
- Side-channel suppression for isolated facilities: Shields and filters a facility; it does not handle model data.
Implementations4 systems
- Network taps and certifiers
- Proposed AI 2040 inference-only verification stack Proposed architecture, AI Futures Project
- Proposed Low-trust AI compute verification system overview Proposed architecture, Machine Intelligence Research Institute
- Proposed SASH confidential network logger Research prototype, Singapore AI Safety Hub (SASH)
- Hardware-enabled guarantees (flexHEG) and guarantee processors
- None on the map
- Side-channel suppression for isolated facilities
- Proposed AI 2040 inference-only verification stack Proposed architecture, AI Futures Project
- Proposed Low-trust AI compute verification system overview Proposed architecture, Machine Intelligence Research Institute
- Proposed RAND secure inference data center (SIDC) design Proposed architecture, RAND
Sources18 cited
- Fingerprinting All AI Cluster I/O Without Mutually Trusted Processors, N. Cankaya et al. (2026). Original
- The Fundamentals and Feasibility of Secure Network Taps for Verifying AI Datacenter Use, N. Cankaya (2026). Original
- A System Overview for Near-Term, Low-Trust AI Compute Verification, N. Cankaya (2026). Original
- Verification Plan, R. Dean (2026). Original
- Fitting a Network TAP to our Inference Verification Prototype, Amodo Design (2026). Original
- Amodo-Design/Inference-Recomputation-Prototype (GitHub repository), Amodo Design (2026). Original
- inference-verification: Inference Verification Prototype, Singapore AI Safety Hub (SASH) (2026). Original
- Internationalising AI Verification, Singapore AI Safety Hub (SASH) (2026). Original
- Adversarial Entropy Inflation Against Gumbel-Based Inference Verification, N. Kezins (2026). Original
- Network Tapping for AI Verification: A Technical Assessment, Amodo Design (2026). Original
- 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
- Suppressing Side Channels in an Untrusted Data Center via Retrofitted Defenses, N. Cankaya (2026). Original
- Network Traffic Hashing, Amodo Design (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.
24 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