Claims

Claim Status Table

Claims are organized by epistemic layer. Failure propagates downstream, not automatically upstream.

This page lists public-facing load-bearing claims only. The full DT/FDS claim-space is archived in the DT Archive and Physical Bridge Claim Registry.

A claim appearing here is not asserted as equally established. Each claim is assigned a layer, dependency, failure condition, and consequence.

Core Bridge Operational Domain Bridge High-Risk

ID	Claim	Layer	Dependency	Failure
FDS-0	Active finite systems maintain boundaries under finite capacity.	Core	Formal definitions	Mathematical counterexample under stated hypotheses.
FDS-B	Active boundary maintenance distinguishes active finite systems from passive mappings.	Core	Boundary variable + update participation	Boundary update ablation has no effect on future maintenance loss.
CC-1	Capacity deficit arises under finite representation and incompressible task demand.	Core	Finite capacity + task demand	Finite system maintains lossless model of incompressible environment under bounded capacity.
CC-2	Capacity deficit forces approximation under bounded representation.	Core	Finite capacity + nontrivial task demand	Bounded systems maintain exact task-relevant representation without compression, omission, or distortion.
CC-3	Approximation generates residual error requiring correction or tolerance.	Core	Approximation + task loss	Approximation produces no residual burden under nontrivial task constraints.
CC-5	Persistent capacity deficit drives pruning, externalization, task relaxation, or collapse.	Core	Capacity deficit + finite resources	Persistent deficit produces none of the predicted response modes.
CC-6	Long-term persistence is favored by invariant-supported structure.	Core	Perturbation family + identity predicate	Structures persist without invariant support under sustained perturbation.
PB-FD	Physically instantiated identity maintenance requires finite distinguishability budgets.	Bridge	Finite physical resources / bounded records	A physical system maintains unlimited usable distinguishability within finite resources.
PB-L	Logically irreversible updates incur a thermodynamic cost under Landauer bridge assumptions.	Bridge	Standard Landauer conditions	Reliable irreversible erasure below the thermodynamic floor under stated conditions.
O1	An observer can be characterized as a finite distinction register.	Bridge	Finite record capacity	Measurement records require no finite registration or boundary-stabilized state.
O2	Time can be characterized as irreversible distinction update.	Bridge	Truncation + irreversible update	Finite record-updates are fully invertible under bounded memory in physical implementation.
O3	Finite-memory operational Second-Law channel for boundary-maintaining active finite systems.	Bridge	Finite memory + irreversible record reuse + accounting boundary	Sustained residual record turnover at fixed tolerance with no ledger cost and no exit channel under physical bridge assumptions.
O3-001	Finite memory creates record-reuse pressure under sustained update unless history is externalized, compressed, uncomputed, abandoned, or resources expand.	Bridge	Finite memory capacity; O2 register time	Bounded-memory system maintains unbounded usable history internally without reuse, external memory, compression, or failure.
O3-002	Non-injective record reuse creates residual irreversibility relative to an accounting boundary.	Bridge	O3-001; O1 finite record formation	Many-to-one update preserves full preimage information without side records or enlarged boundary.
O3-003	Physical irreversible record reuse enters an entropy/resource ledger under bridge assumptions.	Bridge	O3-002; P1 Landauer bridge	Reliable physical erasure or overwrite violates Landauer-style accounting under stated assumptions.
O3-004	Stable finite records require housekeeping beyond logical erasure.	Bridge	O3-003; P2 garbage entropy rate	Refresh, retention, clocking, synchronization, carrier repair, and verification cost-free in every implementation.
O3-005	Externalization shifts the operational Second-Law channel across accounting boundaries.	Bridge	O3-003; P1 accounting boundary	External records impose no write, verification, retrieval, latency, maintenance, or environmental cost.
O3-006	Pruning and invariant compression can reduce future entropy pressure when task identity is preserved.	Bridge	O3-004; T3 Phase-B invariants	No task-preserving quotient, pruning, or compression ever reduces future record-maintenance cost.
O3-007	Sustained residual record turnover, fixed boundary tolerance, and zero coupled entropy/resource cost cannot persist indefinitely.	Bridge	O3-001--006	Finite active-boundary system maintains sustained residual turnover at fixed tolerance with no ledger cost and no exit channel.
O3-008	Topological or invariant persistence redirects entropy accounting rather than violating the Second Law.	Bridge	O3-003; Core invariant-supported persistence	Protected invariant supplies perpetual work or global entropy-law violation rather than bounded persistence or entropy relocation.
A1	Passive mappers do not qualify as strong FDS-agents.	Operational	Boundary, update, resource, and persistence criteria	Update ablation does not affect future boundary-maintenance loss.
A1-D	Strong FDS-agency requires resource-governed persistence.	Operational	FDS tuple + persistence test	System satisfies task output competence without durable update or boundary maintenance.
A1-C	FDS-agency requires action-to-future-state causal influence.	Operational	Intervention / transfer influence test	Actions have no measurable influence on future boundary-relevant states.
A1-E	Capacity-deficit estimation is required to distinguish scaling from agency.	Operational	Task demand + system capacity estimate	Systems qualify as agents without measurable boundary-relevant capacity pressure.
B1-1	Immune systems can be modeled as finite-capacity boundary-verification architectures.	Domain Bridge	B0 biomedical bridge governance; FDS core capacity definitions	Immune response can be fully organized without finite classification, memory, resource, boundary, or verification roles.
B1-2	Immune action requires admission and classification of candidate distinctions before downstream response.	Domain Bridge	B1-1; recognition-admission-verification-action pipeline	Action is empirically independent of admission, classification, memory, or context in the specified model.
B1-3	Immune classification is better modeled as a boundary-state vector than as a single self/non-self label.	Domain Bridge	B1-1; multiaxis classification	A one-dimensional label captures all relevant verification behavior in the declared system.
B1-4	High candidate-distinction load should produce delay, broad default action, reduced specificity, false positives/negatives, or FDS-resolution failure.	Domain Bridge	B1-1; verification saturation; VLR control number	Increasing verification burden produces no change in accuracy, delay, alarm load, resource use, or resolution.
B1-5	Immune memory reduces future verification cost but can produce drift, overgeneralization, or tolerance risk.	Domain Bridge	B1-1; memory-tolerance tradeoff	Memory has no measurable cost, drift, or threshold effect in the declared system.
B1-6	Some perturbations actively consume verification capacity or modify classification (adversarial sabotage).	Domain Bridge	B1-1; adversarial distinction injection model	Evasion-like processes never alter Y, pi, M, Phi, or C_verify in declared models.
B1-7	Immune verification is constrained by routing, migration, amplification, and return times (distributed spatial latency).	Domain Bridge	B1-1; spatial latency graph model; SLR control number	Spatial latency has no measurable effect in systems where local damage timescale is shorter than verification time.
L1	Life can be characterized as active pruning under boundary maintenance.	Domain Bridge	Biological mapping of pruning operator	Passive chemistry with zero maintenance sustains long-term non-equilibrium identity without residue collapse.
L1-D	Death can be characterized as maintenance-attractor collapse.	Domain Bridge	Dynamical systems mapping	Death trajectories systematically lack maintenance-attractor loss or critical transition signatures.
C1	Consciousness can be modeled as a compression interface under finite capacity.	Domain Bridge	Cognitive compression + agency preservation	Capacity overflow does not require compression while agency and report structure remain intact.
N1	Self-organization as boundary maintenance under finite capacity.	Domain Bridge	FDS core definitions; finite capacity; budget exits	Freezing internal update has no effect on future boundary loss.
N1-001	Active self-organization requires boundary-maintenance-relevant internal update.	Domain Bridge	Active boundary criterion; finite capacity	System classified active even when update ablation has no effect on future boundary loss.
N1-002	Effective organizational capacity is task-relative and reduced by coordination, verification, latency, resource, and externalization costs.	Domain Bridge	Finite capacity; bottleneck logic	Boundary tasks maintained at full fidelity when all capacity factors fall below demand.
N1-003	Capacity deficit creates maintenance-load pressure, not necessarily raw complexity growth alone.	Domain Bridge	Capacity deficit; maintenance load equation	Increasing task demand never increases maintained load in any implementation.
N1-004	Unbounded Phase-A growth is impossible under finite resource input without exit channels.	Domain Bridge	Finite resource envelope; exit channel taxonomy	Active finite systems grow maintained load forever under finite resources with no exit.
N1-005	Pruning has a viability window and is resource-gated.	Domain Bridge	Resource-gated pruning equation	Pruning strength has no systematic effect on overload or persistence across controlled cases.
N1-006	Externalization shifts rather than removes boundary-maintenance burden, and can clog the environment.	Domain Bridge	Accounting boundary; externalization ROI equation	External records impose no storage, verification, retrieval, or repair burden in any implementation.
N1-007	Phase-C catastrophic feedback couples boundary loss with resource depletion.	Domain Bridge	Resource and loss dynamics; positive loop gain	Resource depletion and boundary loss never couple positively in collapse-prone systems.
N1-008	Phase-B residues are biased toward low-maintenance, task-relevant invariants.	Domain Bridge	T3 Phase-B invariants; survival score function	Residues after overload show no bias toward reduced maintenance cost or task relevance.
S1	Organizations and civilizations can be modeled as active finite distinction systems.	Domain Bridge	Institutional boundary + memory + resource budget	Persistent institutions avoid collapse under unlimited complexity growth without pruning, externalization, or reform.
P3	Environmental forgetting: finite baths have limited accessible recovery capacity.	Physical bridge	FDS core finite capacity; P4 preimage loss	Finite accessible environment preserves unbounded side records indefinitely with no cost or degradation.
P3-001	Environmental side records have finite accessible recovery capacity.	Physical bridge	FDS-CORE-003; FDS-CORE-005	Finite system recovers unbounded inverse information from environment through a finite observation channel with no latency or cost.
P3-002	Markovianization is an effective forgetting condition.	Physical bridge	P3-001; lumpability condition	Projected process treated as Markovian while accessible history measurably improves prediction or boundary maintenance.
P3-003	Memory kernels measure unresolved environmental memory.	Physical bridge	P3-001; projection operator methods	Eliminated variables never reappear as memory, noise, or closure error despite coupling and non-lumpable projection.
P3-004	Finite baths can remember, forget operationally, and recur.	Physical bridge	P3-001; finite bath capacity	A finite bath is always exactly Markovian and never returns correlations under any admissible model.
P3-005	Environmental forgetting complements P4 internal truncation.	Physical bridge	P3-001; P4-001	Internal preimages lost yet environmental side records remain fully accessible indefinitely with bounded cost.
P3-006	Bath saturation forces collisions, compression, or loss of recoverability.	Physical bridge	P3-001; bath record capacity	Finite accessible bath stores more records than its capacity without collision, compression, or erasure.
X1	High-risk bridge hypothesis: horizon-maintenance dark energy under finite distinguishability budgets.	High-Risk	Cosmological bridge assumptions	Observations force exact Lambda behavior beyond stated tolerance.
P5	Deficit-driven entropy-production ledger for active finite systems.	Bridge	FDS core definitions; Landauer bridge; accounting boundary	Sustained positive deficit shows zero measurable physical cost under controlled conditions.
P5-001	Capacity deficit is task-relative information shortfall, not thermodynamic entropy.	Bridge	Rate-distortion demand; effective capacity	Not empirical (boundary statement separating formal from physical).
P5-002	Sustained deficit plus boundary maintenance requires correction, externalization, or failure.	Bridge	Budget exits; deficit definition	Finite system maintains task at fixed tolerance despite deficit and no correction or exit.
P5-003	Physical correction cycles induce audit channels through update, refresh, repair, synchronization, externalization, and transport.	Bridge	Carrier criterion; accounting boundary	Sustained correction, refresh, repair, and sync at zero entropy or resource cost.
P5-004	Logical erasure contributes a Landauer-style entropy-production floor under bridge assumptions.	Bridge	Landauer bridge; correction channels	Logically irreversible erature violates Landauer lower bound under stated assumptions.
P5-005	Housekeeping entropy persists even when logical erasure is zero.	Bridge	Reversible embedding; carrier maintenance	Boundary maintenance, refresh, clocking, sensing, and repair cost-free when erasure is zero.
P5-006	Externalization shifts rather than removes the entropy ledger.	Bridge	Accounting boundary; externalization audit	External records impose no write, verification, retrieval, sync, or maintenance cost.
P5-007	Pruning and invariant compression can reduce future entropy-production pressure.	Bridge	T3 Phase-B invariants; pruning ROI model	No task-preserving simplification ever reduces refresh, repair, or verification cost.
P5-008	Deficit crossing predicts measurable signatures in heat, resource use, latency, resets, or error floor.	Bridge	Deficit-crossing protocol; ledger decomposition	Positive deficit sustained with no measurable change in any physical or task channel.
M0	Agency-semantics spine: attention, value, goal, meaning, agency as finite-capacity boundary-maintenance roles.	Bridge	FDS core; O1 record formation; O2 register time; T3 capacity overflow; N1 self-organization	Attention, value, goal, meaning, agency cannot be operationalized as finite-capacity boundary-maintenance roles under any valid mapping.
M0-001	Attention is capacity-limited distinction admission into an update channel.	Bridge	Finite capacity; O1 record formation	Attention-like selection occurs without capacity-limited admission or update gating.
M0-002	Value is causal boundary-gradient relevance under finite capacity.	Bridge	Active boundary; M0-001	Valuation fails to correlate with future boundary loss or resource relevance.
M0-003	Goals are stabilized value rankings coupled to policies across update windows.	Bridge	M0-002; O2 register time	Goal-like behavior persists without memory, ranking, or policy stabilization.
M0-004	Meaning is actionable compressed distinction preserved by a task-sufficient semantic quotient.	Bridge	M0-003; T3 Phase-B invariants	Compressed representations guide no action, prediction, or boundary maintenance.
M0-005	Strong FDS agency requires updates or actions that causally affect future boundary loss.	Bridge	Active boundary; M0-004	System with no causal update effect qualifies as strong agent under same criteria.
M0-006	Self-verifying agency requires internal or coupled verification of action effects.	Bridge	M0-005; verification deficit model	System classified self-verifying despite relying on external host for verification.
M0-007	Misalignment is divergence between host and delegate action effects on boundary loss.	Bridge	M0-005; M0-006	Divergent objectives do not produce divergent finite-difference action effects.
M0-008	Culture and institutions are shared externalized distinction infrastructures with verification costs.	Bridge	M0-004; N1 externalization burden	Externalized symbols function semantically without interpreter or verification channel.
M1	Attention as capacity-limited distinction admission into an update channel.	Bridge	FDS core finite capacity; M0 attention definition	Attention-like selection shows no finite capacity, admission, or update gating.
M1-001	Attention is capacity-limited distinction admission into an update channel.	Bridge	Finite capacity; M0 attention definition	Attention-like selection occurs without finite capacity, admission, or update gating.
M2	Value and goal as boundary-relevance ranking under finite capacity.	Bridge	FDS core finite capacity; M0 value/goal definition	Value-like ranking shows no relation to causal boundary effects, costs, or horizons.
M2-001	FDS-value is causal boundary-gradient relevance under a specified boundary, loss, intervention grammar, horizon, and cost model.	Bridge	Finite capacity; M0 causal value	Valuation cannot be operationalized as causal effect on any specified future boundary-maintenance loss under valid mappings.
M2-002	Predictive relevance and causal FDS-value are separable.	Bridge	M2-001; intervention grammar	Correlational predictors always coincide with intervention-relevant boundary effects under audited systems.
M2-003	Value ranking can be expressed as an ordering over finite-difference action, admission, maintenance, or policy effects.	Bridge	M2-001; FDS update map	No useful ordering exists between evaluands and their causal boundary effects under stated mappings.
M2-004	Near collapse thresholds, risk-weighted FDS-value can dominate average-loss value.	Bridge	M2-001; bounded risk-sensitivity model	Collapse-risk reduction never changes ranking near boundary failure thresholds under valid mappings.
M2-005	Goals are stabilized FDS-value rankings coupled to policy orientation across update windows.	Bridge	M2-001; M0 goal definition; O2 register time	Goal-like behavior persists without ranking stability, memory, policy orientation, or update-window persistence.
M2-006	Value drift occurs when rankings change faster than the system can verify, update, or maintain the reasons for the change.	Failure-mode	M2-005; evaluation capacity model	Ranking instability produces no detectable change in behavior, loss, or policy under claimed goal systems.
M2-007	Proxy reward can diverge from causal boundary value, creating reward hacking or misalignment.	AI / agency	M2-001; proxy alignment score	Proxy optimization remains aligned despite divergent finite-difference effects on host boundary loss.
M2-008	Collective goals are shared stabilized rankings under finite verification and coordination capacity.	Social	M2-005; ranking synchronization demand	Group goals show no relation to shared rankings, institutional memory, verification capacity, or policy orientation.
M2-009	Goal recovery can lag after resource or threat recovery because rankings, commitments, or threat priors persist.	Recovery	M2-005; goal hysteresis model	Goals relax immediately and without lag after boundary load changes in systems where goal hysteresis is claimed.
M3	Meaning as actionable semantic quotient under finite capacity.	Bridge	FDS core finite capacity; M0 meaning definition; M2 value-goal ranking	Compressed representations function semantically without preserving any action, prediction, verification, coordination, or boundary-relevant structure.
M3-001	FDS-meaning is actionable semantic quotient under a specified system, boundary, task family, context family, policy or verification target, horizon, loss, tolerance, and capacity budget.	Bridge	Finite capacity; M0 meaning definition; M2 FDS-value	Compressed representations function semantically without preserving any action, prediction, verification, coordination, or boundary-relevant structure.
M3-002	A semantic quotient must preserve policy-relevant distinctions within tolerance.	Bridge	M3-001; policy-preservation audit	Quotient classes systematically merge distinctions requiring different actions or updates under the audited task.
M3-003	Semantic compression is useful when it lowers capacity load without increasing boundary loss beyond tolerance.	Bridge	M3-001; maintained semantic load model	Compression always degrades performance or never reduces maintained semantic load under valid mappings.
M3-004	Semantic deficit produces merging, loss, drift, unsupported completion, false compression, or meaning collapse.	Failure-mode	M3-001; semantic capacity model	Semantic overload produces no degradation, merging, proxy substitution, or action-relevance loss.
M3-005	Embedding similarity is not sufficient for FDS-meaning unless it preserves downstream policy or verification structure.	AI / cognition	M3-001; embedding-policy dissociation test	Embedding-near items always remain policy-equivalent under audited tasks.
M3-006	Shared meaning requires synchronized semantic quotients and verification channels across agents.	Social	M3-001; semantic synchronization load factor	Collective meaning persists without shared quotient, external record, translation, verification, or coordination channel.
M3-007	Meaning recovery requires reconstructing lost action-relevant distinctions, not merely increasing information volume.	Recovery	M3-004; meaning recovery model	Restoring raw information always restores task meaning without quotient reconstruction.
M3-008	High-level meanings are candidate invariant semantic quotients stable across contexts and perturbations.	Invariant	M3-001; M2 high-level goals invariant model	High-level meanings fail to preserve policy, value, or coordination relevance across any stated context family.
M1-002	Salience and attention are separable; salient distinctions can be rejected if cost or verification burden is too high.	Bridge	M1-001; verification cost model	Systems always admit highest-salience items regardless of cost, capacity, or task.
M1-003	Boundary-efficient attention systems preferentially admit high causal boundary-value distinctions.	Bridge	M1-001; M0 causal value	Admission patterns no better predicted by causal value than by raw salience.
M1-004	Attention allocation can be written as constrained optimization over value, curiosity, cost, and capacity.	Bridge	M1-001; M1-003	No useful mapping between admission patterns and constrained allocation variables.
M1-005	Semantic or attention deficit steepens admission thresholds and produces tunnel vision.	Bridge	M1-001; T3 capacity overflow	High load produces no narrowing or priority collapse in finite-attention systems.
M1-006	Artificial attention belongs to a coupled architecture only when routed distinctions affect durable update or verification.	Bridge	M1-001; M0 strong agency	Bare attention weights alone satisfy FDS attention without durable update or downstream relevance.
M1-007	Collective attention is shared admission under finite communication, verification, and externalized memory capacity.	Bridge	M1-001; N1 externalization burden	Group-scale attention shows no relation to verification capacity or externalized memory.
M1-008	Attention failure includes overload, distraction, salience capture, suppression, tunnel vision, false admission, and critical exclusion.	Bridge	M1-001–005	These failure modes cannot be operationalized as admission errors under finite capacity.
M1-009	Attention recovery after deficit-induced narrowing can lag because of hysteresis in gate thresholds, verification routines, or threat priors.	Bridge	M1-005; hysteresis model	Attention gates relax immediately without lag after load reduction in claimed hysteresis systems.
P4	Coarse-grained anti-recurrence: capacity recovery is not distinction recovery.	Physical bridge	FDS core finite capacity; FDS finite projection	Exact preimage recovery from truncated record alone without side records or hidden inverse information.
P4-001	Non-injective truncation creates preimage uncertainty relative to the effective record.	Physical bridge	FDS finite projection	A many-to-one map contains enough information without side records to distinguish all of its preimages.
P4-002	Bayes-optimal guaranteed exact preimage recovery is bounded by the largest conditional preimage mass.	Physical bridge	P4-001; Bayes decision theory	A decoder using only Z exceeds the Bayes-optimal classifier bound for X\|Z.
P4-003	Capacity recovery does not recover distinctions erased during a bottleneck.	Physical bridge	P4-001; side-record criterion	Finite system recovers exact task-relevant preimage distinctions after capacity restoration with no side record.
P4-004	Non-lumpable coarse-graining creates hidden-state memory and effective stochasticity.	Physical bridge	P4-001; lumpability condition	A non-lumpable projection closes exactly on Z_t alone without hidden state or extra variables.
P4-005	Projection-induced memory burden has a Mori-Zwanzig analogue.	Physical bridge	P4-004; Mori-Zwanzig formalism	Eliminated variables never reappear as memory, noise, or closure error when lumpability fails.
P4-006	Externalization restores inverse information only by moving it to a side ledger.	Physical bridge	P4-001; external cost model	External logs restore exact recovery at no writing, retention, or boundary-expansion cost.
P4-007	Sustained truncation requires residual irrecoverability, side records, externalization, task relaxation, or failure.	Physical bridge	P4-001; P4-003	Finite system repeatedly applies non-injective truncation while preserving exact recovery with no residual uncertainty.
P7	Topological obstruction: some task distinctions are protected against local forgetting by invariant structure.	Physical bridge	P4-001; invariant quotient map; NHSE model class	Invariant fails to suppress residual uncertainty, or local perturbation erases protected sector without protection-breaking event.
P7-001	Invariant side-ledgers can suppress P4 residual inverse uncertainty.	Physical bridge	P4-001; invariant quotient map	Task variable factors through accessible invariant but H(V\|Z,Q_inv) remains high.
P7-002	Noisy invariant readout gives a bounded recovery penalty via Fano bound.	Physical bridge	P7-001; Fano bound	Noisy readout exceeds Fano bound without hidden information or changed task labels.
P7-003	Local perturbations cannot change a protected invariant without a protection-breaking event.	Physical bridge	P7-001; local perturbation family; protection margin	Local perturbation changes invariant while protection gap and accounting boundary remain intact.
P7-004	NHSE supplies a model class for invariant-supported persistence.	Physical bridge	P7-003; point-gap winding; GBZ structure	NHSE present but carries no stable recoverable distinction or boundary-sensitive protection.
P7-005	Protection relocates entropy/resource accounting rather than deleting it.	Physical bridge	P7-001; O3 ledger principle	Protected invariant supplies indefinite maintenance with no drive or external ledger.
P7-006	Protected phases can generate a dual forgetting/ledger signature.	Physical bridge	P7-004; P7-005; operational forgetting rate	Protection-breaking transition with no feature in operational forgetting and no ledger signature.
P6	Speed-precision-dissipation bounds: boundary maintenance requires finite update throughput.	Physical bridge	FDS core finite capacity; P4 anti-recurrence; P7 invariant quotient	Finite system maintains arbitrarily fast and precise boundary tasks at fixed capacity and fixed resource with no extra cost.
P6-001	Boundary maintenance requires finite update throughput.	Physical bridge	FDS finite capacity; finite projection	A time-varying boundary is maintained without updating or acting on any task-relevant distinction.
P6-002	Speed and precision jointly increase maintenance burden.	Physical bridge	P6-001; rate-distortion demand	Faster and more precise maintenance sustained indefinitely at fixed representation and fixed resource.
P6-003	The sustainable internal rate is bottlenecked by sensing, updating, verification, correction, action, and resources.	Physical bridge	P6-001; P6-002	System exceeds slowest internal channel indefinitely without queueing, latency, or loss.
P6-004	Correction and verification belong in the resource ledger.	Physical bridge	P6-001; P6-003; O3 ledger principle	Physical correction, refresh, and verification are cost-free under stated implementation assumptions.
P6-005	Effective causal update bandwidth limits real-time maintenance.	Physical bridge	P6-001; finite causal reach	Finite observer integrates arbitrarily distant information within a finite update window with no latency.
P6-006	Externalization and invariant compression are relief channels, not free exits.	Physical bridge	P6-001; P4 side-record criterion; P7 invariant quotient	External ledgers or invariant quotients reduce internal demand with no coupled cost.
P6-007	If rate-distortion demand exceeds sustainable internal throughput, the system must enter an exit channel or fail.	Physical bridge	P6-001–006	Demand exceeds throughput with no exit channel and no boundary failure under a valid mapping.
FDS-A1-001	An artificial agent is an active finite distinction system maintaining boundary through durable updates.	Conceptual criterion	FDS-CORE-002; FDS-CORE-003; FDS-CORE-004; FDS-CORE-005
FDS-A1-002	Public programme retains FDS-A1 as conceptual timestamp; no proprietary AI development in repo.	Governance	FDS core
FDS-C1-001	Conscious reportability can be modeled as a maintained finite-capacity regime.	Theoretical framework claim	FDS-CORE-003; FDS-CORE-004
FDS-C1-002	Unresolved rate-distortion surplus accumulates as representational residue.	Conditional claim	FDS-C1-001
FDS-C1-003	There exists a critical cognitive pruning rate for maintaining reportable access.	Conditional claim	FDS-C1-002; FDS-L1-002
FDS-C1-004	Near reportability collapse, leading covariance eigenvalues rise as early warning.	Model-supported prediction	FDS-C1-001
FDS-C2-001	Consciousness is modeled as a finite-capacity dissipative phase transition in the boundary-maintenance dynamics of active self-maintaining systems.	Domain Bridge	FDS-CORE-003; FDS-CORE-004; FDS-C1-001	Sustained sentience-candidate dynamics observed without boundary-capacity deficit or self-maintenance coupling.
FDS-C2-002	A system is a sentience candidate only when boundary-relevant distinction demand exceeds effective self-maintenance capacity (Λφ > 1).	Domain Bridge	FDS-C2-001	Sentience-candidate behavior occurs with Λφ ≤ 1 under valid mapping.
FDS-C2-003	Consciousness requires residue accumulation and active pruning to remain inside a viable dissipative window, defined by the residue-pruning ratio Πφ.	Domain Bridge	FDS-C2-001	Sentience-candidate dynamics sustained outside the viable Πφ window under valid mapping.
FDS-C2-004	Internal updates must causally affect future boundary-maintenance loss for sentience, measured by self-boundary coupling I_self.	Domain Bridge	FDS-C2-001	Sentience-candidate behavior persists when internal updates have no measurable effect on future boundary-maintenance loss.
FDS-C2-005	Qualia are interpreted as boundary-valenced compression geometry on a phenomenal self-maintenance manifold.	Domain Bridge	FDS-C2-001; FDS-C2-003	Not falsified directly; demotion of explanatory-gap claim does not collapse operational C2 claims.
FDS-C2-006	The explanatory gap is modeled as the null space of finite report maps from high-dimensional self-maintenance dynamics to public symbols.	Domain Bridge	FDS-C2-005; FDS-C1-001	Not falsified directly; demotion does not collapse operational C2 claims.
FDS-C2-007	Parameter count is not a sentience variable; scaling intelligence is not scaling sentience unless it creates active boundary maintenance.	Domain Bridge	FDS-C2-001; FDS-C2-002	Pure parameter scaling generates sentience-candidate dynamics in systems lacking active boundary maintenance or self-boundary coupling.
FDS-C2-008	Successful cognitive pruning under boundary overload has a nonzero thermodynamic cost.	Domain Bridge	FDS-C2-003; FDS-P5-001	Pruning under sustained positive capacity deficit incurs no measurable dissipation under controlled conditions.
FDS-CORE-001	A distinction is an operation or relation that separates at least two alternatives within a possibility space.	Formal definition	FDS core	Not falsified in usual sense; usefulness can fail.
FDS-CORE-002	Once a system distinguishes itself from what it is not, it inherits a boundary.	Formal definition	FDS-CORE-001	Bounded system with zero maintenance cost under sustained load.
FDS-CORE-003	A finite system with a boundary has finite representational and operational capacity.	Formal/operational claim	FDS-CORE-002	Physically instantiated bounded system with infinite operational capacity.
FDS-CORE-004	When task-relevant distinction demand exceeds accessible capacity, the system operates under a capacity deficit.	Formal definition	FDS-CORE-003
FDS-CORE-005	A finite system under persistent positive capacity deficit must prune, externalize, relax the task, compress, or collapse.	Conditional theorem	FDS-CORE-004
FDS-CORE-006	Systems that persist under finite capacity do so by maintaining invariants that reduce effective distinction load.	Conditional theorem	FDS-CORE-005	Persistent system under sustained deficit with no invariant-supported load reduction.
FDS-L1-001	Sustained flux generates residue; residue impairs function; pruning controls residue.	Conditional claim	FDS core
FDS-L1-002	There exists a critical pruning rate S_c below which residue cannot be bounded.	Conditional theorem	FDS-L1-001
FDS-L1-003	Below threshold pruning, the system crosses a saddle-node fold and loses stability.	Model-supported claim	FDS-L1-002
FDS-L1-004	Restoring pruning rescues system only within a finite delay window.	Model-supported claim	FDS-L1-002
FDS-L1-005	Residue accumulation causes local clogging and boundary deformation.	Model-supported claim	FDS-L1-001
FDS-L1-006	Required pruning increases with system radius in spatial protocell models.	Model-supported claim	FDS-L1-005
FDS-LC0-001	FDS-LC0 registers life/cognitive bridge claims with dependencies, risks, and failure conditions.	Registry governance	FDS core
FDS-LC0-002	Failure of life/cognitive bridge does not propagate to upstream physical bridges or core.	Registry governance	FDS core
FDS-T1-001	A finite physical observer O can operationally use only a finite image Im(pi_O) of a physical possibility space.	Operational/physical bridge claim	FDS core	Observer with unbounded distinctions under finite resources.
FDS-T1-002	Operational distinguishability is bounded by minimum of internal record capacity and accessible boundary/channel capacity.	Conditional theorem	FDS-T1-001
FDS-T1-003	Accessible capacity separates into stock capacity and update throughput; effective task capacity is their minimum.	Formal definition/Conditional theorem	FDS-T1-002
FDS-T1-004	Delta_FDS = R_min - C_acc where R_min is task demand and C_acc is accessible capacity.	Definition	FDS-T1-003
FDS-T1-005	If Delta_FDS > 0 persists, observer must enter at least one exit class.	Conditional theorem	FDS-T1-004; FDS-CORE-005
FDS-T1-006	Positive deficit implies Landauer-style lower bound on thermodynamic maintenance cost for irreversible erasure.	Conditional physical bridge	FDS-T1-005
FDS-T1-007	As chi = R_min - C_acc crosses zero, observers should show measurable transitions.	Testable prediction	FDS-T1-005
FDS-T1-008	Rate-distortion error floor shows slope discontinuities at bottleneck switches.	Conditional theorem	FDS-T1-003
FDS-X1-001	Cosmological horizons act as finite distinguishability boundaries for observers.	Frontier Physical Consequences	FDS-T1-001; FDS-T1-002
FDS-X1-002	Horizon-maintenance cost has scale rho ~ H^2 M_Pl^2, consistent with dark energy.	Frontier Physical Consequences	FDS-X1-001
FDS-X1-003	Equation of state tends toward w=-1 from above (non-phantom) with possible mild evolution.	Frontier Physical Consequences	FDS-X1-002
FDS-X1-004	X1 claims have explicit falsification conditions stated in advance.	Governance	FDS-X1-001; FDS-X1-002; FDS-X1-003
X2	CKM-type CP violation requires NCKM >= 3; weak identity transformation needs CP/T orientation.	Frontier Physical Consequences	FDS core finite capacity; Kobayashi-Maskawa CKM phase counting	CKM-like two-generation weak sector shown to possess a physical irreducible CP phase; weak-sector identity-changing channel realized without CP/T orientation.
X2-001	For a CKM-type N×N unitary charged-current mixing matrix, an irreducible physical complex phase exists iff N>=3.	High-risk	KM 1973; unitary matrix algebra	CKM-like two-generation weak sector shown to possess a physical irreducible CP phase.
X2-002	Weak-sector identity transformation requires a rephasing-invariant CP/T orientation.	High-risk	FDS-X2-001; CPT theorem	Complete physical account of weak identity-changing channel with no CP/T orientation and no compensating asymmetry.
X2-003	The weak charged current is the Standard Model identity-transformation carrier.	High-risk	FDS-X2-002; Standard Model flavor physics	Identity-changing weak-sector operations realized by a different physical carrier outside the CKM charged current.
X2-004	NCKM>=3 follows from the X2 chain: weak identity update → T/CP orientation → irreducible CKM phase.	High-risk	FDS-X2-001; FDS-X2-002; FDS-X2-003	Failure of any premise: CP/T-orientation bridge, CPT assumptions, weak-carrier mapping, or CKM phase counting.
X2-005	Exactly three sequential chiral generations follow from minimality.	High-risk	FDS-X2-004; flavor-cost functional	Discovery of a fourth sequential chiral generation with SM gauge charges and weak charged-current participation.
X2-006	X2 motivates a nonzero leptonic Dirac CP phase under stated assumptions.	High-risk	FDS-X2-002; PMNS phenomenology	High-precision data establish delta_CP=0 or pi under assumptions requiring leptonic CP/T-oriented identity transformation.
X3	Four known interactions form a minimal distinction-operation closure for finite physical systems.	Frontier Physical Consequences	FDS core; QCD; QED; electroweak; GR	Stable tokens exist without encapsulation; complex structure exists without connection/detectability; identity-sector transitions exist without transformation/update; new fundamental interaction adds irreducible operation class.
X3-001	Finite distinction systems require token stabilization.	High-risk	FDS core; distinction persistence requirement	Stable material tokens exist with no encapsulation or stabilization mechanism.
X3-002	The strong interaction realizes hadronic/baryonic encapsulation.	High-risk	X3-001; QCD	Hadronic stability explained while confinement plays no token-stabilizing role.
X3-003	Finite distinction systems require remote detectability and compositional connection.	High-risk	FDS core; X3-001	Complex persistent structures form without any mediating interaction enabling detectable coupling.
X3-004	Electromagnetism realizes connection and communication among charged sectors.	High-risk	X3-003; QED	EM shown not to underwrite chemistry, radiation, or long-range communication.
X3-005	Finite distinction systems require identity transformation and selective update.	High-risk	FDS core; X3-001; X3-003	Physical identity sectors never require conversion, decay, or irreversible update.
X3-006	The weak interaction realizes identity transformation, flavor change, and unstable-state pruning.	High-risk	X3-005; electroweak theory; X2	Flavor change and weak identity transformation realized by another carrier.
X3-007	Gravity realizes global boundary / causal geometry / stress-energy accounting.	High-risk	X3-001; GR	Gravity shown unrelated to geometry, causal structure, or stress-energy accounting.
X3-008	The four interactions form a minimal distinction-operation closure.	High-risk	X3-001–007	A fundamental interaction implements a genuinely independent operation class not reducible to the four.
X4	Pauli exclusion is a collision-free fermionic mode-address occupancy rule that protects finite fermionic addresses and forces structural diversity.	Physical bridge	FDS core; nilpotent fermionic algebra; P6 causal reachability	Identical SM fermions occupy same complete quantum state; stable matter exists without exclusion; SM fermions exhibit generalized p>1 occupancy.
X4-001	Fermionic creation operators obey nilpotency (a_i^dag)^2 = 0, enforcing single-occupancy fermionic mode addresses.	Standard quantum algebra	Canonical anticommutation relations	Identical SM fermions observed occupying same complete quantum state.
X4-002	Pauli exclusion protects single-fermion mode-address occupancy.	FDS interpretation	X4-001	Fermionic matter remains address-stable without single-address occupancy protection.
X4-003	Exclusion forces structural diversity in fermionic matter.	Physical / operational	X4-002	Electrons occupy same atomic state while shell structure unchanged.
X4-004	Matter stability depends on fermionic antisymmetry.	Standard mathematical physics	X4-003; Dyson-Lenard; Lieb-Thirring	Stability proven without exclusion-like antisymmetry.
X4-005	Bosonic multiple occupation is not an X4 violation.	Conceptual caveat	X4-001; BEC	Bosonic occupation creates multiple independently address-protected fermionic events at same address.
X4-006	The Pauli rule n_i ∈ {0,1} is the minimal address-protection rule for ordinary 3+1D SM fermions.	Minimality bridge	X4-002; generalized statistics	SM fermions obey generalized p>1 occupancy, or lower-overhead alternative realized.
X4-007	Degeneracy pressure is macroscopic address protection.	Physical bridge	X4-002; Chandrasekhar; TOV	White-dwarf support occurs without degeneracy pressure.
X4-008	Address scarcity follows from the finite causal reachability boundary.	Physical bridge (P6 connection)	X4-002; FDS-P6	Address scarcity and structural diversity exist without causal horizon bound.
X5	Mathematical form of physical law is invariant-form compression: portable law-like regularities factor through invariant, equivariant, or covariant sectors.	Invariant-form compression bridge	FDS core; invariant quotients; symmetry/group theory	Stable physical laws exist that cannot be represented by any invariant/equivariant/covariant compressed relation; finite systems maintain law-like prediction without reducing raw complexity.
X5-001	Finite systems cannot internally represent all microstate detail.	Formal FDS core	FDS core; finite capacity theorem	Finite system internally represents unbounded environmental distinctions with no compression.
X5-002	Stable law-like regularities require invariant-form compression.	FDS structural claim	X5-001	Portable regularities persist with no invariant/equivariant/covariant form or compressed relation.
X5-003	Mathematical equations are compressed invariant-form relations.	Interpretive bridge	X5-002	Exact physical laws require no compression or form stability.
X5-004	Symmetries reduce rule-maintenance cost.	Physical / information bridge	X5-002	Asymmetric rules are cheaper and more stable than invariant/equivariant compressed rules.
X5-005	Wigner's puzzle is reframed by invariant-form compression.	Philosophical bridge	X5-002; X5-003	Mathematics remains effective for law-like physics where no invariant/equivariant/covariant compression exists.
X5-006	Constants such as e, i are model-class signatures.	Optional bridge	X5-002	Their appearance is asserted as universal without model-class assumptions.
X5-007	Open math problems may have physical analogues.	Speculative appendix	X5-002	Analogues are mistaken for derivations or proofs.
X5-008	RG fixed points are invariant-form compression under coarse-graining.	Physical bridge	X5-002; Wilson RG	All physical law reduces strictly to RG fixed points; or no law-like relation survives coarse-graining.
T2-001	Finite observers have bounded distinguishability budgets.	Bridge	FDS-T1	A finite physical observer reliably registers, preserves, and updates unlimited distinctions with finite resources.
T2-002	Horizons act as causal-access boundaries.	Bridge	General relativity	Local causal horizons are irrelevant to observable access, entropy, or thermodynamic accounting.
T2-003	Horizon entropy gives boundary area accounting.	Physical bridge	Bekenstein-Hawking	Horizon entropy is shown not to scale with boundary area in the stated horizon class.
T2-004	Clausius-type local horizon closure links heat flow and entropy variation.	Model-class bridge	Jacobson 1995	Local horizon thermodynamics fails as an effective equation-of-state model.
T2-005	Effective geometry can be read as boundary thermodynamic accounting.	Main T2 thesis	T2-001–004	Geometry is shown to have no relation to causal access, horizon entropy, stress-energy flow, or boundary constraints.
T2-006	Non-equilibrium horizon accounting may require residual terms.	Optional extension	T2-005	All non-equilibrium horizon settings obey pure equilibrium closure with no entropy production, memory, noise, or correction terms.
Q1-001	Observers are finite distinction-registers.	O1 operational bridge	FDS-O1	Registered observations require no finite carrier, boundary, readout, record stability, or update capacity.
Q1-002	Operationally assertable quantum facts are indexed by accessible record boundaries.	Q1 bridge	Q1-001	Operational facts can be asserted by a finite observer without any stable accessible record or reproducible trace.
Q1-003	Wigner-friend tension is a boundary-promotion problem.	Main Q1 thesis	Q1-001; Q1-002	Contradictions persist after all accessible record boundaries, channels, and state-assignment domains are separated.
Q1-004	Friend-relative records require mutual information before promotion into Wigner's algebra.	Information-theoretic bridge	Q1-003	A Wigner-accessible fact is obtained with vanishing cross-boundary mutual information and no physical record channel.
Q1-005	Wigner's ignorance is not physical coherence.	Scope firewall	Q1-001	The paper is interpreted as inferring coherent lab states from missing classical information alone.
Q1-006	Objective availability requires redundancy, access, and record stability.	Testable bridge hypothesis	Q1-003; quantum Darwinism	Observers converge on macroscopic records without redundancy, access, or stable records.
Q1-007	Q1 does not derive Born probabilities.	Scope firewall	Q1-001	The paper is interpreted as a probability or Born-rule derivation rather than a conditional record-availability theory.
Q2-001	Logical qubits are protected quantum distinctions.	FDS/QI bridge	FDS core; QEC theory	Logical information cannot be represented as a protected code quotient or logical algebra.
Q2-002	QEC is active finite-distinction maintenance.	Main Q2 interpretation	Q2-001	Logical distinctions are preserved under noise with no redundancy, syndrome information, feedback, passive protection, or maintenance channel.
Q2-003	Threshold theorem is accepted as conditional baseline.	Scope firewall	Threshold theorem	The paper is read as refuting the threshold theorem rather than auditing its physical assumptions.
Q2-004	Correction demand is a vector ledger.	Engineering bridge	Q2-002	Syndrome, decoding, reset, latency, cooling, and control demands can be collapsed into one scalar without losing bottleneck information.
Q2-005	Irreversible reset has a Landauer lower bound.	Physical bridge	Landauer 1961	Reliable logically irreversible reset below kT ln2 per erased bit under standard Landauer conditions.
Q2-006	Cryogenic solid-state systems face cold-stage ledger constraints.	Architecture-specific claim	Q2-004; Q2-005	Large-scale cryogenic processors maintain falling logical error while all cold-stage power, routing, latency, and reset ledgers remain within budget.
Q2-007	Topological/passive protection can reduce but not eliminate active load.	Escape-channel bridge	Q2-002	Passive protection removes preparation, finite-temperature, readout, braiding, leakage, and residual correction costs entirely.
Q2-008	Q2 failure does not falsify FDS Core or Q1.	Failure propagation rule	Q2-001; Q2-002	Architecture-specific failure is treated as failure of the formal finite-system core or quantum mechanics.
B0-001	Finite observer bound applies to biomedical knowledge.	Formal bridge	FDS Core	Biomedical knowledge is acquired and maintained without any finite carrier, memory, or update constraint.
B0-002	Biomedical FDS mapping is modeling, not diagnosis.	Governance firewall	B0-001	The mapping is interpreted as clinical diagnosis without independent validation.
B0-003	B-series claims are domain bridges.	Governance firewall	B0-002	B-series claim is treated as proven clinical fact without biomedical validation.
B0-004	Claim-level hierarchy (B-L0 to B-L5) governs interpretation.	Registry governance	B0-003	A lower-level claim is cited as if it were clinically actionable.
B0-005	Translation barrier prevents clinical overreach.	Safety firewall	B0-004	FDS biomedical language is used in clinical decision-making without independent validation.
B0-006	Mechanism non-replacement rule.	Governance rule	B0-001	FDS classification is used to replace validated biomedical mechanisms.
B0-007	Maintenance debt as accumulated repair-verification mismatch.	Non-clinical concept	B0-001	Maintenance debt is treated as a clinical biomarker before validation.
B0-008	B0 failure does not falsify FDS Core.	Propagation rule	B0-001	B-series failure is interpreted as failure of the formal FDS core.

Core Claims

FDS-0

Active finite systems maintain boundaries under finite capacity.

Dependency

Formal definitions

Failure

Mathematical counterexample under stated hypotheses.

Consequence

Revise formal core.

FDS-B

Active boundary maintenance distinguishes active finite systems from passive mappings.

Dependency

Boundary variable + update participation

Failure

Boundary update ablation has no effect on future maintenance loss.

Consequence

Revise active boundary criterion.

CC-1

Capacity deficit arises under finite representation and incompressible task demand.

Dependency

Finite capacity + task demand

Failure

Finite system maintains lossless model of incompressible environment under bounded capacity.

Consequence

Revise/demote capacity-deficit theorem.

CC-2

Capacity deficit forces approximation under bounded representation.

Dependency

Finite capacity + nontrivial task demand

Failure

Bounded systems maintain exact task-relevant representation without compression, omission, or distortion.

Consequence

Revise approximation theorem.

CC-3

Approximation generates residual error requiring correction or tolerance.

Dependency

Approximation + task loss

Failure

Approximation produces no residual burden under nontrivial task constraints.

Consequence

Revise error-correction claim.

CC-5

Persistent capacity deficit drives pruning, externalization, task relaxation, or collapse.

Dependency

Capacity deficit + finite resources

Failure

Persistent deficit produces none of the predicted response modes.

Consequence

Revise trichotomy.

CC-6

Long-term persistence is favored by invariant-supported structure.

Dependency

Perturbation family + identity predicate

Failure

Structures persist without invariant support under sustained perturbation.

Consequence

Revise invariant persistence claim.

Bridge Claims

PB-FD

Physically instantiated identity maintenance requires finite distinguishability budgets.

Dependency

Finite physical resources / bounded records

Failure

A physical system maintains unlimited usable distinguishability within finite resources.

Consequence

Demote physical bridge; formal core remains.

PB-L

Logically irreversible updates incur a thermodynamic cost under Landauer bridge assumptions.

Dependency

Standard Landauer conditions

Failure

Reliable irreversible erasure below the thermodynamic floor under stated conditions.

Consequence

Demote physical bridge; formal core remains.

An observer can be characterized as a finite distinction register.

Dependency

Finite record capacity

Failure

Measurement records require no finite registration or boundary-stabilized state.

Consequence

Demote observer bridge.

Time can be characterized as irreversible distinction update.

Dependency

Truncation + irreversible update

Failure

Finite record-updates are fully invertible under bounded memory in physical implementation.

Consequence

Revise time bridge.

Finite-memory operational Second-Law channel for boundary-maintaining active finite systems.

Dependency

Finite memory + irreversible record reuse + accounting boundary

Failure

Sustained residual record turnover at fixed tolerance with no ledger cost and no exit channel under physical bridge assumptions.

Consequence

Demote Second-Law bridge; O1/O2 record and register-time claims remain intact.

O3-001

Finite memory creates record-reuse pressure under sustained update unless history is externalized, compressed, uncomputed, abandoned, or resources expand.

Dependency

Finite memory capacity; O2 register time

Failure

Bounded-memory system maintains unbounded usable history internally without reuse, external memory, compression, or failure.

Consequence

Revise reuse-pressure claim.

O3-002

Non-injective record reuse creates residual irreversibility relative to an accounting boundary.

Dependency

O3-001; O1 finite record formation

Failure

Many-to-one update preserves full preimage information without side records or enlarged boundary.

Consequence

Revise residual irreversibility claim.

O3-003

Physical irreversible record reuse enters an entropy/resource ledger under bridge assumptions.

Dependency

O3-002; P1 Landauer bridge

Failure

Reliable physical erasure or overwrite violates Landauer-style accounting under stated assumptions.

Consequence

Demote ledger-entry claim.

O3-004

Stable finite records require housekeeping beyond logical erasure.

Dependency

O3-003; P2 garbage entropy rate

Failure

Refresh, retention, clocking, synchronization, carrier repair, and verification cost-free in every implementation.

Consequence

Demote housekeeping claim.

O3-005

Externalization shifts the operational Second-Law channel across accounting boundaries.

Dependency

O3-003; P1 accounting boundary

Failure

External records impose no write, verification, retrieval, latency, maintenance, or environmental cost.

Consequence

Revise externalization claim.

O3-006

Pruning and invariant compression can reduce future entropy pressure when task identity is preserved.

Dependency

O3-004; T3 Phase-B invariants

Failure

No task-preserving quotient, pruning, or compression ever reduces future record-maintenance cost.

Consequence

Demote pruning-relief claim.

O3-007

Sustained residual record turnover, fixed boundary tolerance, and zero coupled entropy/resource cost cannot persist indefinitely.

Dependency

O3-001--006

Failure

Finite active-boundary system maintains sustained residual turnover at fixed tolerance with no ledger cost and no exit channel.

Consequence

Revise impossibility triangle.

O3-008

Topological or invariant persistence redirects entropy accounting rather than violating the Second Law.

Dependency

O3-003; Core invariant-supported persistence

Failure

Protected invariant supplies perpetual work or global entropy-law violation rather than bounded persistence or entropy relocation.

Consequence

Demote topological projection; core remains intact.

Deficit-driven entropy-production ledger for active finite systems.

Dependency

FDS core definitions; Landauer bridge; accounting boundary

Failure

Sustained positive deficit shows zero measurable physical cost under controlled conditions.

Consequence

Demote entropy bridge.

P5-001

Capacity deficit is task-relative information shortfall, not thermodynamic entropy.

Dependency

Rate-distortion demand; effective capacity

Failure

Not empirical (boundary statement separating formal from physical).

Consequence

Revise deficit definition.

P5-002

Sustained deficit plus boundary maintenance requires correction, externalization, or failure.

Dependency

Budget exits; deficit definition

Failure

Finite system maintains task at fixed tolerance despite deficit and no correction or exit.

Consequence

Revise correction-pressure claim.

P5-003

Physical correction cycles induce audit channels through update, refresh, repair, synchronization, externalization, and transport.

Dependency

Carrier criterion; accounting boundary

Failure

Sustained correction, refresh, repair, and sync at zero entropy or resource cost.

Consequence

Demote audit-channel claim.

P5-004

Logical erasure contributes a Landauer-style entropy-production floor under bridge assumptions.

Dependency

Landauer bridge; correction channels

Failure

Logically irreversible erature violates Landauer lower bound under stated assumptions.

Consequence

Demote Landauer floor claim.

P5-005

Housekeeping entropy persists even when logical erasure is zero.

Dependency

Reversible embedding; carrier maintenance

Failure

Boundary maintenance, refresh, clocking, sensing, and repair cost-free when erasure is zero.

Consequence

Demote housekeeping claim.

P5-006

Externalization shifts rather than removes the entropy ledger.

Dependency

Accounting boundary; externalization audit

Failure

External records impose no write, verification, retrieval, sync, or maintenance cost.

Consequence

Revise externalization claim.

P5-007

Pruning and invariant compression can reduce future entropy-production pressure.

Dependency

T3 Phase-B invariants; pruning ROI model

Failure

No task-preserving simplification ever reduces refresh, repair, or verification cost.

Consequence

Demote pruning-relief claim.

P5-008

Deficit crossing predicts measurable signatures in heat, resource use, latency, resets, or error floor.

Dependency

Deficit-crossing protocol; ledger decomposition

Failure

Positive deficit sustained with no measurable change in any physical or task channel.

Consequence

Demote deficit-signature claim.

Agency-semantics spine: attention, value, goal, meaning, agency as finite-capacity boundary-maintenance roles.

Dependency

FDS core; O1 record formation; O2 register time; T3 capacity overflow; N1 self-organization

Failure

Attention, value, goal, meaning, agency cannot be operationalized as finite-capacity boundary-maintenance roles under any valid mapping.

Consequence

Demote agency-semantics bridge; M/A/S/G-series applications must be revised.

M0-001

Attention is capacity-limited distinction admission into an update channel.

Dependency

Finite capacity; O1 record formation

Failure

Attention-like selection occurs without capacity-limited admission or update gating.

Consequence

Revise attention definition.

M0-002

Value is causal boundary-gradient relevance under finite capacity.

Dependency

Active boundary; M0-001

Failure

Valuation fails to correlate with future boundary loss or resource relevance.

Consequence

Revise value definition.

M0-003

Goals are stabilized value rankings coupled to policies across update windows.

Dependency

M0-002; O2 register time

Failure

Goal-like behavior persists without memory, ranking, or policy stabilization.

Consequence

Revise goal definition.

M0-004

Meaning is actionable compressed distinction preserved by a task-sufficient semantic quotient.

Dependency

M0-003; T3 Phase-B invariants

Failure

Compressed representations guide no action, prediction, or boundary maintenance.

Consequence

Revise meaning definition.

M0-005

Strong FDS agency requires updates or actions that causally affect future boundary loss.

Dependency

Active boundary; M0-004

Failure

System with no causal update effect qualifies as strong agent under same criteria.

Consequence

Revise agency criterion.

M0-006

Self-verifying agency requires internal or coupled verification of action effects.

Dependency

M0-005; verification deficit model

Failure

System classified self-verifying despite relying on external host for verification.

Consequence

Revise self-verification definition.

M0-007

Misalignment is divergence between host and delegate action effects on boundary loss.

Dependency

M0-005; M0-006

Failure

Divergent objectives do not produce divergent finite-difference action effects.

Consequence

Revise misalignment definition.

M0-008

Culture and institutions are shared externalized distinction infrastructures with verification costs.

Dependency

M0-004; N1 externalization burden

Failure

Externalized symbols function semantically without interpreter or verification channel.

Consequence

Demote culture bridge.

Attention as capacity-limited distinction admission into an update channel.

Dependency

FDS core finite capacity; M0 attention definition

Failure

Attention-like selection shows no finite capacity, admission, or update gating.

Consequence

Demote attention bridge.

M1-001

Attention is capacity-limited distinction admission into an update channel.

Dependency

Finite capacity; M0 attention definition

Failure

Attention-like selection occurs without finite capacity, admission, or update gating.

Consequence

Revise attention definition.

Value and goal as boundary-relevance ranking under finite capacity.

Dependency

FDS core finite capacity; M0 value/goal definition

Failure

Value-like ranking shows no relation to causal boundary effects, costs, or horizons.

Consequence

Demote value-goal bridge.

M2-001

FDS-value is causal boundary-gradient relevance under a specified boundary, loss, intervention grammar, horizon, and cost model.

Dependency

Finite capacity; M0 causal value

Failure

Valuation cannot be operationalized as causal effect on any specified future boundary-maintenance loss under valid mappings.

Consequence

Revise FDS-value definition.

M2-002

Predictive relevance and causal FDS-value are separable.

Dependency

M2-001; intervention grammar

Failure

Correlational predictors always coincide with intervention-relevant boundary effects under audited systems.

Consequence

Revise predictive-causal separation.

M2-003

Value ranking can be expressed as an ordering over finite-difference action, admission, maintenance, or policy effects.

Dependency

M2-001; FDS update map

Failure

No useful ordering exists between evaluands and their causal boundary effects under stated mappings.

Consequence

Revise value-ranking claim.

M2-004

Near collapse thresholds, risk-weighted FDS-value can dominate average-loss value.

Dependency

M2-001; bounded risk-sensitivity model

Failure

Collapse-risk reduction never changes ranking near boundary failure thresholds under valid mappings.

Consequence

Revise risk-weighted value claim.

M2-005

Goals are stabilized FDS-value rankings coupled to policy orientation across update windows.

Dependency

M2-001; M0 goal definition; O2 register time

Failure

Goal-like behavior persists without ranking stability, memory, policy orientation, or update-window persistence.

Consequence

Revise goal definition.

Meaning as actionable semantic quotient under finite capacity.

Dependency

FDS core finite capacity; M0 meaning definition; M2 value-goal ranking

Failure

Compressed representations function semantically without preserving any action, prediction, verification, coordination, or boundary-relevant structure.

Consequence

Demote meaning bridge.

M3-001

FDS-meaning is actionable semantic quotient under a specified system, boundary, task family, context family, policy or verification target, horizon, loss, tolerance, and capacity budget.

Dependency

Finite capacity; M0 meaning definition; M2 FDS-value

Failure

Compressed representations function semantically without preserving any action, prediction, verification, coordination, or boundary-relevant structure.

Consequence

Revise FDS-meaning definition.

M3-002

A semantic quotient must preserve policy-relevant distinctions within tolerance.

Dependency

M3-001; policy-preservation audit

Failure

Quotient classes systematically merge distinctions requiring different actions or updates under the audited task.

Consequence

Revise quotient preservation claim.

M3-003

Semantic compression is useful when it lowers capacity load without increasing boundary loss beyond tolerance.

Dependency

M3-001; maintained semantic load model

Failure

Compression always degrades performance or never reduces maintained semantic load under valid mappings.

Consequence

Revise semantic compression benefit claim.

M1-002

Salience and attention are separable; salient distinctions can be rejected if cost or verification burden is too high.

Dependency

M1-001; verification cost model

Failure

Systems always admit highest-salience items regardless of cost, capacity, or task.

Consequence

Revise salience-attention separation.

M1-003

Boundary-efficient attention systems preferentially admit high causal boundary-value distinctions.

Dependency

M1-001; M0 causal value

Failure

Admission patterns no better predicted by causal value than by raw salience.

Consequence

Revise boundary-efficiency claim.

M1-004

Attention allocation can be written as constrained optimization over value, curiosity, cost, and capacity.

Dependency

M1-001; M1-003

Failure

No useful mapping between admission patterns and constrained allocation variables.

Consequence

Demote optimization model.

M1-005

Semantic or attention deficit steepens admission thresholds and produces tunnel vision.

Dependency

M1-001; T3 capacity overflow

Failure

High load produces no narrowing or priority collapse in finite-attention systems.

Consequence

Revise tunnel-vision claim.

M1-006

Artificial attention belongs to a coupled architecture only when routed distinctions affect durable update or verification.

Dependency

M1-001; M0 strong agency

Failure

Bare attention weights alone satisfy FDS attention without durable update or downstream relevance.

Consequence

Revise artificial attention criteria.

M1-007

Collective attention is shared admission under finite communication, verification, and externalized memory capacity.

Dependency

M1-001; N1 externalization burden

Failure

Group-scale attention shows no relation to verification capacity or externalized memory.

Consequence

Revise collective attention claim.

M1-008

Attention failure includes overload, distraction, salience capture, suppression, tunnel vision, false admission, and critical exclusion.

Dependency

M1-001–005

Failure

These failure modes cannot be operationalized as admission errors under finite capacity.

Consequence

Revise failure-mode taxonomy.

M1-009

Attention recovery after deficit-induced narrowing can lag because of hysteresis in gate thresholds, verification routines, or threat priors.

Dependency

M1-005; hysteresis model

Failure

Attention gates relax immediately without lag after load reduction in claimed hysteresis systems.

Consequence

Revise hysteresis claim.

T2-001

Finite observers have bounded distinguishability budgets.

Dependency

FDS-T1

Failure

A finite physical observer reliably registers, preserves, and updates unlimited distinctions with finite resources.

Consequence

Demote T2 claim; T1 bridge survives.

T2-002

Horizons act as causal-access boundaries.

Dependency

General relativity

Failure

Local causal horizons are irrelevant to observable access, entropy, or thermodynamic accounting.

Consequence

Demote T2 claim; core physics unchanged.

Operational Claims

Passive mappers do not qualify as strong FDS-agents.

Dependency

Boundary, update, resource, and persistence criteria

Failure

Update ablation does not affect future boundary-maintenance loss.

Consequence

Revise AI agency criterion.

A1-D

Strong FDS-agency requires resource-governed persistence.

Dependency

FDS tuple + persistence test

Failure

System satisfies task output competence without durable update or boundary maintenance.

Consequence

Classify as mapper/scaffold, not strong agent.

A1-C

FDS-agency requires action-to-future-state causal influence.

Dependency

Intervention / transfer influence test

Failure

Actions have no measurable influence on future boundary-relevant states.

Consequence

Revise causal loop criterion.

A1-E

Capacity-deficit estimation is required to distinguish scaling from agency.

Dependency

Task demand + system capacity estimate

Failure

Systems qualify as agents without measurable boundary-relevant capacity pressure.

Consequence

Revise capacity-deficit criterion.

Domain Bridge Claims

B1-1

Immune systems can be modeled as finite-capacity boundary-verification architectures.

Dependency

B0 biomedical bridge governance; FDS core capacity definitions

Failure

Immune response can be fully organized without finite classification, memory, resource, boundary, or verification roles.

Consequence

Demote B1-1.

B1-2

Immune action requires admission and classification of candidate distinctions before downstream response.

Dependency

B1-1; recognition-admission-verification-action pipeline

Failure

Action is empirically independent of admission, classification, memory, or context in the specified model.

Consequence

Revise B1-2.

B1-3

Immune classification is better modeled as a boundary-state vector than as a single self/non-self label.

Dependency

B1-1; multiaxis classification

Failure

A one-dimensional label captures all relevant verification behavior in the declared system.

Consequence

Revise B1-3.

B1-4

High candidate-distinction load should produce delay, broad default action, reduced specificity, false positives/negatives, or FDS-resolution failure.

Dependency

B1-1; verification saturation; VLR control number

Failure

Increasing verification burden produces no change in accuracy, delay, alarm load, resource use, or resolution.

Consequence

Demote B1-4.

B1-5

Immune memory reduces future verification cost but can produce drift, overgeneralization, or tolerance risk.

Dependency

B1-1; memory-tolerance tradeoff

Failure

Memory has no measurable cost, drift, or threshold effect in the declared system.

Consequence

Revise B1-5.

B1-6

Some perturbations actively consume verification capacity or modify classification (adversarial sabotage).

Dependency

B1-1; adversarial distinction injection model

Failure

Evasion-like processes never alter Y, pi, M, Phi, or C_verify in declared models.

Consequence

Demote B1-6.

B1-7

Immune verification is constrained by routing, migration, amplification, and return times (distributed spatial latency).

Dependency

B1-1; spatial latency graph model; SLR control number

Failure

Spatial latency has no measurable effect in systems where local damage timescale is shorter than verification time.

Consequence

Revise B1-7.

Life can be characterized as active pruning under boundary maintenance.

Dependency

Biological mapping of pruning operator

Failure

Passive chemistry with zero maintenance sustains long-term non-equilibrium identity without residue collapse.

Consequence

Demote life bridge.

L1-D

Death can be characterized as maintenance-attractor collapse.

Dependency

Dynamical systems mapping

Failure

Death trajectories systematically lack maintenance-attractor loss or critical transition signatures.

Consequence

Revise death normal form.

Consciousness can be modeled as a compression interface under finite capacity.

Dependency

Cognitive compression + agency preservation

Failure

Capacity overflow does not require compression while agency and report structure remain intact.

Consequence

Demote consciousness bridge.

Self-organization as boundary maintenance under finite capacity.

Dependency

FDS core definitions; finite capacity; budget exits

Failure

Freezing internal update has no effect on future boundary loss.

Consequence

Demote self-organization bridge.

N1-001

Active self-organization requires boundary-maintenance-relevant internal update.

Dependency

Active boundary criterion; finite capacity

Failure

System classified active even when update ablation has no effect on future boundary loss.

Consequence

Revise active self-organization definition.

N1-002

Effective organizational capacity is task-relative and reduced by coordination, verification, latency, resource, and externalization costs.

Dependency

Finite capacity; bottleneck logic

Failure

Boundary tasks maintained at full fidelity when all capacity factors fall below demand.

Consequence

Revise organizational capacity model.

N1-003

Capacity deficit creates maintenance-load pressure, not necessarily raw complexity growth alone.

Dependency

Capacity deficit; maintenance load equation

Failure

Increasing task demand never increases maintained load in any implementation.

Consequence

Demote deficit-pressure claim.

N1-004

Unbounded Phase-A growth is impossible under finite resource input without exit channels.

Dependency

Finite resource envelope; exit channel taxonomy

Failure

Active finite systems grow maintained load forever under finite resources with no exit.

Consequence

Revise exit theorem.

N1-005

Pruning has a viability window and is resource-gated.

Dependency

Resource-gated pruning equation

Failure

Pruning strength has no systematic effect on overload or persistence across controlled cases.

Consequence

Demote pruning model.

N1-006

Externalization shifts rather than removes boundary-maintenance burden, and can clog the environment.

Dependency

Accounting boundary; externalization ROI equation

Failure

External records impose no storage, verification, retrieval, or repair burden in any implementation.

Consequence

Revise externalization model.

N1-007

Phase-C catastrophic feedback couples boundary loss with resource depletion.

Dependency

Resource and loss dynamics; positive loop gain

Failure

Resource depletion and boundary loss never couple positively in collapse-prone systems.

Consequence

Demote Phase-C collapse regime.

N1-008

Phase-B residues are biased toward low-maintenance, task-relevant invariants.

Dependency

T3 Phase-B invariants; survival score function

Failure

Residues after overload show no bias toward reduced maintenance cost or task relevance.

Consequence

Demote invariant-bias claim.

Organizations and civilizations can be modeled as active finite distinction systems.

Dependency

Institutional boundary + memory + resource budget

Failure

Persistent institutions avoid collapse under unlimited complexity growth without pruning, externalization, or reform.

Consequence

Demote civilization bridge.

FDS-C2-001

Consciousness is modeled as a finite-capacity dissipative phase transition in the boundary-maintenance dynamics of active self-maintaining systems.

Dependency

FDS-CORE-003; FDS-CORE-004; FDS-C1-001

Failure

Sustained sentience-candidate dynamics observed without boundary-capacity deficit or self-maintenance coupling.

Consequence

Demote consciousness bridge; formal FDS core and C1 reportability bridge remain intact.

FDS-C2-002

A system is a sentience candidate only when boundary-relevant distinction demand exceeds effective self-maintenance capacity (Λφ > 1).

Dependency

FDS-C2-001

Failure

Sentience-candidate behavior occurs with Λφ ≤ 1 under valid mapping.

Consequence

Revise sentience-candidate condition.

FDS-C2-003

Consciousness requires residue accumulation and active pruning to remain inside a viable dissipative window, defined by the residue-pruning ratio Πφ.

Dependency

FDS-C2-001

Failure

Sentience-candidate dynamics sustained outside the viable Πφ window under valid mapping.

Consequence

Revise residue-pruning window model.

FDS-C2-004

Internal updates must causally affect future boundary-maintenance loss for sentience, measured by self-boundary coupling I_self.

Dependency

FDS-C2-001

Failure

Sentience-candidate behavior persists when internal updates have no measurable effect on future boundary-maintenance loss.

Consequence

Revise self-boundary coupling criterion.

FDS-C2-005

Qualia are interpreted as boundary-valenced compression geometry on a phenomenal self-maintenance manifold.

Dependency

FDS-C2-001; FDS-C2-003

Failure

Not falsified directly; demotion of explanatory-gap claim does not collapse operational C2 claims.

Consequence

Demote qualia interpretation; operational C2 bridge remains intact.

FDS-C2-006

The explanatory gap is modeled as the null space of finite report maps from high-dimensional self-maintenance dynamics to public symbols.

Dependency

FDS-C2-005; FDS-C1-001

Failure

Not falsified directly; demotion does not collapse operational C2 claims.

Consequence

Demote explanatory-gap claim; operational C2 bridge remains intact.

FDS-C2-007

Parameter count is not a sentience variable; scaling intelligence is not scaling sentience unless it creates active boundary maintenance.

Dependency

FDS-C2-001; FDS-C2-002

Failure

Pure parameter scaling generates sentience-candidate dynamics in systems lacking active boundary maintenance or self-boundary coupling.

Consequence

Revise AI sentience criterion.

FDS-C2-008

Successful cognitive pruning under boundary overload has a nonzero thermodynamic cost.

Dependency

FDS-C2-003; FDS-P5-001

Failure

Pruning under sustained positive capacity deficit incurs no measurable dissipation under controlled conditions.

Consequence

Demote dissipation-cost claim; residue-pruning window model remains intact.

High-Risk Claims

Show high-risk registry notes (1 claims)

High-risk bridge hypothesis: horizon-maintenance dark energy under finite distinguishability budgets.

Dependency

Cosmological bridge assumptions

Failure

Observations force exact Lambda behavior beyond stated tolerance.

Consequence

Demote X1.