Paper 10

The Joule Standard: A Unified Economics of Work, Trust and Intelligence

Synthesizes the program while preserving the limits of scalar comparison.

Abstract

Every economically organized process uses energy, but energy does not provide a natural unit for its consequences. A motor produces mechanical work. An inference system produces candidate task service whose usefulness depends on correctness, adoption, and causal realization. A proof-of-work system expends energy in a protocol that may change settlement risk under a named threat model. A national account records production flows, not all useful outcomes and not the stocks those outcomes protect. This paper synthesizes a ten-paper research program into a common measurement architecture without collapsing these objects into one score. The Joule Standard is a typed, vector-valued account. Its common denominator is a declared, non-overlapping energy inventory. Its numerators retain their native semantics and units. A boundary manifest fixes the functional unit, physical system, time, location, counterfactual, energy stage, allocation rules, outcome functional, attribution rule, uncertainty model, and exclusions. A transduction graph then distinguishes physical efficiency, exergy or useful work, verified service, causal economic realization, avoided loss, settlement assurance, and quality-adjusted machine intelligence. Exact interface matching permits stage yields to compose. Semantic labels do not.

Four formal results govern aggregation. First, addition is undefined for quantities that differ in semantic type, unit, stock-flow status, boundary, or horizon. Second, non-dominating outcome vectors admit opposing rankings under admissible positive weights, so energy normalization cannot reveal a universal scalar order. Third, a strictly positive, monotone scalarization can select a Pareto-efficient allocation, but unsupported frontier points need not be recoverable without convexity. Fourth, adding primary energy, conversion output, and final energy as independent inputs repeats a physical lineage. Related accounting controls prevent AI output already recorded in value added and protected asset stocks from being added to gross domestic product.

The paper supplies a crosswalk for the equations and notation of Papers 1 through 9, a boundary map, incompatibility and double-counting audits, a falsification and identification agenda, and precise nonclaims. A deterministic standard-library Python implementation preserves exact decimal arithmetic, rejects binary floats at public numeric boundaries, computes typed transduction paths and Pareto frontiers, and tests adversarial substitutions. The proposed standard is therefore a discipline for asking what a joule becomes under declared conditions. It is not an energy theory of value, a conversion of trust or intelligence into thermodynamic units, or a universal league table.

The synthesis problem

The phrase “value per joule” invites a scalar. The research program developed in Papers 1 through 9 reaches a different conclusion. A common physical resource can organize comparisons, budgets, and marginal allocation without making the resulting services commensurate. Joules can be counted across a declared energy boundary. Mechanical work, verified task service, reliability, expected avoided loss, settlement risk, value added, welfare, and asset exposure cannot simply be counted together.

This distinction matters because energy normalization often hides a change of question. A device-level efficiency experiment asks how much physical output follows from a measured input. A deployment study asks whether a service was useful outside the laboratory. A causal evaluation asks what changed relative to a counterfactual. A settlement study asks how a protocol changes the distribution of attack costs or losses under an adversary model. A national account asks which production flows occurred within an accounting period. The denominator may be expressed in joules in every case, but neither the numerator nor the inferential claim is the same.

The Joule Standard proposed here has three layers.

  1. A typed physical ledger records energy stages and prevents the same physical lineage from entering a total more than once.

  2. A transduction record follows energy through physical work, computation, service, adoption, causal realization, or assurance. Every edge states its evidence status.

  3. A decision view retains a vector of native outcomes, removes dominated allocations, and permits scalarization only after normalization, orientation, and weights are published.

The common theory is therefore a theory of disciplined interfaces. It says when a ratio is interpretable, when two ratios are directly comparable, when stage yields compose, when an addition is legal, and which judgments enter an allocation decision. It does not say that all economically valuable order is a single physical substance.

Research question

The synthesis asks:

Can work, machine intelligence, settlement assurance, and economic realization share one energy-normalized accounting architecture while retaining their different meanings, units, causal requirements, and institutional boundaries?

The answer is yes for a typed vector account and no for an undeclared scalar account. This answer follows from the foundations in Paper 1, the typed transduction graph in Paper 2, the task-service measure in Paper 3, the scenario-conditioned assurance account in Paper 4, the causal inference chain in Paper 5, the marginal allocation model in Paper 6, the rebound identity in Paper 7, the grid-market model in Paper 8, and the satellite-account structure in Paper 9 [1, 2, 3, 4, 5, 6, 7, 8, 9].

Contributions

The paper makes six synthesis contributions.

  1. It defines a type system for energy flows, physical services, task services, money flows, money stocks, probabilities, rates, and indices.

  2. It specifies a boundary manifest that is common across the nine application papers and separates physical scope from causal attribution.

  3. It proves non-addition, non-aggregation, composition, and Pareto-selection results and states the assumptions that limit each result.

  4. It publishes an equation and notation crosswalk so that a symbol used in one application cannot silently acquire another meaning in the synthesis.

  5. It joins physical-lineage and national-account controls in one double-counting audit.

  6. It supplies executable reference code and adversarial tests for the generic rules rather than hard-coding any paper-specific answer.

Precise nonclaims

The Joule Standard makes the following twenty nonclaims explicit.

  1. Joules are not a currency, utility unit, welfare unit, or conserved quantity of value.

  2. Energy alone does not determine price, intelligence, legitimacy, trust, or social order.

  3. Exergy does not extend to semantic value without a task, observer, institution, and value functional.

  4. Tokens are not useless operational measures. They remain useful under a fixed tokenizer and service contract, but they are not stable value units.

  5. QAIJ\operatorname{QAIJ} is neither general intelligence nor realized economic value.

  6. Aggregate proof-of-work energy does not identify security, attack cost, censorship resistance, or losses prevented.

  7. Waiting for confirmations does not necessarily cause proportional network energy use.

  8. Gross protected exposure is not settlement output or value added.

  9. Observed revenue per joule does not identify causal productivity.

  10. A causal ratio with a weak or zero energy effect need not have a stable finite interpretation.

  11. A high average value per joule does not identify the best recipient of the next joule.

  12. The marginal-allocation rule does not automatically apply under market power, nonconvexity, omitted constraints, or unknown response curves.

  13. Efficient AI does not necessarily lower or raise total energy.

  14. Flexible computation is not automatically beneficial to the grid.

  15. Direct-current power flow or reserve headroom does not prove voltage, frequency, or dynamic stability.

  16. Settlement closure does not prove price formation, truthful bidding, or social optimality.

  17. A value-per-joule satellite account neither replaces nor enlarges GDP.

  18. Primary, final, operational, and lifecycle energy are not additive stages.

  19. Equal weights do not create a politically neutral composite.

  20. Passing code tests does not upgrade empirical or causal claims to mathematical proof.

Prior foundations and intellectual boundary

Energy productivity, exergy, and useful work

Energy productivity and energy intensity are established indicators. Patterson distinguishes thermodynamic, physical, economic-thermodynamic, and economic measures, showing that the label “efficiency” does not fix a numerator or boundary [10]. Ayres and Warr place useful work in historical production analysis, while Warr and coauthors construct long-run useful-work series [11, 12]. Exergy analysis asks how much useful work a system could obtain as it approaches equilibrium with a reference environment. It is indispensable for locating physical irreversibility. It does not determine whether the resulting service is wanted, correct, adopted, or welfare improving.

That boundary is important. Let EbeE_b^e denote an energy input, XexX^{\mathrm{ex}} the exergy carried by that input relative to a reference environment, and UworkU^{\mathrm{work}} useful physical work. Then physical measures such as Uwork/EbeU^{\mathrm{work}}/E_b^e or Uwork/XexU^{\mathrm{work}}/X^{\mathrm{ex}} compare commensurate physical quantities. A monetary realization ΔV/Ebe\Delta V/E_b^e requires prices or another value functional, a baseline, and an attribution design. Replacing UworkU^{\mathrm{work}} by ΔV\Delta V is not a unit conversion. It changes the object being measured.

Information, computation, and physical limits

Shannon’s information measure concerns uncertainty in messages, not semantic usefulness [13]. Landauer identifies a thermodynamic cost for logically irreversible operations under stated physical conditions [14]. These results motivate a careful connection between energy and computation, but neither provides an economic valuation of an inference. A token may carry different semantic content under different tokenizers. A correct answer may be useless because it arrives late, cannot be verified, or is not adopted. A useful answer may have large economic effects in one context and none in another.

Machine-learning evaluation has accordingly moved beyond raw throughput. Benchmark suites report accuracy, robustness, calibration, latency, and system performance under declared tasks and hardware [15, 16]. Paper 3 uses those ideas to define a quality-adjusted task service. Paper 5 then adds adoption and causal realization. The synthesis preserves this separation: quality adjustment is still not a welfare functional.

Settlement, assurance, and adversarial systems

Nakamoto’s proof-of-work construction joins a chain-selection rule to an economic cost of rewriting history [17]. Formal analyses give security properties under explicit network and adversary assumptions [18]. Economic analyses show that attack incentives depend on rewards, rents, market structure, outside options, and the value at risk [19]. Energy expenditure is one input to a security mechanism. It is not a complete measure of censorship resistance, finality, decentralization, or expected loss.

Paper 4 therefore treats assurance as a vector and permits avoided loss per joule only for a matched intervention under a named scenario. This synthesis retains that constraint. The scalar ALPJ\operatorname{ALPJ} is a conditional monetary decision statistic, not a physical law and not a synonym for trust.

Causal effects and accounting boundaries

An incremental economic numerator is a counterfactual contrast. Potential outcomes distinguish such effects from observed differences [20, 21, 22]. When the denominator is itself an estimated intervention effect, a ratio of effects can become weakly identified near zero. Paper 5 makes this issue explicit and recommends joint uncertainty sets or Fieller-type logic rather than mechanically dividing two noisy point estimates.

At economy scale, the SNA records production flows and the SEEA connects physical environmental flows to economic accounts [23, 24, 25]. Gross supply-use tables may show a primary carrier, its conversion output, and final use. Those appearances are useful for balancing accounts, but their sum is not a total energy input. Paper 9 contributes an energy-stage bridge and keeps AI outcomes and settlement assurance in memorandum panels. The present paper turns that architecture into a general typed audit.

Composite indicators and social choice

Composite indicators require normalization, weights, aggregation, and sensitivity analysis [26]. Equal weights are still weights. A data-derived weighting method encodes a statistical criterion rather than discovering a natural social objective. More broadly, heterogeneous welfare dimensions cannot be ordered without assumptions about standing, tradeoffs, and aggregation [27, 28]. Energy normalization does not remove those assumptions. It changes the resource basis of the comparison.

Measurement objects

The boundary manifest

Paper 1 defines a measurement tuple =(b,c0,W,τH,econv,aattr,Πunc),VPJ(s)=𝔼Πunc[ΔW(sc0)]Ebeconv(s;τH).\mathcal M=(b,c_0,W,\tau_H,e^{\mathrm{conv}}, a^{\mathrm{attr}},\Pi^{\mathrm{unc}}), \qquad \operatorname{VPJ}_{\mathcal M}(s) =\frac{\mathbb{E}_{\Pi^{\mathrm{unc}}}[\Delta W(s\mid c_0)]} {E_b^{e^{\mathrm{conv}}}(s;\tau_H)}. \label{eq:paper1} The synthesis expands this tuple into an operational manifest. For a study rr, define 𝔐r=(funit,psystem,τH,geo,c0,stageE,ashared,ifailure,membodied,W,aattr,Πunc,zexclude),\mathfrak M_r= (f^{\mathrm{unit}},p^{\mathrm{system}},\tau_H,\ell^{\mathrm{geo}}, c_0,stage^E,a^{\mathrm{shared}},i^{\mathrm{failure}}, m^{\mathrm{embodied}},W,a^{\mathrm{attr}},\Pi^{\mathrm{unc}}, z^{\mathrm{exclude}}), \label{eq:manifest} The entries are, in order, the functional unit, physical system, temporal interval, location, counterfactual, energy stage, shared-infrastructure rule, idle and failure rule, embodied-energy scope, outcome functional, attribution rule, uncertainty model, and exclusions.

Every denominator is accompanied by the record DE=(stage,physical boundary,geography,interval,allocation,idle/failure treatment,embodied scope,lineages).\begin{aligned} D_E=(\,&\text{stage},\text{physical boundary},\text{geography}, \text{interval},\\ &\text{allocation},\text{idle/failure treatment}, \text{embodied scope},\text{lineages}). \end{aligned} \label{eq:denominatorrecord} An equation that uses a short symbol EE inherits this record from its manifest. The short symbol is typography, not permission to omit the fields.

The expansion does not change the theory in Paper 1. It makes recurrent implementation choices explicit. A direct comparison between two reported ratios passes the boundary gate only if the relevant fields match or a documented bridge maps one field to the other. A common string such as “facility energy” is not a bridge. The analyst must show that metering, allocation, time, location, and inclusion rules align.

Definition 1 (Direct comparability). Two measurements rr and rr' are directly comparable when their functional units, physical systems, time intervals, locations, counterfactuals, energy stages, infrastructure allocations, idle and failure rules, embodied scopes, outcome functionals, attribution rules, and uncertainty models match, and their exclusions are identical. A bridged comparison is a different object and must report the bridge transformation and its uncertainty.

Proposition 2 (Typed comparison class). Direct comparability is an equivalence relation within a fixed functional unit and manifest. A comparison across classes is valid only through a documented order-preserving bridge for the reported claim.

Proof. Equality of the required manifest fields is reflexive, symmetric, and transitive. A bridge supplies a new mapped object; without it, at least one field differs and the objects lie in different classes. Requiring the bridge to preserve the order relevant to the claim prevents a unit transformation from being mistaken for an arbitrary reranking. ◻

Estimand-family tags

Identical printed units can conceal different mathematical objects. Every energy-normalized result in the synthesis therefore carries one of six estimand-family tags:

Level intensity.

I=X/EbeI=X/E_b^e, where Ebe>0E_b^e>0 is a matched inventory. Paper 1’s basic VPJ\operatorname{VPJ} is in this family when its expected numerator is divided by a fixed positive inventory.

Ratio of expectations.

IRE=𝔼[X]/𝔼[Ebe]I_{\mathrm{RE}}=\mathbb{E}[X]/\mathbb{E}[E_b^e]. Paper 3’s QAIJ\operatorname{QAIJ} is in this family.

Mean of unit ratios.

IMR=𝔼[X/Ebe]I_{\mathrm{MR}}=\mathbb{E}[X/E_b^e]. This is generally not IREI_{\mathrm{RE}}.

Causal ratio of effects.

θcausal=ΔVATE/ΔEATE,b\theta^{\mathrm{causal}} =\Delta_V^{\mathrm{ATE}}/\Delta_E^{\mathrm{ATE},b}, where both effects describe the same intervention. The denominator can be positive or negative and the ratio does not exist at zero.

Marginal derivative.

mi,n,t=Bi/ei,n,tm_{i,n,t}=\partial B_i/\partial e_{i,n,t}, evaluated at an operating point under constraints. This is not an average intensity.

Descriptive national intensity.

A matched period production or outcome flow divided by a matched period energy flow. This is not causal absent a separate design.

Proposition 3 (Estimand-family non-equivalence). A positive level intensity, ratio of expectations, mean of unit ratios, causal ratio of effects, and marginal derivative are generally unequal. They can have different signs and existence conditions.

Proof. For two units with outcomes (0,8)(0,8) and energies (2,8)(2,8), the ratio of means is 8/10=0.88/10=0.8, while the mean of ratios is (0/2+8/8)/2=0.5(0/2+8/8)/2=0.5. For a value function with V(10)=100V(10)=100 and V(11)=101V(11)=101, average value at 1010 J is 1010 per J while the local finite slope is 11 per J. An intervention can save energy, giving ΔEATE,b<0\Delta_E^{\mathrm{ATE},b}<0, even though every gross inventory is positive. At ΔEATE,b=0\Delta_E^{\mathrm{ATE},b}=0, the causal ratio is undefined. These constructions establish non-equivalence, possible sign differences, and different domains. ◻

Typed quantities

An amount alone is not enough for an accounting operation. The synthesis type of a quantity ξ\xi is type(ξ)=(σ,u,k,b,τ),\operatorname{type}(\xi) =(\sigma,u,k,b,\tau), \label{eq:type} where σ\sigma is its semantic name, uu its unit, kk its accounting kind, bb its boundary identifier, and τ\tau its horizon identifier.

The accounting kinds used here are energy flow, physical service, task service, money flow, money stock, probability, rate, and index. “USD” does not erase the distinction between a flow of value added during a quarter and a protected asset stock at quarter end. “Count” does not erase the distinction between generated tokens and verified completed tasks. “Joule” does not erase the distinction between primary supply, conversion output, final energy, facility operation, and a lifecycle inventory.

Definition 4 (Typed addition). For quantities ξ1,,ξn\xi_1,\ldots,\xi_n, the sum iξi\sum_i \xi_i is defined in the Joule Standard only if type(ξ1)==type(ξn).\operatorname{type}(\xi_1)=\cdots=\operatorname{type}(\xi_n). \label{eq:addition} The equality includes semantic type, unit, accounting kind, boundary, and horizon.

Theorem 5 (Non-addition of heterogeneous outcomes). If two quantities differ in at least one component of type(ξ)\operatorname{type}(\xi), their addition is undefined in the typed algebra. No multiplication or division by a common energy quantity makes the addition defined.

Proof. Typed addition is defined only on a common carrier. Suppose type(ξ1)type(ξ2)\operatorname{type}(\xi_1)\ne\operatorname{type}(\xi_2). Division by the same positive energy EbeE_b^e appends a common denominator unit and boundary but preserves the unequal numerator types. Thus type(ξ1/Ebe)type(ξ2/Ebe)\operatorname{type}(\xi_1/E_b^e)\ne \operatorname{type}(\xi_2/E_b^e). The premise for addition still fails. A mapping into a common scalar space can be supplied, but that mapping is an additional value functional, not a consequence of energy normalization. ◻

Remark 6. The theorem is intentionally syntactic. It prevents an analyst from claiming that an undeclared sum already has meaning. It does not prohibit a declared model that maps different inputs to a common welfare, cost, or index space. Such a model must publish its assumptions and is evaluated separately.

Energy stages and physical lineage

For an energy component jj, record 𝔢j=(idj,χjlineage,stagejE,Ej),\mathfrak e_j=(\text{id}_j,\chi_j^{\mathrm{lineage}}, stage_j^E,E_j), where χjlineage\chi_j^{\mathrm{lineage}} is a physical-lineage identifier and stagejEstage_j^E is an energy stage. The standard distinguishes device operational, system operational, facility operational, uniquely allocated embodied increment, lifecycle, primary, conversion output, final, and marginal-grid energy. A total is legal only over a non-overlapping set of lineages at a coherent stage.

Consider 100100 J of primary fuel entering a converter that produces 3535 J of electricity, of which 3232 J reaches final use. A physical supply-use table may display all three entries. The energy input is not 167167 J. The entries are linked stages of one lineage. A bridge may report conversion loss 6565 J and network loss 33 J, but the stages are not independent resources.

Theorem 7 (Transformation-lineage double counting). Let a transformation chain have primary input Eprimary,supplyE_{\mathrm{primary,supply}}, conversion output OenergyO_{\mathrm{energy}}, and final use Efinal,useE_{\mathrm{final,use}}, with 0Efinal,useOenergyEprimary,supply0\le E_{\mathrm{final,use}}\le O_{\mathrm{energy}} \le E_{\mathrm{primary,supply}}. If the three entries carry one physical lineage, then their sum repeats that lineage. A non-overlapping input total chooses one stage or uses a bridge identity, such as Eprimary,supply=Efinal,use+(Eprimary,supplyOenergy)+(OenergyEfinal,use).E_{\mathrm{primary,supply}} =E_{\mathrm{final,use}} +(E_{\mathrm{primary,supply}}-O_{\mathrm{energy}}) +(O_{\mathrm{energy}}-E_{\mathrm{final,use}}). \label{eq:bridge}

Proof. The amount OenergyO_{\mathrm{energy}} is produced from a subset of the energy represented by Eprimary,supplyE_{\mathrm{primary,supply}}, and Efinal,useE_{\mathrm{final,use}} is delivered from a subset of OenergyO_{\mathrm{energy}}. They are not disjoint inputs. The right side of the equation partitions the lineage into final use and two loss terms. Adding the three stage levels instead contains delivered energy three times, conversion loss once, and network loss twice. ◻

Proposition 8 (Denominator non-substitution). Device, system-wall, facility-operational, embodied-increment, lifecycle, primary, final, and marginal-grid energy are distinct denominator types. Equality of their joule units is insufficient for substitution. A valid bridge must identify the physical lineage, additions, losses, allocation, geography, and interval without overlap.

Proof. Each denominator differs in at least one stage or boundary component of the first equation and the last equation. Typed substitution therefore fails. A bridge may map between them, but 7 requires the mapped physical components to form a non-overlapping partition. ◻

Physical efficiency and economically realized value

The accepted program contains two local AI chains that use OO, UU, and TT differently. The synthesis resolves that collision with the canonical optional-node graph EbeCnamedOemitU𝒫AadoptΔ𝒐c0W(Δ𝒐c0).E_b^e \longrightarrow C_{\mathrm{named}} \longrightarrow O_{\mathrm{emit}} \longrightarrow U_{\mathcal P} \longrightarrow A^{\mathrm{adopt}} \longrightarrow \Delta\mathbf o_{c_0} \longrightarrow W(\Delta\mathbf o_{c_0}). \label{eq:canonicalchain} Here OemitO_{\mathrm{emit}} is immediate output and U𝒫U_{\mathcal P} is a verified useful outcome under protocol 𝒫\mathcal P. For a token-emitting system, the representation statistic Tκtok=|κ(Oemit)|T_{\kappa}^{\mathrm{tok}} =\left|\kappa(O_{\mathrm{emit}})\right| \label{eq:tokenattachment} is attached to the immediate-output node. It is not substituted for that node and does not become the verified outcome. An adoption node can be bypassed only by a named bridge that explains why produced service equals institutionally used service in the application.

Not every application uses every node. A physical-work branch is EbeXexUworkdelivered physical serviceΔ𝒐c0.E_b^e\longrightarrow X^{\mathrm{ex}}\longrightarrow U^{\mathrm{work}}\longrightarrow\text{delivered physical service} \longrightarrow\Delta\mathbf o_{c_0}. A proof-of-work branch proceeds from hashing energy through hashrate, productive share, protocol rules, a named risk measure, economic deterrence, and a loss model. A grid branch proceeds from power integrated over an interval to feasible dispatch, reserve, and cash settlement. The point is not to force one causal graph on every system. It is to prevent a jump from an upstream observable to a downstream claim without a declared edge.

Typed transduction

Interface composition

Paper 2 represents an economy as a typed transduction graph. For a path X0int𝒯1stageX1int𝒯2stage𝒯nstageXnint,X_0^{\mathrm{int}}\xrightarrow{\mathcal T_1^{\mathrm{stage}}} X_1^{\mathrm{int}}\xrightarrow{\mathcal T_2^{\mathrm{stage}}}\cdots \xrightarrow{\mathcal T_n^{\mathrm{stage}}}X_n^{\mathrm{int}}, define a stage yield ykstage=Xkint/Xk1inty_k^{\mathrm{stage}}=X_k^{\mathrm{int}}/X_{k-1}^{\mathrm{int}} only after the output of 𝒯k1stage\mathcal T_{k-1}^{\mathrm{stage}} matches the input of 𝒯kstage\mathcal T_k^{\mathrm{stage}} in amount and type. Then XnintX0int=k=1nykstage.\frac{X_n^{\mathrm{int}}}{X_0^{\mathrm{int}}} =\prod_{k=1}^{n}y_k^{\mathrm{stage}}. \label{eq:composition}

Proposition 9 (Exact typed composition). If every adjacent interface has identical semantic type, unit, accounting kind, boundary, horizon, and amount, then the equation holds exactly for a deterministic path with positive intermediate inputs.

Proof. The product telescopes: k=1nXkintXk1int=X1intX0intX2intX1intXnintXn1int=XnintX0int.\prod_{k=1}^{n}\frac{X_k^{\mathrm{int}}}{X_{k-1}^{\mathrm{int}}} =\frac{X_1^{\mathrm{int}}}{X_0^{\mathrm{int}}} \frac{X_2^{\mathrm{int}}}{X_1^{\mathrm{int}}}\cdots \frac{X_n^{\mathrm{int}}}{X_{n-1}^{\mathrm{int}}} =\frac{X_n^{\mathrm{int}}}{X_0^{\mathrm{int}}}. Exact interface equality makes each cancellation a cancellation of the same typed quantity. Without that equality, the written cancellation is only a symbolic resemblance. ◻

Proposition 10 (Optional-node transduction). Any selected path through the equation composes exactly only when its adjacent typed amounts match and no branch charges a shared input more than once. The token statistic in the equation can enter a token-specific stage, but it cannot replace OemitO_{\mathrm{emit}}. An omitted adoption node requires a declared type-preserving bridge.

Proof. Exact path composition follows from 9. A duplicated branch violates lineage uniqueness. Token count and emitted content have different semantic types, so substitution violates interface equality. The same argument applies to a silent relabeling of produced service as adopted service. ◻

Proposition 11 (Stochastic nonfactorization). Pathwise stage yields telescope, but in general 𝔼[kYk]k𝔼[Yk].\mathbb{E}\!\left[\prod_kY_k\right]\ne\prod_k\mathbb{E}[Y_k].

Proof. Let Y1=Y2=0Y_1=Y_2=0 with probability 1/21/2 and Y1=Y2=2Y_1=Y_2=2 with probability 1/21/2. Then 𝔼[Y1Y2]=2\mathbb{E}[Y_1Y_2]=2, while 𝔼[Y1]𝔼[Y2]=1\mathbb{E}[Y_1]\mathbb{E}[Y_2]=1. The pathwise product remains exact in each state. The failure arises from dependence, not from cancellation. ◻

Correlation, selection, missingness, and endogenous adoption therefore matter. The reference implementation composes exact observed or modeled stages. It does not infer stochastic independence.

Evidence-labeled edges

Each transduction edge carries one of four labels.

PROVED

A definition or algebraic consequence follows from stated assumptions.

COMPUTATIONAL

An exact fixture or tested algorithm produces the result.

CONDITIONAL

The interpretation depends on an empirical design, scenario, or behavioral assumption.

OPEN

The relevant edge is proposed but not identified by the available evidence.

An energy meter can support a computational statement about facility electricity. A benchmark can support a conditional statement about verified task service on its sampled task distribution. Neither alone identifies economic value. The service-to-adoption and adoption-to-outcome edges need their own evidence. This prevents evidence from flowing farther down a graph than the design supports.

For terminal claims, the synthesis publishes the evidence-status vector 𝒔ev=(algebra,code,measurement,identification,transport,normative aggregation).\mathbf s_{\mathrm{ev}} =(\text{algebra},\text{code},\text{measurement}, \text{identification},\text{transport},\text{normative aggregation}). \label{eq:evidencevector} For example, a tested avoided-loss calculation may have 𝒔ev=(PROVED,COMPUTATIONAL,CONDITIONAL,OPEN,OPEN,CONDITIONAL).\begin{aligned} \mathbf s_{\mathrm{ev}}=(&\mathrm{PROVED},\mathrm{COMPUTATIONAL}, \mathrm{CONDITIONAL},\\ &\mathrm{OPEN},\mathrm{OPEN},\mathrm{CONDITIONAL}). \end{aligned} A proved algebra coordinate never upgrades an open identification coordinate.

For a composed transduction path, the reference implementation uses the conservative stage-status order PROVEDCOMPUTATIONALCONDITIONALOPENOBSTRUCTED.\begin{aligned} \mathrm{PROVED} &\prec\mathrm{COMPUTATIONAL} \prec\mathrm{CONDITIONAL}\\ &\prec\mathrm{OPEN} \prec\mathrm{OBSTRUCTED}. \end{aligned} \label{eq:evidencejoin} The path status is the join, which is the most limiting status present. Thus a COMPUTATIONAL meter edge followed by an OPEN service-to-value edge yields an OPEN terminal path. The multi-coordinate vector in the equation remains visible because stage status cannot substitute for measurement, identification, transport, or normative status.

The assurance branch

Settlement assurance is not naturally one scalar node. For protocol 𝒫settle\mathcal P^{\mathrm{settle}} and scenario ω\omega, define an assurance record 𝒜(𝒫settle,ω)=(αAhash,Prreorg,LossP,CostAnet,MA,𝒌),\mathcal A(\mathcal P^{\mathrm{settle}},\omega) =\bigl(\alpha_A^{\mathrm{hash}},Pr^{\mathrm{reorg}}, Loss_P,Cost_A^{\mathrm{net}},M_A,\mathbf k\bigr), \label{eq:assurancevector} where αAhash\alpha_A^{\mathrm{hash}} is effective adversarial share, PrreorgPr^{\mathrm{reorg}} a named reorganization risk, LossPLoss_P loss conditional on success, CostAnetCost_A^{\mathrm{net}} modeled net private attack cost, MAM_A attack margin, and 𝒌\mathbf k non-energy constraints. Each component keeps its own unit.

Paper 4 locally declares both an energy-account interval and a post-confirmation attack window. The synthesis names them τEhash\tau_E^{\mathrm{hash}} and τAattack\tau_A^{\mathrm{attack}}. Hashing energy is EH(τEhash)=HHϵHJ/THτEhash.E_H(\tau_E^{\mathrm{hash}}) =H_H\epsilon_H^{\mathrm{J/TH}}\tau_E^{\mathrm{hash}}. \label{eq:hashenergy} Risk is evaluated over τAattack\tau_A^{\mathrm{attack}}. The restriction τEhash=τAattack\tau_E^{\mathrm{hash}}=\tau_A^{\mathrm{attack}} may be imposed for a particular fixture, but it is never implicit.

Paper 4’s LossPLoss_P is loss if the modeled event succeeds. Paper 9’s local “gross protected exposure” is instead an exposure XPgrossX_P^{\mathrm{gross}}. The synthesis relates them only through a declared loss severity sPloss[0,1]s_P^{\mathrm{loss}}\in[0,1]: LossP=XPgrosssPloss.Loss_P=X_P^{\mathrm{gross}}s_P^{\mathrm{loss}}. \label{eq:lossseverity} Treating the two as equal assumes 100100 percent severity.

A monetary avoided-loss ratio is permitted only for matched risks and a named incremental intervention: ALPJ(𝒫settle;ω)=LossP{Pr0reorg(ω)Pr1reorg(ω)}ΔEP,ΔEP>0.\operatorname{ALPJ}(\mathcal P^{\mathrm{settle}};\omega) =\frac{Loss_P\{Pr_0^{\mathrm{reorg}}(\omega) -Pr_1^{\mathrm{reorg}}(\omega)\}}{\Delta E_P}, \qquad \Delta E_P>0. \label{eq:alpj} The risk probabilities are matched under the baseline and intervention.

The expression is algebraically well defined. Its interpretation is CONDITIONAL. Equal energy does not imply equal risk, attack cost, decentralization, censorship resistance, or loss prevention. The protocol, network topology, hardware market, reward schedule, adversary, time horizon, and asset exposure all enter the scenario.

Proposition 12 (Assurance insufficiency). Equal proof-of-work energy can coexist with different hashrate, scenario risk, attack margin, and protected-loss outcomes. The ratio in the equation is causal only when its loss and energy increments arise from the same intervention.

Proof. Two miners can each use 100100 J while one uses hardware at 11 J/TH and the other at 22 J/TH, yielding 100100 TH and 5050 TH. Their effective shares and reorganization risks can therefore differ at equal energy. Propagation, access, rewards, and attacker benefit can further change risk and margin. The causal condition follows from 13: unmatched numerator and denominator contrasts do not define one intervention effect ratio. ◻

Quality-adjusted intelligence and causal realization

Task service rather than token volume

Paper 3 defines a quality-adjusted service contribution for task ii: sisvc=d̃itaskuisvcqiAIcicorrectαisvcilat,s_i^{\mathrm{svc}} =\widetilde d_i^{\mathrm{task}}u_i^{\mathrm{svc}}q_i^{\mathrm{AI}} c_i^{\mathrm{correct}}\alpha_i^{\mathrm{svc}}\ell_i^{\mathrm{lat}}, \label{eq:service} where d̃itask\widetilde d_i^{\mathrm{task}} is a normalized difficulty weight, uisvcu_i^{\mathrm{svc}} usefulness, qiAIq_i^{\mathrm{AI}} quality, cicorrectc_i^{\mathrm{correct}} correctness, αisvc\alpha_i^{\mathrm{svc}} reliability, and ilat\ell_i^{\mathrm{lat}} latency or timeliness. The factors and their scales must be declared. For evaluation protocol 𝒫eval\mathcal P^{\mathrm{eval}}, QAIJ𝒫eval=𝔼[i𝒫evalsisvc]𝔼[Ebe].\operatorname{QAIJ}_{\mathcal P^{\mathrm{eval}}} =\frac{\mathbb{E}[\sum_{i\in\mathcal P^{\mathrm{eval}}}s_i^{\mathrm{svc}}]} {\mathbb{E}[E_b^e]}. \label{eq:qaij}

The multiplicative form is a preregistered grading aggregation. It is not a physical conservation law and not the interface-cancellation identity in the equation. Raw task difficulty does not enter the dimensionless product without the declared normalization that produces d̃itask\widetilde d_i^{\mathrm{task}}.

This measure is not “intelligence” in the unrestricted psychological or philosophical sense. It is quality-adjusted service on a named task distribution, evaluated with declared scoring and energy boundaries. A tokenizer change can alter token count while leaving user-visible content unchanged. Verbosity can increase tokens without improving correctness or usefulness. Task mix can reverse system rankings. The task distribution is therefore part of the estimand.

Quality is not realized value

A high QAIJ\operatorname{QAIJ} can coexist with low realized value. The system may not be adopted, may be used for a low-stakes task, or may displace an equally good baseline. Paper 5’s local inference chain is translated into the canonical graph in the equation. Its token count is TκtokT_\kappa^{\mathrm{tok}}, its verified outcome is U𝒫U_{\mathcal P}, and its adoption node is AadoptA^{\mathrm{adopt}}. None of those nodes is silently renamed in the synthesis.

Paper 5 locally calls a component sum EiwallE_i^{\mathrm{wall}} while permitting a separate facility-overhead component. The synthesis does not inherit that label. It uses Eisystemwall=Eidevice+Eihost+Eimemory+Einetwork,inside,Eifacilityoperational=Eisystemwall+Eicooling+Eipowerconversion+Eishared,facility,\begin{aligned} E_i^{\mathrm{system-wall}} &=E_i^{\mathrm{device}}+E_i^{\mathrm{host}} +E_i^{\mathrm{memory}}+E_i^{\mathrm{network,inside}},\\ E_i^{\mathrm{facility-operational}} &=E_i^{\mathrm{system-wall}}+E_i^{\mathrm{cooling}} +E_i^{\mathrm{power-conversion}}+E_i^{\mathrm{shared,facility}}, \end{aligned} \label{eq:wallfacility} with component lineages checked for overlap. A general component sum is named Eioperational,bE_i^{\mathrm{operational},b}, where bb states which of these boundaries applies. Facility overhead is never hidden inside a quantity still labeled system-wall energy.

Let ΔVATE\Delta_V^{\mathrm{ATE}} be an intervention effect on realized value and ΔEATE,b\Delta_E^{\mathrm{ATE},b} its effect on operational energy at boundary bb. The causal value-per-energy estimand is θcausal=ΔVATEΔEATE,b,ΔEATE,b0.\theta^{\mathrm{causal}} =\frac{\Delta_V^{\mathrm{ATE}}}{\Delta_E^{\mathrm{ATE},b}}, \qquad \Delta_E^{\mathrm{ATE},b}\ne0. \label{eq:ratioeffects} Both effects must refer to the same intervention, boundary, counterfactual, horizon, and population. Dividing an observational revenue difference by a metered energy effect does not meet that condition.

The executable identification key is (intervention,boundary,counterfactual,horizon,population).(\text{intervention},\text{boundary},\text{counterfactual}, \text{horizon},\text{population}). \label{eq:identificationkey} Population is not inferred from the other four fields.

Proposition 13 (Matched causal ratio). The ratio in the equation is a causal effect ratio only if numerator and denominator identify effects of the same intervention against the same counterfactual over the same boundary, population, and horizon. If ΔEATE,b=0\Delta_E^{\mathrm{ATE},b}=0, the finite ratio is undefined. If ΔEATE,b\Delta_E^{\mathrm{ATE},b} is weakly separated from zero, ordinary delta-method intervals can be misleading.

Proof. The first claim follows from the definition of a ratio of intervention effects. Unmatched contrasts do not share an intervention estimand. Division by zero is undefined. Near zero, the ratio map is highly nonlinear, so uncertainty in the denominator can create unbounded or disjoint confidence sets. Joint inference or Fieller-type constructions are then required. ◻

Identification ladder

The synthesis uses an identification ladder rather than one evidence label for an entire system.

  1. Metering: identify operational energy for the declared physical boundary.

  2. Service evaluation: estimate correctness, usefulness, reliability, latency, and task difficulty on a declared task distribution.

  3. Adoption: observe whether the service enters the relevant workflow and whether failed attempts or retries are retained.

  4. Outcome effect: identify the counterfactual change in a physical, monetary, or welfare outcome.

  5. Attribution: allocate joint effects and shared burdens without adding the same outcome twice.

  6. External validity: state the population, time, and institutions to which the result may travel.

Failure at a lower rung does not invalidate observations above it, but it limits their interpretation. For example, a well-measured energy denominator and benchmark accuracy remain useful engineering evidence even when economic realization is OPEN.

The common vector

Definition

For a feasible system or allocation ss under manifest \mathcal M, define 𝑱(s)=(Ebe(s);Uwork(s)Ebe(s),Stask(s)Ebe(s),ΔV(s)Ebe(s),𝒜(𝒫settle,ω),ΔGc0grid(s)Ebe(s)).\mathbf J_{\mathcal M}(s) = \left( E_b^e(s); \frac{U^{\mathrm{work}}(s)}{E_b^e(s)}, \frac{S_{\mathrm{task}}(s)}{E_b^e(s)}, \frac{\Delta V(s)}{E_b^e(s)}, \mathcal A(\mathcal P^{\mathrm{settle}},\omega), \frac{\Delta G_{c_0}^{\mathrm{grid}}(s)}{E_b^e(s)} \right). \label{eq:joulevector} The displayed coordinates are illustrative, not mandatory. They represent useful work, quality-adjusted task service, causal monetary realization, scenario-conditioned assurance, and a declared environmental or grid effect. Every coordinate names its native numerator unit. The semicolon after energy is deliberate: energy is also a resource to minimize, not merely a denominator that disappears after ratios are formed.

Definition 14 (Joule vector). A Joule vector is an energy amount and an ordered set of outcome axes. Each axis has a semantic name, native unit, orientation, boundary, horizon, and evidence status. Two vectors are directly Pareto comparable only when their axis signatures and manifests match.

The vector representation can report “MJ of useful work per J”, “verified task-equivalent per J”, and “2026 USD of causally attributed avoided loss per J” in adjacent columns. It does not add the columns. If assurance is expressed as a probability or attack margin, that coordinate remains a probability or a scenario-specific economic quantity. If the causal value effect is not identified, the vector may report the upstream service coordinate while marking the value coordinate OPEN.

Dominance and the Pareto frontier

Let \mathcal F be a feasible set of allocations. Energy is weakly preferred lower. For every beneficial outcome axis jj, zjz_j is weakly preferred higher; cost or risk axes are oriented lower. An allocation ss dominates rr when it is weakly better on energy and every outcome and strictly better on at least one coordinate. The Pareto frontier is 𝒫={s:r such that rs}.\mathcal P = \{s\in\mathcal F: \nexists r\in\mathcal F\text{ such that }r\succ s\}. \label{eq:pareto}

Dominance is a partial order. It can reject a system that uses more energy and produces no better outcome. It cannot rank one system that provides more verified task service against another that provides more useful work or assurance.

Conditional scalarization

For a decision maker dd, let nj(oj)[0,1]n_j(o_j)\in[0,1] be a published monotone normalization rule and let ωdjindex0\omega_{dj}^{\mathrm{index}}\ge0, jωdjindex=1\sum_j\omega_{dj}^{\mathrm{index}}=1, be published weights. Include energy as an oriented axis, for example nE(Ebe)=(EmaxEbe)/(EmaxEmin)n_E(E_b^e)=(E_{\max}-E_b^e)/(E_{\max}-E_{\min}). A conditional view is Sd(s)=jωdjindexnj(oj(s)).S_d(s)=\sum_j\omega_{dj}^{\mathrm{index}}n_j(o_j(s)). \label{eq:scalar} The subscript dd matters. The score belongs to a decision rule, not to physics.

Theorem 15 (Positive monotone scalarization selects a Pareto point). Let \mathcal F be finite and nonempty. Suppose every coordinate is oriented so that higher normalized values are better, every njn_j is strictly increasing in that orientation, and every ωjindex>0\omega_j^{\mathrm{index}}>0. Any maximizer of the equation is Pareto efficient.

Proof. Suppose a maximizer ss^\star were dominated by rr. Every normalized coordinate of rr would be at least that of ss^\star, and at least one would be strictly greater. Strictly positive weights would imply S(r)>S(s)S(r)>S(s^\star), contradicting maximality. ◻

Limitation 16. Zero weights weaken the result because a score can ignore the axis on which a candidate is dominated. A deterministic tie rule can then select a dominated point. The implementation permits zero weights as a declared analytic view, but the theorem applies only when every compared objective has positive weight.

Limitation 17. The converse requires more structure. With a convex attainable outcome set, supporting hyperplane results can recover supported frontier points using nonnegative linear weights. In a discrete or nonconvex set, some Pareto points are unsupported and cannot maximize a weighted sum. Reporting only weighted-sum optima can therefore hide feasible tradeoffs.

No natural common scalar

Theorem 18 (Conditional rank reversal). Let systems aa and bb have matched manifests and a common positive energy denominator. Suppose their normalized outcome vectors do not dominate one another. If aa is strictly better on one axis and bb is strictly better on another, there exist admissible strictly positive weight vectors 𝝎\boldsymbol\omega and 𝝎\boldsymbol\omega' such that S𝝎(a)>S𝝎(b)andS𝝎(b)>S𝝎(a).S_{\boldsymbol\omega}(a)>S_{\boldsymbol\omega}(b) \quad\text{and}\quad S_{\boldsymbol\omega'}(b)>S_{\boldsymbol\omega'}(a).

Proof. Place weight 1ε1-\varepsilon on an axis where aa is better and distribute the remaining positive mass across other axes. For sufficiently small ε>0\varepsilon>0, the strict advantage on that axis determines the sign. Repeat with weight concentrated on an axis where bb is better. Because the number of axes is finite and normalized differences are bounded, both weight vectors can remain strictly positive. ◻

The theorem is constructive. It does not say that all weights are equally reasonable. Evidence, rights, budgets, law, or institutional mandates can constrain admissible weights. It says that the ordering does not follow from joules alone. A claim of one “Joule Standard score” must therefore identify the decision maker, normalization, weights, and robustness region.

Marginal allocation and energy markets

The next joule

Paper 6 studies the marginal value of energy in an automated economy. Let ei,n,te_{i,n,t} be MWh assigned to service ii, node nn, and time tt. Let Biwork(𝒆i)B_i^{\mathrm{work}}(\mathbf e_i) be a declared benefit function and let grid and operational constraints define \mathcal F. A scalar social-planner problem can be written max𝒆iBiwork(𝒆i)i,n,tkn,tgridei,n,tiirisk(𝒆i),\max_{\mathbf e\in\mathcal F} \sum_i B_i^{\mathrm{work}}(\mathbf e_i) -\sum_{i,n,t}k_{n,t}^{\mathrm{grid}}e_{i,n,t} -\sum_i\mathcal R_i^{\mathrm{risk}}(\mathbf e_i), \label{eq:allocation} where irisk\mathcal R_i^{\mathrm{risk}} is a declared risk or external-cost functional. Under convexity and regularity, an interior allocation satisfies a marginal condition Biworkei,n,t=kn,tgrid+λi,n,tKKT+iriskei,n,t,\frac{\partial B_i^{\mathrm{work}}}{\partial e_{i,n,t}} = k_{n,t}^{\mathrm{grid}} +\lambda_{i,n,t}^{\mathrm{KKT}} +\frac{\partial\mathcal R_i^{\mathrm{risk}}}{\partial e_{i,n,t}}, \label{eq:kkt} where λi,n,tKKT\lambda_{i,n,t}^{\mathrm{KKT}} collects the opportunity costs of binding service and feasibility constraints. A declared nodal market price, if used, is pn,tnodalp_{n,t}^{\mathrm{nodal}}, not this multiplier.

This condition does not produce a universal sector ranking. The marginal benefit function depends on the service, state, counterfactual, and decision objective. The next joule may be most valuable for a delayed manufacturing operation at one node, a latency-sensitive inference at another, or a settlement workload under an elevated threat scenario. Scarcity prices and shadow costs are local and time dependent.

Proposition 19 (Average-marginal separation). A ranking by average value per joule does not identify the ranking of the next joule.

Proof. At E=10E=10, let system aa have value Va(10)=100V_a(10)=100 and local increment Va(11)Va(10)=1V_a(11)-V_a(10)=1. Let system bb have Vb(10)=60V_b(10)=60 and local increment Vb(11)Vb(10)=5V_b(11)-V_b(10)=5. Average intensities rank aa above bb, since 10>610>6, while local slopes rank bb above aa, since 5>15>1. Diminishing returns, node-time costs, nonconvexity, and opportunity cost can widen this difference. ◻

Vector allocation

When the benefit components are not commensurate, solve a vector optimization problem first: max𝒆(Uwork(𝒆),Stask(𝒆),Prreorg(𝒆),Δ𝒐c0(𝒆),CO2e(𝒆)),minEbe(𝒆).\max_{\mathbf e\in\mathcal F} \left( U^{\mathrm{work}}(\mathbf e),S_{\mathrm{task}}(\mathbf e), -Pr^{\mathrm{reorg}}(\mathbf e),\Delta\mathbf o_{c_0}(\mathbf e), -\mathrm{CO_2e}(\mathbf e) \right), \quad \min E_b^e(\mathbf e). \label{eq:vectorallocation} The output is a Pareto frontier. A decision maker may then apply the equation, an epsilon-constraint method, lexicographic priorities, or legal constraints. The choice must remain visible. In particular, monetizing every effect is one optional model. It is not required by the Joule Standard.

Flexible workloads and grid settlement

Paper 8 represents AI and proof-of-work workloads as heterogeneous feasible sets in a nodal dispatch model. Both can be price-responsive, but their constraints differ. AI jobs may carry deadlines, data locality, checkpoint costs, latency targets, or quality degradation. Proof-of-work loads may have startup behavior, pool constraints, hardware efficiencies, and protocol revenue exposure.

Paper 8 uses vwv_w locally for both a downward ramp limit and an audited true value. The synthesis imports neither collision. It writes rjr_j^{\downarrow} for a load’s downward ramp limit and νjtrue\nu_j^{\mathrm{true}} for audited true private value. Submitted bid value is bjsubmitb_j^{\mathrm{submit}}, which remains distinct from νjtrue\nu_j^{\mathrm{true}} and from realized downstream social value.

Reserve capability is a power quantity. A reserve offer is stated here in currency per MW-hour of reserved capability, equivalently currency per MWh-reserved for a one-hour interval. For an interval of δthrs\delta_t^{\mathrm{hrs}} hours, reserve payment multiplies the MW quantity by δthrs\delta_t^{\mathrm{hrs}} before applying a currency-per-MWh-reserved price. This resolves Paper 8’s local currency-per-MW versus currency-per-MWh label inconsistency and prevents power from being treated as energy without integration.

For a direct-current dispatch approximation, node balance and line limits can be expressed as pn,tgenDn,tfixedjpj,n,tload=mbnmsus(ϕn,tϕm,t),Fnmbnmsus(ϕn,tϕm,t)Fnm.\begin{aligned} p_{n,t}^{\mathrm{gen}}-D_{n,t}^{\mathrm{fixed}} -\sum_jp_{j,n,t}^{\mathrm{load}} &=\sum_m b_{nm}^{\mathrm{sus}}(\phi_{n,t}-\phi_{m,t}),\\ -\bar F_{nm} &\le b_{nm}^{\mathrm{sus}}(\phi_{n,t}-\phi_{m,t})\le\bar F_{nm}. \end{aligned} \label{eq:dc} A complete market settlement also needs revenue adequacy and an explicit reserve or uplift rule. The canonical system closure is PaymentDCreditG=Knetwork,Payment_D-Credit_G=K^{\mathrm{network}}, \label{eq:settlement} where PaymentDPayment_D, CreditGCredit_G, and residual network or constraint rents KnetworkK^{\mathrm{network}} balance under the modeled settlement.

The synthesis uses the grid model to locate marginal energy cost and constraints. It does not treat a dispatch solution as proof of alternating current feasibility, voltage security, transient stability, or deliverable reserves. Those require additional models.

Proposition 20 (Market-accounting separation). Lossless dispatch balance and nodal cash closure do not imply truthful bids, supporting prices, competitive equilibrium, dynamic stability, emissions benefit, or realized service value.

Proof. Balance follows from feasible injections and withdrawals. Cash closure follows from applying a complete declared price vector to that balanced dispatch. Both identities can hold when bids differ from true private value, when the price vector is externally supplied, when omitted dynamic constraints fail, or when the dispatched service has no downstream realized value. Each stronger claim therefore needs an additional premise or model. ◻

Efficiency and rebound

Let Qcog(ηQsvc/J)Q^{\mathrm{cog}}(\eta_Q^{\mathrm{svc/J}}) be total cognitive service demanded when efficiency is ηQsvc/J\eta_Q^{\mathrm{svc/J}} service units per joule. Direct facility-operational energy use is EAIfacility(ηQsvc/J)=Qcog(ηQsvc/J)ηQsvc/J.E_{\mathrm{AI}}^{\mathrm{facility}} (\eta_Q^{\mathrm{svc/J}}) =\frac{Q^{\mathrm{cog}}(\eta_Q^{\mathrm{svc/J}})} {\eta_Q^{\mathrm{svc/J}}}. \label{eq:reboundlevel} Differentiating gives the identity from Paper 7: dlnEAIfacilitydlnηQsvc/J=dlnQcogdlnηQsvc/J1=ϵQcog,ηQ1.\frac{d\ln E_{\mathrm{AI}}^{\mathrm{facility}}} {d\ln\eta_Q^{\mathrm{svc/J}}} =\frac{d\ln Q^{\mathrm{cog}}} {d\ln\eta_Q^{\mathrm{svc/J}}}-1 =\epsilon_{Q^{\mathrm{cog}},\eta_Q}-1. \label{eq:rebound} Energy falls when the service elasticity with respect to efficiency is below one, remains constant at one, and rises above one. For finite changes, EAI,1facilityEAI,0facility=Q1cog/Q0cogηQ,1svc/J/ηQ,0svc/J.\frac{E_{\mathrm{AI},1}^{\mathrm{facility}}} {E_{\mathrm{AI},0}^{\mathrm{facility}}} =\frac{Q_1^{\mathrm{cog}}/Q_0^{\mathrm{cog}}} {\eta_{Q,1}^{\mathrm{svc/J}}/ \eta_{Q,0}^{\mathrm{svc/J}}}. \label{eq:finite}

These are accounting identities, not empirical estimates of rebound. The causal effect of an efficiency improvement on service demand can include lower prices, new use cases, quality changes, complementary capital, organizational adaptation, and economy-wide income effects. System boundaries again matter. A model-level reduction in joules per task may coincide with higher facility-level electricity, and facility electricity may differ from economy-wide primary energy. The Joule Standard requires reporting the efficiency numerator, price path, demand response, energy stage, time horizon, and displaced baseline before classifying rebound.

Proposition 21 (Rebound scope). Under fixed service and direct-energy definitions, the equation holds. It does not determine economy-wide energy without the response of non-AI energy.

Proof. The direct identity follows by differentiating lnEAIfacility=lnQcoglnηQsvc/J\ln E_{\mathrm{AI}}^{\mathrm{facility}} =\ln Q^{\mathrm{cog}}-\ln\eta_Q^{\mathrm{svc/J}}. For non-overlapping total energy Etotal=EAIfacility+EotherE_{\mathrm{total}}=E_{\mathrm{AI}}^{\mathrm{facility}} +E_{\mathrm{other}}, the derivative also contains the response of EotherE_{\mathrm{other}}. The direct service elasticity does not identify that term. ◻

Rebound also changes allocation logic. A lower energy cost per verified task shifts the feasible frontier outward. It does not ensure movement toward lower total energy. Quantity responses and system constraints determine the new allocation.

National accounting and double-counting control

Preserve the production core

The national-accounting core remains GDP=jGVAj+taxes on productssubsidies on products.\operatorname{GDP}=\sum_j\operatorname{GVA}_j+ \text{taxes on products}-\text{subsidies on products}. \label{eq:gdp} AI services, data centers, electricity generation, equipment manufacture, mining activity, and payment services can already enter gross output, intermediate consumption, and value added. A satellite account may expose their energy use and outcomes, but it must not add those same production flows to GDP a second time.

Let GG be an AI-related flow already included in an industry’s GVA. Let GmemoG^{\mathrm{memo}} display the same source flow in a thematic memorandum. Then GDP+Gmemo\operatorname{GDP}+G^{\mathrm{memo}} double counts GG. The memorandum can disaggregate or annotate GDP. It is not an additional production flow.

Stocks, flows, and assurance

Let KtK_t be an asset position protected or transferred using a settlement system during period tt. It is a stock or exposure measure, not a production flow. Adding KtK_t to GDP violates both unit semantics and temporal type. Likewise, a modeled avoided expected loss Kt{R0R1}K_t\{R_0-R_1\} is not automatically value added. It is a scenario-conditioned benefit estimate. Depending on the application, some associated services may already be purchased and recorded in production.

Proposition 22 (Production and memorandum non-addition). An account entry cannot be added to GDP when it is either (i) the same source flow already recorded in GVA, (ii) a stock or exposure, (iii) a probability or physical service, or (iv) a causal benefit estimate not defined as an SNA production flow.

Proof. Case (i) repeats a source flow. Cases (ii) and (iii) fail the typed-addition condition in 5. Case (iv) has a different production boundary and meaning unless an SNA-consistent transaction or imputation is separately established. A memorandum display does not establish that mapping. ◻

Proposition 23 (National non-addition). Conversion-linked energy stages, production already recorded in GVA, nested produced-adopted-realized AI outcomes, and stock exposures cannot be added as independent production. Typed memorandum panels can be attached without changing GDP.

Proof. 7 covers linked physical stages, while 22 covers repeated production and stock-flow incompatibility. Produced, adopted, and realized quantities are nested stages of one outcome lineage, so their sum repeats earlier stages. Memorandum attachment changes display, not the production identity in the equation. ◻

The audit

Every additive account entry should carry:

  • a unique entry identifier;

  • a source-flow identifier;

  • a typed quantity;

  • a role, either integrated production, satellite memorandum, or physical memorandum; and

  • a classification and bridge to the source account.

The deterministic audit emits a repeated-source finding whenever a source-flow identifier appears more than once. It emits a stronger GVA-satellite overlap finding when the same source appears in integrated production and a satellite memorandum. It also rejects an integrated total that mixes semantic, unit, stock-flow, boundary, or horizon types. This is a useful minimum control, not a complete national-accounts compiler. Source systems must still resolve revaluations, transfers, consolidation, residence, imports, taxes, subsidies, and classification changes.

Twenty-case cross-program screen

The lineage and type rules apply to the following audit cases. A conforming implementation either rejects the aggregation or supplies the named bridge.

  1. Do not add primary, conversion-output, final, facility, and lifecycle energy as independent inputs.

  2. Do not add manufacturing operation to embodied allocation and then add both again to the economy-wide operational total.

  3. Do not add component estimates for host, network, facility, idle, retry, or rework when a covering meter already contains them.

  4. Do not charge one shared inference’s full energy to several adopted uses and then sum the branches.

  5. Do not add tokens, verified tasks, adopted tasks, and realized outcomes as independent outputs. They are typed stages or nested quantities.

  6. Do not multiply quality factors that encode the same failure event.

  7. Do not remove failed attempts from energy and then separately claim a reliability adjustment.

  8. Do not add AI-enabled output to GVA when the source production flow is already recorded.

  9. Do not add protected exposure, expected loss, avoided loss, settlement service, and insurance or risk-management production without an overlap bridge.

  10. Do not sum overlapping protected exposures or repeated positions across assurance windows.

  11. Do not add load payments, generator credits, congestion rent, reserve credits, and reserve charges without closing cash settlement and identifying transfers.

  12. Do not add explicit congestion, loss, or energy components when the locational price already embeds them.

  13. Do not charge reserve once as headroom and again as the same reserve requirement.

  14. Do not sell one curtailment, battery, backup generator, or interconnection capability into overlapping reserve products without coupled constraints.

  15. Do not count a demand-response baseline payment as grid surplus without verified reduction and a production-cost counterfactual.

  16. Do not count direct AI energy again inside indirect digital or economy-wide energy.

  17. Do not call displaced or shifted energy eliminated when it reappears at another site or time.

  18. Do not add private attack cost, electricity-producer revenue, and social resource cost without an incidence account.

  19. Do not sum ratios across units. Aggregate matched numerators and denominators, then form the declared ratio.

  20. Do not add a normalized composite index to its underlying physical or monetary components.

Proposition 24 (Lineage-complete aggregation). Suppose every physical flow, monetary production item, shared service input, and protected exposure has a stable lineage identifier; an aggregation admits each identifier at most once; and distinct identifiers have been verified non-overlapping. Then the aggregation contains no duplicate component.

Proof. Assume a duplicate component remains. It must either have the same lineage identifier twice, contradicting the admission rule, or have two identifiers, contradicting the verified non-overlap premise. The conclusion is conditional on the source records satisfying those premises. ◻

Cross-paper equation and notation map

The following crosswalk is normative for this synthesis. It translates each prior paper’s local equation into the canonical namespace, records its estimand family, and names the dependency that prevents overreach. Local paper notation appears only in the conflict table that follows.

Table 1 in Cross-paper equation and notation map
Paper Equation Role Dependencies and limits
VPJ=𝔼Πunc[ΔW]/Ebe\operatorname{VPJ}_{\mathcal M}=\mathbb{E}_{\Pi^{\mathrm{unc}}}[\Delta W]/E_b^e Measurement contract and level-intensity family. Prior dependency: none. \mathcal M fixes boundary, counterfactual, value functional, horizon, energy convention, attribution, and uncertainty. It does not create universal weights.
Xnint/X0int=kXkout/Xkin\begin{aligned} X_n^{\mathrm{int}}/X_0^{\mathrm{int}} &=\prod_k X_k^{\mathrm{out}}\\[-2pt] &\quad /X_k^{\mathrm{in}} \end{aligned} Typed pathwise level-ratio composition. Prior dependency: P1. Adjacent amounts and semantic types must match. Pathwise composition does not imply a product of expectations or a semantic valuation.
QAIJ𝒫eval=𝔼[id̃itaskuisvcqiAIcicorrectαisvcilat]/𝔼[Ebe]\begin{aligned} \operatorname{QAIJ}_{\mathcal P^{\mathrm{eval}}} &=\mathbb{E}[\sum_i\widetilde d_i^{\mathrm{task}}u_i^{\mathrm{svc}}\\[-2pt] &\quad q_i^{\mathrm{AI}}c_i^{\mathrm{correct}}\\[-2pt] &\quad \alpha_i^{\mathrm{svc}}\ell_i^{\mathrm{lat}}] /\mathbb{E}[E_b^e] \end{aligned} Quality-adjusted task service, ratio-of-expectations family. Prior dependencies: P1, P2. Task distribution, scoring, reliability, latency, and energy boundary are declared. Task service is not tokens and not realized economic value.
ALPJ=LossP(Pr0reorgPr1reorg)/ΔEP\begin{aligned} \operatorname{ALPJ}={}&Loss_P(Pr_0^{\mathrm{reorg}}\\[-2pt] &-Pr_1^{\mathrm{reorg}})/\Delta E_P \end{aligned} Conditional avoided loss, causal ratio-of-effects family when identified. Prior dependencies: P1, P2. Intervention, threat scenario, loss severity, risk models, and boundary must match. It is not a general measure of trust.
θcausal=ΔVATE/ΔEATE,b\theta^{\mathrm{causal}} =\Delta_V^{\mathrm{ATE}}/\Delta_E^{\mathrm{ATE},b} Causal realized-value ratio-of-effects family. Prior dependencies: P1, P2, P3. Numerator and denominator identify the same intervention contrast. Near-zero ΔEATE,b\Delta_E^{\mathrm{ATE},b} requires ratio-aware inference. Tokens remain intermediate.
Biworkei,n,t=kn,tgrid+λi,n,tKKT+iriskei,n,t\begin{aligned} \frac{\partial B_i^{\mathrm{work}}}{\partial e_{i,n,t}} ={}&k_{n,t}^{\mathrm{grid}} +\lambda_{i,n,t}^{\mathrm{KKT}}\\[-2pt] &+\frac{\partial\mathcal R_i^{\mathrm{risk}}}{\partial e_{i,n,t}} \end{aligned} Marginal-derivative family at node and time. Prior dependencies: P1, P5. Requires a declared scalar objective, convexity, differentiability, and regularity. It supplies no context-free sector order.
dlnEAIfacilitydlnηQsvc/J=ϵQcog,ηQ1\begin{aligned} \frac{d\ln E_{\mathrm{AI}}^{\mathrm{facility}}} {d\ln\eta_Q^{\mathrm{svc/J}}} ={}&\epsilon_{Q^{\mathrm{cog}},\eta_Q}-1 \end{aligned} Direct rebound elasticity identity, not a level intensity. Prior dependencies: P3, P5. The demand elasticity is empirical and boundary dependent. Direct, indirect, and economy-wide rebound are distinct.
PaymentDCreditG=KnetworkPayment_D-Credit_G=K^{\mathrm{network}} Market-settlement identity, not an energy-normalized ratio. Prior dependencies: P4, P5, P6, P7. Dispatch and settlement need explicit network, reserve, and revenue-adequacy rules. A DC solution does not prove AC or dynamic feasibility.
GDP=jGVAj+TaxpSubsidyp\operatorname{GDP}=\sum_j\operatorname{GVA}_j+Tax_p-Subsidy_p Production identity; attached intensities are descriptive-national family. Prior dependencies: P1 through P6. Energy, task service, assurance, avoided loss, and protected stocks remain memoranda unless an SNA-consistent flow is identified.

Imported conflicts and explicit repairs

The independent cross-program audit identified ten actual or status-granularity conflicts. The synthesis disposition is explicit so that no local notation is silently inherited.

Table 2 in Imported conflicts and explicit repairs
ID Conflict Paper 10 disposition
C1 O,T,UO,T,U denote different inference nodes across the corpus. Use the equation: OemitO_{\mathrm{emit}} is immediate output, U𝒫U_{\mathcal P} is verified outcome, and TκtokT_\kappa^{\mathrm{tok}} is an attached representation statistic.
C2 Exergy is XX in the registry and BB in Paper 2. Use XexX^{\mathrm{ex}} exclusively for exergy in the synthesis.
C3 Paper 4 declares energy interval τ\tau and attack window TT, then writes energy over TT. Use EH(τEhash)E_H(\tau_E^{\mathrm{hash}}) and evaluate risk over τAattack\tau_A^{\mathrm{attack}}. Equality is an explicit scenario restriction.
C4 Paper 5’s local EwallE^{\mathrm{wall}} sum can include facility overhead. Use the separate system-wall and facility-operational totals in the equation, or Eoperational,bE^{\mathrm{operational},b} with boundary bb.
C5 Paper 8 uses vwv_w for downward ramp and audited true value. Use rjr_j^{\downarrow} and νjtrue\nu_j^{\mathrm{true}}, respectively.
C6 Paper 8 labels reserve offers once per MWh and once per MW. Use currency per MW-hour, convert MW reserve through δthrs\delta_t^{\mathrm{hrs}}, and report the resulting MWh-reserved.
C7 Paper 2’s duplicate-branch prose says 20/20020/200 and 20/10020/100 are equal. They are 0.10.1 and 0.20.2, differing by a factor of two. The example is retained only as a warning against duplicating a shared input.
C8 The shared register gives one computational label to Paper 3 results that include formal existence theorems. Tokenizer and task-mix existence results are PROVED; fixture outputs are COMPUTATIONAL; empirical magnitude and transport remain CONDITIONAL or OPEN.
C9 λn,t\lambda_{n,t} is a KKT shadow price in Paper 6 and an externally declared complete price vector in Paper 8. Use λkKKT\lambda_k^{\mathrm{KKT}} for multipliers and pn,tnodalp_{n,t}^{\mathrm{nodal}} for declared market prices. Settlement closure does not turn the latter into a supporting equilibrium price.
C10 Paper 4’s loss-on-success LPL_P is called gross protected exposure in a Paper 9 fixture. Use gross exposure XPgrossX_P^{\mathrm{gross}} and loss-on-success LossP=XPgrosssPlossLoss_P=X_P^{\mathrm{gross}}s_P^{\mathrm{loss}}. Equality requires sPloss=1s_P^{\mathrm{loss}}=1.

Symbol discipline

Several letters recur across economics and engineering. The crosswalk avoids a false unification by qualifying them.

  • EbeE_b^e is an energy quantity under boundary bb and convention ee. It is not expected value, for which the paper uses 𝔼\mathbb{E}.

  • UworkU^{\mathrm{work}} is useful physical work. W()W(\cdot) is a declared economic or welfare functional. They are not interchangeable.

  • StaskS_{\mathrm{task}} is verified task service. SdS_d is a decision-maker-specific scalarization. Neither denotes GDP.

  • 𝒜(𝒫settle,ω)\mathcal A(\mathcal P^{\mathrm{settle}},\omega) is an assurance vector. AadoptA^{\mathrm{adopt}} is adopted use. Neither is an empirical treatment assignment, for which the namespace uses ZassignZ^{\mathrm{assign}}.

  • Pr0reorg,Pr1reorgPr_0^{\mathrm{reorg}},Pr_1^{\mathrm{reorg}} in the equation are matched scenario risks. irisk(x)\mathcal R_i^{\mathrm{risk}}(x) in the equation is a general risk or external-cost functional.

  • λkKKT\lambda_k^{\mathrm{KKT}} is a constraint multiplier and pn,tnodalp_{n,t}^{\mathrm{nodal}} a declared nodal price. Neither is an intrinsic value of energy at all locations or dates.

Table 3 in Symbol discipline
Local symbol Collision class Canonical synthesis namespace
OO Immediate output, verified outcome, converted-energy output. Oemit,Uverify,OenergyO_{\mathrm{emit}},U_{\mathrm{verify}},O_{\mathrm{energy}}.
UU Verified outcome, usefulness, ramp-up, product use. U𝒫,uisvc,ri,UseraU_{\mathcal P},u_i^{\mathrm{svc}},r_i^\uparrow,Use_{ra}.
TT Tokens, attack window, time-index set. Tκtok,τAattack,𝒯T_\kappa^{\mathrm{tok}},\tau_A^{\mathrm{attack}},\mathcal T.
CC Computation, attack cost, generator credit, conversion input. Ccomp,CostA,CreditG,Econv,inC^{\mathrm{comp}},Cost_A,Credit_G,E_{\mathrm{conv,in}}.
AA Adoption, availability, incidence matrix. Aadopt,αavail,𝑩incA^{\mathrm{adopt}},\alpha^{\mathrm{avail}},\mathbf B^{\mathrm{inc}}.
EE Inventory, random denominator, treatment effect, dispatch quantity, facility amount, national flow. Always attach stage, boundary, interval, and estimand family.
xx Outcome vector, interface amount, MWh allocation, MW schedule. 𝒐,Xk,ei,n,t,pj,tload\mathbf o,X_k,e_{i,n,t},p_{j,t}^{\mathrm{load}}.
η\eta Exergy efficiency, hashing intensity, tokens/J, service/J. ηex,ϵHJ/TH,ηκtok/J,ηQsvc/J\eta_{\mathrm{ex}},\epsilon_H^{\mathrm{J/TH}}, \eta_\kappa^{\mathrm{tok/J}},\eta_Q^{\mathrm{svc/J}}.
qq AI quality, adversarial share, workload energy, fallback power. qiAI,αAhash,ei,tload,pjfallbackq_i^{\mathrm{AI}},\alpha_A^{\mathrm{hash}}, e_{i,t}^{\mathrm{load}},p_j^{\mathrm{fallback}}.
zz Outcome vector, success threshold, confirmations, assignment, restart, normalized indicator. 𝒋,hipass,dconf,Ziassign,yj,tstart,x̃k\mathbf j,h_i^{\mathrm{pass}},d^{\mathrm{conf}},Z_i^{\mathrm{assign}}, y_{j,t}^{\mathrm{start}},\widetilde x_k.
cc Counterfactual, correctness, nodal cost, marginal cost, generation cost. c0,cicorrect,kn,tgrid,mcsvc,mcggenc_0,c_i^{\mathrm{correct}},k_{n,t}^{\mathrm{grid}}, mc^{\mathrm{svc}},mc_g^{\mathrm{gen}}.
aa Attribution, service reliability, grid availability. aattr,αsvc,αgrida^{\mathrm{attr}},\alpha^{\mathrm{svc}},\alpha^{\mathrm{grid}}.
π\pi Uncertainty, price pass-through, demand-response payment. Πunc,ϵp,cpass,ϖDR\Pi^{\mathrm{unc}},\epsilon_{p,c}^{\mathrm{pass}},\varpi^{\mathrm{DR}}.
τ,T,Δ\tau,T,\Delta Horizon, energy interval, attack window, dispatch duration, and treatment contrast. τH,τE,τA,δthrs\tau_H,\tau_E,\tau_A,\delta_t^{\mathrm{hrs}}, with Δ\Delta reserved for declared contrasts.
λ\lambda Value scaling, Poisson mean, KKT multiplier, nodal price. αW,μP,λkKKT,pn,tnodal\alpha_W,\mu_P,\lambda_k^{\mathrm{KKT}},p_{n,t}^{\mathrm{nodal}}.
ρ\rho Shared allocation, risk weight, pass-through, reserve price. ashared,γirisk,ϵpass,ptreservea^{\mathrm{shared}},\gamma_i^{\mathrm{risk}}, \epsilon^{\mathrm{pass}},p_t^{\mathrm{reserve}}.
RR Reorganization risk, reward, risk functional, rebound, reserve. Prreorg,RewardA,irisk,rebound,ReqtreservePr^{\mathrm{reorg}},Reward_A,\mathcal R_i^{\mathrm{risk}}, \mathcal B^{\mathrm{rebound}},Req_t^{\mathrm{reserve}}.
LL Graph edges, latency, protected loss, conversion loss. G,ilat,LossP,Econv,loss\mathcal E_G,\ell_i^{\mathrm{lat}},Loss_P, E_{\mathrm{conv,loss}}.
PP Evaluation protocol, payment, primary supply. 𝒫eval,PaymentD,Eprimary,supply\mathcal P^{\mathrm{eval}},Payment_D,E_{\mathrm{primary,supply}}.
QQ Cognitive service, required energy, outcome counts. Qcog,Ei,kreq,QkoutcomeQ^{\mathrm{cog}},E_{i,k}^{\mathrm{req}},Q_k^{\mathrm{outcome}}.
NN Chain network, net value, active units, grid nodes. 𝒩chain,Vinet,nactive,𝒩grid\mathcal N^{\mathrm{chain}},V_i^{\mathrm{net}},n^{\mathrm{active}}, \mathcal N^{\mathrm{grid}}.
ww Valuation weights, task weights, workload index, composite weights. ωvalue,ωitask,j𝒥load,ωkindex\omega^{\mathrm{value}},\omega_i^{\mathrm{task}}, j\in\mathcal J^{\mathrm{load}},\omega_k^{\mathrm{index}}.
κ\kappa Tokenizer and benefit curvature. κtok,γcurve\kappa^{\mathrm{tok}},\gamma^{\mathrm{curve}}.
BB Exergy, attacker benefit, workload benefit, susceptance. Xex,BenefitA,Biwork,bsusX^{\mathrm{ex}},Benefit_A,B_i^{\mathrm{work}},b_\ell^{\mathrm{sus}}.
XX Exergy, outcome space, feasible set, other energy disposition. Xex,𝒪,,DotherX^{\mathrm{ex}},\mathcal O,\mathcal F,D^{\mathrm{other}}.
vwv_w Downward ramp and audited true value in Paper 8. rj,νjtruer_j^\downarrow,\nu_j^{\mathrm{true}}.
θ\theta Semantic type, causal ratio, voltage angle. 𝗍𝗒𝗉𝖾(x),θcausal,ϕn,t\mathsf{type}(x),\theta^{\mathrm{causal}},\phi_{n,t}.
dd Unit dimension, task difficulty, deadline or damage, fixed demand, line destination. dim,ditask,hi,kdeadline,damagen,t,Dn,tfixed,head()dim,d_i^{\mathrm{task}},h_{i,k}^{\mathrm{deadline}}, damage_{n,t},D_{n,t}^{\mathrm{fixed}},head(\ell).

The software function canonical_equation_crosswalk() fixes Papers 1 through 9 in order, assigns each an evidence label, and validates uniqueness and completeness. That executable list is a regression guard against losing a paper or silently changing its role.

Boundary map

Energy boundaries answer different questions. A bridge can relate them, but a shared joule unit does not make them identical.
Boundary Included energy Suitable question Frequent invalid inference
Device operational Metered accelerator or device energy during named work. Hardware or kernel efficiency under controlled load. Calling the result facility, marginal-grid, or lifecycle energy.
System operational Device plus declared host, memory, storage, and network components. End-to-end system comparison under matched service. Ignoring idle, retries, failed jobs, or shared hosts.
Facility operational IT load plus declared cooling and power conversion overhead. Deployment operations at a named site and time. Treating a fixed facility factor as universal across load and weather.
Embodied increment Uniquely allocated manufacturing and construction increment. Decision about additional equipment or infrastructure. Adding a full asset lifecycle to every short-run job.
Lifecycle Declared upstream, operational, replacement, and end-of-life processes. Technology comparison for a functional unit over a stated life. Combining a lifecycle total with operational components already inside it.
Primary Energy resources entering the economy or transformation chain. Resource supply and economy-wide energy dependence. Adding conversion output or final use from the same lineage.
Final Energy products delivered to final users after transformation. End-use sector demand and intensity. Interpreting final electricity as primary-resource requirement without a bridge.
Marginal grid Modeled change in generation, losses, congestion, and emissions caused by an incremental load. Dispatch, location, timing, and flexible-load decisions. Equating average facility electricity with the marginal system response.

Three additional boundaries cross-cut 1. The outcome boundary identifies the service, population, distribution, and external effects counted in the numerator. The causal boundary fixes the intervention and counterfactual. The institutional boundary fixes ownership, residence, legal obligations, protocol governance, and market settlement. A complete comparison aligns all four.

Boundary-reversal counterexample

Let systems aa and bb produce 100100 and 120120 matched service units. Their device energy is 1010 J and 2020 J, so the device-boundary intensities are 1010 and 66 service units per J and aa ranks first. Suppose the matched facility boundary adds 4040 J of non-overlapping cooling and shared infrastructure to aa and none to bb. Facility intensities are then 22 and 66, and bb ranks first. Neither ranking is an error. They answer different boundary questions. Comparing one device ratio directly with the other facility ratio would fail the manifest gate.

Incompatibility and non-aggregation

The common denominator does not erase numerator types.
Quantity Native kind May be normalized by J? May be added directly to
Useful mechanical work Physical service, J or MJ Yes, with matched input boundary. Only the same physical service under matched type and scope.
Verified task service Task-equivalent Yes, for a named task distribution. Only matched task service. Not tokens, work, money, or trust.
Causal realized value Money flow or welfare index Yes, with matched causal energy effect. Matched value flows under the same functional, price basis, boundary, and horizon.
Settlement risk Probability or risk measure It can be displayed beside energy; a ratio needs an interpreted purpose. Only matched probabilities or risk measures. Not avoided dollars.
Avoided expected loss Scenario-conditioned money flow Yes, conditionally, as ALPJ\operatorname{ALPJ}. Matched expected-loss effects, subject to overlap with recorded services.
Gross protected position Money stock or exposure Per-joule display is possible but not a production ratio. Matched stocks at the same date. Never GDP.
Gross value added Money flow under SNA production boundary Yes, as a production-energy indicator. Matched GVA flows. Not satellite outcomes already represented in GVA.
Composite index Dimensionless declared view Only if the index construction specifies the resource role. Only the same index definition. A different weight vector is a different view.

Why avoided loss does not solve every incompatibility

Analysts sometimes monetize every outcome as avoided loss or willingness to pay. That can support a decision model when exposure, counterfactual risk, standing, prices, distribution, and uncertainty are defensible. It does not produce a natural scalar. A service may protect rights or institutional features that are deliberately not traded off at a market price. The same loss event may already enter insurance payments, business interruption, asset revaluation, and welfare estimates. Monetization therefore creates additional overlap and identification duties.

Why exergy does not solve every incompatibility

Exergy offers a common physical metric for the maximum useful work obtainable relative to an environment. It can improve the description of the energy-to-work portion of a transduction chain. It cannot determine the correctness of an answer, the social usefulness of a task, a protocol’s adversarial robustness, or a counterfactual welfare effect. The synthesis uses exergy as a typed physical node rather than a universal economic numerator.

Why price does not solve every incompatibility

Market prices encode marginal exchange under particular institutions, property rights, distributions, and market structures. They can value traded flows in a specified accounting context. They may omit externalities, nonmarket production, consumer surplus, distributional standing, tail risks, and rights constraints. A price-weighted scalar is legitimate when its purpose and limitations are stated. Calling it the Joule Standard without qualification would conceal the valuation choice.

A synthetic integrated fixture

Consider three feasible systems evaluated under one manifest. The outcome axes are useful work in MJ, verified task service in task-equivalents, and avoided expected loss in 2026 USD.

Table 6 in A synthetic integrated fixture
System Energy J Useful work MJ Task service Avoided loss USD
Balanced 80 70 70 70
Cognitive 90 30 95 45
Dominated 100 60 60 60

Balanced dominates Dominated because it uses less energy and is better on every outcome. Balanced and Cognitive do not dominate one another. Cognitive produces more task service; Balanced uses less energy and produces more useful work and avoided loss. The Pareto frontier contains both.

After published min-max normalization, a view with weights (ωEindex,ωWindex,ωQindex,ωAindex)=(0.15,0.15,0.65,0.05)(\omega_E^{\mathrm{index}},\omega_W^{\mathrm{index}}, \omega_Q^{\mathrm{index}},\omega_A^{\mathrm{index}}) =(0.15,0.15,0.65,0.05) can choose Cognitive, while (ωEindex,ωWindex,ωQindex,ωAindex)=(0.30,0.40,0.10,0.20)(\omega_E^{\mathrm{index}},\omega_W^{\mathrm{index}}, \omega_Q^{\mathrm{index}},\omega_A^{\mathrm{index}}) =(0.30,0.40,0.10,0.20) can choose Balanced. The ranking difference is not a numerical failure. It reports different priorities. The unweighted vector and frontier remain the primary result.

A separate transduction fixture begins with 100100 J of facility energy, produces 8080 named operations, 4040 verified task units, and 2020 USD of incremental value under a matched design. The typed yields are 80op100J,40task80op,20USD40task.\frac{80\ \mathrm{op}}{100\ \mathrm{J}}, \quad \frac{40\ \mathrm{task}}{80\ \mathrm{op}}, \quad \frac{20\ \mathrm{USD}}{40\ \mathrm{task}}. Their exact product is 0.2USD/J0.2\ \mathrm{USD/J}, equal to the terminal ratio. The code rejects a substitution of “80 tokens” for “80 verified tasks” even when both use the display unit “count”. Semantic type is part of the interface.

For an assurance fixture, let exposure be 10001000 USD, baseline risk 0.010.01, intervention risk 0.0020.002, and incremental energy 5050 J. Avoided expected loss is 88 USD and ALPJ=0.16\operatorname{ALPJ}=0.16 USD/J. These computations do not establish that the risk probabilities are empirically correct. They test the conditional accounting once the scenario inputs are supplied.

Independent national closures

A small national fixture closes five ledgers independently.

  1. Product energy. Primary supply is 10001000 J. Its disposition is 200200 J of direct final primary use, 100100 J of primary exports, 400400 J of conversion loss, 250250 J of final converted energy, and 5050 J of converted-energy exports. These disjoint dispositions sum to 10001000 J. The 300300 J conversion output is displayed as a stage, not added to the primary total.

  2. Component lineage. A facility meter carries lineage op-2026-q3 and reports 100100 J. A server-manufacture allocation carries lineage server-manufacture and reports a 2020 J embodied increment. Their scoped 120120 J total is permitted because the lineages do not overlap. The fixture does not also add device and cooling components already inside the facility meter.

  3. Production. GVA entries of 400400 and 300300 currency units, product taxes of 4040, and subsidies of 1010 give GDP of 730730.

  4. Outcome chain. The memorandum reports 100100 produced, 7070 adopted, and 5050 realized task units. The quantities reconcile as nested stages and are not summed to 220220.

  5. Settlement cash. Load payments of 10001000, generator credits of 850850, and network or constraint rent K=150K=150 satisfy PaymentDCreditG=KPayment_D-Credit_G=K. These transfers are not added as three welfare benefits.

Passing one closure does not repair another. A balanced cash settlement can coexist with a duplicated energy lineage, and a balanced physical account can coexist with a repeated production flow.

Reference implementation

The reference implementation is src/joule_standard/synthesis.py. It uses only the Python standard library and local evidence-status enumeration. Public numeric inputs use decimal.Decimal, integers, or decimal strings. Binary floating-point inputs are rejected so a displayed exact fixture cannot silently depend on a binary approximation.

Executable objects

The module provides:

  • QuantityType and TypedQuantity, with exact semantic, unit, accounting-kind, boundary, and horizon checks;

  • BoundaryManifest, with a field-by-field direct-comparability gate;

  • TransductionStage, typed exact path composition, retained stage statuses, and the conservative evidence join in the equation;

  • EnergyInventory, physical-lineage identifiers, energy-stage controls, and separate operational plus embodied increments;

  • source-tagged account entries and a minimum double-counting audit;

  • SystemVector, direction-aware dominance, and deterministic Pareto filtering;

  • published normalization rules and explicit scalarization weights;

  • matched causal effect ratios and assurance contrasts;

  • direct and finite rebound identities; and

  • a canonical equation crosswalk for Papers 1 through 9.

Refusal behavior

Refusal is part of the implementation. The module raises a typed error when an operation would:

  • add a money stock to a money flow;

  • add tokens to verified task service;

  • compose stages whose interface semantics or amounts differ;

  • compare manifests with unmatched energy stages or other required fields;

  • repeat a component identifier or physical lineage;

  • total primary and final energy as independent stages;

  • compare Pareto vectors with different axes or units;

  • accept scalarization weights that do not sum exactly to one;

  • form a causal ratio from unmatched interventions or a zero energy effect; or

  • accept a probability outside [0,1][0,1].

These rules do not decide contested empirical questions. They prevent invalid operations after a researcher has supplied the relevant records.

Adversarial test contract

The dedicated test file contains twenty-four tests. It verifies a valid energy-to-computation-to-service-to-value path, then substitutes an identically displayed but semantically different count at an interface. It attacks stock-flow addition, task-token addition, boundary matching, duplicate energy components, primary-final mixing, repeated account sources, GVA-memorandum overlap, outcome-axis substitution, invalid weight sums, zero-denominator causal ratios, invalid assurance risks, crosswalk omissions, crosswalk misordering, and binary floats. It also checks positive cases: separate operational and embodied increments, Pareto removal of a dominated point, conditional rank reversal, exact avoided loss, and the rebound identities.

The test suite is evidence for program behavior, not evidence that any real-world parameter has been measured correctly.

Identification and falsification agenda

A useful standard must say how its claims could fail. The following agenda separates mathematical, software, empirical, and institutional tests.

Boundary falsification

A comparison fails its direct-comparability claim if a line-item audit reveals different functional units, time intervals, locations, energy stages, failure treatment, embodied scope, counterfactuals, outcome functionals, attribution rules, uncertainty models, or exclusions. Researchers should publish manifests before examining rankings. A blinded boundary audit can then test whether the claimed comparison survives.

Facility energy should be reconciled against device telemetry, power distribution data, and site meters. Discrepancies need an allocation bridge, not a generic overhead factor. Lifecycle claims should publish inventory processes and show that operational energy is not added after already entering the lifecycle total.

Transduction falsification

Each edge needs an observable or model that could contradict it. Energy-to-work edges can be checked by calibrated physical measurement. Computation-to-service edges can be tested on held-out tasks with blinded scoring and failure retention. Service-to-adoption edges can be tested using workflow logs. Adoption-to-value edges require randomized assignment, a credible quasi-experiment, or explicit partial-identification bounds.

A transduction claim fails if the output population differs from the next stage’s input population, if attrition is silently removed, or if a semantic substitution occurs. A product of average stage yields should be compared with the average pathwise product. Their divergence is evidence against an independence simplification.

Quality-adjusted intelligence

Quality scores should be challenged by:

  • tokenizer substitutions that preserve user-visible content;

  • verbosity perturbations that add tokens without adding useful content;

  • adversarial task-mix shifts;

  • calibration and abstention tests;

  • repeated trials that expose reliability and tail failures;

  • latency thresholds tied to task usefulness; and

  • human or system baselines evaluated under the same functional unit.

A claimed QAIJ\operatorname{QAIJ} advantage is falsified for a target population when it disappears under the prespecified task distribution or fails the boundary gate. A robust result should report a frontier over quality, latency, reliability, and energy rather than one chosen score alone.

Settlement assurance

An assurance claim should vary adversary resources, network delay, hardware availability, concentration, bribery, reward changes, censorship objectives, confirmation horizon, and asset exposure. Empirical event studies can examine reorganizations, fee shocks, hashrate migration, outages, and concentration, but observed survival alone does not identify counterfactual loss prevention.

The claim “more energy caused more assurance” is falsified if a matched intervention changes energy without improving the prespecified risk measure, or if the improvement is explained by another protocol or market change. Equal energy systems should be used as negative controls against any energy-only security mapping.

Causal realization

For AI and automation, prespecify numerator and denominator effects. Report first-stage energy effects, outcome effects, compliance, spillovers, interference, and missingness. If the energy effect is near zero, report a ratio-aware confidence set rather than a conventional bounded interval. Compare results with and without low-value, failed, repeated, and abandoned inferences. A value-per-joule estimate that improves only by deleting failures does not represent the deployment.

Marginal allocation and rebound

Allocation models should be back-tested against realized nodal prices, congestion, curtailment, deadlines, quality, and service delivery. Shadow-price interpretations fail when constraints or nonconvexities omitted from the model bind in operation. Flexible-load claims require measurement of response speed, recovery costs, and foregone service.

Rebound estimation needs a credible source of efficiency variation and a stable service definition. Researchers should report direct service demand, prices, complementary inputs, displaced work, and economy-wide effects over multiple horizons. A decline in device joules per task does not by itself test ϵQcog,ηQ\epsilon_{Q^{\mathrm{cog}},\eta_Q}.

National-account audit

Statistical compilers should trace every monetary entry to a source transaction or imputation and every physical entry to a lineage. The following adversarial questions should be answered:

  1. Does an AI outcome memorandum repeat sales or output already included in GVA?

  2. Is a protected asset position being added to a production flow?

  3. Does avoided loss overlap an insurance payment, revaluation, or service fee already recorded?

  4. Are primary energy, conversion output, and final use summed?

  5. Is embodied energy already contained in a lifecycle total?

  6. Do imports, residence, and time-of-recording rules match the monetary core?

  7. Does a composite ranking survive plausible normalizations and weights?

Claim ledger

Table 7 in Claim ledger
Claim Scope Status
JS-1 A measurement tuple and expanded boundary manifest are sufficient to state a reproducible conditional value-per-joule estimand. Sufficiency here concerns declaration, not empirical identification. PROVED
JS-2 Physical efficiency, exergy efficiency, useful work, task service, causal economic realization, and assurance are distinct typed objects. PROVED
JS-3 Exact typed stage yields telescope when every adjacent amount and type matches. No product-of-expectations claim is included. PROVED
JS-4 Energy normalization preserves numerator incompatibilities and does not define addition across work, task service, probabilities, stocks, or value flows. PROVED
JS-5 Non-dominating vectors can reverse order under admissible positive weights. Therefore the framework has no natural common scalar absent declared weights or a value functional. PROVED
JS-6 Under strict monotonicity and strictly positive weights, a weighted-sum maximizer is Pareto efficient. Unsupported frontier points may remain hidden without convexity. PROVED
JS-7 Primary, conversion-output, and final-energy appearances from one lineage cannot be added as independent energy inputs. PROVED
JS-8 AI output already recorded in GVA and protected asset stocks cannot be added to GDP as new production. PROVED
JS-9 QAIJ\operatorname{QAIJ} is a quality-adjusted task-service measure for a named task distribution, not a tokenizer-invariant measure of all intelligence. CONDITIONAL
JS-10 ALPJ\operatorname{ALPJ} can express modeled avoided loss per incremental joule under matched risk scenarios. Its empirical value depends on the threat and loss models. CONDITIONAL
JS-11 A ratio of causal value and energy effects requires a matched intervention, counterfactual, boundary, and horizon. PROVED
JS-12 The direct rebound identity classifies energy change by the demand elasticity. The magnitude of that elasticity in real AI markets is not established here. PROVED identity; OPEN magnitude
JS-13 Flexible AI and proof-of-work loads can participate in a modeled nodal market when their heterogeneous constraints and settlement rules are represented. CONDITIONAL
JS-14 The standard-library implementation enforces the documented generic type, boundary, lineage, Pareto, causal-ratio, and crosswalk contracts on its test fixtures. COMPUTATIONAL

Governance and reporting protocol

The Joule Standard can support engineering studies, market analyses, corporate reporting, and public statistics only if revisions remain inspectable. A conforming report should publish the following artifacts.

  1. Manifest. Every required boundary field in the equation, with a persistent identifier.

  2. Energy ledger. Component identifiers, physical lineages, stages, joules, metering or model source, and uncertainty.

  3. Outcome dictionary. Semantic types, units, orientations, populations, horizons, and evidence labels.

  4. Transduction graph. Stage inputs and outputs, interface mappings, missing edges, and evidence status.

  5. Vector results. Native outcome values, energy, normalized displays if used, and the Pareto frontier.

  6. Scalar views. Named decision purpose, normalization bounds, weights, aggregation rule, tie rule, and sensitivity analysis.

  7. Double-count audit. Source-flow and physical-lineage findings, bridges, and unresolved overlaps.

  8. Identification record. Intervention, counterfactual, estimator, uncertainty, missingness, spillovers, and external-validity limits.

  9. Software record. Versioned code, tests, exact inputs, and deterministic output where feasible.

Versioning should distinguish corrections to observations from changes in definitions. A changed weight vector creates a new scalar view. A changed energy stage creates a new denominator. A changed task distribution creates a new service estimand. Historical results should not be silently overwritten.

Minimum publication table

A human-readable summary can remain compact:

Table 8 in Minimum publication table
Field Required statement
Question The decision or descriptive question and functional unit.
Energy Stage, physical boundary, time, location, allocation, embodied scope, and uncertainty.
Outcome Semantic type, unit, population, direction, and evidence status.
Counterfactual The named alternative and identification design.
Result Native outcome, energy, conditional ratio if meaningful, and uncertainty.
Comparison Manifest match, bridges, Pareto relation, and sensitivity to declared views.
Nonclaims The downstream meanings not identified by the study.

Limitations

Limitation 25 (Type systems cannot validate semantics). The software can detect unequal labels, units, kinds, boundaries, and horizons. It cannot prove that a researcher gave a label its correct empirical meaning. Ontology governance, documentation, audit, and domain review remain necessary.

Limitation 26 (No automatic welfare function). The framework can carry a welfare functional and test its accounting interfaces. It cannot infer society’s welfare weights from energy use, prices, or statistical variance. Distributional and rights-based constraints may be more appropriate than a compensatory scalar.

Limitation 27 (Partial equilibrium). Several paper-level models are partial equilibrium. Prices, hardware supply, labor, institutions, and energy infrastructure can respond endogenously. Rebound and national-account effects require wider system models for economy-wide claims.

Limitation 28 (Tail risk and deep uncertainty). Expected loss can conceal fat tails, ambiguity, correlated failures, and irreversible outcomes. Scenario vectors, robust constraints, and stress tests may be preferable to an expected-value scalar.

Limitation 29 (Grid physics). The nodal direct-current formulation is useful for economic dispatch and congestion analysis. It omits reactive power, voltage, frequency dynamics, contingency detail, and device-level response. Production deployment requires the relevant engineering studies.

Limitation 30 (Benchmark validity). A quality-adjusted task measure is only as valid as its task distribution, scoring, human judgments, and operational match. Distribution shift can change both numerator quality and denominator energy.

Limitation 31 (National implementation). The source-tag and type audit is a minimum control. A statistical office needs the full SNA and SEEA compilation process, confidentiality protection, classification bridges, balancing, revisions, and institutional governance.

Conclusion

The research program began with a tempting quotient and ended with a boundary discipline. Joules are a common physical accounting unit. They allow systems to be metered, transformation lineages to be reconciled, marginal scarcity to be priced, and outcome ratios to be stated. They do not turn unlike consequences into one substance.

The Joule Standard therefore has a vector core. Useful work remains physical service. Quality-adjusted intelligence remains verified task service on a declared distribution. Realized economic value remains a counterfactual effect under a value functional. Proof-of-work assurance remains a scenario-conditioned risk and mechanism record. GDP remains a production flow, supplemented by physical and outcome memoranda. Every scalar is a conditional view whose normalization, weights, and evidence are open to inspection.

This architecture is less dramatic than a universal energy theory of economic value. It is also more usable. It tells an engineer why device energy is not facility energy, an AI evaluator why tokens are not service, a security analyst why hashrate is not assurance, an economist why adoption is not causal value, a grid operator why flexible loads need nodal constraints, and a statistician why memorandum outcomes are not additions to GDP. Most importantly, it makes disagreement legible. Analysts can dispute a boundary, threat model, task distribution, causal design, or weight vector without pretending that the dispute is about arithmetic.

Formal reporting schema

A machine-readable implementation may represent one study as the tuple 𝒟=(B,,𝒳,𝒯,𝒜,,𝒰),\mathcal D= (B,\mathcal E,\mathcal X,\mathcal T,\mathcal A,\mathcal I,\mathcal U), where:

BB

is the boundary manifest in the equation;

\mathcal E

is the energy inventory with component and lineage identifiers;

𝒳\mathcal X

is the typed outcome-axis dictionary;

𝒯\mathcal T

is the transduction graph;

𝒜\mathcal A

is the set of source-tagged accounting entries;

\mathcal I

is the identification and uncertainty record; and

𝒰\mathcal U

is the set of optional decision views.

Validation occurs in this order:

  1. validate required text, exact numeric domains, and identifiers;

  2. reject duplicate energy components, stages, candidates, and account entries;

  3. validate physical lineages and energy-stage totals;

  4. validate typed interfaces and direct comparisons;

  5. validate source-flow overlaps and integrated-account types;

  6. construct native-unit vectors and the Pareto frontier;

  7. validate normalization, orientation, weights, and tie rules for each optional scalar view; and

  8. publish refused operations alongside successful calculations.

The order matters for explanation, not for creating a scalar hierarchy. A record that fails the physical-lineage audit should be corrected before its ratio is interpreted. A valid physical ledger can still have an unidentified economic edge.

Worked audit cases

Token substitution

Suppose stage one outputs 8080 token-count units and stage two declares an input of 8080 verified-task-count units. Amount and display unit match. The semantic and accounting kinds do not. Composition is refused. An empirical mapping from tokens to verified tasks may be estimated, but it becomes a new stage with its own evidence status.

Protected exposure added to production

Suppose a settlement system supports transfers involving a 11 billion USD asset position, charges 22 million USD in service fees, and the relevant business records 11 million USD in GVA. The position is a stock or exposure. The fees and GVA are period flows with distinct accounting roles. The account does not report 1.0011.001 billion USD as new production.

Lifecycle plus operation

Suppose a lifecycle study allocates 120120 J to a functional unit, including 100100 J of operation and 2020 J of embodied energy. A separate site meter also reports the same 100100 J. Adding 120+100120+100 repeats operation. A legitimate two-panel report may display the lifecycle total and its components, or a current operational account plus a separately identified embodied increment.

Near-zero causal denominator

Suppose an intervention effect on value is estimated at 1010 USD while its energy effect is 0.10.1 J with standard error 0.20.2 J. The point ratio is 100100 USD/J, but the denominator is not separated from zero. Reporting the point ratio as a stable productivity estimate is misleading. The study should report the joint effect estimates and a ratio-aware confidence set, which may be unbounded or disjoint.

Weight-sensitive frontier

Suppose one allocation is better on task service and another is better on useful work, assurance, and energy. Neither is universally superior. The report publishes both frontier points, then shows the regions of the weight simplex in which each maximizes the declared score. A single preferred view may be selected for a decision, but the frontier remains available for audit.

Reproducibility map

The numeric labels below are stable contract identifiers, not the source-order positions of pytest functions.

Table 9 in Reproducibility map
Contract ID Adversarial condition Contract
Valid three-stage typed path. Direct ratio equals product of yields.
Token count substituted for task count. Interface type mismatch.
Money stock plus money flow; tokens plus tasks. Typed addition refused.
Facility and device manifests. Energy-stage mismatch reported.
Duplicate energy identifier; primary plus final stages. Both totals refused.
Unique facility operation plus embodied increment. Non-overlapping total accepted.
One source flow in GVA and a memorandum. Repeated-source and overlap findings emitted.
Work, task, and money outcome axes. Per-joule units remain distinct.
One dominated and two non-dominated systems. Only dominated system removed.
Scalar weights sum above one. View refused.
Two published positive weight vectors. Conditional choice reverses.
Effect estimates with matched and mismatched boundaries or populations. Only a fully matched causal ratio is accepted.
Zero energy effect. Finite causal ratio refused.
Valid and invalid assurance risks. Exact result, domain check.
Differential and finite rebound fixtures. Identities reproduced.
Canonical crosswalk. Papers 1 through 9 present exactly once.
Missing or misordered crosswalk. Validation refused.
Binary floating-point input. Exact numeric boundary enforced.
Canonical optional-node graph and token attachment. Immediate output, verified outcome, and token statistic remain distinct.
Lineage-complete monetary total and source alias. Unique sources sum; alias is refused.
Ratio of expectations versus mean of unit ratios. Estimand tags and different exact values retained.
High average value with low marginal slope. Average and marginal families remain separate.
Multi-stage path with an open realization edge. Conservative evidence join retains the open terminal status.
Manifests differing only in exclusions. Exclusion mismatch is reported and direct comparison is refused.

Checklist for an empirical Joule Standard claim

  1. State the decision question before selecting the denominator.

  2. Name the functional unit and target population.

  3. Publish the physical, temporal, spatial, causal, and institutional boundaries.

  4. Choose one coherent energy stage or publish a non-overlapping bridge.

  5. Retain idle energy, retries, failures, and shared infrastructure according to a declared rule.

  6. Define every numerator in native semantic and accounting units.

  7. Draw the transduction graph and label unsupported edges OPEN.

  8. Match numerator and denominator interventions for a causal ratio.

  9. Report joint uncertainty when the denominator is estimated.

  10. Keep task service distinct from tokens and realized value.

  11. Keep assurance vectors distinct from energy and gross protected stocks.

  12. Trace production memoranda to GVA source flows.

  13. Remove dominated alternatives before optional scalarization.

  14. Publish normalization, weights, tie rules, and sensitivity regions.

  15. State precise nonclaims and conditions that would falsify the result.

References

M. Long, “Value per Joule: Foundations of an Energy-Normalized Economics,” GrokRxiv:2026.07.value-per-joule, 2026.

M. Long, “From Exergy to Intelligence: A General Theory of Economic Transduction,” GrokRxiv:2026.07.exergy-to-intelligence, 2026.

M. Long, “Quality-Adjusted Intelligence per Joule,” GrokRxiv:2026.07.quality-adjusted-intelligence-per-joule, 2026.

M. Long, “Trust per Joule: The Thermoeconomics of Proof-of-Work Settlement,” GrokRxiv:2026.07.trust-per-joule, 2026.

M. Long, “Tokens Are Not Value: Economic Accounting for AI Inference,” GrokRxiv:2026.07.tokens-are-not-value, 2026.

M. Long, “Marginal Value of Energy in an Automated Economy,” GrokRxiv:2026.07.marginal-value-of-energy, 2026.

M. Long, “The Cognitive Rebound Effect: Why Efficient AI May Increase Energy Demand,” GrokRxiv:2026.07.cognitive-rebound-effect, 2026.

M. Long, “Energy Markets for Machine Intelligence and Cryptographic Settlement,” GrokRxiv:2026.07.energy-markets-for-machine-intelligence-and- cryptographic-settlement, 2026.

M. Long, “A Value-per-Joule National Accounting System,” GrokRxiv:2026.07.value-per-joule-national-accounting, 2026.

M. G. Patterson, “What is energy efficiency? Concepts, indicators and methodological issues,” Energy Policy, vol. 24, no. 5, pp. 377–390, 1996. https://doi.org/10.1016/0301-4215(96)00017-1.

R. U. Ayres and B. Warr, “Accounting for growth: the role of physical work,” Structural Change and Economic Dynamics, vol. 16, no. 2, pp. 181–209, 2005. https://doi.org/10.1016/j.strueco.2003.10.003.

B. Warr, R. Ayres, N. Eisenmenger, F. Krausmann, and H. Schandl, “Energy use and economic development: A comparative analysis of useful work supply in Austria, Japan, the United Kingdom and the US during 100 years of economic growth,” Ecological Economics, vol. 69, no. 10, pp. 1904–1917, 2010. https://doi.org/10.1016/j.ecolecon.2010.03.021.

C. E. Shannon, “A mathematical theory of communication,” Bell System Technical Journal, vol. 27, pp. 379–423 and 623–656, 1948. https://doi.org/10.1002/j.1538-7305.1948.tb01338.x.

R. Landauer, “Irreversibility and heat generation in the computing process,” IBM Journal of Research and Development, vol. 5, no. 3, pp. 183–191, 1961. https://doi.org/10.1147/rd.53.0183.

P. Mattson et al., “MLPerf Training Benchmark,” Proceedings of Machine Learning and Systems, vol. 2, pp. 336–349, 2020. https://proceedings.mlsys.org/paper_files/paper/2020/hash/ 411e39b117e885341f25efb8912945f7-Abstract.html.

P. Liang et al., “Holistic Evaluation of Language Models,” Transactions on Machine Learning Research, 2023. https://openreview.net/forum?id=iO4LZibEqW.

S. Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” 2008. https://bitcoin.org/bitcoin.pdf.

J. Garay, A. Kiayias, and N. Leonardos, “The Bitcoin Backbone Protocol: Analysis and Applications,” in Advances in Cryptology, EUROCRYPT 2015, pp. 281–310. https://doi.org/10.1007/978-3-662-46803-6_10.

E. Budish, “The Economic Limits of Bitcoin and the Blockchain,” NBER Working Paper 24717, 2018. https://doi.org/10.3386/w24717.

D. B. Rubin, “Estimating causal effects of treatments in randomized and nonrandomized studies,” Journal of Educational Psychology, vol. 66, no. 5, pp. 688–701, 1974. https://doi.org/10.1037/h0037350.

P. W. Holland, “Statistics and causal inference,” Journal of the American Statistical Association, vol. 81, no. 396, pp. 945–960, 1986. https://doi.org/10.1080/01621459.1986.10478354.

G. W. Imbens and D. B. Rubin, Causal Inference for Statistics, Social, and Biomedical Sciences. Cambridge University Press, 2015. https://doi.org/10.1017/CBO9781139025751.

United Nations et al., System of National Accounts 2025, adopted standard, pre-edit text consulted 23 July 2026. https://unstats.un.org/unsd/nationalaccount/docs/2025_SNA_Pre-edit.pdf.

United Nations et al., System of Environmental-Economic Accounting 2012: Central Framework, 2014. https://seea.un.org/content/seea-central-framework.

United Nations, System of Environmental-Economic Accounting for Energy, 2019. https://seea.un.org/content/seea-energy.

OECD and European Commission Joint Research Centre, Handbook on Constructing Composite Indicators: Methodology and User Guide, OECD Publishing, 2008. https://doi.org/10.1787/9789264043466-en.

A. Sen, Collective Choice and Social Welfare. Holden-Day, 1970.

M. Fleurbaey, “Beyond GDP: The quest for a measure of social welfare,” Journal of Economic Literature, vol. 47, no. 4, pp. 1029–1075, 2009. https://doi.org/10.1257/jel.47.4.1029.