@coreidentitylabs/open-graph-memory-mcp 1.0.1

package/dist/encoding/embedder.js

@@ -0,0 +1,85 @@
+// =============================================================================
+// Embedding Service — Lightweight text-to-vector without external dependencies
+// =============================================================================
+// Uses character n-gram hashing for offline, zero-dependency embeddings.
+// If an LLM provider is configured, it can be used for higher-quality embeddings.
+// =============================================================================
+const EMBEDDING_DIM = 256;
+/**
+ * Generate a lightweight embedding from text using character n-gram hashing.
+ * This is a simple, deterministic approach that works offline without any API.
+ * Quality is lower than neural embeddings but sufficient for basic similarity.
+ */
+export function generateLocalEmbedding(text) {
+    const normalized = text.toLowerCase().trim();
+    const vector = new Float64Array(EMBEDDING_DIM).fill(0);
+    // Character trigram hashing
+    for (let i = 0; i < normalized.length - 2; i++) {
+        const trigram = normalized.substring(i, i + 3);
+        const hash = hashString(trigram);
+        const index = Math.abs(hash) % EMBEDDING_DIM;
+        // Random-ish sign based on hash
+        const sign = hash > 0 ? 1 : -1;
+        vector[index] += sign;
+    }
+    // Word-level hashing for broader semantic signals
+    const words = normalized.split(/\s+/).filter((w) => w.length > 0);
+    for (const word of words) {
+        const hash = hashString(word);
+        const index = Math.abs(hash) % EMBEDDING_DIM;
+        vector[index] += hash > 0 ? 0.5 : -0.5;
+    }
+    // Word bigram hashing for phrase-level patterns
+    for (let i = 0; i < words.length - 1; i++) {
+        const bigram = `${words[i]} ${words[i + 1]}`;
+        const hash = hashString(bigram);
+        const index = Math.abs(hash) % EMBEDDING_DIM;
+        vector[index] += hash > 0 ? 0.3 : -0.3;
+    }
+    // L2 normalize
+    return l2Normalize(Array.from(vector));
+}
+/**
+ * Compute cosine similarity between two vectors.
+ * Returns a value between -1 and 1 (1 = identical, 0 = orthogonal).
+ */
+export function cosineSimilarity(a, b) {
+    if (a.length !== b.length || a.length === 0)
+        return 0;
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+    if (denominator === 0)
+        return 0;
+    return dotProduct / denominator;
+}
+/**
+ * L2 normalize a vector (unit length).
+ */
+function l2Normalize(vector) {
+    let norm = 0;
+    for (const v of vector)
+        norm += v * v;
+    norm = Math.sqrt(norm);
+    if (norm === 0)
+        return vector;
+    return vector.map((v) => v / norm);
+}
+/**
+ * Simple deterministic string hash (djb2 variant).
+ */
+function hashString(str) {
+    let hash = 5381;
+    for (let i = 0; i < str.length; i++) {
+        // hash * 33 + char
+        hash = ((hash << 5) + hash + str.charCodeAt(i)) | 0;
+    }
+    return hash;
+}
+//# sourceMappingURL=embedder.js.map

package/dist/encoding/embedder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embedder.js","sourceRoot":"","sources":["../../src/encoding/embedder.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,+EAA+E;AAC/E,gFAAgF;AAChF,yEAAyE;AACzE,kFAAkF;AAClF,gFAAgF;AAEhF,MAAM,aAAa,GAAG,GAAG,CAAC;AAE1B;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,IAAY;IACjD,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IAC7C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAEvD,4BAA4B;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,MAAM,OAAO,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC;QAC7C,gCAAgC;QAChC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC;IACxB,CAAC;IAED,kDAAkD;IAClD,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC;QAC7C,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IACzC,CAAC;IAED,gDAAgD;IAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,aAAa,CAAC;QAC7C,MAAM,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IACzC,CAAC;IAED,eAAe;IACf,OAAO,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,CAAW,EAAE,CAAW;IACvD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtD,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,IAAI,WAAW,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEhC,OAAO,UAAU,GAAG,WAAW,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAAC,MAAgB;IACnC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IACtC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvB,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC;IAC9B,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,SAAS,UAAU,CAAC,GAAW;IAC7B,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,mBAAmB;QACnB,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/encoding/pipeline.d.ts

@@ -0,0 +1,28 @@
+import type { StorageBackend, LLMProvider } from "../types.js";
+export interface EncodingResult {
+    entitiesCreated: number;
+    entitiesUpdated: number;
+    relationsCreated: number;
+    details: {
+        entities: {
+            id: string;
+            name: string;
+            status: string;
+        }[];
+        relations: {
+            source: string;
+            target: string;
+            relation: string;
+            status: string;
+        }[];
+    };
+}
+/**
+ * Full server-side encoding pipeline:
+ * 1. Extract entities + relations from text using LLM
+ * 2. Resolve entities against existing graph (avoid duplicates)
+ * 3. Generate embeddings (LLM embeddings if available, local fallback)
+ * 4. Store nodes and edges
+ */
+export declare function encodeText(text: string, store: StorageBackend, llm: LLMProvider): Promise<EncodingResult>;
+//# sourceMappingURL=pipeline.d.ts.map

package/dist/encoding/pipeline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline.d.ts","sourceRoot":"","sources":["../../src/encoding/pipeline.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EACV,cAAc,EACd,WAAW,EAKZ,MAAM,aAAa,CAAC;AAGrB,MAAM,WAAW,cAAc;IAC7B,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,gBAAgB,EAAE,MAAM,CAAC;IACzB,OAAO,EAAE;QACP,QAAQ,EAAE;YAAE,EAAE,EAAE,MAAM,CAAC;YAAC,IAAI,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,EAAE,CAAC;QACzD,SAAS,EAAE;YACT,MAAM,EAAE,MAAM,CAAC;YACf,MAAM,EAAE,MAAM,CAAC;YACf,QAAQ,EAAE,MAAM,CAAC;YACjB,MAAM,EAAE,MAAM,CAAC;SAChB,EAAE,CAAC;KACL,CAAC;CACH;AAED;;;;;;GAMG;AACH,wBAAsB,UAAU,CAC9B,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,cAAc,EACrB,GAAG,EAAE,WAAW,GACf,OAAO,CAAC,cAAc,CAAC,CAwJzB"}

package/dist/encoding/pipeline.js

@@ -0,0 +1,146 @@
+// =============================================================================
+// Encoding Pipeline — Server-Side Entity Extraction + Storage
+// =============================================================================
+// Orchestrates: LLM extraction → entity resolution → embedding → storage
+// Only available when LLM_API_KEY is configured.
+// =============================================================================
+import { v4 as uuidv4 } from "uuid";
+import { generateLocalEmbedding } from "./embedder.js";
+/**
+ * Full server-side encoding pipeline:
+ * 1. Extract entities + relations from text using LLM
+ * 2. Resolve entities against existing graph (avoid duplicates)
+ * 3. Generate embeddings (LLM embeddings if available, local fallback)
+ * 4. Store nodes and edges
+ */
+export async function encodeText(text, store, llm) {
+    const result = {
+        entitiesCreated: 0,
+        entitiesUpdated: 0,
+        relationsCreated: 0,
+        details: { entities: [], relations: [] },
+    };
+    // Step 1: Get existing entity names for resolution
+    const { nodes: existingNodes } = await store.getAllNodes(10000, 0);
+    const existingNames = existingNodes.map((n) => n.name);
+    // Step 2: Extract entities and relations via LLM
+    let extraction;
+    try {
+        extraction = await llm.extractEntitiesAndRelations(text, existingNames);
+    }
+    catch (error) {
+        console.error("[open-memory] LLM extraction failed:", error);
+        throw new Error(`LLM extraction failed: ${error instanceof Error ? error.message : String(error)}`);
+    }
+    if (extraction.entities.length === 0 && extraction.relations.length === 0) {
+        return result;
+    }
+    // Step 3: Store entities (with resolution)
+    const entityNameToId = new Map();
+    // Pre-populate with existing entities
+    for (const node of existingNodes) {
+        entityNameToId.set(node.name.toLowerCase(), node.id);
+    }
+    for (const entity of extraction.entities) {
+        const nameLower = entity.name.toLowerCase();
+        const existingNode = await store.getNodeByName(entity.name);
+        // Generate embedding — try LLM first, fall back to local
+        let embedding;
+        try {
+            embedding = await llm.generateEmbedding(`${entity.name}: ${entity.description}`);
+        }
+        catch {
+            embedding = generateLocalEmbedding(`${entity.name} ${entity.description}`);
+        }
+        if (existingNode) {
+            // Update existing entity with richer description
+            const mergedDescription = existingNode.description.length >= entity.description.length
+                ? existingNode.description
+                : entity.description;
+            await store.updateNode(existingNode.id, {
+                description: mergedDescription,
+                embedding,
+                metadata: { ...existingNode.metadata, ...entity.metadata },
+            });
+            entityNameToId.set(nameLower, existingNode.id);
+            result.entitiesUpdated++;
+            result.details.entities.push({
+                id: existingNode.id,
+                name: entity.name,
+                status: "updated",
+            });
+        }
+        else {
+            // Create new entity
+            const now = new Date().toISOString();
+            const node = {
+                id: uuidv4(),
+                name: entity.name,
+                type: entity.type,
+                description: entity.description,
+                embedding,
+                metadata: entity.metadata ?? {},
+                createdAt: now,
+                updatedAt: now,
+                source: "llm_extraction",
+                accessCount: 0,
+            };
+            await store.addNode(node);
+            entityNameToId.set(nameLower, node.id);
+            result.entitiesCreated++;
+            result.details.entities.push({
+                id: node.id,
+                name: entity.name,
+                status: "created",
+            });
+        }
+    }
+    // Step 4: Store relations
+    for (const rel of extraction.relations) {
+        const sourceId = entityNameToId.get(rel.source.toLowerCase()) ?? null;
+        const targetId = entityNameToId.get(rel.target.toLowerCase()) ?? null;
+        if (!sourceId || !targetId) {
+            result.details.relations.push({
+                source: rel.source,
+                target: rel.target,
+                relation: rel.relation,
+                status: `skipped: ${!sourceId ? `source '${rel.source}' not found` : `target '${rel.target}' not found`}`,
+            });
+            continue;
+        }
+        // Avoid duplicate edges
+        const existingEdges = await store.getEdgesBetween(sourceId, targetId);
+        const duplicate = existingEdges.find((e) => e.relation === rel.relation);
+        if (duplicate) {
+            result.details.relations.push({
+                source: rel.source,
+                target: rel.target,
+                relation: rel.relation,
+                status: "skipped: duplicate",
+            });
+            continue;
+        }
+        const now = new Date().toISOString();
+        const edge = {
+            id: uuidv4(),
+            source: sourceId,
+            target: targetId,
+            relation: rel.relation,
+            description: rel.description ?? `${rel.source} ${rel.relation} ${rel.target}`,
+            weight: rel.weight ?? 0.8,
+            metadata: {},
+            createdAt: now,
+            updatedAt: now,
+        };
+        await store.addEdge(edge);
+        result.relationsCreated++;
+        result.details.relations.push({
+            source: rel.source,
+            target: rel.target,
+            relation: rel.relation,
+            status: "created",
+        });
+    }
+    return result;
+}
+//# sourceMappingURL=pipeline.js.map

package/dist/encoding/pipeline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pipeline.js","sourceRoot":"","sources":["../../src/encoding/pipeline.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,8DAA8D;AAC9D,gFAAgF;AAChF,yEAAyE;AACzE,iDAAiD;AACjD,gFAAgF;AAEhF,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAC;AASpC,OAAO,EAAE,sBAAsB,EAAE,MAAM,eAAe,CAAC;AAiBvD;;;;;;GAMG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,IAAY,EACZ,KAAqB,EACrB,GAAgB;IAEhB,MAAM,MAAM,GAAmB;QAC7B,eAAe,EAAE,CAAC;QAClB,eAAe,EAAE,CAAC;QAClB,gBAAgB,EAAE,CAAC;QACnB,OAAO,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,EAAE;KACzC,CAAC;IAEF,mDAAmD;IACnD,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACnE,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAEvD,iDAAiD;IACjD,IAAI,UAA4B,CAAC;IACjC,IAAI,CAAC;QACH,UAAU,GAAG,MAAM,GAAG,CAAC,2BAA2B,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;IAC1E,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO,CAAC,KAAK,CAAC,sCAAsC,EAAE,KAAK,CAAC,CAAC;QAC7D,MAAM,IAAI,KAAK,CACb,0BAA0B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CACnF,CAAC;IACJ,CAAC;IAED,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1E,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,2CAA2C;IAC3C,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEjD,sCAAsC;IACtC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,QAAQ,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC;QAC5C,MAAM,YAAY,GAAG,MAAM,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAE5D,yDAAyD;QACzD,IAAI,SAAmB,CAAC;QACxB,IAAI,CAAC;YACH,SAAS,GAAG,MAAM,GAAG,CAAC,iBAAiB,CACrC,GAAG,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,WAAW,EAAE,CACxC,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,SAAS,GAAG,sBAAsB,CAChC,GAAG,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,WAAW,EAAE,CACvC,CAAC;QACJ,CAAC;QAED,IAAI,YAAY,EAAE,CAAC;YACjB,iDAAiD;YACjD,MAAM,iBAAiB,GACrB,YAAY,CAAC,WAAW,CAAC,MAAM,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM;gBAC1D,CAAC,CAAC,YAAY,CAAC,WAAW;gBAC1B,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC;YAEzB,MAAM,KAAK,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,EAAE;gBACtC,WAAW,EAAE,iBAAiB;gBAC9B,SAAS;gBACT,QAAQ,EAAE,EAAE,GAAG,YAAY,CAAC,QAAQ,EAAE,GAAG,MAAM,CAAC,QAAQ,EAAE;aAC3D,CAAC,CAAC;YAEH,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,YAAY,CAAC,EAAE,CAAC,CAAC;YAC/C,MAAM,CAAC,eAAe,EAAE,CAAC;YACzB,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC3B,EAAE,EAAE,YAAY,CAAC,EAAE;gBACnB,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,MAAM,EAAE,SAAS;aAClB,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,oBAAoB;YACpB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YACrC,MAAM,IAAI,GAAe;gBACvB,EAAE,EAAE,MAAM,EAAE;gBACZ,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,IAAI,EAAE,MAAM,CAAC,IAAgB;gBAC7B,WAAW,EAAE,MAAM,CAAC,WAAW;gBAC/B,SAAS;gBACT,QAAQ,EAAE,MAAM,CAAC,QAAQ,IAAI,EAAE;gBAC/B,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;gBACd,MAAM,EAAE,gBAAgB;gBACxB,WAAW,EAAE,CAAC;aACf,CAAC;YAEF,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC1B,cAAc,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YACvC,MAAM,CAAC,eAAe,EAAE,CAAC;YACzB,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAC3B,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,MAAM,CAAC,IAAI;gBACjB,MAAM,EAAE,SAAS;aAClB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,0BAA0B;IAC1B,KAAK,MAAM,GAAG,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,IAAI,IAAI,CAAC;QACtE,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,IAAI,IAAI,CAAC;QAEtE,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC;gBAC5B,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,MAAM,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,MAAM,aAAa,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,MAAM,aAAa,EAAE;aAC1G,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,wBAAwB;QACxB,MAAM,aAAa,GAAG,MAAM,KAAK,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACtE,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEzE,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC;gBAC5B,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,QAAQ,EAAE,GAAG,CAAC,QAAQ;gBACtB,MAAM,EAAE,oBAAoB;aAC7B,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,IAAI,GAAe;YACvB,EAAE,EAAE,MAAM,EAAE;YACZ,MAAM,EAAE,QAAQ;YAChB,MAAM,EAAE,QAAQ;YAChB,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,WAAW,EACT,GAAG,CAAC,WAAW,IAAI,GAAG,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,QAAQ,IAAI,GAAG,CAAC,MAAM,EAAE;YAClE,MAAM,EAAE,GAAG,CAAC,MAAM,IAAI,GAAG;YACzB,QAAQ,EAAE,EAAE;YACZ,SAAS,EAAE,GAAG;YACd,SAAS,EAAE,GAAG;SACf,CAAC;QAEF,MAAM,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC1B,MAAM,CAAC,gBAAgB,EAAE,CAAC;QAC1B,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC;YAC5B,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,MAAM,EAAE,GAAG,CAAC,MAAM;YAClB,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,MAAM,EAAE,SAAS;SAClB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/evolution/consolidator.d.ts

@@ -0,0 +1,12 @@
+import type { StorageBackend, ConsolidationResult, ConsolidationStrategy } from "../types.js";
+/**
+ * Run memory consolidation to keep the graph healthy.
+ *
+ * Strategies:
+ * - full: runs all operations
+ * - merge_only: only merge duplicates
+ * - prune_only: only prune stale nodes
+ * - infer_only: only infer transitive edges
+ */
+export declare function consolidateMemory(store: StorageBackend, strategy?: ConsolidationStrategy): Promise<ConsolidationResult>;
+//# sourceMappingURL=consolidator.d.ts.map

package/dist/evolution/consolidator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator.d.ts","sourceRoot":"","sources":["../../src/evolution/consolidator.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EACV,cAAc,EAGd,mBAAmB,EACnB,qBAAqB,EACtB,MAAM,aAAa,CAAC;AAQrB;;;;;;;;GAQG;AACH,wBAAsB,iBAAiB,CACrC,KAAK,EAAE,cAAc,EACrB,QAAQ,GAAE,qBAA8B,GACvC,OAAO,CAAC,mBAAmB,CAAC,CA0B9B"}

package/dist/evolution/consolidator.js

@@ -0,0 +1,212 @@
+// =============================================================================
+// Memory Evolution Engine — Consolidation, Dedup, Inference, Pruning
+// =============================================================================
+import { cosineSimilarity } from "../encoding/embedder.js";
+import { DUPLICATE_SIMILARITY_THRESHOLD, STALE_NODE_AGE_DAYS, } from "../constants.js";
+/**
+ * Run memory consolidation to keep the graph healthy.
+ *
+ * Strategies:
+ * - full: runs all operations
+ * - merge_only: only merge duplicates
+ * - prune_only: only prune stale nodes
+ * - infer_only: only infer transitive edges
+ */
+export async function consolidateMemory(store, strategy = "full") {
+    const startTime = Date.now();
+    const result = {
+        mergedNodes: 0,
+        resolvedConflicts: 0,
+        inferredEdges: 0,
+        prunedNodes: 0,
+        duration: 0,
+    };
+    if (strategy === "full" || strategy === "merge_only") {
+        const mergeResult = await mergeDuplicates(store);
+        result.mergedNodes = mergeResult.merged;
+        result.resolvedConflicts = mergeResult.conflicts;
+    }
+    if (strategy === "full" || strategy === "infer_only") {
+        result.inferredEdges = await inferTransitiveEdges(store);
+    }
+    if (strategy === "full" || strategy === "prune_only") {
+        result.prunedNodes = await pruneStaleNodes(store);
+    }
+    result.duration = Date.now() - startTime;
+    return result;
+}
+// -----------------------------------------------------------------------------
+// Duplicate Merging
+// -----------------------------------------------------------------------------
+async function mergeDuplicates(store) {
+    const { nodes } = await store.getAllNodes(10000, 0);
+    let merged = 0;
+    let conflicts = 0;
+    const processedIds = new Set();
+    for (let i = 0; i < nodes.length; i++) {
+        if (processedIds.has(nodes[i].id))
+            continue;
+        for (let j = i + 1; j < nodes.length; j++) {
+            if (processedIds.has(nodes[j].id))
+                continue;
+            const nodeA = nodes[i];
+            const nodeB = nodes[j];
+            // Check name similarity
+            const nameMatch = nodeA.name.toLowerCase() === nodeB.name.toLowerCase() ||
+                levenshteinSimilarity(nodeA.name.toLowerCase(), nodeB.name.toLowerCase()) > 0.85;
+            // Check embedding similarity if both have embeddings
+            let embeddingSimilar = false;
+            if (nodeA.embedding &&
+                nodeB.embedding &&
+                nodeA.embedding.length > 0 &&
+                nodeB.embedding.length > 0) {
+                const sim = cosineSimilarity(nodeA.embedding, nodeB.embedding);
+                embeddingSimilar = sim > DUPLICATE_SIMILARITY_THRESHOLD;
+            }
+            if (nameMatch || embeddingSimilar) {
+                // Merge B into A (keep the older/more accessed node)
+                const keepNode = nodeA.accessCount >= nodeB.accessCount ? nodeA : nodeB;
+                const removeNode = keepNode === nodeA ? nodeB : nodeA;
+                // Merge descriptions
+                const mergedDescription = keepNode.description.length >= removeNode.description.length
+                    ? keepNode.description
+                    : `${keepNode.description} | ${removeNode.description}`;
+                // Re-point edges from removeNode to keepNode
+                const edges = await store.getEdgesForNode(removeNode.id);
+                for (const edge of edges) {
+                    const newEdge = {
+                        ...edge,
+                        source: edge.source === removeNode.id ? keepNode.id : edge.source,
+                        target: edge.target === removeNode.id ? keepNode.id : edge.target,
+                        updatedAt: new Date().toISOString(),
+                    };
+                    // Skip self-loops
+                    if (newEdge.source === newEdge.target)
+                        continue;
+                    // Check if we already have this edge
+                    const existing = await store.getEdgesBetween(newEdge.source, newEdge.target);
+                    const duplicate = existing.find((e) => e.relation === newEdge.relation);
+                    if (!duplicate) {
+                        await store.addEdge(newEdge);
+                    }
+                }
+                // Update kept node and delete merged node
+                await store.updateNode(keepNode.id, {
+                    description: mergedDescription,
+                    accessCount: keepNode.accessCount + removeNode.accessCount,
+                });
+                await store.deleteNode(removeNode.id);
+                processedIds.add(removeNode.id);
+                merged++;
+                // Check for temporal conflicts
+                if (keepNode.validUntil &&
+                    removeNode.validFrom &&
+                    keepNode.validUntil < removeNode.validFrom) {
+                    conflicts++;
+                }
+            }
+        }
+    }
+    return { merged, conflicts };
+}
+// -----------------------------------------------------------------------------
+// Transitive Edge Inference
+// -----------------------------------------------------------------------------
+async function inferTransitiveEdges(store) {
+    const { nodes } = await store.getAllNodes(10000, 0);
+    let inferred = 0;
+    for (const node of nodes) {
+        const outEdges = await store.getEdgesForNode(node.id, "out");
+        for (const edgeAB of outEdges) {
+            // A -> B, now look for B -> C
+            const nextEdges = await store.getEdgesForNode(edgeAB.target, "out");
+            for (const edgeBC of nextEdges) {
+                // Skip if A == C (no self-loops)
+                if (edgeBC.target === node.id)
+                    continue;
+                // Check if A -> C edge already exists
+                const existing = await store.getEdgesBetween(node.id, edgeBC.target);
+                if (existing.length > 0)
+                    continue;
+                // Only infer for certain relationship types
+                if (edgeAB.relation === edgeBC.relation &&
+                    isTransitiveRelation(edgeAB.relation)) {
+                    const { v4: uuidv4 } = await import("uuid");
+                    const now = new Date().toISOString();
+                    await store.addEdge({
+                        id: uuidv4(),
+                        source: node.id,
+                        target: edgeBC.target,
+                        relation: edgeAB.relation,
+                        description: `Inferred: transitive ${edgeAB.relation}`,
+                        weight: Math.min(edgeAB.weight, edgeBC.weight) * 0.8,
+                        metadata: { inferred: true },
+                        createdAt: now,
+                        updatedAt: now,
+                    });
+                    inferred++;
+                }
+            }
+        }
+    }
+    return inferred;
+}
+function isTransitiveRelation(relation) {
+    const transitiveRelations = [
+        "depends_on",
+        "part_of",
+        "belongs_to",
+        "contains",
+        "extends",
+        "imports",
+    ];
+    return transitiveRelations.includes(relation);
+}
+// -----------------------------------------------------------------------------
+// Stale Node Pruning
+// -----------------------------------------------------------------------------
+async function pruneStaleNodes(store) {
+    const { nodes } = await store.getAllNodes(10000, 0);
+    const cutoff = new Date();
+    cutoff.setDate(cutoff.getDate() - STALE_NODE_AGE_DAYS);
+    const cutoffStr = cutoff.toISOString();
+    let pruned = 0;
+    for (const node of nodes) {
+        // Don't prune conversations or decisions (high-value types)
+        if (node.type === "conversation" || node.type === "decision")
+            continue;
+        // Prune if never accessed and old
+        const lastActivity = node.lastAccessedAt ?? node.updatedAt;
+        if (lastActivity < cutoffStr && node.accessCount === 0) {
+            await store.deleteNode(node.id);
+            pruned++;
+        }
+    }
+    return pruned;
+}
+// -----------------------------------------------------------------------------
+// Utilities
+// -----------------------------------------------------------------------------
+function levenshteinSimilarity(a, b) {
+    const maxLen = Math.max(a.length, b.length);
+    if (maxLen === 0)
+        return 1;
+    return 1 - levenshteinDistance(a, b) / maxLen;
+}
+function levenshteinDistance(a, b) {
+    const m = a.length;
+    const n = b.length;
+    const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0));
+    for (let i = 0; i <= m; i++)
+        dp[i][0] = i;
+    for (let j = 0; j <= n; j++)
+        dp[0][j] = j;
+    for (let i = 1; i <= m; i++) {
+        for (let j = 1; j <= n; j++) {
+            const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+            dp[i][j] = Math.min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, dp[i - 1][j - 1] + cost);
+        }
+    }
+    return dp[m][n];
+}
+//# sourceMappingURL=consolidator.js.map

package/dist/evolution/consolidator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"consolidator.js","sourceRoot":"","sources":["../../src/evolution/consolidator.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,qEAAqE;AACrE,gFAAgF;AAShF,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,EACL,8BAA8B,EAE9B,mBAAmB,GACpB,MAAM,iBAAiB,CAAC;AAEzB;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,KAAqB,EACrB,WAAkC,MAAM;IAExC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,MAAM,GAAwB;QAClC,WAAW,EAAE,CAAC;QACd,iBAAiB,EAAE,CAAC;QACpB,aAAa,EAAE,CAAC;QAChB,WAAW,EAAE,CAAC;QACd,QAAQ,EAAE,CAAC;KACZ,CAAC;IAEF,IAAI,QAAQ,KAAK,MAAM,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;QACrD,MAAM,WAAW,GAAG,MAAM,eAAe,CAAC,KAAK,CAAC,CAAC;QACjD,MAAM,CAAC,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC;QACxC,MAAM,CAAC,iBAAiB,GAAG,WAAW,CAAC,SAAS,CAAC;IACnD,CAAC;IAED,IAAI,QAAQ,KAAK,MAAM,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;QACrD,MAAM,CAAC,aAAa,GAAG,MAAM,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC3D,CAAC;IAED,IAAI,QAAQ,KAAK,MAAM,IAAI,QAAQ,KAAK,YAAY,EAAE,CAAC;QACrD,MAAM,CAAC,WAAW,GAAG,MAAM,eAAe,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;IACzC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gFAAgF;AAChF,oBAAoB;AACpB,gFAAgF;AAEhF,KAAK,UAAU,eAAe,CAC5B,KAAqB;IAErB,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACpD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,SAAS;QAE5C,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAAE,SAAS;YAE5C,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAEvB,wBAAwB;YACxB,MAAM,SAAS,GACb,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE;gBACrD,qBAAqB,CACnB,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,EACxB,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CACzB,GAAG,IAAI,CAAC;YAEX,qDAAqD;YACrD,IAAI,gBAAgB,GAAG,KAAK,CAAC;YAC7B,IACE,KAAK,CAAC,SAAS;gBACf,KAAK,CAAC,SAAS;gBACf,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC;gBAC1B,KAAK,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAC1B,CAAC;gBACD,MAAM,GAAG,GAAG,gBAAgB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;gBAC/D,gBAAgB,GAAG,GAAG,GAAG,8BAA8B,CAAC;YAC1D,CAAC;YAED,IAAI,SAAS,IAAI,gBAAgB,EAAE,CAAC;gBAClC,qDAAqD;gBACrD,MAAM,QAAQ,GAAG,KAAK,CAAC,WAAW,IAAI,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;gBACxE,MAAM,UAAU,GAAG,QAAQ,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;gBAEtD,qBAAqB;gBACrB,MAAM,iBAAiB,GACrB,QAAQ,CAAC,WAAW,CAAC,MAAM,IAAI,UAAU,CAAC,WAAW,CAAC,MAAM;oBAC1D,CAAC,CAAC,QAAQ,CAAC,WAAW;oBACtB,CAAC,CAAC,GAAG,QAAQ,CAAC,WAAW,MAAM,UAAU,CAAC,WAAW,EAAE,CAAC;gBAE5D,6CAA6C;gBAC7C,MAAM,KAAK,GAAG,MAAM,KAAK,CAAC,eAAe,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBACzD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,MAAM,OAAO,GAAe;wBAC1B,GAAG,IAAI;wBACP,MAAM,EAAE,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM;wBACjE,MAAM,EAAE,IAAI,CAAC,MAAM,KAAK,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM;wBACjE,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;qBACpC,CAAC;oBACF,kBAAkB;oBAClB,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM;wBAAE,SAAS;oBAEhD,qCAAqC;oBACrC,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,eAAe,CAC1C,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,MAAM,CACf,CAAC;oBACF,MAAM,SAAS,GAAG,QAAQ,CAAC,IAAI,CAC7B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,QAAQ,CACvC,CAAC;oBACF,IAAI,CAAC,SAAS,EAAE,CAAC;wBACf,MAAM,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC/B,CAAC;gBACH,CAAC;gBAED,0CAA0C;gBAC1C,MAAM,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,EAAE;oBAClC,WAAW,EAAE,iBAAiB;oBAC9B,WAAW,EAAE,QAAQ,CAAC,WAAW,GAAG,UAAU,CAAC,WAAW;iBAC3D,CAAC,CAAC;gBACH,MAAM,KAAK,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBAEtC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBAChC,MAAM,EAAE,CAAC;gBAET,+BAA+B;gBAC/B,IACE,QAAQ,CAAC,UAAU;oBACnB,UAAU,CAAC,SAAS;oBACpB,QAAQ,CAAC,UAAU,GAAG,UAAU,CAAC,SAAS,EAC1C,CAAC;oBACD,SAAS,EAAE,CAAC;gBACd,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;AAC/B,CAAC;AAED,gFAAgF;AAChF,4BAA4B;AAC5B,gFAAgF;AAEhF,KAAK,UAAU,oBAAoB,CAAC,KAAqB;IACvD,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACpD,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAE7D,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC9B,8BAA8B;YAC9B,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAEpE,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;gBAC/B,iCAAiC;gBACjC,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE;oBAAE,SAAS;gBAExC,sCAAsC;gBACtC,MAAM,QAAQ,GAAG,MAAM,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;gBACrE,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;oBAAE,SAAS;gBAElC,4CAA4C;gBAC5C,IACE,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ;oBACnC,oBAAoB,CAAC,MAAM,CAAC,QAAQ,CAAC,EACrC,CAAC;oBACD,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC,CAAC;oBAC5C,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;oBACrC,MAAM,KAAK,CAAC,OAAO,CAAC;wBAClB,EAAE,EAAE,MAAM,EAAE;wBACZ,MAAM,EAAE,IAAI,CAAC,EAAE;wBACf,MAAM,EAAE,MAAM,CAAC,MAAM;wBACrB,QAAQ,EAAE,MAAM,CAAC,QAAQ;wBACzB,WAAW,EAAE,wBAAwB,MAAM,CAAC,QAAQ,EAAE;wBACtD,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,GAAG;wBACpD,QAAQ,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE;wBAC5B,SAAS,EAAE,GAAG;wBACd,SAAS,EAAE,GAAG;qBACf,CAAC,CAAC;oBACH,QAAQ,EAAE,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,oBAAoB,CAAC,QAAgB;IAC5C,MAAM,mBAAmB,GAAG;QAC1B,YAAY;QACZ,SAAS;QACT,YAAY;QACZ,UAAU;QACV,SAAS;QACT,SAAS;KACV,CAAC;IACF,OAAO,mBAAmB,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAChD,CAAC;AAED,gFAAgF;AAChF,qBAAqB;AACrB,gFAAgF;AAEhF,KAAK,UAAU,eAAe,CAAC,KAAqB;IAClD,MAAM,EAAE,KAAK,EAAE,GAAG,MAAM,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACpD,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;IAC1B,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,mBAAmB,CAAC,CAAC;IACvD,MAAM,SAAS,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACvC,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,4DAA4D;QAC5D,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU;YAAE,SAAS;QAEvE,kCAAkC;QAClC,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,SAAS,CAAC;QAC3D,IAAI,YAAY,GAAG,SAAS,IAAI,IAAI,CAAC,WAAW,KAAK,CAAC,EAAE,CAAC;YACvD,MAAM,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChC,MAAM,EAAE,CAAC;QACX,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,gFAAgF;AAChF,YAAY;AACZ,gFAAgF;AAEhF,SAAS,qBAAqB,CAAC,CAAS,EAAE,CAAS;IACjD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IAC5C,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC3B,OAAO,CAAC,GAAG,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC;AAChD,CAAC;AAED,SAAS,mBAAmB,CAAC,CAAS,EAAE,CAAS;IAC/C,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CACxD,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CACrB,CAAC;IAEF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;QAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACjB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAChB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAChB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CACxB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":""}

package/dist/index.js

@@ -0,0 +1,53 @@
+#!/usr/bin/env node
+// =============================================================================
+// Open-Memory MCP Server — Entry Point
+// =============================================================================
+// Graph-based agent memory for AI coding assistants.
+// Extends context window by storing entities, relationships, and decisions
+// in a persistent knowledge graph accessible via MCP tools.
+// =============================================================================
+import dotenv from "dotenv";
+import { McpServer } from "@modelcontextprotocol/sdk/server/mcp.js";
+import { StdioServerTransport } from "@modelcontextprotocol/sdk/server/stdio.js";
+import { createStorageBackend } from "./storage/factory.js";
+import { registerMemoryTools } from "./tools/memory-tools.js";
+import { registerMemoryResources } from "./resources/context-resource.js";
+import { createLLMProvider } from "./llm/provider.js";
+import { SERVER_NAME, SERVER_VERSION } from "./constants.js";
+// Load environment variables
+dotenv.config();
+async function main() {
+    console.error(`[open-memory] Starting ${SERVER_NAME} v${SERVER_VERSION}...`);
+    // 1. Initialize storage backend
+    const store = createStorageBackend();
+    await store.initialize();
+    // 2. Initialize optional LLM provider
+    const llm = createLLMProvider();
+    // 3. Create MCP server
+    const server = new McpServer({
+        name: SERVER_NAME,
+        version: SERVER_VERSION,
+    });
+    // 4. Register tools and resources
+    registerMemoryTools(server, store, llm);
+    registerMemoryResources(server, store);
+    const toolCount = llm ? 12 : 11;
+    console.error(`[open-memory] Registered ${toolCount} tools and 2 resources`);
+    // 5. Connect via stdio transport
+    const transport = new StdioServerTransport();
+    await server.connect(transport);
+    console.error(`[open-memory] Server running via stdio. Ready for connections.`);
+    // Graceful shutdown
+    const shutdown = async () => {
+        console.error(`[open-memory] Shutting down...`);
+        await store.close();
+        process.exit(0);
+    };
+    process.on("SIGINT", shutdown);
+    process.on("SIGTERM", shutdown);
+}
+main().catch((error) => {
+    console.error(`[open-memory] Fatal error:`, error);
+    process.exit(1);
+});
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";AACA,gFAAgF;AAChF,uCAAuC;AACvC,gFAAgF;AAChF,qDAAqD;AACrD,2EAA2E;AAC3E,4DAA4D;AAC5D,gFAAgF;AAEhF,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC5B,OAAO,EAAE,SAAS,EAAE,MAAM,yCAAyC,CAAC;AACpE,OAAO,EAAE,oBAAoB,EAAE,MAAM,2CAA2C,CAAC;AACjF,OAAO,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAC1E,OAAO,EAAE,iBAAiB,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAE7D,6BAA6B;AAC7B,MAAM,CAAC,MAAM,EAAE,CAAC;AAEhB,KAAK,UAAU,IAAI;IACjB,OAAO,CAAC,KAAK,CAAC,0BAA0B,WAAW,KAAK,cAAc,KAAK,CAAC,CAAC;IAE7E,gCAAgC;IAChC,MAAM,KAAK,GAAG,oBAAoB,EAAE,CAAC;IACrC,MAAM,KAAK,CAAC,UAAU,EAAE,CAAC;IAEzB,sCAAsC;IACtC,MAAM,GAAG,GAAG,iBAAiB,EAAE,CAAC;IAEhC,uBAAuB;IACvB,MAAM,MAAM,GAAG,IAAI,SAAS,CAAC;QAC3B,IAAI,EAAE,WAAW;QACjB,OAAO,EAAE,cAAc;KACxB,CAAC,CAAC;IAEH,kCAAkC;IAClC,mBAAmB,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IACxC,uBAAuB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAEvC,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAChC,OAAO,CAAC,KAAK,CAAC,4BAA4B,SAAS,wBAAwB,CAAC,CAAC;IAE7E,iCAAiC;IACjC,MAAM,SAAS,GAAG,IAAI,oBAAoB,EAAE,CAAC;IAC7C,MAAM,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IAEhC,OAAO,CAAC,KAAK,CACX,gEAAgE,CACjE,CAAC;IAEF,oBAAoB;IACpB,MAAM,QAAQ,GAAG,KAAK,IAAI,EAAE;QAC1B,OAAO,CAAC,KAAK,CAAC,gCAAgC,CAAC,CAAC;QAChD,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;QACpB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC;IAEF,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAC/B,OAAO,CAAC,EAAE,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;AAClC,CAAC;AAED,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE;IACrB,OAAO,CAAC,KAAK,CAAC,4BAA4B,EAAE,KAAK,CAAC,CAAC;IACnD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC,CAAC"}

package/dist/llm/openai-provider.d.ts

@@ -0,0 +1,23 @@
+import type { LLMProvider, ExtractionResult } from "../types.js";
+export declare class OpenAIProvider implements LLMProvider {
+    private apiKey;
+    private baseUrl;
+    private chatModel;
+    private embeddingModel;
+    constructor(apiKey: string, baseUrl: string, chatModel: string, embeddingModel: string);
+    /**
+     * Extract entities and relationships from text using the chat model.
+     */
+    extractEntitiesAndRelations(text: string, existingEntities: string[]): Promise<ExtractionResult>;
+    /**
+     * Generate a single embedding vector.
+     */
+    generateEmbedding(text: string): Promise<number[]>;
+    /**
+     * Generate embeddings for multiple texts in a single batch.
+     */
+    generateEmbeddingBatch(texts: string[]): Promise<number[][]>;
+    private chatCompletion;
+    private embeddingRequest;
+}
+//# sourceMappingURL=openai-provider.d.ts.map

package/dist/llm/openai-provider.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"openai-provider.d.ts","sourceRoot":"","sources":["../../src/llm/openai-provider.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EACV,WAAW,EACX,gBAAgB,EAGjB,MAAM,aAAa,CAAC;AAyBrB,qBAAa,cAAe,YAAW,WAAW;IAChD,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,cAAc,CAAS;gBAG7B,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,cAAc,EAAE,MAAM;IAQxB;;OAEG;IACG,2BAA2B,CAC/B,IAAI,EAAE,MAAM,EACZ,gBAAgB,EAAE,MAAM,EAAE,GACzB,OAAO,CAAC,gBAAgB,CAAC;IA0D5B;;OAEG;IACG,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAKxD;;OAEG;IACG,sBAAsB,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YAQpD,cAAc;YA4Bd,gBAAgB;CAyB/B"}