Making causal order definite is not free. A process that holds several orders in superposition is compelled to write into its future a record of which orders it superposed; wiping that record clean to leave a single definite order carries an unavoidable energy price. This paper shows that the price is set entirely by how many orders the process held, not by how strongly indefinite it was, and that it is at least the minimum amount of work physics demands to erase the corresponding amount of information. The paper identifies the entropy carried by the order record as the logarithm of the number of superposed orders, and then applies the classic principle that erasing information costs a minimum amount of work proportional to that entropy. Resetting the order to a definite value therefore dissipates at least that much work, a floor fixed by the order count alone. The paper shows that the environmental monitoring that makes order definite is precisely the process that writes and broadcasts the record: monitoring exports the full record entropy into the surroundings at the monitoring rate, so that afterwards erasing it to keep a single definite order dissipates at least the stated amount. Along the way the order-coherence plays the role of an order parameter for a smooth settling-down of the process, and the paper is careful to establish that this settling is a gentle, mean-field crossover with a finite response and no true critical point. The result puts the emergence of a definite causal order on a thermodynamic footing, and points in the opposite direction to the existing thermodynamics of indefinite order. That line of work asks whether the ordinary laws of heat are bent when order is superposed, and treats indefinite order as a useful resource; here indefinite order is instead a liability that must be paid off, and the question is the cost of removing it. The paper draws its boundaries plainly: the bound is a statement about erasing or resetting the record, not a claim that the blurring itself costs work, and the crossover it describes is mean-field rather than critical. What it delivers is a clean, quantitative price for the everyday fact that the world has a definite causal order.
Making causal order definite is not free. A process that holds several orders in superposition is compelled to write into its future a record of which orders it superposed; wiping that record clean to leave a single definite order carries an unavoidable energy price. This paper shows that the price is set entirely by how many orders the process held, not by how strongly indefinite it was, and that it is at least the minimum amount of work physics demands to erase the corresponding amount of information. The paper identifies the entropy carried by the order record as the logarithm of the number of superposed orders, and then applies the classic principle that erasing information costs a minimum amount of work proportional to that entropy. Resetting the order to a definite value therefore dissipates at least that much work, a floor fixed by the order count alone. The paper shows that the environmental monitoring that makes order definite is precisely the process that writes and broadcasts the record: monitoring exports the full record entropy into the surroundings at the monitoring rate, so that afterwards erasing it to keep a single definite order dissipates at least the stated amount. Along the way the order-coherence plays the role of an order parameter for a smooth settling-down of the process, and the paper is careful to establish that this settling is a gentle, mean-field crossover with a finite response and no true critical point. The result puts the emergence of a definite causal order on a thermodynamic footing, and points in the opposite direction to the existing thermodynamics of indefinite order. That line of work asks whether the ordinary laws of heat are bent when order is superposed, and treats indefinite order as a useful resource; here indefinite order is instead a liability that must be paid off, and the question is the cost of removing it. The paper draws its boundaries plainly: the bound is a statement about erasing or resetting the record, not a claim that the blurring itself costs work, and the crossover it describes is mean-field rather than critical. What it delivers is a clean, quantitative price for the everyday fact that the world has a definite causal order.
It is now settled which indefinite-order processes can actually be built in the laboratory; the question this paper takes up is how expensive building one is, and it answers with a single cost measure that is intrinsic to the process, applies universally, and can be computed. The cost is the amount of control memory any realization must carry to keep the different orders straight. The paper bounds this memory from below by a quantity it reads off the process alone, the order rank, and shows that indefiniteness of order forces a permanent record of at least that size into the future of the process, a record no clever construction can hide. The paper defines the order rank of a process as the fewest separate future measurements whose blurring would render the process ordered, a definition that needs no reference to how the process is built. It then proves that the control memory of any realization can itself be blurred in a way that orders the process, so the memory can never be smaller than the order rank; indefinite order therefore compels information about which order occurred to be written into the global future, an unavoidable record. When the order is stored in a dedicated record subsystem, the order rank turns out to equal a standard measure of how entangled that record is with the rest, so an ordered process is exactly one whose record is unentangled, and a single averaged measurement can read the number of superposed orders straight off a process. This yields a full ladder of processes graded by how many orders they mix. For the switchable process on many parties the orders are perfectly distinguishable and the cost is exactly the number of possible orderings, which grows faster than exponentially; and every intermediate cost is achieved by some process. The order rank is faithful, unchanged by local rearrangement, strictly reduced by throwing away a party, and independent of the separate noise-robustness measure, as a purely classical but maximally robust example makes plain. The contribution is a clean, computable price tag for indefinite causal order and a theorem that this price cannot be evaded: a nonseparable process must broadcast a record of its orders into the future, of a size fixed by the order rank. By identifying that rank with a familiar entanglement measure of the record, the paper connects the cost of indefinite order to well-understood mathematics and supplies a single-measurement way to certify it. It also draws a careful line, showing that the order rank and the more commonly used noise-robustness are two genuinely different resources rather than two names for one, so that a process can be highly robust yet cheap, or costly yet fragile.
Quantum theory permits processes with no definite order of operations, yet the everyday world has a perfectly definite one that everybody agrees on. This paper explains the gap with the same mechanism physics already uses to explain why the world looks classical at all: the environment quietly monitors a system and, in doing so, singles out a preferred set of stable alternatives and stamps redundant copies of the outcome all around. Applied to the order of operations, this monitoring selects definite orders as the surviving, stable possibilities and drives every process toward having a definite order. Because the order is copied into many parts of the surroundings, it becomes objective, a fact that independent observers each read off separately and agree upon. The paper makes the argument in four steps. First, it lets an environment gently blur the order information of the simplest indefinite process and shows that a certificate of indefiniteness weakens and crosses over to zero at a definite time, after which the process is ordered; the ordered set, once reached, is never left again, which is the mark of a genuine selection rule. Second, it proves a selection theorem for the switchable process: a standard criterion picks out the two definite orders as the stable survivors, and does so for any environment that couples through the physical thing that sets the order, not merely for one specially chosen coupling; the resulting blurring turns the process into a plain mixture of the two definite orders. Third, when many independent fragments of the environment each record the order, the order is broadcast redundantly, so it becomes objective in the precise sense that separate observers reading separate fragments all agree without disturbing the process; the order-coherence the process loses is exactly the order-information the environment gains. Fourth, it computes the blurring rate from concrete physical environments and turns it into a sharp observability threshold in terms of mass, separation, surrounding vacuum, and available time, which for proposed gravitational versions of the experiment becomes a crossover mass above which indefinite order could still be seen. The payoff is a physical account of why the large-scale world is causally definite and why observers agree about the order of events: definite causal order is einselected and then redundantly broadcast, exactly as a classical fact is. The paper is careful about scope, distinguishing the moment a process first becomes ordered from the later, fully settled state in which the order has been completely resolved and copied, and noting that macroscopic order-markers sit far inside the definite regime. By tying the disappearance of indefinite order to a computable environmental rate, it converts a foundational puzzle into a concrete experimental threshold that says when indefinite order should, and should not, be observable.
Landauer's principle prices forgetting, and finite-time thermodynamics prices speed, a cost that patience removes. Neither prices order: a machine that computes in time must let some outputs go before later inputs arrive, and can then no longer use them to clean up. This letter shows that order has its own work price, which no patience removes, and gives it exactly. One entropy-plus-energy functional gives the optimal rate of deterministic work, over many uses at vanishing error, for a broad class of schedules of arrivals, releases and loans, and for devices that give back what they borrow, with its energy and entropy. At a fixed state, the price of releasing is the price of correlations whose partners have left. Together with results of the companion papers, the law settles three questions. Does answering promptly cost more? For memoryless channels, only if they are quantum. Can one decide whether a channel is free? Yes when outputs may be held, and no when they must be released. What does keeping time cost? A clock that must come back supplies phase but no net energy, so in batch, thermal operations with a returned clock do not reach the capacity of every channel, and a process can cost more than its time reverse. The price is testable: a two-qubit process that is free when held costs at least 0.87 kT ln 2 per episode at 1% error when its first output must leave early and the controller and battery budgets total at most 0.025 (energies in kT ln 2, entropies in bits); certifying the budgets is the remaining step. The letter summarizes four papers, which give the full proofs and carry the machine checks: The price of time order (doi:10.5281/zenodo.23310622); Only quantum channels save work by waiting (doi:10.5281/zenodo.23310624); The work cost of answering in real time (doi:10.5281/zenodo.23310628); The price of keeping time (doi:10.5281/zenodo.23310632). This record archives the letter, its TeX source and its build script. How the work was done, including the use of AI models, is described in the letter.
This paper develops an interpretive account of the physical life cycle of records within a consistency-history framework. Earlier papers in the series characterized a committed record as “decoherence- and thermodynamics-protected, append-only in practice.” The present paper refines and partially corrects that formulation. A physical record is not logically immutable or fundamentally append-only. It is revision-resistant in practice insofar as its information is encoded in sufficiently protected physical degrees of freedom, often—but not universally—through metastability and free-energy barriers. The central claim is structural and deliberately deflationary: there is no single thermodynamic price of a record. Record formation, passive retention, revision, logically irreversible reset, active error correction, and redundant proliferation are distinct processes with different, implementation-dependent demands. The paper therefore replaces a scalar cost with a physical record profile comprising resources, performance, and architecture: free-energy and dissipation budgets, control resources, operation and retention times, error rates, and an effective number of sufficiently independent carriers or access channels. Landauer’s principle directly constrains the logically irreversible reset component of this profile. Other record processes inherit a Landauer-type constraint only when their implementation contains a reset or another logically irreversible information-discarding step. The formation of a classical record is represented as the logically reversible, in-principle correlation of distinguishable pointer states with an initially prepared memory. This is not the cloning of an arbitrary unknown quantum state, and a complete reusable memory cycle must still account for preparation and reset. The paper further distinguishes logical commitment, physical durability, and public finality. Public finality requires an operationally significant redundancy of sufficiently independent, accessible, and durable carriers or access channels. This is an architectural requirement, not a universal additive heat cost per copy. Environmental amplification may generate redundant records without implying a universal Landauer-type price for each environmental fragment. The framework derives no result in thermodynamics or statistical mechanics. It does not derive the second law, the Landauer bound, any fluctuation theorem, the thermodynamic arrow of time, or the low-entropy boundary conditions of the universe, and it makes no independent empirical prediction. Its contribution is a disciplined decomposition of the physical processes through which records are formed, protected, revised, erased, maintained, and made publicly accessible.
Quantum theory allows processes in which the order of two operations is not fixed but held in superposition, and this indefiniteness of order behaves like a resource, something a process can have more or less of and that cannot be created for free. The question a resource theory answers last is whether the resource can be spent and fully recovered without loss, and whether there is a stubborn form of it that is present yet useless. This paper answers both questions for the simplest family of such processes. Handled one copy at a time, indefinite order is wasteful and cannot be recovered, with a single special exception; but handled in bulk, many copies together, it becomes perfectly recyclable, and no useless-but-present form exists. The paper works on a two-dial family of processes that runs from a plainly ordered process to the most order-indefinite one. It first computes exact measures of how much indefiniteness each member carries, defined by how much ordinary noise must be stirred in to wash the indefiniteness out, and from these reads off the one-time price of manufacturing the resource. It then shows the whole family behaves like a single effective quantum bit whose ordered, well-behaved region is a diamond-shaped set, which makes the recoverable content exactly calculable. The central finding is a sharp split: for every indefinite process except one special pure case, the price to make it is strictly more than what can ever be recovered from it, so one copy at a time the resource is irreversibly wasteful; the lone pure case is the unique point where price and yield coincide. Placing the theory inside the standard framework for reversible resources, and checking that the ordered set is convex, stays ordered when copies are combined, and contains the most featureless process, the paper proves that in the many-copy limit the resource turns reversible, its bulk cost matching its bulk yield, with no stubborn leftover form. The recyclable rate of the special unit is a definite number of bits. The wider message is that indefinite causal order sits alongside the other familiar quantum resources, such as entanglement: it is wasteful to spend one unit at a time yet efficient to trade in bulk, and it harbours no locked-away useless form. The paper is candid about the boundary of the claim, noting that the clean reversibility holds under the most permissive allowed operations, and that under more restricted, physically grounded operations the resource might instead behave irreversibly, a question left open. What it settles firmly is the surprising two-faced character of the resource, irreversible in the small and reversible in the large, on a family simple enough to compute everything exactly.
Two structural facts anchor the theory of indefinite causal order, and this paper proves both as explicit theorems and checks them line by line in a machine proof assistant. The first is a record fact: a process without a definite order must keep, on its control memory, a record of the orders it superposes, and erasing that record by blurring the control returns a plain mixture of definite orders. The second is a classification fact: on the canonical slice of processes, a single straight-line certificate decides exactly which processes are ordered and which are not. Working over an abstract algebra of order operators, so that each result holds in any faithful concrete model, the paper proves a short, connected set of statements. Blurring the order record always lands the process in the definite-order set, which is the mathematical heart of record-erasure. A process sits in that definite-order set exactly when it is unchanged by blurring, so that any surviving control coherence is an irreducible record. The number of orders a process populates is at most the size of its control memory, which is the record form of the memory cost studied elsewhere in the program. On the canonical slice the certificate takes a specific value that varies in a straight-line way across the slice, so that indefiniteness holds precisely on one side of a line, with an explicit decomposition into definite orders on the other side. And a tempting finer diagnostic built from the process's intrinsic flow is shown to over-count, because it tracks a product of the two dials rather than the true boundary. Every theorem is stated over an abstract ring so that it transfers to any faithful model, and every statement in the paper has been checked in a machine proof assistant with no assumptions beyond the three standard foundations of mathematics; the correspondence to the formal development is tabulated in an appendix. The contribution is a small, dependable, reusable core that turns the program's paper-level results about indefinite causal order into a durable, independently checkable formal library, and by forcing complete rigour it guards against hidden gaps of the kind that informal arguments can conceal. The paper is careful about scope, noting that the definite-order set reached by full blurring is contained in, but does not exhaust, the whole ordered set, and that the finer flow-based diagnostic is only a necessary sign of indefiniteness, not a sufficient one. What it secures is a machine-checked foundation on which the geometric, thermodynamic, and resource-theoretic parts of the program can safely rest.