{
  "schema_version": "1.3",
  "url": "https://trustbutveri.fyi/explorer/?mechanisms=M-0016,M-0014,M-0017&hide=weights,training",
  "data_generated": "2026-10-09",
  "definitions": {
    "methodology": "https://trustbutveri.fyi/about/methodology/",
    "readiness": "https://trustbutveri.fyi/about/readiness/",
    "filters": [
      {
        "id": "prover",
        "label": "Prover",
        "question": "How far can the party being checked be trusted?",
        "options": [
          {
            "value": "cooperative",
            "label": "Cooperative"
          },
          {
            "value": "semi-trusted",
            "label": "Semi-trusted"
          },
          {
            "value": "adversarial",
            "label": "Adversarial"
          }
        ],
        "rule": "Keeps mechanisms whose threat model holds against at least this prover. Adversarial is the strongest assumption.",
        "about": "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."
      },
      {
        "id": "onsite",
        "label": "Verifier devices on site",
        "question": "May the verifier install its own hardware at the prover's sites?",
        "options": [
          {
            "value": "no",
            "label": "Not allowed"
          }
        ],
        "rule": "\"Not allowed\" removes mechanisms that need a retrofit device, such as a network tap or a sealed sensor.",
        "about": "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."
      },
      {
        "id": "coop",
        "label": "Prover cooperation",
        "question": "How much must the prover take part?",
        "options": [
          {
            "value": "partial",
            "label": "Partial at most"
          },
          {
            "value": "none",
            "label": "Not required"
          }
        ],
        "rule": "\"Partial at most\" removes mechanisms that need the prover's active participation. \"Not required\" keeps only those that work without it.",
        "about": "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."
      },
      {
        "id": "chips",
        "label": "Chips",
        "question": "May the proposal depend on new chip designs?",
        "options": [
          {
            "value": "existing",
            "label": "Existing chips only"
          }
        ],
        "rule": "\"Existing chips only\" removes mechanisms that need changes to future chip designs.",
        "about": "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."
      },
      {
        "id": "ready",
        "label": "Minimum development status",
        "question": "Development status",
        "options": [
          {
            "value": "R1",
            "label": "Proposed"
          },
          {
            "value": "R2",
            "label": "Research demonstration"
          },
          {
            "value": "R3",
            "label": "Operational use"
          },
          {
            "value": "R4",
            "label": "Legacy independent-evaluation filter",
            "legacy": true
          }
        ],
        "rule": "Keeps mechanisms whose readiness level is at least this one.",
        "about": "A level describes the public evidence for a mechanism's stated use, not its cost or feasibility. R3 can still have open critical flaws."
      },
      {
        "id": "tested",
        "label": "Attack testing",
        "question": "How hard has each mechanism been attacked in public?",
        "options": [
          {
            "value": "analysis",
            "label": "Published analysis"
          },
          {
            "value": "red-teamed",
            "label": "Red-teamed"
          },
          {
            "value": "independent-red-team",
            "label": "Independent red-team"
          }
        ],
        "rule": "Keeps mechanisms whose strongest published attack testing is at least this.",
        "about": "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."
      },
      {
        "id": "hide",
        "label": "Keep hidden from the verifier",
        "question": "What must the verifier never see?",
        "options": [
          {
            "value": "weights",
            "label": "Model weights"
          },
          {
            "value": "io",
            "label": "Inputs and outputs"
          },
          {
            "value": "training",
            "label": "Training data"
          }
        ],
        "rule": "Removes mechanisms that show the asset to the verifier. Conditional or unspecified exposure stays with a note and needs checking against the privacy requirement.",
        "about": "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."
      }
    ],
    "exposure": "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.",
    "claim_status": {
      "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."
    },
    "finding_classification": {
      "failure": {
        "label": "Known failures",
        "singular": "Known failure",
        "anchor": "known-flaws"
      },
      "scope-limitation": {
        "label": "Scope limitations",
        "singular": "Scope limitation",
        "anchor": "scope-limitations"
      },
      "open-question": {
        "label": "Open questions",
        "singular": "Open question",
        "anchor": "open-questions"
      }
    },
    "finding_scope": "Evidence scope describes where a finding was demonstrated; it does not establish applicability to every implementation in the mechanism family.",
    "claim_finding_scope": "open_critical_findings names active failures on the assessed records; open_critical_context names conditional family failures whose implementation applicability is unassessed.",
    "legacy_status": "The status field retains covered/partial/none for compatibility. It names claim links, never successful verification. Use claim_status and status_label for presentation."
  },
  "filters": {
    "prover": "",
    "onsite": "",
    "coop": "",
    "chips": "",
    "ready": "",
    "tested": "",
    "hide": [
      "weights",
      "training"
    ]
  },
  "mechanisms_passing_filters": 24,
  "claims": [],
  "mechanisms": [
    {
      "id": "M-0016",
      "title": "Timed challenge-response and memory-occupation challenges",
      "url": "https://trustbutveri.fyi/mechanisms/timed-challenge-response/",
      "assessment_record": {
        "id": "M-0016",
        "title": "Timed challenge-response and memory-occupation challenges",
        "url": "https://trustbutveri.fyi/mechanisms/timed-challenge-response/"
      },
      "finding_counts": {
        "failure": 2,
        "scope_limitation": 0,
        "open_question": 1,
        "open_failures": {
          "critical": 0,
          "significant": 1,
          "minor": 0
        }
      },
      "selected_implementation": null,
      "readiness": {
        "level": "R2",
        "scope": "detecting whether a GPU is doing other work",
        "confidence": "medium",
        "evidence": [
          "S-0018",
          "S-0067",
          "S-0033",
          "S-1306",
          "S-1307",
          "S-1607",
          "S-1304",
          "S-0032"
        ]
      },
      "development_status": {
        "code": "R2",
        "label": "Research demonstration",
        "short": "Research demo",
        "rank": 2,
        "legacy_code": "R2"
      },
      "security_evidence": {
        "attack_testing": {
          "status": "analysis",
          "label": "Published security analysis",
          "kind": "analysis"
        },
        "independent_evaluation": {
          "status": "unassessed"
        },
        "formal_proof": {
          "status": "unassessed"
        },
        "deployment_assurance": {
          "status": "unassessed"
        },
        "legacy_evaluation_code": null,
        "scoped_findings": [
          {
            "n": 1,
            "severity": "significant",
            "status": "disputed",
            "evidence_scope": "unassessed",
            "sources": [
              "S-1308",
              "S-0074"
            ]
          },
          {
            "n": 2,
            "severity": "significant",
            "status": "open",
            "evidence_scope": "unassessed",
            "sources": [
              "S-0018"
            ]
          }
        ],
        "open_failures": {
          "critical": 0,
          "significant": 1,
          "minor": 0
        }
      },
      "assessed_properties": {
        "threat_model": "adversarial",
        "hardware_requirement": "none",
        "prover_cooperation": "required",
        "adversarial_evaluation": "analysis"
      },
      "claims": [],
      "exposure": {
        "weights": "none",
        "io": "none",
        "training": "none",
        "note": "Uses verifier-chosen challenges; it does not handle model data."
      },
      "family_finding_context": [],
      "filter_issues": []
    },
    {
      "id": "M-0014",
      "title": "Bandwidth limits and compartmentalization",
      "url": "https://trustbutveri.fyi/mechanisms/bandwidth-limits-and-compartmentalization/",
      "assessment_record": {
        "id": "M-0014",
        "title": "Bandwidth limits and compartmentalization",
        "url": "https://trustbutveri.fyi/mechanisms/bandwidth-limits-and-compartmentalization/"
      },
      "finding_counts": {
        "failure": 2,
        "scope_limitation": 2,
        "open_question": 1,
        "open_failures": {
          "critical": 0,
          "significant": 2,
          "minor": 0
        }
      },
      "selected_implementation": null,
      "readiness": {
        "level": "R2",
        "scope": "monitoring inter-node traffic with operator-run software on four GPUs",
        "confidence": "low",
        "evidence": [
          "S-0067",
          "S-1301",
          "S-0018",
          "S-3220",
          "S-1313"
        ]
      },
      "development_status": {
        "code": "R2",
        "label": "Research demonstration",
        "short": "Research demo",
        "rank": 2,
        "legacy_code": "R2"
      },
      "security_evidence": {
        "attack_testing": {
          "status": "analysis",
          "label": "Published security analysis",
          "kind": "analysis"
        },
        "independent_evaluation": {
          "status": "unassessed"
        },
        "formal_proof": {
          "status": "unassessed"
        },
        "deployment_assurance": {
          "status": "unassessed"
        },
        "legacy_evaluation_code": null,
        "scoped_findings": [
          {
            "n": 2,
            "severity": "significant",
            "status": "open",
            "evidence_scope": "unassessed",
            "sources": [
              "S-1301"
            ]
          },
          {
            "n": 5,
            "severity": "significant",
            "status": "open",
            "evidence_scope": "unassessed",
            "sources": [
              "S-1313"
            ]
          }
        ],
        "open_failures": {
          "critical": 0,
          "significant": 2,
          "minor": 0
        }
      },
      "assessed_properties": {
        "threat_model": "adversarial",
        "hardware_requirement": "retrofit-device",
        "prover_cooperation": "required",
        "adversarial_evaluation": "analysis"
      },
      "claims": [],
      "exposure": {
        "weights": "none",
        "io": "none",
        "training": "none",
        "note": "Caps traffic between groups of chips; it does not read the traffic's content."
      },
      "family_finding_context": [],
      "filter_issues": []
    },
    {
      "id": "M-0017",
      "title": "Tamper evidence for verifier devices",
      "url": "https://trustbutveri.fyi/mechanisms/tamper-evidence-for-verifier-devices/",
      "assessment_record": {
        "id": "M-0017",
        "title": "Tamper evidence for verifier devices",
        "url": "https://trustbutveri.fyi/mechanisms/tamper-evidence-for-verifier-devices/"
      },
      "finding_counts": {
        "failure": 2,
        "scope_limitation": 1,
        "open_question": 0,
        "open_failures": {
          "critical": 0,
          "significant": 2,
          "minor": 0
        }
      },
      "selected_implementation": null,
      "readiness": {
        "level": "R2",
        "scope": "detecting probing of proposed verifier hardware, using server and electronics prototypes as evidence",
        "confidence": "medium",
        "evidence": [
          "S-0052",
          "S-1315",
          "S-0051",
          "S-0050",
          "S-3262",
          "S-1316",
          "S-0018"
        ]
      },
      "development_status": {
        "code": "R2",
        "label": "Research demonstration",
        "short": "Research demo",
        "rank": 2,
        "legacy_code": "R2"
      },
      "security_evidence": {
        "attack_testing": {
          "status": "analysis",
          "label": "Published security analysis",
          "kind": "analysis"
        },
        "independent_evaluation": {
          "status": "unassessed"
        },
        "formal_proof": {
          "status": "unassessed"
        },
        "deployment_assurance": {
          "status": "unassessed"
        },
        "legacy_evaluation_code": null,
        "scoped_findings": [
          {
            "n": 1,
            "severity": "significant",
            "status": "open",
            "evidence_scope": "mechanism",
            "sources": [
              "S-1317",
              "S-1318"
            ]
          },
          {
            "n": 3,
            "severity": "significant",
            "status": "open",
            "evidence_scope": "mechanism",
            "sources": [
              "S-1315",
              "S-0052",
              "S-3261"
            ]
          }
        ],
        "open_failures": {
          "critical": 0,
          "significant": 2,
          "minor": 0
        }
      },
      "assessed_properties": {
        "threat_model": "adversarial",
        "hardware_requirement": "retrofit-device",
        "prover_cooperation": "partial",
        "adversarial_evaluation": "analysis"
      },
      "claims": [],
      "exposure": {
        "weights": "none",
        "io": "none",
        "training": "none",
        "note": "Protects verifier devices; it does not handle model data."
      },
      "family_finding_context": [],
      "filter_issues": []
    }
  ],
  "strengths": {
    "covered": [],
    "production": [],
    "operationalUse": [],
    "adversarial": [
      "M-0016",
      "M-0014",
      "M-0017"
    ],
    "noNewHardware": [
      "M-0016"
    ],
    "mitigated": [],
    "notCounted": []
  },
  "properties": {
    "covered": [],
    "production": [],
    "operationalUse": [],
    "adversarial": [
      "M-0016",
      "M-0014",
      "M-0017"
    ],
    "noNewHardware": [
      "M-0016"
    ],
    "mitigated": [],
    "notCounted": []
  },
  "attack_testing": [
    {
      "id": "M-0016",
      "record": "M-0016",
      "evaluation": "analysis",
      "in_setting": true
    },
    {
      "id": "M-0014",
      "record": "M-0014",
      "evaluation": "analysis",
      "in_setting": true
    },
    {
      "id": "M-0017",
      "record": "M-0017",
      "evaluation": "analysis",
      "in_setting": true
    }
  ],
  "selected_implementations": {},
  "weaknesses": {
    "gaps": [],
    "excluded": [],
    "unlinked": [],
    "critical": [],
    "significant": [
      {
        "mech": "M-0016",
        "n": 2,
        "historical": false,
        "title": "Remote memory narrows the timing margin",
        "classification": "failure",
        "kind": "theoretical-argument",
        "severity": "significant",
        "status": "open",
        "evidence_scope": null,
        "scope_note": null,
        "related_finding": null,
        "description": "Data-centre remote memory access returns in about 1–2 µs, against about 70–200 ns for local DRAM. The MIRI overview says verification of memory saturation depends on ruling out remote access by latency or physical disconnection. It names pre-staging data into local memory as the remaining evasion and proposes an unpredictable, capacity-filling challenge to close it.",
        "response": null,
        "sources": [
          "S-0018"
        ],
        "helps": [
          {
            "by": "M-0014",
            "how": "Physical disconnection is proposed to exclude remote memory between the separated groups during a challenge. It depends on the isolation boundary being enforced."
          }
        ]
      },
      {
        "mech": "M-0014",
        "n": 2,
        "historical": false,
        "title": "Operator control of pod routing collapses the bound",
        "classification": "failure",
        "kind": "theoretical-argument",
        "severity": "significant",
        "status": "open",
        "evidence_scope": null,
        "scope_note": null,
        "related_finding": null,
        "description": "Lucid's analysis finds that if the operator can freely assign pods to routers, it could dedicate a whole cell of 100 or more pods to one pipeline stage. The bound then falls to about 90–220x uncompressed and as low as about 25x with compression. The proposed mitigation, auditor-controlled random assignment that is periodically re-randomized, has not been implemented.",
        "response": null,
        "sources": [
          "S-1301"
        ]
      },
      {
        "mech": "M-0014",
        "n": 5,
        "historical": false,
        "title": "Parallel scale-up switches are hard enforcement points",
        "classification": "failure",
        "kind": "theoretical-argument",
        "severity": "significant",
        "status": "open",
        "evidence_scope": null,
        "scope_note": null,
        "related_finding": null,
        "description": "In GB200 topologies, GPUs reach GPUs in other nodes through NVSwitches without a NIC on the path. Amodo notes that limits are hard to enforce there because many switches work in parallel, so compromising one or two would bypass the limit.",
        "response": null,
        "sources": [
          "S-1313"
        ]
      },
      {
        "mech": "M-0017",
        "n": 1,
        "historical": false,
        "title": "Seals are often defeated with simple methods",
        "classification": "failure",
        "kind": "demonstrated-attack",
        "severity": "significant",
        "status": "open",
        "evidence_scope": "mechanism",
        "scope_note": "Published defeats of general security seals. They warn about proposed verifier-device seals, but do not demonstrate defeat of an AI verification enclosure or sensor.",
        "related_finding": null,
        "description": "In 1996 a Los Alamos vulnerability assessment defeated all 94 security seals it examined, with 132 defeats in total, using rapid, inexpensive, low-tech methods. It found that seal cost did not predict security. In 2001 Johnston reported that high-tech seals are often easier to defeat than low-tech ones.",
        "response": null,
        "sources": [
          "S-1317",
          "S-1318"
        ]
      },
      {
        "mech": "M-0017",
        "n": 3,
        "historical": false,
        "title": "Attack classes outside published models",
        "classification": "failure",
        "kind": "open-question",
        "severity": "significant",
        "status": "open",
        "evidence_scope": "mechanism",
        "scope_note": "The radio compensation result is emulated using measured channel data under a known-reference attacker model. It is not a physical bypass demonstration against an AI verifier enclosure.",
        "related_finding": null,
        "description": "The authors of the batteryless cover say they cannot assess chemical-solvent attacks, which exceed their expertise, and deem cover removal impractical. Anti-Tamper Radio's reference can drift as the environment or measurement system ages; the authors suggest gradually renewing the reference. A 2025 follow-up by some of the same authors shows, by emulation on measured channel data, that an attacker who knows the reference channel and the needle's effect on it could inject a signal that cancels the change caused by a needle insertion. It proposes a reconfigurable intelligent surface that randomizes the channel as a countermeasure.",
        "response": null,
        "sources": [
          "S-1315",
          "S-0052",
          "S-3261"
        ]
      }
    ],
    "criticalMechanisms": [],
    "significantMechanisms": [
      "M-0016",
      "M-0014",
      "M-0017"
    ],
    "familyContext": [],
    "scopeLimitations": [
      {
        "mech": "M-0014",
        "n": 3,
        "historical": false,
        "title": "Undeclared local storage raises per-pod capacity",
        "classification": "scope-limitation",
        "kind": "theoretical-argument",
        "severity": "significant",
        "status": "open",
        "evidence_scope": null,
        "scope_note": null,
        "related_finding": null,
        "description": "More memory or storage per pod helps an adversary. Lucid requires per-pod storage to be declared, capped and physically inspected.",
        "response": null,
        "sources": [
          "S-1301"
        ]
      },
      {
        "mech": "M-0014",
        "n": 4,
        "historical": false,
        "title": "Training within one pod is not covered",
        "classification": "scope-limitation",
        "kind": "open-question",
        "severity": "significant",
        "status": "open",
        "evidence_scope": null,
        "scope_note": null,
        "related_finding": null,
        "description": "Lucid's bounds concern pre-training models larger than the pods are sized for. Training models that fit in one pod, fine-tuning and reinforcement-learning post-training within one pod are outside the modelled threat.",
        "response": null,
        "sources": [
          "S-1301"
        ]
      },
      {
        "mech": "M-0017",
        "n": 2,
        "historical": false,
        "title": "Security depends on inspection protocols",
        "classification": "scope-limitation",
        "kind": "theoretical-argument",
        "severity": "significant",
        "status": "open",
        "evidence_scope": "mechanism",
        "scope_note": "An inspection and protocol requirement drawn from safeguards and enclosure studies, not a reported break of a deployed AI verifier.",
        "related_finding": null,
        "description": "Johnston argues that a seal is no better than the protocols for using it, and that inspectors are usually given little useful information on how to detect tampering. The Sandia survey notes that larger enclosures are hard to inspect fully and that sensor data must be authenticated.",
        "response": null,
        "sources": [
          "S-1318",
          "S-1316"
        ]
      }
    ],
    "openQuestions": [
      {
        "mech": "M-0016",
        "n": 3,
        "historical": false,
        "title": "Error rates not quantified",
        "classification": "open-question",
        "kind": "open-question",
        "severity": "minor",
        "status": "open",
        "evidence_scope": null,
        "scope_note": null,
        "related_finding": null,
        "description": "Monfared et al. show separable timing distributions. Their acceptance rule passes a GPU when its mean time per round stays at or below a chosen maximum, and an appendix outlines statistical tests for the proof-of-work puzzle. They leave hardware-specific threshold values to future work and report no false-positive or false-negative rates.",
        "response": null,
        "sources": [
          "S-0033"
        ]
      },
      {
        "mech": "M-0014",
        "n": 1,
        "historical": false,
        "title": "Low-communication training reduces the bandwidth training needs",
        "classification": "open-question",
        "kind": "theoretical-argument",
        "severity": "significant",
        "status": "open",
        "evidence_scope": null,
        "scope_note": null,
        "related_finding": null,
        "description": "DiLoCo matched fully synchronous training on 8 workers while communicating 500 times less. Rahman writes that this family of methods theoretically allows large-scale training with less than 100 Mbps. Lucid includes these methods in its bounds, but notes that extreme activation compression, architectures with unusually small inter-layer widths, or modular paradigms could erode the margin.",
        "response": null,
        "sources": [
          "S-1314",
          "S-0060",
          "S-1301"
        ]
      }
    ],
    "minor": 0,
    "minorFindings": [],
    "minorBy": [],
    "notDemonstrated": [],
    "newChip": []
  },
  "findings": [
    {
      "mech": "M-0016",
      "record": "M-0016",
      "n": 1,
      "historical": false,
      "title": "Timing-based software attestation has been broken in practice",
      "classification": "failure",
      "kind": "demonstrated-attack",
      "severity": "significant",
      "status": "disputed",
      "evidence_scope": null,
      "scope_note": null,
      "related_finding": null,
      "description": "Castelluccia et al. implemented two generic attacks, one based on a return-oriented rootkit and one on code compression, together with specific attacks on SWATT and ICE-based schemes, on commodity sensor nodes. They conclude that secure time-based attestation is \"very difficult, if not impossible, to design correctly\". The attacks target embedded schemes, not AI accelerators.",
      "response": "Perrig and van Doorn, two of the designers of SWATT and ICE, replied in August 2010. They argue that the rootkit attack defeats a naive implementation, not a property the schemes claim, and that the SWATT attack was run on a re-implementation on a chip with eight times the program memory, where SWATT's own chip is almost always full of code. They accept that the attack on ICE works.",
      "sources": [
        "S-1308",
        "S-0074"
      ]
    },
    {
      "mech": "M-0016",
      "record": "M-0016",
      "n": 2,
      "historical": false,
      "title": "Remote memory narrows the timing margin",
      "classification": "failure",
      "kind": "theoretical-argument",
      "severity": "significant",
      "status": "open",
      "evidence_scope": null,
      "scope_note": null,
      "related_finding": null,
      "description": "Data-centre remote memory access returns in about 1–2 µs, against about 70–200 ns for local DRAM. The MIRI overview says verification of memory saturation depends on ruling out remote access by latency or physical disconnection. It names pre-staging data into local memory as the remaining evasion and proposes an unpredictable, capacity-filling challenge to close it.",
      "response": null,
      "sources": [
        "S-0018"
      ],
      "helps": [
        {
          "by": "M-0014",
          "how": "Physical disconnection is proposed to exclude remote memory between the separated groups during a challenge. It depends on the isolation boundary being enforced."
        }
      ]
    },
    {
      "mech": "M-0016",
      "record": "M-0016",
      "n": 3,
      "historical": false,
      "title": "Error rates not quantified",
      "classification": "open-question",
      "kind": "open-question",
      "severity": "minor",
      "status": "open",
      "evidence_scope": null,
      "scope_note": null,
      "related_finding": null,
      "description": "Monfared et al. show separable timing distributions. Their acceptance rule passes a GPU when its mean time per round stays at or below a chosen maximum, and an appendix outlines statistical tests for the proof-of-work puzzle. They leave hardware-specific threshold values to future work and report no false-positive or false-negative rates.",
      "response": null,
      "sources": [
        "S-0033"
      ]
    },
    {
      "mech": "M-0014",
      "record": "M-0014",
      "n": 1,
      "historical": false,
      "title": "Low-communication training reduces the bandwidth training needs",
      "classification": "open-question",
      "kind": "theoretical-argument",
      "severity": "significant",
      "status": "open",
      "evidence_scope": null,
      "scope_note": null,
      "related_finding": null,
      "description": "DiLoCo matched fully synchronous training on 8 workers while communicating 500 times less. Rahman writes that this family of methods theoretically allows large-scale training with less than 100 Mbps. Lucid includes these methods in its bounds, but notes that extreme activation compression, architectures with unusually small inter-layer widths, or modular paradigms could erode the margin.",
      "response": null,
      "sources": [
        "S-1314",
        "S-0060",
        "S-1301"
      ]
    },
    {
      "mech": "M-0014",
      "record": "M-0014",
      "n": 2,
      "historical": false,
      "title": "Operator control of pod routing collapses the bound",
      "classification": "failure",
      "kind": "theoretical-argument",
      "severity": "significant",
      "status": "open",
      "evidence_scope": null,
      "scope_note": null,
      "related_finding": null,
      "description": "Lucid's analysis finds that if the operator can freely assign pods to routers, it could dedicate a whole cell of 100 or more pods to one pipeline stage. The bound then falls to about 90–220x uncompressed and as low as about 25x with compression. The proposed mitigation, auditor-controlled random assignment that is periodically re-randomized, has not been implemented.",
      "response": null,
      "sources": [
        "S-1301"
      ]
    },
    {
      "mech": "M-0014",
      "record": "M-0014",
      "n": 3,
      "historical": false,
      "title": "Undeclared local storage raises per-pod capacity",
      "classification": "scope-limitation",
      "kind": "theoretical-argument",
      "severity": "significant",
      "status": "open",
      "evidence_scope": null,
      "scope_note": null,
      "related_finding": null,
      "description": "More memory or storage per pod helps an adversary. Lucid requires per-pod storage to be declared, capped and physically inspected.",
      "response": null,
      "sources": [
        "S-1301"
      ]
    },
    {
      "mech": "M-0014",
      "record": "M-0014",
      "n": 4,
      "historical": false,
      "title": "Training within one pod is not covered",
      "classification": "scope-limitation",
      "kind": "open-question",
      "severity": "significant",
      "status": "open",
      "evidence_scope": null,
      "scope_note": null,
      "related_finding": null,
      "description": "Lucid's bounds concern pre-training models larger than the pods are sized for. Training models that fit in one pod, fine-tuning and reinforcement-learning post-training within one pod are outside the modelled threat.",
      "response": null,
      "sources": [
        "S-1301"
      ]
    },
    {
      "mech": "M-0014",
      "record": "M-0014",
      "n": 5,
      "historical": false,
      "title": "Parallel scale-up switches are hard enforcement points",
      "classification": "failure",
      "kind": "theoretical-argument",
      "severity": "significant",
      "status": "open",
      "evidence_scope": null,
      "scope_note": null,
      "related_finding": null,
      "description": "In GB200 topologies, GPUs reach GPUs in other nodes through NVSwitches without a NIC on the path. Amodo notes that limits are hard to enforce there because many switches work in parallel, so compromising one or two would bypass the limit.",
      "response": null,
      "sources": [
        "S-1313"
      ]
    },
    {
      "mech": "M-0017",
      "record": "M-0017",
      "n": 1,
      "historical": false,
      "title": "Seals are often defeated with simple methods",
      "classification": "failure",
      "kind": "demonstrated-attack",
      "severity": "significant",
      "status": "open",
      "evidence_scope": "mechanism",
      "scope_note": "Published defeats of general security seals. They warn about proposed verifier-device seals, but do not demonstrate defeat of an AI verification enclosure or sensor.",
      "related_finding": null,
      "description": "In 1996 a Los Alamos vulnerability assessment defeated all 94 security seals it examined, with 132 defeats in total, using rapid, inexpensive, low-tech methods. It found that seal cost did not predict security. In 2001 Johnston reported that high-tech seals are often easier to defeat than low-tech ones.",
      "response": null,
      "sources": [
        "S-1317",
        "S-1318"
      ]
    },
    {
      "mech": "M-0017",
      "record": "M-0017",
      "n": 2,
      "historical": false,
      "title": "Security depends on inspection protocols",
      "classification": "scope-limitation",
      "kind": "theoretical-argument",
      "severity": "significant",
      "status": "open",
      "evidence_scope": "mechanism",
      "scope_note": "An inspection and protocol requirement drawn from safeguards and enclosure studies, not a reported break of a deployed AI verifier.",
      "related_finding": null,
      "description": "Johnston argues that a seal is no better than the protocols for using it, and that inspectors are usually given little useful information on how to detect tampering. The Sandia survey notes that larger enclosures are hard to inspect fully and that sensor data must be authenticated.",
      "response": null,
      "sources": [
        "S-1318",
        "S-1316"
      ]
    },
    {
      "mech": "M-0017",
      "record": "M-0017",
      "n": 3,
      "historical": false,
      "title": "Attack classes outside published models",
      "classification": "failure",
      "kind": "open-question",
      "severity": "significant",
      "status": "open",
      "evidence_scope": "mechanism",
      "scope_note": "The radio compensation result is emulated using measured channel data under a known-reference attacker model. It is not a physical bypass demonstration against an AI verifier enclosure.",
      "related_finding": null,
      "description": "The authors of the batteryless cover say they cannot assess chemical-solvent attacks, which exceed their expertise, and deem cover removal impractical. Anti-Tamper Radio's reference can drift as the environment or measurement system ages; the authors suggest gradually renewing the reference. A 2025 follow-up by some of the same authors shows, by emulation on measured channel data, that an attacker who knows the reference channel and the needle's effect on it could inject a signal that cancels the change caused by a needle insertion. It proposes a reconfigurable intelligent surface that randomizes the channel as a countermeasure.",
      "response": null,
      "sources": [
        "S-1315",
        "S-0052",
        "S-3261"
      ]
    }
  ],
  "possible_additions": [
    {
      "id": "M-0013",
      "title": "Network taps and certifiers",
      "url": "https://trustbutveri.fyi/mechanisms/network-taps-and-certifiers/",
      "readiness": "R1",
      "development_status": {
        "code": "R1",
        "label": "Proposed",
        "short": "Proposed",
        "rank": 1,
        "legacy_code": "R1"
      },
      "security_evidence": {
        "attack_testing": {
          "status": "analysis",
          "label": "Published security analysis",
          "kind": "analysis"
        },
        "independent_evaluation": {
          "status": "unassessed"
        },
        "formal_proof": {
          "status": "unassessed"
        },
        "deployment_assurance": {
          "status": "unassessed"
        },
        "legacy_evaluation_code": null,
        "scoped_findings": [
          {
            "n": 1,
            "severity": "significant",
            "status": "open",
            "evidence_scope": "unassessed",
            "sources": [
              "S-1300",
              "S-1507"
            ]
          },
          {
            "n": 4,
            "severity": "significant",
            "status": "open",
            "evidence_scope": "unassessed",
            "sources": [
              "S-1312"
            ]
          },
          {
            "n": 6,
            "severity": "minor",
            "status": "mitigated",
            "evidence_scope": "unassessed",
            "sources": [
              "S-1300"
            ]
          }
        ],
        "open_failures": {
          "critical": 0,
          "significant": 2,
          "minor": 0
        }
      },
      "fits_filters": true,
      "filter_issues": [],
      "reasons": [
        {
          "kind": "blocker",
          "mech": "M-0014",
          "text": "The verifier must know that all traffic leaving a pod crosses the capped, monitored links."
        }
      ]
    }
  ],
  "goal": null,
  "design": null,
  "dependencies": {
    "prerequisites": [],
    "shared": [],
    "blockers": [
      {
        "mech": "M-0016",
        "n": 1,
        "historical": false,
        "text": "No network-level memory challenge across data-centre servers has been demonstrated.",
        "theme": "adversarial-validation",
        "blocked_by": null,
        "sources": [
          "S-0018"
        ],
        "inProposal": null
      },
      {
        "mech": "M-0016",
        "n": 2,
        "historical": false,
        "text": "Challenges that fill memory displace workloads; filling a pod's volatile memory takes tens of minutes and SSDs take hours.",
        "theme": "performance-compatibility",
        "blocked_by": null,
        "sources": [
          "S-0018",
          "S-0033"
        ],
        "inProposal": null
      },
      {
        "mech": "M-0016",
        "n": 3,
        "historical": false,
        "text": "Outside help, such as remote memory, must be excluded during challenges.",
        "theme": "coverage-hidden-compute",
        "blocked_by": "M-0014",
        "sources": [
          "S-0018"
        ],
        "inProposal": true
      },
      {
        "mech": "M-0014",
        "n": 1,
        "historical": false,
        "text": "No cap that a verifier can check has been implemented or red-teamed.",
        "theme": "adversarial-validation",
        "blocked_by": null,
        "sources": [
          "S-1301"
        ],
        "inProposal": null
      },
      {
        "mech": "M-0014",
        "n": 2,
        "historical": false,
        "text": "The verifier must know that all traffic leaving a pod crosses the capped, monitored links.",
        "theme": "coverage-hidden-compute",
        "blocked_by": "M-0013",
        "sources": [
          "S-0018"
        ],
        "inProposal": false
      },
      {
        "mech": "M-0014",
        "n": 3,
        "historical": false,
        "text": "Shaping devices and routing assignments must be trusted by both parties; Amodo has not yet fully analysed resilience to a compromised DPU.",
        "theme": "hardware-trust",
        "blocked_by": "M-0017",
        "sources": [
          "S-1301",
          "S-1313"
        ],
        "inProposal": true
      },
      {
        "mech": "M-0014",
        "n": 4,
        "historical": false,
        "text": "Advances in low-communication training could shrink the margin that the cap enforces.",
        "theme": "capacity-bounds",
        "blocked_by": null,
        "sources": [
          "S-1314",
          "S-0060",
          "S-1301"
        ],
        "inProposal": null
      },
      {
        "mech": "M-0017",
        "n": 1,
        "historical": false,
        "text": "No tamper-evident enclosure has been designed for AI verifier hardware at retrofit scale.",
        "theme": "hardware-trust",
        "blocked_by": null,
        "sources": [
          "S-0018"
        ],
        "inProposal": null
      },
      {
        "mech": "M-0017",
        "n": 2,
        "historical": false,
        "text": "Battery-backed designs add bulk, limit operating temperature (+10 °C to +35 °C for the IBM 4765) and complicate transport.",
        "theme": "performance-compatibility",
        "blocked_by": null,
        "sources": [
          "S-1315"
        ],
        "inProposal": null
      },
      {
        "mech": "M-0017",
        "n": 3,
        "historical": false,
        "text": "Active monitoring needs power, and visual inspection of large enclosures faces access limits.",
        "theme": "access-governance",
        "blocked_by": null,
        "sources": [
          "S-1316"
        ],
        "inProposal": null
      },
      {
        "mech": "M-0017",
        "n": 4,
        "historical": false,
        "text": "No evaluation has been published in the AI verification setting.",
        "theme": "adversarial-validation",
        "blocked_by": null,
        "sources": [
          "S-0018"
        ],
        "inProposal": null
      }
    ]
  },
  "exposure": {
    "weights": {
      "shown": [],
      "partial": [],
      "hidden": [],
      "none": [
        "M-0016",
        "M-0014",
        "M-0017"
      ],
      "unknown": []
    },
    "io": {
      "shown": [],
      "partial": [],
      "hidden": [],
      "none": [
        "M-0016",
        "M-0014",
        "M-0017"
      ],
      "unknown": []
    },
    "training": {
      "shown": [],
      "partial": [],
      "hidden": [],
      "none": [
        "M-0016",
        "M-0014",
        "M-0017"
      ],
      "unknown": []
    }
  },
  "implementations": [
    {
      "mechanism": "M-0016",
      "selected": null,
      "implementations": [
        {
          "id": "I-0020",
          "title": "Data-centre memory challenging",
          "url": "https://trustbutveri.fyi/implementations/data-centre-memory-challenging/"
        },
        {
          "id": "I-0018",
          "title": "GPU contention probes",
          "url": "https://trustbutveri.fyi/implementations/gpu-contention-probes/"
        },
        {
          "id": "I-0012",
          "title": "Low-trust AI compute verification system overview",
          "url": "https://trustbutveri.fyi/implementations/low-trust-compute-verification-system-overview/"
        },
        {
          "id": "I-0021",
          "title": "SAGE",
          "url": "https://trustbutveri.fyi/implementations/sage-gpu-attestation/"
        },
        {
          "id": "I-0019",
          "title": "VRAM-residency challenge",
          "url": "https://trustbutveri.fyi/implementations/vram-residency-challenge/"
        }
      ]
    },
    {
      "mechanism": "M-0014",
      "selected": null,
      "implementations": [
        {
          "id": "I-0011",
          "title": "AI 2040 inference-only verification stack",
          "url": "https://trustbutveri.fyi/implementations/ai-2040-inference-only-verification-plan/"
        },
        {
          "id": "I-0010",
          "title": "RAND secure inference data center (SIDC) design",
          "url": "https://trustbutveri.fyi/implementations/rand-secure-inference-data-centers/"
        }
      ]
    },
    {
      "mechanism": "M-0017",
      "selected": null,
      "implementations": [
        {
          "id": "I-0011",
          "title": "AI 2040 inference-only verification stack",
          "url": "https://trustbutveri.fyi/implementations/ai-2040-inference-only-verification-plan/"
        }
      ]
    }
  ],
  "sources": [
    {
      "id": "S-0018",
      "title": "A System Overview for Near-Term, Low-Trust AI Compute Verification",
      "authors": "N. Cankaya",
      "year": 2026,
      "url": "https://intelligence.org/wp-content/uploads/2026/06/A-system-overview-for-near-term-low-trust-AI-compute-verification.pdf",
      "path": "/sources/cankaya-system-overview-low-trust-compute-verification/"
    },
    {
      "id": "S-0067",
      "title": "Verification Plan",
      "authors": "R. Dean",
      "year": 2026,
      "url": "https://ai-2040.com/supplements/verification-plan",
      "path": "/sources/dean-verification-plan/"
    },
    {
      "id": "S-0033",
      "title": "Timing and Memory Telemetry on GPUs for AI Governance",
      "authors": "S. K. Monfared et al.",
      "year": 2026,
      "url": "https://arxiv.org/abs/2602.09369",
      "path": "/sources/monfared-timing-memory-telemetry-gpus/"
    },
    {
      "id": "S-1306",
      "title": "SAGE: Software-based Attestation for GPU Execution",
      "authors": "A. Ivanov et al.",
      "year": 2023,
      "url": "https://www.usenix.org/conference/atc23/presentation/ivanov",
      "path": "/sources/ivanov-sage-gpu-attestation/"
    },
    {
      "id": "S-1307",
      "title": "SWATT: SoftWare-based ATTestation for Embedded Devices",
      "authors": "A. Seshadri et al.",
      "year": 2004,
      "url": "https://netsec.ethz.ch/publications/papers/swatt.pdf",
      "path": "/sources/seshadri-swatt/"
    },
    {
      "id": "S-1607",
      "title": "Proofs of Space",
      "authors": "S. Dziembowski et al.",
      "year": 2015,
      "url": "https://eprint.iacr.org/2013/796",
      "path": "/sources/dziembowski-proofs-of-space/"
    },
    {
      "id": "S-1304",
      "title": "Secure Code Update for Embedded Devices via Proofs of Secure Erasure",
      "authors": "D. Perito & G. Tsudik",
      "year": 2010,
      "url": "https://link.springer.com/chapter/10.1007/978-3-642-15497-3_39",
      "path": "/sources/perito-proofs-of-secure-erasure/"
    },
    {
      "id": "S-0032",
      "title": "Software-Based Memory Erasure with Relaxed Isolation Requirements",
      "authors": "S. Bursuc et al.",
      "year": 2024,
      "url": "https://ieeexplore.ieee.org/document/10664348/",
      "path": "/sources/bursuc-software-based-memory-erasure/"
    },
    {
      "id": "S-1308",
      "title": "On the Difficulty of Software-Based Attestation of Embedded Devices",
      "authors": "C. Castelluccia et al.",
      "year": 2009,
      "url": "https://s3.eurecom.fr/docs/ccs09_Castelluccia.pdf",
      "path": "/sources/castelluccia-difficulty-software-based-attestation/"
    },
    {
      "id": "S-0074",
      "title": "Refutation of \"On the Difficulty of Software-Based Attestation of Embedded Devices\"",
      "authors": "A. Perrig & L. van Doorn",
      "year": 2010,
      "url": "https://netsec.ethz.ch/publications/papers/perrig-ccs-refutation.pdf",
      "path": "/sources/perrig-refutation-software-based-attestation/"
    },
    {
      "id": "S-1301",
      "title": "Traffic Shaping for Workload Classification",
      "authors": "Lucid Computing",
      "year": 2026,
      "url": "https://lucidcomputing.substack.com/p/traffic-shaping-for-workload-classification",
      "path": "/sources/lucid-traffic-shaping-workload-classification/"
    },
    {
      "id": "S-3220",
      "title": "De-risking Interconnect Limits for AI Verification",
      "authors": "A. Scher et al.",
      "year": 2026,
      "url": "https://techgov.intelligence.org/blog/de-risking-interconnect-limits-for-ai-verification",
      "path": "/sources/scher-derisking-interconnect-limits/"
    },
    {
      "id": "S-1313",
      "title": "The Tray as a Bandwidth Boundary",
      "authors": "Amodo Design",
      "year": 2026,
      "url": "https://amododesign.com/notes/2026-03-16-dpu-bandwidth-limiter/",
      "path": "/sources/amodo-tray-bandwidth-boundary/"
    },
    {
      "id": "S-1314",
      "title": "DiLoCo: Distributed Low-Communication Training of Language Models",
      "authors": "A. Douillard et al.",
      "year": 2024,
      "url": "https://arxiv.org/abs/2311.08105",
      "path": "/sources/douillard-diloco/"
    },
    {
      "id": "S-0060",
      "title": "Does Distributed Training Undermine Compute Governance?",
      "authors": "R. Rahman",
      "year": 2026,
      "url": "https://arxiv.org/abs/2605.29359",
      "path": "/sources/rahman-distributed-training-compute-governance/"
    },
    {
      "id": "S-0052",
      "title": "Anti-Tamper Radio: System-Level Tamper Detection for Computing Systems",
      "authors": "P. Staat et al.",
      "year": 2022,
      "url": "https://ieeexplore.ieee.org/document/9833631/",
      "path": "/sources/staat-anti-tamper-radio/"
    },
    {
      "id": "S-1315",
      "title": "Secure Physical Enclosures from Covers with Tamper-Resistance",
      "authors": "V. Immler et al.",
      "year": 2019,
      "url": "https://tches.iacr.org/index.php/TCHES/article/view/7334",
      "path": "/sources/immler-secure-physical-enclosures-covers/"
    },
    {
      "id": "S-0051",
      "title": "ImpedanceVerif: On-Chip Impedance Sensing for System-Level Tampering Detection",
      "authors": "T. Mosavirik et al.",
      "year": 2023,
      "url": "https://eprint.iacr.org/2022/946",
      "path": "/sources/mosavirik-impedanceverif/"
    },
    {
      "id": "S-0050",
      "title": "IBM 4765 Cryptographic Coprocessor Security Module: Security Policy",
      "authors": "IBM Corporation",
      "year": 2012,
      "url": "https://csrc.nist.gov/csrc/media/projects/cryptographic-module-validation-program/documents/security-policies/140sp1505.pdf",
      "path": "/sources/ibm-4765-security-policy/"
    },
    {
      "id": "S-3262",
      "title": "PHYSEC SEAL: Change detection for maximum safety",
      "authors": "PHYSEC GmbH",
      "year": 2026,
      "url": "https://www.physec.de/en/solutions/physec-seal/",
      "path": "/sources/physec-seal/"
    },
    {
      "id": "S-1316",
      "title": "Tamper-Indicating Enclosures, A Current Survey",
      "authors": "H. A. Smartt & Z. N. Gastelum",
      "year": 2015,
      "url": "https://www.osti.gov/servlets/purl/1256541",
      "path": "/sources/smartt-tamper-indicating-enclosures-survey/"
    },
    {
      "id": "S-1317",
      "title": "Physical Security and Tamper-Indicating Devices",
      "authors": "R. G. Johnston & A. R. E. Garcia",
      "year": 1996,
      "url": "https://www.osti.gov/servlets/purl/459707",
      "path": "/sources/johnston-physical-security-tamper-indicating-devices/"
    },
    {
      "id": "S-1318",
      "title": "Tamper Detection for Safeguards and Treaty Monitoring: Fantasies, Realities, and Potentials",
      "authors": "R. G. Johnston",
      "year": 2001,
      "url": "https://www.nonproliferation.org/wp-content/uploads/npr/81john.pdf",
      "path": "/sources/johnston-tamper-detection-safeguards-treaty-monitoring/"
    },
    {
      "id": "S-3261",
      "title": "Anti-Tamper Radio Meets Reconfigurable Intelligent Surface for System-Level Tamper Detection",
      "authors": "M. S. Tabar et al.",
      "year": 2025,
      "url": "https://arxiv.org/abs/2503.14279",
      "path": "/sources/tabar-anti-tamper-radio-ris/"
    }
  ]
}