Economic conditions on a learning campaign [ftip-00NY]
✍️source

The architecture refinement makes a model implementation explicit when it affects a comparison. Economic conditions play an analogous role: they determine which resource schedules can be supplied, while the original checker, task law and acquisition criterion remain fixed.

Definition 1. Economic state and admissible joint execution [ftip-00NZ]

Fix a horizon $T>0$ and a lineage specification $\Xi $. An economic specification $\Omega $ consists of an initial state $x_0$, causal transition laws, a class of policies, physical and financial constraints, and a measurable viability region $\mathcal V$. A state may contain productive capital $K$, maintained expertise $H$, accessible knowledge $D$, energy and hardware capacity $E$, and institutional capacity $J$. These coordinates name declared state variables; no production function or substitutability assumption follows from their names.

A joint execution $z=(P,\pi ,x,r)$ comprises a permitted lineage procedure $P$, a causal economic policy $\pi $, its state trajectory $x$, and an actual resource schedule $r$. Transitions may depend on admitted learning outcomes and deployment decisions. Feasibility requires that $r$ supplies every operation of $P$ and every charged economic activity at the time and place used, under the hard resource conventions. All work on search, synthetic generation, evaluation and controller changes is included. Missing output scores zero. The procedure $P$ includes the stopping and evaluation decisions induced by its resource schedule. Economic policies preserve the observation laws and information access permitted by $\Xi $; they supply no undeclared channel for target answers.

Let $\mathcal Z_{\rm phys}$ contain physically feasible joint executions. Financeable executions additionally satisfy specified balance sheets and funding constraints; viable executions also remain in $\mathcal V$ almost surely. Thus

\[\mathcal Z_{\rm viable}\subseteq \mathcal Z_{\rm fin} \subseteq \mathcal Z_{\rm phys}.\]

An equilibrium class is an additional restriction, not a synonym for all financeable choices. Welfare floors in $\mathcal V$ impose normative or institutional constraints unless physical necessity independently justifies them. Autonomy may maintain schools, public knowledge and power infrastructure; its access to new target-specific contributions remains controlled by $\Xi $.

Both arms disclose their endowments and use the same external accounting boundary. Currency outlays and physical resource coordinates remain separate. Buying electricity spends money and uses energy; these are two constraints on one transaction, not two independent monetary costs.

Definition 2. Economically conditioned potential [ftip-00O0]

For any admitted class $\mathcal Z$ of joint executions and acquisition score $Q_{\rm acq}(P)\in [0,1]$, define

\[\Phi (\Xi ,\Omega ,T;\mathcal Z)= \sup _{z\in \mathcal Z}Q_{\rm acq}(P_z).\]

Take the supremum of an empty class to be zero in the ordered interval $[0,1]$. For a nonnegative counted compute rate $u_z$, define the hard resource envelope

\[\overline B(T;\mathcal Z)= \sup _{z\in \mathcal Z}\operatorname *{ess\,sup} \int _0^T u_z(t)\,dt,\]

with zero for an empty class. The essential supremum is over the execution's declared randomness. A claim about expected expenditure alone does not bound this quantity. The compute unit is fixed by the operational semantics and must agree with any subsequent learning lower bound.

Class inclusion gives $\Phi (\mathcal Z_1)\leq \Phi (\mathcal Z_2)$ and $\overline B(\mathcal Z_1)\leq \overline B(\mathcal Z_2)$ whenever $\mathcal Z_1\subseteq \mathcal Z_2$, with other arguments fixed. Indeed every value in the first supremum also occurs in the second. A supremum need not be attained: $\Phi \geq \tau $ does not by itself provide a procedure with score at least $\tau $.

Context

Civilization, economic reproduction and capability [ftip-00NX]
📄PDF

September 13, 2026

Learning systems depend on productive capacity and on institutions that create, transmit and validate knowledge. Their training and deployment can change those conditions. This chapter extends the model-lineage framework by specifying economic trajectories alongside learning procedures. It studies the resources attainable before a deadline and the cost of acquiring contributions from a maintained knowledge-producing population.

An economic restriction and a computational difficulty are different premises. A resource envelope constrains what can be executed; a learning lower bound constrains what a task requires. A capability separation needs both, together with a realizable assisted procedure. The results below are conditional mathematical statements about specified models.

Economic conditions on a learning campaign [ftip-00NY]
✍️source

Definition. Economic state and admissible joint execution [ftip-00NZ]

\[\mathcal Z_{\rm viable}\subseteq \mathcal Z_{\rm fin} \subseteq \mathcal Z_{\rm phys}.\]

Definition. Economically conditioned potential [ftip-00O0]

For any admitted class $\mathcal Z$ of joint executions and acquisition score $Q_{\rm acq}(P)\in [0,1]$, define

\[\Phi (\Xi ,\Omega ,T;\mathcal Z)= \sup _{z\in \mathcal Z}Q_{\rm acq}(P_z).\]

Take the supremum of an empty class to be zero in the ordered interval $[0,1]$. For a nonnegative counted compute rate $u_z$, define the hard resource envelope

\[\overline B(T;\mathcal Z)= \sup _{z\in \mathcal Z}\operatorname *{ess\,sup} \int _0^T u_z(t)\,dt,\]

Finite-horizon resources and discovery difficulty [ftip-00O1]

Financing, hardware throughput and power supply constrain different coordinates of a learning schedule. Their uniform bounds can be combined without asserting that any bound is attainable. Infrastructure investment and algorithmic improvements belong among the policies being bounded.

proposition. A uniform finite-horizon compute envelope [ftip-00O2]

Suppose for every $z\in \mathcal Z$, almost surely, its nonnegative compute service rate $u_z(t)$ has monetary price $p_z(t)\geq p_*>0$, and

\[\int _0^T p_z(t)u_z(t)\,dt\leq F_T,\qquad u_z(t)\leq q(t),\qquad u_z(t)\leq e(t)P(t).\]

The deterministic functions are measurable and nonnegative; $0\leq F_T<\infty $, $q$ and $eP$ are integrable. Here $q$ bounds usable hardware throughput, $P$ available power, and $e$ compute per unit energy. These bounds hold over all admitted investments, prices, implementations and efficiency changes. Then

\[\overline B(T;\mathcal Z)\leq \min \left \{F_T/p_*,\int _0^T q(t)\,dt, \int _0^T e(t)P(t)\,dt\right \}.\]

Proof.

For each execution integrate the two rate inequalities. The expenditure inequality gives $p_*\int _0^T u_z(t)\,dt\leq F_T$ almost surely. Taking the essential supremum for each execution and then the supremum over executions preserves all three bounds.

This is a necessary envelope. It does not establish that its minimum can be spent on an arbitrary schedule or that its inputs describe a particular economy. An excluded financing source or a permitted efficiency improvement that violates the displayed premises invalidates that application of the bound.

proposition. Economic exclusion from an independent work lower bound [ftip-00O3]

Fix $0<\tau \leq 1$ and the autonomous procedure class admitted by $\Xi $. Suppose every such procedure attaining $Q_{\rm acq}\geq \tau $ requires a hard compute cap at least $L>0$: no implementation with a smaller almost-sure cap attains that score. If a uniform economic envelope $b$ satisfies $\overline B(T;\mathcal Z_{\rm aut})\leq b<L$, then no admitted autonomous execution reaches score $\tau $ by $T$.

Proof.

An admitted successful execution would implement an autonomous procedure with hard cap at most $b<L$, contradicting the work lower bound.

An economically feasible separation additionally requires an actual assisted execution achieving the same score and satisfying the shared external constraints. The scalar relation $U\leq b$ alone does not provide one: resource timing, memory, communication, contributor formation and evaluation must fit a supplied schedule.

The lower-bound premise must cover permitted representations, search, training and controller development. It is stronger than failure of a particular recipe. For the intended conceptual-discovery tasks, establishing such a lower bound remains part of the conjecture. The proposition makes a finite work lower bound operationally decisive when a separately justified economic envelope lies below it.

Knowledge reproduction and viable expenditure [ftip-00O4]

A learning campaign can divert resources from the productive knowledge stock that supports later learning. The following model gives a bound over all permitted allocations, including allocations that deliberately maintain that stock. It describes effective capacity to produce useful knowledge; copying a nonrival dataset does not consume its bytes. The distinction between use and access incentives is developed in Jones and Tonetti's economics of data.

Definition. A maintained productive knowledge stock [ftip-00O5]

Fix $A,\eta ,\delta >0$ with $g=\eta A-\delta >0$, and initial stock $h_0\geq h_{\min }>0$. Productive output is $Ah(t)$ per unit time, measured in a fixed consumption numeraire. Learning expenditure $v(t)$ and maintenance $m(t)$ exhaust output. Assume

\[v(t)+m(t)=Ah(t),\qquad \dot h(t)=\eta m(t)-\delta h(t)=gh(t)-\eta v(t).\]

An allocation on $[0,T]$ is admissible when $h$ is absolutely continuous, $v$ is measurable, $h(0)=h_0$, and almost everywhere $0\leq v(t)\leq Ah(t)$, while $h(t)\geq h_{\min }$ at every time. Randomized allocations must satisfy these conditions almost surely. The conversion $\eta $ and depreciation $\delta $ are model assumptions; no causal estimate of human deskilling is asserted.

The variable $v$ measures expenditure, not compute. To connect it to $u$ in the compute envelope, specify the service price and require $p(t)u(t)\leq v(t)$. The model excludes other productive assets and outside output. Applications that admit them must enlarge its state and recompute the bound.

proposition. A renewal bound valid for every admissible allocation [ftip-00O6]

Every allocation in Definition [ftip-00O5] satisfies

\[\int _0^T v(t)\,dt\leq \min \left \{\frac {Ah_0(e^{gT}-1)}{g}, \frac {h_0e^{gT}-h_{\min }}{\eta }\right \}.\]

Proof.

The stock equation gives $(e^{-gt}h(t))'=-\eta e^{-gt}v(t)\leq 0$ almost everywhere. Hence $h(t)\leq h_0e^{gt}$. Integrating $v\leq Ah$ gives the first bound. Integrating the discounted stock equation gives

\[\eta \int _0^T e^{-gt}v(t)\,dt =h_0-e^{-gT}h(T)\leq h_0-e^{-gT}h_{\min }.\]

Since $v\geq 0$ and $e^{-gt}\geq e^{-gT}$, multiplication by $e^{gT}$ gives the second bound. The argument is pathwise, so it also covers randomized causal allocations satisfying the hypotheses.

The bound is necessary and need not be attained. With a positive service-price lower bound $p_*$, division by $p_*$ supplies a compute envelope and can be used in proposition [ftip-00O3]. The relevant autonomous lower bound is still independent of this stock calculation. The bound increases with $T$; it makes no finite lifetime claim.

Financing as a constrained balance sheet [ftip-00O7]

Expenditure must be financed even when hardware and power are physically available. Conversely, a fall in household income need not imply a fall in funds available for training. The following accounting model states exactly which funds enter the resource envelope.

Definition. A finite-horizon learning account [ftip-00O8]

Let $b(t)$ be an absolutely continuous liquid balance with $b(0)=b_0\geq 0$. Let $f(t)\geq 0$ be admitted inflows, $o(t)\geq 0$ other outlays, $u(t)\geq 0$ the counted compute rate, and $p(t)>0$ its price. Assume these flows are measurable and integrable, and the balance equation holds almost everywhere. The account satisfies

\[\dot b(t)=f(t)-p(t)u(t)-o(t),\qquad b(T)\geq 0.\]

All quantities are measured over the same institutional boundary and time interval. Inflows include operating receipts, equity, grants and debt proceeds whenever admitted; debt service and terminal obligations enter outlays or a stronger terminal-balance condition. Receipts recycled within this account are not counted again as external funding. A restriction to retained earnings is a special financing model, not a property of AI.

For a resource envelope, require a uniform bound $\int _0^T f(t)\,dt\leq F$ over the admitted policies, with $0\leq F<\infty $. Expected inflows alone do not impose this almost-sure bound. Unlimited refinancing violates this premise unless some separate constraint bounds its cumulative proceeds.

proposition. A compute bound from financed expenditure [ftip-00O9]

If Definition [ftip-00O8] holds and $p(t)\geq p_*>0$, then

\[\int _0^T u(t)\,dt\leq \frac {b_0+F}{p_*}.\]

Proof.

Integration of the balance sheet gives

\[\int _0^T p(t)u(t)\,dt =b_0-b(T)+\int _0^T f(t)\,dt-\int _0^T o(t)\,dt \leq b_0+F.\]

Apply the price lower bound. If the premises hold uniformly almost surely, the same bound holds for the hard envelope over all executions.

This establishes the financing term in proposition [ftip-00O2] from an explicit account. It does not derive $F$ from aggregate output or welfare. A concrete model must establish the inflow bound while admitting its actual investment, borrowing and redistribution mechanisms.

Competitive automation and retained training finance [ftip-00OA]

The AI Layoff Trap, Proposition 1, gives a static model in which firms internalize their own cost savings but only part of a demand loss. The calculation below reproduces its interior game and derives a conditional financing consequence. Cooperation here means maximizing joint firm profits; it is not a general social optimum. Appendix A of the paper leaves saving, investment and interest-rate closure outside the baseline model.

Definition. An interior automation game [ftip-00OB]

Fix an integer $N>1$, $L,k>0$, and $0<\ell <s<k+\ell / N$. Firm $i$ chooses $\alpha _i\in [0,1]$, average automation is $\bar \alpha =N^{-1}\sum _i\alpha _i$, and its profit is

\[\pi _i=\Pi _0+L\left (s\alpha _i-\ell \bar \alpha -\frac {k}{2}\alpha _i^2\right ).\]

The saving $s$ and demand leakage $\ell $ are fixed parameters. In the seed model $s=w-c$ and $\ell =\lambda (1-\eta )w$, with wage $w$, automation cost $c$, spending propensity $\lambda $ and replacement-income fraction $\eta $. These are static parameters; they do not specify training expenditure or a law of economic development.

Strict concavity gives the unique Nash choice and the unique joint-profit maximizing choice, both interior:

\[\alpha ^{\rm NE}=\frac {s-\ell / N}{k},\qquad \alpha ^{\rm CO}=\frac {s-\ell }{k}.\]

Proof.

Differentiate individual profit in $\alpha _i$ to obtain $L(s-\ell / N-k\alpha _i)$. Differentiate total profit in each choice to obtain $L(s-\ell -k\alpha _i)$. The stated inequalities put both stationary choices strictly between zero and one; negative second derivatives establish the maxima.

proposition. Retained-finance loss under the competitive allocation [ftip-00OC]

In Definition [ftip-00OB], write total profit at a common choice $a$ as $\Pi (a)=N\Pi _0+NL((s-\ell )a-ka^2/2)$. Then

\[\Delta \Pi =\Pi (\alpha ^{\rm CO})-\Pi (\alpha ^{\rm NE}) =\frac {NLk}{2}(\alpha ^{\rm NE}-\alpha ^{\rm CO})^2>0.\]

Proof.

Complete the square around $a=(s-\ell )/k$. The difference of the choices is $\ell (1-1/N)/k>0$.

Suppose both total profits are nonnegative, a fixed fraction $\rho \in [0,1]$ funds the next training round, outside finance is unavailable, and its compute price is a fixed $p>0$. The difference between the monetary training allocations is $\rho \Delta \Pi $, and the difference between their financially purchasable compute quantities is $\rho \Delta \Pi / p$. This follows directly from the stipulated rule $C(a)=\rho \Pi (a)/p$; other physical constraints can prevent those quantities from being realized.

The result compares two allocations. It does not bound all autonomous policies, which may coordinate, borrow or maintain demand when permitted. For $\rho =0$ the financing difference vanishes. Changing institutions or adding productive investment changes the model rather than contradicting the displayed algebra.

Distributed expertise and reliable acquisition [ftip-00OD]

A maintained population can preserve distinct lines of experience and produce useful representations, criticism and proofs. The mathematical question is whether a recipient can find, validate and acquire useful structure at a lower total cost. Diversity alone supplies no probability bound. The following protocol strengthens the single-consultation result with explicit conditions for repeated acquisition.

Definition. Costed consultation with observable certification [ftip-00OE]

Fix the shared task, checker, evaluation law and endowments from the lineage specification. Preparation of the contributor population and recipient costs at most $S\geq 0$ in one declared additive resource unit. For a fixed integer $k\geq 1$, a causal protocol makes at most $k$ attempts, each with hard cost at most $c\geq 0$. Each attempt includes selection of a contributor, communication, recipient learning, validation, and any reset. Retention, final selection and evaluation are also charged within these caps. All remaining resource coordinates require a feasible schedule.

An attempt either returns an observable certificate with a frozen recipient artifact or reports failure. The protocol returns the first certified artifact, continuing after each failure until certification or $k$ failures; in the latter case it returns a declared fallback. Contributor access is removed for fresh evaluation. Let $Z\in [0,1]$ be the resulting score. Assume $0<q\leq 1$ and $0<\beta \leq 1$ such that:

At every prior failure history reached with positive probability, the conditional probability of certification on the next attempt is at least $q$. For general history spaces this condition holds almost surely.
For every possible selected certificate history, the conditional expected fresh-evaluation score of that retained artifact is at least $\beta $, again almost surely.

The second premise is a soundness requirement for acquired capability, including any effect of selection. A proof checked on an observed task or a finite validation score need not imply it. Establishing such soundness, affordable contributor access and the first probability bound remains a substantive obligation for an application. Independent attempts are not required.

proposition. A reliable acquisition bound [ftip-00OF]

The protocol in Definition [ftip-00OE] has hard additive cost at most $U=S+kc$ and attains

\[Q_{\rm acq}=\mathbb E Z\geq \beta \bigl (1-(1-q)^k\bigr ).\]

Proof.

Let $F_j$ denote failure of the first $j$ attempts, with $F_0$ certain. Conditional certification gives $\Pr (F_j)\leq (1-q)\Pr (F_{j-1})$, hence $\Pr (F_k)\leq (1-q)^k$. Conditional soundness at the first selected certificate and nonnegativity on failure imply $\mathbb E Z\geq \beta \Pr (F_k^c)$. Summing the preparation and attempt caps proves the cost claim, including early stopping.

If $0<q<1$ and $0<\tau <\beta $, the choice

\[k=\left \lceil \frac {\log (1-\frac {\tau }{\beta })}{\log (1-q)}\right \rceil \]

ensures $Q_{\rm acq}\geq \tau $. If $q=1$, one attempt suffices for $\tau \leq \beta $. For example, $q=1/4$, $\beta =0.9$ and $k=8$ give $Q_{\rm acq}\geq 0.9(1-(3/4)^8)>0.8$; this is an illustration of the assumptions, not an empirical estimate.

Together with an actual economically viable schedule for this protocol and an independent autonomous hard-work lower bound $L>U$, this supplies the assisted construction needed in proposition [ftip-00O3], whenever the autonomous economic envelope is below $L$. Here $U$, $L$ and that envelope must use the same counted resource unit, with any conversion explicitly justified. A low scalar cost does not establish the schedule or the lower bound.

Civilizational preparation and shared costs [ftip-00OG]

A contributor population can serve many campaigns. Economies from sharing its preparation are meaningful only for an actual portfolio and under the same accounting treatment given to shared model pretraining. The following comparison makes the amortization and its quantifiers explicit.

Definition. A portfolio with charged preparation [ftip-00OH]

For difficulty $n$, fix $R\geq 1$ specified tasks, their common evaluation convention and a portfolio success condition: each task's recipient attains expected fresh-task score at least $\tau $. An admitted assisted construction pays preparation $S(n)$ once and at most $c(n)$ per task, including failed consultations and acquisition. Its actual joint schedule therefore has additive work at most

\[U_R(n)=S(n)+R c(n),\qquad \frac {U_R(n)}{R}=\frac {S(n)}{R}+c(n).\]

This charges the whole preparation cost to the portfolio. A single campaign does not gain extra cash from anticipated future users. Count maintenance over the service interval and capacity needed for all tasks in $S$ or $c$; peak resources and time come from the actual schedule, not this sum.

Let $L_R(n)>0$ be a lower bound on the total hard additive work of every admitted autonomous portfolio meeting the same success condition, including permitted shared training and development. One cannot obtain $L_R$ by adding isolated-task lower bounds without proving that sharing does not invalidate the result. Marginal comparisons may disclose sunk preparation on both sides; lifecycle comparisons must charge both.

proposition. A conditional asymptotic portfolio advantage [ftip-00OI]

Under Definition [ftip-00OH], suppose actual assisted schedules exist and, for integers $n\geq 1$, constants $C_s,C_c,c_0>0$, exponents $a,b,d\geq 0$ and $r>0$,

\[S(n)\leq C_s n^a,\qquad c(n)\leq C_c n^b,\qquad R(n)=\lceil n^r\rceil ,\qquad L_{R(n)}(n)\geq R(n)c_0 n^d.\]

If $\max \{a-r,b\}<d$, then

\[\frac {U_{R(n)}(n)}{L_{R(n)}(n)}\longrightarrow 0.\]

Proof.

Since $R(n)\geq n^r$,

\[0\leq \frac {U_{R(n)}(n)}{L_{R(n)}(n)} \leq \frac {C_s}{c_0}n^{a-r-d} +\frac {C_c}{c_0}n^{b-d}\longrightarrow 0.\]

For instance, $a=2,b=0,r=2,d=1$ obeys the exponent condition. The displayed lower bound on autonomous portfolios is still a hypothesis; the calculation does not establish it for conceptual discovery. The result identifies a possible macroeconomic route: sustained expertise serves many tasks while each recipient acquires a comparatively inexpensive contribution. If autonomous preparation is equally reusable, the proposed $L_R$ may fail.

Alternative mathematical models and failure conditions [ftip-00OJ]

Economic dependence does not fix the sign or magnitude of feedback. The models below isolate assumptions under which continued learning is sustainable, expertise is replenished or a machine can reconstruct the assisted process. Each is a mathematical alternative with stated premises, not a fitted description of the economy. The equations are elementary illustrations; links identify related research rather than attributing these particular equations to those papers.

Example. A maintained stock can finance training forever [ftip-00OK]

In Definition [ftip-00O5], choose constant expenditure $v(t)=gh_0/\eta $ and maintenance $m(t)=\delta h_0/\eta $. Since $g=\eta A-\delta >0$, these are nonnegative and sum to $Ah_0$. The stock equation gives $h(t)=h_0\geq h_{\min }$ for all $t\geq 0$, so the allocation is admissible on every finite interval and

\[\int _0^T v(t)\,dt=\frac {gh_0}{\eta }T\longrightarrow \infty .\]

At a fixed compute price $p>0$, a service with constant physical capacity at least $gh_0/(\eta p)$ can supply that positive compute rate indefinitely. Thus maintenance dependence and a finite bound for each deadline are compatible with infinite lifetime compute. No conclusion about unbounded capability follows without a learning model.

Example. Productive investment expands the envelope [ftip-00OL]

Consider a single productive capital stock $K_0>0$, output $AK$, depreciation $\delta _K>0$ and allocation fractions $s,\theta >0$ with $s+\theta \leq 1$. Invest $sAK$, spend $\theta AK$ on training, and allocate the remainder to other uses. If $A>0$ and $\gamma =sA-\delta _K>0$, then

\[\dot K=\gamma K,\qquad K(t)=K_0e^{\gamma t},\qquad \int _0^T\theta AK(t)\,dt =\frac {\theta AK_0}{\gamma }(e^{\gamma T}-1).\]

These identities follow by solving the linear stock equation and integrating output. With service price $p>0$ and sufficient installed service capacity, division by $p$ gives affordable compute. For $T>0$, this expenditure exceeds the frozen-capital estimate $\theta AK_0T$, since $e^{\gamma T}-1>\gamma T$. That estimate cannot bound this policy. The model assumes investment converts into usable capital without delay; construction lags and essential complements require additional states.

Aghion, Jones and Jones study AI and economic growth with production and idea-generation mechanisms. Caballero analyzes a richer financing and capital-installation mechanism with alternative long-run outcomes. Neither citation makes the exponential path here an empirical forecast.

Example. Knowledge renewal depends on useful yield [ftip-00OM]

Let $D(t)$ denote effective task-relevant coverage, rather than raw token count. Suppose useful new human input arrives at rate $h\geq 0$, synthetic generation at rate $v\geq 0$ has effective yield $a\geq 0$, and coverage depreciates at rate $\delta _D>0$. Under the stipulated law

\[\dot D=h+av-\delta _DD,\qquad D(t)=D_*+(D_0-D_*)e^{-\delta _Dt},\qquad D_*=(h+av)/\delta _D.\]

Direct differentiation verifies the solution. For a required coverage $D_{\min }>0$, if $D_0\geq D_{\min }$ and $h+av\geq \delta _DD_{\min }$, then $D(t)\geq D_{\min }$ at every time. If $h+av<\delta _DD_{\min }$ and $D_0$ is finite, the path eventually falls below the threshold. The necessary synthetic contribution is exactly $av\geq \max \{0,\delta _DD_{\min }-h\}$. Positive synthetic yield is necessary when human inflow leaves a deficit; an affordable schedule must also produce and check the generated material.

The scalar law omits distributional coverage and estimation error. The contrast between recursive replacement in Shumailov et al., accumulation in Gerstgrasser et al., and consistency conditions in Barzilai and Shamir is a reason to specify $a$ and the learning process, not to assume that every generated token has fixed positive knowledge value.

Example. Essential and substitutable expertise give different restrictions [ftip-00ON]

Let $H,M\geq 0$ denote usable human and machine expertise. Under perfect substitution, effective expertise is $E=H+\chi M$ with $\chi >0$. The productive requirement $E\geq E_{\min }>0$ is satisfied with $H=0$ whenever $M\geq E_{\min }/\chi $. Under essential complementarity, take $E=\min \{H,\chi M\}$ instead. Then $E\geq E_{\min }$ implies $H\geq E_{\min }$. Both claims follow directly from the definitions.

A human-stock floor can therefore represent either an explicit social constraint or an indispensable productive input. The latter interpretation requires a complementarity premise. An economic model does not prove biological exclusivity merely by naming one coordinate human expertise. The organization and substitution of knowledge also depend on communication and access, as modeled by Ide and Talamàs.

Example. Assistance can maintain or erode expertise [ftip-00OO]

Fix maintenance $m\geq 0$, assistance intensity $a\geq 0$, and parameters $\eta ,\delta _0>0$, $\xi ,\delta _1\geq 0$. Consider

\[\dot H=\eta m+\xi a-(\delta _0+\delta _1a)H,\qquad H_* =\frac {\eta m+\xi a}{\delta _0+\delta _1a}.\]

Here $\xi a$ models learning produced by assistance and $\delta _1aH$ models lost practice. The solution is $H(t)=H_*+(H_0-H_*)e^{-(\delta _0+\delta _1a)t}$. If $H_0\geq H_{\min }$, the stock stays above that floor for every $t\geq 0$ exactly when $H_*\geq H_{\min }$; if the stationary stock is smaller, it eventually crosses below. For a finite deadline $T$, monotonicity instead makes viability equivalent to $H(T)\geq H_{\min }$, which may hold even when the stationary stock is smaller. Moreover,

\[\frac {dH_*}{da}= \frac {\xi \delta _0-\delta _1\eta m}{(\delta _0+\delta _1a)^2}.\]

Differentiation shows that the sign depends on the stated parameters. Neither automatic deskilling nor automatic skill improvement follows from assistance alone. Bastani et al. study learning outcomes under different assistance designs; their particular experiment does not identify universal coefficients for this stock law. Assistance and maintenance costs must also fit the resource account.

proposition. Affordable autonomous reconstruction removes the gap [ftip-00OP]

Fix one admitted assisted campaign with final score $Z\in [0,1]$. Suppose an autonomous campaign is admitted under the same external resource caps and evaluation convention, with simulation, development and recipient learning fully charged. If its joint law of transcript, retained artifact and fresh evaluation agrees with that of the assisted campaign, then its expected acquisition score is identical.

Proof.

The acquisition score is the expectation of the same bounded measurable score function under equal laws.

More generally, if these laws have total variation distance at most $\varepsilon $, where $\operatorname {TV}(P,Q)=\sup _A|P(A)-Q(A)|$, then $|\mathbb E_PZ-\mathbb E_QZ|\leq \varepsilon $. Indeed, $\mathbb E_PZ=\int _0^1P(Z>t)\,dt$, and the probability difference in each integrand is at most $\varepsilon $. Thus the autonomous score is at least $Q_{\rm acq}^{\rm assisted}-\varepsilon $.

Approximate agreement of output laws does not establish an almost-sure resource cap: admission of the autonomous implementation is a separate premise. Nor does computability establish affordable reconstruction of the contributor's development and observations. This is the economic version of the reconstruction boundary; a claimed separation must exclude such an affordable implementation by an actual lower bound.

Backlinks

How to read these notes [ftip-00NW]

The seven chapters connect learning mechanisms, computational constraints, agent reliability, evaluation, capability growth and economic conditions. The diagram shows their main logical relationships. Solid arrows indicate concepts used by another analysis. The dashed branch supplies architecture-specific detail for comparisons involving a particular model implementation or optimizer.

$\text{[math]}$

Post-training and agent state are complementary sources of capability change: one changes learned parameters, while the other manages interaction, computation and retained artifacts. Evaluation studies the evidence for those changes and their limits. Architecture analysis connects the comparison to the model's computation and optimization. The lineage analysis extends it to discovery and learning across generations. Economic analysis then asks how productive capacity, knowledge renewal and financing make the required resources available, and how learning changes those conditions.

Foundations and interfaces introduces capability claims, token probabilities, pretraining, tasks and environments. These interfaces allow the later analysis to specify a model without requiring a particular neural architecture.
Post-training, alignment, and feedback develops fine-tuning, preference learning, RLHF, DPO, RLVR and agentic training, with concrete objectives, feedback mechanisms and update procedures.
Agent state, computation, and reliability studies persistent state, retained context, recursive execution, failure modes and reliability. It separates changes to agent behavior from changes to model weights while examining their interaction.
Evaluation, evidence, and finite limits fixes the comparison law and costs, studies transport to other evaluations, and develops finite results about discovery, support, feedback and proxy error. Its closing synthesis collects the consequences and counterexamples.
Architecture-conditioned potential and computation begins with a decoder-only Transformer, then studies architecture, optimization geometry and matched-compute capability comparisons. This branch uses the evaluation framework to make implementation-specific claims.
Conceptual discovery across model generations studies discovery and learning across successive artifacts. It develops the complete lineage, independently developed contributions, representation learning, curricula and mathematical research settings, alongside the conjecture and arguments that could establish or defeat it.
Civilization, economic reproduction and capability conditions learning on feasible economic paths. It develops knowledge renewal and financing bounds, reliable acquisition from contributors, shared preparation costs, and alternative models with different implications for continued learning.

The research question and scope introduces the common distinctions between elicitation, acquisition, computation and evaluation. Questions about fine-tuning, preferences, rewards and interaction lead to the post-training chapter. Questions about memory, tools, recursive execution and reliability lead to the agent chapter. Both use the model, task and environment interfaces in the foundations.

Questions about a particular model implementation or optimizer are developed in the architecture chapter. Its decoder-only reference, optimization geometry and matched-compute comparisons explain how capability claims depend on the computation that implements the model. The shared evaluation framework supplies the task laws and resource comparisons used in that analysis.

Claims about a capability gain or limit are examined in independent evaluation and post-training potential and the following finite results and counterexamples. These sections distinguish training reward from evaluation evidence, examine transport to other task laws, and make the assumptions behind a bound explicit. Training, search and deployment costs have distinct roles in those comparisons.

Questions about reusable concepts and capability growth across generations are developed in conceptual discovery. Its complete lineage, acquisition criterion and conjecture specify the autonomous and contributed processes being compared. Contributor development, learned representations, curricula and mathematical research provide concrete settings for that open question.

Questions about the origin of a learning budget begin with economic state and admissible paths and the uniform resource envelope. The knowledge-renewal model and financing account give distinct constraints; the automation game studies an equilibrium effect under a narrower institutional assumption. The contribution protocol and portfolio comparison specify possible cost advantages. Read these with the alternative mathematical models: they show which maintenance, investment, substitution and simulation assumptions can prevent a proposed separation. Each proved implication is conditional; none alone establishes a universal training ceiling or the open conceptual-discovery lower bound.

Architecture-indexed ceilings and matched compute [ftip-00JF]

This optional section refines the architecture-neutral capability framework only when the question names an architecture, optimizer, or systems implementation. The general model/interface formulation remains available when these fields are unnecessary.

Architecture comparisons below are conditional on a declared task family, evaluation law, intervention class, and scalar cost. Toy bounds are finite results under their displayed assumptions and do not transfer to concrete model instances without verified interface, task, and cost assumptions.

Architecture, optimizer, and systems variables [ftip-00JG]

Architecture, optimizer, and systems fields refine the model/interface description. A comparison depends only on the fields named in its assumptions and conclusion.

Definition. Optional architecture refinement [ftip-00JH]

Let $M$ denote an existing model intervention. An architecture refinement is a record $A=(\mathcal X,\mathcal Y,\operatorname {Map}_A)$ whose map realizes the same declared input and output interface. Forgetting $A$ returns $M$; no architecture claim is made when the field is omitted.

Definition. Optimizer and systems records [ftip-00JI]

When needed, extend the record by $O$ for optimizer and state-update rules, and $S$ for kernels, precision, memory, cache, and scheduling. The triplet $(A,O,S)$ is descriptive; it is not a scalar intelligence score.

Definition. Architecture-indexed evaluation functional [ftip-00JJ]

Fix an architecture $A$, its base artifact, a declared intervention set $\mathfrak I_A$, and the common evaluation interface of Convention [ftip-005D]. Each $\eta \in \mathfrak I_A$ specifies a protocol $P_{A,\eta }=\operatorname {PostTrain}(A,\eta )$ in that measurable and absolutely integrable evaluation domain, with real performance $J_{\rm ev}(P_{A,\eta })$. Let $c_A(\eta )\in [0,+\infty ]$ be its scalar cost under the study's declared accounting rule: a fixed measured cost or an expected nonnegative cost, as specified. For a finite budget $C\in \mathbb R_{\geq 0}$, define \[ V_A(C)=\sup \left \{ J_{\rm ev}(P_{A,\eta }): \eta \in \mathfrak I_A,\ c_A(\eta )\leq C \right \}\in \overline {\mathbb R}. \] Infinite-cost interventions are infeasible at every such budget.

As in Definition [ftip-005M], the empty feasible set has value $-\infty $; an unbounded-above feasible score set has value $+\infty $. The value is real exactly when that set is nonempty and bounded above. Increasing $C$ enlarges the feasible set, so $V_A$ is nondecreasing. A finite supremum need not be attained by any intervention.

Frontier differences and derivatives are ordinary real operations only where the relevant values are finite, with differentiability additionally required for a derivative. Cost ratios use the domain in Definition [ftip-00JP]. The allowed intervention set, evaluation law, and accounting rule are part of the definition, so $V_A$ is not a universal intelligence function.

Remark. Architecture-neutral projection and gradual complexity [ftip-00JK]

A statement that depends only on the model/interface map is invariant under changes to architecture $A$, optimizer $O$, or systems $S$ that leave that map fixed. A conclusion about one of those fields instead requires assumptions that distinguish its possible values.

Definition. Three ceiling layers [ftip-00JL]

For fixed task and evaluation laws, distinguish the representational ceiling of $A$, the optimizer-reachable ceiling of $(A,O)$, and the systems-feasible frontier of $(A,O,S,C)$. Each layer is conditional on the objects named; none implies that the next layer attains it.

Remark. Architecture effects are comparative estimands [ftip-00JM]

A difference between two architectures is meaningful only after the task, data, post-training, inference, evaluation, and cost records identify which coordinates are held fixed and which are allowed to vary.

Depth reuse and latent recurrence [ftip-00KG]

Repeated depth, latent feedback, and recirculation change the computation performed at inference. Relative to the fixed reference autoregressive Transformer, their costs include any extra passes, state, and prefill work.

Definition. Computation-axis record [ftip-00KH]

For an architecture record $A$, distinguish token steps, feed-forward depth passes, recurrent passes, and latent-state updates. Let $d(A,r)$ be the declared number of depth passes in run $r$; it is a computation coordinate, not a synonym for parameter count or reasoning quality.

Remark. Looped Transformers as a source result [ftip-00KI]

Giannou et al. show that a fixed shallow Transformer placed in a loop can execute programmed iterative computations, including conditional branches and in-context algorithms, in Looped Transformers as Programmable Computers[giannou2023looped]. This is a source result under its program, state, and precision assumptions; it is not a universal claim about language-model capability.

Remark. Parameter sharing and width tradeoffs [ftip-00KJ]

Xue et al. report that depth sharing can reduce trainable parameters while limiting modeling capacity, and study width and mixture-of-experts remedies in Go Wider Instead of Deeper[xue2021wider]. The comparison is empirical and task-specific; it does not identify a depth-independent ceiling.

Remark. Virtual logical depth and scaling [ftip-00KK]

Zhu et al. vary virtual logical depth by reusing weights and report reasoning gains at nearly fixed parameter count in Beyond Parameters: Exploring Virtual Logic Depth for Scaling Laws[zhu2025virtualdepth]. Their results motivate a depth coordinate in a scaling study, while leaving knowledge capacity, optimization, and transfer dependent on the declared training and evaluation protocol.

Remark. Recirculation as an inference intervention [ftip-00KL]

Mozer et al. introduce inference-time recirculation that feeds latent states back through an off-the-shelf model and report task improvements in Recirculation[mozer2026recirculation]. The added serial prefill and adaptive tuning belong in the systems and inference records; the observation is not a proof of a new representational ceiling.

Remark. Latent feedback with a preserved Transformer interface [ftip-00KM]

Wang et al. widen the feedback channel between decoding steps with latent feedback while retaining a Transformer and language-modeling interface in Full-bandwidth transformer[wang2026fullbandwidth]. Any reported token or accuracy savings are conditional on the scheduled multi-pass training and measured decoding cost.

Remark. Latent prediction as a training intervention [ftip-00KN]

Teoh et al. add next-latent prediction to next-token training and report compact predictive states without changing the Transformer interface in Next-Latent Prediction Transformers Learn Compact World Models[teoh2025nextlatent]. This belongs to the training intervention record, not to an architecture-only comparison.

Example. Equal parameters do not fix effective depth [ftip-00KO]

Two runs can share parameter count while using different numbers of recurrent or latent-feedback passes. A matched study must therefore report the computation-axis record and cannot infer an architecture ceiling from parameters alone.

Definition. Depth-reuse model-instance record [ftip-00KP]

For a depth-reuse comparison, record shared weights, pass count, stopping rule, recurrent state, training objective, token and pass FLOPs, prefill and decode latency, memory, and evaluation seeds. A pass-count change is an intervention even when the parameter tensor is unchanged.

Example. Fixed-recipe depth comparison [ftip-00KQ]

In a fixed-recipe arm, hold data, optimizer, feedback, stopping rule, and evaluation law fixed while varying only the declared depth-reuse intervention. The resulting difference is an estimand for that recipe, not a best-achievable comparison.

Remark. Scaling surfaces rather than a single law [ftip-00KR]

A depth-reuse study may fit a surface over parameters, tokens, passes, and cost. The fit is an empirical summary over its measured range; it does not establish an asymptotic law or a universal saturation point.

Remark. Architecture and training are separable records [ftip-00KS]

Weight sharing, latent objectives, and recirculation can alter optimization without changing the declared external interface. The comparison must retain architecture, training intervention, and systems coordinates separately.

Remark. Depth reuse across passes, parameters, and tasks [ftip-00KT]

The cited looped, virtual-depth, latent-feedback, and recirculation results do not show that more passes always improve capability, that parameter sharing dominates added parameters, or that inference-time gains transfer to training or to another task family. Each transfer requires a matched model-instance record.

Ceilings, frontiers, and saturation [ftip-00JN]

Definition. Fixed-recipe and tuned frontiers [ftip-00JO]

The fixed-recipe frontier evaluates one common $\eta $. The equal-tuning frontier permits architecture-specific choices from a predeclared trial set with the same tuning data and budget. The restricted envelope permits a predeclared class of interventions under $C$. These are distinct estimands.

Definition. Iso-quality cost ratio [ftip-00JP]

For a finite real target $q\in \mathbb R$ and the frontier of Definition [ftip-00JJ], define the inverse cost \[ C_A(q)=\inf \{C\in \mathbb R_{\geq 0}:V_A(C)\geq q\} \in [0,+\infty ], \qquad \inf \varnothing =+\infty . \] The iso-quality ratio is defined only on the domain \[ \rho _{A/B}(q)=\frac {C_A(q)}{C_B(q)}, \qquad 0\leq C_A(q)<+\infty , \quad 0<C_B(q)<+\infty . \] The architectures must use the same target, evaluation interface, cost units, and comparison arm. The ratio compares efficiency under these choices.

An inverse cost is a threshold infimum, not an executable minimum. The infimum over budgets may be unattained; even if a budget satisfies $V_A(C)\geq q$, its performance supremum may be unattained at $q$. An actual target-achieving intervention requires a separate witness.

Positive individual costs do not guarantee a positive inverse cost. For interventions $\eta _n$, $n\geq 1$, with score $1$ and cost $1/n$, the target $q=1$ has $C_A(1)=0$, although every intervention costs more than zero. If both architectures have this family, the putative ratio is $0/0$ and is excluded by the displayed domain.

Definition. Operational cost vector and scalarization [ftip-00JQ]

Record training FLOPs, inference FLOPs, wall time, memory, energy, and hardware separately as $\mathbf c$. A scalar cost $C=w\cdot \mathbf c$ is a declared study choice with nonnegative units $w$; changing $w$ changes the frontier and must not be hidden as architecture quality.

Theorem. Finite-window representational obstruction [ftip-00JR]

Consider a causal system whose state after each prefix has at most $K$ distinct values, and a task with $K+1$ prefixes requiring pairwise distinct continuation labels. By the pigeonhole principle two prefixes share a state, so at least one continuation label is wrong. This is a finite toy obstruction only; it does not bound a concrete Transformer or KDA instance without a proved reduction to this state model.

Theorem. A conditional saturation certificate [ftip-00JS]

Let $V_A$ be the nondecreasing frontier of Definition [ftip-00JJ], bounded above by a finite $U\in \mathbb R$. If an intervention reaches a real target $q<U$ at a finite cost $C_q\geq 0$, then at every finite $C\geq C_q$, $q\leq V_A(C)\leq U$. In particular $V_A(C)$ is real and $0\leq U-V_A(C)\leq U-q$. This elementary certificate is conditional on the bound $U$; it does not assert that real intelligence saturates.

Example. Equal scalar cost does not identify architecture [ftip-00JT]

Two systems can have the same scalar $C$ while differing in memory, latency, and training allocation. A cost-weight change can reverse their ordering without changing either system. Thus a one-factor comparison needs a fixed scalarization and a reported cost vector; no architecture effect follows from equal $C$ alone.

Matched-compute comparison protocol [ftip-00JU]

Definition. Common-recipe comparison arm [ftip-00JV]

A common-recipe arm fixes training data, optimizer family, schedule, post-training procedure and feedback, training and post-training budgets, inference budget, and evaluation protocol and draws. Interface-compatible parameter choices are declared in advance as part of each permitted architecture package. The comparison varies that package under the common recipe; any further deviation is recorded as a separate comparison coordinate. Its score difference measures performance under this recipe, not the best attainable result for either architecture.

Definition. Equal-tuning-budget comparison arm [ftip-00JW]

An equal-tuning-budget arm permits architecture-specific tuning under a predeclared protocol that fixes the tuning data and its volume, trial count, selection rule, stopping rule, and tuning cost for both architectures. The cost uses the same declared accounting rule. The resulting comparison measures practical performance under this equal optimization effort; it does not determine best possible training or a representation-only limit.

Definition. Restricted-envelope comparison arm [ftip-00JX]

A restricted-envelope arm declares an allowed intervention class $\mathcal E_A\subseteq \mathfrak I_A$ for each architecture, specifying the permitted training, post-training, and inference procedures. The classes expose exclusions, search budgets, seeds, and stopping rules. Restrict the evaluation functional of Definition [ftip-00JJ] to $\mathcal E_A$ and compare the resulting suprema under the same finite cost cap $C\geq 0$, common evaluation law, and common declared cost accounting.

The measurable, integrable evaluation domain and extended-real conventions of Definition [ftip-00JJ] apply: an empty feasible class has value $-\infty $, an unbounded-above feasible score set has value $+\infty $, and a finite supremum need not be attained. The allowed class is part of the comparison, so its envelope is a restriction-dependent quantity, not an unrestricted architectural ceiling.

Definition. Model-instance comparison evidence record [ftip-00JY]

A model-instance record contains architecture/checkpoint identity, parameter count, data and post-training recipe, optimizer, precision, hardware, cache policy, training and inference cost vectors, task suite, and independent evaluation seed. A missing field makes an architecture attribution unknown.

Remark. Systems optimizations are measured interventions [ftip-00JZ]

FlashAttention, KV-cache layouts, quantization, batching, and kernels can change feasible cost. If they approximate, truncate, or alter precision of the mathematical computation, the record must mark that as a systems intervention rather than as a pure architecture comparison.

Theorem. Matched-protocol difference is an estimand [ftip-00K0]

Given $n\geq 1$ evaluation draws, let $\widehat V_A(C)$ be the sample mean of finite real evaluation scores for architecture $A$ at a finite cost cap $C\geq 0$. Under a fixed evaluation law and common-recipe arm, the finite difference $\widehat V_A(C)-\widehat V_B(C)$ is a well-defined empirical estimand.

It does not identify a causal architecture effect when data, tuning, or systems coordinates differ. The conclusion follows directly from the declared record.

Remark. Conditions for applying a toy model [ftip-00K1]

A toy theorem applies to a concrete model only if an explicit map from its state and interface to the model preserves the theorem's assumptions, including its cost accounting. Without such a map, the conclusion concerns only the abstract model; its validity for the concrete system is unknown.

Kimi Delta Attention versus Transformer [ftip-00K2]

Definition. KDA model-instance record [ftip-00K3]

For a Kimi Delta Attention (KDA) versus full-attention baseline study, record the exact Kimi Linear checkpoint, layer mix, context length, hardware, kernel, precision, batch, and decoding workload. The paper describes KDA as a fine-grained gated delta-rule module in a hybrid architecture; those are source observations from Kimi Linear: An Expressive, Efficient Attention Architecture[kimi2025linear], not universal theorems.

If the baseline is called a Transformer, record whether it is the paper's MLA baseline or another full-attention implementation; the label alone does not identify a common architecture or cost.

Example. Matched-cost KDA and Transformer comparison [ftip-00K4]

A matched comparison uses the same task prompts, post-training data and feedback, optimizer family, evaluation protocol, and quality target. The corresponding measurements include parameter count, training FLOPs, inference FLOPs, wall time, memory, KV-cache bytes, and context length for each architecture. A reported speed or quality difference is conditional on these experimental conditions and measurements.

Remark. What the Kimi Linear paper establishes [ftip-00K5]

Kimi Linear reports a hybrid KDA/MLA model and fair-comparison experiments in Sections 3--5, with setup in Section 5.4 and efficiency comparisons in Sections 5.5--5.6 of Kimi Linear: An Expressive, Efficient Attention Architecture[kimi2025linear]. These include long-context efficiency.

The reported throughput and quality are empirical under its training recipe and hardware; they are lower bounds on demonstrated performance, not an architecture-independent ceiling.

Example. Parameter matching is not cost matching [ftip-00K6]

Two models with equal parameter count can have different attention FLOPs, KV-cache memory, kernel utilization, and attainable context. Conversely, equal wall time can hide different hardware and precision. Therefore a parameter-matched result cannot by itself identify a compute frontier.

Remark. Cache, throughput, and quality in KDA comparisons [ftip-00K7]

The KDA example does not prove that every linear-attention model beats every Transformer, that cache savings imply equal quality, or that a measured throughput gain is a capability gain. Any such statement requires a new matched study with the evidence record of Definition [ftip-00JY].

Definition. Model-instance comparison decision rule [ftip-00K8]

Call architecture A more cost-efficient than B at quality $q$ only when the compared threshold costs use the same declared protocol, the confidence procedure and stopping rule are fixed, and all cost-vector coordinates needed by the claim are present. A ratio additionally requires finite costs and a strictly positive denominator as in Definition [ftip-00JP]. State whether the costs are measured target-achieving witnesses or justified inverse-frontier values $C_A(q)$ and $C_B(q)$; observing one successful run does not identify those infima. Otherwise the comparison is descriptive or unknown.

Interface boundaries for alternative architectures [ftip-00K9]

Definition. JEPA comparability interface [ftip-00KA]

A JEPA-like architecture is comparable to an autoregressive model only after fixing the predictor, target representation, decoder or downstream interface, training objective, inference procedure, and evaluation law. A parameter-count match alone is not a typed comparison.

Remark. Representation and task interface are separate [ftip-00KB]

A latent predictor can be excellent under one decoder and unusable under another. The evaluation record must therefore include the interface that maps the representation to the declared task output.

Theorem. Interface-preserving architecture reduction [ftip-00KC]

If two architecture records induce the same conditional output law on a fixed task and evaluation interface, every evaluation functional $J$ gives the same value. This is an immediate pushforward identity under the stated output-law and interface assumptions. It does not imply that distinct architectures are generally equivalent.

Example. Equal benchmark score can hide different ceilings [ftip-00KD]

Two architectures may tie on a finite benchmark while differing on an unmeasured task slice or longer context. Thus a single score cannot establish equal representational ceilings; the task family and evaluation coverage must be declared.

Remark. Architecture-independent model interfaces [ftip-00KE]

A result stated solely in terms of a model/interface map applies to every architecture realizing that map and satisfying its hypotheses. An architecture-specific conclusion can require further assumptions, as in Remark [ftip-00JK].

Remark. Open model-instance questions [ftip-00KF]

The relative capability and cost of KDA, full attention, and JEPA candidates remain empirical questions. A reproducible comparison requires identified checkpoints or reproducible training, fixed evaluation seeds, and measured cost vectors. Architecture-specific ceilings remain estimands and hypotheses rather than established constants.

Published hybrid-attention comparison [ftip-00KU]

Kimi Linear combines recurrent KDA layers with periodic full MLA attention. Its published comparison shows task-dependent score changes and lower long-context decoding times. The selected scores in Example [ftip-00LC], the memory estimate in Example [ftip-00KY], and the discovery calculation in Example [ftip-00L3] connect these observations to a post-training question: when can a cheaper attempt compensate for a possible lower per-attempt success probability?

Example. Published Kimi Linear operating point [ftip-00KV]

The Kimi Linear report compares experimental models pretrained on 1.4 trillion tokens, each with 48 billion total and 3 billion active parameters. Kimi Linear uses three Kimi Delta Attention layers for each full Multi-head Latent Attention layer, with no positional encoding (NoPE) in its MLA layers; the reference uses full MLA attention [kimi2025linear, Sections 4 and 5.4]. These are properties of the reported hybrid architecture.

These experimental models are distinct from the released Kimi Linear model, pretrained on 5.7 trillion tokens and supporting up to one million tokens of context. Appendix D compares that release with Moonlight, which has 16 billion total and 3 billion active parameters [kimi2025linear, Section 5.4.1 and Appendix D].

Example. Published efficiency observations [ftip-00KW]

For batch size one at one million tokens, Figure 7 labels a $2.9\times $ prefill speedup and a $2.2\times $ decoding speedup for Kimi Linear against MLA. Section 6.3 gives $2.3\times $ for the latter point, so the graphic and prose differ slightly [kimi2025linear, Figure 7 and Sections 5.6 and 6.3].

The larger-batch comparison in Figure 1(b) gives decoding time per output token of 1.84 milliseconds for Kimi Linear and 11.48 milliseconds for MLA, with a reported $6.3\times $ speedup. Section 6.3 describes this as a theoretical speedup from reallocating saved KV-cache memory to larger batches. It illustrates a different use of the memory saving from the batch-one latency result [kimi2025linear, Figure 1(b) and Section 6.3].

Figure 1(a) reports RULER scores of 84.3 for Kimi Linear and 81.3 for MLA at 128k context, with $3.98\times $ decoding acceleration [kimi2025linear, Figure 1(a)]. The report also gives a reduction of up to 75 percent in KV-cache use [kimi2025linear, Abstract]. Together these observations motivate studying context length and batch size as separate cost coordinates. The unequal RULER scores and different timing regimes are retained when interpreting those points.

Definition. Quality target and cost measurement [ftip-00KX]

For a reported benchmark score q, use the same task, prompt law, scoring rule, and post-training condition for both systems. The comparison records the smallest measured cost at which each system reaches q, when such a measurement exists. A throughput or cache ratio is not substituted for this iso-quality cost.

Example. A cache-memory estimate for hybrid attention [ftip-00KY]

The cited FLA KDA implementation at commit 6b6f546f stores one active recurrent state per sequence, with dimensions determined by the value heads and key/value dimensions rather than accumulated context length. Its newly allocated state uses float32 [⧉]. The optional short-convolution state has one fixed-width kernel buffer per channel and sequence [⧉]. This supplies a concrete implementation model for the recurrent part of the 3:1 mixture in Example [ftip-00KV].

Consider a stylized comparison with $4\ell $ layers, batch size $b$, and context length $T$, where $\ell ,b,T$ are positive integers. Assume each MLA layer stores $\kappa T$ bytes per sequence, with the same $\kappa >0$ in both designs, and each KDA layer stores one terminal recurrent-plus-convolution state of $\sigma >0$ bytes. The active attention-state memories are

\[ M_{\rm MLA}=4b\ell \kappa T,\qquad M_{\rm hybrid}=b\ell (\kappa T+3\sigma ),\qquad \frac {M_{\rm hybrid}}{M_{\rm MLA}} =\frac {1}{4}+\frac {3\sigma }{4\kappa T}. \]

The hybrid uses less active state exactly when $T>\frac {\sigma }{\kappa }$, and the ratio tends to $1/4$ as context grows. This explains why replacing three quarters of the growing caches can approach a 75-percent saving, while fixed recurrent-state overhead can erase the advantage at short contexts. The retained MLA layers keep the hybrid's state memory linear in $T$; the whole model is not a fixed-memory recurrent system.

Weights, training activations, workspaces, allocator padding and saved prefix states are outside this active-state calculation. At a fixed device memory budget, the estimate predicts more room for simultaneous or longer rollouts when attention state dominates. It does not predict a fourfold speedup. Training and decoding also use different execution paths: FLA selects chunk kernels for gradient-enabled computation and fused recurrence for short inference calls [⧉]. The fixed-state estimate is therefore a useful serving hypothesis, not a training-memory or training-speed formula.

Example. Common-recipe reading of the Kimi result [ftip-00KZ]

The report holds its stated pretraining and SFT recipes common across the experimental models [kimi2025linear, Sections 5.4--5.5 and Table 4]. The selected observations in Example [ftip-00LC] compare the resulting trained designs, including the hybrid's 3:1 KDA/MLA pattern and NoPE choice. The mixed score directions suggest a task-dependent tradeoff rather than one ordering of the two architectures.

The theoretical mechanism is a change in the cost of maintaining and using the prefix: recurrent layers compress it into state, while the retained MLA layers preserve growing attention caches. The model in Example [ftip-00KY] predicts the largest memory advantage at long contexts. If this advantage reduces the cost of generating useful candidates, Example [ftip-00L3] predicts when more attempts can offset a reduction in per-attempt quality. This is a conditional explanation to test through rollout costs and verified success rates; it does not require attributing the whole result to KDA alone.

Example. Measured iso-quality cost ratio [ftip-00L0]

Let $c_K(q)$ and $c_T(q)$ be measured inference costs for Kimi Linear and the Transformer reference at the same finite real score $q$ and context length, under one accounting rule. If $0\leq c_K(q)<+\infty $ and $0<c_T(q)<+\infty $, the measured ratio $\widehat \rho _{K/T}(q)=c_K(q)/c_T(q)$ is reported together with the full cost vectors. These measured costs need not be the inverse frontier infima of Definition [ftip-00JP]. If either threshold is unmeasured or the denominator is zero, the ratio is left undefined rather than inferred from the paper's speedup plot.

Remark. Hybrid attention is not pure linear attention [ftip-00L1]

Kimi Linear combines KDA with periodic full-attention layers. A measured advantage therefore identifies the reported hybrid intervention, not a claim that a purely linear recurrent architecture has the same quality or ceiling. The layer pattern belongs in the architecture record.

Remark. Demonstrated performance is a lower bound [ftip-00L2]

The published benchmark scores demonstrate attainable points for the reported checkpoints and protocol. They do not establish a representational ceiling, a universal scaling law, or a claim that additional cost cannot improve either architecture.

Example. When cheaper attempts compensate for lower success [ftip-00L3]

Smaller caches can support more concurrent requests or avoid preemption and recomputation. These are actual serving mechanisms in vLLM's memory and scheduling guidance [⧉]. For post-training, the useful prediction is therefore about completed candidate attempts under a budget, including verification and optimization costs, rather than decoding speed alone.

Use the following cost model on the same hardware. One baseline attempt costs $c>0$; generation accounts for a fraction $f\in [0,1]$. Suppose generation becomes $s_{\rm gen}>0$ times as fast while all other cost per attempt stays fixed. The new cost and total attempt-throughput factor are

\[ c_K=c\left (1-f+\frac {f}{s_{\rm gen}}\right ),\qquad S=\frac {c}{c_K} =\frac {1}{1-f+f/s_{\rm gen}}. \]

For a fixed budget $B\geq 0$, this model permits $N_M=\lfloor B/c\rfloor $ baseline attempts and $N_K=\lfloor B/c_K\rfloor $ hybrid attempts. Assume $N_M,N_K\geq 1$ and verified-success events independent within each set of attempts, with respective probabilities $p_M,p_K\in [0,1]$. Then Theorem [ftip-0078] gives discovery probabilities $1-(1-p_M)^{N_M}$ and $1-(1-p_K)^{N_K}$. The hybrid matches or exceeds baseline discovery exactly when

\[ p_K\geq 1-(1-p_M)^{N_M/N_K}. \]

This follows by comparing the two failure probabilities and taking the nonnegative $N_K$-th root.

For an illustrative estimate, suppose generation consumes 80 percent of the baseline cost and use $s_{\rm gen}=2.2$, motivated by the batch-one decode figure in Example [ftip-00KW]. Applying that decode factor to the whole generation stage is a working approximation, not a measured rollout result. Then $S\approx 1.774$; a budget of $B=10c$ buys 10 baseline attempts or 17 hybrid attempts. If $p_M=0.10$ and $p_K=0.08$, the discovery probabilities are approximately $0.651$ and $0.758$. The break-even hybrid probability is about $0.0601$. Thus this model predicts that more attempts can outweigh a moderate per-attempt quality loss. The assumed probabilities are illustrative verified-success rates, not conversions of the benchmark scores in Example [ftip-00LC].

The prediction is strongest for long-context, generation-heavy work whose saved memory becomes usable rollout capacity. As verification or optimization dominates, $f$ shrinks and $S$ approaches one. Correlated attempts require the joint-law analysis of Convention [ftip-0077] instead of the independent product. Measure completed attempts, verified-success rates and total cost under a fixed prompt, decoding and verifier protocol to test the tradeoff. In the RLVR round of Example [ftip-004M], additional successful candidates can improve the available feedback; whether they produce useful accepted updates is a further optimizer-and-evaluation question, as Example [ftip-0085] demonstrates.

Paired measurements for model comparison [ftip-00L4]

A paired measurement specifies both model instances and their task, intervention, evaluation, and cost coordinates. These conditions determine the meaning of each point in the measured frontier.

Definition. Comparison pair identity [ftip-00L5]

A paired comparison identifies the two systems, exact checkpoint or training commit, architecture variant, parameter counts, tokenizer, and context limit. A label such as ``Transformer'' is insufficient when attention, cache, or layer patterns differ.

Definition. Common task and evaluation conditions [ftip-00L6]

Both systems use the same task family, prompt and data law, scoring rule, sampling seeds, stopping rule, and evaluator version. Any exception is a separate comparison arm, not an unrecorded architecture effect.

Definition. Training and post-training coordinates [ftip-00L7]

Record data volume, token order policy, optimizer and schedule, supervised tuning, feedback or reinforcement procedure, update count, and selection rule. The common-recipe arm fixes these coordinates; the equal-tuning arm allows predeclared alternatives with equal search resources.

Definition. Inference and systems coordinates [ftip-00L8]

Record hardware, software and kernel versions, precision, batch, cache policy, sequence lengths, warm-up procedure, concurrency, and decoding settings. A kernel or cache change that alters numerical computation is marked as an intervention rather than hidden as an implementation detail.

Definition. Per-system cost vector [ftip-00L9]

For each system, the cost vector $\mathbf c$ contains training FLOPs, inference FLOPs, wall time, memory, energy when available, and context length. The primary scalar $C$ and its weights are declared beside the vector; omitted coordinates are marked unknown.

Definition. Repeated measurement rule [ftip-00LA]

For each fixed workload and system, record warm-up runs, repetition count, random seeds, and the aggregation rule. Report mean and dispersion for time, memory, and score; a single fastest run cannot define a cost frontier.

Definition. Paired uncertainty estimates [ftip-00LB]

When the same evaluation items are used, report paired score differences and an uncertainty procedure fixed before inspecting the result. Confidence intervals quantify sampling variation; they do not repair unmatched training, systems, or task coordinates.

Example. Published Kimi Linear comparison [ftip-00LC]

Table 4 of the Kimi Linear report compares the experimental models pretrained on 1.4 trillion tokens in Example [ftip-00KV], after the same supervised fine-tuning (SFT) recipe. Both have 48 billion total and 3 billion active parameters. Three selected benchmark scores are [kimi2025linear, Sections 4 and 5.4 and Table 4]:

Arm	MMLU-Pro	LiveBench	EvalPlus
Kimi Linear	67.4	45.2	61.0
Full MLA	65.7	45.7	62.6

The entries use the paper's score units, with larger values better on each selected benchmark; LiveBench is reported as Pass@1. Kimi Linear is higher on MMLU-Pro and lower on LiveBench and EvalPlus in these observations. These are reported point estimates on different tasks, not a single capability score; the table supplies no uncertainty estimate.

The common recipe uses the K2 pretraining corpus, MuonClip and a shared training schedule. SFT proceeds from broad instruction data to targeted reasoning tasks; evaluation uses temperature 1.0 and an internal framework derived from LM-Harness [kimi2025linear, Section 5.4]. Thus the scores provide a concrete example of how the trained hybrid and full-MLA designs respond to the same recipe. The cost mechanism and its possible post-training consequences are developed in Example [ftip-00KZ].

Remark. Measured and assumed costs [ftip-00LD]

A useful cost model can combine measurements with assumptions justified by the architecture and its implementation. In Example [ftip-00L3], the generation share $f$ and speed factor $s_{\rm gen}$ determine a predicted attempt-throughput factor. Their assumed values can be varied without pretending they were measured in the original experiment.

For fixed $f\in [0,1]$, write $S(s)=1/(1-f+f/s)$ for $s>0$. This function is nondecreasing. An interval $s_{\rm gen}\in [s_-,s_+]$, with $0<s_-\leq s_+$, therefore gives the conditional range $S\in [S(s_-),S(s_+)]$. This is sensitivity to a chosen assumption range; it is a statistical confidence interval only if a sampling argument supplies that interpretation.

Definition. Measured contrasts and conditional predictions [ftip-00LE]

A measured paired contrast evaluates the same declared quantity for two observed model instances under a specified task, protocol and cost accounting. The common-recipe scores in Example [ftip-00LC] are one example. A confirmatory comparison fixes its matching and selection rules before examining the scores.

A conditional paired prediction instead uses an explicit model to supply one or more cost or response quantities, then derives the comparison under those assumptions. The discovery probabilities in Example [ftip-00L3] are an example. Such a prediction can be motivated by existing observations and guide a later experiment; its unmeasured inputs remain assumptions, and agreement with new matched measurements tests the model.

Example. How generation share changes the predicted gain [ftip-00LF]

Keep the illustrative generation factor $s_{\rm gen}=2.2$ from Example [ftip-00L3] and vary the baseline generation share $f$. Its cost model gives the following total attempt-throughput factors:

Generation share	Predicted throughput factor
20 percent	1.122
50 percent	1.375
80 percent	1.774
100 percent	2.200

These calculated values show why the same decoding improvement can matter much more for generation-heavy search than for a verifier- or optimizer-dominated workload. They suggest measuring the time spent in generation, verification and updates before selecting where to invest systems effort. A change in the bottleneck changes the useful intervention, even when the attention architecture stays fixed.

Remark. Testing the predicted architecture tradeoff [ftip-00LG]

The memory and discovery models predict the strongest benefit when long prefixes make attention state expensive, saved capacity improves useful rollout throughput, and per-attempt success remains above the break-even threshold. Short contexts, expensive verification, or strongly correlated attempts can weaken that benefit. These are distinct mechanisms to test, rather than a universal ranking of KDA and full attention.

A comparison across implementations can retain this reasoning while re-estimating state sizes, generation share and success probabilities for the new system. Report both the prediction and the matched measurements: their agreement or disagreement identifies which mechanism or assumption needs revision.

Conditional frontier and saturation analysis [ftip-00LH]

A finite matched study measures capability at selected values of one declared cost. Its frontier and saturation target are conditional on that protocol; they do not establish a universal intelligence law.

Definition. Finite cost grid [ftip-00LI]

Choose a finite ordered grid $0<C_1<\cdots <C_m$ and evaluate each architecture at every declared grid point under the same task and protocol. The resulting values $\widehat V_A(C_i)$ are observations of the restricted frontier, not its values between grid points.

Definition. Observed upper envelope [ftip-00LJ]

For an observed score $s_A(C_i)$ define the discrete upper envelope $U_A(C_i)=\max _{j\leq i}s_A(C_j)$. It is a descriptive monotone summary of the measured points; it is not evidence that unmeasured costs attain the envelope or that extra cost cannot reduce score.

Definition. Uncertainty bands on the frontier [ftip-00LK]

Attach a predeclared uncertainty interval $I_A(C_i)$ to each score and carry those intervals through score differences and threshold crossings. A finite band describes sampling and measurement variation; it does not cover unmeasured training procedures or architectures.

Definition. Declared saturation target [ftip-00LL]

Fix a quality target $q\in \mathbb R$, tolerance and cost increment $\varepsilon ,\delta \in (0,+\infty )$, and a budget $C\in \mathbb R_{\geq 0}$. Require both $V_A(C)$ and $V_A(C+\delta )$ to be finite real values. A study calls an architecture $\varepsilon $-saturated at $C$ only relative to its allowed intervention class when the restricted frontier has certified gain $V_A(C+\delta )-V_A(C)\leq \varepsilon $.

Theorem. Conditional saturation certificate [ftip-00LM]

Take finite real $U$, $C\geq 0$, $\delta \geq 0$, and $\varepsilon \geq 0$, with the nondecreasing frontier of Definition [ftip-00JJ]. If a justified upper bound gives $V_A(C+\delta )\leq U$ and a justified lower bound gives $V_A(C)\geq U-\varepsilon $, then $U-\varepsilon \leq V_A(C)\leq V_A(C+\delta )\leq U$. Both endpoint values are therefore finite real, and $0\leq V_A(C+\delta )-V_A(C)\leq \varepsilon $. This is a conditional bound for the named frontier; it proves no universal saturation of intelligence.

For the finite controller class with hard resource admission, Corollary [ftip-00MC] obtains the required bounds from a feasible controller and a uniform Bellman certificate.

Example. Finite observations need not identify a frontier [ftip-00LN]

Let $S\subset \mathbb R_{\geq 0}$ be a finite set of measured costs, and choose $C_0>0$ larger than every element of $S$. Suppose the exact frontier value observed at each cost in $S$ is zero. For finite budgets $C\geq 0$, suppose the declared class of possible frontiers permits both \[ V_0(C)=0, \qquad V_1(C)= \begin {cases} 0,&0\leq C<C_0,\\ 1,&C\geq C_0. \end {cases} \] These nondecreasing frontiers with scores in $[0,1]$ agree on every observed cost and differ at $C_0$. The observations alone do not distinguish them.

Both possibilities have finite realizations in the framework of Definition [ftip-00JJ]: allow two interventions with costs $0$ and $C_0$. Give the first score zero and the second score $\theta \in \{0,1\}$. For example, on a single deterministic evaluation task with utility equal to the output bit, let the two resulting protocols return $0$ and $\theta $. The two possible choices of $\theta $ give $V_0$ and $V_1$, respectively, under the same intervention and cost specification. Every score is finite, and the feasible score maximum is attained at each budget.

This example does not supply a strictly better agreeing frontier for every possible data set or every admissible class. If a proved global score bound is $1$ and an intervention attains it at a finite cost $C_*\geq 0$, monotonicity forces $V_A(C)=1$ for every $C\geq C_*$; no higher value is admissible. A singleton class of possible frontiers can also identify the frontier without such an alternative. A conditional certificate such as Theorem [ftip-00LM] therefore requires its stated upper-bound evidence; that evidence does not follow merely from the absence of an observed improvement.

Definition. One-factor cost interpretation [ftip-00LO]

The primary cost $C$ is a declared scalarization of the recorded cost vector. A frontier statement is conditional on its units and weights; the same paired measurements may produce a different ordering under a different scalarization.

Example. Crossing architecture frontiers [ftip-00LP]

Two architectures may alternate in the observed ordering across costs: one can score higher at small $C$ while the other catches up at larger $C$. Thus a single comparison point cannot establish a global ordering or a common ceiling.

Example. Frontier report for the KDA study [ftip-00LQ]

A Kimi Delta Attention versus Transformer study should publish the cost grid, paired scores, uncertainty intervals, scalarization weights, and the exact identities and configurations of the compared models. The report may then state which measured points are Pareto or iso-quality comparisons under that protocol.

Remark. Frontiers depend on the intervention and evaluation [ftip-00LR]

The conditional frontier is indexed by architecture, intervention class, task family, evaluation law, and cost scalarization. Changing any of these coordinates creates a new estimand; no ordering transfers automatically to a new checkpoint, optimizer, hardware stack, or task family.

Study design for comparisons across model instances [ftip-00LS]

This subsection specifies how a conditional architecture comparison may be instantiated without changing the architecture-neutral formulation. It is a study design, not a universal ranking of architectures.

Definition. Matched model-instance record [ftip-00LT]

A model-instance record names the architecture, parameterization or checkpoint, training and post-training recipe, optimizer, execution stack, inference budget, task family, evaluation law, and recorded cost vector. Two records are comparable only after the fields held fixed and the fields allowed to vary are declared.

Definition. Pair identity and comparison unit [ftip-00LU]

A comparison unit is a pair of model-instance records evaluated on the same task family and evaluation law, together with a declared cost scalarization. A Transformer reference and a Kimi Delta Attention instance may form such a pair only when the remaining coordinates are documented.

Remark. Paired responses to a common recipe [ftip-00LV]

For a pair of matched model-instance records, the common-recipe arm measures how the permitted architecture packages respond to one recipe. A score advantage in this comparison need not persist after either package is retuned.

Remark. Different recipes under equal tuning effort [ftip-00LW]

Under the equal-tuning-budget arm, the two selected model instances may use different recipes. That difference is compatible with equal predeclared tuning effort; forcing the selected recipes to match would answer a different comparison question.

Remark. How an allowed class changes its envelope [ftip-00LX]

In the restricted-envelope arm, enlarging an allowed intervention class at fixed evaluation law, cost accounting, and budget can raise its envelope and cannot lower it. A finite search over feasible interventions supplies a lower bound from the scores it attains. It certifies the supremum only if it covers every feasible intervention or is accompanied by a matching upper-bound argument.

Remark. Coordinate-change rule [ftip-00LY]

Changing the optimizer, post-training method, hardware or kernel, precision, context policy, or evaluation law changes a comparison coordinate. A score difference after such a change belongs to the new intervention, unless the study explicitly estimates the interaction.

Definition. Architecture-family transfer matrix [ftip-00LZ]

A transfer matrix records which interfaces and budgets permit a comparison among a Transformer reference, Kimi Delta Attention, looped or depth-reused variants, and JEPA-like systems. A blank or incompatible cell is an incomparability finding, not a missing score to be imputed.

Remark. Applying a finite model to an architecture [ftip-00M0]

A toy representation or recurrence result may motivate a hypothesis, but it is not transferred to a model instance until its interface, task, cost accounting, numerical regime, and evaluation protocol are instantiated and checked. If any required assumption is unverified, applicability to the model instance remains unestablished.

Definition. Negative-result and stopping report [ftip-00M1]

A completed comparison reports the tested cost grid, excluded configurations, stopping rule, uncertainty, and negative results. Stopping without a detected difference is evidence about the declared study, not proof that the architectures have equal potential.

Remark. Open comparison questions [ftip-00M2]

The remaining questions are whether a declared interface supports a fair Kimi Delta Attention--Transformer comparison, how looped computation changes the frontier under matched budgets, and which JEPA interface can be fixed without silently changing the task. None is settled by the study design alone.