Introducing The Token-Efficient Memory Algorithm
Blog post from Mem0
Mem0 announced a new AI agent memory algorithm designed to improve accuracy while limiting retrieval context to fewer than 7,000 tokens per query, compared with more than 25,000 tokens often used by full-context approaches. The system replaces its prior two-pass ADD, UPDATE, and DELETE extraction process with single-pass, ADD-only extraction, preserving historical facts and changes over time rather than overwriting earlier information, while also storing agent-generated statements as memory. Its retrieval architecture combines semantic, keyword, and entity matching, including entity linking and verb-form normalization, to support different query types. In reported evaluations, the new algorithm improved scores on LoCoMo from 71.4 to 92.5 and on LongMemEval from 67.8 to 94.4, with particularly large gains in temporal, multi-hop, and assistant-generated memory recall; it also scored 64.1 at 1 million tokens and 48.6 at 10 million tokens on BEAM. The company notes that results on its managed platform include proprietary optimizations and that difficult large-scale tasks such as temporal reasoning, event ordering, contradiction resolution, and multi-session reasoning remain limitations, with future work focused on richer representations of time and cross-session event relationships.
| Trend | Post Mentions | Total Month Mentions | Posts | Companies | MoM |
|---|---|---|---|---|---|
| AI Agents | 2 | 5,835 | 1,407 | 272 | -21% |
| LLM | 2 | 6,889 | 1,263 | 265 | -9% |
| Loop engineering | 1 | 53 | 37 | 25 | +20% |
Use this post, company, and trend context to find content marketing opportunities, perform competitive analysis, or address product feature gaps via the Plushcap MCP server or the Plushcap API.