4.5 — Optimising Token Usage, Latency, and Cost-Performance Trade-offs
CCAR-P Domain 4 · Task 4.5
What You Need to Know
Two Rules
- Measure first — traces/usage name the dominant term (stage, token type, call pattern)
- Re-gate with evals — change ships only if cheaper and still clears the quality bar
Token & Cost Levers
| Lever | When |
|---|---|
| Prompt caching | Repeated stable prefixes |
| Context curation | Send fields, not files |
| Tight output contracts | Cap expensive output tokens |
| Effort / reasoning budgets | Tune within one model |
| Right-sizing per stage + cascade | Cheapest model that clears measured bar |
| Batch processing | No waiting user (“overnight”, “bulk”) |
Latency Levers
| Lever | What it attacks |
|---|---|
| Streaming | Perceived latency (humans watching) |
| Smallest model that clears bar | Real latency |
| Parallel independent tool calls | Serial waits |
| Caching | TTFT for long stable prefixes |
Key Concept: Optimisations move along the frontier — they do not repeal it. Name the spend and the saving, with eval evidence the spend is affordable.
Exam Traps
- Offering batch for a latency-sensitive user-facing flow
- Switching to the smallest model without re-running evals
- Offering prompt caching for context-window overflow, wrong answers, or unique one-off documents
Check your understanding
Practice Scenario
🔒 This practice scenario is part of Skillmarked Pro
The lessons stay free. Pro unlocks the other 32 CCAR-P practice scenarios and the 63-question timed mock exam, plus everything for every other exam.
Cancel anytime. Or €199 a year, which saves 17%.
Not sure yet? Try 10 free mock exam questions.
Already Pro? Log in.
Sources
- Prompt caching, Claude Platform Docs
- Batch processing, Claude Platform Docs
- Reducing latency, Claude Platform Docs
- Optimizing for cost and intelligence, Claude Platform Docs
- Token counting, Claude Platform Docs