Proposal Explorer
ResetA verification proposal from the AI Verification Tech Map, from its records of 2026-10-08. https://trustbutveri.fyi/explorer/?mechanisms=M-0022,M-0001&implementations=M-0001:I-0012&tested=red-teamed
Analysis
Applied filters: Attack testing: Red-teamed. Not set (Any): Prover, Verifier devices on site, Prover cooperation, Chips, Minimum readiness, Keep hidden from the verifier.
Overview
| Mechanism | Readiness | Open flaws |
|---|---|---|
| Side-channel suppression for isolated facilities ⚠ excluded by your filters: attack testing: analysis | R1 | 3 significant |
| Sampled inference recomputationLow-trust AI compute verification system overview ⚠ excluded by your filters: attack testing: analysis | R1 | 2 significant1 minorFamily context below |
- Open flaws: 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: Side-channel suppression for isolated facilities 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.
- Side-channel suppression for isolated facilities: Analysis · excluded by filters
- Sampled inference recomputation, Low-trust AI compute verification system overview: Analysis · excluded by filters
Limits1 family with findings to check · 2 excluded by filters · 2 not yet demonstrated · 2 mechanisms with open significant findings
- Excluded by your filters
- Side-channel suppression for isolated facilities Attack testing is analysis; the filter asks for at least red-teamed.
- Sampled inference recomputation Attack testing is analysis; the filter asks for at least red-teamed.
- Family findings
- Sampled inference recomputation
Context for Low-trust AI compute verification system overview. These findings concern the family or other implementations; applicability must be checked against their stated scope.
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. 4 5 6
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. 5 7
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. 8 9
Theoretical argument · Significant · Open. On the record
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. 9
Open question · Minor · Open. On the record
- Sampled inference recomputation
- Open significant flaws
5 flaws in 2 mechanisms
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. 1
Theoretical argument · Significant · Open. On the record
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. 1
Theoretical argument · Significant · Open. 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. 1
Open question · Significant · Open. On the record
Mismatches cannot be attributed to cheating or error in Low-trust AI compute verification system overview
A failed hash or replay does not show whether it came from an evasion attempt, a random bit flip or an evaluation error. The author notes that if detected anomalies can plausibly be waved off as malfunctions, deterrence becomes less effective, so the parties need an agreed escalation procedure that ends in attribution. 2
Theoretical argument · Significant · Open. On the record
Inspector agents may be manipulable in Low-trust AI compute verification system overview
Automated compliance screening with LLM-based inspector agents must resist prompt-injection attacks. Adversarially trained systems might hide malicious actions with steganography, which makes backdoor detection an open problem. 2
Open question · Significant · Open. On the record
- Open minor flaws
1 mechanism with minor findings
Deliberate faults leak a bit each in Low-trust AI compute verification system overview
A malicious device can leak one bit by deliberately outputting a wrong result, which blocks a disclosure when the cross-comparison fails. The design therefore needs a pre-agreed budget of tolerated faults. 2
Theoretical argument · Minor · Open. On the record
- Not yet demonstrated
- R1 Side-channel suppression for isolated facilities and R1 Sampled inference recomputation
Possible additions4 for dependencies
Mechanisms on the map that are not in the proposal. Pointers, not recommendations.
-
Excluded by filters: attack testing: analysis
- Sampled inference recomputation waits on it. Exact replay needs complete hardware and software metadata, and the tolerable slowdown from emulation is an open question.
-
Excluded by filters: attack testing: analysis
- Sampled inference recomputation waits on it. Tamper-evident, rapidly mass-manufacturable and retrofittable enclosures for side-channel defence are an open research question, and physical security against covert communication in every monitored data centre is challenging.
-
Excluded by filters: attack testing: analysis
- Sampled inference recomputation waits on it. Distinguishing one server's DRAM contents from another's by challenge-response timing, and a general challenge-response protocol for diverse data types, are open.
-
Excluded by filters: attack testing: analysis
- Sampled inference recomputation waits on it. Empirical feasibility of passive optical splitting at 53–112 GBaud under realistic conditions is an open question.
Dependencies2 missing prerequisites · 8 blockers
- Missing prerequisites
- R1 Network taps and certifiers needed by Sampled inference recomputation Add
- R3 Deterministic and bit-exact inference needed by Sampled inference recomputation Add
- Blockers
8 blockers recorded
- Side-channel suppression for isolated facilities
- Sampled inference recomputation
- Empirical feasibility of passive optical splitting at 53–112 GBaud under realistic conditions is an open question. Performance & compatibility. Waits on Network taps and certifiers 2
- Exact replay needs complete hardware and software metadata, and the tolerable slowdown from emulation is an open question. Performance & compatibility. Waits on Deterministic and bit-exact inference 2
- Tamper-evident, rapidly mass-manufacturable and retrofittable enclosures for side-channel defence are an open research question, and physical security against covert communication in every monitored data centre is challenging. Hardware trust. Waits on Tamper evidence for verifier devices 2
- A mass-manufacturable, good-enough side-channel defence, particularly power-line filtering, has not been constructed or red-teamed. Coverage & hidden compute. Waits on Side-channel suppression for isolated facilities 2
- Distinguishing one server's DRAM contents from another's by challenge-response timing, and a general challenge-response protocol for diverse data types, are open. Coverage & hidden compute. Waits on Timed challenge-response and memory-occupation challenges 2
- The threat model is under-developed and needs input from cybersecurity and AI threat-modelling experts. Adversarial validation 2
What the verifier sees1 unspecified
From the family or selected implementation's record.
- Model weights
Not involved: Side-channel suppression for isolated facilities.
Unspecified for Sampled inference recomputation. Check the implementation record.
- Inputs and outputs
Not involved: Side-channel suppression for isolated facilities.
Unspecified for Sampled inference recomputation. Check the implementation record.
- Training data
Not involved: Side-channel suppression for isolated facilities.
Unspecified for Sampled inference recomputation. Check the implementation record.
Exposure notes
- Side-channel suppression for isolated facilities: Shields and filters a facility; it does not handle model data.
- Sampled inference recomputation, Low-trust AI compute verification system overview: This Explorer has no asset-specific exposure assessment for this implementation. Check its source and deployment assumptions.
Implementations6 systems
- Side-channel suppression for isolated facilities
- R1 AI 2040 inference-only verification stack Proposed architecture, AI Futures Project
- R1 Low-trust AI compute verification system overview Proposed architecture, Machine Intelligence Research Institute
- R1 RAND secure inference data center (SIDC) design Proposed architecture, RAND
- 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
Sources9 cited
- Suppressing Side Channels in an Untrusted Data Center via Retrofitted Defenses, N. Cankaya (2026). Original
- A System Overview for Near-Term, Low-Trust AI Compute Verification, N. Cankaya (2026). Original
- Fingerprinting All AI Cluster I/O Without Mutually Trusted Processors, N. Cankaya et al. (2026). Original
- Bit-Exact AI Inference Verification Without Performance Tradeoffs, N. Cankaya (2026). 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
- Example Schemes for Verifying High-Stakes AI Agreements, Amodo Design (2026). Original
- TOPLOC: A Locality Sensitive Hashing Scheme for Trustless Verifiable Inference, J. M. Ong et al. (2025). Original
- DiFR: Inference Verification Despite Nondeterminism, A. Karvonen 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.
7 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)7 match
- R1 Proposed7 match
- R2 Demonstrated7 match
- R3 In production2 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