Earned Claims Matrix

Status snapshot: June 2026 technical posture.

This page is a compact status table for CCT's current pre-hardware spine. It separates accepted narrow theorem language, formal-review-ready theorem objects, route surfaces, public-safe method artifacts, protected bench planning, and speculative horizon work.

Read it as a claim-class map. Each row states what the current artifact supports, which assumptions carry the claim, and what gate would promote the claim into a stronger class.

Current Matrix

Object Reader-facing name Current claim class What it supports Promotion boundary / next gate
OP1 algebraic RFH Regime-local measurement-scaling envelope Accepted narrow theorem language A finite-grid or certified-window structural R=A+D certificate implies the declared pairwise RFH slope bound under monotone nonnegative disturbance and an all-pair A envelope. Real statistical/metrology experiments enter through Bridge V1 or later coverage objects.
OP1 Bridge V1 Scalar classical Fisher-certificate bridge Machine-auditable route companion implemented A scalar classical iid/effective-iid finite-grid Fisher certificate supplies the OP1 A+D object when risk, estimator policy, denominator, J_eff, q, and D are frozen and certified in the narrow V1a scope; the public checker also keeps the V1b direct all-pair R replacement route separate. Coverage, QFI, nuisance, dependence, and empirical metrology claims remain separate gates.
OP2 Observation-to-control exact tau-grid route Narrow V1 method language Declared randomized live-vs-holdout records can support exact conditional finite-grid tau confidence-set language under a sharp common-shift null and fixed assignment manifest. Command-effect attribution and normalized resource-ratio claims move through separate theorem routes.
BT6 Basin/path-measure finite-support KL route Narrow V1 method language Fixed finite-support terminal/coarse path-measure records can carry KL concentration/perturbation language under support floors, fixed maps, reviewed perturbation modulus, and simultaneous-event accounting. Dependent samples, diffusion/continuous-time, denominator-ratio, and branch-specific basin interpretation remain separate promotions.
Vector OP4 Multi-resource finite resource-front accounting Accepted finite/discrete V1 theorem language Gate-passing pure strategies with positive task scores, positive resource costs, frozen policies, and finite axes produce support/win regions and finite-front no-collapse checks. Continuous fronts, randomized mixtures, stronger resource-theory claims, hardware, and architecture interpretation require later objects.
BT7b Passive aperture / operator-norm amplitude bound Accepted finite-dimensional theorem language Fixed aperture, incident field, target functional, response operator, norm, and perturbation budget give an exact-linear-response amplitude/operator-norm bound. Born-linearized Helmholtz / Green-function physical instantiation and intensity/routed-power language are separate gates.
OP0a Scalar multiwell anti-uniqueness Scalar theorem-readiness / formal-review path One-dimensional multiwell constructions show hierarchy-like basin counts and local curvature matches are expressivity objects, not specificity by themselves. Accepted scalar theorem text follows formal proof review; high-dimensional R^m remains behind relative Morse / handle-construction lemmas.
OP0b QFT-data specificity-filter scaffold Scaffold-review-cleared route surface Phi(C,[x_*]) -> QFTData is routed through source-object completeness, equivalence invariance, field-status discipline, null/incumbent closure, compression, and holdout checks. Non-synthetic QFTData claims require QFT/representation specialist objects and review.
OP3 Command-attribution / no-super-observer route Formal-review-ready proof route Memoryless and history-conditioned command-attribution claims are routed through state/history sufficiency, hidden-channel handling, joint interface capacity, denominator scope, and task-functional gates. Formal information-theory / causal-inference review of the V1 theorem object.
Gate 2 material-control lane Protected coupon/bench planning path Protected planning and protocol-scaffold class Gate 1 burden and Gate 2 planning have frozen the burden surface: composite topology-retention, orthogonal readouts, artifact/null closures, variability stress, and S1/S2 accounting. Populate controlled private annexes and obtain final materials/metrology sign-off before coupon fabrication or bench execution.
Tau-X H2B-C2 Broad-group support-reducer route surface Mission-ledger route surface Synthetic broad-group support-reducer fixtures persist through heldout-payload, support-group, scenario-cap, equal-access incumbent, negative-control, and trigger-gate guards. C3 evidence-bearing heldout witness before any real support-reducer primitive or TX-EA-3 consideration.
Public replication surface Public-safe route-verification infrastructure Rerunnable method-artifact layer The public package exposes theorem verifiers, schemas, route runners, synthetic capsules, ledgers, nulls, and packet controls for external inspection. Claim-specific promotion follows specialist review, protocol execution, or physical exposure rather than schema existence alone.

How To Use This Matrix

Use the matrix before assigning a global confidence label. It keeps each artifact in the evidence class it has earned:

  • accepted narrow theorem language;
  • formal specialist-review-ready proof draft;
  • route surface;
  • synthetic method artifact;
  • protected bench-planning artifact;
  • mission-ledger object;
  • future theorem or physical-exposure gate.

The same route labels used in the public package remain live: baseline_wins, artifact_closure, holdout_failed, defer, no_go, and narrow persistence routes. Those labels are part of the technical discipline, not side commentary.

For detail, continue to Open Theorem And Observer-Conditioned Roadmap, Public Replication And Review Surface, and CCT Review Protocol.