\n \n {label}\n \n \n {format ? format(value) : value}\n \n

\n {sublabel && (\n

\n {sublabel}\n

\n )}\n onChange(Number(e.target.value))}\n style={{ width: \"100%\", accentColor: \"#d4845a\" }}\n />\n

\n );\n}\n\nfunction CostBar({ label, value, maxValue, color, breakdown }: {\n label: string;\n value: number;\n maxValue: number;\n color: string;\n breakdown?: string;\n}) {\n const pct = maxValue > 0 ? Math.min((value / maxValue) * 100, 100) : 0;\n return (\n

\n {label}\n {formatDollars(value)}\n

\n {breakdown && (\n

\n {breakdown}\n

\n )}\n

\n );\n}\n\nfunction Verdict({ breakEven, refireInterval, refireCount, noPruneTotalCost, pruneTotalCost, turnsRemaining, provider }: {\n breakEven: number;\n refireInterval: number;\n refireCount: number;\n noPruneTotalCost: number;\n pruneTotalCost: number;\n turnsRemaining: number;\n provider: typeof PROVIDERS[string];\n}) {\n const isWaste = pruneTotalCost > noPruneTotalCost;\n const netSavings = noPruneTotalCost - pruneTotalCost;\n\n let verdict: string, explanation: string, color: string;\n\n if (isWaste) {\n verdict = \"Pruning is a net cost increase\";\n explanation = `Over ${turnsRemaining} turns (${refireCount} re-fire event${refireCount !== 1 ? \"s\" : \"\"}), pruning costs ${formatDollars(Math.abs(netSavings))} more than leaving context intact. ${\n refireInterval < breakEven\n ? `The re-fire interval (~${refireInterval} turns) is shorter than break-even (~${Math.ceil(breakEven)} turns), so the cache penalty never amortizes.`\n : `Break-even is ${Math.ceil(breakEven)} turns, ${turnsRemaining < breakEven ? \"longer than the remaining session.\" : \"but cumulative re-fire events erode savings.\"}`\n }`;\n color = \"#c75450\";\n } else {\n verdict = \"Pruning saves money here\";\n explanation = `Over ${turnsRemaining} turns (${refireCount} re-fire event${refireCount !== 1 ? \"s\" : \"\"}), pruning saves ${formatDollars(netSavings)}. ${provider.hasWritePremium ? \"Despite Anthropic's cache write premium, \" : \"\"}the per-turn savings from reduced context outweigh the cache penalty${breakEven < 10 ? \" within a few turns.\" : ` after ~${Math.ceil(breakEven)} turns.`}`;\n color = \"#5a9e6f\";\n }\n\n return (\n

\n {verdict}\n

\n {explanation}\n

\n );\n}\n\nfunction CostOverTurns({ noPruneCosts, pruneCosts, breakEvenTurn, refireTurns, maxTurns }: {\n noPruneCosts: number[];\n pruneCosts: number[];\n breakEvenTurn: number;\n refireTurns: number[];\n maxTurns: number;\n}) {\n const width = 520;\n const height = 200;\n const pad = { top: 20, right: 20, bottom: 30, left: 55 };\n const plotW = width - pad.left - pad.right;\n const plotH = height - pad.top - pad.bottom;\n\n const maxCost = Math.max(\n noPruneCosts[noPruneCosts.length - 1] || 0,\n pruneCosts[pruneCosts.length - 1] || 0,\n 0.01\n );\n\n const xScale = (i: number) => pad.left + (i / maxTurns) * plotW;\n const yScale = (v: number) => pad.top + plotH - (v / maxCost) * plotH;\n\n const makePath = (data: number[]) => {\n return data.map((v, i) => `${i === 0 ? \"M\" : \"L\"}${xScale(i).toFixed(1)},${yScale(v).toFixed(1)}`).join(\" \");\n };\n\n const yTicks = [0, maxCost * 0.25, maxCost * 0.5, maxCost * 0.75, maxCost];\n const xTicks = [0, Math.floor(maxTurns * 0.25), Math.floor(maxTurns * 0.5), Math.floor(maxTurns * 0.75), maxTurns];\n\n return (\n \n );\n}\n\nexport default function PruningCalculator() {\n const [providerKey, setProviderKey] = useState(\"anthropic_sonnet\");\n const [contextSize, setContextSize] = useState(200000);\n const [prunePosition, setPrunePosition] = useState(20);\n const [amountPruned, setAmountPruned] = useState(40000);\n const [turnsRemaining, setTurnsRemaining] = useState(50);\n const [tokensPerTurn, setTokensPerTurn] = useState(5000);\n const [toolOutputPct, setToolOutputPct] = useState(60);\n\n const provider = PROVIDERS[providerKey];\n\n const prunePositionTokens = Math.floor(contextSize * (prunePosition / 100));\n const postPruneContext = contextSize - amountPruned;\n\n // Bug 1 fix: entire prefix before prune position survives as cached, not just 5K\n const prefixCached = prunePositionTokens;\n const rewriteTokens = contextSize - prefixCached - amountPruned;\n\n // cost per turn WITHOUT pruning (fully cached conversation)\n const normalTurnCost = cost(contextSize, provider.cacheRead) + cost(tokensPerTurn, provider.cacheWrite);\n\n // cost of THE TURN pruning fires\n const pruningTurnCost = cost(prefixCached, provider.cacheRead) + cost(Math.max(0, rewriteTokens), provider.cacheWrite);\n\n // cost per turn AFTER pruning (new smaller cache established)\n const postPruneTurnCost = cost(postPruneContext, provider.cacheRead) + cost(tokensPerTurn, provider.cacheWrite);\n\n // per-turn savings\n const perTurnSavings = normalTurnCost - postPruneTurnCost;\n\n // break-even\n const cachePenalty = pruningTurnCost - normalTurnCost;\n const breakEvenTurns = perTurnSavings > 0 ? cachePenalty / perTurnSavings : Infinity;\n\n // Bug 2 fix: refire needs 40K protection window + 20K prune minimum = 60K of new tool output\n const toolOutputPerTurn = tokensPerTurn * (toolOutputPct / 100);\n const turnsToRefire = toolOutputPerTurn > 0 ? Math.ceil(60000 / toolOutputPerTurn) : Infinity;\n const refireInterval = turnsToRefire;\n\n // cumulative cost comparison over N turns (accounting for re-fires)\n const { noPruneCosts, pruneCosts, refireTurns } = useMemo(() => {\n const noPrune: number[] = [];\n const withPrune: number[] = [];\n const refires: number[] = [];\n let noCum = 0;\n let pCum = 0;\n let currentContext = contextSize;\n let turnsSinceLastPrune = 0;\n let firstPruneDone = false;\n\n for (let t = 0; t <= turnsRemaining; t++) {\n const noCtx = contextSize + t * tokensPerTurn;\n noCum += cost(noCtx - tokensPerTurn, provider.cacheRead) + cost(tokensPerTurn, provider.cacheWrite);\n noPrune.push(noCum);\n\n if (!firstPruneDone) {\n pCum += pruningTurnCost;\n currentContext = postPruneContext;\n firstPruneDone = true;\n turnsSinceLastPrune = 0;\n } else {\n turnsSinceLastPrune++;\n currentContext += tokensPerTurn;\n\n if (turnsSinceLastPrune >= refireInterval && refireInterval < Infinity) {\n const rePruneRewrite = currentContext - prefixCached - amountPruned;\n pCum += cost(prefixCached, provider.cacheRead) + cost(Math.max(0, rePruneRewrite), provider.cacheWrite);\n currentContext -= amountPruned;\n turnsSinceLastPrune = 0;\n refires.push(t);\n } else {\n pCum += cost(currentContext - tokensPerTurn, provider.cacheRead) + cost(tokensPerTurn, provider.cacheWrite);\n }\n }\n withPrune.push(pCum);\n }\n return { noPruneCosts: noPrune, pruneCosts: withPrune, refireTurns: refires };\n }, [contextSize, amountPruned, tokensPerTurn, turnsRemaining, provider, pruningTurnCost, postPruneContext, refireInterval, prefixCached]);\n\n const noPruneTotalCost = noPruneCosts[noPruneCosts.length - 1] || 0;\n const pruneTotalCost = pruneCosts[pruneCosts.length - 1] || 0;\n const maxBarValue = Math.max(normalTurnCost, pruningTurnCost, postPruneTurnCost);\n\n // compaction deferral: how many extra turns pruning buys before hitting context limit\n const headroomTokens = provider.contextLimit - postPruneContext;\n const deferredTurns = tokensPerTurn > 0 ? Math.floor(headroomTokens / tokensPerTurn) : Infinity;\n\n return (\n

\n {/* header */}\n

\n Prompt Cache Pruning Economics\n

\n When does pruning old tool outputs save money vs. busting your cache prefix?\n
Cache cost is proportional to what follows the mutation, not what was mutated.\n

\n\n {/* provider selector */}\n

\n \n Provider / Model\n \n

\n {Object.entries(PROVIDERS).map(([key, p]) => (\n setProviderKey(key)}\n style={{\n padding: \"6px 12px\",\n fontSize: 11,\n fontFamily: \"inherit\",\n border: `1px solid ${key === providerKey ? \"#d4845a\" : \"#332e28\"}`,\n borderRadius: 4,\n background: key === providerKey ? \"#d4845a18\" : \"transparent\",\n color: key === providerKey ? \"#d4845a\" : \"#a09888\",\n cursor: \"pointer\",\n transition: \"all 0.15s\",\n }}\n >\n {p.name}\n \n ))}\n

\n input: ${provider.input}/MTok · write: ${provider.cacheWrite}/MTok · read: ${provider.cacheRead}/MTok\n {provider.hasWritePremium && · write premium: {((provider.cacheWrite / provider.input - 1) * 100).toFixed(0)}%}\n

\n\n {/* sliders */}\n

\n \n `${v}% (${formatTokens(Math.floor(contextSize * v / 100))} in)`}\n sublabel=\"How far into the conversation the oldest pruned output sits\"\n />\n \n \n `${v}%`}\n sublabel={`${formatTokens(Math.round(tokensPerTurn * toolOutputPct / 100))}/turn is tool output — drives re-fire interval`}\n />\n `${v}`}\n />\n

\n\n {/* per-turn costs */}\n

\n Per-turn cost breakdown\n

\n \n \n \n

\n Per-turn savings: 0 ? \"#5a9e6f\" : \"#c75450\", fontWeight: 600 }}>{formatDollars(perTurnSavings)}\n

\n\n {/* key metrics */}\n

\n {[\n { label: \"Cache penalty\", value: formatDollars(Math.max(0, cachePenalty)), sub: \"one-time cost\" },\n { label: \"Break-even\", value: breakEvenTurns === Infinity ? \"never\" : `${Math.ceil(breakEvenTurns)} turns`, sub: perTurnSavings <= 0 ? \"no per-turn savings\" : `saving ${formatDollars(perTurnSavings)}/turn` },\n { label: \"Est. re-fire\", value: refireInterval === Infinity ? \"never\" : `~${refireInterval} turns`, sub: refireInterval < breakEvenTurns ? \"before break-even ⚠\" : \"after break-even ✓\" },\n ].map((m, i) => (\n

{m.label}

{m.value}

{m.sub}

\n ))}\n

\n\n {/* scenario context banner — visible near chart for screenshots */}\n

\n {provider.name}\n ·\n {formatTokens(contextSize)} ctx\n ·\n prune {formatTokens(amountPruned)} @ {prunePosition}%\n ·\n {formatTokens(tokensPerTurn)}/turn ({toolOutputPct}% tool)\n ·\n read ${provider.cacheRead} · write ${provider.cacheWrite}/MTok\n

\n\n {/* cumulative chart */}\n

\n Cumulative cost over session\n

\n \n

\n No pruning: {formatDollars(noPruneTotalCost)}\n With pruning: {formatDollars(pruneTotalCost)}\n

\n\n {/* verdict */}\n \n\n {/* compaction deferral note */}\n

\n Pruning {formatTokens(amountPruned)} defers compaction by ~{deferredTurns === Infinity ? \"∞\" : deferredTurns} turns at {formatTokens(tokensPerTurn)}/turn ({formatTokens(provider.contextLimit - postPruneContext)} headroom to context limit).\n

\n\n {/* methodology note */}\n

\n Methodology: Assumes prefix-based KV cache where mutation at position N invalidates everything after N.\n \"Prune position\" is where the oldest pruned output sits — everything before it remains cached; everything after is rewritten at cache-write rates.\n Re-fire interval estimated from tool output accumulation rate filling the 40K protection window + 20K prune minimum (60K total).\n No-prune path assumes context grows by tokens/turn each turn with full cache hits — it does not model compaction, which triggers when context exceeds the model limit and is typically more expensive than pruning.\n Real-world cache hit rates vary by provider.\n

\n\n {/* view source */}\n

\n view source\n

\n );\n}","deleted","label",[180,181,162],"frontend","components","permalink","https://www.val.town/x/bl3/pruning-calculator/code/frontend/components/PruningCalculator.tsx","extension","actionData","errors"]