Distinction Theory

Failure Registry

How DT/FDS Can Fail

The programme is organized so that claims can fail locally. A failed physical bridge does not automatically invalidate the formal core. A failed domain mapping does not survive by reinterpretation.

Core rule: Failure propagates downstream, not automatically upstream. A failed physical bridge claim does not falsify the formal FDS core.

Representative hard tests

1. AI agency update ablation: If update ablation does not affect future boundary-maintenance loss, the AI agency criterion fails.
2. Landauer bridge violation: If reliable irreversible erasure below the thermodynamic floor is demonstrated under stated conditions, the Landauer physical bridge is demoted.
3. Two-kink physical signature: If both predicted kinks are absent under validated experimental conditions, the P3 module is killed.
ModuleTypeFailure Condition
FDS CoreFormalMathematical counterexample to stated theorem under stated hypotheses.
Capacity DeficitFormal/InformationFinite bounded system maintains complete lossless task model of incompressible environment.
Landauer BridgePhysical bridgeLogically irreversible erasure below thermodynamic floor under stated conditions.
AI AgencyOperationalUpdate ablation does not affect future boundary-maintenance loss.
Prune/Externalize/CollapseFinite-system dynamicsPersistent capacity deficit produces none of the predicted responses.
Observer as RegisterPhysical/operational bridgePhysical measurement requires no finite record stabilization.
Time as Irreversible UpdatePhysical/operational bridgeFinite record updates are invertible under bounded memory without loss.
Two-Kink SignatureHigh-risk physical bridgeBoth predicted kinks absent under validated experimental conditions.
T3: Capacity OverflowPhysical bridgePredictive error and transition entropy show no response, kink, or susceptibility peak as demand crosses accessible capacity under controlled conditions.
E1: Prospect Theory BridgeDomain bridgeLoss aversion λ invariant across resource stress, physiological depletion, downside protection, and financial precarity after adequate power and controls.
P1: Physical Distinction CarriersPhysical bridgeAbstract many-to-one map alone, without physical reset, overwrite, compression, garbage collection, or substrate implementation, shown to dissipate heat.
P2: Bounded-Memory Reversible ComputationPhysical bridgeBounded-memory reversible system sustains unbounded updates indefinitely without memory growth, externalization, cleanup, compression, or failure.
Dark Energy BridgeFrontier Physical ConsequencesObservations force exact Lambda behavior under stated test.
N1Complex-systems bridgeActive self-organization claims fail if update ablation has no effect on future boundary-maintenance loss, if bounded systems sustain unbounded maintained load under finite resources without exit channels, or if pruning/externalization/collapse/invariant-selection signatures systematically fail under the stated conditions.
P5Physical bridgeSustained positive capacity deficit produces no measurable change in heat, resource use, latency, resets, error floor, externalization, pruning, or failure risk under controlled deficit-crossing conditions.
O3Operational / physical bridgeFinite-memory systems sustain residual record turnover at fixed boundary tolerance with no coupled entropy/resource ledger cost and no exit channel, or physically irreversible record reuse systematically avoids erasure, refresh, repair, synchronization, externalization, recovery, and resource costs under the stated bridge assumptions.
P4Physical bridgeNon-injective truncation preserves enough information to distinguish all preimages; exact preimage recovery succeeds after capacity restoration with no side records, enlarged boundary, external trace, or hidden convention; non-lumpable projection closes exactly on Z_t alone without hidden state; eliminated variables never reappear as memory, noise, or closure error when lumpability fails.
P7Physical bridgeInvariant fails to suppress residual H(V|Z,Q_inv) under valid mapping; local perturbation erases protected sector while protection gap, locality assumptions, and accounting boundary remain intact; NHSE carries no stable recoverable distinction or boundary-sensitive protection; protected phase shows no dual forgetting/ledger signature under a well-powered registered protocol.
P8Physical bridgeResidue channels have no measurable effect on observable dynamics under valid finite-system mapping; memory-kernel closure fails at declared tolerance; qualification hierarchy does not predict dynamical recovery; marginal-mode obstruction is absent in generic finite systems; Hankel significance does not correlate with residue recovery error in controlled tests.
P6Physical bridgeA finite physically realized system maintains arbitrarily fast and arbitrarily precise boundary tasks at fixed capacity and fixed resource input with no increase in resource ledger, error, latency, externalization, invariant compression, task relaxation, or hidden accounting-boundary expansion.
P3Physical bridgeA finite accessible environment preserves arbitrarily many side records indefinitely with no cost, no degradation, no collision, no latency, and no boundary expansion; a Markovianization claim is weakened if accessible history continues to improve task prediction under the same variables and accounting boundary; measured finite-bath recurrence or backflow is present but the model assumes monotone decay.
X2Frontier Physical ConsequencesA CKM-like two-generation weak sector is shown to possess a physical irreducible CP phase; the audited weak-sector identity-changing channel is fully realized without any CP/T orientation or compensating orientation variable; the relevant identity-transformation carrier is not the CKM charged-current sector; CPT assumptions fail in the relevant theory; a fourth sequential chiral generation with Standard Model gauge quantum numbers and weak charged-current participation is discovered; an N>3 flavor architecture reduces the relevant cost functional.
X3Frontier Physical ConsequencesStable physical tokens exist without any encapsulation/protection operation; complex structure and observation exist without connection/detectability; identity-sector transitions exist without transformation/update; global causal geometry / stress-energy accounting is irrelevant to physical distinction maintenance; a fundamental interaction is found that implements a necessary operation class not reducible to encapsulation, connection, identity transformation, or global boundary accounting.
X4Physical bridge / minimality bridgeIdentical Standard Model fermions are observed occupying the same complete quantum state; ordinary stable matter is shown not to require fermionic exclusion or an equivalent address-protection mechanism; ordinary 3+1-dimensional Standard Model fermions exhibit generalized occupancy p>1.
X5Invariant-form compression bridgeStable physical laws are found that cannot be represented by any invariant, equivariant, covariant, compressed relation, stable quotient, symmetry, operator, or sufficient statistic; finite systems maintain law-like prediction without reducing raw microstate complexity; physical regularities persist across perturbations while lacking any form-stable structure.
T2Horizon-ledger bridgeHorizon entropy is not related to boundary area for the stated horizon class; local horizon temperature fails in the required domain; Clausius-style horizon thermodynamics fails as an effective equation-of-state model; stress-energy flux cannot be related to causal-boundary area change even approximately; geometry has no operational relation to causal access or boundary entropy; non-equilibrium corrections cannot be represented as ledger residuals.
T3Capacity overflow and effective stochasticity bridgeTask demand vs accessible capacity mismatch has no measurable dynamical effect; non-injective projection never produces effective stochasticity in controlled finite systems; no critical-deficit signature appears at capacity crossing in any task regime; Phase-B variables show no selection bias toward low update cost or slow information decay; capacity recovery always restores all distinctions without side records; stochastic descriptions are never capacity-relative in any operational context; long-context drift has no relation to invariant mismatch or capacity overflow in controlled finite-window systems.
T4Macroscopic state and law selection bridgePreparation and forced-history residue are indistinguishable for closure quality; four-way residue treatment taxonomy fails in controlled test cases; localization before persistent isolation produces equal or better closure without divergence; state firewall categories have no measurable distinction under closure mapping; exact closure exists with fewer degrees than the persistent-block McMillan degree; promotion rank anti-correlates with window length or tolerance; temporal-localization remainder systematically exceeds declared bounds; stability firewall never prevents spurious unstable modes from constitutive series; Pareto frontier has no correlation with actual closure maintainability or cost tradeoffs.
Q1Finite record-boundary bridgeOperational outcomes are available without any finite record carrier; observers with disjoint accessible record boundaries must nevertheless assign identical operational facts; Wigner-friend contradictions persist after all record-boundary assumptions are explicitly separated; stable objective facts arise without redundancy, accessibility, or stable records; decoherence-like environmental leakage occurs while finite observers track all environmental phase distinctions without capacity cost; boundary mismatch entropy has no relation to observer agreement in controlled record-sharing experiments.
Q2Finite-maintenance audit bridgeA large-scale architecture demonstrates sustained logical-error suppression while all correction, reset, cooling, routing, latency, and entropy-export ledgers remain bounded within the stated resources and no relocation, passive-protection, or task-restriction account is needed; irreversible reset, overwrite, or garbage disposal is reliably implemented below the Landauer floor under the bridge assumptions; for a fixed useful computational task family with growing logical volume, logical error is suppressed below target while all relevant maintenance components remain bounded without relocation or passive protection; topological or passive protection eliminates not merely reduces active maintenance, preparation, readout, and finite-temperature costs; or the finite-maintenance ledger has no predictive relation to hardware scaling.
B0Biomedical bridge registryA B-series claim is used for clinical diagnosis, treatment recommendation, prognosis, patient stratification, clinical decision support, or regulatory purpose without independent biomedical validation and appropriate regulatory clearance; FDS biomedical language is used to override or replace established biomedical mechanisms; maintenance debt or other FDS concepts are treated as clinical biomarkers or diagnostic criteria before external validation; or B-series failure is misinterpreted as falsifying the FDS formal core.
H1Finite causal-screen holography bridgeFinite boundary recovery cannot be formulated as a screen-capacity and recovery-net problem without losing operational meaning; recovery consistency cannot be captured by loop holonomy, gluing obstruction, or finite overlap consistency in controlled finite models; finite recovery error bounds cannot be established under Lipschitz or non-expansive transition maps; recovery error is entirely determined by local marginal boundary entropy in all controlled finite models; or the nerve-graph and tolerance formalism is shown to be mathematically inconsistent.
Q0Finite boundary-access holonomy bridgeZero record holonomy does not induce a well-defined reversible quotient in any controlled finite-access model; stable record accessibility has no independent predictive role for recovery after ordinary overlap and noise metrics are controlled; directed leakage holonomy has no independent predictive value for QEC logical failure after matched-fidelity and matched-syndrome controls; boundary-access holonomy is shown to be a redundant concept; or the restricted quotient-consistency theorem is shown to be mathematically inconsistent.
H2Recoverable-support bridge architectureRaw descent, quotient descent, and liftability are not distinct; the Kato connection depends on unregistered ambient choices; the physical quotient is irregular without an admissible replacement; the covector-branch Stokes or closed-cycle tests fail at declared tolerance; the bundle-branch holonomy-intertwiner criterion fails on held-out loops; holonomy-relative and character-based visibility levels are conflated; or the architecture implicitly derives G1/GR/M3/4.