Skip to content

Latest commit

 

History

History
57 lines (34 loc) · 3.95 KB

File metadata and controls

57 lines (34 loc) · 3.95 KB

Mnemon — Design & Architecture

Mnemon (/ˈniːmɒn/), from Ancient Greek μνήμων (mnemon), formed by μνάομαι ("to remember") and the agent suffix -μων, meaning "one who remembers, a person of good memory." Homer uses "καὶ γὰρ μνήμων εἰμί" ("I remember it well") in the Odyssey to describe this quality. In the city-states of Ancient Greece, Mnemones were officials dedicated to record-keeping, serving as witnesses and archivists in property transactions and legal proceedings — institutional memory carriers during the transition from oral tradition to written records.

The word shares its root with Mnemosyne (Μνημοσύνη), the goddess of memory — from her union with Zeus the nine Muses were born, symbolizing memory as the wellspring of all knowledge and creativity.

Mnemon is a persistent memory system designed for LLM agents. It adopts the LLM-Supervised pattern: the host LLM acts as external orchestrator of a standalone memory binary through symbolic CLI interfaces, while the binary handles deterministic storage, graph indexing, and lifecycle management. Memory is organized as a four-graph knowledge structure with temporal, entity, causal, and semantic edges. The mnemon memory engine remains one Go binary + SQLite, with no external API dependencies.

This document describes the Memory engine. The same mnemon executable also provides Mnemon Agency, an optional local authority for durable Agent work and peer collaboration. Memory and Agency keep separate state and authority even though they share one executable.


Table of Contents

Why Mnemon exists — the amnesia problem in LLM agents, structural bottlenecks of traditional approaches, and a comparison with existing solutions (Mem0, MemGPT, Claude Code Memory).

The current engine's LLM-Supervised pattern, Hook-native / LLM-led / Protocol-constrained principle, Organs vs Textbooks metaphor, Memory Gateway protocol (the MCP analogy for LLM↔DB interaction), key design insights, and theoretical foundations from RLM, MAGMA, and Graph-LLM structural analysis.

The Insight/Edge data model, database schema (SQLite WAL), single-executable Memory/Agency boundary, current package structure, and Memory isolation through named stores.

MAGMA four-graph model (temporal, entity, causal, semantic), structural isomorphism between LLM attention and graph storage, the Extract→Candidate→Associate paradigm, read-write symmetry, remember/link/recall as universal algebra, the LLM↔DB protocol gap, and academic positioning.

The write pipeline (remember with built-in diff), read pipeline (Smart Recall with intent detection, RRF anchor fusion, Beam Search traversal, multi-factor re-ranking), and deduplication/conflict detection.

Effective Importance (EI) decay formula, immunity rules, auto-pruning, GC commands, and optional embedding support via Ollama (nomic-embed-text).

Runtime-native integration through runtime-specific SKILL.md, a shared guide.md, supported hooks or extensions, agent-led memory decisions, setup automation, and lightweight reviewed markdown evolution.

How to add durable work, receipts, and optional peer collaboration to an existing Agent Runtime, including its current maturity and compatibility boundary.

Key trade-offs (LLM-Supervised vs embedded, SQLite WAL vs graph DB, Beam Search vs BFS, soft delete), deviations from the MAGMA paper, storage-side pluggability roadmap, and the vision toward a memory gateway.