Longer prompts make AI worse at reasoning — and the drop happens far before any memory limit is hit.
Why does reasoning performance degrade as input length increases?
This explores why longer inputs make reasoning worse — and the corpus points to a surprising answer: it's not running out of context window, it's the model getting distracted, unfamiliar, or overthinking as the sequence grows.
This explores why longer inputs make reasoning worse — and the corpus's most striking finding is that the damage happens *far below* the context window. On the FLenQA benchmark, reasoning accuracy fell from 92% to 68% with just 3,000 tokens of padding, and the drop was task-agnostic, uncorrelated with language-modeling quality, and survived chain-of-thought prompting Does reasoning ability actually degrade with longer inputs?. So the model isn't forgetting because it hit a memory ceiling. Something about the *presence* of more tokens — even irrelevant ones — degrades the reasoning itself.
A big part of the answer is that length hurts on both sides of the equation: not just longer inputs, but longer *thinking*. Accuracy on reasoning tokens follows an inverted U — push from ~1,100 to ~16,000 thinking tokens and benchmark scores can fall from 87% to 70% Does more thinking time always improve reasoning accuracy?. Optimal chain-of-thought length peaks in the middle and shrinks as models get more capable Why does chain of thought accuracy eventually decline with length?. The mechanism behind the mid-sequence collapse is telling: reasoning models 'wander' (explore invalid paths) and 'underthink' (abandon promising ones too early) — structural disorganization, not lack of compute Why do reasoning models abandon promising solution paths?. More tokens give the model more room to lose the thread.
There's also a deeper claim that length is a red herring for the real cause: *unfamiliarity*. Large reasoning models don't break at a complexity threshold — they break at novelty. They fit instance-level patterns rather than general algorithms, so a chain of any length succeeds if the model saw similar instances in training and fails otherwise, regardless of how long it is Do language models fail at reasoning due to complexity or novelty?. That reframes 'long inputs are hard' into 'long inputs contain more chances to hit something unfamiliar.' The same ceiling shows up when models are asked to sustain genuine backtracking: frontier systems score just 20–23% on constraint-satisfaction problems, revealing that fluent-sounding long reflection doesn't equal actual competence on unfamiliar structure Can reasoning models actually sustain long-chain reflection?.
There's a mathematical floor underneath all this, too. A Lipschitz-continuity analysis proves that longer reasoning chains *dampen* the propagation of input noise but can never eliminate it — a non-zero sensitivity floor exists structurally, so more context always carries some irreducible risk of throwing the answer off Can longer reasoning chains eliminate model sensitivity to input noise?. And length interacts badly with malformed inputs: reasoning models balloon into redundant chains on ill-posed or missing-premise questions because training taught them to produce reasoning steps but never taught them when to *stop* Why do reasoning models overthink ill-posed questions?.
The interesting upshot — the thing you might not have known you wanted to know — is that the fixes point away from 'add more tokens.' Verbosity turns out to be a single steerable direction in activation space (cut chains 67% with no accuracy loss) Can we steer reasoning toward brevity without retraining?; models can be trained to *route* between deep thinking and quick answers instead of always reasoning at length Can models learn when to think versus respond quickly?; and in multi-turn search, *capping* reasoning per turn preserves context for later evidence instead of burning it all upfront Does limiting reasoning per turn improve multi-turn search quality?. The consistent lesson: degradation with length isn't a capacity problem you solve with a bigger window — it's a discipline problem you solve by teaching models when to be brief.
Sources 11 notes
FLenQA shows reasoning accuracy drops from 92% to 68% at just 3000 tokens of padding, far below context window capacity. The degradation is task-agnostic, uncorrelated with language modeling performance, and persists even with chain-of-thought prompting.
Increasing thinking tokens from ~1,100 to ~16K reduced benchmark accuracy from 87.3% to 70.3%, revealing a non-monotonic relationship where models overthink easy problems and underthink hard ones.
Task accuracy peaks at intermediate CoT length, with optimal length increasing alongside task difficulty but decreasing with model capability. RL training naturally gravitates toward shorter chains as models improve, revealing that simplicity emerges from reward signals rather than explicit training.
Reasoning LLMs exhibit two reinforcing failures: wandering (invalid exploration) and underthinking (premature path-switching). Decoding-level interventions like thought-switching penalties improve accuracy without fine-tuning, suggesting viable solutions exist but are abandoned prematurely.
LRMs don't break at complexity thresholds but at instance-novelty boundaries. Models fit instance-based patterns rather than generalizable algorithms, so any reasoning chain succeeds if trained on similar instances, regardless of length.
Show all 11 sources
DeepSeek-R1 and o1-preview achieve only 20-23.6% exact match on 850 constraint satisfaction problems requiring genuine backtracking. This ceiling reveals that reflective reasoning fluency does not translate to actual problem-solving competence on unfamiliar instance structures.
Lipschitz continuity analysis proves that while additional reasoning steps reduce perturbation propagation, a non-zero robustness floor exists structurally. Sensitivity decreases with stronger embedding and hidden state norms but never reaches zero.
Reasoning models generate redundant, lengthy responses to questions with missing premises while non-reasoning models correctly identify them as unanswerable. Training optimizes for producing reasoning steps but never teaches models when to disengage.
Activation-Steered Compression extracts a single vector from 50 paired examples to reduce chain-of-thought length by 67% while maintaining accuracy and achieving 2.73x speedup. The method is training-free and generalizes across model sizes and domains.
Thinkless trains a single model to select between extended reasoning and direct responses using DeGRPO, which decouples mode selection from answer refinement. This prevents mode collapse and enables self-calibrated routing without explicit difficulty labels.
Unrestricted reasoning within single search turns consumes context needed for subsequent retrieval rounds, degrading the agent's ability to incorporate new evidence. Setting per-turn reasoning budgets, not just overall time limits, prevents this context erosion and maintains search quality across iterations.
Papers this line draws on 8
The research behind the notes this line reads — ranked by how closely each paper relates.
- The Illusion of Thinking: Understanding the Strengths and Limitations of Reasoning Models via the Lens of Problem Complexity
- Think Deep, Not Just Long: Measuring LLM Reasoning Effort via Deep-Thinking Tokens
- Between Underthinking and Overthinking: An Empirical Study of Reasoning Length and correctness in LLMs
- Mining Hidden Thoughts from Texts: Evaluating Continual Pretraining with Synthetic Data for LLM Reasoning
- Rethinking Thinking Tokens: LLMs as Improvement Operators
- Is Chain-of-Thought Reasoning of LLMs a Mirage? A Data Distribution Lens
- When More is Less: Understanding Chain-of-Thought Length in LLMs
- Same Task, More Tokens: the Impact of Input Length on the Reasoning Performance of Large Language Models