Evaluate with evidence

Use these measures: Measure cache-read tokens, cache-write tokens, hit ratio by token, time to first token, total latency, input cost per request, reuse count per prefix hash, and quality before and after prefix reordering.

An evaluation set should represent the actual decision, including easy cases, common cases, rare costly cases, and adversarial or malformed inputs. Freeze a test set before tuning. If examples repeatedly influence prompt, threshold, or architecture choices, move them into a development set and obtain a fresh test set. Report sample count and uncertainty; a 95% score on 20 examples means only one observed miss and says little about rare failures.

Pair offline quality with online operations. A component can score well offline and fail under concurrency, stale data, changed users, or dependency outages. Slice results by relevant dimensions rather than trusting one average. Always compare with a simple baseline: deterministic rules, keyword search, a smaller model, or the current human workflow.

A 12,000-token policy manual is shared by 1,000 daily requests; each request adds 300 unique tokens. Moving the manual before the user message makes the 12,000-token prefix reusable while the 300-token suffix stays dynamic.

The worked number is without caching: 12.3M input tokens/day; with 90% prefix hits: 1.2M uncached prefix + 0.3M suffix = 1.5M full-price-equivalent tokens before cache-read pricing. State the unit and denominator whenever you report it. A percentage without a denominator can conceal a tiny sample; a latency without a percentile can conceal slow users; a similarity score without a labeled task can conceal irrelevant neighbors. Compare the observed value with a threshold chosen before seeing the final test result.

Now test the tempting shortcut. Suppose the team optimizes only the most visible metric. The result may look better while the system becomes less trustworthy. The reason is concrete: A longer cached prefix can save more input work but may carry irrelevant context and increase uncached misses when any early token changes. Explicit caches improve control but require lifecycle management. Savings depend on repetition, provider pricing, and whether latency is dominated by input processing or output generation. This is why the decision record must include both the intended gain and the tolerated regression. If the tolerated regression is unknown, the change is not ready for a consequential workflow.

• Prefer a measured baseline over a persuasive demo.
• Keep versions, inputs, and thresholds reproducible.
• Separate syntactic success from semantic correctness and authorization.
• Escalate or abstain when evidence falls outside the contract.
• Re-evaluate when data, traffic, models, providers, or user goals change.

These rules turn the topic into an engineering decision rather than a slogan. They also make disagreement productive: another person can challenge the assumptions, rerun the evaluation, and reach a documented conclusion.

For every percentage, report numerator, denominator, and slice. For every latency, report workload and percentile. For every human rating, define the rubric and check agreement on a shared subset. Compare paired outputs on the same examples when possible; this reduces noise from case difficulty. Investigate regressions, not only the aggregate win. Finally, reserve a fresh set for confirmation after tuning. If the candidate misses a hard safety, authorization, or correctness threshold, a higher average score elsewhere does not compensate—the candidate fails the gate.