Is long-context bottleneck really about memory or compute?
Explores whether the challenge of handling long context windows stems from storage capacity limits or from the computational cost of transforming context into internal state. Understanding this distinction reshapes how we design language models.
The standard framing of the long-context problem is capacity: attention scales poorly with context length, the KV cache grows, and we run out of room. "Language Models Need Sleep" reframes it as a compute-allocation problem. When the context window fills, the model enters a "sleep" — it performs N offline recurrent passes over the accumulated context and updates the fast weights in its state-space-model blocks through a learned local rule, then clears the KV cache and resumes. The information that would be lost on eviction is not stored verbatim; it is transformed into internal state by spending compute.
This relocates the bottleneck. The question is not "how much can we hold?" but "how much compute do we spend converting recent context into persistent weights, and when?" The design shifts that compute to the sleep phase, preserving wake-time prediction latency. The empirical signature confirms it is a compute story: increasing sleep duration N improves performance, with the largest gains on examples that require deeper reasoning — more offline compute buys more capability on hard cases, exactly the test-time-scaling pattern moved to an offline window.
The reframe is significant because it dissolves the capacity ceiling rather than raising it. A capacity solution adds memory; a compute solution adds passes. This connects to the vault's emerging theme that when a model thinks is as designable as how much — since When should AI systems do their thinking?, shifting inference to idle windows is a third temporal position for compute, and the sleep-consolidation mechanism is its architectural realization inside the weights. It also relates to alternatives that attack the capacity framing differently — since Can neural memory modules scale language models beyond attention limits?, one can add a long-term memory module instead of consolidating into fast weights. Counterpoint: spending compute on consolidation is only a win if the offline budget is genuinely free; under continuous load with no idle time, the sleep cost competes with serving. Why it matters: it tells architects to budget consolidation compute rather than chase ever-larger context windows.
Inquiring lines that read this note 143
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 language models understand semantics or rely on pattern matching?- How does context collapse affect what language models can meaningfully communicate?
- Why does removing language from its context destroy what makes it work?
- Can context compression preserve what matters without introducing bias?
- Can compressive memory track what matters most across 35 conversation sessions?
- Can KV cache pruning serve as an alternative to consolidation?
- When should architects prioritize consolidation compute over larger context windows?
- Can task-agnostic compression of documents remain broadly useful for later queries?
- Does recurrent memory or gist compression work better for ultra-long context?
- How do memory hierarchies and compression reduce context management demands?
- How does reducing activation precision further extend context length?
- Can fixed-size latent states losslessly store arbitrary input context?
- Why does keeping full key-value blocks matter more than compressing them?
- Do retrieval-augmented memory systems actually solve the compartmentalization problem?
- How do the six memory components combine across explicit and implicit paths?
- How do cortical columns implement local inference over memory cycles?
- What makes memory trajectories topologically stable under persistent reuse?
- Can precomputed inferences be stored in memory modules between model interactions?
- How do retention gates regularize forgetting across different sequence model architectures?
- How does completion-driven KV pruning differ from attention-based cache management?
- What persistent memory architectures best support storing precomputed inferences across sessions?
- What makes a memory reachable in the right context?
- What computational costs does closed-loop memory refinement introduce?
- How does context budget create tradeoffs between memory and skills?
- How can memory shift from a passive datastore to an actively trained component?
- How does separating local and global context dependencies affect long-context performance?
- Can memory primitives become first-class design objects like computation sparsity?
- Why do hybrid memory systems outperform single-tier AI architectures?
- How does the hippocampus bind disparate elements without storing everything itself?
- Can memory workspaces resolve contradictory evidence that stateless systems miss?
- Can models consolidate context into weights during idle offline phases?
- Does including full context always degrade memory retrieval quality in practice?
- Why do language models ignore condensed memory even when it is the only memory?
- How should memory systems split between short-term and long-term storage?
- Can external managers optimize context better than the model itself?
- Can recurrent state mechanisms process longer sequences than attention-based working memory approaches?
- How do adaptive memory modules compare to feedback-based working memory for long context?
- Why does attending to own latents work better than bolted-on external memory stores?
- How does externalized state affect the long-context bottleneck in language models?
- How do recurrent memory systems handle ultra-long context differently than attention?
- Why is long-context compute spent transforming context into internal state rather than storing it?
- What capacity limits does the memory model face as corpus grows?
- Why does connectivity between memory modules matter more than storage capacity?
- How should we measure operational cost of memory systems in production?
- Does transformer attention architecture fundamentally prevent topic-aware memory?
- What does attentional state look like in a static context window?
- How do neural memory modules extend context length beyond attention limits?
- Why does attention quality degrade as context length increases?
- Why does attention excel at context retrieval but struggle with state updates?
- What computation remains in the attention heads that programs cannot capture?
- Can adaptive prompt-difficulty allocation compound with architectural efficiency improvements?
- How does per-token adaptive compute improve efficiency in recurrent reasoning?
- How should inference compute budget be allocated across different prompt difficulties?
- Can architectural changes alone achieve compute-optimal per-prompt scaling?
- How do sub-token and architecture-level compute optimization strategies compare?
- What constraints force mobile deployments to operate in the sub-billion parameter regime?
- What tree depth is achievable before GPU memory becomes the bottleneck?
- How should tiny language models be architected differently than large ones?
- Can width-scaling replace depth-scaling on inherently sequential problems?
- How does prompt optimization differ from building persistent activation context?
- What limits the capacity of context-based fast adaptation channels?
- Can offline context optimization reduce test-time latency like sleep-time compute?
- Can post-thinking compute on memory reduce query-time reasoning costs?
- How does precomputing context reasoning reduce latency in stateful applications?
- Where does inference compute stop substituting for model capacity?
- Can test-time scaling compound through memory consolidation into a new scaling law?
- Can sleep-time compute reduce latency demands during model inference?
- How do sleep-time and post-completion methods reduce inference latency?
- How does the inference steps dial compare to test-time compute trade-offs in language models?
- How does era sensitivity in legal cases compound with context length failures?
- How does context complexity affect LLM performance on temporal reasoning tasks?
- Why does bidirectional attention in diffusion models prevent KV cache reuse?
- Do decoder-only models have inherent architectural limits for non-sequential information?
- Why do language models fail at coreference across long contexts?
- Can fast-slow separation improve both memory and generation in language models?
- Can latent recurrence and energy minimization both escape the same computational depth constraints?
- How does adjacent layer sharing differ from non-adjacent weight reuse?
- Can layer-wise KV caches enable truly lossless information transfer?
- How do transformers compare to state-space models on copying and retrieval?
- When does long-context LLM reasoning fail where structured retrieval succeeds?
- Can long-context readers handle compositional tasks or just semantic search?
- Can parallel retrieval chains avoid the context consumption problem?
- What makes multi-session context tracking harder than single-turn underspecification problems?
- What computational cost does trajectory-bursty inference impose on per-query context requirements?
- How does gist-first lookup compare to pure retrieval or context stuffing?
- Does retrieval quality depend more on access structure or write gating?
- When does active reconstruction cost more than simple context dumping?
- How does accumulated context history degrade iteration quality in long-horizon tasks?
- How does context length affect retrieval quality in modernized BERT architectures?
- Can context windows and RAG actually change what language models generate?
- Can long-context models replace retrieval-augmented generation systems?
- How would you redesign context integration to prevent prior associations from dominating?
- How do model priors enable targeted context queries without full attention?
- Can models internalize retrieved context as static parametric knowledge?
- Why does teacher forcing fail to capture long-range dependencies?
- Can in-context learning's advantage erode once interaction histories exceed the context window?
- Can long-context models handle compositional reasoning requiring structured logic?
- Can recursive sub-calls decompose reasoning across multiple context chunks?
- Why do long-context language models struggle with compositional reasoning tasks?
- When is numeric computation the real bottleneck versus reasoning depth?
- Why do embedding table lookups become memory-bound bottlenecks at scale?
- Why do encoder models process document corpora more efficiently than decoder models?
- What is the cost difference between filtering context versus attending to everything?
- Does conditional memory reduce computation alongside conditional sparsity?
- Why do longer sequences tolerate higher sparsity than shorter ones?
- What mechanisms cause short contexts to degrade more under aggressive sparsity?
- Why do hybrid memory and compute sparsity outperform pure parameter scaling?
- Does sequence length affect sparsity tolerance the same way across task types?
- What makes looped latent computation more efficient than scaling attention capacity?
- How do parallel sampling and sequential depth compare as scaling dimensions?
- How do parallel and sequential retrieval strategies compare in compute efficiency?
- Which problems cannot be solved by parallel architectures and require serial depth?
- Do serial-bound problems benefit from aggregation over parallel traces?
- Why do longer context windows alone fail to capture temporal dynamics in dialogue?
- What update rules should govern dialogue-scoped versus turn-scoped memory?
- Can memory consolidation fragility be detected and reversed during execution?
- Does compressing all past memories into one representation lose irretrievable details?
- What makes memory consolidation fragile compared to raw trajectory storage?
- Can episodic raw memory outperform consolidated summaries in practice?
- Why does uniform memory consolidation sometimes degrade below the no-memory baseline?
- Why does consolidating more state sometimes hurt performance below the no-memory baseline?
- Which memory components trigger context-length problems in agents?
- Why does credit assignment through memory rewriting avoid expensive LLM parameter updates?
- Why do weaker agents need more aggressive context compression than stronger ones?
- How should agents compress episodic interactions into working memory without accumulation?
- How do memory hygiene and context efficiency trade off in deployed agents?
Related concepts in this collection 4
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
When should AI systems do their thinking?
Most AI inference happens when users ask questions, but what if models could think during idle time instead? This explores whether shifting inference to before queries arrive could fundamentally change system design.
the general principle of shifting inference to idle windows; sleep-consolidation realizes it inside the weights
-
Can neural memory modules scale language models beyond attention limits?
Can separating short-term attention from adaptive long-term memory allow models to efficiently handle context windows exceeding 2M tokens while maintaining competitive performance?
an alternative that adds long-term memory capacity rather than consolidating into fast weights
-
Can recursive subtask trees overcome context window limits?
Explores whether modeling reasoning as prunable trees of subtasks could eliminate the context length constraints that currently force developers into multi-agent architectures. Asks if working memory can become truly unlimited through selective KV cache retention.
another non-capacity approach: prune the KV cache rather than consolidate it into weights
-
Can models consolidate memories during offline sleep phases?
This explores whether LLMs can use dedicated offline periods to consolidate short-term learning into permanent weights, avoiding catastrophic forgetting and the need for expensive retraining.
a *different* paper sharing the exact title "Language Models Need Sleep" (2606.03979, Behrouz/Mirrokni); its sleep consolidates via upward distillation + RL dreaming rather than offline recurrence over evicted KV — same metaphor, different mechanism
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- Recursive Language Models
- Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention
- Longer Context, Deeper Thinking: Uncovering the Role of Long-Context Ability in Reasoning
- Self-Guided Test-Time Training for Long-Context LLMs
- Language Models Need Sleep
- Beyond Context Limits: Subconscious Threads for Long-Horizon Reasoning
- MiniMax Sparse Attention
- Sleep-time Compute: Beyond Inference Scaling at Test-time
Original note title
the long-context bottleneck is compute to transform evicted context into internal state not memory capacity