Canonical Claim Ledger
Claim Ledger
The Claim Ledger is the canonical index of DT/FDS claims.
Each claim has a claim ID, an exact statement, a status, dependencies, first public timestamp, source document, what is not claimed, and a failure or demotion condition.
The ledger is not a list of established truths. It is an auditable public record of the programme's claims, dependencies, and failure contracts.
Full ledger: The complete claim ledger with exact statements and failure conditions is maintained in the GitHub repository: CLAIM_LEDGER.md. Machine-readable versions are available in claims.csv and claims.yaml.
Core Claims
FDS-CORE-001 to FDS-CORE-006Distinction primitive, boundary inheritance, finite capacity, capacity deficit, budget exits, invariant-supported persistence.
Source: FDS-0
Finite Observer Claims
FDS-T1-001 to FDS-T1-008Finite observer projection, distinguishability budget, stock vs throughput, capacity deficit, budget-exit theorem, maintenance inequality, budget-crossing signature, bottleneck-switching kink.
Source: FDS-T1
Operational Trident Claims
FDS-O1-001 to FDS-O1-007Observer as finite distinction-register, measurement as stable record formation, dynamic bottlenecks, budget-crossing exits, buffering, housekeeping heat, active inference interface.
Source: FDS-O1
Register Time Claims
FDS-O2-001 to FDS-O2-007Register time as ordered finite-record update, causal dependency before labels, non-injective arrow, synchronization bottleneck, latency order inversion, clock precision, dissipative projection.
Source: FDS-O2
Capacity Overflow / Effective Stochasticity Claims
FDS-T3-001 to FDS-T3-008Capacity overflow, projection-induced effective stochasticity, critical deficit and predictive susceptibility, Phase-B invariants, informational hysteresis, observer-relative stochasticity, wrong invariant completion, capacity externalization.
Source: FDS-T3
Physical Distinction Carrier Claims
FDS-P1-001 to FDS-P1-008Carrier criterion, readout reliability and generalized distinguishability, accounting boundary determines erasure, residual irreversibility, projection is not heat, refresh vs erasure cost, reversible logging delays erasure, time-resolution requires turnover.
Source: FDS-P1
Bounded-Memory Reversible Computation Claims
FDS-P2-001 to FDS-P2-006Reversible embedding delays accounting, garbage entropy rate, uncomputation vs cleanup, cleanup scheduling tradeoff, active forgetting can be optimal, externalization shifts accounting boundary.
Source: FDS-P2
Active Pruning Claims
FDS-L1-001 to FDS-L1-006Residue-pruning-boundary loop, pruning threshold, maintenance-attractor loss, rescue-window closure, spatial clogging, radius-dependent pruning demand.
Source: FDS-L1
Reportable Access Claims
FDS-C1-001 to FDS-C1-004Reportability as finite-capacity maintenance, representational residue, cognitive pruning threshold, access-network collapse.
Source: FDS-C1
Registry Governance Claims
FDS-LC0-001 to FDS-LC0-002Registry structure, downstream failure propagation rule.
Source: FDS-LC0
High-Risk Bridge Claims
FDS-X1-001 to FDS-X1-004Horizon as distinguishability boundary, maintenance energy scale, non-phantom dark energy, falsification contract.
Source: FDS-X1
Boundary-Risk / Prospect Theory Claims
FDS-E1-001 to FDS-E1-004Loss aversion as boundary-risk asymmetry, reference dependence as finite updating, probability weighting as finite precision allocation, nudge bandwidth and buffer-first principle.
Source: FDS-E1
Self-Organization Bridge Claims
FDS-N1-001 to FDS-N1-008Active self-organization requires boundary-relevant update, task-relative organizational capacity, deficit-driven load pressure, bounded growth exit theorem, resource-gated pruning window, externalization burden shift and clogging, Phase-C catastrophic feedback, Phase-B invariant bias.
Source: FDS-N1
Deficit-Driven Entropy-Production Ledger Claims
FDS-P5-001 to FDS-P5-008Capacity deficit is not thermodynamic entropy, sustained deficit requires correction or exit, correction cycles induce audit channels, Landauer floor under bridge assumptions, housekeeping persists beyond erasure, externalization shifts the ledger, pruning and invariant compression reduce future pressure, deficit crossing predicts measurable signatures.
Source: FDS-P5
Boundary-Maintenance / Operational Second-Law Channel Claims
FDS-O3-001 to FDS-O3-008Finite memory creates record-reuse pressure, non-injective reuse creates residual irreversibility, physical reuse enters an entropy ledger, stable records require housekeeping beyond erasure, externalization shifts the operational Second-Law channel, pruning and invariant compression reduce future pressure, sustained turnover with fixed tolerance and zero cost cannot persist, topological persistence redirects entropy accounting.
Source: FDS-O3
Agency-Semantics Spine Claims
FDS-M0-001 to FDS-M0-008Attention as capacity-limited distinction admission, value as causal boundary-gradient relevance, goals as stabilized value rankings, meaning as actionable semantic quotient, strong agency requires causal effect on boundary loss, self-verifying agency requires internal verification, misalignment as action-effect divergence, culture as shared externalized distinction infrastructure.
Source: FDS-M0
Attention / Distinction Admission Claims
FDS-M1-001 to FDS-M1-009Attention as capacity-limited distinction admission, salience-value dissociation, boundary-efficient allocation, constrained optimization model, deficit-induced tunnel vision, artificial attention requires coupled architecture, collective admission, attention failure modes as admission errors, recovery hysteresis.
Source: FDS-M1
Value / Goal Claims
FDS-M2-001 to FDS-M2-009FDS-value as causal boundary-gradient relevance, predictive-causal dissociation, risk-weighted ranking, goal stability, evaluation deficit and value drift, proxy-boundary divergence, collective goal synchronization, goal hysteresis.
Source: FDS-M2
Meaning / Semantic Quotient Claims
FDS-M3-001 to FDS-M3-008FDS-meaning as actionable semantic quotient, policy-preserving compression, semantic deficit and false compression, embedding insufficiency, shared meaning synchronization, meaning recovery by quotient refinement, invariant semantic quotients.
Source: FDS-M3
Anti-Recurrence / Informational Hysteresis Claims
FDS-P4-001 to FDS-P4-007Non-injective truncation creates preimage uncertainty, Bayes-optimal recovery bound, informational hysteresis, non-lumpability and hidden-state memory, Mori-Zwanzig memory burden, externalization as inverse-information relocation, finite-memory exit theorem.
Source: FDS-P4
Topological Obstruction / Invariant Side-Ledger Claims
FDS-P7-001 to FDS-P7-006Invariant side-ledgers suppress residual uncertainty, noisy invariant recovery bound, local perturbations cannot change protected invariant, NHSE as model class, protection relocates accounting, dual-channel signature.
Source: FDS-P7
Speed-Precision-Dissipation / Throughput Claims
FDS-P6-001 to FDS-P6-007Boundary maintenance requires finite update throughput, speed and precision jointly increase burden, bottleneck internal rate, correction/verification in resource ledger, effective causal bandwidth limits, relief channels are not free exits, throughput deficit exit theorem.
Source: FDS-P6
Finite-Bath Memory / Environmental Forgetting Claims
FDS-P3-001 to FDS-P3-006Environmental side records have finite accessible recovery capacity, Markovianization as effective forgetting, memory kernels measure unresolved memory, finite-bath non-monotonicity, environmental forgetting complements P4 internal truncation, bath saturation forces collisions or loss of recoverability.
Source: FDS-P3
High-Risk CP/T Fermion Generation Claims
FDS-X2-001 to FDS-X2-006CKM CP-phase lower bound, weak-sector CP/T orientation bridge, weak charged current as identity-transformation carrier, NCKM≥3 conditional theorem, exactly three generations as minimality bridge, nonzero leptonic Dirac CP phase extension.
Source: FDS-X2
Functional Decomposition / Four-Interaction Closure Claims
FDS-X3-001 to FDS-X3-008Token stabilization requirement, strong interaction as encapsulation, remote detectability requirement, electromagnetism as connection, identity transformation requirement, weak interaction as identity transformation, gravity as global boundary accounting, minimal distinction-operation closure.
Source: FDS-X3
Pauli Exclusion / Finite Address Protection Claims
FDS-X4-001 to FDS-X4-008Nilpotent fermionic algebra, Pauli exclusion as address protection, forced structural diversity, matter stability from antisymmetry, bosons not a violation, minimal address-protection rule p=1, degeneracy pressure as macroscopic address protection, address scarcity from causal reachability.
Source: FDS-X4
Mathematical Form / Invariant Compression Claims
FDS-X5-001 to FDS-X5-008Finite systems cannot represent all detail, stable law-like regularities require invariant compression, equations as compressed invariant relations, symmetries reduce rule-maintenance cost, Wigner puzzle reframed, constants as model-class signatures, open math problems as possible compression analogues, RG fixed points as invariant compression.
Source: FDS-X5
Frozen AI Conceptual Claims
FDS-A1-001 to FDS-A1-002AI agency criterion, AI public line frozen due to commercial scope.
Source: FDS-A1