@fgv/ts-agent-memory 5.1.0-39 → 5.1.0-41

package/dist/test/unit/ingest/cycleGuard.test.js.map

@@ -1 +1 @@
-{"version":3,"file":"cycleGuard.test.js","sourceRoot":"","sources":["../../../../src/test/unit/ingest/cycleGuard.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,oBAAoB,CAAC;AAC5B,OAAO,EAAuC,cAAc,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAC;AAEpG,MAAM,GAAG,GAAa,KAAiB,CAAC;AAExC,SAAS,IAAI,CAAC,MAAc,EAAE,MAAc,EAAE,OAAiB,GAAG;IAChE,OAAO,EAAE,MAAM,EAAE,MAAkB,EAAE,MAAM,EAAE,MAAkB,EAAE,IAAI,EAAE,CAAC;AAC1E,CAAC;AAED,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,GAAW,EAAE,EAAE;YACxE,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACxD,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACxD,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,OAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3E,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACzF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CACnF,sBAAsB,CACvB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACrE,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,sBAAsB,CAAC,CAAC;IAClG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC/B,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gEAAgE,EAAE,GAAG,EAAE;QAC1E,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACzF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC3G,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6EAA6E,EAAE,GAAG,EAAE;QACvF,2EAA2E;QAC3E,6EAA6E;QAC7E,sCAAsC;QACtC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACzG,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport { ICycleGuardEdge, LinkType, MemoryId, assertNoCycles, buildCycleKey } from '../../../index';\n\nconst rel: LinkType = 'rel' as LinkType;\n\nfunction edge(source: string, target: string, type: LinkType = rel): ICycleGuardEdge {\n  return { source: source as MemoryId, target: target as MemoryId, type };\n}\n\ndescribe('buildCycleKey', () => {\n  test('is deterministic for the same edge', () => {\n    expect(buildCycleKey(edge('a', 'b'))).toSucceedAndSatisfy((key: string) => {\n      expect(buildCycleKey(edge('a', 'b'))).toSucceedWith(key);\n    });\n  });\n\n  test('differs by direction and type', () => {\n    const forward = buildCycleKey(edge('a', 'b')).orThrow();\n    const reverse = buildCycleKey(edge('b', 'a')).orThrow();\n    const typed = buildCycleKey(edge('a', 'b', 'other' as LinkType)).orThrow();\n    expect(forward).not.toBe(reverse);\n    expect(forward).not.toBe(typed);\n  });\n});\n\ndescribe('assertNoCycles', () => {\n  test('accepts an acyclic graph', () => {\n    expect(assertNoCycles([edge('a', 'b')], [edge('b', 'c'), edge('c', 'd')])).toSucceed();\n  });\n\n  test('rejects a proposed edge that closes a cycle against existing edges', () => {\n    expect(assertNoCycles([edge('a', 'b'), edge('b', 'c')], [edge('c', 'a')])).toFailWith(\n      /would create a cycle/\n    );\n  });\n\n  test('rejects a cycle formed entirely within the proposed batch', () => {\n    expect(assertNoCycles([], [edge('a', 'b'), edge('b', 'a')])).toFailWith(/would create a cycle/);\n  });\n\n  test('rejects a self-loop', () => {\n    expect(assertNoCycles([], [edge('a', 'a')])).toFailWith(/self-loop/);\n  });\n\n  test('tolerates a duplicate proposed edge (deduped by canonical key)', () => {\n    expect(assertNoCycles([], [edge('a', 'b'), edge('a', 'b')])).toSucceed();\n  });\n\n  test('tolerates a duplicate existing edge', () => {\n    expect(assertNoCycles([edge('a', 'b'), edge('a', 'b')], [edge('b', 'c')])).toSucceed();\n  });\n\n  test('accepts a diamond (shared descendant is not a cycle)', () => {\n    expect(assertNoCycles([], [edge('a', 'b'), edge('a', 'c'), edge('b', 'd'), edge('c', 'd')])).toSucceed();\n  });\n\n  test('reachability tolerates a frontier node reached by two paths (revisit guard)', () => {\n    // Existing graph: a->c, a->b, b->c. A proposed edge z->a runs reachability\n    // from `a`, whose DFS pushes `c` twice before it is visited — exercising the\n    // visited-node skip in the traversal.\n    expect(assertNoCycles([edge('a', 'c'), edge('a', 'b'), edge('b', 'c')], [edge('z', 'a')])).toSucceed();\n  });\n});\n"]}
+{"version":3,"file":"cycleGuard.test.js","sourceRoot":"","sources":["../../../../src/test/unit/ingest/cycleGuard.test.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,oBAAoB,CAAC;AAC5B,OAAO,EAML,cAAc,EACd,aAAa,EACd,MAAM,gBAAgB,CAAC;AAExB,MAAM,GAAG,GAAa,KAAiB,CAAC;AACxC,MAAM,aAAa,GAAW,KAAK,CAAC;AAEpC,2FAA2F;AAC3F,SAAS,IAAI,CAAC,IAAY;IACxB,MAAM,IAAI,GAAW,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACvC,MAAM,KAAK,GAAW,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;IACtE,MAAM,EAAE,GAAW,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC3D,OAAO,EAAE,KAAK,EAAE,KAAuB,EAAE,EAAE,EAAE,EAAc,EAAE,CAAC;AAChE,CAAC;AAED,SAAS,IAAI,CAAC,MAAc,EAAE,MAAc,EAAE,OAAiB,GAAG;IAChE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,CAAC;AAC9D,CAAC;AAED,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,GAAW,EAAE,EAAE;YACxE,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACxD,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QACxD,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,OAAmB,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3E,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACzF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oEAAoE,EAAE,GAAG,EAAE;QAC9E,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CACnF,sBAAsB,CACvB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2DAA2D,EAAE,GAAG,EAAE;QACrE,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,sBAAsB,CAAC,CAAC;IAClG,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC/B,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gEAAgE,EAAE,GAAG,EAAE;QAC1E,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACzF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IAC3G,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6EAA6E,EAAE,GAAG,EAAE;QACvF,2EAA2E;QAC3E,6EAA6E;QAC7E,sCAAsC;QACtC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACzG,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACrC,IAAI,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACvE,wEAAwE;YACxE,2EAA2E;YAC3E,mFAAmF;YACnF,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACvF,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kEAAkE,EAAE,GAAG,EAAE;YAC5E,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CACjF,sBAAsB,CACvB,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC/D,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YAC3E,iDAAiD;YACjD,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC7C,MAAM,CAAC,cAAc,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACzE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC","sourcesContent":["/*\n * Copyright (c) 2026 Erik Fortune\n * SPDX-License-Identifier: MIT\n */\n\nimport '@fgv/ts-utils-jest';\nimport {\n  ICycleGuardEdge,\n  IEdgeTarget,\n  LinkType,\n  MemoryId,\n  MemoryScopeKey,\n  assertNoCycles,\n  buildCycleKey\n} from '../../../index';\n\nconst rel: LinkType = 'rel' as LinkType;\nconst DEFAULT_SCOPE: string = 'exp';\n\n/** A scope-qualified node, `scope#id` or a bare id defaulting to {@link DEFAULT_SCOPE}. */\nfunction node(spec: string): IEdgeTarget {\n  const hash: number = spec.indexOf('#');\n  const scope: string = hash >= 0 ? spec.slice(0, hash) : DEFAULT_SCOPE;\n  const id: string = hash >= 0 ? spec.slice(hash + 1) : spec;\n  return { scope: scope as MemoryScopeKey, id: id as MemoryId };\n}\n\nfunction edge(source: string, target: string, type: LinkType = rel): ICycleGuardEdge {\n  return { source: node(source), target: node(target), type };\n}\n\ndescribe('buildCycleKey', () => {\n  test('is deterministic for the same edge', () => {\n    expect(buildCycleKey(edge('a', 'b'))).toSucceedAndSatisfy((key: string) => {\n      expect(buildCycleKey(edge('a', 'b'))).toSucceedWith(key);\n    });\n  });\n\n  test('differs by direction and type', () => {\n    const forward = buildCycleKey(edge('a', 'b')).orThrow();\n    const reverse = buildCycleKey(edge('b', 'a')).orThrow();\n    const typed = buildCycleKey(edge('a', 'b', 'other' as LinkType)).orThrow();\n    expect(forward).not.toBe(reverse);\n    expect(forward).not.toBe(typed);\n  });\n});\n\ndescribe('assertNoCycles', () => {\n  test('accepts an acyclic graph', () => {\n    expect(assertNoCycles([edge('a', 'b')], [edge('b', 'c'), edge('c', 'd')])).toSucceed();\n  });\n\n  test('rejects a proposed edge that closes a cycle against existing edges', () => {\n    expect(assertNoCycles([edge('a', 'b'), edge('b', 'c')], [edge('c', 'a')])).toFailWith(\n      /would create a cycle/\n    );\n  });\n\n  test('rejects a cycle formed entirely within the proposed batch', () => {\n    expect(assertNoCycles([], [edge('a', 'b'), edge('b', 'a')])).toFailWith(/would create a cycle/);\n  });\n\n  test('rejects a self-loop', () => {\n    expect(assertNoCycles([], [edge('a', 'a')])).toFailWith(/self-loop/);\n  });\n\n  test('tolerates a duplicate proposed edge (deduped by canonical key)', () => {\n    expect(assertNoCycles([], [edge('a', 'b'), edge('a', 'b')])).toSucceed();\n  });\n\n  test('tolerates a duplicate existing edge', () => {\n    expect(assertNoCycles([edge('a', 'b'), edge('a', 'b')], [edge('b', 'c')])).toSucceed();\n  });\n\n  test('accepts a diamond (shared descendant is not a cycle)', () => {\n    expect(assertNoCycles([], [edge('a', 'b'), edge('a', 'c'), edge('b', 'd'), edge('c', 'd')])).toSucceed();\n  });\n\n  test('reachability tolerates a frontier node reached by two paths (revisit guard)', () => {\n    // Existing graph: a->c, a->b, b->c. A proposed edge z->a runs reachability\n    // from `a`, whose DFS pushes `c` twice before it is visited — exercising the\n    // visited-node skip in the traversal.\n    expect(assertNoCycles([edge('a', 'c'), edge('a', 'b'), edge('b', 'c')], [edge('z', 'a')])).toSucceed();\n  });\n\n  describe('scope-qualified nodes', () => {\n    test('does NOT conflate a stem shared across scopes into one node', () => {\n      // ca#x -> cb#y and cb#x -> ca#z reuse the stem `x` across scopes ca/cb.\n      // If the guard keyed on bare id, the two `x` nodes would merge and a false\n      // cycle could appear; with scoped keys they are distinct and the graph is acyclic.\n      expect(assertNoCycles([], [edge('ca#x', 'cb#y'), edge('cb#x', 'ca#z')])).toSucceed();\n    });\n\n    test('still rejects a genuine within-scope cycle across the same stems', () => {\n      expect(assertNoCycles([], [edge('ca#x', 'ca#y'), edge('ca#y', 'ca#x')])).toFailWith(\n        /would create a cycle/\n      );\n    });\n\n    test('a self-loop is detected on the full scoped identity', () => {\n      expect(assertNoCycles([], [edge('ca#x', 'ca#x')])).toFailWith(/self-loop/);\n      // Same stem, different scope is NOT a self-loop.\n      expect(assertNoCycles([], [edge('ca#x', 'cb#x')])).toSucceed();\n    });\n\n    test('names the scope in the diagnostic', () => {\n      expect(assertNoCycles([], [edge('ca#x', 'ca#x')])).toFailWith(/ca\\/x/);\n    });\n  });\n});\n"]}

package/dist/test/unit/ingest/orchestrator.test.js

@@ -5,7 +5,7 @@
 import '@fgv/ts-utils-jest';
 import { Converters, Logging, fail, succeed } from '@fgv/ts-utils';
 import { FileTree } from '@fgv/ts-json-base';
-import { BodyConverterRegistry, CONTRADICTS_LINK_TYPE, DEFAULT_SIMILARITY_THRESHOLD, DEFAULT_SIMILARITY_TOP_K, FileTreeMemoryStore, HOST_INGEST_PROVENANCE_SOURCE, InMemoryCosineIndex, KnowledgeIdentityCodec, LtmIdentityCodec, MemoryIngestOrchestrator, TemporalIdentityCodec, TemporalVersionedPolicy, serializeMemoryFile } from '../../../index';
+import { BodyConverterRegistry, CONTRADICTS_LINK_TYPE, DEFAULT_SIMILARITY_THRESHOLD, DEFAULT_SIMILARITY_TOP_K, FileTreeMemoryStore, HOST_INGEST_PROVENANCE_SOURCE, InMemoryCosineIndex, KnowledgeIdentityCodec, LtmIdentityCodec, MtmIdentityCodec, MemoryIngestOrchestrator, TemporalIdentityCodec, TemporalVersionedPolicy, serializeMemoryFile } from '../../../index';
 // --- kinds --------------------------------------------------------------------
 const noteKind = 'note';
 const factKind = 'fact';
@@ -89,10 +89,32 @@ function candidate(kind, entityId, body, opts = {}) {
         body
     };
 }
+/**
+ * A scope-qualified target, authored as `scope#id` or a bare id defaulting to the
+ * knowledge scope (where the note/num fixtures live). `kt` is the assertion-side
+ * spelling of the same helper.
+ */
+function scopedTarget(spec) {
+    const hash = spec.indexOf('#');
+    const scope = hash >= 0 ? spec.slice(0, hash) : 'knowledge';
+    const id = hash >= 0 ? spec.slice(hash + 1) : spec;
+    return { scope: scope, id: id };
+}
+function kt(id, scope = 'knowledge') {
+    return { scope: scope, id: id };
+}
+/** The scope-qualified reference of a candidate about to be written, by its entityId. */
+function srcOf(ctx, entityId) {
+    const found = ctx.candidates.find((rc) => rc.candidate.envelope.entityId === entityId);
+    if (found === undefined) {
+        throw new Error(`test relater: no candidate with entityId '${entityId}'`);
+    }
+    return found.id;
+}
 function candEdge(source, type, target, confidence) {
     return {
-        source: source,
-        edge: Object.assign({ type: type, target: target }, (confidence !== undefined ? { confidence } : {}))
+        source: scopedTarget(source),
+        edge: Object.assign({ type: type, target: scopedTarget(target) }, (confidence !== undefined ? { confidence } : {}))
     };
 }
 function buildStore(params = {}) {
@@ -163,7 +185,10 @@ describe('MemoryIngestOrchestrator', () => {
         test('classifies, extracts, and writes one record end-to-end with host-ingest provenance + derivedFrom', async () => {
             const store = buildStore();
             const orch = buildOrchestrator({ store });
-            const sourceId = 'turn-3';
+            const sourceId = {
+                scope: 'conversations/c1',
+                id: 'turn-3'
+            };
             const result = await orch.ingestItem({ id: 'doc-1', content: 'the sky is blue', sourceId });
             expect(result).toSucceedAndSatisfy((r) => {
                 var _a, _b, _c;
@@ -174,7 +199,7 @@ describe('MemoryIngestOrchestrator', () => {
                 expect(rec.resolution.verdict).toBe('new');
                 expect(rec.id).toBe('doc-1');
                 expect((_a = rec.record) === null || _a === void 0 ? void 0 : _a.envelope.provenance.source).toBe(HOST_INGEST_PROVENANCE_SOURCE);
-                expect((_b = rec.record) === null || _b === void 0 ? void 0 : _b.envelope.provenance.derivedFrom).toBe('turn-3');
+                expect((_b = rec.record) === null || _b === void 0 ? void 0 : _b.envelope.provenance.derivedFrom).toEqual(sourceId);
                 expect((_c = rec.record) === null || _c === void 0 ? void 0 : _c.body).toBe('the sky is blue');
                 expect(rec.interlock).toBeUndefined();
             });
@@ -249,6 +274,25 @@ describe('MemoryIngestOrchestrator', () => {
             });
             expect(await orch.ingestItem({ id: 'o-1', content: 'x' })).toFailWith(/no identity codec/);
         });
+        test('fails loudly when a pre-existing snapshot record cannot be scoped (no codec for its kind)', async () => {
+            // The store can persist a note (it has the note codec), but the orchestrator
+            // below is wired WITHOUT a note codec — so when it snapshots the store to run
+            // the edge path, it cannot resolve the seeded note's scope and fails loudly
+            // (never silently drops it from the cycle graph). This is the branch the
+            // scope-qualified edge change added.
+            const store = buildStore();
+            await putNote(store, 'legacy', 'anchor');
+            const orch = MemoryIngestOrchestrator.create({
+                store,
+                registry: registry(),
+                // Deliberately omit the note codec (and any default) that the seeded record needs.
+                codecs: new Map([[numKind, new KnowledgeIdentityCodec()]]),
+                classifier: classifier(() => succeed({ kind: numKind })),
+                extractor: extractor(() => succeed([candidate(numKind, 'n-1', 7)])),
+                relationExtractor: noEdges
+            }).orThrow();
+            expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/cannot resolve scope for stored record 'legacy'.*no identity codec registered for kind 'note'/i);
+        });
     });
     describe('stage 4 — exact dedup (layer 1)', () => {
         test('an exact {kind,body} match in scope is duplicate-of (no resolver)', async () => {
@@ -259,7 +303,7 @@ describe('MemoryIngestOrchestrator', () => {
             });
             expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
                 expect(r.records[0].disposition).toBe('deduped');
-                expect(r.records[0].resolution).toEqual({ verdict: 'duplicate-of', target: 'doc-a' });
+                expect(r.records[0].resolution).toEqual({ verdict: 'duplicate-of', target: kt('doc-a') });
                 expect(r.records[0].id).toBe('doc-a');
             });
             // doc-b was never written.
@@ -316,13 +360,17 @@ async function putNote(store, id, body) {
     (await store.put(rec)).orThrow();
 }
 function mockStore(overrides) {
-    var _a, _b, _c, _d, _e;
+    var _a, _b, _c, _d, _e, _f, _g;
     return {
         get: (_a = overrides.get) !== null && _a !== void 0 ? _a : (() => Promise.resolve(succeed(undefined))),
         getById: (_b = overrides.getById) !== null && _b !== void 0 ? _b : (() => Promise.resolve(succeed(undefined))),
         list: (_c = overrides.list) !== null && _c !== void 0 ? _c : (() => Promise.resolve(succeed([]))),
-        put: (_d = overrides.put) !== null && _d !== void 0 ? _d : ((r) => Promise.resolve(succeed(r))),
-        delete: (_e = overrides.delete) !== null && _e !== void 0 ? _e : (() => Promise.resolve(fail('n/a')))
+        listScoped: (_d = overrides.listScoped) !== null && _d !== void 0 ? _d : (() => Promise.resolve(succeed([]))),
+        asRecordSource: (_e = overrides.asRecordSource) !== null && _e !== void 0 ? _e : (() => ({
+            list: () => Promise.resolve(succeed([]))
+        })),
+        put: (_f = overrides.put) !== null && _f !== void 0 ? _f : ((r) => Promise.resolve(succeed(r))),
+        delete: (_g = overrides.delete) !== null && _g !== void 0 ? _g : (() => Promise.resolve(fail('n/a')))
     };
 }
 describe('MemoryIngestOrchestrator — stage 4 similarity (layer 2)', () => {
@@ -350,7 +398,7 @@ describe('MemoryIngestOrchestrator — stage 4 similarity (layer 2)', () => {
             store,
             vectorIndex,
             embed,
-            entityResolver: resolver((__c, similar) => succeed({ verdict: 'duplicate-of', target: similar[0].id })),
+            entityResolver: resolver((__c, similar) => succeed({ verdict: 'duplicate-of', target: similar[0].target })),
             extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
         });
         expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
@@ -367,12 +415,12 @@ describe('MemoryIngestOrchestrator — stage 4 similarity (layer 2)', () => {
             store,
             vectorIndex,
             embed,
-            entityResolver: resolver((__c, similar) => succeed({ verdict: 'supersede', target: similar[0].id })),
+            entityResolver: resolver((__c, similar) => succeed({ verdict: 'supersede', target: similar[0].target })),
             extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
         });
         expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
             expect(r.records[0].disposition).toBe('written');
-            expect(r.records[0].resolution).toEqual({ verdict: 'supersede', target: 'doc-a' });
+            expect(r.records[0].resolution).toEqual({ verdict: 'supersede', target: kt('doc-a') });
             expect(r.records[0].id).toBe('doc-b');
         });
         expect(await store.get(noteKind, 'doc-b')).toSucceedAndSatisfy((rec) => expect(rec === null || rec === void 0 ? void 0 : rec.body).toBe('apple tart'));
@@ -385,7 +433,7 @@ describe('MemoryIngestOrchestrator — stage 4 similarity (layer 2)', () => {
             store,
             vectorIndex,
             embed,
-            entityResolver: resolver((__c, similar) => succeed({ verdict: 'merge-into', target: similar[0].id })),
+            entityResolver: resolver((__c, similar) => succeed({ verdict: 'merge-into', target: similar[0].target })),
             extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
         });
         expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
@@ -404,10 +452,10 @@ describe('MemoryIngestOrchestrator — stage 4 similarity (layer 2)', () => {
             store,
             vectorIndex,
             embed,
-            entityResolver: resolver(() => succeed({ verdict: 'merge-into', target: 'ghost' })),
+            entityResolver: resolver(() => succeed({ verdict: 'merge-into', target: kt('ghost') })),
             extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
         });
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/merge-into target 'ghost' does not exist/);
+        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/merge-into target 'knowledge\/ghost' does not exist/);
     });
     test('a below-threshold neighbor is not surfaced (resolver not called)', async () => {
         const vectorIndex = InMemoryCosineIndex.create().orThrow();
@@ -444,9 +492,9 @@ describe('MemoryIngestOrchestrator — stage 4 similarity (layer 2)', () => {
     });
     test('a surfaced hit with no backing record is skipped', async () => {
         const ghostIndex = {
-            add: (id) => Promise.resolve(succeed(id)),
-            remove: (id) => Promise.resolve(succeed(id)),
-            query: () => Promise.resolve(succeed([{ id: 'ghost', score: 0.99 }]))
+            add: (t) => Promise.resolve(succeed(t.id)),
+            remove: (t) => Promise.resolve(succeed(t)),
+            query: () => Promise.resolve(succeed([{ target: kt('ghost'), score: 0.99 }]))
         };
         const orch = buildOrchestrator({
             store: buildStore(),
@@ -472,8 +520,8 @@ describe('MemoryIngestOrchestrator — stage 4 similarity (layer 2)', () => {
     });
     test('a similarity-query failure surfaces loudly', async () => {
         const failingIndex = {
-            add: (id) => Promise.resolve(succeed(id)),
-            remove: (id) => Promise.resolve(succeed(id)),
+            add: (t) => Promise.resolve(succeed(t.id)),
+            remove: (t) => Promise.resolve(succeed(t)),
             query: () => Promise.resolve(fail('query kaput'))
         };
         const orch = buildOrchestrator({
@@ -545,7 +593,7 @@ describe('MemoryIngestOrchestrator — stage 5 relate + cycle guard', () => {
             var _a;
             expect(r.records[0].edges).toHaveLength(1);
             expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([
-                { type: 'mentions', target: 'doc-a', confidence: 0.7 }
+                { type: 'mentions', target: kt('doc-a'), confidence: 0.7 }
             ]);
         });
     });
@@ -558,7 +606,7 @@ describe('MemoryIngestOrchestrator — stage 5 relate + cycle guard', () => {
         expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
             var _a;
             expect(r.records).toHaveLength(2);
-            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'rel', target: 'doc-c' }]);
+            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'rel', target: kt('doc-c') }]);
             expect(r.records[1].edges).toEqual([]);
         });
     });
@@ -568,7 +616,7 @@ describe('MemoryIngestOrchestrator — stage 5 relate + cycle guard', () => {
             extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'x')])),
             relationExtractor: relater(() => succeed([candEdge('ghost', 'rel', 'doc-b')]))
         });
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/edge source 'ghost' is not a candidate being written/);
+        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/edge source 'knowledge\/ghost' is not a candidate being written/);
     });
     test('rejects an edge whose target resolves to nothing', async () => {
         const orch = buildOrchestrator({
@@ -576,7 +624,7 @@ describe('MemoryIngestOrchestrator — stage 5 relate + cycle guard', () => {
             extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'x')])),
             relationExtractor: relater(() => succeed([candEdge('doc-b', 'rel', 'ghost')]))
         });
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/edge target 'ghost' resolves to neither/);
+        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/edge target 'knowledge\/ghost' resolves to neither/);
     });
     test('rejects a cycle-inducing edge (default guard)', async () => {
         const orch = buildOrchestrator({
@@ -595,8 +643,8 @@ describe('MemoryIngestOrchestrator — stage 5 relate + cycle guard', () => {
         });
         expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
             var _a, _b;
-            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'rel', target: 'doc-c' }]);
-            expect((_b = r.records[1].record) === null || _b === void 0 ? void 0 : _b.envelope.links).toEqual([{ type: 'rel', target: 'doc-b' }]);
+            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'rel', target: kt('doc-c') }]);
+            expect((_b = r.records[1].record) === null || _b === void 0 ? void 0 : _b.envelope.links).toEqual([{ type: 'rel', target: kt('doc-b') }]);
         });
     });
     test('a contradicts edge on a NON-temporal kind persists as a plain link (no interlock)', async () => {
@@ -610,7 +658,89 @@ describe('MemoryIngestOrchestrator — stage 5 relate + cycle guard', () => {
         expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
             var _a;
             expect(r.records[0].interlock).toBeUndefined();
-            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'contradicts', target: 'doc-a' }]);
+            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'contradicts', target: kt('doc-a') }]);
+        });
+    });
+    describe('_validateEdges cross-scope target disambiguation', () => {
+        // Two EXISTING records share the idStem 'turn-3' across two conversations
+        // (the MTM codec mints per-scope stems). A stage-5 edge target must resolve
+        // to the CORRECT (scope, id) — with bare-id keying both would alias and a
+        // wrong-scope target would silently validate. Guards the ingest-validation seam.
+        const mtmKind = 'mtm';
+        function mtmRegistry() {
+            const reg = registry();
+            reg.register(mtmKind, Converters.string);
+            return reg;
+        }
+        const mtmCodecs = new Map([
+            [mtmKind, new MtmIdentityCodec()]
+        ]);
+        async function seedTurn(store, entityId, body) {
+            const addr = new MtmIdentityCodec().encode(entityId).orThrow();
+            const rec = {
+                envelope: {
+                    id: addr.idStem,
+                    entityId: entityId,
+                    kind: mtmKind,
+                    tags: [],
+                    links: [],
+                    created: 0,
+                    updated: 0,
+                    seq: 0,
+                    contentHash: '',
+                    provenance: { source: 'agent' }
+                },
+                body
+            };
+            (await store.put(rec)).orThrow();
+        }
+        function buildMtmOrchestrator(store, relationExtractor) {
+            return MemoryIngestOrchestrator.create({
+                store,
+                registry: mtmRegistry(),
+                codecs: mtmCodecs,
+                classifier: classifier(() => succeed({ kind: mtmKind })),
+                // The candidate is a fresh turn-5 under conv-a (distinct stem from the seeds).
+                extractor: extractor(() => succeed([candidate(mtmKind, 'conv-a:5', 'a new turn')])),
+                relationExtractor
+            }).orThrow();
+        }
+        async function seededStore() {
+            const store = FileTreeMemoryStore.create({
+                root: mutableRoot(),
+                registry: mtmRegistry(),
+                codecs: mtmCodecs,
+                clock
+            }).orThrow();
+            await seedTurn(store, 'conv-a:3', 'anchor in conversation a');
+            await seedTurn(store, 'conv-b:3', 'anchor in conversation b');
+            return store;
+        }
+        test('accepts a same-stem edge target that resolves to the correct scope', async () => {
+            const store = await seededStore();
+            const orch = buildMtmOrchestrator(store, relater((ctx) => succeed([
+                {
+                    source: srcOf(ctx, 'conv-a:5'),
+                    edge: { type: 'rel', target: kt('turn-3', 'conversations/conv-a') }
+                }
+            ])));
+            expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
+                var _a;
+                expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([
+                    { type: 'rel', target: kt('turn-3', 'conversations/conv-a') }
+                ]);
+            });
+        });
+        test('rejects a same-stem edge target whose scope has no matching record', async () => {
+            const store = await seededStore();
+            const orch = buildMtmOrchestrator(store, relater((ctx) => succeed([
+                {
+                    source: srcOf(ctx, 'conv-a:5'),
+                    // turn-3 exists under conv-a and conv-b, but NOT conv-z.
+                    edge: { type: 'rel', target: kt('turn-3', 'conversations/conv-z') }
+                }
+            ])));
+            expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/edge target 'conversations\/conv-z\/turn-3' resolves to neither a sibling candidate nor an existing record/);
         });
     });
 });
@@ -631,13 +761,20 @@ describe('MemoryIngestOrchestrator — contradicts→temporal interlock', () =>
             store,
             classifier: classifyFact,
             extractor: extractor(() => succeed([candidate(factKind, 'fact-1', 'the sky is grey')])),
-            relationExtractor: relater(() => succeed([candEdge('fact-1', 'contradicts', v1Id)]))
+            relationExtractor: relater((ctx) => succeed([
+                {
+                    source: srcOf(ctx, 'fact-1'),
+                    edge: { type: CONTRADICTS_LINK_TYPE, target: kt(v1Id, 'facts/entities/fact-1') }
+                }
+            ]))
         });
         expect(await secondOrch.ingestItem({ id: 'fact-1', content: 'the sky is grey' })).toSucceedAndSatisfy((r) => {
             var _a;
             expect(r.records[0].interlock).toBe('temporal-versioned');
             expect(r.records[0].disposition).toBe('written');
-            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: CONTRADICTS_LINK_TYPE, target: v1Id }]);
+            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([
+                { type: CONTRADICTS_LINK_TYPE, target: kt(v1Id, 'facts/entities/fact-1') }
+            ]);
         });
         // The current version is the new (contradicting) one.
         expect(await store.get(factKind, 'fact-1')).toSucceedAndSatisfy((rec) => expect(rec === null || rec === void 0 ? void 0 : rec.body).toBe('the sky is grey'));
@@ -659,7 +796,12 @@ describe('MemoryIngestOrchestrator — contradicts→temporal interlock', () =>
             store,
             classifier: classifyFact,
             extractor: extractor(() => succeed([candidate(factKind, 'fact-1', 'grey')])),
-            relationExtractor: relater(() => succeed([candEdge('fact-1', 'contradicts', v1Id)]))
+            relationExtractor: relater((ctx) => succeed([
+                {
+                    source: srcOf(ctx, 'fact-1'),
+                    edge: { type: CONTRADICTS_LINK_TYPE, target: kt(v1Id, 'facts/entities/fact-1') }
+                }
+            ]))
         });
         (await o2.ingestItem({ id: 'fact-1', content: 'grey' })).orThrow();
         // Re-introduce the ORIGINAL body: the invalidated v1 must be skipped by exact
@@ -790,7 +932,7 @@ describe('MemoryIngestOrchestrator — review-punch-list fixes', () => {
         });
         expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceedAndSatisfy((r) => {
             var _a;
-            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'rel', target: 'doc-a' }]);
+            expect((_a = r.records[0].record) === null || _a === void 0 ? void 0 : _a.envelope.links).toEqual([{ type: 'rel', target: kt('doc-a') }]);
         });
     });
     test('two candidates merging into the same target do not duplicate a shared edge', async () => {
@@ -802,13 +944,13 @@ describe('MemoryIngestOrchestrator — review-punch-list fixes', () => {
             store,
             vectorIndex,
             embed,
-            entityResolver: resolver((__c, similar) => succeed({ verdict: 'merge-into', target: similar[0].id })),
+            entityResolver: resolver((__c, similar) => succeed({ verdict: 'merge-into', target: similar[0].target })),
             extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart'), candidate(noteKind, 'doc-c', 'apple tart')])),
             relationExtractor: relater(() => succeed([candEdge('doc-a', 'rel', 'doc-x')]))
         });
         expect(await orch.ingestItem({ id: 'i', content: 'x' })).toSucceed();
         expect(await store.get(noteKind, 'doc-a')).toSucceedAndSatisfy((rec) => {
-            expect(rec === null || rec === void 0 ? void 0 : rec.envelope.links).toEqual([{ type: 'rel', target: 'doc-x' }]);
+            expect(rec === null || rec === void 0 ? void 0 : rec.envelope.links).toEqual([{ type: 'rel', target: kt('doc-x') }]);
         });
     });
 });
@@ -838,18 +980,18 @@ describe('MemoryIngestOrchestrator — merge-into safety (second review)', () =>
         const store = buildStore({ vectorIndex, embed });
         await putFull(store, noteKind, 'doc-a', 'apple pie', {
             tags: ['old-tag'],
-            links: [{ type: 'existing', target: 'doc-z' }]
+            links: [{ type: 'existing', target: kt('doc-z') }]
         });
         await putFull(store, noteKind, 'doc-x', 'target of stage-5');
         const orch = buildOrchestrator({
             store,
             vectorIndex,
             embed,
-            entityResolver: resolver((__c, similar) => succeed({ verdict: 'merge-into', target: similar[0].id })),
+            entityResolver: resolver((__c, similar) => succeed({ verdict: 'merge-into', target: similar[0].target })),
             extractor: extractor(() => succeed([
                 candidate(noteKind, 'doc-b', 'apple tart', {
                     tags: ['new-tag'],
-                    links: [{ type: 'candlink', target: 'doc-z' }]
+                    links: [{ type: 'candlink', target: kt('doc-z') }]
                 })
             ])),
             relationExtractor: relater(() => succeed([candEdge('doc-a', 'stage5', 'doc-x')]))
@@ -863,9 +1005,9 @@ describe('MemoryIngestOrchestrator — merge-into safety (second review)', () =>
             expect([...((_a = rec === null || rec === void 0 ? void 0 : rec.envelope.tags) !== null && _a !== void 0 ? _a : [])].sort()).toEqual(['new-tag', 'old-tag']);
             // Original link + candidate link + stage-5 edge, each exactly once.
             expect(rec === null || rec === void 0 ? void 0 : rec.envelope.links).toEqual([
-                { type: 'existing', target: 'doc-z' },
-                { type: 'candlink', target: 'doc-z' },
-                { type: 'stage5', target: 'doc-x' }
+                { type: 'existing', target: kt('doc-z') },
+                { type: 'candlink', target: kt('doc-z') },
+                { type: 'stage5', target: kt('doc-x') }
             ]);
         });
     });
@@ -878,10 +1020,10 @@ describe('MemoryIngestOrchestrator — merge-into safety (second review)', () =>
             store,
             vectorIndex,
             embed,
-            entityResolver: resolver((__c, similar) => succeed({ verdict: 'merge-into', target: similar[0].id })),
+            entityResolver: resolver((__c, similar) => succeed({ verdict: 'merge-into', target: similar[0].target })),
             extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
         });
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/merge-into target 'conv-1' is kind 'ltm' but the candidate is kind 'note'/);
+        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/merge-into target 'conversations\/conv-1' is kind 'ltm' but the candidate is kind 'note'/);
     });
     test('supersede with a non-existent target fails loudly', async () => {
         const vectorIndex = InMemoryCosineIndex.create().orThrow();
@@ -891,10 +1033,10 @@ describe('MemoryIngestOrchestrator — merge-into safety (second review)', () =>
             store,
             vectorIndex,
             embed,
-            entityResolver: resolver(() => succeed({ verdict: 'supersede', target: 'ghost' })),
+            entityResolver: resolver(() => succeed({ verdict: 'supersede', target: kt('ghost') })),
             extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
         });
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/supersede target 'ghost' does not exist/);
+        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/supersede target 'knowledge\/ghost' does not exist/);
     });
     test('duplicate-of with a non-existent target fails loudly', async () => {
         const vectorIndex = InMemoryCosineIndex.create().orThrow();
@@ -904,10 +1046,10 @@ describe('MemoryIngestOrchestrator — merge-into safety (second review)', () =>
             store,
             vectorIndex,
             embed,
-            entityResolver: resolver(() => succeed({ verdict: 'duplicate-of', target: 'ghost' })),
+            entityResolver: resolver(() => succeed({ verdict: 'duplicate-of', target: kt('ghost') })),
             extractor: extractor(() => succeed([candidate(noteKind, 'doc-b', 'apple tart')]))
         });
-        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/duplicate-of target 'ghost' does not exist/);
+        expect(await orch.ingestItem({ id: 'i', content: 'x' })).toFailWith(/duplicate-of target 'knowledge\/ghost' does not exist/);
     });
 });
 //# sourceMappingURL=orchestrator.test.js.map