@massa-ai/core 1.2.1

package/dist/services/memory/memory-clustering.js

@@ -0,0 +1,298 @@
+/**
+ * Memory Clustering
+ *
+ * Groups memories into semantic clusters using simplified K-means
+ * over embedding vectors. Each cluster gets a human-readable label
+ * derived from the most representative member keywords.
+ *
+ * Use-cases:
+ * - Identify recurring themes across stored knowledge
+ * - Compress old clusters into summaries
+ * - Power "show me everything about topic X" queries
+ *
+ * Performance: Runs on demand or during consolidation. The scan is
+ * bounded to `maxMemories` to keep wall-time reasonable.
+ */
+import { logger } from "@massa-ai/shared";
+import { getPrismaClient } from "../query/prisma-client.js";
+// ── Implementation ───────────────────────────────────────────
+export class MemoryClustering {
+    static instance = null;
+    static getInstance() {
+        if (!MemoryClustering.instance) {
+            MemoryClustering.instance = new MemoryClustering();
+        }
+        return MemoryClustering.instance;
+    }
+    constructor() { }
+    // ── Core API ─────────────────────────────────────────────
+    /**
+     * Cluster memories using K-means.
+     *
+     * @param k          Number of clusters (auto-tuned if omitted)
+     * @param maxIter    Max K-means iterations
+     * @param maxMemories Max memories to consider (most recent)
+     */
+    async clusterMemories(k, maxIter = 20, maxMemories = 500) {
+        const start = Date.now();
+        // Load memories with valid embeddings
+        const rows = await getPrismaClient().$queryRaw `
+      SELECT id, content, type, level, importance, array_to_json(tags)::text AS tags,
+        embedding, created_at, updated_at, access_count, user_id, session_id, project_id, agent_id
+      FROM memories WHERE embedding IS NOT NULL ORDER BY created_at DESC LIMIT ${maxMemories}`;
+        const items = [];
+        for (const row of rows) {
+            if (!row.embedding)
+                continue;
+            const buf = row.embedding instanceof Buffer
+                ? row.embedding
+                : Buffer.from(row.embedding);
+            const vec = Array.from(new Float32Array(buf.buffer, buf.byteOffset, buf.byteLength / 4));
+            if (vec.every((v) => v === 0))
+                continue;
+            items.push({ row, vec });
+        }
+        if (items.length < 3) {
+            return { clusters: [], unclustered: items.length, durationMs: Date.now() - start };
+        }
+        // Auto-tune k: sqrt(n/2) is a common heuristic
+        const effectiveK = k ?? Math.max(2, Math.min(20, Math.round(Math.sqrt(items.length / 2))));
+        const dim = items[0].vec.length;
+        // ── K-means ────────────────────────────────────────────
+        // 1. Initialize centroids with K-means++ (first = random, rest = weighted distance)
+        let centroids = this.kMeansPlusPlusInit(items.map((i) => i.vec), effectiveK);
+        let assignments = new Int32Array(items.length);
+        for (let iter = 0; iter < maxIter; iter++) {
+            // Assign each item to nearest centroid
+            const newAssignments = new Int32Array(items.length);
+            for (let i = 0; i < items.length; i++) {
+                let bestDist = Infinity;
+                let bestCluster = 0;
+                for (let c = 0; c < centroids.length; c++) {
+                    const dist = this.euclideanDistanceSq(items[i].vec, centroids[c]);
+                    if (dist < bestDist) {
+                        bestDist = dist;
+                        bestCluster = c;
+                    }
+                }
+                newAssignments[i] = bestCluster;
+            }
+            // Check convergence
+            let changed = false;
+            for (let i = 0; i < items.length; i++) {
+                if (newAssignments[i] !== assignments[i]) {
+                    changed = true;
+                    break;
+                }
+            }
+            assignments = newAssignments;
+            if (!changed)
+                break;
+            // Recompute centroids
+            const newCentroids = [];
+            const counts = [];
+            for (let c = 0; c < centroids.length; c++) {
+                newCentroids.push(new Array(dim).fill(0));
+                counts.push(0);
+            }
+            for (let i = 0; i < items.length; i++) {
+                const c = assignments[i];
+                counts[c]++;
+                for (let d = 0; d < dim; d++) {
+                    newCentroids[c][d] += items[i].vec[d];
+                }
+            }
+            for (let c = 0; c < centroids.length; c++) {
+                if (counts[c] === 0)
+                    continue;
+                for (let d = 0; d < dim; d++) {
+                    newCentroids[c][d] /= counts[c];
+                }
+            }
+            centroids = newCentroids;
+        }
+        // ── Build cluster objects ──────────────────────────────
+        const clusterMap = new Map();
+        for (let i = 0; i < items.length; i++) {
+            const c = assignments[i];
+            if (!clusterMap.has(c))
+                clusterMap.set(c, []);
+            clusterMap.get(c).push(items[i].row);
+        }
+        const clusters = [];
+        let unclustered = 0;
+        for (const [cIdx, members] of clusterMap) {
+            // Skip singleton clusters — these are "unclustered"
+            if (members.length < 2) {
+                unclustered += members.length;
+                continue;
+            }
+            const label = this.generateLabel(members);
+            const avgImportance = members.reduce((sum, m) => sum + m.importance, 0) / members.length;
+            const totalAccess = members.reduce((sum, m) => sum + m.access_count, 0);
+            const dominantType = this.getDominantType(members);
+            clusters.push({
+                id: `cluster_${Date.now()}_${cIdx}`,
+                centroid: centroids[cIdx],
+                memberIds: members.map((m) => m.id),
+                label,
+                importance: Math.round(avgImportance * 100) / 100,
+                totalAccess,
+                dominantType,
+            });
+        }
+        // Sort by importance descending
+        clusters.sort((a, b) => b.importance - a.importance);
+        logger.info("MemoryClustering: complete", {
+            inputMemories: items.length,
+            clusters: clusters.length,
+            unclustered,
+            k: effectiveK,
+        });
+        return { clusters, unclustered, durationMs: Date.now() - start };
+    }
+    /**
+     * Find which cluster a memory belongs to.
+     * Re-runs clustering if needed (lightweight for small sets).
+     */
+    async findCluster(memoryId, cached) {
+        const result = cached ?? await this.clusterMemories();
+        for (const cluster of result.clusters) {
+            if (cluster.memberIds.includes(memoryId)) {
+                return cluster;
+            }
+        }
+        return null;
+    }
+    /**
+     * Generate a short summary of a cluster from member content.
+     * Uses keyword extraction (no LLM dependency).
+     */
+    async summarizeCluster(cluster) {
+        const members = await getPrismaClient().$queryRaw `SELECT content, type, importance FROM memories WHERE id = ANY(${cluster.memberIds}::text[]) ORDER BY importance DESC LIMIT 5`;
+        if (members.length === 0)
+            return cluster.label;
+        // Take the most important memory's first sentence as the summary lead
+        const lead = members[0].content.split(/[.!?\n]/)[0].trim();
+        const typeCount = members.length;
+        const types = [...new Set(members.map((m) => m.type))].join(", ");
+        return `[${cluster.label}] ${lead} (${typeCount} memories, types: ${types})`;
+    }
+    // ── K-means++ initialization ────────────────────────────
+    kMeansPlusPlusInit(vectors, k) {
+        const centroids = [];
+        // First centroid: random
+        const firstIdx = Math.floor(Math.random() * vectors.length);
+        centroids.push([...vectors[firstIdx]]);
+        // Remaining centroids: weighted by distance to nearest existing centroid
+        for (let c = 1; c < k; c++) {
+            const distances = [];
+            let totalDist = 0;
+            for (const vec of vectors) {
+                let minDist = Infinity;
+                for (const centroid of centroids) {
+                    const d = this.euclideanDistanceSq(vec, centroid);
+                    if (d < minDist)
+                        minDist = d;
+                }
+                distances.push(minDist);
+                totalDist += minDist;
+            }
+            // Weighted random selection
+            if (totalDist === 0) {
+                // All points are on existing centroids; pick random
+                centroids.push([...vectors[Math.floor(Math.random() * vectors.length)]]);
+                continue;
+            }
+            let r = Math.random() * totalDist;
+            for (let i = 0; i < distances.length; i++) {
+                r -= distances[i];
+                if (r <= 0) {
+                    centroids.push([...vectors[i]]);
+                    break;
+                }
+            }
+            // Safety: if floating-point imprecision prevented selection
+            if (centroids.length <= c) {
+                centroids.push([...vectors[vectors.length - 1]]);
+            }
+        }
+        return centroids;
+    }
+    // ── Label generation ────────────────────────────────────
+    /**
+     * Generate a human-readable label from cluster members.
+     * Extracts the most frequent significant words across member content.
+     */
+    generateLabel(members) {
+        const stopWords = new Set([
+            "the", "a", "an", "is", "are", "was", "were", "be", "been", "being",
+            "have", "has", "had", "do", "does", "did", "will", "would", "could",
+            "should", "may", "might", "shall", "can", "need", "dare", "ought",
+            "used", "to", "of", "in", "for", "on", "with", "at", "by", "from",
+            "as", "into", "through", "during", "before", "after", "above", "below",
+            "between", "out", "off", "over", "under", "again", "further", "then",
+            "once", "here", "there", "when", "where", "why", "how", "all", "both",
+            "each", "few", "more", "most", "other", "some", "such", "no", "nor",
+            "not", "only", "own", "same", "so", "than", "too", "very", "just",
+            "don", "should", "now", "and", "but", "or", "if", "while", "that",
+            "this", "it", "its", "what", "which", "who", "whom", "these", "those",
+            "i", "me", "my", "myself", "we", "our", "ours", "you", "your",
+            "he", "him", "his", "she", "her", "they", "them", "their",
+            // Portuguese stop words
+            "de", "da", "do", "das", "dos", "em", "no", "na", "nos", "nas",
+            "um", "uma", "uns", "umas", "para", "com", "por", "que", "se",
+            "como", "mas", "ou", "quando", "mais", "também", "já", "ainda",
+            "sobre", "entre", "até", "sem", "sob", "esse", "essa", "este",
+            "esta", "aquele", "aquela", "ele", "ela", "eles", "elas", "nós",
+            "eu", "tu", "você", "vocês", "meu", "minha", "seu", "sua",
+        ]);
+        const wordFreq = new Map();
+        for (const member of members) {
+            const words = member.content
+                .toLowerCase()
+                .replace(/[^a-záàâãéèêíïóôõúüç\s-]/g, " ")
+                .split(/\s+/)
+                .filter((w) => w.length > 2 && !stopWords.has(w));
+            const seen = new Set();
+            for (const word of words) {
+                if (seen.has(word))
+                    continue;
+                seen.add(word);
+                wordFreq.set(word, (wordFreq.get(word) ?? 0) + 1);
+            }
+        }
+        // Top 3 most frequent words across documents
+        const sorted = [...wordFreq.entries()]
+            .sort((a, b) => b[1] - a[1])
+            .slice(0, 3)
+            .map(([word]) => word);
+        return sorted.length > 0 ? sorted.join(", ") : "misc";
+    }
+    getDominantType(members) {
+        const typeCounts = new Map();
+        for (const m of members) {
+            typeCounts.set(m.type, (typeCounts.get(m.type) ?? 0) + 1);
+        }
+        let dominant = "unknown";
+        let maxCount = 0;
+        for (const [type, count] of typeCounts) {
+            if (count > maxCount) {
+                maxCount = count;
+                dominant = type;
+            }
+        }
+        return dominant;
+    }
+    // ── Math helpers ────────────────────────────────────────
+    euclideanDistanceSq(a, b) {
+        let sum = 0;
+        for (let i = 0; i < a.length; i++) {
+            const diff = a[i] - b[i];
+            sum += diff * diff;
+        }
+        return sum;
+    }
+    close() { MemoryClustering.instance = null; }
+}
+//# sourceMappingURL=memory-clustering.js.map

package/dist/services/memory/memory-clustering.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-clustering.js","sourceRoot":"","sources":["../../../src/services/memory/memory-clustering.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC1C,OAAO,EAAE,eAAe,EAAE,MAAM,2BAA2B,CAAC;AAwB5D,gEAAgE;AAEhE,MAAM,OAAO,gBAAgB;IACnB,MAAM,CAAC,QAAQ,GAA4B,IAAI,CAAC;IAExD,MAAM,CAAC,WAAW;QAChB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC;YAC/B,gBAAgB,CAAC,QAAQ,GAAG,IAAI,gBAAgB,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,gBAAgB,CAAC,QAAQ,CAAC;IACnC,CAAC;IAED,gBAAe,CAAC;IAEhB,4DAA4D;IAE5D;;;;;;OAMG;IACH,KAAK,CAAC,eAAe,CACnB,CAAU,EACV,UAAkB,EAAE,EACpB,cAAsB,GAAG;QAEzB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEzB,sCAAsC;QACtC,MAAM,IAAI,GAAG,MAAM,eAAe,EAAE,CAAC,SAAS,CAA0B;;;iFAGK,WAAW,EAAE,CAAC;QAE3F,MAAM,KAAK,GAAqD,EAAE,CAAC;QACnE,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,GAAG,CAAC,SAAS;gBAAE,SAAS;YAC7B,MAAM,GAAG,GACP,GAAG,CAAC,SAAS,YAAY,MAAM;gBAC7B,CAAC,CAAC,GAAG,CAAC,SAAS;gBACf,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACjC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CACpB,IAAI,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,CACjE,CAAC;YACF,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;gBAAE,SAAS;YACxC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC3B,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC;QACrF,CAAC;QAED,+CAA+C;QAC/C,MAAM,UAAU,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3F,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC;QAEhC,0DAA0D;QAC1D,oFAAoF;QACpF,IAAI,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;QAE7E,IAAI,WAAW,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAE/C,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;YAC1C,uCAAuC;YACvC,MAAM,cAAc,GAAG,IAAI,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,IAAI,QAAQ,GAAG,QAAQ,CAAC;gBACxB,IAAI,WAAW,GAAG,CAAC,CAAC;gBACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;oBAClE,IAAI,IAAI,GAAG,QAAQ,EAAE,CAAC;wBACpB,QAAQ,GAAG,IAAI,CAAC;wBAChB,WAAW,GAAG,CAAC,CAAC;oBAClB,CAAC;gBACH,CAAC;gBACD,cAAc,CAAC,CAAC,CAAC,GAAG,WAAW,CAAC;YAClC,CAAC;YAED,oBAAoB;YACpB,IAAI,OAAO,GAAG,KAAK,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC;oBACzC,OAAO,GAAG,IAAI,CAAC;oBACf,MAAM;gBACR,CAAC;YACH,CAAC;YACD,WAAW,GAAG,cAAc,CAAC;YAC7B,IAAI,CAAC,OAAO;gBAAE,MAAM;YAEpB,sBAAsB;YACtB,MAAM,YAAY,GAAe,EAAE,CAAC;YACpC,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,YAAY,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBACzB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;oBAAE,SAAS;gBAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC7B,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;YACD,SAAS,GAAG,YAAY,CAAC;QAC3B,CAAC;QAED,0DAA0D;QAC1D,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoC,CAAC;QAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC9C,UAAU,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACxC,CAAC;QAED,MAAM,QAAQ,GAAoB,EAAE,CAAC;QACrC,IAAI,WAAW,GAAG,CAAC,CAAC;QAEpB,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,UAAU,EAAE,CAAC;YACzC,oDAAoD;YACpD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC;gBAC9B,SAAS;YACX,CAAC;YAED,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YAC1C,MAAM,aAAa,GACjB,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;YACrE,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAChC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,YAAY,EAChC,CAAC,CACF,CAAC;YACF,MAAM,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;YAEnD,QAAQ,CAAC,IAAI,CAAC;gBACZ,EAAE,EAAE,WAAW,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,EAAE;gBACnC,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC;gBACzB,SAAS,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnC,KAAK;gBACL,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,aAAa,GAAG,GAAG,CAAC,GAAG,GAAG;gBACjD,WAAW;gBACX,YAAY;aACb,CAAC,CAAC;QACL,CAAC;QAED,gCAAgC;QAChC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAErD,MAAM,CAAC,IAAI,CAAC,4BAA4B,EAAE;YACxC,aAAa,EAAE,KAAK,CAAC,MAAM;YAC3B,QAAQ,EAAE,QAAQ,CAAC,MAAM;YACzB,WAAW;YACX,CAAC,EAAE,UAAU;SACd,CAAC,CAAC;QAEH,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC;IACnE,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,WAAW,CAAC,QAAgB,EAAE,MAAyB;QAC3D,MAAM,MAAM,GAAG,MAAM,IAAI,MAAM,IAAI,CAAC,eAAe,EAAE,CAAC;QACtD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACtC,IAAI,OAAO,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACzC,OAAO,OAAO,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,gBAAgB,CAAC,OAAsB;QAC3C,MAAM,OAAO,GAAG,MAAM,eAAe,EAAE,CAAC,SAAS,CAI9C,iEAAiE,OAAO,CAAC,SAAS,4CAA4C,CAAC;QAElI,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC,KAAK,CAAC;QAE/C,sEAAsE;QACtE,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC3D,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC;QACjC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAElE,OAAO,IAAI,OAAO,CAAC,KAAK,KAAK,IAAI,KAAK,SAAS,qBAAqB,KAAK,GAAG,CAAC;IAC/E,CAAC;IAED,2DAA2D;IAEnD,kBAAkB,CAAC,OAAmB,EAAE,CAAS;QACvD,MAAM,SAAS,GAAe,EAAE,CAAC;QAEjC,yBAAyB;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5D,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QAEvC,yEAAyE;QACzE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,IAAI,SAAS,GAAG,CAAC,CAAC;YAElB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;gBAC1B,IAAI,OAAO,GAAG,QAAQ,CAAC;gBACvB,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;oBACjC,MAAM,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;oBAClD,IAAI,CAAC,GAAG,OAAO;wBAAE,OAAO,GAAG,CAAC,CAAC;gBAC/B,CAAC;gBACD,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACxB,SAAS,IAAI,OAAO,CAAC;YACvB,CAAC;YAED,4BAA4B;YAC5B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,oDAAoD;gBACpD,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzE,SAAS;YACX,CAAC;YAED,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,SAAS,CAAC;YAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBACX,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChC,MAAM;gBACR,CAAC;YACH,CAAC;YAED,4DAA4D;YAC5D,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC1B,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,2DAA2D;IAE3D;;;OAGG;IACK,aAAa,CAAC,OAAiC;QACrD,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;YACxB,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;YACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;YACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;YACjE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM;YACjE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO;YACtE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM;YACpE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;YACrE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK;YACnE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;YACjE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM;YACjE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;YACrE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM;YAC7D,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;YACzD,wBAAwB;YACxB,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK;YAC9D,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI;YAC7D,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO;YAC9D,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;YAC7D,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK;YAC/D,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK;SAC1D,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO;iBACzB,WAAW,EAAE;iBACb,OAAO,CAAC,2BAA2B,EAAE,GAAG,CAAC;iBACzC,KAAK,CAAC,KAAK,CAAC;iBACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAEpD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;oBAAE,SAAS;gBAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACf,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;QAED,6CAA6C;QAC7C,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC;aACnC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;aAC3B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC;QAEzB,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACxD,CAAC;IAEO,eAAe,CAAC,OAAiC;QACvD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC7C,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,CAAC;QACD,IAAI,QAAQ,GAAG,SAAS,CAAC;QACzB,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,UAAU,EAAE,CAAC;YACvC,IAAI,KAAK,GAAG,QAAQ,EAAE,CAAC;gBACrB,QAAQ,GAAG,KAAK,CAAC;gBACjB,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,2DAA2D;IAEnD,mBAAmB,CAAC,CAAW,EAAE,CAAW;QAClD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,KAAW,gBAAgB,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC"}

package/dist/services/memory/memory-service.d.ts

@@ -0,0 +1,72 @@
+/**
+ * Memory Service
+ *
+ * Pure domain logic for the memory subsystem.
+ * Owns ID generation, level determination, scoring/ranking algorithms,
+ * and embedding coordination. No DB calls — those live in MemoryRepository.
+ */
+import { MemoryType, MemoryLevel } from "@massa-ai/shared";
+import type { MemoryRow } from "../../data/memory/memory-repository.js";
+export interface Memory {
+    id: string;
+    content: string;
+    type: MemoryType;
+    level: MemoryLevel;
+    userId: string | null;
+    sessionId: string | null;
+    projectId: string | null;
+    agentId: string | null;
+    importance: number;
+    tags: string[];
+    createdAt: number;
+    accessCount: number;
+    lastAccessed: number | null;
+    /** Pinned memories are decay-exempt (Phase 1). 0/1 from the row. */
+    pinned?: number;
+    score?: number;
+    embedding?: any;
+}
+export interface ScoredMemory extends Memory {
+    score: number;
+}
+export declare class MemoryService {
+    private static instance;
+    private embeddingService;
+    private constructor();
+    static getInstance(): MemoryService;
+    generateEmbedding(text: string): Promise<number[]>;
+    generateId(type: MemoryType, userId?: string): string;
+    /**
+     * Determine the memory level (L0–L4) using agent hierarchy rules.
+     */
+    determineLevel(type: MemoryType, opts: {
+        userId?: string;
+        sessionId?: string;
+        projectId?: string;
+        agentId?: string;
+    }): MemoryLevel;
+    rowToMemory(row: MemoryRow): Memory;
+    /**
+     * Rank memories by semantic similarity + temporal + access + type priors.
+     * Stability–plasticity balance:
+     *   semantic 65%, temporal 20%, access 10%, type 5%
+     */
+    semanticRank(memories: Memory[], queryEmbedding: number[], limit: number): ScoredMemory[];
+    private cosineSimilarity;
+    /**
+     * Temporal salience curve — delegates to the pure, tested `decayScore`
+     * (Phase 1, borrowed from ai-memory decay.rs). Blends a recency-decayed
+     * salience term with an access-reinforcement term; pinned memories are
+     * exempt. Tunable via `config.memory.decay`.
+     */
+    private temporalScore;
+    /**
+     * Log-curve access reinforcement with saturation.
+     */
+    private accessBoost;
+    /**
+     * Small priors for reusable memory types.
+     */
+    private typeBoost;
+}
+//# sourceMappingURL=memory-service.d.ts.map

package/dist/services/memory/memory-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-service.d.ts","sourceRoot":"","sources":["../../../src/services/memory/memory-service.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,UAAU,EAAE,WAAW,EAAU,MAAM,kBAAkB,CAAC;AAEnE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wCAAwC,CAAC;AAKxE,MAAM,WAAW,MAAM;IACrB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,UAAU,CAAC;IACjB,KAAK,EAAE,WAAW,CAAC;IACnB,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IACtB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,SAAS,EAAE,MAAM,GAAG,IAAI,CAAC;IACzB,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,oEAAoE;IACpE,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,GAAG,CAAC;CACjB;AAED,MAAM,WAAW,YAAa,SAAQ,MAAM;IAC1C,KAAK,EAAE,MAAM,CAAC;CACf;AAID,qBAAa,aAAa;IACxB,OAAO,CAAC,MAAM,CAAC,QAAQ,CAA8B;IACrD,OAAO,CAAC,gBAAgB,CAAmB;IAE3C,OAAO;IAIP,MAAM,CAAC,WAAW,IAAI,aAAa;IAS7B,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAMxD,UAAU,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,MAAM;IAUrD;;OAEG;IACH,cAAc,CACZ,IAAI,EAAE,UAAU,EAChB,IAAI,EAAE;QACJ,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,OAAO,CAAC,EAAE,MAAM,CAAC;KAClB,GACA,WAAW;IAqCd,WAAW,CAAC,GAAG,EAAE,SAAS,GAAG,MAAM;IAsBnC;;;;OAIG;IACH,YAAY,CACV,QAAQ,EAAE,MAAM,EAAE,EAClB,cAAc,EAAE,MAAM,EAAE,EACxB,KAAK,EAAE,MAAM,GACZ,YAAY,EAAE;IAiCjB,OAAO,CAAC,gBAAgB;IAiBxB;;;;;OAKG;IACH,OAAO,CAAC,aAAa;IAarB;;OAEG;IACH,OAAO,CAAC,WAAW;IAMnB;;OAEG;IACH,OAAO,CAAC,SAAS;CAelB"}

package/dist/services/memory/memory-service.js

@@ -0,0 +1,178 @@
+/**
+ * Memory Service
+ *
+ * Pure domain logic for the memory subsystem.
+ * Owns ID generation, level determination, scoring/ranking algorithms,
+ * and embedding coordination. No DB calls — those live in MemoryRepository.
+ */
+import { MemoryType, MemoryLevel, config } from "@massa-ai/shared";
+import { EmbeddingService } from "../embeddings/index.js";
+import { decayScore } from "./decay.js";
+// ── Service ──────────────────────────────────────────────────
+export class MemoryService {
+    static instance = null;
+    embeddingService;
+    constructor() {
+        this.embeddingService = new EmbeddingService();
+    }
+    static getInstance() {
+        if (!MemoryService.instance) {
+            MemoryService.instance = new MemoryService();
+        }
+        return MemoryService.instance;
+    }
+    // ── Embedding ──────────────────────────────────────────────
+    async generateEmbedding(text) {
+        return this.embeddingService.embed(text);
+    }
+    // ── ID Generation ──────────────────────────────────────────
+    generateId(type, userId) {
+        const timestamp = Date.now();
+        const random = Math.random().toString(36).substring(2, 8);
+        const prefix = type.substring(0, 3);
+        const userPart = userId ? `_${userId.substring(0, 4)}` : "";
+        return `${prefix}_${timestamp}_${random}${userPart}`;
+    }
+    // ── Level Determination ────────────────────────────────────
+    /**
+     * Determine the memory level (L0–L4) using agent hierarchy rules.
+     */
+    determineLevel(type, opts) {
+        const { userId, sessionId, projectId, agentId } = opts;
+        // Agent hierarchy overrides
+        if (agentId === "orchestrator" && (type === "decision" || type === "critical")) {
+            return MemoryLevel.PERSISTENT; // L0
+        }
+        if (agentId === "architect" && (type === "pattern" || type === "code" || type === "critical")) {
+            return MemoryLevel.PROJECT; // L1
+        }
+        if (agentId === "optimizer" && type === "critical") {
+            return MemoryLevel.USER; // L2
+        }
+        // Scope-based defaults
+        if (projectId)
+            return MemoryLevel.PROJECT;
+        if (userId && !sessionId)
+            return MemoryLevel.USER;
+        if (sessionId)
+            return MemoryLevel.SESSION;
+        // Type-based defaults
+        switch (type) {
+            case "critical":
+                return MemoryLevel.USER;
+            case "conversation":
+                return MemoryLevel.SESSION;
+            case "code":
+            case "pattern":
+                return MemoryLevel.PROJECT;
+            case "decision":
+                return MemoryLevel.PERSISTENT;
+            default:
+                return MemoryLevel.SESSION;
+        }
+    }
+    // ── Row → Domain Object ────────────────────────────────────
+    rowToMemory(row) {
+        return {
+            id: row.id,
+            content: row.content,
+            type: row.type,
+            level: row.level,
+            userId: row.user_id,
+            sessionId: row.session_id,
+            projectId: row.project_id,
+            agentId: row.agent_id,
+            importance: row.importance,
+            tags: row.tags ? JSON.parse(row.tags) : [],
+            createdAt: row.created_at,
+            accessCount: row.access_count || 0,
+            lastAccessed: row.last_accessed || null,
+            pinned: row.pinned ?? 0,
+            embedding: row.embedding,
+        };
+    }
+    // ── Scoring / Ranking ──────────────────────────────────────
+    /**
+     * Rank memories by semantic similarity + temporal + access + type priors.
+     * Stability–plasticity balance:
+     *   semantic 65%, temporal 20%, access 10%, type 5%
+     */
+    semanticRank(memories, queryEmbedding, limit) {
+        const scored = memories.map((memory) => {
+            const embeddingBuffer = memory.embedding;
+            const embedding = embeddingBuffer
+                ? Array.from(new Float32Array(embeddingBuffer.buffer))
+                : null;
+            const isValid = embedding && embedding.some((v) => v !== 0);
+            const canCalc = isValid && embedding.length === queryEmbedding.length;
+            const semanticScore = canCalc
+                ? this.cosineSimilarity(queryEmbedding, embedding)
+                : 0.5;
+            const temporalScore = this.temporalScore(memory);
+            const accessBoost = this.accessBoost(memory.accessCount || 0);
+            const typeBoost = this.typeBoost(memory.type);
+            const score = semanticScore * 0.65 +
+                temporalScore * 0.2 +
+                accessBoost * 0.1 +
+                typeBoost * 0.05;
+            return { ...memory, score };
+        });
+        return scored.sort((a, b) => b.score - a.score).slice(0, limit);
+    }
+    // ── Private helpers ────────────────────────────────────────
+    cosineSimilarity(a, b) {
+        if (a.length !== b.length)
+            return 0;
+        let dot = 0;
+        let normA = 0;
+        let normB = 0;
+        for (let i = 0; i < a.length; i++) {
+            dot += a[i] * b[i];
+            normA += a[i] * a[i];
+            normB += b[i] * b[i];
+        }
+        const denom = Math.sqrt(normA) * Math.sqrt(normB);
+        return denom === 0 ? 0 : dot / denom;
+    }
+    /**
+     * Temporal salience curve — delegates to the pure, tested `decayScore`
+     * (Phase 1, borrowed from ai-memory decay.rs). Blends a recency-decayed
+     * salience term with an access-reinforcement term; pinned memories are
+     * exempt. Tunable via `config.memory.decay`.
+     */
+    temporalScore(memory) {
+        return decayScore({
+            importance: memory.importance,
+            accessCount: memory.accessCount,
+            createdAt: memory.createdAt,
+            lastAccessed: memory.lastAccessed,
+            pinned: memory.pinned,
+        }, config.get("memory").decay);
+    }
+    /**
+     * Log-curve access reinforcement with saturation.
+     */
+    accessBoost(accessCount) {
+        const normalized = Math.log1p(Math.max(0, accessCount)) / Math.log(20);
+        return Math.max(0.1, Math.min(1, normalized));
+    }
+    /**
+     * Small priors for reusable memory types.
+     */
+    typeBoost(type) {
+        switch (type) {
+            case MemoryType.DECISION:
+                return 1.0;
+            case MemoryType.PATTERN:
+                return 0.9;
+            case MemoryType.CRITICAL:
+                return 0.85;
+            case MemoryType.CODE:
+                return 0.8;
+            case MemoryType.CONVERSATION:
+            default:
+                return 0.7;
+        }
+    }
+}
+//# sourceMappingURL=memory-service.js.map

package/dist/services/memory/memory-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-service.js","sourceRoot":"","sources":["../../../src/services/memory/memory-service.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AACnE,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAE1D,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AA4BxC,gEAAgE;AAEhE,MAAM,OAAO,aAAa;IAChB,MAAM,CAAC,QAAQ,GAAyB,IAAI,CAAC;IAC7C,gBAAgB,CAAmB;IAE3C;QACE,IAAI,CAAC,gBAAgB,GAAG,IAAI,gBAAgB,EAAE,CAAC;IACjD,CAAC;IAED,MAAM,CAAC,WAAW;QAChB,IAAI,CAAC,aAAa,CAAC,QAAQ,EAAE,CAAC;YAC5B,aAAa,CAAC,QAAQ,GAAG,IAAI,aAAa,EAAE,CAAC;QAC/C,CAAC;QACD,OAAO,aAAa,CAAC,QAAQ,CAAC;IAChC,CAAC;IAED,8DAA8D;IAE9D,KAAK,CAAC,iBAAiB,CAAC,IAAY;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED,8DAA8D;IAE9D,UAAU,CAAC,IAAgB,EAAE,MAAe;QAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC5D,OAAO,GAAG,MAAM,IAAI,SAAS,IAAI,MAAM,GAAG,QAAQ,EAAE,CAAC;IACvD,CAAC;IAED,8DAA8D;IAE9D;;OAEG;IACH,cAAc,CACZ,IAAgB,EAChB,IAKC;QAED,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;QAEvD,4BAA4B;QAC5B,IAAI,OAAO,KAAK,cAAc,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,UAAU,CAAC,EAAE,CAAC;YAC/E,OAAO,WAAW,CAAC,UAAU,CAAC,CAAC,KAAK;QACtC,CAAC;QACD,IAAI,OAAO,KAAK,WAAW,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,UAAU,CAAC,EAAE,CAAC;YAC9F,OAAO,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK;QACnC,CAAC;QACD,IAAI,OAAO,KAAK,WAAW,IAAI,IAAI,KAAK,UAAU,EAAE,CAAC;YACnD,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC,KAAK;QAChC,CAAC;QAED,uBAAuB;QACvB,IAAI,SAAS;YAAE,OAAO,WAAW,CAAC,OAAO,CAAC;QAC1C,IAAI,MAAM,IAAI,CAAC,SAAS;YAAE,OAAO,WAAW,CAAC,IAAI,CAAC;QAClD,IAAI,SAAS;YAAE,OAAO,WAAW,CAAC,OAAO,CAAC;QAE1C,sBAAsB;QACtB,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,UAAU;gBACb,OAAO,WAAW,CAAC,IAAI,CAAC;YAC1B,KAAK,cAAc;gBACjB,OAAO,WAAW,CAAC,OAAO,CAAC;YAC7B,KAAK,MAAM,CAAC;YACZ,KAAK,SAAS;gBACZ,OAAO,WAAW,CAAC,OAAO,CAAC;YAC7B,KAAK,UAAU;gBACb,OAAO,WAAW,CAAC,UAAU,CAAC;YAChC;gBACE,OAAO,WAAW,CAAC,OAAO,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,8DAA8D;IAE9D,WAAW,CAAC,GAAc;QACxB,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,IAAI,EAAE,GAAG,CAAC,IAAkB;YAC5B,KAAK,EAAE,GAAG,CAAC,KAAoB;YAC/B,MAAM,EAAE,GAAG,CAAC,OAAO;YACnB,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,OAAO,EAAE,GAAG,CAAC,QAAQ;YACrB,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE;YAC1C,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,WAAW,EAAE,GAAG,CAAC,YAAY,IAAI,CAAC;YAClC,YAAY,EAAE,GAAG,CAAC,aAAa,IAAI,IAAI;YACvC,MAAM,EAAG,GAAiB,CAAC,MAAM,IAAI,CAAC;YACtC,SAAS,EAAE,GAAG,CAAC,SAAS;SACzB,CAAC;IACJ,CAAC;IAED,8DAA8D;IAE9D;;;;OAIG;IACH,YAAY,CACV,QAAkB,EAClB,cAAwB,EACxB,KAAa;QAEb,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;YACrC,MAAM,eAAe,GAAI,MAAc,CAAC,SAAS,CAAC;YAClD,MAAM,SAAS,GAAG,eAAe;gBAC/B,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;gBACtD,CAAC,CAAC,IAAI,CAAC;YAET,MAAM,OAAO,GAAG,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YAC5D,MAAM,OAAO,GACX,OAAO,IAAI,SAAU,CAAC,MAAM,KAAK,cAAc,CAAC,MAAM,CAAC;YAEzD,MAAM,aAAa,GAAG,OAAO;gBAC3B,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,SAAU,CAAC;gBACnD,CAAC,CAAC,GAAG,CAAC;YAER,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YACjD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;YAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAE9C,MAAM,KAAK,GACT,aAAa,GAAG,IAAI;gBACpB,aAAa,GAAG,GAAG;gBACnB,WAAW,GAAG,GAAG;gBACjB,SAAS,GAAG,IAAI,CAAC;YAEnB,OAAO,EAAE,GAAG,MAAM,EAAE,KAAK,EAAkB,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAClE,CAAC;IAED,8DAA8D;IAEtD,gBAAgB,CAAC,CAAW,EAAE,CAAW;QAC/C,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC;QAEpC,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;IACvC,CAAC;IAED;;;;;OAKG;IACK,aAAa,CAAC,MAAc;QAClC,OAAO,UAAU,CACf;YACE,UAAU,EAAE,MAAM,CAAC,UAAU;YAC7B,WAAW,EAAE,MAAM,CAAC,WAAW;YAC/B,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,YAAY,EAAE,MAAM,CAAC,YAAY;YACjC,MAAM,EAAE,MAAM,CAAC,MAAM;SACtB,EACD,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,KAAK,CAC3B,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,WAAmB;QACrC,MAAM,UAAU,GACd,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IAChD,CAAC;IAED;;OAEG;IACK,SAAS,CAAC,IAAgB;QAChC,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,UAAU,CAAC,QAAQ;gBACtB,OAAO,GAAG,CAAC;YACb,KAAK,UAAU,CAAC,OAAO;gBACrB,OAAO,GAAG,CAAC;YACb,KAAK,UAAU,CAAC,QAAQ;gBACtB,OAAO,IAAI,CAAC;YACd,KAAK,UAAU,CAAC,IAAI;gBAClB,OAAO,GAAG,CAAC;YACb,KAAK,UAAU,CAAC,YAAY,CAAC;YAC7B;gBACE,OAAO,GAAG,CAAC;QACf,CAAC;IACH,CAAC"}

package/dist/services/memory/redundancy-filter.d.ts

@@ -0,0 +1,26 @@
+export interface DuplicatePair {
+    keepId: string;
+    removeId: string;
+    similarity: number;
+    reason: string;
+}
+export interface MergeResult {
+    merged: number;
+    edgesTransferred: number;
+    accessCountsBoosted: number;
+}
+export interface CleanupStats {
+    duplicatesFound: number;
+    merged: number;
+    edgesTransferred: number;
+    durationMs: number;
+}
+export declare class RedundancyFilter {
+    private static instance;
+    static getInstance(): RedundancyFilter;
+    findDuplicates(threshold?: number, scanLimit?: number): Promise<DuplicatePair[]>;
+    mergeDuplicates(pairs: DuplicatePair[]): Promise<MergeResult>;
+    runCleanup(threshold?: number): Promise<CleanupStats>;
+    close(): void;
+}
+//# sourceMappingURL=redundancy-filter.d.ts.map

package/dist/services/memory/redundancy-filter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"redundancy-filter.d.ts","sourceRoot":"","sources":["../../../src/services/memory/redundancy-filter.ts"],"names":[],"mappings":"AAOA,MAAM,WAAW,aAAa;IAAG,MAAM,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;CAAE;AACxG,MAAM,WAAW,WAAW;IAAG,MAAM,EAAE,MAAM,CAAC;IAAC,gBAAgB,EAAE,MAAM,CAAC;IAAC,mBAAmB,EAAE,MAAM,CAAC;CAAE;AACvG,MAAM,WAAW,YAAY;IAAG,eAAe,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,gBAAgB,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;CAAE;AAExH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAiC;IACxD,MAAM,CAAC,WAAW,IAAI,gBAAgB;IAEhC,cAAc,CAAC,SAAS,SAAO,EAAE,SAAS,SAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IA4B3E,eAAe,CAAC,KAAK,EAAE,aAAa,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IA0B7D,UAAU,CAAC,SAAS,SAAO,GAAG,OAAO,CAAC,YAAY,CAAC;IAIzD,KAAK,IAAI,IAAI;CACd"}