Claude Haiku 5.5 at the 100K-Token Boundary: When the Lowest Token Price Loses

One extra input token can change the price of an entire Haiku request. The more useful question is what happens after that request: does its answer pass, require another attempt, or send the workflow to a larger model?

Claude Haiku 5.5, released October 7, has a one-million-token context window and a separate pricing boundary at 100,000 prompt tokens. A large window is capacity, not a promise of the lowest cost for every workload. Anthropic model overview.

Claude Haiku 5.5 workflow: count prompt tokens against the 100K pricing boundary, price the whole request, then account for acceptance, retries and fallback costs.
Cover. The 100K prompt boundary selects the request's price band; the workflow ledger also includes retries and fallback calls. Original Tech Trend Insight conceptual diagram, based on Anthropic's documented pricing. Not a benchmark.

Scope and evidence — October 12, 2026. This is a pricing analysis with reproducible arithmetic, not a report of completed API trials. Prices come from Anthropic's documentation. Token volumes, retry counts, and acceptance outcomes in the worked examples are explicit assumptions. No benchmark establishes an accuracy drop at 100K or a universal 64K optimum.

The cliff is in the rate card, not the context window

For the standard Claude API, Haiku's input rate changes from $0.10 to $0.50 per million tokens above 100,000 prompt tokens; output changes from $0.50 to $2.50. Exactly 100,000 stays in the lower band. Cache reads and writes also move to higher rates. Official Haiku pricing.

The band applies to the request, not just the tokens beyond the boundary. Cached input still contributes to prompt length; each request is priced separately. Earlier calls are not retroactively repriced. Anthropic's long-context billing rules.

One extra token moves the entire request into a higher price band Illustrative uncached calls with 4,000 output tokens: 100,000 input tokens cost 0.012 dollars. 100,001 cost 0.0600005 dollars. Two equal-size dimensional cards depict the billing bands; they are not a quantitative bar chart. 01 / THE BILLING CLIFF One extra token. A different price band. Hold output fixed at 4,000 tokens; change only prompt length. 100,000 INPUT TOKENS$0.012Input: $0.10 / millionOutput: $0.50 / million 100,001 INPUT TOKENS~$0.060Input: $0.50 / millionOutput: $2.50 / million 5× Exact right-hand cost: $0.0600005. No cache, tools, tax, or credits.Original schematic • published rates + assumed token volumes • not API measurements
Figure 1. The illustrative request costs $0.012 at 100,000 input tokens and $0.0600005 at 100,001, with 4,000 output tokens in both cases. The fivefold rate change affects both input and output. Dimensional cards distinguish billing regimes, not measured performance. On small screens, swipe the diagram horizontally.

The calculation is small enough to audit: 100,000 × $0.10 / 1,000,000 + 4,000 × $0.50 / 1,000,000 = $0.012. Replace the input count with 100,001 and the two rates with $0.50 and $2.50 to obtain $0.0600005. Across 1,000 such independent calls, the corresponding totals are $12 and $60.0005.

This is not evidence that quality suddenly deteriorates at the boundary. It is evidence that an extra document, a tool schema, or retained history can change the budget before the model generates anything.

Reference: all five standard token rates

USD per one million tokens; checked October 12, 2026 against the model overview.

CategoryPrompt ≤100KPrompt >100K
Input$0.10$0.50
Output$0.50$2.50
Cache read$0.01$0.05
5-minute cache write$0.125$0.625
1-hour cache write$0.20$1.00

These are standard API rates, not a partner-platform quote. Regional multipliers, Batch pricing, tool charges, and negotiated terms require their own ledger.

An 80K prompt can become a 104K prompt without adding text

Anthropic says identical text produces approximately 30% more tokens with Haiku 5.5's newer tokenizer than with Haiku 4.5's; the change varies by content. Reusing the older model's count can therefore select the wrong band. Migration guide: recount tokens.

Recount the same content with the target tokenizerIllustrative assumption only: content counted as 80,000 tokens on the old tokenizer becomes 104,000 at a 30 percent increase. This crosses the 100,000-token boundary. The actual increase depends on the content. 02 / THE TOKENIZER CROSSOVERSame content. A new token count.Illustrative +30% assumption, not a measured prompt. Haiku 4.5 count80,000tokens in this example × 1.30assumed Haiku 5.5 count104,000above the 100K price line Migration check: count the complete prompt with claude-haiku-5-5.
Figure 2. Assuming a 30% increase, 80,000 old-model tokens become 104,000 new-model tokens. This is a sensitivity example, not a universal conversion factor. Count the real content instead of multiplying every old count by 1.30.

Anthropic's Token Counting API accepts a structured request, including system prompts and tools. Its result is an estimate and can differ slightly from actual message usage. Token-counting documentation. My deployment recommendation is to leave a tested safety margin near 100K, log the actual usage, and re-evaluate the band after any history or retrieval change. The margin is an application policy, not an Anthropic-specified sweet spot.

When does the cheap model actually lose?

Crossing 100K does not by itself make Haiku more expensive than Sonnet. Sonnet 5.5's standard input/output rates are $2/$10 per million tokens; its full 1M context window uses those standard rates. Anthropic pricing. Holding uncached token volumes equal, Haiku's higher band is still one-quarter of those rates.

Now define a deliberately simple workload: 120,000 input tokens and 4,000 billed output tokens per call, no cache, no tools, and no regional multiplier. A Haiku attempt is $0.07; a Sonnet attempt is $0.28. If one Sonnet call passes, four same-sized Haiku calls tie its API spend. A fifth makes the Haiku path cost $0.35—25% more.

Four Haiku attempts tie one Sonnet attempt; five cost more in this scenarioIllustrative spend for 120,000 uncached input tokens and 4,000 output tokens per call: one Haiku call 0.07 dollars, one Sonnet call 0.28 dollars, five Haiku calls 0.35 dollars. Bar front-face lengths use one shared zero-based linear scale; depth is decorative. 03 / THE RETRY BREAK-EVENCheaper per call is not cheaper per task.120K input + 4K output per call • uncached • assumed outcomes One Haikuattempt $0.07 One Sonnetaccepted call* $0.28 Five Haikuone accepted* $0.35 $0$0.07$0.14$0.21$0.28$0.35 Four Haiku attempts = $0.28. The fifth crosses the break-even.* Acceptance is assumed, not measured. Front-face bar lengths are linear; depth is decorative.
Figure 3. At the declared token volumes, five Haiku attempts cost $0.35 versus $0.28 for one Sonnet call. Four Haiku attempts tie. The accepted outcomes are assumptions used to expose the break-even, not observations of either model's reliability.

That condition matters. Three retries are not a universal tipping point; different output lengths or cache hits change it. A Sonnet failure changes the comparison too. In a measured evaluation, count every billed attempt, accept at most one completed result per original task, and preserve tasks that never pass.

API cost per accepted task
Total API spend across all attempts ÷ accepted tasksInclude paid failures, cache charges, and fallback calls. Report latency and human review separately unless you explicitly monetize them.

For independent one-shot calls with a constant cost c and a measured acceptance fraction p, this ratio becomes c / p. It is not a reliable shortcut for correlated retries on the same hard task. Use the observed workflow ledger for that case.

Reproduce the arithmetic without calling an API

This worksheet is static and deterministic. It estimates spend; it cannot generate acceptance rates or benchmark results.

Assumed pathCalculation (USD)Spend
Haiku, one call0.12 × 0.50 + 0.004 × 2.50$0.07
Sonnet, one call0.12 × 2 + 0.004 × 10$0.28
Haiku, five calls5 × 0.07$0.35

Volumes are millions of tokens. All five Haiku calls are assumed to have identical input and billed output; real retries can differ. For cached workloads, price uncached input, cache reads, and each cache-write duration separately. Include initialization and fallback cache writes over the same evaluation interval.

Effort and cache behavior belong in the same budget

Haiku offers low, medium, high, xhigh, and max; medium is the default. Anthropic advises comparing Sonnet when evaluating xhigh or max because deeper thinking and longer replies increase cost. Haiku prompting guidance.

Thinking is billed as output. usage.output_tokens is the inclusive billing total; the thinking detail is a breakdown, not an extra quantity to add again. Effort is soft guidance, while max_tokens caps a single call's total output. Neither setting alone caps an entire agent loop. Changing top-level effort can also invalidate prompt caching. Thinking, caching, and cost control.

My practical recommendation is to test a small set of model-and-effort configurations on the same task sample, keep each configuration stable during its run, and compare complete workflows. A lower output cap that repeatedly truncates valid answers is not a saving. A higher effort setting that prevents expensive retries can be.

A router should spend against an acceptance contract

Consider invoice extraction. The contract might require valid JSON, required fields, currency consistency, and a total that matches the source. A syntactically valid response can still fail those checks. Define them before comparing models; otherwise, the cheapest-looking path can simply be the path with the loosest definition of success.

A proposed cost-aware routing architectureGather the complete prompt, count tokens, and choose its price band. Evaluate either Haiku at a tested effort or a qualified alternative under the same independent validator. Bound retries and record all charges in the ledger. This is a proposed design, not a deployed or measured system. 04 / A PROPOSED ROUTERCount first. Route second. Accept independently.Architecture recommendation, not a production measurement. Gather full promptSystem · tools · history Count + choose band≤100K or >100K Haiku candidateDirect comparison Haiku at tested effortExplicit output / retry caps Qualified alternativeSame acceptance checks Independent validationPass, reject, or stop Bounded retryStop at the cap Ledger: every billed attempt in the numerator; one accepted task in the denominator.
Figure 4. Proposed routing architecture. The two model paths share one acceptance standard; the dashed loop represents a bounded recovery decision, not unlimited retries. Every charge enters the ledger, whether its output passes or fails.

A router also needs to distinguish rejection from a policy refusal. Haiku can return stop_reason: "refusal" in a normal HTTP 200 response and has no server-side fallback or fallback credit. A client-side fallback may require a new cache write. Refusal and fallback rules. Record the category and use a permitted recovery path; do not treat a safety refusal as an instruction to retry indefinitely.

Before migration, replace the legacy manual thinking budget with adaptive thinking and effort; omit sampling parameters; parse content by type; and check the exact platform's feature support. The current migration guide says Haiku 5.5 structured outputs are unavailable on Amazon Bedrock, so that path needs application-side format validation. Haiku migration checklist.

What I would measure before changing the default

  1. Freeze a representative task sample. Include short prompts, prompts near the price boundary, and real difficult cases. Keep the source material and acceptance rules identical across configurations.
  2. Capture a per-attempt ledger. Record actual input and cache categories, inclusive output, model, effort, stop reason, latency, and the rate date. Do not discard paid failures or cache initialization.
  3. Compare whole paths. Evaluate Haiku alone, bounded Haiku recovery, and the qualified direct alternative. Report accepted tasks out of the original sample alongside spend.
  4. Check whether the result generalizes. A win on extraction does not establish a win on coding. Re-test after changing the corpus, prompt construction, model, or retry policy.

The conclusion is conditional but actionable: Haiku is a strong candidate for bounded, high-volume work; it loses on cost when the measured extra work erases its per-call advantage. The 100K line makes that advantage smaller, not automatically worthless. Choose the least expensive workflow that meets the same quality and latency requirements, rather than assigning every task to the model with the smallest rate-card number.

FAQ

Does passing 100K prove that Haiku becomes less accurate?

No. The documented threshold is a billing rule. An accuracy or retrieval claim needs a controlled evaluation with actual prompts and an independent acceptance test. The calculations here make no such claim.

Can caching keep a long request in the lower band?

No. Cached tokens contribute to prompt length. Caching may reduce spend, but a prompt above 100K uses the higher-band rates for that request. Official billing explanation.

Is the five-attempt example a measured Sonnet victory?

No. Both the token volumes and the accepted outcomes are assumed. It shows an auditable break-even, not a model ranking. Real API usage, cache behavior, retry output, and measured acceptance can move that break-even in either direction.

Official Sources

Documentation and rates checked October 12, 2026. Calculated examples use the standard Claude API rates and exclude taxes, credits, tools, and regional surcharges.

Popular posts from this blog

Meta’s VideoJAM Explained: Why Motion Coherence Matters in AI Video

Grok 3’s 2025 Release: What xAI Announced, What Arrived, and What Changed

How to Process Apple Mail in Bulk with Claude: A Safer, Review-First Workflow