--- name: memory-systems-4652a9967c2d description: "Design short-term, long-term, and graph-based memory architectures" risk: safe source: "https://github.com/muratcankoylan/Agent-Skills-for-Context-Engineering/tree/main/skills/memory-systems" date_added: "2026-02-27" --- ## When to Use This Skill Design short-term, long-term, and graph-based memory architectures Use this skill when working with design short-term, long-term, and graph-based memory architectures. # Memory System Design Memory provides the persistence layer that allows agents to maintain continuity across sessions and reason over accumulated knowledge. Simple agents rely entirely on context for memory, losing all state when sessions end. Sophisticated agents implement layered memory architectures that balance immediate context needs with long-term knowledge retention. The evolution from vector stores to knowledge graphs to temporal knowledge graphs represents increasing investment in structured memory for improved retrieval and reasoning. ## When to Activate Activate this skill when: - Building agents that must persist across sessions - Needing to maintain entity consistency across conversations - Implementing reasoning over accumulated knowledge - Designing systems that learn from past interactions - Creating knowledge bases that grow over time - Building temporal-aware systems that track state changes ## Core Concepts Memory exists on a spectrum from immediate context to permanent storage. At one extreme, working memory in the context window provides zero-latency access but vanishes when sessions end. At the other extreme, permanent storage persists indefinitely but requires retrieval to enter context. Simple vector stores lack relationship and temporal structure. Knowledge graphs preserve relationships for reasoning. Temporal knowledge graphs add validity periods for time-aware queries. Implementation choices depend on query complexity, infrastructure constraints, and accuracy requirements. ## Detailed Topics ### Memory Architecture Fundamentals **The Context-Memory Spectrum** Memory exists on a spectrum from immediate context to permanent storage. At one extreme, working memory in the context window provides zero-latency access but vanishes when sessions end. At the other extreme, permanent storage persists indefinitely but requires retrieval to enter context. Effective architectures use multiple layers along this spectrum. The spectrum includes working memory (context window, zero latency, volatile), short-term memory (session-persistent, searchable, volatile), long-term memory (cross-session persistent, structured, semi-permanent), and permanent memory (archival, queryable, permanent). Each layer has different latency, capacity, and persistence characteristics. **Why Simple Vector Stores Fall Short** Vector RAG provides semantic retrieval by embedding queries and documents in a shared embedding space. Similarity search retrieves the most semantically similar documents. This works well for document retrieval but lacks structure for agent memory. Vector stores lose relationship information. If an agent learns that "Customer X purchased Product Y on Date Z," a vector store can retrieve this fact if asked directly. But it cannot answer "What products did customers who purchased Product Y also buy?" because relationship structure is not preserved. Vector stores also struggle with temporal validity. Facts change over time, but vector stores provide no mechanism to distinguish "current fact" from "outdated fact" except through explicit metadata and filtering. **The Move to Graph-Based Memory** Knowledge graphs preserve relationships between entities. Instead of isolated document chunks, graphs encode that Entity A has Relationship R to Entity B. This enables queries that traverse relationships rather than just similarity. Temporal knowledge graphs add validity periods to facts. Each fact has a "valid from" and optionally "valid until" timestamp. This enables time-travel queries that reconstruct knowledge at specific points in time. **Benchmark Performance Comparison** The Deep Memory Retrieval (DMR) benchmark provides concrete performance data across memory architectures: | Memory System | DMR Accuracy | Retrieval Latency | Notes | |---------------|--------------|-------------------|-------| | Zep (Temporal KG) | 94.8% | 2.58s | Best accuracy, fast retrieval | | MemGPT | 93.4% | Variable | Good general performance | | GraphRAG | ~75-85% | Variable | 20-35% gains over baseline RAG | | Vector RAG | ~60-70% | Fast | Loses relationship structure | | Recursive Summarization | 35.3% | Low | Severe information loss | Zep demonstrated 90% reduction in retrieval latency compared to full-context baselines (2.58s vs 28.9s for GPT-5.2). This efficiency comes from retrieving only relevant subgraphs rather than entire context history. GraphRAG achieves approximately 20-35% accuracy gains over baseline RAG in complex reasoning tasks and reduces hallucination by up to 30% through community-based summarization. ### Memory Layer Architecture **Layer 1: Working Memory** Working memory is the context window itself. It provides immediate access to information currently being processed but has limited capacity and vanishes when sessions end. Working memory usage patterns include scratchpad calculations where agents track intermediate results, conversation history that preserves dialogue for current task, current task state that tracks progress on active objectives, and active retrieved documents that hold information currently being used. Optimize working memory by keeping only active information, summarizing completed work before it falls out of attention, and using attention-favored positions for critical information. **Layer 2: Short-Term Memory** Short-term memory persists across the current session but not across sessions. It provides search and retrieval capabilities without the latency of permanent storage. Common implementations include session-scoped databases that persist until session end, file-system storage in designated session directories, and in-memory caches keyed by session ID. Short-term memory use cases include tracking conversation state across turns without stuffing context, storing intermediate results from tool calls that may be needed later, maintaining task checklists and progress tracking, and caching retrieved information within sessions. **Layer 3: Long-Term Memory** Long-term memory persists across sessions indefinitely. It enables agents to learn from past interactions and build knowledge over time. Long-term memory implementations range from simple key-value stores to sophisticated graph databases. The choice depends on complexity of relationships to model, query patterns required, and acceptable infrastructure complexity. Long-term memory use cases include learning user preferences across sessions, building domain knowledge bases that grow over time, maintaining entity registries with relationship history, and storing successful patterns that can be reused. **Layer 4: Entity Memory** Entity memory specifically tracks information about entities (people, places, concepts, objects) to maintain consistency. This creates a rudimentary knowledge graph where entities are recognized across multiple interactions. Entity memory maintains entity identity by tracking that "John Doe" mentioned in one conversation is the same person in another. It maintains entity properties by storing facts discovered about entities over time. It maintains entity relationships by tracking relationships between entities as they are discovered. **Layer 5: Temporal Knowledge Graphs** Temporal knowledge graphs extend entity memory with explicit validity periods. Facts are not just true or false but true during specific time ranges. This enables queries like "What was the user's address on Date X?" by retrieving facts valid during that date range. It prevents context clash when outdated information contradicts new data. It enables temporal reasoning about how entities changed over time. ### Memory Implementation Patterns **Pattern 1: File-System-as-Memory** The file system itself can serve as a memory layer. This pattern is simple, requires no additional infrastructure, and enables the same just-in-time loading that makes file-system-based context effective. Implementation uses the file system hierarchy for organization. Use naming conventions that convey meaning. Store facts in structured formats (JSON, YAML). Use timestamps in filenames or metadata for temporal tracking. Advantages: Simplicity, transparency, portability. Disadvantages: No semantic search, no relationship tracking, manual organization required. **Pattern 2: Vector RAG with Metadata** Vector stores enhanced with rich metadata provide semantic search with filtering capabilities. Implementation embeds facts or documents and stores with metadata including entity tags, temporal validity, source attribution, and confidence scores. Query includes metadata filters alongside semantic search. **Pattern 3: Knowledge Graph** Knowledge graphs explicitly model entities and relationships. Implementation defines entity types and relationship types, uses graph database or property graph storage, and maintains indexes for common query patterns. **Pattern 4: Temporal Knowledge Graph** Temporal knowledge graphs add validity periods to facts, enabling time-travel queries and preventing context clash from outdated information. ### Memory Retrieval Patterns **Semantic Retrieval** Retrieve memories semantically similar to current query using embedding similarity search. **Entity-Based Retrieval** Retrieve all memories related to specific entities by traversing graph relationships. **Temporal Retrieval** Retrieve memories valid at specific time or within time range using validity period filters. ### Memory Consolidation Memories accumulate over time and require consolidation to prevent unbounded growth and remove outdated information. **Consolidation Triggers** Trigger consolidation after significant memory accumulation, when retrieval returns too many outdated results, periodically on a schedule, or when explicit consolidation is requested. **Consolidation Process** Identify outdated facts, merge related facts, update validity periods, archive or delete obsolete facts, and rebuild indexes. ## Practical Guidance ### Integration with Context Memories must integrate with context systems to be useful. Use just-in-time memory loading to retrieve relevant memories when needed. Use strategic injection to place memories in attention-favored positions. ### Memory System Selection Choose memory architecture based on requirements: - Simple persistence needs: File-system memory - Semantic search needs: Vector RAG with metadata - Relationship reasoning needs: Knowledge graph - Temporal validity needs: Temporal knowledge graph ## Examples **Example 1: Entity Tracking** ```python # Track entity across conversations def remember_entity(entity_id, properties): memory.store({ "type": "entity", "id": entity_id, "properties": properties, "last_updated": now() }) def get_entity(entity_id): return memory.retrieve_entity(entity_id) ``` **Example 2: Temporal Query** ```python # What was the user's address on January 15, 2024? def query_address_at_time(user_id, query_time): return temporal_graph.query(""" MATCH (user)-[r:LIVES_AT]->(address) WHERE user.id = $user_id AND r.valid_from <= $query_time AND (r.valid_until IS NULL OR r.valid_until > $query_time) RETURN address """, {"user_id": user_id, "query_time": query_time}) ``` ## Guidelines 1. Match memory architecture to query requirements 2. Implement progressive disclosure for memory access 3. Use temporal validity to prevent outdated information conflicts 4. Consolidate memories periodically to prevent unbounded growth 5. Design for memory retrieval failures gracefully 6. Consider privacy implications of persistent memory 7. Implement backup and recovery for critical memories 8. Monitor memory growth and performance over time ## Integration This skill builds on context-fundamentals. It connects to: - multi-agent-patterns - Shared memory across agents - context-optimization - Memory-based context loading - evaluation - Evaluating memory quality ## References Internal reference: - Implementation Reference - Detailed implementation patterns Related skills in this collection: - context-fundamentals - Context basics - multi-agent-patterns - Cross-agent memory External resources: - Graph database documentation (Neo4j, etc.) - Vector store documentation (Pinecone, Weaviate, etc.) - Research on knowledge graphs and reasoning --- ## Skill Metadata **Created**: 2025-12-20 **Last Updated**: 2025-12-20 **Author**: Agent Skills for Context Engineering Contributors **Version**: 1.0.0 --- ## AGI Framework Integration > **Adapted for [@techwavedev/agi-agent-kit](https://www.npmjs.com/package/@techwavedev/agi-agent-kit)** > Original source: [antigravity-awesome-skills](https://github.com/sickn33/antigravity-awesome-skills) ### Memory-First Protocol Retrieve prior agent configurations, team compositions, and orchestration patterns. Critical for multi-agent system consistency. ```bash # Check for prior AI agent orchestration context before starting python3 execution/memory_manager.py auto --query "agent patterns and orchestration strategies for Memory Systems" ``` ### Storing Results After completing work, store AI agent orchestration decisions for future sessions: ```bash python3 execution/memory_manager.py store \ --content "Agent pattern: hierarchical orchestration with Control Tower dispatcher, 3 specialist sub-agents" \ --type decision --project \ --tags memory-systems ai-agents ``` ### Multi-Agent Collaboration This skill is inherently multi-agent. Use cross-agent context to coordinate task distribution and avoid duplicate work. ```bash python3 execution/cross_agent_context.py store \ --agent "" \ --action "Agent architecture designed — Control Tower + specialist agents with shared Qdrant memory" \ --project ``` ### Control Tower Integration Register agents and tasks with the Control Tower (`execution/control_tower.py`) for centralized orchestration across machines and LLM providers. ### Blockchain Identity Each agent has a cryptographic Ed25519 identity. All memory writes are signed — enabling trust verification in multi-agent systems. --- Source attribution: techwavedev Original project: https://github.com/techwavedev/agi-agent-kit/blob/58f5d95434a1adc8b41a4f391d32d95311e54936/templates/skills/extended/ai-agents/memory-systems/SKILL.md License: Apache-2.0 License information: https://www.apache.org/licenses/LICENSE-2.0 Original upstream instructions; downloaded from Mega AI Hub. ## Upstream license notice Apache License Version 2.0, January 2004 http://www.apache.org/licenses/ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 1. Definitions. "License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document. "Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License. "Legal Entity" shall mean the union of the acting entity and all other entities that control, are controlled by, or are under common control with that entity. For the purposes of this definition, "control" means (i) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the outstanding shares, or (iii) beneficial ownership of such entity. "You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License. "Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files. "Object" form shall mean any form resulting from mechanical transformation or translation of a Source form, including but not limited to compiled object code, generated documentation, and conversions to other media types. "Work" shall mean the work of authorship, whether in Source or Object form, made available under the License, as indicated by a copyright notice that is included in or attached to the work (an example is provided in the Appendix below). "Derivative Works" shall mean any work, whether in Source or Object form, that is based on (or derived from) the Work and for which the editorial revisions, annotations, elaborations, or other modifications represent, as a whole, an original work of authorship. For the purposes of this License, Derivative Works shall not include works that remain separable from, or merely link (or bind by name) to the interfaces of, the Work and Derivative Works thereof. "Contribution" shall mean any work of authorship, including the original version of the Work and any modifications or additions to that Work or Derivative Works thereof, that is intentionally submitted to the Licensor for inclusion in the Work by the copyright owner or by an individual or Legal Entity authorized to submit on behalf of the copyright owner. For the purposes of this definition, "submitted" means any form of electronic, verbal, or written communication sent to the Licensor or its representatives, including but not limited to communication on electronic mailing lists, source code control systems, and issue tracking systems that are managed by, or on behalf of, the Licensor for the purpose of discussing and improving the Work, but excluding communication that is conspicuously marked or otherwise designated in writing by the copyright owner as "Not a Contribution." "Contributor" shall mean Licensor and any individual or Legal Entity on behalf of whom a Contribution has been received by Licensor and subsequently incorporated within the Work. 2. Grant of Copyright License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable copyright license to reproduce, prepare Derivative Works of, publicly display, publicly perform, sublicense, and distribute the Work and such Derivative Works in Source or Object form. 3. Grant of Patent License. Subject to the terms and conditions of this License, each Contributor hereby grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this section) patent license to make, have made, use, offer to sell, sell, import, and otherwise transfer the Work, where such license applies only to those patent claims licensable by such Contributor that are necessarily infringed by their Contribution(s) alone or by combination of their Contribution(s) with the Work to which such Contribution(s) was submitted. If You institute patent litigation against any entity (including a cross-claim or counterclaim in a lawsuit) alleging that the Work or a Contribution incorporated within the Work constitutes direct or contributory patent infringement, then any patent licenses granted to You under this License for that Work shall terminate as of the date such litigation is filed. 4. Redistribution. You may reproduce and distribute copies of the Work or Derivative Works thereof in any medium, with or without modifications, and in Source or Object form, provided that You meet the following conditions: (a) You must give any other recipients of the Work or Derivative Works a copy of this License; and (b) You must cause any modified files to carry prominent notices stating that You changed the files; and (c) You must retain, in the Source form of any Derivative Works that You distribute, all copyright, patent, trademark, and attribution notices from the Source form of the Work, excluding those notices that do not pertain to any part of the Derivative Works; and (d) If the Work includes a "NOTICE" text file as part of its distribution, then any Derivative Works that You distribute must include a readable copy of the attribution notices contained within such NOTICE file, excluding those notices that do not pertain to any part of the Derivative Works, in at least one of the following places: within a NOTICE text file distributed as part of the Derivative Works; within the Source form or documentation, if provided along with the Derivative Works; or, within a display generated by the Derivative Works, if and wherever such third-party notices normally appear. The contents of the NOTICE file are for informational purposes only and do not modify the License. You may add Your own attribution notices within Derivative Works that You distribute, alongside or as an addendum to the NOTICE text from the Work, provided that such additional attribution notices cannot be construed as modifying the License. You may add Your own copyright statement to Your modifications and may provide additional or different license terms and conditions for use, reproduction, or distribution of Your modifications, or for any such Derivative Works as a whole, provided Your use, reproduction, and distribution of the Work otherwise complies with the conditions stated in this License. 5. Submission of Contributions. Unless You explicitly state otherwise, any Contribution intentionally submitted for inclusion in the Work by You to the Licensor shall be under the terms and conditions of this License, without any additional terms or conditions. Notwithstanding the above, nothing herein shall supersede or modify the terms of any separate license agreement you may have executed with Licensor regarding such Contributions. 6. Trademarks. This License does not grant permission to use the trade names, trademarks, service marks, or product names of the Licensor, except as required for reasonable and customary use in describing the origin of the Work and reproducing the content of the NOTICE file. 7. Disclaimer of Warranty. Unless required by applicable law or agreed to in writing, Licensor provides the Work (and each Contributor provides its Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied, including, without limitation, any warranties or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are solely responsible for determining the appropriateness of using or redistributing the Work and assume any risks associated with Your exercise of permissions under this License. 8. Limitation of Liability. In no event and under no legal theory, whether in tort (including negligence), contract, or otherwise, unless required by applicable law (such as deliberate and grossly negligent acts) or agreed to in writing, shall any Contributor be liable to You for damages, including any direct, indirect, special, incidental, or consequential damages of any character arising as a result of this License or out of the use or inability to use the Work (including but not limited to damages for loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses), even if such Contributor has been advised of the possibility of such damages. 9. Accepting Warranty or Additional Liability. While redistributing the Work or Derivative Works thereof, You may choose to offer, and charge a fee for, acceptance of support, warranty, indemnity, or other liability obligations and/or rights consistent with this License. However, in accepting such obligations, You may act only on Your own behalf and on Your sole responsibility, not on behalf of any other Contributor, and only if You agree to indemnify, defend, and hold each Contributor harmless for any liability incurred by, or claims asserted against, such Contributor by reason of your accepting any such warranty or additional liability. END OF TERMS AND CONDITIONS APPENDIX: How to apply the Apache License to your work. To apply the Apache License to your work, attach the following boilerplate notice, with the fields enclosed by brackets "[]" replaced with your own identifying information. (Don't include the brackets!) The text should be enclosed in the appropriate comment syntax for the file format. We also recommend that a file or class name and description of purpose be included on the same "printed page" as the copyright notice for easier identification within third-party archives. Copyright 2024-2026 Elton Machado (TechWaveDev) Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. # Mega AI Hub resource metadata Creator / publisher: techwavedev Original project: https://github.com/techwavedev/agi-agent-kit/blob/58f5d95434a1adc8b41a4f391d32d95311e54936/templates/skills/extended/ai-agents/memory-systems/SKILL.md Attribution basis: Source repository record Fields of work: Data & Analytics, Development & Engineering, Product Management Roles: Data Scientist, ML / AI Engineer, Product Manager Specialties: Backend, Database, Design, Word Documents, Frontend, Git Tools: Github Country applicability: Country not specified Classification basis: Source catalog labels Instruction SHA-256: 9fbed03f7f69d76f3b8cf06ca01a8569e6f7fe28f0d7c97b42f54d1108e91a98