Token Bill

well-behaved.jsonl · 1 run · 14 calls · models: claude-sonnet-5 · {{REPORT_DATE}}

~0.0%^≈ of billed input tokens went to re-sending bytes the model had already seen; no cache breakers detected.

Run demo-well-behaved-seed7

14 calls · cache read 50,643 · cache write 6,091 · uncached input 0 · output 993 tokens · billed $0.0353 · redundant input 0.0%^≈

Billed tokens per call (exact, from the trace's usage fields): cache reads and writes, uncached input, output.

Dollars under each scenario. as-billed and no-cache are exact arithmetic on billed usage; optimal-cache and fixed-cache are simulations on the approx char basis^≈.

as-billed: exact: real billed usage priced at published rates (ground truth)
no-cache: counterfactual: every billed input token repriced at the full uncached rate (no cache reads, no write premium)
optimal-cache: simulated (approx): documented cache rules — 300s TTL sliding on read, min-cacheable gate, one breakpoint at end of messages; char-based token split scaled to billed totals; validation: billed cache reads 50643 vs simulated 50644 (agreement 1.000)
fixed-cache: simulated (approx): no repairs supplied — identical to optimal-cache

Cache breakers

None detected.

Methodology

Exact vs approximate. Every dollar figure and token total comes from the trace's real billed usage fields (or exact arithmetic on them). Numbers marked ≈ rest on char-based attribution (len/3.7), scaled so segments sum to each call's billed total — useful for proportions, never presented as billed.
Cache simulation rules. 300-second cache TTL, refreshed on read (sliding-window assumption, documented); cache entries are per-model; writes billed at the model's write premium only when a later call in the replay actually reads the entry (an optimal policy never caches what nothing reads back), so optimal-cache never exceeds no-cache; a prefix must meet the model's minimum cacheable length; the simulator places a single cache breakpoint at the end of messages each call (optimal placement). It models the provider's documented rules, not undocumented server behavior.
Redundancy. For each call after the first: the byte-identical rendered prefix shared with the previous call, valued at the call's billed input scaled by char fraction; input already served as cache reads is subtracted (cache reads are cheap — they are not waste).
Scenarios. as-billed = ground truth from usage; no-cache = all input at the full uncached rate; optimal-cache = replay under the documented cache rules; fixed-cache = optimal-cache after neutralizing the detected breakers.
Pricing. Bundled table shipped with tokenbill {{TOKENBILL_VERSION}}, verified 2026-09 against the provider price list. Cache reads are 0.10× base input (0.025× on claude-fable-5-1); dated snapshot ids are priced as their base model. Re-verify before release-grade accounting.