In prior work I modelled the macroscopic development of a closed quantum system as a directed graph of coarse-grained histories on which a final boundary condition induces an admissible subgraph, and I graded terminal conditions into a trivial, structured, and computational typology. That programme left two structural gaps: it imported its formal backbones rather than proving results of its own, and it never joined its pruning half to its agency-and-contextuality half or assigned pruning a thermodynamic cost. This paper addresses both. I construct a resource theory whose objects are two-boundary-conditioned decoherent-history ensembles, whose free objects are those in which the terminal condition leaves the history distribution unchanged, and whose free operations are boundary-compatible coarse-grainings. Theorem 1 establishes that the relative entropy of the conditioned against the unconditioned history distribution is a faithful monotone under every such coarse-graining, jointly convex in the pair of history distributions; I also exhibit a counterexample showing that the more obvious counting-based deficit is not a monotone, which is why the relative-entropy form is the correct object. Theorem 2 establishes that a register satisfying the Reeb-Wolf hypotheses, carried from the unconditioned to the conditioned distribution, deposits heat at least kBT ln 2 times the entropy difference, and, combined with the Craig rank-product bound, at least kBT ln[n0 / (rαrω)] for equidistributed history weights. Lower terminal rank therefore raises the derived cost floor under the stated assumptions. I am explicit that this is a floor and not a total ordering: rank does not by itself order terminal conditions by resource content, and full rank does not imply a trivial condition. I then advance, explicitly as a conjecture rather than a theorem, a bridge to the contextuality half of the programme: along a nested family of normalized projectors terminating at the identity, within the paradoxical class, and against a noncontextual baseline, the Contextuality-by-Default measure of pre- and post-selected cyclic statistics should be non-increasing in the family index. I do not claim that the universe physically erases histories; the more limited claim is that a register implementing admissibility filtering pays a rank-graded cost. Conjecture C is, in the first instance, a mathematical conjecture about quantum statistics, settleable by computation, not a proposed departure from quantum mechanics.
In prior work I modelled the macroscopic development of a closed quantum system as a directed graph of coarse-grained histories on which a final boundary condition induces an admissible subgraph, and I graded terminal conditions into a trivial, structured, and computational typology. That programme left two structural gaps: it imported its formal backbones rather than proving results of its own, and it never joined its pruning half to its agency-and-contextuality half or assigned pruning a thermodynamic cost. This paper addresses both. I construct a resource theory whose objects are two-boundary-conditioned decoherent-history ensembles, whose free objects are those in which the terminal condition leaves the history distribution unchanged, and whose free operations are boundary-compatible coarse-grainings. Theorem 1 establishes that the relative entropy of the conditioned against the unconditioned history distribution is a faithful monotone under every such coarse-graining, jointly convex in the pair of history distributions; I also exhibit a counterexample showing that the more obvious counting-based deficit is not a monotone, which is why the relative-entropy form is the correct object. Theorem 2 establishes that a register satisfying the Reeb-Wolf hypotheses, carried from the unconditioned to the conditioned distribution, deposits heat at least kBT ln 2 times the entropy difference, and, combined with the Craig rank-product bound, at least kBT ln[n0 / (rαrω)] for equidistributed history weights. Lower terminal rank therefore raises the derived cost floor under the stated assumptions. I am explicit that this is a floor and not a total ordering: rank does not by itself order terminal conditions by resource content, and full rank does not imply a trivial condition. I then advance, explicitly as a conjecture rather than a theorem, a bridge to the contextuality half of the programme: along a nested family of normalized projectors terminating at the identity, within the paradoxical class, and against a noncontextual baseline, the Contextuality-by-Default measure of pre- and post-selected cyclic statistics should be non-increasing in the family index. I do not claim that the universe physically erases histories; the more limited claim is that a register implementing admissibility filtering pays a rank-graded cost. Conjecture C is, in the first instance, a mathematical conjecture about quantum statistics, settleable by computation, not a proposed departure from quantum mechanics.
Quantum mechanics permits time-symmetric formulations in which intermediate events are conditioned by both an initial state and a final boundary condition. In this paper, I develop a model of quantum history in which a final boundary condition constrains the admissible-history ensemble rather than serving as a passive terminal state. I represent the universe’s possible macroscopic development as a history graph and define an admissible subgraph by imposing a final-state condition. I then examine whether, under a history-ensemble encoding, this restriction can reduce the effective description length of realized histories relative to unconstrained branching descriptions. I argue that the informational significance of the model depends on the structure of the terminal condition. Trivial terminal states impose weak selectivity and provide little compression. Structured terminal states impose stronger constraints and better support the emergence of organized intermediate worlds. Computational terminal states impose the strongest selectivity because they favor histories that generate information-processing structures, self-replicating systems, and explicit forms of computation. On this basis, I propose that sufficiently selective computational endpoints are most naturally interpreted in agentic terms, provided agency is understood structurally rather than psychologically. The model is retrocausal in a boundary-conditioned sense but not interventionist. It excludes inconsistent histories rather than revising an already fixed past and does not require operational backward signaling. I also distinguish between maximal pruning and robustness-preserving selectivity within computational endpoint classes. I conclude that a boundary-conditioned agentic interpretation of sufficiently selective computational endpoints is not established here as empirical fact, but it is rendered a mathematically serious interpretive hypothesis by the combination of dual-boundary quantum formalism, informational pruning, and endpoint complexity analysis.
Two recent programs offer competing accounts of quantum causation. Griffiths' Consistent Quantum Causes grounds causal reasoning in the Consistent Histories formalism, treating stochastic quantum time development and noncommuting projectors as the proper foundation for a Pearl-style directed acyclic graph representation. The Costa–Shrapnel Quantum Causal Models program takes the process-matrix formalism as its starting point, generalizing classical interventionist causal discovery to the quantum domain and extending naturally to indefinite causal order. Both programs assume that causal structure is fixed by an initial condition together with forward dynamics. Neither addresses what happens when admissibility is conditioned at both temporal boundaries. In this paper, I argue that final-state-constrained history ensembles, and the informational pruning they induce, provide a third vantage point from which to compare these two programs. I do not claim to resolve the Griffiths–QCM disagreement, nor to construct a new quantum causal formalism from scratch. The more limited claim is that once admissibility is globally filtered by an initial and a final boundary condition, the question of which coarse-grained histories carry the effective causal and computational structure of the process is reframed. The Hartle–Craig rank-product theorem supplies the formal backbone: imposing a final-state projector with rank r_ω restricts the admissible-history family to at most r_α·r_ω nonzero-probability histories, where r_α is the initial-state rank. I illustrate this with the three-box paradox, treated as a joint Consistent Histories and process-matrix scenario under final-state conditioning. I also suggest that an explainability stance, drawn in a methodological sense from explainable artificial intelligence, is useful for asking which admissible histories do the explanatory work under a given endpoint class. I conclude that informational pruning offers a coherent third path that is neither a competitor to Griffiths' approach nor an extension of process-matrix interventionism, but a complementary perspective that sharpens what each program leaves implicit.
The definition of entropy in both classical and quantum contexts relies on a coarse-graining of the underlying microscopic description. While this dependence is widely acknowledged, the physical constraints that determine which coarse-grainings are admissible are rarely made explicit. This issue becomes particularly acute when the universe is treated as a closed system, where no external observer or privileged level of description can be assumed. Any characterization of entropy — including claims about the low-entropy initial conditions of the universe — must then be grounded in descriptions that can be physically instantiated from within the system itself. In this work, we introduce a rigorous operational framework that establishes explicit physical selection principles over the space of admissible descriptions. We organize these criteria into necessary conditions (local accessibility and physical implementation via internal interactions) and practical sufficiency conditions (finite resource requirements anchored in Landauer’s principle, dynamical stability, and effective consistency). To demonstrate the validity of our framework, we introduce a concrete one-dimensional spin-chain toy model, illustrating how mathematically valid global partitions fail to be physically realizable due to dynamic propagation limits and informational constraints. We analyze the far-reaching implications of this restriction across three domains. In classical statistical mechanics, it limits the arbitrariness of macrostate definitions. In quantum theory, it identifies environment-induced decoherence (einselection) not merely as a formal tool, but as the objective dynamical mechanism that forces the emergence of admissible internal partitions. In cosmology, it resolves foundational circularities in the quasi-classical histories framework and reframes the thermodynamic arrow of time as a "doubly relational" property—dependent both on cosmic boundary conditions and on the material limits of internal subsystems. Our framework clarifies the operational status of entropy as an emergent property of physically instantiated descriptions within a universe that observes itself.
Standard cosmology treats the hot-to-cold thermal evolution of the universe as a thermodynamic consequence of metric expansion, and standard quantum mechanics treats indeterminacy as ontologically primitive. A prior framework developed by the present author proposed that a final boundary condition can constrain the admissible-history ensemble of quantum cosmology, with a tiering of terminal states—trivial, structured, and computational—in which computational terminal states exert the strongest selective pruning. That earlier work left open a cosmological question: how does thermal history relate to endpoint-conditioned history selection? The present paper advances the thesis that cosmic cooling is not itself selective, but that it establishes the intermediate regime within which a computationally organized terminal condition can exert non-trivial pruning on the admissible-history ensemble. Under this reading, quantum indeterminacy functions not as the ultimate explanatory terminus of physical theory, but as the permissive admissibility substrate through which endpoint-conditioned selection operates. This is an interpretive claim about explanatory role, not a revision of the quantum formalism or a denial of its fundamentality. The paper formalizes cooling as an intermediate-regime condition, distinguishes forced from selectable features of thermal history, addresses the trivialization, teleology, anthropic, underdetermination, and fundamentality objections, and offers three candidate differential predictions concerning error-correcting substrate prevalence, the selective fine-tuning profile of constants, and the relative timing of cosmogenic transitions. The proposal is situated against Wheeler’s participatory universe, the two-state vector formalism, the transactional interpretation, Price’s time-symmetric program, Tegmark’s mathematical universe hypothesis, and Smolin’s cosmological natural selection.
This paper develops a formal reconstruction, within the Gell-Mann–Hartle decoherent-histories framework, of the Campbell–Owhadi observer-rendering criterion familiar from simulation-theoretic quantum mechanics. Under an explicit records-theoretic reading of "information available to an observer," the rendering criterion corresponds to a decoherence-functional condition weighted by algorithmic-information distance on observer records. The construction is metaphysically neutral: the parameter K may equally be read as a literal simulator budget or as a resource bound on observer-internal record consolidation. The author defines a pruning admissibility functional A(α | O, K) and establishes a correspondence in which Campbell–Owhadi rendering events coincide with transitions across the pruning-admissibility boundary. The framework recovers standard decoherent-histories statistics (Born rule, medium decoherence) in the limit K → ∞. For finite K, a heuristic derivation yields a complementary-error-function form, saturating at the contextuality/Bell margin, for the predicted sub-Tsirelson and sub-Klyachko–Can–Binicioğlu–Shumovsky deviations and for the threshold structure in delayed-choice eraser visibility. Two photonic protocols on existing single-photon platforms are proposed, at estimated costs of approximately $180k each in an existing facility or $200–400k from scratch.
A recurring confusion in discussions of measurement treats coarse-graining as a physical loss of information. I argue that this is a type error, stated quantitatively: for a closed total system, unitary evolution fixes the dynamics, while coarse-graining is a choice of description — a sys tem/environment split, an accessible observable algebra, a temporal resolution — and the purity drop of a reduced state under a given partial trace is computed exactly and shown to register which correlations have been declared inaccessible, not a physical event. Irreversibility enters only when a record is fixed or erased, and it is there — not at the choice of description — that thermodynamic cost is due. I define three tiers separately: a fact is a fixed record on a chain; a settled event is one inside the settlement domain (billable); an objective fact is a settled event certified by a three-chain audit. All criteria are binary decision procedures at declared thresholds and models. The agency this yields is physically embodied — a choice is a priced Hamiltonian modulation in the agent’s control algebra — and the Heisenberg cut is thereby relocated, not dissolved. The framework is located point by point against consistent histories, relational quantum mechanics, QBism, the Ev erett interpretation, and quantum Darwinism; a worked end-to-end example (passing three-chain audit with computed fidelities, audit errors, and erasure-work floor) and empirical failure conditions are included. A two-spin toy model exhibits a correlation that is real, unfixed, and unbilled