Recursive Language Model
Also called RLM, RLMs, recursive LM.
A recursive language model (RLM) is an inference strategy in which a long prompt is kept outside the model's context window as an external resource that the model inspects programmatically, splitting the task into parts and calling itself recursively on them.
Description
RLMs address inputs far longer than a context window without first compressing or summarizing them. The model works in a code environment where the prompt is stored as data, reads only the parts it needs, and delegates sub-problems to recursive calls whose results it combines. The authors report handling inputs about two orders of magnitude beyond the context window and outperforming compaction and common agent scaffolds on long-context tasks at comparable cost. The approach treats long-context handling as a form of test-time compute rather than a property of the model.
Sources
- Zhang et al. (2025). Recursive Language Models.
Cite this entry
Protologue. (2026). Recursive Language Model. In Protologue: A Taxonomy of Prompting and LLM Techniques (v1.4.0, PTL-0213). https://protologue.com/t/recursive-language-model/
BibTeX
@misc{protologue_recursive_language_model,
title = {Recursive Language Model},
author = {{Protologue}},
year = {2026},
howpublished = {Protologue: A Taxonomy of Prompting and LLM Techniques, v1.4.0},
note = {Entry PTL-0213},
url = {https://protologue.com/t/recursive-language-model/}
}New terms, as they're coined
One email a week with the newest techniques, each defined and sourced like this entry.
Delivered through Beehiiv. Unsubscribe from any issue.