Equation 35 · The Economics and Physical Limits of Running AI Agents at Scale
What does this equation mean?
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 mathematical expression combines the displayed quantities; its precise role follows from the surrounding article text. 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
Symbol i
i is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.
subtraction
Subtract the following term or group from the preceding one. A leading minus marks a negative quantity.
How to interpret it
Read this expression with the definitions, units, and assumptions supplied by the article.
What the article says around this equation
That exemption changes the shape of the rate-limit exposure the same way it changed the shape of the dollar cost. In the uncached model above, step i sends (i-1) tokens of retransmitted history as ordinary, fully metered input — every one of which counts against the per-minute ceiling, every single step, growing linearly with i within a single trajectory. A long, rapid, uncached loop can approach its own organization’s input-tokens-per-minute ceiling from its own growth alone, with no other caller involved: the trajectory throttles itself. With per-turn caching applied, the accumulated history is read from cache and, per the documentation above, does not count toward the limit at all;…
Read the full surrounding passage
That exemption changes the shape of the rate-limit exposure the same way it changed the shape of the dollar cost. In the uncached model above, step i sends (i-1) tokens of retransmitted history as ordinary, fully metered input — every one of which counts against the per-minute ceiling, every single step, growing linearly with i within a single trajectory. A long, rapid, uncached loop can approach its own organization’s input-tokens-per-minute ceiling from its own growth alone, with no other caller involved: the trajectory throttles itself. With per-turn caching applied, the accumulated history is read from cache and, per the documentation above, does not count toward the limit at all; only the newest increment written each turn — a roughly constant w tokens per step, not a growing one — consumes ceiling headroom. Caching is therefore doing two separate jobs that are easy to conflate: it discounts the price of the growing history, and independently, it exempts that same growing history from the throughput governor. A workload that caches for the price discount and does not realize it is also buying rate-limit headroom is undercounting what caching is worth.
Sources cited in the article section
- [3] Rate Limits ↗
- [8] Rate Limits ↗
- [11] Efficiently Scaling Transformer Inference ↗
- [4] Claude API Errors ↗
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