# Zero-Mem: Zero-Token Memory Operations for LLM Agents > Source: > Published: 2026-08-05 04:36:44+00:00 # Computer Science > Computation and Language [Submitted on 31 Jul 2026] # Title:Zero-Mem: Zero-Token Memory Operations for LLM Agents [View PDF](/pdf/2607.29377) [HTML (experimental)](https://arxiv.org/html/2607.29377v1) Abstract:LLM agents need memory to act consistently over long interactions, yet many systems use additional LLM calls to operate that memory. Generating intermediate records and mediating their retrieval adds recurring token and time costs, while omitted or merged details can obscure the original evidence. We ask whether structured memory access requires generation at all. Zero-Mem introduces \emph{zero-token memory operations}: no step outside final question answering invokes an LLM or consumes LLM input or output tokens; encoder computation is accounted for separately. Zero-Mem preserves original interaction traces as its source of record. It organizes the traces in two complementary ways. An entity--context graph exposes connections across interactions, while a temporal hierarchy preserves conversational locality and session state. For each query, Zero-Mem weighs the two views, retrieves from both, and follows their structure to recover supporting relations or surrounding context. Deterministic calibration first discards conflicting evidence and then keeps the reader's answer grounded in the retrieved traces. Only the final-QA reader invokes an LLM. Across long-memory and long-context question-answering benchmarks, Zero-Mem achieves competitive performance while eliminating LLM calls and LLM-token consumption from memory operations. With the same final-QA reader and context budget, it reduces memory-operation time cost by 57.6\% relative to the fastest compared baseline. Ablations support the contribution of the two views and their query-dependent coordination. Overall, the results show that structured agent memory need not generate an intermediate representation of the past. After peer review, the code and implementation details will be available at \textcolor{blue}{[this https URL]}. ### References & Citations Loading... # Bibliographic and Citation Tools Bibliographic Explorer *(*[What is the Explorer?](https://info.arxiv.org/labs/showcase.html#arxiv-bibliographic-explorer)) Connected Papers *(*[What is Connected Papers?](https://www.connectedpapers.com/about)) Litmaps *(*[What is Litmaps?](https://www.litmaps.co/)) scite Smart Citations *(*[What are Smart Citations?](https://www.scite.ai/))# Code, Data and Media Associated with this Article alphaXiv *(*[What is alphaXiv?](https://alphaxiv.org/)) CatalyzeX Code Finder for Papers *(*[What is CatalyzeX?](https://www.catalyzex.com)) DagsHub *(*[What is DagsHub?](https://dagshub.com/)) Gotit.pub *(*[What is GotitPub?](http://gotit.pub/faq)) Hugging Face *(*[What is Huggingface?](https://huggingface.co/huggingface)) ScienceCast *(*[What is ScienceCast?](https://sciencecast.org/welcome))# Demos # Recommenders and Search Tools Influence Flower *(*[What are Influence Flowers?](https://influencemap.cmlab.dev/)) CORE Recommender *(*[What is CORE?](https://core.ac.uk/services/recommender))# arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? [ Learn more about arXivLabs](https://info.arxiv.org/labs/index.html).