← Back to article

Equation 25 · The Economics and Physical Limits of Running AI Agents at Scale

What does this equation mean?

Cncached≈n pout oˉ+n pin w σ+pin γ σ n(n−1)2C_n^{\text{cached}} \approx n\,p_{\text{out}}\,\bar{o} + n\,p_{\text{in}}\,w\,\sigma + p_{\text{in}}\,\gamma\,\sigma\,\frac{n(n-1)}{2}

Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.

This equation gives an approximation: it relates the quantities while allowing an approximation. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.

Read it piece by piece

CncachedC_n^{\text{cached}}

Symbol C_n^cached

CncC_n^cached is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Understand this part →

nn

Symbol n

n occurs above the fraction bar. The numerator is divided by the entire denominator below it.

Understand this part →

poutp_{\text{out}}

Symbol p_out

pop_out is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Understand this part →

oˉ\bar{o}

Symbol baro

baro is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Understand this part →

pinp_{\text{in}}

Symbol p_in

pip_in is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Understand this part →

ww

Symbol w

w is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Understand this part →

σ\sigma

Symbol σ

σ is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Understand this part →

γ\gamma

Symbol gamma

gamma is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Understand this part →

fraction

fraction

Divide the expression above the line by the one below it.

Understand this part →

See an illustrated explanation →
≈

≈

Approximately equal to; the equality is not exact.

Understand this part →

addition

addition

Add the term after the plus sign to the term or group before it.

Understand this part →

subtraction

subtraction

Subtract the following term or group from the preceding one. A leading minus marks a negative quantity.

Understand this part →

subscript

subscript

The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.

Understand this part →

superscript

superscript

A raised number can be a power. When it is a label or bound, it selects a case or the upper limit of a sum; the formula’s structure distinguishes these uses.

Understand this part →

See an illustrated explanation →
n(n−1)n(n-1)

Numerator: n(n-1)

The complete quantity above the fraction bar.

Understand this part →

22

Denominator: 2

The complete quantity below the fraction bar; it must be nonzero for this division.

Understand this part →

How to interpret it

With a fixed numerator, increasing a nonzero denominator reduces the fraction. Its accuracy depends on the assumptions and range of use described in the article.

What the article says around this equation

Prompt caching is the documented fix for exactly this, and it is worth being precise about what it fixes and what it does not. Anthropic’s automatic caching, recommended for multi-turn use, places a single cache marker at the end of a request; the system caches everything up to that marker, and the next request’s identical prefix is read from cache rather than reprocessed [ 2 ] . Anthropic’s documentation walks through exactly this pattern for a growing conversation: at each new turn, the system prompt and all prior turns are read from cache, and only the newest exchange is freshly written to cache for next time [ 2 ] . A cache read costs a tenth of the base input price; a five-minute cache…
Read the full surrounding passage
Prompt caching is the documented fix for exactly this, and it is worth being precise about what it fixes and what it does not. Anthropic’s automatic caching, recommended for multi-turn use, places a single cache marker at the end of a request; the system caches everything up to that marker, and the next request’s identical prefix is read from cache rather than reprocessed [ 2 ] . Anthropic’s documentation walks through exactly this pattern for a growing conversation: at each new turn, the system prompt and all prior turns are read from cache, and only the newest exchange is freshly written to cache for next time [ 2 ] . A cache read costs a tenth of the base input price; a five-minute cache write costs 1.25 times it [ 1 , 2 ] . Substituting those multipliers into the model — reading the accumulated history at the discounted rate γ\gamma ≈\approx 0.1 instead of the full rate, and writing only the newest increment at the write rate w ≈\approx 1.25 — gives Cncached≈n pout oˉ+n pin w σ+pin γ σ n(n−1)2C_n^{\text{cached}} \approx n\,p_{\text{out}}\,\bar{o} + n\,p_{\text{in}}\,w\,\sigma + p_{\text{in}}\,\gamma\,\sigma\,\frac{n(n-1)}{2}. The quadratic term survives. Its coefficient shrinks by the cache-read discount, roughly tenfold, but the shape — cost rising with the square of step count — does not go away, because caching discounts the price of resending the growing history; it does not stop the history from having to be resent. OpenAI’s own cached-input pricing lands at the same roughly tenfold discount on every current GPT-5.6 tier [ 7 ] , so the same qualified conclusion holds on that stack too: this is a property of a stateless, replay-everything request format, not a pricing quirk of one vendor.

Read the equation in its article →

Sources cited in the surrounding passage

These citations give research context. Read each source to check which claims it supports.

Return to The Economics and Physical Limits of Running AI Agents at Scale

See this formula across 1 published context →

Browse the mathematical compendium →