@rubytech/create-maxy-code 0.1.0

package/payload/platform/plugins/memory/mcp/dist/lib/conversation-pipeline/to-turn-text.js

@@ -0,0 +1,29 @@
+// ---------------------------------------------------------------------------
+// to-turn-text — render one ConversationSession as a timestamped text block
+// for memory-classify (mode='chat'). Task 897: bodies are opaque; the
+// scanner already preserved the source's `Sender:` segment inside `body`,
+// so a WhatsApp session renders as:
+//
+//   [YYYY-MM-DD HH:MM:SS ±HH:MM] Sender: body text
+//   [YYYY-MM-DD HH:MM:SS ±HH:MM] Sender: body text
+//
+// Other sources whose body shape is different (system message, vCard,
+// forwarded block) flow through unchanged — the chat-mode prompt is
+// instructed to keep these prefixes verbatim in chunk bodies.
+// ---------------------------------------------------------------------------
+export function toTurnText(session) {
+    const lines = [];
+    for (const m of session.messages) {
+        lines.push(`[${formatWallClock(m.dateSent)}] ${m.body}`);
+    }
+    return lines.join("\n");
+}
+function formatWallClock(iso) {
+    const m = iso.match(/^(\d{4})-(\d{2})-(\d{2})T(\d{2}):(\d{2}):(\d{2})(?:\.\d+)?(Z|[+-]\d{2}:?\d{2})$/);
+    if (!m)
+        return iso;
+    const [, y, mo, d, h, mi, s, off] = m;
+    const offsetLabel = off === "Z" ? "+00:00" : off;
+    return `${y}-${mo}-${d} ${h}:${mi}:${s} ${offsetLabel}`;
+}
+//# sourceMappingURL=to-turn-text.js.map

package/payload/platform/plugins/memory/mcp/dist/lib/conversation-pipeline/to-turn-text.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"to-turn-text.js","sourceRoot":"","sources":["../../../src/lib/conversation-pipeline/to-turn-text.ts"],"names":[],"mappings":"AAEA,8EAA8E;AAC9E,4EAA4E;AAC5E,sEAAsE;AACtE,0EAA0E;AAC1E,oCAAoC;AACpC,EAAE;AACF,mDAAmD;AACnD,mDAAmD;AACnD,EAAE;AACF,sEAAsE;AACtE,oEAAoE;AACpE,8DAA8D;AAC9D,8EAA8E;AAE9E,MAAM,UAAU,UAAU,CAAC,OAA4B;IACrD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AAED,SAAS,eAAe,CAAC,GAAW;IAClC,MAAM,CAAC,GAAG,GAAG,CAAC,KAAK,CACjB,iFAAiF,CAClF,CAAC;IACF,IAAI,CAAC,CAAC;QAAE,OAAO,GAAG,CAAC;IACnB,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IACtC,MAAM,WAAW,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC;IACjD,OAAO,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;AAC1D,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/lib/document-chunker.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Deterministic prose chunker for oversize document classification (Task 896).
+ *
+ * Splits a document into overlapping fixed-size chunks so each chunk fits
+ * inside Haiku's input context window. The chunker is purely mechanical —
+ * it makes no semantic claim about where chunk boundaries should fall.
+ * Ontological boundaries remain Haiku's job per Task 737 (the document
+ * chunker that *did* try to be semantic was deleted because it leaked
+ * sections at the boundaries it picked).
+ *
+ * Overlap exists so a section straddling a chunk boundary appears in BOTH
+ * surrounding chunks; the merge step then unions the same-kind ranges so
+ * the boundary section isn't double-counted in the writer.
+ *
+ * Char counts are estimated from token counts via a fixed 3.5 chars/token
+ * ratio (English prose average). The estimate is conservative — Haiku
+ * tokenises slightly differently per script, but 3.5 leaves ~10% headroom
+ * for non-English content before bumping into the model's hard ceiling.
+ */
+export interface RangedSection {
+    /** Section kind from the classifier's closed enumeration. */
+    kind: string;
+    /** Inclusive whole-document start offset. */
+    sourceStart: number;
+    /** Exclusive whole-document end offset. */
+    sourceEnd: number;
+    /** Per-section summary; longer wins on merge tie-break. */
+    summary: string;
+}
+export interface DocumentChunk {
+    /** Substring of the source document covered by this chunk. */
+    chunkText: string;
+    /** Whole-document offset where this chunk's text begins. */
+    baseOffset: number;
+}
+export interface ChunkOptions {
+    /** Maximum chunk length in characters (already token→char converted). */
+    chunkSize: number;
+    /** Overlap in characters between consecutive chunks. */
+    overlap: number;
+}
+export declare function chunkDocument(text: string, opts: ChunkOptions): DocumentChunk[];
+export declare const MERGE_OVERLAP_THRESHOLD = 0.5;
+export declare function mergeOverlappingSections<T extends RangedSection>(input: T[]): T[];
+//# sourceMappingURL=document-chunker.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/lib/document-chunker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"document-chunker.d.ts","sourceRoot":"","sources":["../../src/lib/document-chunker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAQH,MAAM,WAAW,aAAa;IAC5B,6DAA6D;IAC7D,IAAI,EAAE,MAAM,CAAC;IACb,6CAA6C;IAC7C,WAAW,EAAE,MAAM,CAAC;IACpB,2CAA2C;IAC3C,SAAS,EAAE,MAAM,CAAC;IAClB,2DAA2D;IAC3D,OAAO,EAAE,MAAM,CAAC;CACjB;AAMD,MAAM,WAAW,aAAa;IAC5B,8DAA8D;IAC9D,SAAS,EAAE,MAAM,CAAC;IAClB,4DAA4D;IAC5D,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,YAAY;IAC3B,yEAAyE;IACzE,SAAS,EAAE,MAAM,CAAC;IAClB,wDAAwD;IACxD,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,aAAa,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,GAAG,aAAa,EAAE,CA4B/E;AAqBD,eAAO,MAAM,uBAAuB,MAAM,CAAC;AAE3C,wBAAgB,wBAAwB,CAAC,CAAC,SAAS,aAAa,EAAE,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAqDjF"}

package/payload/platform/plugins/memory/mcp/dist/lib/document-chunker.js

@@ -0,0 +1,125 @@
+/**
+ * Deterministic prose chunker for oversize document classification (Task 896).
+ *
+ * Splits a document into overlapping fixed-size chunks so each chunk fits
+ * inside Haiku's input context window. The chunker is purely mechanical —
+ * it makes no semantic claim about where chunk boundaries should fall.
+ * Ontological boundaries remain Haiku's job per Task 737 (the document
+ * chunker that *did* try to be semantic was deleted because it leaked
+ * sections at the boundaries it picked).
+ *
+ * Overlap exists so a section straddling a chunk boundary appears in BOTH
+ * surrounding chunks; the merge step then unions the same-kind ranges so
+ * the boundary section isn't double-counted in the writer.
+ *
+ * Char counts are estimated from token counts via a fixed 3.5 chars/token
+ * ratio (English prose average). The estimate is conservative — Haiku
+ * tokenises slightly differently per script, but 3.5 leaves ~10% headroom
+ * for non-English content before bumping into the model's hard ceiling.
+ */
+export function chunkDocument(text, opts) {
+    const { chunkSize, overlap } = opts;
+    if (chunkSize <= 0) {
+        throw new Error(`chunkDocument: chunkSize must be positive, got ${chunkSize}`);
+    }
+    if (overlap < 0) {
+        throw new Error(`chunkDocument: overlap must be non-negative, got ${overlap}`);
+    }
+    if (overlap >= chunkSize) {
+        throw new Error(`chunkDocument: overlap (${overlap}) must be less than chunkSize (${chunkSize})`);
+    }
+    if (text.length === 0)
+        return [];
+    if (text.length <= chunkSize) {
+        // One-chunk fast path so callers that always-chunk don't pay the
+        // window-stepping arithmetic for inputs that already fit.
+        return [{ chunkText: text, baseOffset: 0 }];
+    }
+    const chunks = [];
+    const stride = chunkSize - overlap;
+    let start = 0;
+    while (start < text.length) {
+        const end = Math.min(start + chunkSize, text.length);
+        chunks.push({ chunkText: text.slice(start, end), baseOffset: start });
+        if (end >= text.length)
+            break;
+        start += stride;
+    }
+    return chunks;
+}
+// ---------------------------------------------------------------------------
+// mergeOverlappingSections — collates per-chunk classifier results.
+//
+// Algorithm: group sections by `kind`, sort by `sourceStart`, then walk and
+// union consecutive same-kind ranges whose intersection covers more than
+// MERGE_OVERLAP_THRESHOLD of the smaller range. The longer summary wins on
+// merge — empirically Haiku's longer summary on a chunk that saw more
+// surrounding context tends to be the better one.
+//
+// Cross-kind overlap is preserved: chunk A's `Position` and chunk B's
+// `Other` covering the same range are kept as two distinct sections (per
+// eng review). The classifier disagreed about kind; the writer's downstream
+// :Section:Other surfacing will let the operator decide which one wins
+// during ontology growth review.
+//
+// Disjoint same-kind sections are also preserved — only adjacent ranges
+// with material overlap are merged.
+// ---------------------------------------------------------------------------
+export const MERGE_OVERLAP_THRESHOLD = 0.5;
+export function mergeOverlappingSections(input) {
+    if (input.length <= 1)
+        return input.slice();
+    // Group by kind so we never accidentally merge across kinds.
+    const byKind = new Map();
+    for (const s of input) {
+        const arr = byKind.get(s.kind);
+        if (arr)
+            arr.push(s);
+        else
+            byKind.set(s.kind, [s]);
+    }
+    const merged = [];
+    for (const group of byKind.values()) {
+        group.sort((a, b) => a.sourceStart - b.sourceStart || a.sourceEnd - b.sourceEnd);
+        let current = null;
+        for (const s of group) {
+            if (current === null) {
+                current = { ...s };
+                continue;
+            }
+            const intersection = Math.max(0, Math.min(current.sourceEnd, s.sourceEnd) - Math.max(current.sourceStart, s.sourceStart));
+            if (intersection === 0) {
+                merged.push(current);
+                current = { ...s };
+                continue;
+            }
+            const currentLen = current.sourceEnd - current.sourceStart;
+            const sLen = s.sourceEnd - s.sourceStart;
+            const overlapFraction = intersection / Math.min(currentLen, sLen);
+            if (overlapFraction > MERGE_OVERLAP_THRESHOLD) {
+                // Union the range; the section with the longer body contributes its
+                // non-range fields (title, properties, anchorEdge, related, etc.) on
+                // the assumption that a wider classification window grounded its
+                // properties more reliably. Summary always picks the longer of the two.
+                const fieldsWinner = sLen > currentLen ? s : current;
+                current = {
+                    ...fieldsWinner,
+                    sourceStart: Math.min(current.sourceStart, s.sourceStart),
+                    sourceEnd: Math.max(current.sourceEnd, s.sourceEnd),
+                    summary: s.summary.length > current.summary.length ? s.summary : current.summary,
+                };
+            }
+            else {
+                merged.push(current);
+                current = { ...s };
+            }
+        }
+        if (current !== null)
+            merged.push(current);
+    }
+    // Return in whole-document reading order so the writer's :NEXT chain
+    // maps to source order.
+    merged.sort((a, b) => a.sourceStart - b.sourceStart);
+    return merged;
+}
+//# sourceMappingURL=document-chunker.js.map

package/payload/platform/plugins/memory/mcp/dist/lib/document-chunker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"document-chunker.js","sourceRoot":"","sources":["../../src/lib/document-chunker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAqCH,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,IAAkB;IAC5D,MAAM,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACpC,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,kDAAkD,SAAS,EAAE,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,oDAAoD,OAAO,EAAE,CAAC,CAAC;IACjF,CAAC;IACD,IAAI,OAAO,IAAI,SAAS,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,2BAA2B,OAAO,kCAAkC,SAAS,GAAG,CAAC,CAAC;IACpG,CAAC;IACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACjC,IAAI,IAAI,CAAC,MAAM,IAAI,SAAS,EAAE,CAAC;QAC7B,iEAAiE;QACjE,0DAA0D;QAC1D,OAAO,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,MAAM,MAAM,GAAG,SAAS,GAAG,OAAO,CAAC;IACnC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACrD,MAAM,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;QACtE,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM;QAC9B,KAAK,IAAI,MAAM,CAAC;IAClB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,oEAAoE;AACpE,EAAE;AACF,4EAA4E;AAC5E,yEAAyE;AACzE,2EAA2E;AAC3E,sEAAsE;AACtE,kDAAkD;AAClD,EAAE;AACF,sEAAsE;AACtE,yEAAyE;AACzE,4EAA4E;AAC5E,uEAAuE;AACvE,iCAAiC;AACjC,EAAE;AACF,wEAAwE;AACxE,oCAAoC;AACpC,8EAA8E;AAE9E,MAAM,CAAC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AAE3C,MAAM,UAAU,wBAAwB,CAA0B,KAAU;IAC1E,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC,KAAK,EAAE,CAAC;IAE5C,6DAA6D;IAC7D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAe,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,GAAG;YAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YAChB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/B,CAAC;IAED,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC;QACjF,IAAI,OAAO,GAAa,IAAI,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACrB,OAAO,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YAC1H,IAAI,YAAY,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrB,OAAO,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACnB,SAAS;YACX,CAAC;YACD,MAAM,UAAU,GAAW,OAAO,CAAC,SAAS,GAAG,OAAO,CAAC,WAAW,CAAC;YACnE,MAAM,IAAI,GAAW,CAAC,CAAC,SAAS,GAAG,CAAC,CAAC,WAAW,CAAC;YACjD,MAAM,eAAe,GAAG,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YAClE,IAAI,eAAe,GAAG,uBAAuB,EAAE,CAAC;gBAC9C,oEAAoE;gBACpE,qEAAqE;gBACrE,iEAAiE;gBACjE,wEAAwE;gBACxE,MAAM,YAAY,GAAM,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;gBACxD,OAAO,GAAG;oBACR,GAAG,YAAY;oBACf,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,WAAW,CAAC;oBACzD,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC;oBACnD,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO;iBACjF,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACrB,OAAO,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;YACrB,CAAC;QACH,CAAC;QACD,IAAI,OAAO,KAAK,IAAI;YAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC;IAED,qEAAqE;IACrE,wBAAwB;IACxB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;IACrD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/lib/document-hierarchy.d.ts

@@ -0,0 +1,9 @@
+import type { Session } from "neo4j-driver";
+export interface CascadeResult {
+    sections: number;
+    chunks: number;
+    typed: number;
+    references: number;
+}
+export declare function deleteDocumentChildren(attachmentId: string, session: Session): Promise<CascadeResult>;
+//# sourceMappingURL=document-hierarchy.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/lib/document-hierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"document-hierarchy.d.ts","sourceRoot":"","sources":["../../src/lib/document-hierarchy.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AAoC5C,MAAM,WAAW,aAAa;IAC5B,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,wBAAsB,sBAAsB,CAC1C,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,OAAO,GACf,OAAO,CAAC,aAAa,CAAC,CAuExB"}

package/payload/platform/plugins/memory/mcp/dist/lib/document-hierarchy.js

@@ -0,0 +1,61 @@
+export async function deleteDocumentChildren(attachmentId, session) {
+    // 1. Drop Section children (any secondary label). Detach kills HAS_SECTION,
+    //    NEXT, and any anchor edges (HAS_POSITION/ATTENDED/etc.) attached to
+    //    them. Pre-Task 740 :Chunk overflow descendants drop with them.
+    const sectionResult = await session.run(`MATCH (d:KnowledgeDocument { attachmentId: $attachmentId })-[:HAS_SECTION]->(s:Section)
+     OPTIONAL MATCH (s)-[:HAS_CHUNK]->(c:Chunk)
+     DETACH DELETE s, c
+     RETURN count(DISTINCT s) AS sections, count(DISTINCT c) AS sectionChunks`, { attachmentId });
+    const sections = sectionResult.records[0]?.get("sections")?.toNumber?.() ?? 0;
+    const sectionChunks = sectionResult.records[0]?.get("sectionChunks")?.toNumber?.() ?? 0;
+    // 2. Drop standalone nodes that originated from this document
+    //    (currently: Project). Provenance-stamped, so the discriminator catches
+    //    them while sparing MERGEd shared entities (Organization, Person).
+    const standaloneResult = await session.run(`MATCH (n)
+     WHERE n.sourceDocumentId = $attachmentId
+       AND n.createdByAgent   = 'document-ingest'
+       AND NOT n:Section
+       AND NOT n:KnowledgeDocument
+     OPTIONAL MATCH (n)-[:HAS_CHUNK]->(c:Chunk)
+     DETACH DELETE n, c
+     RETURN count(DISTINCT n) AS typed, count(DISTINCT c) AS typedChunks`, { attachmentId });
+    const typed = standaloneResult.records[0]?.get("typed")?.toNumber?.() ?? 0;
+    const typedChunks = standaloneResult.records[0]?.get("typedChunks")?.toNumber?.() ?? 0;
+    // 3. Drop document-level edges off the KnowledgeDocument. Targets are MERGEd
+    //    shared entities so they stay; only the edges go. Two predicates:
+    //      (a) Legacy edge-type whitelist — PARTY only. Pre-Task 740 contracts
+    //          may carry PARTY edges that predate provenance stamping; matching
+    //          by name guarantees they drop on re-ingest. PARTY is single-use:
+    //          only `writeDocumentEdge` writes it, so the whitelist cannot
+    //          accidentally over-delete a third party's PARTY edge.
+    //      (b) Provenance match — any edge stamped sourceDocumentId=<this attachment>.
+    //          Catches Task 790 classifier-emitted edges (PARTICIPANT/FROM/TO/CC/SPEAKER,
+    //          stamped by writeDocumentEdge), Task 790 agent-emitted brief-wired
+    //          edges (MENTIONS/REFERENCES/etc., stamped by database-operator on
+    //          each memory-write call), and any future stamped edge type without
+    //          a code change here.
+    //
+    //    REFERENCES is deliberately NOT on the legacy whitelist (Task 790 review):
+    //    it became a live forward-going edge type for brief-wired Task/Event/
+    //    Service/KnowledgeDocument cross-links, so a name-match would silently
+    //    drop ad-hoc REFERENCES edges that other pipelines (e.g. operator-driven
+    //    graph ops) wrote off this KD without a sourceDocumentId stamp. New
+    //    REFERENCES writes from the document-ingest pipeline carry the stamp and
+    //    are caught by predicate (b). Pre-Task 740 unstamped legacy REFERENCES
+    //    edges persist on re-ingest — acceptable because Phase 0 has no
+    //    production legacy state and the over-delete risk outweighs cleaning
+    //    those legacy edges.
+    const refsResult = await session.run(`MATCH (d:KnowledgeDocument { attachmentId: $attachmentId })-[r]->()
+     WHERE type(r) = 'PARTY'
+        OR r.sourceDocumentId = $attachmentId
+     DELETE r
+     RETURN count(r) AS refs`, { attachmentId });
+    const references = refsResult.records[0]?.get("refs")?.toNumber?.() ?? 0;
+    return {
+        sections,
+        chunks: sectionChunks + typedChunks,
+        typed,
+        references,
+    };
+}
+//# sourceMappingURL=document-hierarchy.js.map

package/payload/platform/plugins/memory/mcp/dist/lib/document-hierarchy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"document-hierarchy.js","sourceRoot":"","sources":["../../src/lib/document-hierarchy.ts"],"names":[],"mappings":"AA2CA,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,YAAoB,EACpB,OAAgB;IAEhB,4EAA4E;IAC5E,yEAAyE;IACzE,oEAAoE;IACpE,MAAM,aAAa,GAAG,MAAM,OAAO,CAAC,GAAG,CACrC;;;8EAG0E,EAC1E,EAAE,YAAY,EAAE,CACjB,CAAC;IACF,MAAM,QAAQ,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,UAAU,CAAC,EAAE,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;IAC9E,MAAM,aAAa,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,eAAe,CAAC,EAAE,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;IAExF,8DAA8D;IAC9D,4EAA4E;IAC5E,uEAAuE;IACvE,MAAM,gBAAgB,GAAG,MAAM,OAAO,CAAC,GAAG,CACxC;;;;;;;yEAOqE,EACrE,EAAE,YAAY,EAAE,CACjB,CAAC;IACF,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;IAC3E,MAAM,WAAW,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,EAAE,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;IAEvF,6EAA6E;IAC7E,sEAAsE;IACtE,2EAA2E;IAC3E,4EAA4E;IAC5E,2EAA2E;IAC3E,uEAAuE;IACvE,gEAAgE;IAChE,mFAAmF;IACnF,sFAAsF;IACtF,6EAA6E;IAC7E,4EAA4E;IAC5E,6EAA6E;IAC7E,+BAA+B;IAC/B,EAAE;IACF,+EAA+E;IAC/E,0EAA0E;IAC1E,2EAA2E;IAC3E,6EAA6E;IAC7E,wEAAwE;IACxE,6EAA6E;IAC7E,2EAA2E;IAC3E,oEAAoE;IACpE,yEAAyE;IACzE,yBAAyB;IACzB,MAAM,UAAU,GAAG,MAAM,OAAO,CAAC,GAAG,CAClC;;;;6BAIyB,EACzB,EAAE,YAAY,EAAE,CACjB,CAAC;IACF,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,QAAQ,EAAE,EAAE,IAAI,CAAC,CAAC;IAEzE,OAAO;QACL,QAAQ;QACR,MAAM,EAAE,aAAa,GAAG,WAAW;QACnC,KAAK;QACL,UAAU;KACX,CAAC;AACJ,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/lib/embeddings.d.ts

@@ -0,0 +1,3 @@
+export declare function embed(text: string): Promise<number[]>;
+export declare function embedBatch(texts: string[]): Promise<number[][]>;
+//# sourceMappingURL=embeddings.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/lib/embeddings.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"embeddings.d.ts","sourceRoot":"","sources":["../../src/lib/embeddings.ts"],"names":[],"mappings":"AAGA,wBAAsB,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAc3D;AAED,wBAAsB,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAcrE"}

package/payload/platform/plugins/memory/mcp/dist/lib/embeddings.js

@@ -0,0 +1,29 @@
+const OLLAMA_URL = process.env.OLLAMA_URL ?? "http://localhost:11434";
+const EMBED_MODEL = process.env.EMBED_MODEL ?? "nomic-embed-text";
+export async function embed(text) {
+    const res = await fetch(`${OLLAMA_URL}/api/embed`, {
+        method: "POST",
+        headers: { "Content-Type": "application/json" },
+        body: JSON.stringify({ model: EMBED_MODEL, input: text }),
+    });
+    if (!res.ok) {
+        const body = await res.text();
+        throw new Error(`Ollama embedding failed (${res.status}): ${body}`);
+    }
+    const data = (await res.json());
+    return data.embeddings[0];
+}
+export async function embedBatch(texts) {
+    const res = await fetch(`${OLLAMA_URL}/api/embed`, {
+        method: "POST",
+        headers: { "Content-Type": "application/json" },
+        body: JSON.stringify({ model: EMBED_MODEL, input: texts }),
+    });
+    if (!res.ok) {
+        const body = await res.text();
+        throw new Error(`Ollama batch embedding failed (${res.status}): ${body}`);
+    }
+    const data = (await res.json());
+    return data.embeddings;
+}
+//# sourceMappingURL=embeddings.js.map

package/payload/platform/plugins/memory/mcp/dist/lib/embeddings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embeddings.js","sourceRoot":"","sources":["../../src/lib/embeddings.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,IAAI,wBAAwB,CAAC;AACtE,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,IAAI,kBAAkB,CAAC;AAElE,MAAM,CAAC,KAAK,UAAU,KAAK,CAAC,IAAY;IACtC,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,UAAU,YAAY,EAAE;QACjD,MAAM,EAAE,MAAM;QACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;QAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;KAC1D,CAAC,CAAC;IAEH,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,4BAA4B,GAAG,CAAC,MAAM,MAAM,IAAI,EAAE,CAAC,CAAC;IACtE,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAA+B,CAAC;IAC9D,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC5B,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,KAAe;IAC9C,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,UAAU,YAAY,EAAE;QACjD,MAAM,EAAE,MAAM;QACd,OAAO,EAAE,EAAE,cAAc,EAAE,kBAAkB,EAAE;QAC/C,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;KAC3D,CAAC,CAAC;IAEH,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,kCAAkC,GAAG,CAAC,MAAM,MAAM,IAAI,EAAE,CAAC,CAAC;IAC5E,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAA+B,CAAC;IAC9D,OAAO,IAAI,CAAC,UAAU,CAAC;AACzB,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/lib/filter-token.d.ts

@@ -0,0 +1,36 @@
+export type CandidatesFilter = "empty" | "single-assistant";
+export interface FilterTokenPayload {
+    filter: CandidatesFilter;
+    agentType?: "admin" | "public";
+    accountId: string;
+    issuedAt: number;
+    nonce: string;
+}
+export type VerifyOutcome = {
+    ok: true;
+    payload: FilterTokenPayload;
+} | {
+    ok: false;
+    reason: "malformed" | "bad-signature" | "expired";
+};
+/** Mint a signed filter token for the given selection context. */
+export declare function mintFilterToken(input: {
+    filter: CandidatesFilter;
+    agentType?: "admin" | "public";
+    accountId: string;
+}): string;
+/**
+ * Verify a filter token. Returns the payload when signature+TTL pass; returns
+ * a structured rejection reason otherwise. Callers must treat a rejection as
+ * load-bearing — never silently fall back to "delete anyway."
+ */
+export declare function verifyFilterToken(token: string, opts?: {
+    ttlMs?: number;
+    now?: number;
+}): VerifyOutcome;
+/**
+ * Short hash of the token for log correlation — never logs the raw token.
+ * Use in `[memory-delete] filterToken=<sha8>` emissions.
+ */
+export declare function filterTokenFingerprint(token: string): string;
+//# sourceMappingURL=filter-token.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/lib/filter-token.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter-token.d.ts","sourceRoot":"","sources":["../../src/lib/filter-token.ts"],"names":[],"mappings":"AA4BA,MAAM,MAAM,gBAAgB,GAAG,OAAO,GAAG,kBAAkB,CAAC;AAE5D,MAAM,WAAW,kBAAkB;IACjC,MAAM,EAAE,gBAAgB,CAAC;IACzB,SAAS,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,MAAM,aAAa,GACrB;IAAE,EAAE,EAAE,IAAI,CAAC;IAAC,OAAO,EAAE,kBAAkB,CAAA;CAAE,GACzC;IAAE,EAAE,EAAE,KAAK,CAAC;IAAC,MAAM,EAAE,WAAW,GAAG,eAAe,GAAG,SAAS,CAAA;CAAE,CAAC;AAWrE,kEAAkE;AAClE,wBAAgB,eAAe,CAAC,KAAK,EAAE;IACrC,MAAM,EAAE,gBAAgB,CAAC;IACzB,SAAS,CAAC,EAAE,OAAO,GAAG,QAAQ,CAAC;IAC/B,SAAS,EAAE,MAAM,CAAC;CACnB,GAAG,MAAM,CAWT;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CAAE,GAAG,aAAa,CA0BvG;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE5D"}

package/payload/platform/plugins/memory/mcp/dist/lib/filter-token.js

@@ -0,0 +1,86 @@
+import { createHmac, randomBytes } from "node:crypto";
+/**
+ * Opaque filter token for the `memory-find-candidates` → `memory-delete` handshake.
+ *
+ * The admin agent calls `memory-find-candidates(filter)` to produce a list of
+ * bulk-delete candidates, and must then pass the returned `filterToken` to
+ * `memory-delete` so the server can re-verify that the target elementId still
+ * matches the original predicate at trash time. The token closes the 2026-04-22
+ * class of failure where the agent authored a bad selection cypher and then
+ * dispatched a subagent with the hardcoded id list framed as "owner approved,
+ * do not reverify."
+ *
+ * Format: `base64url(payload).base64url(hmac)` where `payload` is a JSON
+ * envelope carrying the filter name, agentType, accountId, issuedAt, and a
+ * random nonce. `hmac` is HMAC-SHA256 signed with a process-startup random
+ * secret — the secret lives only in memory and dies with the MCP server. A
+ * restart invalidates every in-flight token, which harmlessly forces the
+ * agent to re-run `memory-find-candidates` rather than proceed on a stale
+ * assumption; that is the correct failure mode.
+ *
+ * TTL is enforced at verify time (default 5 min). Past TTL, verify returns
+ * `outcome=expired`; the caller surfaces that verbatim to the agent.
+ */
+const SECRET = randomBytes(32);
+const DEFAULT_TTL_MS = 5 * 60 * 1000;
+function b64url(buf) {
+    return buf.toString("base64").replace(/\+/g, "-").replace(/\//g, "_").replace(/=+$/, "");
+}
+function b64urlDecode(s) {
+    const pad = s.length % 4 === 0 ? "" : "=".repeat(4 - (s.length % 4));
+    return Buffer.from(s.replace(/-/g, "+").replace(/_/g, "/") + pad, "base64");
+}
+/** Mint a signed filter token for the given selection context. */
+export function mintFilterToken(input) {
+    const payload = {
+        filter: input.filter,
+        agentType: input.agentType,
+        accountId: input.accountId,
+        issuedAt: Date.now(),
+        nonce: b64url(randomBytes(12)),
+    };
+    const payloadJson = Buffer.from(JSON.stringify(payload), "utf8");
+    const sig = createHmac("sha256", SECRET).update(payloadJson).digest();
+    return `${b64url(payloadJson)}.${b64url(sig)}`;
+}
+/**
+ * Verify a filter token. Returns the payload when signature+TTL pass; returns
+ * a structured rejection reason otherwise. Callers must treat a rejection as
+ * load-bearing — never silently fall back to "delete anyway."
+ */
+export function verifyFilterToken(token, opts) {
+    const ttlMs = opts?.ttlMs ?? DEFAULT_TTL_MS;
+    const now = opts?.now ?? Date.now();
+    const parts = token.split(".");
+    if (parts.length !== 2)
+        return { ok: false, reason: "malformed" };
+    let payload;
+    let payloadJson;
+    try {
+        payloadJson = b64urlDecode(parts[0]);
+        payload = JSON.parse(payloadJson.toString("utf8"));
+    }
+    catch {
+        return { ok: false, reason: "malformed" };
+    }
+    const expected = createHmac("sha256", SECRET).update(payloadJson).digest();
+    const actual = b64urlDecode(parts[1]);
+    if (expected.length !== actual.length)
+        return { ok: false, reason: "bad-signature" };
+    let diff = 0;
+    for (let i = 0; i < expected.length; i++)
+        diff |= expected[i] ^ actual[i];
+    if (diff !== 0)
+        return { ok: false, reason: "bad-signature" };
+    if (now - payload.issuedAt > ttlMs)
+        return { ok: false, reason: "expired" };
+    return { ok: true, payload };
+}
+/**
+ * Short hash of the token for log correlation — never logs the raw token.
+ * Use in `[memory-delete] filterToken=<sha8>` emissions.
+ */
+export function filterTokenFingerprint(token) {
+    return createHmac("sha256", SECRET).update(token).digest("hex").slice(0, 8);
+}
+//# sourceMappingURL=filter-token.js.map

package/payload/platform/plugins/memory/mcp/dist/lib/filter-token.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter-token.js","sourceRoot":"","sources":["../../src/lib/filter-token.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAEtD;;;;;;;;;;;;;;;;;;;;;GAqBG;AAEH,MAAM,MAAM,GAAG,WAAW,CAAC,EAAE,CAAC,CAAC;AAC/B,MAAM,cAAc,GAAG,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC;AAgBrC,SAAS,MAAM,CAAC,GAAW;IACzB,OAAO,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;AAC3F,CAAC;AAED,SAAS,YAAY,CAAC,CAAS;IAC7B,MAAM,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACrE,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,GAAG,EAAE,QAAQ,CAAC,CAAC;AAC9E,CAAC;AAED,kEAAkE;AAClE,MAAM,UAAU,eAAe,CAAC,KAI/B;IACC,MAAM,OAAO,GAAuB;QAClC,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,SAAS,EAAE,KAAK,CAAC,SAAS;QAC1B,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE;QACpB,KAAK,EAAE,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;KAC/B,CAAC;IACF,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC;IACjE,MAAM,GAAG,GAAG,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,EAAE,CAAC;IACtE,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;AACjD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa,EAAE,IAAuC;IACtF,MAAM,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,cAAc,CAAC;IAC5C,MAAM,GAAG,GAAG,IAAI,EAAE,GAAG,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IAEpC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IAElE,IAAI,OAA2B,CAAC;IAChC,IAAI,WAAmB,CAAC;IACxB,IAAI,CAAC;QACH,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAuB,CAAC;IAC3E,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;IAC5C,CAAC;IAED,MAAM,QAAQ,GAAG,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,MAAM,EAAE,CAAC;IAC3E,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,IAAI,QAAQ,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC;IACrF,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC1E,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,eAAe,EAAE,CAAC;IAE9D,IAAI,GAAG,GAAG,OAAO,CAAC,QAAQ,GAAG,KAAK;QAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC;IAE5E,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAa;IAClD,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC9E,CAAC"}

package/payload/platform/plugins/memory/mcp/dist/lib/graph-prune.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Deny-list storage + agent-directed expunge helper.
+ *
+ * Historical note: this file once hosted `runPrune`, a four-rule autonomous
+ * engine (orphan-delete, deny-list null, candidate-merge flag, contradiction
+ * flag) invoked by a 03:00 cron and the `graph-prune-run` MCP tool. The
+ * 2026-04-20 incident — one `graph-prune-run` call wiped nodeId=1
+ * `OnboardingState` plus 18 unrelated nodes via the orphan-delete rule — ended
+ * the autonomous-rule doctrine for graph hygiene. The LLM agent now applies
+ * discretion on what to null / delete / flag, using `memory-update`,
+ * `memory-delete` (soft-delete per Task 576), and `conversation-memory-expunge`
+ * on a per-case basis. The operator-curated deny-list remains as a stored
+ * signal the agent reads and reasons about; nothing auto-applies it.
+ *
+ * What this file still exports:
+ *   - `DenyList`, `loadDenylist`, `saveDenylist`, `denylistPath` — operator
+ *     curation storage for the `graph-prune-denylist-{add,list,remove}` tools.
+ *     Reads are advisory context for the agent, not automatic hits.
+ *   - `resolveConfigDir` — brand config-dir resolver, shared with other plugins.
+ *   - `expungeConversationMemory` — the helper behind the manual
+ *     `conversation-memory-expunge` tool. Agent-directed: caller passes a
+ *     conversationId + pattern, the helper nulls matching string properties on
+ *     `:Memory` nodes linked to that conversation. No bulk logic.
+ */
+import type { Driver } from "neo4j-driver";
+export interface DenyList {
+    values: string[];
+    updatedAt: string;
+}
+export declare function denylistPath(configDir: string): string;
+export declare function loadDenylist(configDir: string): DenyList;
+export declare function saveDenylist(configDir: string, list: DenyList): void;
+export declare function resolveConfigDir(): string;
+export interface ExpungeResult {
+    conversationId: string;
+    pattern: string;
+    nodesScanned: number;
+    propertiesNulled: number;
+    affectedNodeIds: number[];
+}
+export declare function expungeConversationMemory(driver: Driver, accountId: string, conversationId: string, pattern: string): Promise<ExpungeResult>;
+//# sourceMappingURL=graph-prune.d.ts.map

package/payload/platform/plugins/memory/mcp/dist/lib/graph-prune.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-prune.d.ts","sourceRoot":"","sources":["../../src/lib/graph-prune.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAKH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAE3C,MAAM,WAAW,QAAQ;IACvB,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAEtD;AAED,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,QAAQ,CAexD;AAED,wBAAgB,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI,CAGpE;AAED,wBAAgB,gBAAgB,IAAI,MAAM,CAczC;AAYD,MAAM,WAAW,aAAa;IAC5B,cAAc,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,YAAY,EAAE,MAAM,CAAC;IACrB,gBAAgB,EAAE,MAAM,CAAC;IACzB,eAAe,EAAE,MAAM,EAAE,CAAC;CAC3B;AAED,wBAAsB,yBAAyB,CAC7C,MAAM,EAAE,MAAM,EACd,SAAS,EAAE,MAAM,EACjB,cAAc,EAAE,MAAM,EACtB,OAAO,EAAE,MAAM,GACd,OAAO,CAAC,aAAa,CAAC,CAqDxB"}

package/payload/platform/plugins/memory/mcp/dist/lib/graph-prune.js

@@ -0,0 +1,114 @@
+/**
+ * Deny-list storage + agent-directed expunge helper.
+ *
+ * Historical note: this file once hosted `runPrune`, a four-rule autonomous
+ * engine (orphan-delete, deny-list null, candidate-merge flag, contradiction
+ * flag) invoked by a 03:00 cron and the `graph-prune-run` MCP tool. The
+ * 2026-04-20 incident — one `graph-prune-run` call wiped nodeId=1
+ * `OnboardingState` plus 18 unrelated nodes via the orphan-delete rule — ended
+ * the autonomous-rule doctrine for graph hygiene. The LLM agent now applies
+ * discretion on what to null / delete / flag, using `memory-update`,
+ * `memory-delete` (soft-delete per Task 576), and `conversation-memory-expunge`
+ * on a per-case basis. The operator-curated deny-list remains as a stored
+ * signal the agent reads and reasons about; nothing auto-applies it.
+ *
+ * What this file still exports:
+ *   - `DenyList`, `loadDenylist`, `saveDenylist`, `denylistPath` — operator
+ *     curation storage for the `graph-prune-denylist-{add,list,remove}` tools.
+ *     Reads are advisory context for the agent, not automatic hits.
+ *   - `resolveConfigDir` — brand config-dir resolver, shared with other plugins.
+ *   - `expungeConversationMemory` — the helper behind the manual
+ *     `conversation-memory-expunge` tool. Agent-directed: caller passes a
+ *     conversationId + pattern, the helper nulls matching string properties on
+ *     `:Memory` nodes linked to that conversation. No bulk logic.
+ */
+import { existsSync, mkdirSync, readFileSync, writeFileSync } from "node:fs";
+import { resolve } from "node:path";
+import { homedir } from "node:os";
+export function denylistPath(configDir) {
+    return resolve(configDir, "graph-prune-denylist.json");
+}
+export function loadDenylist(configDir) {
+    const path = denylistPath(configDir);
+    if (!existsSync(path)) {
+        return { values: [], updatedAt: new Date(0).toISOString() };
+    }
+    try {
+        const raw = JSON.parse(readFileSync(path, "utf-8"));
+        return {
+            values: Array.isArray(raw.values) ? raw.values.filter((v) => typeof v === "string") : [],
+            updatedAt: typeof raw.updatedAt === "string" ? raw.updatedAt : new Date(0).toISOString(),
+        };
+    }
+    catch (err) {
+        process.stderr.write(`[denylist] failed to parse ${path}: ${err instanceof Error ? err.message : String(err)} — treating as empty\n`);
+        return { values: [], updatedAt: new Date(0).toISOString() };
+    }
+}
+export function saveDenylist(configDir, list) {
+    mkdirSync(configDir, { recursive: true });
+    writeFileSync(denylistPath(configDir), JSON.stringify(list, null, 2) + "\n", "utf-8");
+}
+export function resolveConfigDir() {
+    const platformRoot = process.env.PLATFORM_ROOT;
+    if (!platformRoot) {
+        throw new Error("PLATFORM_ROOT environment variable is required");
+    }
+    const brandPath = resolve(platformRoot, "config", "brand.json");
+    if (!existsSync(brandPath)) {
+        throw new Error(`brand.json not found at ${brandPath} — platform not properly installed`);
+    }
+    const brand = JSON.parse(readFileSync(brandPath, "utf-8"));
+    if (!brand.configDir) {
+        throw new Error(`brand.json at ${brandPath} is missing the configDir field`);
+    }
+    return resolve(homedir(), brand.configDir);
+}
+export async function expungeConversationMemory(driver, accountId, conversationId, pattern) {
+    const session = driver.session();
+    try {
+        const matchRes = await session.run(`MATCH (m:Memory)-[:PART_OF|:ABOUT]->(c:Conversation {conversationId: $conversationId})
+       WHERE m.accountId = $accountId
+       WITH m, [k IN keys(m) WHERE k <> '_denylistAudit'
+                               AND k <> 'embedding'
+                               AND CASE
+                                 WHEN m[k] IS NULL THEN false
+                                 WHEN toString(m[k]) = m[k] THEN m[k] CONTAINS $pattern
+                                 ELSE false
+                               END] AS hits
+       RETURN id(m) AS nid, hits, size(collect(m)) AS scanned`, { accountId, conversationId, pattern });
+        let propertiesNulled = 0;
+        const affectedNodeIds = [];
+        let nodesScanned = 0;
+        for (const r of matchRes.records) {
+            nodesScanned += 1;
+            const nid = Number(r.get("nid"));
+            const hits = r.get("hits");
+            if (hits.length === 0)
+                continue;
+            affectedNodeIds.push(nid);
+            const setClauses = hits.map((k) => `m.\`${k.replace(/`/g, "")}\` = null`).join(", ");
+            const auditEntry = JSON.stringify({
+                ts: new Date().toISOString(),
+                properties: hits,
+                manualPattern: pattern,
+                conversationId,
+            });
+            await session.run(`MATCH (m) WHERE id(m) = $nid
+         SET ${setClauses},
+             m._denylistAudit = coalesce(m._denylistAudit, '') + $entry + '\n'`, { nid, entry: auditEntry });
+            propertiesNulled += hits.length;
+        }
+        return {
+            conversationId,
+            pattern,
+            nodesScanned,
+            propertiesNulled,
+            affectedNodeIds,
+        };
+    }
+    finally {
+        await session.close();
+    }
+}
+//# sourceMappingURL=graph-prune.js.map