cs.AINov 3, 2026
SaveYou don't need long context
Abstract
Later tokens are costlier to generate than earlier tokens. On frontier open weight models, the disparity in cost may rise to as much as 7x. Through frequent compaction, we show across a broad range of long-horizon and long-input tasks that frontier language models sacrifice little to no task accuracy when maintaining short contexts. We further demonstrate that LLM performance does not collapse on long-horizon software engineering tasks even when taking at most one action per context, and based on that we outline the concept of semantic state space models (SSSMs). Our findings question the need for long-context language models.
Figures & tables
Figure 1: The cost of long context. Dollar cost of generating M output tokens on an existing input KV cache as a function of the context window size, obtained by converting the measured peak decode throughput of each deployment at on-demand H100 prices ( \3.85256163.6\times5.6\times7\times$ more for Qwen.
Figure 2: The burden of long context. The token generation latency, token throughput, and memory footprint of several open-source models measured on an NVIDIA DGX Spark plotted as a function of input context length. For several models, later tokens take approximately 2x longer to generate than earlier tokens and require a larger memory footprint.
| Literary works | Model context window sizes | ||||
| Work | Words | Tokens | Model | Words | Tokens |
| The Old Man and the Sea [ 21 ] | K | K | MiniMax M2.7 [ 31 ] | K | K |
| The Great Gatsby [ 15 ] | K | K | Claude Opus 4.5 [ 2 ] | K | K |
| Qur’an (Saheeh Int’l translation) [ 38 ] | K | K | Gemma 4 31B [ 16 ] | K | K |
| King James New Testament [ 26 ] | K | K | Kimi K2.6 [ 32 ] | K | K |
| Great Expectations [ 12 ] | K | K | Qwen 3 Coder Next [ 9 ] | K | K |
Table 1: Lengths of literary works against model context window sizes. Word counts use the cited English editions. Word-token conversions use approximately tokens per English word, while actual counts vary with text and tokenizer. Models and their context window sizes are detailed in Section 2.3 .
Figure 3: Context-management regimes. The three context-management regimes considered in this work: Full-History Accumulation (FHA), End-of-Conversation Compaction (EoCC), and Single-Action Compaction (SAC).
Figure 4: Decode throughput collapses as the context window size grows. Peak sustained decode throughput (tokens/s, left axis) for open-weight coding models served under vLLM on NVIDIA H100 GPUs, as a function of the configured context window size. GLM 5.2 and Kimi K2.6 are served with INT4 experts and BF16 activations (Kimi additionally with an FP8 KV cache), Qwen 3 Coder Next in BF16. The right axis re-expresses the same curve as a speedup over the K operating point. Reducing the context window size from K to K buys (GLM 5.2), (Kimi K2.6), and (Qwen 3 Coder Next) more decoded tokens per second on identical hardware.
Figure 5: Long-horizon results as a function of total context limit. Top: accuracy changes in percentage points relative to each model’s full-history baseline; zero indicates unchanged accuracy. Bottom: baseline estimated optimized retail cost divided by the compaction configuration’s estimated optimized retail cost; indicates unchanged cost. Orange/blue identify Claude Opus 4.5 and GPT 5.6 Sol, respectively, and stars mark the baselines. Cost estimates use the model in Appendix B .
Figure 6: Long-input results as a function of total context limit. Top: accuracy changes relative to each model’s full-input baseline. Bottom: optimized retail cost savings, using the model in Appendix B .
Figure 7: LongBench v2: conversation length versus document length. Claude Opus 4.5, compaction at K / K. The document-length axis is logarithmic and the conversation-length axis is linear. The dashed curve marks .
Figure 8: LOONG: conversation length versus document length. Claude Opus 4.5, compaction at K / K (1,600 questions). The document-length axis is logarithmic and the conversation-length axis is linear. The dashed curve marks .