Claims

A claim is something one party wants to verify about another party's AI hardware or software, such as "this cluster only runs inference".

Compute stock is at most a declared amount

Negative claim · Mechanisms & implementations: 1 primary, 2 supporting

A party holds no more AI-relevant compute, counted in chips or equivalent capacity, than the total it has declared.

State of verification

No mechanism can yet bound a party's chip stock, and every approach is proposed (R1). Chip tracking would reach new production far better than chips already in circulation, partly because the chip supply chain is concentrated 1 2.

Primary

Full record →Mechanisms & implementations →

Chips are where they are declared to be

Positive claim · Mechanisms & implementations: 2 primary, 3 supporting

Specific AI chips are physically located at the sites a party has declared, throughout the declared period.

State of verification

Chip location concerns known devices and can be checked by locating each one, so it is one of the more tractable claims, but every publicly described scheme is still proposed (R1).

Primary

Full record →Mechanisms & implementations →

Declared hardware is idle or shut down

Negative claim · Mechanisms & implementations: 3 primary, 2 supporting

Specified AI chips or facilities are not performing computation, or are powered off, throughout a declared period.

State of verification

Idleness is one of the more approachable negative claims, because computing needs power and leaves physical traces. On-chip telemetry and timed challenges have reached research demonstration (R2) as indicators of GPU activity, not as proofs that all declared hardware is idle.

Primary

Full record →Mechanisms & implementations →

This compute runs inference, not training

Mixed claim · Mechanisms & implementations: 6 primary, 15 supporting

A declared cluster is used only to run existing models to produce outputs, and not to train new or more capable models.

State of verification

Declared inference can be checked with components at research demonstration (R2). Sampled recomputation and deterministic inference are in production (R3) for checking untrusted inference providers. No production use for a declared cluster is documented. Ruling out training cannot yet be verified, because it needs the rest of the cluster accounted for. Full-stack designs that would do so (AI 2040 inference-only verification stack, Low-trust AI compute verification system overview, SASH confidential network logger) are proposed (R1). The Amodo team, which is building verification components, reports that none of the core components is past a proof-of-principle prototype 13.

Primary

Full record →Mechanisms & implementations →

The declared model is the one being served

Positive claim · Mechanisms & implementations: 13 primary, 14 supporting

Outputs delivered to users or auditors come from the specific model, weights and configuration the provider declared, not from a substitute.

State of verification

The served model can be checked directly on its outputs, and several mechanisms for it have reached research demonstration (R2) or operational use (R3). These development statuses are separate from security evidence and do not show that a mechanism is secure. Known attacks and limits each hold under their own conditions. Forging Intel TDX attestations through the memory bus needed physical access to the hardware 13, but another attack forged AMD SEV-SNP attestations from a malicious hypervisor, in software alone, on platforms without AMD's fix 15. One statistical test of API outputs reached a median power of 77.4% against a range of distortions, using an average of 10 samples per prompt 16. Power here is the probability that the test detects a specified change to the model under the tested conditions 16.

Primary

Full record →Mechanisms & implementations →

Declared safeguards were applied during inference

Positive claim · Mechanisms & implementations: 1 primary, 7 supporting

Specified safety measures, such as input filters, output checks or monitoring, actually ran on the requests a deployed model served.

State of verification

Safeguard application has been shown only in small research prototypes, which can show that a declared safeguard ran, not that it works.

Primary

Full record →Mechanisms & implementations →

A training run stayed within declared limits

Mixed claim · Mechanisms & implementations: 5 primary, 10 supporting

A declared training run used no more compute than permitted and had its declared properties, such as training data, settings and resulting weights.

State of verification

Proof-based checks of training remain far below frontier-scale runs. Proof-of-learning and zero-knowledge proofs of training have both reached research demonstration (R2); hardware enforcement remains proposed (R1).

Primary

Full record →Mechanisms & implementations →

Communication between compute groups is bounded

Negative claim · Mechanisms & implementations: 2 primary, 6 supporting

Data flowing between specified groups of chips, or out of a facility, stays below a declared rate.

State of verification

A software bandwidth monitor has reached research demonstration (R2). It runs on the operator's nodes, and its authors say the measurements are trivially spoofable 13. No bandwidth cap that a verifier can check has been demonstrated publicly.

Primary

Full record →Mechanisms & implementations →

Model weights have not left the facility

Negative claim · Mechanisms & implementations: 1 primary, 7 supporting

No copy of specified model weights has left a designated facility through networks, physical media or other channels.

State of verification

Only the network channel has a bound at research demonstration (R2), and only for inference outputs. Physical side channels rely on proposed (R1) designs, and insiders and physical media are left to facility security 1 and personnel measures such as whistleblowing 8.

Primary

Full record →Mechanisms & implementations →

There is no undeclared relevant compute

Negative claim · Mechanisms & implementations: 1 primary, 2 supporting

A party controls no AI-relevant computing hardware or facilities, above an agreed threshold, beyond those it has declared.

State of verification

This claim concerns undeclared clusters. No single verification method is foolproof for this broadest of negative claims 5, so draft agreements pair technical measures with intelligence, challenge inspections and whistleblowers 6. The only mechanism mapped primarily to this claim, remote detection of data centres, is proposed (R1), as are the chip registries and location checks that support it. The broader goal in RAND's verification framework also covers undeclared use of declared clusters, which reduces to claims such as idle declared hardware and inference, not training 1.

Primary

Full record →Mechanisms & implementations →

The declared evaluation was run

Positive claim · Mechanisms & implementations: 5 primary, 4 supporting

The reported test result comes from running the agreed evaluation procedure on the specified model and test data.

State of verification

Evaluation integrity means that the declared model, test data and procedure produced the reported result. Attestable Audits describes that binding explicitly 1. PAL*M includes evaluation among its attested operations 2. Cove chains reviewed, attested workflow stages, each certifying its inputs and outputs 3. These checks depend on the measured software and the hardware attestation roots. PySyft's double-blind pilot adds practical evidence for confidential evaluation, with participant-accepted opaque code and cloud verification assumptions 4. An accepted result still needs an interpretation of what the evaluation measures. A later deployment needs its own link to the evaluated model.

Primary

Draft record →Mechanisms & implementations →

Search

Full search page