Proposal Explorer

Reset

A verification proposal from the AI Verification Tech Map, from its records of 2026-10-09. https://trustbutveri.fyi/explorer/?mechanisms=M-0018,M-0012&implementations=M-0018:I-0009&prover=adversarial

Claims

Mechanisms2

Filters:× 18 of 25 match

Applied filters: Prover: Adversarial. Not set (Any): Verifier devices on site, Prover cooperation, Chips, Minimum development status, Attack testing, Keep hidden from the verifier.

Analysis

Applied filters: Prover: Adversarial. Not set (Any): Verifier devices on site, Prover cooperation, Chips, Minimum development status, Attack testing, Keep hidden from the verifier.

MechanismDevelopmentSecurity evidenceOpen failures
Chip location verificationLucid sovereignty (location) certificates ⚠ excluded by your filters: assumes a semi-trusted prover ProposedPublished security analysis2 significantFamily context below
Hardware-attested weight binding ⚠ excluded by your filters: assumes a semi-trusted prover Operational usePublished attack testing1 critical
  • Open failures: n critical n significant n minor
  • ⚠ Dimmed: excluded by your filters; point at ⚠ for the reason
Claim coverageNo claims yet

Add claims to see which ones the mechanisms address.

PropertiesNone recorded
Not counted
Excluded by your filters: Chip location verification 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.

Limits1 mechanism with open critical failures · 1 family with findings to check · 2 scope limitations · 2 excluded by filters · 1 not yet demonstrated · 1 mechanism with open significant failures
Excluded by your filters
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. 9 10 14 15 16 17

    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

Family findings
  • Chip location verification

    Context for Lucid sovereignty (location) certificates. Findings from the mechanism family appear here as context. They apply to an implementation only when its own record lists them, under the conditions stated there.

    • Extracting a chip's key lets another device answer for it in Chip location verification

      Ping-based protocols rely on cryptographic keys stored on the chip. Tee and Happel argue that an adversary with physical access could extract these keys and so compromise location verification. They propose GPU fingerprints as a mitigation, so far tested on 24 GPUs. Brass and Aarne assume the keys are stored securely, for example in a TPM. 5 6

      Known failure · Theoretical argument · Significant · Open. On the record

    • Added delay can shift an estimated position in Chip location verification

      Brass and Aarne cite internet-geolocation research in which artificially increased round-trip times moved the estimated location by up to 1,000 km, with a 74% chance of avoiding detection. Avellar and Grunewald list inflated ping times from circuitous routing as an evasion route. Added delay only loosens a distance bound, and Brass and Aarne propose a hard time limit as the counter: a chip that replies too slowly cannot be ruled out of a restricted location. 6 7

      Known failure · Demonstrated attack · Significant · Open. On the record

    • Faster-than-assumed network paths in Chip location verification

      Brass and Aarne list dark fibre and other private high-speed interconnects as ways to lower measured delays artificially. They judge that leasing dark fibre would probably not be a considerable challenge for covertly or openly adversarial actors. Avellar and Grunewald note that this can make a chip appear to be somewhere else entirely. A limit set at the vacuum speed of light cannot be beaten, but it makes honest chips fail more often. 6 7

      Known failure · Theoretical argument · Significant · Open. On the record

    • Compromised landmarks can falsify measurements in Chip location verification

      A party that controls landmark servers can report false timing. Brass and Aarne cite research in which manipulating a third of the landmarks shifted the estimated location by about 700 km. Avellar and Grunewald note that compromised landmarks let adversaries spoof travel-time measurements directly. The draft specification asks verifiers to require anchors in diverse places, run by several independent operators. 1 6 7

      Known failure · Theoretical argument · Significant · Open. On the record

Open significant failures
2 failures in 1 mechanism
  • On-chip keys may be extractable in Lucid sovereignty (location) certificates

    Tee and Happel argue that ping-based location protocols backed by keys stored on the chip can be compromised if an adversary with physical access extracts those keys. In this specification, the evidence chain rests on the hardware root of trust's signed quote, whose signing key must be protected by the hardware. 1 5

    Known failure · Theoretical argument · Significant · Open. On the record

  • General delay and landmark attacks apply in Lucid sovereignty (location) certificates

    Attacks on delay-based location verification in general also apply. Brass and Aarne discuss adding delay, using faster paths such as dark fibre, and compromising landmarks. The specification counters anchor impersonation with a signed anchor directory. Against collusion it recommends anchors in diverse places run by several independent operators, and peer monitoring that temporarily removes anchors whose timings deviate. 1 6

    Known failure · Theoretical argument · Significant · Open. On the record

Scope limitations
  • Physical attacks on the trusted hardware are out of scope in Lucid sovereignty (location) certificates

    The specification places the hardware root of trust and the TEE in the trusted computing base. It assumes they resist software attacks, notes that the attacker may have physical access, and leaves sophisticated physical attacks, such as bus probing and side-channel analysis, as a residual risk. It says that future revisions may add requirements for physical tamper evidence. 1

    Scope limitation · Theoretical argument. On the record

  • 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. 8 19

    Scope limitation · Open question. On the record

Possible additions1 for open failures · 1 for dependencies

Mechanisms on the map that are not in the proposal. Pointers, not recommendations.

Dependencies1 missing prerequisite · 1 shared foundation · 3 blockers
Missing prerequisites
Shared foundations
Blockers
3 blockers recorded
  • Chip location verification
    • The specification is an unfinished draft with no public implementation or evaluation. Adversarial validation 1 2
    • It needs a globally distributed, trusted anchor fleet and an endorser to run the anchor directory. Access & governance 1
  • Hardware-attested weight binding
    • Attestation that resists physical attackers, for the enclave variant. Hardware trust. Waits on TEE remote attestation for AI workloads 14
What the verifier sees2 unspecified

From the family or selected implementation's record.

Model weights

Hidden by Hardware-attested weight binding.

Unspecified for Chip location verification. Check the implementation record.

Inputs and outputs

Unspecified for Chip location verification and Hardware-attested weight binding. Check the implementation record.

Training data

Not involved: Hardware-attested weight binding.

Unspecified for Chip location verification. Check the implementation record.

Exposure notes
Implementations4 systems
Chip location verification
Hardware-attested weight binding
Sources19 cited
  1. Sovereignty Certificates: draft specification, version 0.1.0, Sovereignty Certificates Working Group (2025). Original
  2. Sovereignty Certificates Working Group (2026). Original
  3. Lucid Computing: Verifiable AI. Proven in hardware. (2026). Original
  4. Lucid Developer Platform documentation (2026). Original
  5. GPU Fingerprinting for Location Verification, W. Tee & J. Happel (2026). Original
  6. Location Verification for AI Chips, A. Brass & O. Aarne (2024). Original
  7. Near-Term Verification Methods for AI Chip Exports, B. Avellar & E. Grunewald (2026). Original
  8. How Tinfoil Proves Exactly What Model Is Running, Tinfoil Team (2026). Original
  9. PAL*M: Property Attestation for Large Generative Models, P. Chantasantitam et al. (2026). Original
  10. A primer on secure enclaves, Tinfoil (2026). Original
  11. Backend infrastructure, Tinfoil (2026). Original
  12. How verification works in Tinfoil, Tinfoil (2026). Original
  13. modelwrap: Reproducible dm-verity read-only image of Huggingface models, Tinfoil (2026). Original
  14. TEE.fail: Breaking Trusted Execution Environments via DDR5 Memory Bus Interposition, J. Chuang et al. (2026). Original
  15. Battering RAM: Low-Cost Interposer Attacks on Confidential Computing via Dynamic Memory Aliasing, J. De Meulemeester et al. (2026). Original
  16. RMPocalypse: How a Catch-22 Breaks AMD SEV-SNP, B. Schlüter & S. Shinde (2025). Original
  17. SEV-SNP RMP Initialization Vulnerability (AMD-SB-3020), AMD (2025). Original
  18. On TEEs for Privacy-Preserving Monitoring in AI Governance, Gloria Z (2026). Original
  19. 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.

18 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.

All claims

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.

All mechanisms

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 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.

Search

Full search page