Skip to content
TEN Brief Ten verified stories a day 2026.09.05 KO

이 기사는 한국어로도 읽을 수 있습니다 →

Tech · 4 min read · Explainer

What prompt caching is — from the second call, your input costs one-fortieth

Prompt caching stores the section of a request that repeats on every call so the model does not reprocess it each time. In a transformer, the internal representation of each token is computed only from the tokens before it, so an identical prefix produces identical intermediate values — and those values can be saved and reused. The pricing follows directly: writing to the cache costs more than ordinary input, reading costs far less, and stored content expires after a set time. On Anthropic's Claude Fable 5.1, released September 1, 2026, ordinary input is 10 dollars per million tokens, a five-minute cache write 12.50, a one-hour write 20, and a read 0.25 — one-fortieth of input. Break-even arrives at the second reuse for a five-minute cache and the second or third for a one-hour cache. The trap is that caching matches only an exact prefix

A library shelf in afternoon light with one book pulled halfway out of a neat row

The three lines

  • Mechanism — an identical prefix yields identical intermediate values, which can be stored
  • Price — writes cost more than input, reads one-fortieth; break-even at the second reuse
  • Trap — only an exact prefix matches, so variable content up front breaks it every call

Key questions

What is prompt caching?
**It stores the opening section that goes in unchanged on every call and reuses it.** By default a language model processes its entire input from scratch each time it is called. If your system instruction is 2,000 tokens and your reference document 50,000, then changing one line of the question and asking ten times means paying for 520,000 tokens — the same 52,000 read ten times over. Caching removes that repetition: **the result of processing it once is stored, and later calls pull from storage.** Pricing splits into three tiers — **ordinary input** (no cache), **cache write** (storing, priced above ordinary input), and **cache read** (retrieving, far cheaper). On Claude Fable 5.1 the per-million-token figures are input **$10**, five-minute write **$12.50**, one-hour write **$20**, read **$0.25**. **A read costs one-fortieth of ordinary input** (see "Anthropic's Claude Fable 5.1").
How many reuses does it take to pay off?
**Two for a five-minute cache, two or three for a one-hour cache.** Take a one-million-token prefix used N times. Without caching the cost is **N × $10**. With a five-minute cache it is **$12.50 + (N−1) × $0.25**: at N=1 that is 12.50 against 10, so caching loses; **at N=2 it is 12.75 against 20**, so caching wins; at N=10 it is 14.75 against 100 — **less than a sixth**. A one-hour cache costs **$20 + (N−1) × $0.25**: at N=2 that is 20.25 against 20, roughly level, and **at N=3 it is 20.50 against 30**. So **if you will use it once, leave caching off.** And the real decision rule follows: choosing between the five-minute and one-hour tier is **not about the number of reuses but the interval between them.** Ten calls inside three minutes fit the five-minute tier; ten calls spread across a day exceed even the one-hour tier and will need rewriting.
Why does my cache keep missing?
**Most likely because something near the front changed.** Caching works on the **prefix**: reuse extends only as far as the input is byte-identical from the start, and everything after the first difference is recomputed. That is forced by the architecture — in a transformer each token's internal representation depends **only on the tokens before it**, so an identical prefix means identical intermediate values, and one changed character invalidates everything after it. Hence the most common mistake: **putting variable content at the front.** A timestamp, user name or request ID in the first line of the system prompt **destroys the cache on every single call**. The fix is to invert the order — **fixed material (instructions, documents, codebase, tool definitions) first, variable material (the question, the time, session data) last.** Three other causes are common: **falling under the minimum token length** required for a cache to form, **expiry** of the five-minute or one-hour window, and **a prefix that keeps growing** as a conversation accumulates, which particularly affects agentic work.

Prompt caching stores the opening section that goes in unchanged on every call, so it can be reused.

Why that is needed becomes obvious once you look at how a language model actually works.

1. The model rereads everything, every time

A language model processes its entire input from scratch on every call. Services that appear to "remember" a conversation are in fact resending the whole conversation.

So this happens. Say your system instruction is 2,000 tokens and your reference document 50,000. Change one line of the question and ask ten times:

52,000 tokens × 10 calls = 520,000 tokens

You paid to read the same 52,000 tokens ten times. Only the last line changed.

Prompt caching removes that repetition. Process it once, store the result, pull from storage on subsequent calls.

2. Why only the front can be cached

The prefix restriction is not a convenience choice. It falls out of the model's architecture.

In a transformer, each token's internal representation depends only on the tokens before it. Computing token 100 looks at tokens 1–99; it never looks at token 101. Therefore:

  • If the prefix is byte-identical, the intermediate values across that stretch are identical too → they can be stored and reused
  • If one character differs, everything computed after that point differs → all of it must be recomputed

This is prefix caching. It is why the front, and not the back, is what gets stored.

3. The price splits into three tiers

The pricing follows the mechanics.

TierWhat it doesFable 5.1 (per 1M tokens)
Ordinary inputNo cache; processed each call$10
Cache write (5-minute)Stores the result for 5 minutes$12.50
Cache write (1-hour)Stores the result for 1 hour$20
Cache readRetrieves the stored result$0.25

A read costs one-fortieth of ordinary input. When Anthropic released Fable 5.1 on September 1, 2026, this was the only line that moved — cut 75 percent from $1.00 to $0.25, while input at $10 and output at $50 stayed put (see "Anthropic's Claude Fable 5.1").

4. When does it pay off?

Take a one-million-token prefix used N times.

CallsNo cache5-minute cache1-hour cache
1$10.00$12.50$20.00
2$20.00$12.75$20.25
3$30.00$13.00$20.50
5$50.00$13.50$21.00
10$100.00$14.75$22.25
50$500.00$24.75$32.25

Three lines matter here.

First, if you will use it once, do not cache. There is no chance to recover the write premium ($2.50 for five minutes, $10 for an hour).

Second, break-even is very low. The five-minute tier clears on the second call, the one-hour tier on the third. Any repetition at all argues for switching it on.

Third, the retention choice is about interval, not count. Ten calls inside three minutes fit comfortably in the five-minute tier; ten calls spread across a working day exceed even the one-hour tier and force rewrites in between. Ask how often, not how many.

5. Four reasons the cache misses

"I turned caching on and the bill didn't move" almost always comes down to one of these.

① Variable content at the front — the most common mistake.

A timestamp, user name or request ID in the first line of the system prompt makes the prefix different on every call, so the cache breaks completely every time. You end up paying write prices repeatedly and never reading once — the worst possible combination.

The fix is to invert the order:

  • Front: system instructions, reference documents, codebase, tool definitions — the fixed material
  • Back: the user's question, current time, session data — whatever changes

② Below the minimum token length. Every model sets a floor below which no cache forms. Caching a short prompt does nothing at all.

③ The window expired. After five minutes or an hour the stored content is gone and the next call pays write pricing again. Whether reads refresh the timer varies by provider — check the documentation.

④ The prefix itself keeps growing. In conversational and agentic work, each step appends the previous response to the front of the next call. As the prefix grows, the newly grown portion must be written, and the cached share of each call steadily falls.

6. When the unit price falls and the bill doesn't

Anthropic said the Fable 5.1 cache read cut reduces bills by 25 to 45 percent. Outside tests were reported as disagreeing on whether cost per completed task actually falls.

Both can hold, for two reasons.

First, reuse ratios differ by workload. Load one codebase and ask fifty questions and the read cut passes straight through. Send a different document every call and write pricing dominates while the read cut barely lands.

Second, cheaper units invite more usage. A stronger model in agentic work takes more self-directed steps. Cut the unit price to a quarter and quadruple the tokens, and cost per task is unchanged.

The unit price definitely fell. The total is decided by your workload. The first thing to check is what share of your own input tokens are currently cache reads.

7. What is still open

  • Prices change often. The figures here are Fable 5.1 as of September 5, 2026, used to illustrate the structure. Do real calculations against the vendor's current table.
  • Time-to-live refresh rules differ by provider. Whether a read extends the window materially changes the cost of long-running work.
  • Minimum token thresholds can change without notice.
  • The break-even table assumes a one-million-token prefix. Output tokens ($50 per million on Fable 5.1) cost the same regardless of caching, so workloads that generate long answers will feel the saving less (see "What AI token pricing is").
  • Several providers offer caching, but names, minimum lengths, retention windows and discount rates differ enough that headline prices alone do not support cross-vendor comparison.

Sources

  1. Anthropic — Prompt caching documentation
  2. Anthropic — Pricing
  3. VentureBeat — Anthropic's Claude Fable 5.1 and Mythos 5.1 arrive with a 75% cost reduction for Fable cache reads
  4. LLM Stats — Claude Fable 5.1 API pricing, context window and benchmarks
  5. OpenAI — API pricing
  6. implicator.ai — Anthropic Fable 5.1 Keeps $10/$50 Price, Cuts Cache Reads 75%

Verification

Published
Last modified
Cross-check
Checked against 6 independent sources.
Unverified
  • The break-even arithmetic assumes a one-million-token prefix. Real bills depend on prompt length, minimum cache token thresholds, and output tokens.
  • Whether a cache's time-to-live refreshes on each read differs by model and provider. Check each vendor's current documentation.
  • Minimum token thresholds for caching vary by model and can change without notice.
  • The 25-45 percent bill reduction is Anthropic's figure; outside tests were reported as disagreeing on whether cost per task actually falls.
  • Prices are as of September 5, 2026 and change frequently. The numbers here illustrate the structure.
Authoring
Reviewed by a person before publication. The full process is described in the Editorial.

Ten stories, once each morning

We send the three-line summaries only; the full pieces stay on the site. One-click unsubscribe, any time.

Related