@0xmaxma/claude-gateway 1.6.8 → 1.7.0

package/dist/agent/knowledge/indexer.js

@@ -0,0 +1,271 @@
+"use strict";
+/**
+ * Archive indexer (planning-64 K0).
+ *
+ * Walks an agent's memory files, chunks each, tags provenance, and writes them
+ * into the per-agent `kb.sqlite`. Hash-guarded: an unchanged file is skipped;
+ * a changed file is re-chunked and its stale chunks replaced; a file that
+ * disappeared is pruned. Deterministic (timestamps come from file mtime, not the
+ * wall clock) so a reindex of unchanged files is a true no-op.
+ *
+ * Synchronous by construction (node:sqlite + fs). Callers MUST invoke this OFF
+ * the gateway event loop (nightly dreaming spawn / out-of-process). K0 does not
+ * wire it into any gateway runtime path — it is dormant until K1.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.archiveDbPath = archiveDbPath;
+exports.indexAgentArchive = indexAgentArchive;
+exports.indexSharedArchive = indexSharedArchive;
+const path = __importStar(require("path"));
+const fs = __importStar(require("fs"));
+const crypto = __importStar(require("crypto"));
+const archive_db_1 = require("./archive-db");
+const chunk_1 = require("./chunk");
+const provenance_1 = require("./provenance");
+const lifecycle_1 = require("./lifecycle");
+const config_1 = require("./config");
+const wiki_1 = require("./wiki");
+/** Evergreen core files (indexed even though they live at the workspace root). */
+const EVERGREEN_FILES = ['MEMORY.md', 'USER.md'];
+/** Default location of an agent's archive DB (sibling to history.db). */
+function archiveDbPath(workspaceDir) {
+    // workspaceDir = agents/<id>/workspace ; the DB lives at agents/<id>/kb.sqlite
+    return path.join(path.dirname(workspaceDir), 'kb.sqlite');
+}
+/** Recursively collect `*.md` files under a directory, as absolute paths. */
+function walkMarkdown(dir) {
+    const out = [];
+    let entries;
+    try {
+        entries = fs.readdirSync(dir, { withFileTypes: true });
+    }
+    catch {
+        return out;
+    }
+    // Sort for deterministic index order across runs/platforms.
+    entries.sort((a, b) => (a.name < b.name ? -1 : a.name > b.name ? 1 : 0));
+    for (const e of entries) {
+        // Skip dotfiles — in particular a `.tmp-*` file left by a crashed shared-note
+        // write must never be indexed as a real note.
+        if (e.name.startsWith('.'))
+            continue;
+        const full = path.join(dir, e.name);
+        if (e.isDirectory())
+            out.push(...walkMarkdown(full));
+        else if (e.isFile() && e.name.toLowerCase().endsWith('.md'))
+            out.push(full);
+    }
+    return out;
+}
+/** The set of memory files to index for an agent (absolute paths). */
+function collectSourceFiles(workspaceDir) {
+    const files = [];
+    for (const name of EVERGREEN_FILES) {
+        const p = path.join(workspaceDir, name);
+        if (fs.existsSync(p) && fs.statSync(p).isFile())
+            files.push(p);
+    }
+    files.push(...walkMarkdown(path.join(workspaceDir, 'memory')));
+    return files;
+}
+function sha256(content) {
+    return crypto.createHash('sha256').update(content).digest('hex');
+}
+/** Workspace-relative POSIX path (for storage + provenance classification). */
+function relPosix(workspaceDir, absFile) {
+    return path.relative(workspaceDir, absFile).split(path.sep).join('/');
+}
+/** The entry_hash of the block a chunk starts in, or null if it starts outside any. */
+function blockHashForLine(blocks, line) {
+    for (const b of blocks) {
+        if (line >= b.startLine && line <= b.endLine)
+            return b.entryHash;
+    }
+    return null;
+}
+/**
+ * Index one agent's archive. Returns per-run counts. A no-op (returns zeroed
+ * counts) when the archive is disabled.
+ *
+ * @param workspaceDir the agent's workspace dir (agents/<id>/workspace)
+ * @param agentCfg     per-agent `gateway.knowledge.archive` override
+ * @param globalCfg    global `gateway.knowledge.archive`
+ */
+function indexAgentArchive(workspaceDir, agentCfg, globalCfg) {
+    const cfg = (0, config_1.resolveArchiveConfig)(agentCfg, globalCfg);
+    const empty = {
+        filesSeen: 0,
+        filesIndexed: 0,
+        filesSkipped: 0,
+        filesRemoved: 0,
+        chunksWritten: 0,
+    };
+    if (!cfg.enabled)
+        return empty;
+    const db = archive_db_1.ArchiveDB.forPath(archiveDbPath(workspaceDir), cfg.tokenizer);
+    return reindexInto(db, {
+        baseDir: workspaceDir,
+        files: collectSourceFiles(workspaceDir),
+        chunkTokens: cfg.chunkTokens,
+        chunkOverlap: cfg.chunkOverlap,
+        originFn: provenance_1.classifyOrigin,
+        source: 'memory',
+        projectKey: null,
+    });
+}
+/**
+ * Shared indexing core (used by both the per-agent and shared archives):
+ * hash-guarded chunk+provenance write of each file, then prune only files that
+ * genuinely disappeared. Deterministic (mtime-based) so unchanged input is a
+ * true no-op.
+ */
+function reindexInto(db, opts) {
+    const result = {
+        filesSeen: 0,
+        filesIndexed: 0,
+        filesSkipped: 0,
+        filesRemoved: 0,
+        chunksWritten: 0,
+    };
+    const seenRel = new Set();
+    for (const abs of opts.files) {
+        let content;
+        let stat;
+        try {
+            stat = fs.statSync(abs);
+            content = fs.readFileSync(abs, 'utf8');
+        }
+        catch {
+            continue; // race: file vanished mid-walk — treat as not present
+        }
+        const rel = relPosix(opts.baseDir, abs);
+        seenRel.add(rel);
+        result.filesSeen++;
+        const hash = sha256(content);
+        const existing = db.getSource(rel);
+        if (existing && existing.hash === hash) {
+            result.filesSkipped++; // hash-guarded: unchanged, no re-chunk
+            continue;
+        }
+        const mtime = Math.floor(stat.mtimeMs);
+        const origin = opts.originFn(rel);
+        const chunks = (0, chunk_1.chunkMarkdown)(content, opts.chunkTokens, opts.chunkOverlap);
+        // Entry-lifecycle identity (planning-66): only archive-tier files get an
+        // entry_hash (evergreen Lane-1, pinned files and the shared vault are exempt,
+        // so the GC can never consider them). Each FTS chunk inherits the entry_hash of
+        // the markdown block it starts in; blocks are the clean, movable unit the GC
+        // operates on (chunks are overlapping token windows and must never be moved).
+        const blocks = opts.source === 'memory' && (0, lifecycle_1.isArchiveTierPath)(rel) ? (0, lifecycle_1.parseEntryBlocks)(content) : [];
+        const rows = chunks.map((c) => ({
+            chunk: {
+                id: `${rel}#${c.startLine}-${c.endLine}`,
+                path: rel,
+                startLine: c.startLine,
+                endLine: c.endLine,
+                text: c.text,
+                updatedAt: mtime,
+            },
+            recall: { importance: null, triggers: null, projectKey: opts.projectKey },
+            provenance: {
+                originClass: origin,
+                sessionKind: 'unknown', // file-indexed content carries no session context
+                observedAt: mtime,
+                supersedesKey: null,
+            },
+            entryHash: blocks.length ? blockHashForLine(blocks, c.startLine) : null,
+        }));
+        db.replaceSource({ path: rel, hash, mtime, size: stat.size, source: opts.source }, rows, blocks.map((b) => ({ entryHash: b.entryHash, firstSeen: mtime })));
+        result.filesIndexed++;
+        result.chunksWritten += rows.length;
+    }
+    // Prune sources whose file genuinely disappeared. A file that still exists but
+    // whose stat/read threw a TRANSIENT error this run (EMFILE/EACCES/EINTR) is not
+    // in `seenRel` either — but it must NOT be pruned, or a live note silently loses
+    // its index between runs. Confirm real absence on disk before deleting.
+    for (const rel of db.listSourcePaths()) {
+        if (seenRel.has(rel))
+            continue;
+        if (fs.existsSync(path.join(opts.baseDir, rel)))
+            continue; // present but unreadable this run — keep
+        db.deleteSource(rel);
+        result.filesRemoved++;
+    }
+    return result;
+}
+/**
+ * Index the SHARED, cross-agent vault (planning-64 K3): every `*.md` under the
+ * project's `notes/` dir is chunked into the shared `kb.sqlite`. Shared notes are
+ * authored by the owner's own agents (same trust domain) → provenance `agent`.
+ * No-op when shared KB is disabled. Runs OFF the gateway event loop, same as the
+ * per-agent indexer.
+ */
+function indexSharedArchive(agentCfg, globalCfg) {
+    const empty = {
+        filesSeen: 0,
+        filesIndexed: 0,
+        filesSkipped: 0,
+        filesRemoved: 0,
+        chunksWritten: 0,
+    };
+    const cfg = (0, config_1.resolveSharedConfig)(agentCfg, globalCfg);
+    if (!cfg.enabled)
+        return empty;
+    const notesDir = (0, config_1.sharedNotesDir)(cfg);
+    const db = archive_db_1.ArchiveDB.forPath((0, config_1.sharedDbPath)(cfg), config_1.ARCHIVE_DEFAULTS.tokenizer);
+    const result = reindexInto(db, {
+        baseDir: notesDir,
+        files: walkMarkdown(notesDir),
+        chunkTokens: config_1.ARCHIVE_DEFAULTS.chunkTokens,
+        chunkOverlap: config_1.ARCHIVE_DEFAULTS.chunkOverlap,
+        originFn: () => 'agent',
+        source: 'shared',
+        projectKey: cfg.project,
+    });
+    // K5 (opt-in): compile the memory-wiki graph + dashboards over the whole vault.
+    // Best-effort — a compile failure never affects indexing. mtime-free determinism
+    // is not required here (reports are regenerated each run), so wall-clock `now` is
+    // used for the staleness dashboard.
+    if (cfg.graph) {
+        try {
+            (0, wiki_1.compileWiki)((0, config_1.sharedVaultDir)(cfg), Date.now());
+        }
+        catch {
+            /* best-effort */
+        }
+    }
+    return result;
+}
+//# sourceMappingURL=indexer.js.map

package/dist/agent/knowledge/indexer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexer.js","sourceRoot":"","sources":["../../../src/agent/knowledge/indexer.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;GAYG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BH,sCAGC;AA4DD,8CAyBC;AA0GD,gDAsCC;AApQD,2CAA6B;AAC7B,uCAAyB;AACzB,+CAAiC;AACjC,6CAAwD;AACxD,mCAAwC;AACxC,6CAA8C;AAC9C,2CAAmF;AACnF,qCAOkB;AAClB,iCAAqC;AASrC,kFAAkF;AAClF,MAAM,eAAe,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;AAEjD,yEAAyE;AACzE,SAAgB,aAAa,CAAC,YAAoB;IAChD,+EAA+E;IAC/E,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,WAAW,CAAC,CAAC;AAC5D,CAAC;AAED,6EAA6E;AAC7E,SAAS,YAAY,CAAC,GAAW;IAC/B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,IAAI,OAAoB,CAAC;IACzB,IAAI,CAAC;QACH,OAAO,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;IACzD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,GAAG,CAAC;IACb,CAAC;IACD,4DAA4D;IAC5D,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzE,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,8EAA8E;QAC9E,8CAA8C;QAC9C,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS;QACrC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,CAAC,WAAW,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;aAChD,IAAI,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9E,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,sEAAsE;AACtE,SAAS,kBAAkB,CAAC,YAAoB;IAC9C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACxC,IAAI,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC/D,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,MAAM,CAAC,OAAe;IAC7B,OAAO,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACnE,CAAC;AAED,+EAA+E;AAC/E,SAAS,QAAQ,CAAC,YAAoB,EAAE,OAAe;IACrD,OAAO,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxE,CAAC;AAED,uFAAuF;AACvF,SAAS,gBAAgB,CAAC,MAAoB,EAAE,IAAY;IAC1D,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,IAAI,IAAI,CAAC,CAAC,SAAS,IAAI,IAAI,IAAI,CAAC,CAAC,OAAO;YAAE,OAAO,CAAC,CAAC,SAAS,CAAC;IACnE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,iBAAiB,CAC/B,YAAoB,EACpB,QAAiC,EACjC,SAAkC;IAElC,MAAM,GAAG,GAAgC,IAAA,6BAAoB,EAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IACnF,MAAM,KAAK,GAAgB;QACzB,SAAS,EAAE,CAAC;QACZ,YAAY,EAAE,CAAC;QACf,YAAY,EAAE,CAAC;QACf,YAAY,EAAE,CAAC;QACf,aAAa,EAAE,CAAC;KACjB,CAAC;IACF,IAAI,CAAC,GAAG,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAE/B,MAAM,EAAE,GAAG,sBAAS,CAAC,OAAO,CAAC,aAAa,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;IACzE,OAAO,WAAW,CAAC,EAAE,EAAE;QACrB,OAAO,EAAE,YAAY;QACrB,KAAK,EAAE,kBAAkB,CAAC,YAAY,CAAC;QACvC,WAAW,EAAE,GAAG,CAAC,WAAW;QAC5B,YAAY,EAAE,GAAG,CAAC,YAAY;QAC9B,QAAQ,EAAE,2BAAc;QACxB,MAAM,EAAE,QAAQ;QAChB,UAAU,EAAE,IAAI;KACjB,CAAC,CAAC;AACL,CAAC;AAYD;;;;;GAKG;AACH,SAAS,WAAW,CAAC,EAAa,EAAE,IAAiB;IACnD,MAAM,MAAM,GAAgB;QAC1B,SAAS,EAAE,CAAC;QACZ,YAAY,EAAE,CAAC;QACf,YAAY,EAAE,CAAC;QACf,YAAY,EAAE,CAAC;QACf,aAAa,EAAE,CAAC;KACjB,CAAC;IACF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,OAAe,CAAC;QACpB,IAAI,IAAc,CAAC;QACnB,IAAI,CAAC;YACH,IAAI,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACxB,OAAO,GAAG,EAAE,CAAC,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACzC,CAAC;QAAC,MAAM,CAAC;YACP,SAAS,CAAC,sDAAsD;QAClE,CAAC;QACD,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,MAAM,CAAC,SAAS,EAAE,CAAC;QAEnB,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC;QAC7B,MAAM,QAAQ,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACvC,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,uCAAuC;YAC9D,SAAS;QACX,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,IAAA,qBAAa,EAAC,OAAO,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3E,yEAAyE;QACzE,8EAA8E;QAC9E,gFAAgF;QAChF,6EAA6E;QAC7E,8EAA8E;QAC9E,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,IAAA,6BAAiB,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAA,4BAAgB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnG,MAAM,IAAI,GAAoB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/C,KAAK,EAAE;gBACL,EAAE,EAAE,GAAG,GAAG,IAAI,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,OAAO,EAAE;gBACxC,IAAI,EAAE,GAAG;gBACT,SAAS,EAAE,CAAC,CAAC,SAAS;gBACtB,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,SAAS,EAAE,KAAK;aACjB;YACD,MAAM,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,CAAC,UAAU,EAAE;YACzE,UAAU,EAAE;gBACV,WAAW,EAAE,MAAM;gBACnB,WAAW,EAAE,SAAS,EAAE,kDAAkD;gBAC1E,UAAU,EAAE,KAAK;gBACjB,aAAa,EAAE,IAAI;aACpB;YACD,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI;SACxE,CAAC,CAAC,CAAC;QAEJ,EAAE,CAAC,aAAa,CACd,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,EAChE,IAAI,EACJ,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,CAAC,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,CAClE,CAAC;QACF,MAAM,CAAC,YAAY,EAAE,CAAC;QACtB,MAAM,CAAC,aAAa,IAAI,IAAI,CAAC,MAAM,CAAC;IACtC,CAAC;IAED,+EAA+E;IAC/E,gFAAgF;IAChF,iFAAiF;IACjF,wEAAwE;IACxE,KAAK,MAAM,GAAG,IAAI,EAAE,CAAC,eAAe,EAAE,EAAE,CAAC;QACvC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC/B,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YAAE,SAAS,CAAC,yCAAyC;QACpG,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,CAAC,YAAY,EAAE,CAAC;IACxB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,kBAAkB,CAChC,QAAgC,EAChC,SAAiC;IAEjC,MAAM,KAAK,GAAgB;QACzB,SAAS,EAAE,CAAC;QACZ,YAAY,EAAE,CAAC;QACf,YAAY,EAAE,CAAC;QACf,YAAY,EAAE,CAAC;QACf,aAAa,EAAE,CAAC;KACjB,CAAC;IACF,MAAM,GAAG,GAAG,IAAA,4BAAmB,EAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IACrD,IAAI,CAAC,GAAG,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAE/B,MAAM,QAAQ,GAAG,IAAA,uBAAc,EAAC,GAAG,CAAC,CAAC;IACrC,MAAM,EAAE,GAAG,sBAAS,CAAC,OAAO,CAAC,IAAA,qBAAY,EAAC,GAAG,CAAC,EAAE,yBAAgB,CAAC,SAAS,CAAC,CAAC;IAC5E,MAAM,MAAM,GAAG,WAAW,CAAC,EAAE,EAAE;QAC7B,OAAO,EAAE,QAAQ;QACjB,KAAK,EAAE,YAAY,CAAC,QAAQ,CAAC;QAC7B,WAAW,EAAE,yBAAgB,CAAC,WAAW;QACzC,YAAY,EAAE,yBAAgB,CAAC,YAAY;QAC3C,QAAQ,EAAE,GAAG,EAAE,CAAC,OAAO;QACvB,MAAM,EAAE,QAAQ;QAChB,UAAU,EAAE,GAAG,CAAC,OAAO;KACxB,CAAC,CAAC;IAEH,gFAAgF;IAChF,iFAAiF;IACjF,kFAAkF;IAClF,oCAAoC;IACpC,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QACd,IAAI,CAAC;YACH,IAAA,kBAAW,EAAC,IAAA,uBAAc,EAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;QAC/C,CAAC;QAAC,MAAM,CAAC;YACP,iBAAiB;QACnB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/agent/knowledge/lifecycle.d.ts

@@ -0,0 +1,91 @@
+/**
+ * Archive entry lifecycle helpers (planning-66).
+ *
+ * The Lane-2 archive (`memory/*.md` → `kb.sqlite` → `memory_search`) accumulates
+ * stale / superseded entries with no stable per-entry identity to decide staleness
+ * from: the FTS chunk id is line-based (`${rel}#${start}-${end}`) and dies on every
+ * re-chunk, and `updated_at`/`observed_at` are file mtime (re-stamped on any edit).
+ *
+ * This module gives every archive ENTRY a reindex-surviving identity — a content
+ * hash of its normalized text (`entryHash`) — plus the two pure primitives the GC
+ * needs: a markdown-block parser (an "entry" = a top-level bullet or an h3–h6 entry
+ * header + its body, the same archivable unit the compactor moves) and deterministic
+ * supersession detection (a replacement verb + `#N` marks the older `#N` entry
+ * superseded). Everything here is pure — no I/O, no clock — so it is exhaustively
+ * testable and safe to call from the indexer and the nightly GC alike.
+ *
+ * Identity is block-level (not chunk-level) on purpose: FTS chunks are token-window
+ * slices with overlap (`chunk.ts`), so moving a chunk's raw lines would corrupt an
+ * overlapping neighbour. Blocks are clean markdown units, so the GC moves whole
+ * blocks. Each FTS chunk simply inherits the `entryHash` of the block it starts in,
+ * which is what the read-path recall counter is keyed to.
+ */
+/** Pinned archive files are searchable but structurally exempt from GC. */
+export declare const PINNED_PREFIX = "memory/pinned/";
+/**
+ * True when a workspace-relative path is a GC-eligible archive-tier entry source
+ * (planning-66). The archive tier is `memory/**.md`, EXCEPT:
+ *   - evergreen Lane-1 (`MEMORY.md`/`USER.md` at the root) — never touched,
+ *   - pinned files (`memory/pinned/**`) — searchable but never aged out.
+ * Only these files get an `entry_hash` + lifecycle row; everything else (evergreen,
+ * pinned, the shared vault) has no lifecycle, so the GC can never consider it.
+ */
+export declare function isArchiveTierPath(rel: string): boolean;
+/** A parsed archive entry block with its 1-indexed inclusive line range. */
+export interface EntryBlock {
+    text: string;
+    startLine: number;
+    endLine: number;
+    entryHash: string;
+}
+/**
+ * Normalize entry text for hashing: collapse every run of whitespace (including
+ * newlines) to a single space and trim. A block re-chunked, re-indented, or
+ * reflowed keeps the SAME hash — so its lifecycle (age, recall, invalidation)
+ * survives cosmetic edits. A genuine content change yields a new hash, which is
+ * correct: it is a new fact, so it starts a fresh age.
+ */
+export declare function normalizeEntryText(s: string): string;
+/** Stable content identity for an archive entry: sha256 of its normalized text. */
+export declare function entryHash(s: string): string;
+/**
+ * Parse an archive markdown file into its entry blocks. An entry is either:
+ *   - a top-level bullet (`- `/`* ` at column 0) plus its contiguous non-blank,
+ *     non-header, non-bullet continuation lines, or
+ *   - an h3–h6 entry header plus its body up to the next header or blank line.
+ * h1/h2 section titles, blank lines and free prose are NOT entries (they are
+ * structure, never moved). Mirrors the compactor's block model so the GC and the
+ * compactor agree on what a movable unit is. Line ranges are 1-indexed inclusive.
+ */
+export declare function parseEntryBlocks(content: string): EntryBlock[];
+/**
+ * A replacement marker: an explicit supersession verb immediately followed by an
+ * issue/PR reference `#N`. Case-INSENSITIVE on the verb but the `#N` is required,
+ * so prose like "Closes #12", "merged into develop", or a bare "#12" never
+ * matches — only "supersedes #316" / "replaces #12" / "obsoletes #7". Mirrors the
+ * compactor's precision-over-recall stance: a false supersession only soft-
+ * invalidates (still searchable), never deletes, but we keep it tight anyway.
+ */
+export declare const SUPERSEDE_RE: RegExp;
+/** All distinct `#N` numbers a block references (its candidate identities/targets). */
+export declare function referencedIds(text: string): Set<number>;
+/** The `#N` numbers a block declares it supersedes (verb + `#N`). */
+export declare function supersededIds(text: string): Set<number>;
+/** One resolved supersession: `targetHash` is superseded by `bySpec`. */
+export interface Supersession {
+    targetHash: string;
+    bySpec: string;
+}
+/**
+ * Deterministically resolve which entries are superseded, over a set of blocks
+ * (the whole archive tier). For every block B that declares "supersedes #N", any
+ * OTHER block A that references `#N` is marked superseded-by-B. Precision guards:
+ *   - the trigger requires the verb+`#N` form (referencing `#N` alone is not a
+ *     trigger — only a target),
+ *   - a block never supersedes itself,
+ *   - a block that itself supersedes something is not eligible to be a target of
+ *     the same `#N` (the newer, superseding entry stays live).
+ * Returns one entry per superseded target hash (last writer wins on conflict).
+ */
+export declare function detectSupersessions(blocks: EntryBlock[]): Supersession[];
+//# sourceMappingURL=lifecycle.d.ts.map

package/dist/agent/knowledge/lifecycle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle.d.ts","sourceRoot":"","sources":["../../../src/agent/knowledge/lifecycle.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAIH,2EAA2E;AAC3E,eAAO,MAAM,aAAa,mBAAmB,CAAC;AAE9C;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAKtD;AAED,4EAA4E;AAC5E,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAEpD;AAED,mFAAmF;AACnF,wBAAgB,SAAS,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAE3C;AAQD;;;;;;;;GAQG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,UAAU,EAAE,CAqC9D;AAED;;;;;;;GAOG;AACH,eAAO,MAAM,YAAY,QAA8D,CAAC;AAExF,uFAAuF;AACvF,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAIvD;AAED,qEAAqE;AACrE,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAIvD;AAED,yEAAyE;AACzE,MAAM,WAAW,YAAY;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,UAAU,EAAE,GAAG,YAAY,EAAE,CAkBxE"}

package/dist/agent/knowledge/lifecycle.js

@@ -0,0 +1,205 @@
+"use strict";
+/**
+ * Archive entry lifecycle helpers (planning-66).
+ *
+ * The Lane-2 archive (`memory/*.md` → `kb.sqlite` → `memory_search`) accumulates
+ * stale / superseded entries with no stable per-entry identity to decide staleness
+ * from: the FTS chunk id is line-based (`${rel}#${start}-${end}`) and dies on every
+ * re-chunk, and `updated_at`/`observed_at` are file mtime (re-stamped on any edit).
+ *
+ * This module gives every archive ENTRY a reindex-surviving identity — a content
+ * hash of its normalized text (`entryHash`) — plus the two pure primitives the GC
+ * needs: a markdown-block parser (an "entry" = a top-level bullet or an h3–h6 entry
+ * header + its body, the same archivable unit the compactor moves) and deterministic
+ * supersession detection (a replacement verb + `#N` marks the older `#N` entry
+ * superseded). Everything here is pure — no I/O, no clock — so it is exhaustively
+ * testable and safe to call from the indexer and the nightly GC alike.
+ *
+ * Identity is block-level (not chunk-level) on purpose: FTS chunks are token-window
+ * slices with overlap (`chunk.ts`), so moving a chunk's raw lines would corrupt an
+ * overlapping neighbour. Blocks are clean markdown units, so the GC moves whole
+ * blocks. Each FTS chunk simply inherits the `entryHash` of the block it starts in,
+ * which is what the read-path recall counter is keyed to.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SUPERSEDE_RE = exports.PINNED_PREFIX = void 0;
+exports.isArchiveTierPath = isArchiveTierPath;
+exports.normalizeEntryText = normalizeEntryText;
+exports.entryHash = entryHash;
+exports.parseEntryBlocks = parseEntryBlocks;
+exports.referencedIds = referencedIds;
+exports.supersededIds = supersededIds;
+exports.detectSupersessions = detectSupersessions;
+const crypto = __importStar(require("crypto"));
+/** Pinned archive files are searchable but structurally exempt from GC. */
+exports.PINNED_PREFIX = 'memory/pinned/';
+/**
+ * True when a workspace-relative path is a GC-eligible archive-tier entry source
+ * (planning-66). The archive tier is `memory/**.md`, EXCEPT:
+ *   - evergreen Lane-1 (`MEMORY.md`/`USER.md` at the root) — never touched,
+ *   - pinned files (`memory/pinned/**`) — searchable but never aged out.
+ * Only these files get an `entry_hash` + lifecycle row; everything else (evergreen,
+ * pinned, the shared vault) has no lifecycle, so the GC can never consider it.
+ */
+function isArchiveTierPath(rel) {
+    const p = rel.replace(/\\/g, '/');
+    if (p === 'MEMORY.md' || p === 'USER.md')
+        return false;
+    if (p.startsWith(exports.PINNED_PREFIX))
+        return false;
+    return p.startsWith('memory/') && p.endsWith('.md');
+}
+/**
+ * Normalize entry text for hashing: collapse every run of whitespace (including
+ * newlines) to a single space and trim. A block re-chunked, re-indented, or
+ * reflowed keeps the SAME hash — so its lifecycle (age, recall, invalidation)
+ * survives cosmetic edits. A genuine content change yields a new hash, which is
+ * correct: it is a new fact, so it starts a fresh age.
+ */
+function normalizeEntryText(s) {
+    return s.replace(/\s+/g, ' ').trim();
+}
+/** Stable content identity for an archive entry: sha256 of its normalized text. */
+function entryHash(s) {
+    return crypto.createHash('sha256').update(normalizeEntryText(s)).digest('hex');
+}
+const TOP_BULLET_RE = /^[-*] /;
+const HEADER_RE = /^#{1,6} /;
+/** h3–h6 can be a completed-entry header; h1/h2 are structural sections. */
+const ENTRY_HEADER_RE = /^#{3,6} /;
+const BLANK_RE = /^\s*$/;
+/**
+ * Parse an archive markdown file into its entry blocks. An entry is either:
+ *   - a top-level bullet (`- `/`* ` at column 0) plus its contiguous non-blank,
+ *     non-header, non-bullet continuation lines, or
+ *   - an h3–h6 entry header plus its body up to the next header or blank line.
+ * h1/h2 section titles, blank lines and free prose are NOT entries (they are
+ * structure, never moved). Mirrors the compactor's block model so the GC and the
+ * compactor agree on what a movable unit is. Line ranges are 1-indexed inclusive.
+ */
+function parseEntryBlocks(content) {
+    const lines = content.split('\n');
+    const blocks = [];
+    for (let i = 0; i < lines.length; i++) {
+        const line = lines[i];
+        if (ENTRY_HEADER_RE.test(line)) {
+            const blockLines = [line];
+            let j = i + 1;
+            while (j < lines.length && !BLANK_RE.test(lines[j]) && !HEADER_RE.test(lines[j])) {
+                blockLines.push(lines[j]);
+                j++;
+            }
+            const text = blockLines.join('\n');
+            blocks.push({ text, startLine: i + 1, endLine: j, entryHash: entryHash(text) });
+            i = j - 1;
+            continue;
+        }
+        if (TOP_BULLET_RE.test(line)) {
+            const blockLines = [line];
+            let j = i + 1;
+            while (j < lines.length &&
+                !BLANK_RE.test(lines[j]) &&
+                !HEADER_RE.test(lines[j]) &&
+                !TOP_BULLET_RE.test(lines[j])) {
+                blockLines.push(lines[j]);
+                j++;
+            }
+            const text = blockLines.join('\n');
+            blocks.push({ text, startLine: i + 1, endLine: j, entryHash: entryHash(text) });
+            i = j - 1;
+            continue;
+        }
+        // h1/h2 section titles, blanks, prose → not an entry.
+    }
+    return blocks;
+}
+/**
+ * A replacement marker: an explicit supersession verb immediately followed by an
+ * issue/PR reference `#N`. Case-INSENSITIVE on the verb but the `#N` is required,
+ * so prose like "Closes #12", "merged into develop", or a bare "#12" never
+ * matches — only "supersedes #316" / "replaces #12" / "obsoletes #7". Mirrors the
+ * compactor's precision-over-recall stance: a false supersession only soft-
+ * invalidates (still searchable), never deletes, but we keep it tight anyway.
+ */
+exports.SUPERSEDE_RE = /\b(?:supersed(?:e|es|ed)|replaces?|obsoletes?)\s+#(\d+)/gi;
+/** All distinct `#N` numbers a block references (its candidate identities/targets). */
+function referencedIds(text) {
+    const ids = new Set();
+    for (const m of text.matchAll(/#(\d+)\b/g))
+        ids.add(Number(m[1]));
+    return ids;
+}
+/** The `#N` numbers a block declares it supersedes (verb + `#N`). */
+function supersededIds(text) {
+    const ids = new Set();
+    for (const m of text.matchAll(exports.SUPERSEDE_RE))
+        ids.add(Number(m[1]));
+    return ids;
+}
+/**
+ * Deterministically resolve which entries are superseded, over a set of blocks
+ * (the whole archive tier). For every block B that declares "supersedes #N", any
+ * OTHER block A that references `#N` is marked superseded-by-B. Precision guards:
+ *   - the trigger requires the verb+`#N` form (referencing `#N` alone is not a
+ *     trigger — only a target),
+ *   - a block never supersedes itself,
+ *   - a block that itself supersedes something is not eligible to be a target of
+ *     the same `#N` (the newer, superseding entry stays live).
+ * Returns one entry per superseded target hash (last writer wins on conflict).
+ */
+function detectSupersessions(blocks) {
+    const out = new Map();
+    for (const b of blocks) {
+        const supersedes = supersededIds(b.text);
+        if (supersedes.size === 0)
+            continue;
+        for (const a of blocks) {
+            if (a.entryHash === b.entryHash)
+                continue; // never supersede self
+            if (supersededIds(a.text).size > 0)
+                continue; // the newer superseding entry stays live
+            const aIds = referencedIds(a.text);
+            for (const n of supersedes) {
+                if (aIds.has(n)) {
+                    out.set(a.entryHash, b.entryHash);
+                    break;
+                }
+            }
+        }
+    }
+    return Array.from(out, ([targetHash, bySpec]) => ({ targetHash, bySpec }));
+}
+//# sourceMappingURL=lifecycle.js.map

package/dist/agent/knowledge/lifecycle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lifecycle.js","sourceRoot":"","sources":["../../../src/agent/knowledge/lifecycle.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAeH,8CAKC;AAiBD,gDAEC;AAGD,8BAEC;AAiBD,4CAqCC;AAaD,sCAIC;AAGD,sCAIC;AAmBD,kDAkBC;AA7JD,+CAAiC;AAEjC,2EAA2E;AAC9D,QAAA,aAAa,GAAG,gBAAgB,CAAC;AAE9C;;;;;;;GAOG;AACH,SAAgB,iBAAiB,CAAC,GAAW;IAC3C,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,KAAK,WAAW,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACvD,IAAI,CAAC,CAAC,UAAU,CAAC,qBAAa,CAAC;QAAE,OAAO,KAAK,CAAC;IAC9C,OAAO,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;AACtD,CAAC;AAUD;;;;;;GAMG;AACH,SAAgB,kBAAkB,CAAC,CAAS;IAC1C,OAAO,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACvC,CAAC;AAED,mFAAmF;AACnF,SAAgB,SAAS,CAAC,CAAS;IACjC,OAAO,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AACjF,CAAC;AAED,MAAM,aAAa,GAAG,QAAQ,CAAC;AAC/B,MAAM,SAAS,GAAG,UAAU,CAAC;AAC7B,4EAA4E;AAC5E,MAAM,eAAe,GAAG,UAAU,CAAC;AACnC,MAAM,QAAQ,GAAG,OAAO,CAAC;AAEzB;;;;;;;;GAQG;AACH,SAAgB,gBAAgB,CAAC,OAAe;IAC9C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,MAAM,MAAM,GAAiB,EAAE,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjF,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,CAAC,EAAE,CAAC;YACN,CAAC;YACD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChF,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,SAAS;QACX,CAAC;QACD,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,OACE,CAAC,GAAG,KAAK,CAAC,MAAM;gBAChB,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACxB,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;gBACzB,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAC7B,CAAC;gBACD,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1B,CAAC,EAAE,CAAC;YACN,CAAC;YACD,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChF,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,SAAS;QACX,CAAC;QACD,sDAAsD;IACxD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;GAOG;AACU,QAAA,YAAY,GAAG,2DAA2D,CAAC;AAExF,uFAAuF;AACvF,SAAgB,aAAa,CAAC,IAAY;IACxC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;QAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,OAAO,GAAG,CAAC;AACb,CAAC;AAED,qEAAqE;AACrE,SAAgB,aAAa,CAAC,IAAY;IACxC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,oBAAY,CAAC;QAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,OAAO,GAAG,CAAC;AACb,CAAC;AAQD;;;;;;;;;;GAUG;AACH,SAAgB,mBAAmB,CAAC,MAAoB;IACtD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QACpC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,SAAS;gBAAE,SAAS,CAAC,uBAAuB;YAClE,IAAI,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC;gBAAE,SAAS,CAAC,yCAAyC;YACvF,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACnC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC3B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;oBAClC,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,UAAU,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;AAC7E,CAAC"}

package/dist/agent/knowledge/provenance.d.ts

@@ -0,0 +1,15 @@
+/**
+ * Classify the trust/origin of an indexed file by its workspace-relative path.
+ *
+ * Mirrors openclaw memory-core `resolveMemoryPathClassification`, adapted to our
+ * layout. FAIL-CLOSED: anything not explicitly recognized as agent-authored or
+ * system-generated is `untrusted` — so later phases (promotion, shared KB) can
+ * never auto-promote content whose provenance we could not vouch for.
+ *
+ *   - `DREAMS.md`, `memory/dreaming/*`, `.dreaming/*`   → system (machine-generated)
+ *   - `MEMORY.md`, `USER.md`, `memory/*.md`             → agent  (self-authored)
+ *   - everything else (imports, unknown)                → untrusted
+ */
+import type { OriginClass } from './types';
+export declare function classifyOrigin(relPath: string): OriginClass;
+//# sourceMappingURL=provenance.d.ts.map

package/dist/agent/knowledge/provenance.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"provenance.d.ts","sourceRoot":"","sources":["../../../src/agent/knowledge/provenance.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,SAAS,CAAC;AAO3C,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,WAAW,CAmB3D"}

package/dist/agent/knowledge/provenance.js

@@ -0,0 +1,37 @@
+"use strict";
+/**
+ * Classify the trust/origin of an indexed file by its workspace-relative path.
+ *
+ * Mirrors openclaw memory-core `resolveMemoryPathClassification`, adapted to our
+ * layout. FAIL-CLOSED: anything not explicitly recognized as agent-authored or
+ * system-generated is `untrusted` — so later phases (promotion, shared KB) can
+ * never auto-promote content whose provenance we could not vouch for.
+ *
+ *   - `DREAMS.md`, `memory/dreaming/*`, `.dreaming/*`   → system (machine-generated)
+ *   - `MEMORY.md`, `USER.md`, `memory/*.md`             → agent  (self-authored)
+ *   - everything else (imports, unknown)                → untrusted
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.classifyOrigin = classifyOrigin;
+/** Normalize a path to forward-slash, no leading "./". */
+function toPosix(relPath) {
+    return relPath.replace(/\\/g, '/').replace(/^\.\//, '');
+}
+function classifyOrigin(relPath) {
+    const p = toPosix(relPath).toLowerCase();
+    // System: dreaming outputs and the dream diary are machine-generated.
+    if (p === 'dreams.md' ||
+        p.startsWith('memory/dreaming/') ||
+        p.startsWith('.dreaming/') ||
+        p.startsWith('memory/.dreams/')) {
+        return 'system';
+    }
+    // Agent: the self-authored memory core + atomic notes under memory/.
+    if (p === 'memory.md' || p === 'user.md')
+        return 'agent';
+    if (p.startsWith('memory/') && p.endsWith('.md'))
+        return 'agent';
+    // Fail-closed for anything else.
+    return 'untrusted';
+}
+//# sourceMappingURL=provenance.js.map

package/dist/agent/knowledge/provenance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"provenance.js","sourceRoot":"","sources":["../../../src/agent/knowledge/provenance.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;GAWG;;AASH,wCAmBC;AAxBD,0DAA0D;AAC1D,SAAS,OAAO,CAAC,OAAe;IAC9B,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AAC1D,CAAC;AAED,SAAgB,cAAc,CAAC,OAAe;IAC5C,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;IAEzC,sEAAsE;IACtE,IACE,CAAC,KAAK,WAAW;QACjB,CAAC,CAAC,UAAU,CAAC,kBAAkB,CAAC;QAChC,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC;QAC1B,CAAC,CAAC,UAAU,CAAC,iBAAiB,CAAC,EAC/B,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,qEAAqE;IACrE,IAAI,CAAC,KAAK,WAAW,IAAI,CAAC,KAAK,SAAS;QAAE,OAAO,OAAO,CAAC;IACzD,IAAI,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC;QAAE,OAAO,OAAO,CAAC;IAEjE,iCAAiC;IACjC,OAAO,WAAW,CAAC;AACrB,CAAC"}