Context Engineering in 2026 — Louis-François Bouchard, Omar Solano & Samridhi Vaid, Towards AI
In this AI-tutor evaluation, keeping full history beat compaction on recall and cost because cached tokens were cheap. Measure your constraint before shortening agent context.
For tutor memory, retaining the full chat recalled about **95%** of supplied details versus **32%** after summarization. Single-fact retrieval remained stable through **800k tokens**, and the cheapest run sent the most tokens because repeated context benefited from provider caching.
Do not compact agent history by default. Benchmark full history, retrieval, and summarization on your own workload and pricing; preserve cached prefixes where possible, then compact only when a named context-window, latency, throughput, or cost constraint requires it.
For tutor memory, retaining the full chat recalled about **95%** of supplied details versus **32%** after summarization. Single-fact retrieval remained stable through **800k tokens**, and the cheapest run sent the most tokens because repeated context benefited from provider caching. Do not compact agent history by default. Benchmark full history, retrieval, and summarization on your own workload and pricing; preserve cached prefixes where possible, then compact only when a named context-window, latency, throughput, or cost constraint requires it. These results come from one open-source tutor and its evaluation design. Its conversations were limited, local models hit a context-window ceiling, and provider cache pricing can change the cost ordering.
This challenges compaction as a default optimization: in the supplied tutor workload, full cached history preserved substantially more detail and was cheapest despite sending more tokens. It turns summarization and retrieval into constraint-driven alternatives that must beat a full-history baseline on the actual workload, while limiting the conclusion to the tested conversation shape and mutable cache pricing.