MemoryOS – AI agent memory with temporal knowledge graph and 9ms ingest and 78ms retrieval
Summary
MemoryOS is an open-source, self-hosted AI agent memory tool using a temporal knowledge graph, achieving 86.2% accuracy on LongMemEval-s with fast 78ms retrieval speeds.
Similar Articles
MindMemOS: A Portable and Self-Evolving Memory Operating Layer for AI Agents
The article introduces MindMemOS, a portable and self-evolving memory operating layer for AI agents that uses a unified entity-property-time structure, with algorithms for memory refinement and skill evolution. It achieves notable accuracy on LOCOMO and PersonaMem benchmarks and improves SpreadsheetBench performance by 9.2 percentage points.
@DanKornas: An agent that forgets previous interactions has to rebuild context on every task. MemOS is a memory operating system fo…
MemOS is an open-source memory operating system for developers building LLM applications and AI agents, providing persistent, editable memory through a unified API with features like multimodal memory and async ingestion.
rohitg00/agentmemory
agentmemory is an open-source persistent memory layer for AI coding agents (Claude Code, Cursor, Gemini CLI, Codex CLI, etc.) that uses knowledge graphs, confidence scoring, and hybrid search to give agents long-term memory across sessions via MCP, hooks, or REST API. Built on the iii engine, it requires no external databases and exposes 51 MCP tools.
TRACE: open-source hierarchical memory for LLM agents, 82.5% on MemoryAgentBench’s EventQA using gpt-oss-20B [P]
TRACE is an open-source hierarchical memory system for LLM agents that organizes conversation history into a topic tree, achieving 82.5% F1 on MemoryAgentBench's EventQA using an open-weight model, outperforming Mem0 and MemGPT.
An open source natural temporal memory for claude code, hermes and openclaw agent
agentmemory is an open-source library that provides natural temporal memory for AI agents like Claude Code, Hermes, and OpenClaw. It uses a three-tier architecture with hybrid retrieval (BM25, vector, knowledge graph) and Ebbinghaus decay, achieving ~92% fewer tokens and 200x more tool calls before context limits.