SYNTHESIS NOTE
TopicsReasoning Critiquesthis note

Why does chain of thought accuracy eventually decline with length?

Explores why longer reasoning chains don't always improve answers, and how the optimal length shifts based on task difficulty and model capability.

Synthesis note · 2026-02-22 · sourced from Reasoning Critiques
How should we spend compute at inference time?

The "longer is better" assumption for CoT has an empirical ceiling: task accuracy initially improves with CoT length, reaches a peak, then decreases. The inverted-U curve applies across models and tasks, and its peak location follows consistent patterns.

Two scaling laws for optimal CoT length:

  1. Difficulty scaling — optimal length increases with task difficulty. Harder problems benefit from longer chains because more decomposition steps are needed. This part matches intuition.

  2. Capability scaling — optimal length decreases with model capability. More capable models find more efficient paths to correct answers and require fewer steps. Using the same long chains for a more capable model is counterproductive.

The second law has a practical consequence: treating all models identically (same token budget, same chain length) misallocates compute. A model that can solve a problem in 5 steps should not be given budgets designed for a 20-step solution.

Simplicity bias as a training-emergent property: RL training reveals this dynamic in action. As RL training improves accuracy, models gravitate toward shorter CoTs — not because they were explicitly trained to be concise, but because shorter chains produce correct answers and RL rewards correct answers. The simplicity bias emerges automatically from the reward signal.

This connects to Why do correct reasoning traces contain fewer tokens? — the same empirical signal: shorter chains are correct chains. The inverted-U explains why: length past the optimal point introduces accumulation of decomposition errors and contextual noise (see Do models fail worse when their own errors fill the context?).

The practical implication: train on optimally-lengthed CoTs (not maximal-length), and at inference, use length-aware filtering to discard excessively long chains. The simplicity bias is not a failure mode — it is a signal of genuine capability.

Inquiring lines that read this note 245

This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.

Do reasoning traces faithfully represent or merely mimic actual model reasoning? How should models express uncertainty rather than forced confident answers? Why do reasoning models fail at systematic problem-solving and search? Can graph structure and relationships fundamentally improve recommendation systems? What actually drives chain-of-thought reasoning improvements in language models? What capability tradeoffs emerge when scaling model reasoning abilities? How does latent reasoning compare to verbalized chain-of-thought? How do training data properties shape reasoning capability development? Why do correct reasoning traces tend to be shorter than incorrect ones? When do additional thinking tokens stop improving reasoning performance? How do neural networks separate factual knowledge from reasoning abilities? How should retrieval systems optimize for multi-step reasoning during inference? How should iterative research systems allocate reasoning per search step? What structural advantages do diffusion language models offer over autoregressive methods? How does reasoning graph topology affect breakthrough insights and generalization? Does parallel reasoning outperform sequential thinking under fixed compute budgets? How does AI assistance affect human cognitive development and reasoning autonomy? Why does self-revision increase model confidence while degrading accuracy? Can model confidence signals reliably improve reasoning quality and calibration? Why does supervised fine-tuning improve accuracy while degrading reasoning quality? How does example difficulty affect learning efficiency in language models? Why do benchmark improvements fail to reflect actual reasoning quality? How does reasoning effort affect AI theory of mind performance? What mechanisms enable AI systems to generate and spread false beliefs? How should inference compute be adaptively allocated based on prompt difficulty? Can prompting inject entirely new knowledge into language models? Can ensemble evaluation methods reduce bias more than single judges? How do adversarial and manipulative prompts attack reasoning models? How should memory consolidation strategies shape agent performance over time? Do language models perform faithful symbolic reasoning independent of semantic grounding? How can process reward models supervise complex reasoning traces? Does reinforcement learning teach reasoning or just when to reason? What properties determine whether reward signals teach genuine reasoning? Why do language models struggle with implicit discourse relations? How can models identify insufficient information and respond appropriately without guessing? How can AI systems learn from failures without cascading errors? When does architectural design matter more than raw model capacity? Can next-token prediction alone produce genuine language understanding? What are the consequences of models training on synthetic data? Do language models learn genuine linguistic structure or just surface patterns? Do corrupted reasoning traces serve as effective supervision signals? When does optimizing for quality undermine the value of diversity? Can AI-generated outputs constitute genuine knowledge or valid claims? Does recurrence enable reasoning capabilities that fixed-depth transformers cannot achieve? How does sequence length affect sparsity tolerance in models? Can language model RL training avoid reward hacking and misalignment?

Related concepts in this collection 6

This note in its neighbourhood — explore the map, then jump to a related concept in the list below.

Concept map
14 direct connections · 162 in 2-hop network ·dense cluster Open in graph ↗

Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph

your link semantically near linked from elsewhere

Related papers in this collection 8

Papers most semantically related to this note, ranked by cosine similarity in the embedding space.

Original note title

optimal cot length follows an inverted-u — more capable models prefer shorter cot