kairo-mcp 1.3.0

package/dist/core/vector/chunking/memoryChunker.js

@@ -0,0 +1,202 @@
+import { readFile, readdir } from 'node:fs/promises';
+import { join } from 'node:path';
+import { scoreItems } from '../../salience/salienceEngine.js';
+import { resolveConfig, inferProfile, CRITICAL_DIRS } from '../../salience/config.js';
+/**
+ * Builds architecture-aware chunks (ADR-0005) across the five memory classes from
+ * artifacts Kairo already derives deterministically. It does NOT blindly chunk every
+ * file — structural knowledge comes from the salience-ranked module graph and repo
+ * intelligence, not a file dump.
+ */
+function fold(strings) {
+    return strings
+        .map((s) => s.trim())
+        .filter(Boolean)
+        .join(' — ');
+}
+export function chunkRepoIntelligence(intel) {
+    const chunks = [];
+    // Salience for graph groups, reusing the ADR-0004 subsystem.
+    const profile = inferProfile({
+        topLevelDirs: intel.inventory.topLevelDirs,
+        frameworkCategories: intel.frameworks.map((f) => f.category),
+    });
+    const ctx = {
+        sourceRoots: ['src', 'lib', 'app', 'sources', 'packages', 'apps', 'libs'],
+        entryPoints: intel.entryPoints.map((e) => e.path),
+        workspaceGlobs: [],
+        frameworkDirs: [...CRITICAL_DIRS],
+        profile,
+    };
+    const config = resolveConfig(profile);
+    const g = intel.moduleGraph;
+    const idToLabel = new Map(g.nodes.map((n) => [n.id, n.label]));
+    const neighbors = new Map();
+    const degree = new Map();
+    for (const e of g.edges) {
+        const a = idToLabel.get(e.from);
+        const b = idToLabel.get(e.to);
+        if (!neighbors.has(a))
+            neighbors.set(a, new Set());
+        if (!neighbors.has(b))
+            neighbors.set(b, new Set());
+        neighbors.get(a).add(b);
+        neighbors.get(b).add(a);
+        degree.set(a, (degree.get(a) ?? 0) + (e.weight ?? 1));
+        degree.set(b, (degree.get(b) ?? 0) + (e.weight ?? 1));
+    }
+    const items = g.nodes.map((n) => ({
+        id: n.label,
+        path: n.label,
+        metrics: { fanIn: degree.get(n.label) ?? 0, fanOut: degree.get(n.label) ?? 0 },
+    }));
+    const salience = new Map(scoreItems(items, ctx, config).map((s) => [s.id, s.score]));
+    // Structural overview.
+    chunks.push({
+        id: 'struct:overview',
+        kind: 'structural',
+        // Logical locator — never the absolute local path (it would leak into memory).
+        locator: '(repository)',
+        text: fold([
+            `Repository architecture overview.`,
+            `Primary language ${intel.languages.primary}.`,
+            `Frameworks: ${intel.frameworks.map((f) => f.name).join(', ') || 'none'}.`,
+            `Top-level: ${intel.inventory.topLevelDirs.join(', ')}.`,
+            `Entry points: ${intel.entryPoints.map((e) => e.path).join(', ') || 'none'}.`,
+            `${g.nodes.length} module groups, ${g.edges.length} dependency edges${g.truncated ? ' (truncated)' : ''}.`,
+        ]),
+        salience: 1.5,
+        graphDegree: g.edges.length,
+        runtimeReachable: true,
+        neighbors: [],
+    });
+    // One structural chunk per module group (already salience-ranked & capped).
+    for (const n of g.nodes) {
+        const nbrs = [...(neighbors.get(n.label) ?? [])].sort();
+        chunks.push({
+            id: `struct:mod:${n.label}`,
+            kind: 'structural',
+            locator: n.label,
+            text: fold([
+                `Module group "${n.label}".`,
+                nbrs.length ? `Depends-with: ${nbrs.join(', ')}.` : 'Leaf module.',
+                `Graph degree ${degree.get(n.label) ?? 0}.`,
+            ]),
+            salience: salience.get(n.label) ?? 0,
+            graphDegree: degree.get(n.label) ?? 0,
+            runtimeReachable: intel.entryPoints.some((e) => e.path.includes(n.label)),
+            neighbors: nbrs,
+        });
+    }
+    // Operational memory: build/test/deploy facts.
+    chunks.push({
+        id: 'op:tooling',
+        kind: 'operational',
+        locator: 'tooling',
+        text: fold([
+            `Build & operational profile.`,
+            `Frameworks/tooling: ${intel.frameworks.map((f) => `${f.name}${f.version ? `@${f.version}` : ''}`).join(', ')}.`,
+            intel.ciWorkflows.length
+                ? `CI workflows: ${intel.ciWorkflows.join(', ')}.`
+                : 'No CI detected.',
+        ]),
+        salience: 0.8,
+        graphDegree: 0,
+        runtimeReachable: false,
+        neighbors: [],
+    });
+    // Repo intelligence is shared knowledge — workspace namespace (ADR-0007).
+    return chunks.map((c) => ({ ...c, namespace: 'workspace' }));
+}
+export function chunkSessionMemory(sessions, checkpoint, 
+/** sessionId → coordination namespace; defaults to the shared workspace. */
+namespaceOf = () => 'workspace') {
+    const chunks = [];
+    // Decision memory (most recent first, bounded).
+    const decisions = sessions.flatMap((s) => s.decisions.map((d) => ({ d, sid: s.id }))).slice(-80);
+    for (const { d, sid } of decisions) {
+        chunks.push({
+            id: `decision:${sid}:${d.ts}`,
+            kind: 'decision',
+            locator: `session ${sid}`,
+            text: fold([
+                `Engineering decision: ${d.summary}.`,
+                d.rationale ? `Rationale: ${d.rationale}.` : '',
+            ]),
+            salience: 1.2,
+            graphDegree: 0,
+            runtimeReachable: false,
+            neighbors: [],
+            ts: d.ts,
+            namespace: namespaceOf(sid),
+        });
+    }
+    if (checkpoint) {
+        chunks.push({
+            id: `session:checkpoint:${checkpoint.id}`,
+            kind: 'session',
+            locator: `checkpoint ${checkpoint.id}`,
+            text: fold([
+                `Session checkpoint for task: ${checkpoint.task}.`,
+                checkpoint.remainingWork.length ? `Remaining: ${checkpoint.remainingWork.join('; ')}.` : '',
+                checkpoint.blockers.length ? `Blockers: ${checkpoint.blockers.join('; ')}.` : '',
+                `Risk ${checkpoint.risk.level}.`,
+            ]),
+            salience: 1.3,
+            graphDegree: 0,
+            runtimeReachable: false,
+            neighbors: [],
+            ts: checkpoint.createdAt,
+            // Checkpoints are team-level engineering continuity → shared (v0.7.1).
+            // (Private *reasoning* stays in worker-namespaced decision chunks.)
+            namespace: 'workspace',
+        });
+    }
+    return chunks;
+}
+const DOC_DIRS = ['docs', 'docs/adr'];
+const ROOT_DOCS = ['README.md', 'ARCHITECTURE.md', 'CONTRIBUTING.md', 'SECURITY.md'];
+const MAX_DOC_BYTES = 64 * 1024;
+/** Decision/semantic memory from ADRs and architecture docs (bounded). */
+export async function chunkDocs(projectRoot) {
+    const out = [];
+    const tryFile = async (rel, kind, salience) => {
+        try {
+            const buf = await readFile(join(projectRoot, rel), 'utf8');
+            const text = buf.slice(0, MAX_DOC_BYTES).replace(/\s+/g, ' ').trim();
+            if (text.length < 40)
+                return;
+            out.push({
+                id: `doc:${rel}`,
+                kind,
+                locator: rel,
+                text: `${rel}: ${text.slice(0, 4000)}`,
+                salience,
+                graphDegree: 0,
+                runtimeReachable: false,
+                neighbors: [],
+            });
+        }
+        catch {
+            /* missing/unreadable doc: skip */
+        }
+    };
+    for (const d of ROOT_DOCS)
+        await tryFile(d, 'semantic', 0.9);
+    for (const dir of DOC_DIRS) {
+        let entries = [];
+        try {
+            entries = (await readdir(join(projectRoot, dir))).filter((f) => f.endsWith('.md')).sort();
+        }
+        catch {
+            continue;
+        }
+        for (const f of entries) {
+            const rel = `${dir}/${f}`;
+            await tryFile(rel, dir.includes('adr') ? 'decision' : 'semantic', dir.includes('adr') ? 1.3 : 0.9);
+        }
+    }
+    // Docs/ADRs are shared knowledge — workspace namespace (ADR-0007).
+    return out.map((c) => ({ ...c, namespace: 'workspace' }));
+}
+//# sourceMappingURL=memoryChunker.js.map

package/dist/core/vector/chunking/memoryChunker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoryChunker.js","sourceRoot":"","sources":["../../../../src/core/vector/chunking/memoryChunker.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAIjC,OAAO,EAAE,UAAU,EAAE,MAAM,kCAAkC,CAAC;AAC9D,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAGtF;;;;;GAKG;AACH,SAAS,IAAI,CAAC,OAAiB;IAC7B,OAAO,OAAO;SACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;SACpB,MAAM,CAAC,OAAO,CAAC;SACf,IAAI,CAAC,KAAK,CAAC,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,KAAuB;IAC3D,MAAM,MAAM,GAAkB,EAAE,CAAC;IAEjC,6DAA6D;IAC7D,MAAM,OAAO,GAAG,YAAY,CAAC;QAC3B,YAAY,EAAE,KAAK,CAAC,SAAS,CAAC,YAAY;QAC1C,mBAAmB,EAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;KAC7D,CAAC,CAAC;IACH,MAAM,GAAG,GAAoB;QAC3B,WAAW,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,CAAC;QACzE,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;QACjD,cAAc,EAAE,EAAE;QAClB,aAAa,EAAE,CAAC,GAAG,aAAa,CAAC;QACjC,OAAO;KACR,CAAC;IACF,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IAEtC,MAAM,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC;IAC5B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC;QACjC,MAAM,CAAC,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACnD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACnD,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,MAAM,KAAK,GAAmB,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAChD,EAAE,EAAE,CAAC,CAAC,KAAK;QACX,IAAI,EAAE,CAAC,CAAC,KAAK;QACb,OAAO,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE;KAC/E,CAAC,CAAC,CAAC;IACJ,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAErF,uBAAuB;IACvB,MAAM,CAAC,IAAI,CAAC;QACV,EAAE,EAAE,iBAAiB;QACrB,IAAI,EAAE,YAAY;QAClB,+EAA+E;QAC/E,OAAO,EAAE,cAAc;QACvB,IAAI,EAAE,IAAI,CAAC;YACT,mCAAmC;YACnC,oBAAoB,KAAK,CAAC,SAAS,CAAC,OAAO,GAAG;YAC9C,eAAe,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG;YAC1E,cAAc,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;YACxD,iBAAiB,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,MAAM,GAAG;YAC7E,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,mBAAmB,CAAC,CAAC,KAAK,CAAC,MAAM,oBAAoB,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,GAAG;SAC3G,CAAC;QACF,QAAQ,EAAE,GAAG;QACb,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM;QAC3B,gBAAgB,EAAE,IAAI;QACtB,SAAS,EAAE,EAAE;KACd,CAAC,CAAC;IAEH,4EAA4E;IAC5E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACxD,MAAM,CAAC,IAAI,CAAC;YACV,EAAE,EAAE,cAAc,CAAC,CAAC,KAAK,EAAE;YAC3B,IAAI,EAAE,YAAY;YAClB,OAAO,EAAE,CAAC,CAAC,KAAK;YAChB,IAAI,EAAE,IAAI,CAAC;gBACT,iBAAiB,CAAC,CAAC,KAAK,IAAI;gBAC5B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,iBAAiB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc;gBAClE,gBAAgB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG;aAC5C,CAAC;YACF,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;YACpC,WAAW,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC;YACrC,gBAAgB,EAAE,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YACzE,SAAS,EAAE,IAAI;SAChB,CAAC,CAAC;IACL,CAAC;IAED,+CAA+C;IAC/C,MAAM,CAAC,IAAI,CAAC;QACV,EAAE,EAAE,YAAY;QAChB,IAAI,EAAE,aAAa;QACnB,OAAO,EAAE,SAAS;QAClB,IAAI,EAAE,IAAI,CAAC;YACT,8BAA8B;YAC9B,uBAAuB,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;YAChH,KAAK,CAAC,WAAW,CAAC,MAAM;gBACtB,CAAC,CAAC,iBAAiB,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;gBAClD,CAAC,CAAC,iBAAiB;SACtB,CAAC;QACF,QAAQ,EAAE,GAAG;QACb,WAAW,EAAE,CAAC;QACd,gBAAgB,EAAE,KAAK;QACvB,SAAS,EAAE,EAAE;KACd,CAAC,CAAC;IAEH,0EAA0E;IAC1E,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED,MAAM,UAAU,kBAAkB,CAChC,QAAwB,EACxB,UAAkC;AAClC,4EAA4E;AAC5E,cAA6C,GAAG,EAAE,CAAC,WAAW;IAE9D,MAAM,MAAM,GAAkB,EAAE,CAAC;IAEjC,gDAAgD;IAChD,MAAM,SAAS,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IACjG,KAAK,MAAM,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,SAAS,EAAE,CAAC;QACnC,MAAM,CAAC,IAAI,CAAC;YACV,EAAE,EAAE,YAAY,GAAG,IAAI,CAAC,CAAC,EAAE,EAAE;YAC7B,IAAI,EAAE,UAAU;YAChB,OAAO,EAAE,WAAW,GAAG,EAAE;YACzB,IAAI,EAAE,IAAI,CAAC;gBACT,yBAAyB,CAAC,CAAC,OAAO,GAAG;gBACrC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,EAAE;aAChD,CAAC;YACF,QAAQ,EAAE,GAAG;YACb,WAAW,EAAE,CAAC;YACd,gBAAgB,EAAE,KAAK;YACvB,SAAS,EAAE,EAAE;YACb,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,SAAS,EAAE,WAAW,CAAC,GAAG,CAAC;SAC5B,CAAC,CAAC;IACL,CAAC;IAED,IAAI,UAAU,EAAE,CAAC;QACf,MAAM,CAAC,IAAI,CAAC;YACV,EAAE,EAAE,sBAAsB,UAAU,CAAC,EAAE,EAAE;YACzC,IAAI,EAAE,SAAS;YACf,OAAO,EAAE,cAAc,UAAU,CAAC,EAAE,EAAE;YACtC,IAAI,EAAE,IAAI,CAAC;gBACT,gCAAgC,UAAU,CAAC,IAAI,GAAG;gBAClD,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,cAAc,UAAU,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gBAC3F,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,aAAa,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gBAChF,QAAQ,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG;aACjC,CAAC;YACF,QAAQ,EAAE,GAAG;YACb,WAAW,EAAE,CAAC;YACd,gBAAgB,EAAE,KAAK;YACvB,SAAS,EAAE,EAAE;YACb,EAAE,EAAE,UAAU,CAAC,SAAS;YACxB,uEAAuE;YACvE,oEAAoE;YACpE,SAAS,EAAE,WAAW;SACvB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,QAAQ,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;AACtC,MAAM,SAAS,GAAG,CAAC,WAAW,EAAE,iBAAiB,EAAE,iBAAiB,EAAE,aAAa,CAAC,CAAC;AACrF,MAAM,aAAa,GAAG,EAAE,GAAG,IAAI,CAAC;AAEhC,0EAA0E;AAC1E,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,WAAmB;IACjD,MAAM,GAAG,GAAkB,EAAE,CAAC;IAC9B,MAAM,OAAO,GAAG,KAAK,EACnB,GAAW,EACX,IAAyB,EACzB,QAAgB,EACD,EAAE;QACjB,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;YAC3D,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;YACrE,IAAI,IAAI,CAAC,MAAM,GAAG,EAAE;gBAAE,OAAO;YAC7B,GAAG,CAAC,IAAI,CAAC;gBACP,EAAE,EAAE,OAAO,GAAG,EAAE;gBAChB,IAAI;gBACJ,OAAO,EAAE,GAAG;gBACZ,IAAI,EAAE,GAAG,GAAG,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE;gBACtC,QAAQ;gBACR,WAAW,EAAE,CAAC;gBACd,gBAAgB,EAAE,KAAK;gBACvB,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;QACL,CAAC;QAAC,MAAM,CAAC;YACP,kCAAkC;QACpC,CAAC;IACH,CAAC,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,MAAM,OAAO,CAAC,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,CAAC;IAC7D,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,IAAI,OAAO,GAAa,EAAE,CAAC;QAC3B,IAAI,CAAC;YACH,OAAO,GAAG,CAAC,MAAM,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5F,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,OAAO,CACX,GAAG,EACH,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,EAC7C,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAChC,CAAC;QACJ,CAAC;IACH,CAAC;IACD,mEAAmE;IACnE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,SAAS,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;AAC5D,CAAC"}

package/dist/core/vector/compression/architectureDigest.d.ts

@@ -0,0 +1,12 @@
+import type { MemoryChunk } from '../types.js';
+/**
+ * Deterministic architecture compression (ADR-0005): turn the full memory set into a
+ * compact, salience-ordered digest an agent can read instead of rescanning the repo.
+ * Heuristic and bounded — stated honestly. Not an LLM summary; a structured extract.
+ */
+export interface DigestOptions {
+    maxStructural?: number;
+    maxDecisions?: number;
+}
+export declare function architectureDigest(chunks: MemoryChunk[], opts?: DigestOptions): string;
+//# sourceMappingURL=architectureDigest.d.ts.map

package/dist/core/vector/compression/architectureDigest.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"architectureDigest.d.ts","sourceRoot":"","sources":["../../../../src/core/vector/compression/architectureDigest.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE/C;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC5B,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE,IAAI,GAAE,aAAkB,GAAG,MAAM,CAwC1F"}

package/dist/core/vector/compression/architectureDigest.js

@@ -0,0 +1,37 @@
+export function architectureDigest(chunks, opts = {}) {
+    const byKind = (k) => chunks
+        .filter((c) => c.kind === k)
+        .sort((a, b) => b.salience - a.salience || (a.id < b.id ? -1 : 1));
+    const overview = chunks.find((c) => c.id === 'struct:overview');
+    const structural = byKind('structural')
+        .filter((c) => c.id !== 'struct:overview')
+        .slice(0, opts.maxStructural ?? 12);
+    const decisions = byKind('decision').slice(0, opts.maxDecisions ?? 8);
+    const operational = byKind('operational').slice(0, 3);
+    const lines = ['# Compressed Architectural Memory', ''];
+    if (overview)
+        lines.push(`> ${overview.text}`, '');
+    if (structural.length) {
+        lines.push('## Salient modules');
+        for (const c of structural) {
+            lines.push(`- **${c.locator}** (salience ${c.salience.toFixed(2)}, deg ${c.graphDegree})` +
+                `${c.neighbors.length ? ` ↔ ${c.neighbors.slice(0, 6).join(', ')}` : ''}`);
+        }
+        lines.push('');
+    }
+    if (decisions.length) {
+        lines.push('## Key decisions');
+        for (const c of decisions)
+            lines.push(`- ${c.text}`);
+        lines.push('');
+    }
+    if (operational.length) {
+        lines.push('## Operational');
+        for (const c of operational)
+            lines.push(`- ${c.text}`);
+        lines.push('');
+    }
+    lines.push('_Deterministic salience-ordered extract (heuristic). Use kairo_memory_search for targeted recall._');
+    return lines.join('\n');
+}
+//# sourceMappingURL=architectureDigest.js.map

package/dist/core/vector/compression/architectureDigest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"architectureDigest.js","sourceRoot":"","sources":["../../../../src/core/vector/compression/architectureDigest.ts"],"names":[],"mappings":"AAYA,MAAM,UAAU,kBAAkB,CAAC,MAAqB,EAAE,OAAsB,EAAE;IAChF,MAAM,MAAM,GAAG,CAAC,CAAsB,EAAiB,EAAE,CACvD,MAAM;SACH,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC;SAC3B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvE,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,CAAC;IAChE,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC;SACpC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC;SACzC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,aAAa,IAAI,EAAE,CAAC,CAAC;IACtC,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC,CAAC;IACtE,MAAM,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtD,MAAM,KAAK,GAAa,CAAC,mCAAmC,EAAE,EAAE,CAAC,CAAC;IAClE,IAAI,QAAQ;QAAE,KAAK,CAAC,IAAI,CAAC,KAAK,QAAQ,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;IAEnD,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;QACtB,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CACR,OAAO,CAAC,CAAC,OAAO,gBAAgB,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,WAAW,GAAG;gBAC5E,GAAG,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAC5E,CAAC;QACJ,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,SAAS,CAAC,MAAM,EAAE,CAAC;QACrB,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACrD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IACD,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;QACvB,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,WAAW;YAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACvD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IACD,KAAK,CAAC,IAAI,CACR,oGAAoG,CACrG,CAAC;IACF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/core/vector/embedding/deterministicEmbedder.d.ts

@@ -0,0 +1,10 @@
+import type { Embedder } from '../types.js';
+export declare class DeterministicEmbedder implements Embedder {
+    readonly id = "kairo-deterministic-hash-v1";
+    readonly dim = 256;
+    embed(text: string): number[];
+}
+export declare function cosine(a: number[], b: number[]): number;
+export declare function getEmbedder(id?: string): Embedder;
+export declare function registerEmbedder(id: string, factory: () => Embedder): void;
+//# sourceMappingURL=deterministicEmbedder.d.ts.map

package/dist/core/vector/embedding/deterministicEmbedder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"deterministicEmbedder.d.ts","sourceRoot":"","sources":["../../../../src/core/vector/embedding/deterministicEmbedder.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAsC5C,qBAAa,qBAAsB,YAAW,QAAQ;IACpD,QAAQ,CAAC,EAAE,iCAAiC;IAC5C,QAAQ,CAAC,GAAG,OAAO;IAEnB,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;CAkB9B;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAMvD;AAOD,wBAAgB,WAAW,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,QAAQ,CAGjD;AAED,wBAAgB,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,QAAQ,GAAG,IAAI,CAE1E"}

package/dist/core/vector/embedding/deterministicEmbedder.js

@@ -0,0 +1,84 @@
+import { createHash } from 'node:crypto';
+/**
+ * Deterministic, local, zero-dependency embedder (ADR-0005).
+ *
+ * HONEST SCOPE: this is **lexical/structural** similarity — a hashed bag of
+ * code/identifier/path tokens with sub-token splitting and bigrams, L2-normalised.
+ * It is NOT deep semantic similarity. It is the default because it is pure
+ * (byte-identical across runs/machines — required to seed stable memory), needs no
+ * network or secrets, and Kairo's hybrid ranking (salience/graph/runtime) carries
+ * the architecture awareness. Semantic providers are pluggable behind `Embedder`.
+ */
+const DIM = 256;
+function tokenize(text) {
+    const out = [];
+    // Split on non-alphanumerics; also split camelCase / snake / kebab into parts.
+    for (const rawTok of text.toLowerCase().split(/[^a-z0-9]+/)) {
+        if (!rawTok)
+            continue;
+        out.push(rawTok);
+        for (const part of rawTok.split(/(?<=[a-z])(?=[0-9])|_/)) {
+            if (part && part !== rawTok)
+                out.push(part);
+        }
+    }
+    // Adjacent bigrams add a little word-order signal without losing determinism.
+    const bigrams = [];
+    for (let i = 1; i < out.length; i++)
+        bigrams.push(`${out[i - 1]}~${out[i]}`);
+    return [...out, ...bigrams];
+}
+/** Stable signed bucket from a token (sha1 → bucket + sign). */
+function hashToken(token) {
+    const h = createHash('sha1').update(token).digest();
+    const bucket = ((h[0] << 16) | (h[1] << 8) | h[2]) % DIM;
+    const sign = (h[3] & 1) === 0 ? 1 : -1;
+    return { bucket, sign };
+}
+export class DeterministicEmbedder {
+    id = 'kairo-deterministic-hash-v1';
+    dim = DIM;
+    embed(text) {
+        const vec = new Array(DIM).fill(0);
+        const tokens = tokenize(text);
+        if (tokens.length === 0)
+            return vec;
+        // Sublinear term weighting damps very repetitive text.
+        const tf = new Map();
+        for (const t of tokens)
+            tf.set(t, (tf.get(t) ?? 0) + 1);
+        for (const [tok, count] of tf) {
+            const { bucket, sign } = hashToken(tok);
+            vec[bucket] += sign * (1 + Math.log(count));
+        }
+        let norm = 0;
+        for (const v of vec)
+            norm += v * v;
+        norm = Math.sqrt(norm);
+        if (norm === 0)
+            return vec;
+        for (let i = 0; i < DIM; i++)
+            vec[i] = Number((vec[i] / norm).toFixed(8));
+        return vec;
+    }
+}
+export function cosine(a, b) {
+    let dot = 0;
+    const n = Math.min(a.length, b.length);
+    for (let i = 0; i < n; i++)
+        dot += a[i] * b[i];
+    // Vectors are pre-normalised, so dot == cosine. Clamp for float safety.
+    return Math.max(-1, Math.min(1, Number(dot.toFixed(8))));
+}
+/** Provider registry — keeps the door open without hardwiring a provider. */
+const REGISTRY = new Map([
+    ['kairo-deterministic-hash-v1', () => new DeterministicEmbedder()],
+]);
+export function getEmbedder(id) {
+    const factory = id ? REGISTRY.get(id) : undefined;
+    return factory ? factory() : new DeterministicEmbedder();
+}
+export function registerEmbedder(id, factory) {
+    REGISTRY.set(id, factory);
+}
+//# sourceMappingURL=deterministicEmbedder.js.map

package/dist/core/vector/embedding/deterministicEmbedder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"deterministicEmbedder.js","sourceRoot":"","sources":["../../../../src/core/vector/embedding/deterministicEmbedder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAGzC;;;;;;;;;GASG;AACH,MAAM,GAAG,GAAG,GAAG,CAAC;AAEhB,SAAS,QAAQ,CAAC,IAAY;IAC5B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,+EAA+E;IAC/E,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;QAC5D,IAAI,CAAC,MAAM;YAAE,SAAS;QACtB,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,CAAC,uBAAuB,CAAC,EAAE,CAAC;YACzD,IAAI,IAAI,IAAI,IAAI,KAAK,MAAM;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IACD,8EAA8E;IAC9E,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,OAAO,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7E,OAAO,CAAC,GAAG,GAAG,EAAE,GAAG,OAAO,CAAC,CAAC;AAC9B,CAAC;AAED,gEAAgE;AAChE,SAAS,SAAS,CAAC,KAAa;IAC9B,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;IACpD,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC,GAAG,GAAG,CAAC;IAC5D,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;AAC1B,CAAC;AAED,MAAM,OAAO,qBAAqB;IACvB,EAAE,GAAG,6BAA6B,CAAC;IACnC,GAAG,GAAG,GAAG,CAAC;IAEnB,KAAK,CAAC,IAAY;QAChB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QACpC,uDAAuD;QACvD,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;YAC9B,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC;YACxC,GAAG,CAAC,MAAM,CAAE,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC/C,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,MAAM,CAAC,IAAI,GAAG;YAAE,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,IAAI,KAAK,CAAC;YAAE,OAAO,GAAG,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE;YAAE,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3E,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAED,MAAM,UAAU,MAAM,CAAC,CAAW,EAAE,CAAW;IAC7C,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;IACjD,wEAAwE;IACxE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED,6EAA6E;AAC7E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAyB;IAC/C,CAAC,6BAA6B,EAAE,GAAG,EAAE,CAAC,IAAI,qBAAqB,EAAE,CAAC;CACnE,CAAC,CAAC;AAEH,MAAM,UAAU,WAAW,CAAC,EAAW;IACrC,MAAM,OAAO,GAAG,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClD,OAAO,OAAO,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,qBAAqB,EAAE,CAAC;AAC3D,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,EAAU,EAAE,OAAuB;IAClE,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;AAC5B,CAAC"}

package/dist/core/vector/memory/memoryEngine.d.ts

@@ -0,0 +1,56 @@
+import type { StorageAdapter } from '../../../storage/storageAdapter.js';
+import type { RepoIntelligence } from '../../repo/types.js';
+import type { Checkpoint, SessionState } from '../../../types/domain.js';
+import type { MemoryChunk, RetrievalQuery, RetrievalResult } from '../types.js';
+import type { EmbeddingProvider } from '../providers/types.js';
+import { type RankContext } from '../retrieval/hybridRetriever.js';
+export interface IndexInputs {
+    intel: RepoIntelligence;
+    sessions: SessionState[];
+    checkpoint: Checkpoint | undefined;
+    projectRoot: string;
+    /** sessionId → coordination namespace (v0.7.0); defaults to shared workspace. */
+    namespaceOf?: (sessionId: string) => string;
+}
+export interface IndexResult {
+    fingerprint: string;
+    embedderId: string;
+    memoryFingerprint: string;
+    chunks: number;
+    reused: boolean;
+    /** True if a configured remote provider failed and deterministic was used. */
+    fellBack: boolean;
+    /** v0.9.3: per-chunk incremental indexing counters. */
+    embedded: number;
+    reusedVectors: number;
+}
+/**
+ * Facade over chunking + embedding provider + storage + retrieval (ADR-0006).
+ *
+ * The index is keyed by repo fingerprint + embedder id: a match means NO re-embedding.
+ * A configured remote provider that errors degrades to the deterministic provider —
+ * an embedding outage must never break a session, and the index is stamped with the
+ * provider ACTUALLY used so a remote-labelled index never holds fallback vectors.
+ */
+export declare class MemoryEngine {
+    private readonly adapter;
+    private readonly primary;
+    private readonly fallback;
+    constructor(adapter: StorageAdapter, provider?: EmbeddingProvider);
+    buildChunks(inputs: IndexInputs): Promise<MemoryChunk[]>;
+    /** Embed via the primary provider; on remote failure fall back to deterministic. */
+    private embedAll;
+    index(inputs: IndexInputs, force?: boolean): Promise<IndexResult>;
+    /** Load only an index whose embedder matches the active primary provider. */
+    private loadValid;
+    search(query: RetrievalQuery, ctx?: RankContext): Promise<RetrievalResult[]>;
+    compress(): Promise<string | undefined>;
+    stats(): Promise<{
+        chunks: number;
+        embedderId: string;
+        fingerprint: string;
+        memoryFingerprint: string;
+        dim: number;
+    } | undefined>;
+}
+//# sourceMappingURL=memoryEngine.d.ts.map

package/dist/core/vector/memory/memoryEngine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoryEngine.d.ts","sourceRoot":"","sources":["../../../../src/core/vector/memory/memoryEngine.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oCAAoC,CAAC;AACzE,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAC5D,OAAO,KAAK,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AACzE,OAAO,KAAK,EAEV,WAAW,EACX,cAAc,EACd,eAAe,EAEhB,MAAM,aAAa,CAAC;AAErB,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAG/D,OAAO,EAAY,KAAK,WAAW,EAAE,MAAM,iCAAiC,CAAC;AAK7E,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,gBAAgB,CAAC;IACxB,QAAQ,EAAE,YAAY,EAAE,CAAC;IACzB,UAAU,EAAE,UAAU,GAAG,SAAS,CAAC;IACnC,WAAW,EAAE,MAAM,CAAC;IACpB,iFAAiF;IACjF,WAAW,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,KAAK,MAAM,CAAC;CAC7C;AAED,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,OAAO,CAAC;IAChB,8EAA8E;IAC9E,QAAQ,EAAE,OAAO,CAAC;IAClB,uDAAuD;IACvD,QAAQ,EAAE,MAAM,CAAC;IACjB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;;;;;GAOG;AACH,qBAAa,YAAY;IAKrB,OAAO,CAAC,QAAQ,CAAC,OAAO;IAJ1B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAoB;IAC5C,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAoB;gBAG1B,OAAO,EAAE,cAAc,EACxC,QAAQ,CAAC,EAAE,iBAAiB;IAiBxB,WAAW,CAAC,MAAM,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC;IAY9D,oFAAoF;YACtE,QAAQ;IAkBhB,KAAK,CAAC,MAAM,EAAE,WAAW,EAAE,KAAK,UAAQ,GAAG,OAAO,CAAC,WAAW,CAAC;IAkGrE,6EAA6E;YAC/D,SAAS;IASjB,MAAM,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,GAAE,WAAgB,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAehF,QAAQ,IAAI,OAAO,CAAC,MAAM,GAAG,SAAS,CAAC;IAKvC,KAAK,IAAI,OAAO,CAClB;QACE,MAAM,EAAE,MAAM,CAAC;QACf,UAAU,EAAE,MAAM,CAAC;QACnB,WAAW,EAAE,MAAM,CAAC;QACpB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,GAAG,EAAE,MAAM,CAAC;KACb,GACD,SAAS,CACZ;CAYF"}

package/dist/core/vector/memory/memoryEngine.js

@@ -0,0 +1,204 @@
+import { createHash } from 'node:crypto';
+import { resolveProviderFromEnv, deterministicProvider } from '../providers/registry.js';
+import { chunkRepoIntelligence, chunkSessionMemory, chunkDocs } from '../chunking/memoryChunker.js';
+import { retrieve } from '../retrieval/hybridRetriever.js';
+import { architectureDigest } from '../compression/architectureDigest.js';
+import { computeMemoryFingerprint } from './memoryFingerprint.js';
+import { logger } from '../../../utils/logger.js';
+/**
+ * Facade over chunking + embedding provider + storage + retrieval (ADR-0006).
+ *
+ * The index is keyed by repo fingerprint + embedder id: a match means NO re-embedding.
+ * A configured remote provider that errors degrades to the deterministic provider —
+ * an embedding outage must never break a session, and the index is stamped with the
+ * provider ACTUALLY used so a remote-labelled index never holds fallback vectors.
+ */
+export class MemoryEngine {
+    adapter;
+    primary;
+    fallback;
+    constructor(adapter, provider) {
+        this.adapter = adapter;
+        this.fallback = deterministicProvider();
+        let resolved;
+        try {
+            resolved = provider ?? resolveProviderFromEnv();
+        }
+        catch (e) {
+            logger.warn(`Embedding provider misconfigured; using deterministic. ${e instanceof Error ? e.message : String(e)}`);
+            resolved = this.fallback;
+        }
+        this.primary = resolved;
+    }
+    async buildChunks(inputs) {
+        return [
+            ...chunkRepoIntelligence(inputs.intel),
+            ...chunkSessionMemory(inputs.sessions, inputs.checkpoint, inputs.namespaceOf ?? (() => 'workspace')),
+            ...(await chunkDocs(inputs.projectRoot)),
+        ];
+    }
+    /** Embed via the primary provider; on remote failure fall back to deterministic. */
+    async embedAll(texts) {
+        try {
+            const vectors = await this.primary.embedBatch(texts);
+            return { vectors, provider: this.primary, fellBack: false };
+        }
+        catch (e) {
+            if (!this.primary.remote)
+                throw e; // deterministic failing is a real bug
+            logger.warn(`Embedding provider ${this.primary.id} failed; falling back to deterministic. ${e instanceof Error ? e.message : String(e)}`);
+            const vectors = await this.fallback.embedBatch(texts);
+            return { vectors, provider: this.fallback, fellBack: true };
+        }
+    }
+    async index(inputs, force = false) {
+        // Build chunks first (cheap, offline, deterministic). Only the embed step is
+        // skipped on a true match — so session/decision/checkpoint changes cannot make
+        // cross-worker memory stale (v0.7.1).
+        const chunks = await this.buildChunks(inputs);
+        const memoryFingerprint = computeMemoryFingerprint(chunks);
+        const existing = await this.adapter.loadVectorIndex();
+        if (!force &&
+            existing &&
+            existing.schema === 3 &&
+            existing.fingerprint === inputs.intel.fingerprint &&
+            existing.embedderId === this.primary.id &&
+            existing.memoryFingerprint === memoryFingerprint) {
+            return {
+                fingerprint: existing.fingerprint,
+                embedderId: existing.embedderId,
+                memoryFingerprint: existing.memoryFingerprint,
+                chunks: existing.chunks.length,
+                reused: true,
+                fellBack: false,
+                embedded: 0,
+                reusedVectors: existing.chunks.length,
+            };
+        }
+        // ── v0.9.3 incremental indexing ──────────────────────────────────────
+        // Build a lookup of existing vectors keyed by text-hash. Reuse vectors
+        // for any chunk whose text matches an existing chunk; only embed the
+        // ones that don't. Deterministic chunk ordering is preserved.
+        const reusable = existing &&
+            existing.schema === 3 &&
+            existing.embedderId === this.primary.id &&
+            existing.fingerprint === inputs.intel.fingerprint
+            ? indexByTextHash(existing.chunks)
+            : new Map();
+        const toEmbed = [];
+        const reusedVectors = Array.from({ length: chunks.length });
+        for (let i = 0; i < chunks.length; i++) {
+            const c = chunks[i];
+            const hash = textHash(c.text);
+            const v = reusable.get(hash);
+            if (v)
+                reusedVectors[i] = v;
+            else
+                toEmbed.push({ i, text: c.text });
+        }
+        let fellBack = false;
+        let provider = this.primary;
+        const finalVectors = Array.from({ length: chunks.length }, () => []);
+        if (toEmbed.length === 0) {
+            provider = this.primary;
+        }
+        else {
+            const r = await this.embedAll(toEmbed.map((t) => t.text));
+            provider = r.provider;
+            fellBack = r.fellBack;
+            for (let k = 0; k < toEmbed.length; k++) {
+                finalVectors[toEmbed[k].i] = r.vectors[k];
+            }
+        }
+        for (let i = 0; i < chunks.length; i++) {
+            if (reusedVectors[i])
+                finalVectors[i] = reusedVectors[i];
+        }
+        const embedded = chunks.map((c, i) => ({ ...c, vector: finalVectors[i] }));
+        const idx = {
+            schema: 3,
+            fingerprint: inputs.intel.fingerprint,
+            memoryFingerprint,
+            embedderId: provider.id, // the provider ACTUALLY used
+            dim: provider.dim,
+            builtAt: new Date(0).toISOString(), // deterministic; freshness via fingerprints
+            chunks: embedded,
+        };
+        await this.adapter.saveVectorIndex(idx);
+        const embeddedCount = toEmbed.length;
+        const reusedCount = chunks.length - embeddedCount;
+        logger.info('Vector memory indexed', {
+            chunks: embedded.length,
+            embedder: provider.id,
+            embedded: embeddedCount,
+            reused: reusedCount,
+            fellBack,
+        });
+        return {
+            fingerprint: idx.fingerprint,
+            embedderId: idx.embedderId,
+            memoryFingerprint: idx.memoryFingerprint,
+            chunks: embedded.length,
+            reused: false,
+            fellBack,
+            embedded: embeddedCount,
+            reusedVectors: reusedCount,
+        };
+    }
+    /** Load only an index whose embedder matches the active primary provider. */
+    async loadValid() {
+        const idx = await this.adapter.loadVectorIndex();
+        if (!idx || idx.schema !== 3)
+            return undefined;
+        if (idx.embedderId !== this.primary.id && idx.embedderId !== this.fallback.id) {
+            return undefined;
+        }
+        return idx;
+    }
+    async search(query, ctx = {}) {
+        const idx = await this.loadValid();
+        if (!idx)
+            return [];
+        // Query must be embedded with the SAME provider that built the index.
+        const useFallback = idx.embedderId === this.fallback.id && this.primary.id !== idx.embedderId;
+        let qVec;
+        try {
+            qVec = (await (useFallback ? this.fallback : this.primary).embed(query.text)) ?? [];
+        }
+        catch {
+            if (this.primary.remote)
+                qVec = await this.fallback.embed(query.text);
+            else
+                throw new Error('deterministic query embedding failed');
+        }
+        return retrieve(query, idx.chunks, qVec, ctx);
+    }
+    async compress() {
+        const idx = await this.loadValid();
+        return idx ? architectureDigest(idx.chunks) : undefined;
+    }
+    async stats() {
+        const idx = await this.loadValid();
+        return idx
+            ? {
+                chunks: idx.chunks.length,
+                embedderId: idx.embedderId,
+                fingerprint: idx.fingerprint,
+                memoryFingerprint: idx.memoryFingerprint,
+                dim: idx.dim,
+            }
+            : undefined;
+    }
+}
+function textHash(text) {
+    return createHash('sha256').update(text).digest('hex');
+}
+function indexByTextHash(chunks) {
+    const m = new Map();
+    for (const c of chunks) {
+        if (!m.has(textHash(c.text)))
+            m.set(textHash(c.text), c.vector);
+    }
+    return m;
+}
+//# sourceMappingURL=memoryEngine.js.map