@remnic/core 10.0.99 → 10.0.101

package/dist/orchestration/buffer-drain-runner.js

@@ -1,8 +1,8 @@
 import {
   BufferDrainRunner,
   ClaimBufferStorage
-} from "../chunk-UBJ5RPDM.js";
-import "../chunk-VZMRKYNR.js";
+} from "../chunk-QIPDTAWZ.js";
+import "../chunk-MMOXCCHF.js";
 import "../chunk-6P7U3HWG.js";
 import "../chunk-PQM3B54K.js";
 import "../chunk-B3DR2JBZ.js";
@@ -175,7 +175,7 @@ import "../chunk-MDPT6QFK.js";
 import "../chunk-UOBPK2OS.js";
 import "../chunk-2YA5N2BY.js";
 import "../chunk-3HSRWJTC.js";
-import "../chunk-4PXDXCNE.js";
+import "../chunk-PL36IQPL.js";
 import "../chunk-HUDPXTXW.js";
 import "../chunk-AZEZSQ5R.js";
 import "../chunk-YAZNBMNF.js";

package/dist/orchestrator.js

@@ -6,7 +6,7 @@ import {
   mergeGraphExpandedResults,
   qmdStartupCollectionChecksWithTimeout,
   resolveEffectiveIdentityInjectionMode
-} from "./chunk-VZMRKYNR.js";
+} from "./chunk-MMOXCCHF.js";
 import "./chunk-6P7U3HWG.js";
 import "./chunk-PQM3B54K.js";
 import "./chunk-B3DR2JBZ.js";
@@ -183,7 +183,7 @@ import "./chunk-MDPT6QFK.js";
 import "./chunk-UOBPK2OS.js";
 import "./chunk-2YA5N2BY.js";
 import "./chunk-3HSRWJTC.js";
-import "./chunk-4PXDXCNE.js";
+import "./chunk-PL36IQPL.js";
 import "./chunk-HUDPXTXW.js";
 import "./chunk-AZEZSQ5R.js";
 import "./chunk-YAZNBMNF.js";

package/dist/recall-navigation.js

@@ -1,6 +1,6 @@
 import {
   runRecallNavigation
-} from "./chunk-VZMRKYNR.js";
+} from "./chunk-MMOXCCHF.js";
 import "./chunk-6P7U3HWG.js";
 import "./chunk-PQM3B54K.js";
 import "./chunk-B3DR2JBZ.js";
@@ -173,7 +173,7 @@ import "./chunk-MDPT6QFK.js";
 import "./chunk-UOBPK2OS.js";
 import "./chunk-2YA5N2BY.js";
 import "./chunk-3HSRWJTC.js";
-import "./chunk-4PXDXCNE.js";
+import "./chunk-PL36IQPL.js";
 import "./chunk-HUDPXTXW.js";
 import "./chunk-AZEZSQ5R.js";
 import "./chunk-YAZNBMNF.js";

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@remnic/core",
-  "version": "10.0.99",
+  "version": "10.0.101",
   "description": "Framework-agnostic Remnic memory engine — orchestrator, storage, extraction, search, trust zones",
   "type": "module",
   "main": "dist/index.js",
@@ -3386,7 +3386,7 @@
     "core"
   ],
   "peerDependencies": {
-    "@remnic/coding-graph": "^10.0.99"
+    "@remnic/coding-graph": "^10.0.101"
   },
   "peerDependenciesMeta": {
     "@remnic/coding-graph": {

package/src/entity-lazy-compatibility.test.ts

@@ -6,6 +6,26 @@ import test from "node:test";
 import { StorageManager, parseEntityFile } from "./storage.js";
 import { sleep } from "./utils/sleep.js";
 
+const deferredStores: StorageManager[] = [];
+
+// Opens a store the way the daemon does: the canonical-id migration starts in
+// the background. Registered so teardown can wait for it.
+async function deferStore(dir: string): Promise<StorageManager> {
+  const store = new StorageManager(dir);
+  deferredStores.push(store);
+  await store.ensureDirectories({ waitForEntityMigration: false });
+  return store;
+}
+
+// The deferred migration keeps writing under dir until it settles. Release any
+// lock the test holds, wait for every registered migration, then remove dir.
+async function disposeStore(dir: string): Promise<void> {
+  await rm(path.join(dir, "state", "entity-canonical-id-migration.lock"), { force: true });
+  await Promise.all(deferredStores.splice(0).map((store) => store.drainEntityCanonicalIdMigration()));
+  StorageManager.clearAllStaticCaches();
+  await rm(dir, { recursive: true, force: true });
+}
+
 async function legacyStore() {
   const dir = await mkdtemp(path.join(os.tmpdir(), "remnic-lazy-compat-"));
   const seed = new StorageManager(dir);
@@ -15,8 +35,7 @@ async function legacyStore() {
   await rm(journal, { force: true });
   const lock = path.join(dir, "state", "entity-canonical-id-migration.lock");
   await writeFile(lock, `${process.pid} test-holder ${new Date().toISOString()}\n`);
-  const storage = new StorageManager(dir);
-  await storage.ensureDirectories({ waitForEntityMigration: false });
+  const storage = await deferStore(dir);
   return { dir, id, journal, lock, storage };
 }
 
@@ -27,8 +46,7 @@ test("canonical reads find a legacy file without a journal or migration", async
     await assert.rejects(() => readFile(fixture.journal), { code: "ENOENT" });
     assert.ok(await readFile(fixture.lock));
   } finally {
-    StorageManager.clearAllStaticCaches();
-    await rm(fixture.dir, { recursive: true, force: true });
+    await disposeStore(fixture.dir);
   }
 });
 
@@ -39,8 +57,7 @@ test("ambiguous legacy canonical matches are refused rather than picking a claim
     await writeFile(path.join(fixture.dir, "entities", "other-legacy-person.md"), raw);
     await assert.rejects(() => fixture.storage.readEntity(fixture.id), /ambiguous/i);
   } finally {
-    StorageManager.clearAllStaticCaches();
-    await rm(fixture.dir, { recursive: true, force: true });
+    await disposeStore(fixture.dir);
   }
 });
 
@@ -50,8 +67,9 @@ test("completed migration skips corpus reads on repeated misses in a fresh read-
     const seed = new StorageManager(dir);
     await seed.writeEntity("Existing Person", "person", ["Synthetic fact."]);
     await seed.ensureDirectories();
-    const reader = new StorageManager(dir);
-    await reader.ensureDirectories({ waitForEntityMigration: false });
+    const reader = await deferStore(dir);
+    // Let the startup migration finish so only the readEntity calls below are counted.
+    await reader.drainEntityCanonicalIdMigration();
     // Bracket access is TypeScript's typed escape hatch for the private reader.
     const originalRead = reader["readStorageSecureFile"].bind(reader);
     const reads: string[] = [];
@@ -63,8 +81,7 @@ test("completed migration skips corpus reads on repeated misses in a fresh read-
     assert.equal(await reader.readEntity("person-missing"), "");
     assert.deepEqual(reads, ["person-missing.md", "person-missing.md"], "completed-store misses must not scan entity contents");
   } finally {
-    StorageManager.clearAllStaticCaches();
-    await rm(dir, { recursive: true, force: true });
+    await disposeStore(dir);
   }
 });
 
@@ -74,8 +91,7 @@ test("an external entities change invalidates the amortized completion verdict o
     const seed = new StorageManager(dir);
     const id = await seed.writeEntity("Café", "project", ["Synthetic legacy fact."]);
     await seed.ensureDirectories();
-    const reader = new StorageManager(dir);
-    await reader.ensureDirectories({ waitForEntityMigration: false });
+    const reader = await deferStore(dir);
     const canonical = reader.normalizeEntityName("Café", "project");
     // First miss computes and caches the completion verdict.
     assert.equal(await reader.readEntity("project-missing"), "");
@@ -84,8 +100,7 @@ test("an external entities change invalidates the amortized completion verdict o
     await rename(path.join(dir, "entities", `${id}.md`), path.join(dir, "entities", "legacy-cafe.md"));
     assert.match(await reader.readEntity(canonical), /Synthetic legacy fact/);
   } finally {
-    StorageManager.clearAllStaticCaches();
-    await rm(dir, { recursive: true, force: true });
+    await disposeStore(dir);
   }
 });
 
@@ -99,8 +114,7 @@ test("an external aliases change invalidates the amortized completion verdict on
     const journal = await readFile(journalPath, "utf8");
     assert.equal(JSON.parse(journal).complete, true);
 
-    const reader = new StorageManager(dir);
-    await reader.ensureDirectories({ waitForEntityMigration: false });
+    const reader = await deferStore(dir);
     // Warm amortized completion (and any same-reader completion memo) on a miss.
     assert.equal(await reader.readEntity("project-missing"), "");
 
@@ -121,8 +135,7 @@ test("an external aliases change invalidates the amortized completion verdict on
     assert.equal(await readFile(journalPath, "utf8"), journal, "read compatibility must not replay migration");
     assert.ok(await readFile(lock));
   } finally {
-    StorageManager.clearAllStaticCaches();
-    await rm(dir, { recursive: true, force: true });
+    await disposeStore(dir);
   }
 });
 
@@ -146,16 +159,14 @@ for (const change of ["aliases", "raw legacy write"]) {
       }
       const lock = path.join(dir, "state", "entity-canonical-id-migration.lock");
       await writeFile(lock, `${process.pid} test-holder ${new Date().toISOString()}\n`);
-      const reader = new StorageManager(dir);
-      await reader.ensureDirectories({ waitForEntityMigration: false });
+      const reader = await deferStore(dir);
       const canonical = reader.normalizeEntityName("Café", "project");
       if (change === "aliases") assert.notEqual(canonical, previousId);
       assert.match(await reader.readEntity(canonical), /Synthetic legacy fact/);
       assert.equal(await readFile(journalPath, "utf8"), journal, "read compatibility must not replay migration");
       assert.ok(await readFile(lock));
     } finally {
-      StorageManager.clearAllStaticCaches();
-      await rm(dir, { recursive: true, force: true });
+      await disposeStore(dir);
     }
   });
 }
@@ -221,8 +232,7 @@ for (const mutation of mutations) {
       const journal = JSON.parse(await readFile(fixture.journal, "utf8"));
       assert.equal(journal.complete, true);
     } finally {
-      StorageManager.clearAllStaticCaches();
-      await rm(fixture.dir, { recursive: true, force: true });
+      await disposeStore(fixture.dir);
     }
   });
 }

package/src/harmonic-graph-cache.test.ts

@@ -1,13 +1,14 @@
 import assert from "node:assert/strict";
-import { mkdtemp, readFile, rm, writeFile } from "node:fs/promises";
+import { mkdtemp, readFile, rename, rm, writeFile } from "node:fs/promises";
 import { tmpdir } from "node:os";
 import path from "node:path";
-import test from "node:test";
+import test, { type TestContext } from "node:test";
 import { recordAbstractionNode, upsertAbstractionNodes, type AbstractionNode } from "./abstraction-nodes.js";
 import { pruneOrphanCueAnchors, recordCueAnchor, upsertCueAnchors, type CueAnchor } from "./cue-anchors.js";
 import {
   clearHarmonicGraphCache,
   harmonicGraphCacheStats,
+  type ProjectedHarmonicGraph,
   readProjectedHarmonicGraph,
   searchHarmonicRetrieval,
 } from "./harmonic-retrieval.js";
@@ -228,6 +229,61 @@ test("pruneOrphanCueAnchors alone invalidates the cached graph", async () => {
   });
 });
 
+// Recall waits for the graph build, so a cache miss costs every recall that lands on it. Production: a
+// 2106 node, 9174 anchor graph rebuilt in 5 s standalone, 7 s inside the daemon, and 17 to 32 s when two
+// recalls overlapped and each ran its own build.
+test("concurrent reads on a cold cache share one build", async () => {
+  await withDir(async (memoryDir, storage) => {
+    const memory = await storage.writeMemory("fact", "theta shared fact", { source: "test" });
+    await recordAbstractionNode({ memoryDir, node: node("n1", "theta shared fact", [memory.id]) });
+    const before = { ...harmonicGraphCacheStats };
+    const [a, b, c] = await Promise.all([read(memoryDir), read(memoryDir), read(memoryDir)]);
+    assert.equal(harmonicGraphCacheStats.misses, before.misses + 1, "one build, not one per caller");
+    assert.equal(a, b);
+    assert.equal(b, c);
+  });
+});
+
+test("a caller that aborts leaves the shared build for the others", async () => {
+  await withDir(async (memoryDir, storage) => {
+    const memory = await storage.writeMemory("fact", "iota abort fact", { source: "test" });
+    await recordAbstractionNode({ memoryDir, node: node("n1", "iota abort fact", [memory.id]) });
+    const controller = new AbortController();
+    const aborted = readProjectedHarmonicGraph({ memoryDir, anchorsEnabled: true, useCache: true, abortSignal: controller.signal });
+    const other = read(memoryDir);
+    controller.abort();
+    await assert.rejects(aborted);
+    assert.equal((await other).nodes.length, 1);
+  });
+});
+
+// Unreadable node store: a file where the nodes directory belongs is not ENOENT, so the strict listing throws
+// (a corrupt node file would not: readAbstractionNodes skips those on purpose).
+async function breakNodeStore(memoryDir: string) {
+  const nodesDir = path.join(memoryDir, "state", "abstraction-nodes", "nodes");
+  const parked = `${nodesDir}.parked`;
+  await rename(nodesDir, parked);
+  await writeFile(nodesDir, "not a directory");
+  return async () => {
+    await rm(nodesDir, { force: true });
+    await rename(parked, nodesDir);
+  };
+}
+
+test("callers that joined a failing build all reject, and the next read retries and succeeds", async () => {
+  await withDir(async (memoryDir, storage) => {
+    const memory = await storage.writeMemory("fact", "mu retry fact", { source: "test" });
+    await recordAbstractionNode({ memoryDir, node: node("n1", "mu retry fact", [memory.id]) });
+    const restore = await breakNodeStore(memoryDir);
+    const missesBefore = harmonicGraphCacheStats.misses;
+    const outcomes = await Promise.allSettled([read(memoryDir), read(memoryDir), read(memoryDir)]);
+    assert.deepEqual(outcomes.map((outcome) => outcome.status), ["rejected", "rejected", "rejected"]);
+    assert.equal(harmonicGraphCacheStats.misses, missesBefore + 1, "the three callers shared one failing build");
+    await restore();
+    assert.equal((await read(memoryDir)).nodes.length, 1);
+  });
+});
+
 test("an entry older than the TTL is rebuilt", async (t) => {
   await withDir(async (memoryDir, storage) => {
     const memory = await storage.writeMemory("fact", "zeta ttl fact", { source: "test" });
@@ -242,3 +298,132 @@ test("an entry older than the TTL is rebuilt", async (t) => {
     assert.equal((await read(memoryDir)).nodes.length, 0, "rebuilt past the TTL");
   });
 });
+
+interface BuildHold {
+  release: () => void;
+  reached: Promise<void>;
+  calls: number;
+  signal?: AbortSignal;
+}
+
+/**
+ * Hold the first build inside its source-memory read so a second read can land while it runs. The held call
+ * records the build's own abort signal; builds started after it are not held.
+ */
+function holdFirstBuild(t: TestContext): BuildHold {
+  const original = StorageManager.prototype.readAllMemories;
+  let release = () => {};
+  const opened = new Promise<void>((resolve) => {
+    release = resolve;
+  });
+  let reachedHold = () => {};
+  const reached = new Promise<void>((resolve) => {
+    reachedHold = resolve;
+  });
+  const hold: BuildHold = { release, reached, calls: 0 };
+  t.mock.method(StorageManager.prototype, "readAllMemories", async function (this: StorageManager, ...args: Parameters<typeof original>) {
+    hold.calls++;
+    if (hold.calls === 1) {
+      hold.signal = args[0]?.abortSignal;
+      reachedHold();
+      await opened;
+    }
+    return original.apply(this, args);
+  });
+  return hold;
+}
+
+/** Fail the test instead of hanging when a promise that must settle does not. */
+function within<T>(promise: Promise<T>, ms: number, what: string): Promise<T> {
+  return Promise.race([
+    promise,
+    new Promise<never>((_resolve, reject) => setTimeout(() => reject(new Error(`${what} did not settle in ${ms} ms`)), ms).unref()),
+  ]);
+}
+
+test("the shared build aborts once every joined caller has aborted, and the next read starts a fresh one", async (t) => {
+  await withDir(async (memoryDir, storage) => {
+    const memory = await storage.writeMemory("fact", "nu abort fact", { source: "test" });
+    await recordAbstractionNode({ memoryDir, node: node("n1", "nu abort fact", [memory.id]) });
+    const hold = holdFirstBuild(t);
+    const first = new AbortController();
+    const second = new AbortController();
+    const options = { memoryDir, anchorsEnabled: true, useCache: true };
+    const a = readProjectedHarmonicGraph({ ...options, abortSignal: first.signal });
+    const b = readProjectedHarmonicGraph({ ...options, abortSignal: second.signal });
+    await within(hold.reached, 2000, "build start");
+    assert.equal(hold.calls, 1, "one build for both callers");
+    first.abort();
+    await assert.rejects(within(a, 1000, "first caller"), { name: "AbortError" });
+    assert.equal(hold.signal?.aborted, false, "one caller is still waiting, so the build keeps running");
+    second.abort();
+    await assert.rejects(within(b, 1000, "second caller"), { name: "AbortError" });
+    assert.equal(hold.signal?.aborted, true, "no caller is left, so the build is cancelled");
+    const missesBefore = harmonicGraphCacheStats.misses;
+    const next = read(memoryDir);
+    assert.equal(harmonicGraphCacheStats.misses, missesBefore + 1, "the next read does not join the cancelled build");
+    assert.equal((await within(next, 5000, "next read")).nodes.length, 1);
+    hold.release();
+  });
+});
+
+test("a read after a stamp change does not join the build that started on the old stamp", async (t) => {
+  await withDir(async (memoryDir, storage) => {
+    const first = await storage.writeMemory("fact", "xi stamp fact one", { source: "test" });
+    await recordAbstractionNode({ memoryDir, node: node("n1", "xi stamp fact one", [first.id]) });
+    const hold = holdFirstBuild(t);
+    const missesBefore = harmonicGraphCacheStats.misses;
+    const stale = read(memoryDir);
+    await within(hold.reached, 2000, "old build start");
+    const second = await storage.writeMemory("fact", "xi stamp fact two", { source: "test" });
+    await recordAbstractionNode({ memoryDir, node: node("n2", "xi stamp fact two", [second.id]) });
+    try {
+      const fresh = read(memoryDir);
+      assert.equal(harmonicGraphCacheStats.misses, missesBefore + 2, "the second read started its own build");
+      assert.equal((await within(fresh, 5000, "fresh read")).nodes.length, 2, "and it sees the write");
+    } finally {
+      hold.release();
+    }
+    await stale;
+  });
+});
+
+test("a joined caller that aborts rejects at once, while the build it joined is still running", async (t) => {
+  await withDir(async (memoryDir, storage) => {
+    const memory = await storage.writeMemory("fact", "omicron join fact", { source: "test" });
+    await recordAbstractionNode({ memoryDir, node: node("n1", "omicron join fact", [memory.id]) });
+    const hold = holdFirstBuild(t);
+    const owner = read(memoryDir);
+    const controller = new AbortController();
+    const joiner = readProjectedHarmonicGraph({ memoryDir, anchorsEnabled: true, useCache: true, abortSignal: controller.signal });
+    controller.abort();
+    try {
+      await assert.rejects(within(joiner, 1000, "aborted joiner"), { name: "AbortError" });
+    } finally {
+      hold.release();
+    }
+    assert.equal((await owner).nodes.length, 1, "the owner is not affected");
+  });
+});
+
+test("clearing the cache drops a running build: the next read starts its own and the old build stores nothing", async (t) => {
+  await withDir(async (memoryDir, storage) => {
+    const memory = await storage.writeMemory("fact", "pi clear fact", { source: "test" });
+    await recordAbstractionNode({ memoryDir, node: node("n1", "pi clear fact", [memory.id]) });
+    const hold = holdFirstBuild(t);
+    const missesBefore = harmonicGraphCacheStats.misses;
+    const old = read(memoryDir);
+    await within(hold.reached, 2000, "old build start");
+    clearHarmonicGraphCache();
+    let kept: ProjectedHarmonicGraph;
+    try {
+      const fresh = read(memoryDir);
+      assert.equal(harmonicGraphCacheStats.misses, missesBefore + 2, "the read after the clear did not join the old build");
+      kept = await within(fresh, 5000, "fresh read");
+    } finally {
+      hold.release();
+    }
+    await old;
+    assert.equal(await read(memoryDir), kept, "the finished old build did not overwrite the newer cache entry");
+  });
+});

package/src/harmonic-retrieval.ts

@@ -1,7 +1,7 @@
 import path from "node:path";
 import { realpath } from "node:fs/promises";
 import { listJsonFilesStrict, readJsonFile } from "./json-store.js";
-import { throwIfAborted } from "./abort-error.js";
+import { raceAbort, throwIfAborted } from "./abort-error.js";
 import { readHarmonicGraphStamp } from "./harmonic-graph-version.js";
 import { inferMemoryStatus, toMemoryPathRel } from "./memory-lifecycle-ledger-utils.js";
  import {
@@ -471,8 +471,20 @@ interface GraphCacheEntry {
 }
 
 const graphCache = new Map<string, GraphCacheEntry>();
-/** Counters for tests and diagnostics. */
-export const harmonicGraphCacheStats = { hits: 0, misses: 0 };
+
+interface GraphBuild {
+  stamp: string;
+  promise: Promise<ProjectedHarmonicGraph>;
+  /** Cancels the build's source scan; fired when no caller is waiting for it. */
+  controller: AbortController;
+  /** Callers currently waiting for this build. */
+  waiting: number;
+}
+
+/** One build per cache key at a time: every recall that lands on a miss waits for the same build. */
+const graphBuilds = new Map<string, GraphBuild>();
+/** Counters for tests and diagnostics. `shared` counts reads that joined a build already running. */
+export const harmonicGraphCacheStats = { hits: 0, misses: 0, shared: 0 };
 
 /** Freeze records and their nested arrays/objects so a caller cannot corrupt the shared cache. */
 function deepFreeze<T extends object>(value: T): T {
@@ -485,6 +497,60 @@ function deepFreeze<T extends object>(value: T): T {
 
 export function clearHarmonicGraphCache(): void {
   graphCache.clear();
+  graphBuilds.clear();
+}
+
+type GraphReadOptions = Parameters<typeof buildProjectedHarmonicGraph>[0];
+
+/**
+ * Start the one build for `key`. The build owns an abort controller instead of using one caller's signal,
+ * so a caller that leaves does not cancel it for the others; `joinGraphBuild` cancels it when the last caller leaves.
+ */
+function startGraphBuild(key: string, stamp: string, options: GraphReadOptions): GraphBuild {
+  harmonicGraphCacheStats.misses++;
+  const startedAtMs = Date.now();
+  const controller = new AbortController();
+  const promise: Promise<ProjectedHarmonicGraph> = buildProjectedHarmonicGraph({
+    memoryDir: options.memoryDir,
+    abstractionNodeStoreDir: options.abstractionNodeStoreDir,
+    anchorsEnabled: options.anchorsEnabled,
+    temporalExpiredInInjection: options.temporalExpiredInInjection,
+    abortSignal: controller.signal,
+  })
+    .then((built) => {
+      const graph = { nodes: deepFreeze(built.nodes), anchors: deepFreeze(built.anchors) };
+      // A cleared cache or a newer build for this key has replaced this one: do not store a stale graph.
+      if (graphBuilds.get(key)?.promise !== promise) return graph;
+      graphCache.delete(key);
+      graphCache.set(key, { stamp, startedAtMs, graph });
+      while (graphCache.size > GRAPH_CACHE_MAX_ENTRIES) {
+        const oldest = graphCache.keys().next().value;
+        if (oldest === undefined) break;
+        graphCache.delete(oldest);
+      }
+      return graph;
+    })
+    .finally(() => {
+      if (graphBuilds.get(key)?.promise === promise) graphBuilds.delete(key);
+    });
+  const build: GraphBuild = { stamp, promise, controller, waiting: 0 };
+  graphBuilds.set(key, build);
+  return build;
+}
+
+/**
+ * Wait for `build` on behalf of one caller. The caller's own signal ends only its own wait. When the last
+ * waiting caller has left, the build is cancelled and dropped, so abandoned recalls do not leave full scans running
+ * (cancelling a build that already finished does nothing).
+ */
+function joinGraphBuild(key: string, build: GraphBuild, signal: AbortSignal | undefined): Promise<ProjectedHarmonicGraph> {
+  build.waiting++;
+  return raceAbort(build.promise, signal, "harmonic retrieval aborted").finally(() => {
+    build.waiting--;
+    if (build.waiting > 0) return;
+    if (graphBuilds.get(key) === build) graphBuilds.delete(key);
+    build.controller.abort();
+  });
 }
 
 /**
@@ -495,9 +561,9 @@ export function clearHarmonicGraphCache(): void {
  * cold-write version sentinels (bumped by every memory write, in any process) and
  * the graph version sentinel (bumped by node and anchor writes). A stamp read is
  * four stats, not a scan of the memories. The TTL bounds the one input a sentinel
- * cannot see, which is wall-clock validity expiry. An explicit `nowMs` bypasses the
- * cache so tests stay deterministic. The cached arrays are frozen: callers must not
- * mutate them.
+ * cannot see, which is wall-clock validity expiry. Concurrent misses share one
+ * build. An explicit `nowMs` bypasses the cache so tests stay deterministic. The
+ * cached arrays are frozen: callers must not mutate them.
  */
 export async function readProjectedHarmonicGraph(options: {
   memoryDir: string;
@@ -529,20 +595,12 @@ export async function readProjectedHarmonicGraph(options: {
     graphCache.set(key, hit);
     return hit.graph;
   }
-  harmonicGraphCacheStats.misses++;
-  const built = await buildProjectedHarmonicGraph(options);
-  const graph = {
-    nodes: deepFreeze(built.nodes),
-    anchors: deepFreeze(built.anchors),
-  };
-  graphCache.delete(key);
-  graphCache.set(key, { stamp, startedAtMs, graph });
-  while (graphCache.size > GRAPH_CACHE_MAX_ENTRIES) {
-    const oldest = graphCache.keys().next().value;
-    if (oldest === undefined) break;
-    graphCache.delete(oldest);
+  const running = graphBuilds.get(key);
+  if (running?.stamp === stamp) {
+    harmonicGraphCacheStats.shared++;
+    return joinGraphBuild(key, running, options.abortSignal);
   }
-  return graph;
+  return joinGraphBuild(key, startGraphBuild(key, stamp, options), options.abortSignal);
 }
 
 export async function searchHarmonicRetrieval(options: {

package/dist/chunk-4PXDXCNE.js.map

@@ -1 +0,0 @@
-{"version":3,"sources":["../src/harmonic-retrieval.ts"],"sourcesContent":["import path from \"node:path\";\nimport { realpath } from \"node:fs/promises\";\nimport { listJsonFilesStrict, readJsonFile } from \"./json-store.js\";\nimport { throwIfAborted } from \"./abort-error.js\";\nimport { readHarmonicGraphStamp } from \"./harmonic-graph-version.js\";\nimport { inferMemoryStatus, toMemoryPathRel } from \"./memory-lifecycle-ledger-utils.js\";\n import {\n   HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY,\n   resolveAbstractionNodeStoreDir,\n   validateAbstractionNode,\n   type AbstractionNode,\n } from \"./abstraction-nodes.js\";\nimport { resolveCueAnchorStoreDir, validateCueAnchor, type CueAnchor, type CueAnchorType } from \"./cue-anchors.js\";\nimport { compareDeterministicStrings } from \"./deterministic-order.js\";\nimport { countRecallTokenOverlap, normalizeRecallTokens } from \"./recall-tokenization.js\";\nimport { stripAttributesSuffix } from \"./structured-attributes.js\";\nimport { isValidityExpiredNow } from \"./temporal-validity.js\";\nimport { assertSafePathSegment, isRecord } from \"./store-contract.js\";\nimport { isSupportPassportPrivateMemory } from \"./support-passport/card-projection.js\";\nimport type { MemoryFile } from \"./types.js\";\nimport { readProjectedMemoryStates } from \"./memory-projection-batch.js\";\nimport { SecureStoreLockedError } from \"./secure-store/secure-fs.js\";\nimport { StorageManager } from \"./storage.js\";\nimport { RECALL_FALLBACK_DIRS } from \"./utils/category-dir.js\";\nimport { readHarmonicSourceMemory, readUnresolvedHarmonicSources } from \"./harmonic-source-lookup.js\";\n\n\ntype SourceMemoryMap = Map<string, MemoryFile>;\n\n\n// An index older than this is treated as unusable: the date window needed to\n// cover \"created since the last rebuild\" would stop being cheap.\nconst INDEX_MAX_AGE_MS = 7 * 86_400_000;\nconst DAY_MS = 86_400_000;\n\nfunction utcDaysSince(rebuiltMs: number, nowMs: number): string[] {\n  const days: string[] = [];\n  for (let day = Math.floor((rebuiltMs - DAY_MS) / DAY_MS) * DAY_MS; day <= nowMs; day += DAY_MS) {\n    days.push(new Date(day).toISOString().slice(0, 10));\n  }\n  return days;\n}\n\n\n// Memories the projection has no row for were written after its last rebuild, so\n// their dated directory is normally one of `days`. Hot and cold tiers are probed\n// by exact path. Only recall-corpus categories are probed: `questions/` is a queue\n// and `artifacts/` is outside the recall surface, so neither can be a source.\nfunction unprojectedCandidatePaths(memoryDir: string, id: string, days: string[]): string[] {\n  const paths: string[] = [];\n  for (const root of [memoryDir, path.join(memoryDir, \"cold\")]) {\n    for (const dir of RECALL_FALLBACK_DIRS) {\n      paths.push(path.join(root, dir, `${id}.md`));\n      for (const day of days) paths.push(path.join(root, dir, day, `${id}.md`));\n    }\n  }\n  return paths;\n}\n\n/** Resolve indexed sources first, then use the durable unresolved-id path cache. */\nasync function readIndexedSourceMemories(options: {\n  memoryDir: string;\n  abortSignal?: AbortSignal;\n  sourceMemoryIds: string[];\n  nowMs: number;\n}): Promise<SourceMemoryMap | null> {\n  // The ids go to SQL as bound parameters, so any id the projection holds is safe to look up.\n  const batch = readProjectedMemoryStates(options.memoryDir, options.sourceMemoryIds);\n  const rebuiltMs = Date.parse(batch?.rebuiltAt ?? \"\");\n  if (!batch?.complete || !batch.rebuiltAt || !Number.isFinite(rebuiltMs) || options.nowMs - rebuiltMs > INDEX_MAX_AGE_MS) return null;\n  const rootReal = await realpath(options.memoryDir).catch(() => null);\n  if (rootReal === null) return null;\n\n  const storage = new StorageManager(options.memoryDir);\n  const days = utcDaysSince(rebuiltMs, options.nowMs);\n  const sourceMemories: SourceMemoryMap = new Map();\n  const pending: string[] = [];\n  for (const id of options.sourceMemoryIds) {\n    const state = batch.states.get(id);\n    // An id is only ever joined into a path when it is a single safe segment.\n    let safeId = true;\n    try {\n      assertSafePathSegment(id, \"sourceMemoryId\");\n    } catch {\n      safeId = false;\n    }\n    // state.path was containment-checked by the projection reader.\n    const candidates = state\n      ? [state.path, path.join(options.memoryDir, \"cold\", state.pathRel)]\n      : safeId ? unprojectedCandidatePaths(options.memoryDir, id, days) : [];\n    let found = false;\n    for (const candidate of candidates) {\n      const memory = await readHarmonicSourceMemory(storage, rootReal, candidate, options.abortSignal);\n      if (memory?.frontmatter.id !== id) continue;\n      sourceMemories.set(id, memory);\n      found = true;\n      break;\n    }\n    if (!found) pending.push(id);\n  }\n  if (pending.length === 0) return sourceMemories;\n\n  const unresolved = await readUnresolvedHarmonicSources({\n    storage, rootReal, rebuiltAt: batch.rebuiltAt, sourceMemoryIds: pending,\n    nowMs: options.nowMs, abortSignal: options.abortSignal,\n  });\n  for (const [id, memory] of unresolved) sourceMemories.set(id, memory);\n  return sourceMemories;\n}\n\nasync function readCorpusSourceMemories(options: {\n  memoryDir: string;\n  abortSignal?: AbortSignal;\n}): Promise<SourceMemoryMap> {\n  const sourceMemories: SourceMemoryMap = new Map();\n  try {\n    const storage = new StorageManager(options.memoryDir);\n    const [hotMemories, coldMemories] = await Promise.all([\n      storage.readAllMemories({ abortSignal: options.abortSignal }),\n      storage.readAllColdMemories({ abortSignal: options.abortSignal }),\n    ]);\n    for (const memory of [...hotMemories, ...coldMemories]) {\n      throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n      sourceMemories.set(memory.frontmatter.id, memory);\n    }\n  } catch (err) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    if (err instanceof SecureStoreLockedError) return new Map();\n    // Source validation fails closed when the authorized memory directory is\n    // unreadable. Source-less nodes remain eligible for retrieval.\n    sourceMemories.clear();\n  }\n  return sourceMemories;\n}\n\nasync function readSourceMemories(options: {\n  memoryDir: string;\n  abortSignal?: AbortSignal;\n  sourceMemoryIds: string[];\n  nowMs?: number;\n}): Promise<SourceMemoryMap> {\n  try {\n    const indexed = await readIndexedSourceMemories({\n      memoryDir: options.memoryDir,\n      abortSignal: options.abortSignal,\n      sourceMemoryIds: options.sourceMemoryIds,\n      nowMs: options.nowMs ?? Date.now(),\n    });\n    if (indexed) return indexed;\n  } catch (err) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    if (err instanceof SecureStoreLockedError) return new Map();\n  }\n  return readCorpusSourceMemories(options);\n}\n\nfunction parseSourceMemoryInsertedAt(node: AbstractionNode): Map<string, string> {\n  const insertedAtById = new Map<string, string>();\n  const insertedAtRaw = node.metadata?.[HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY];\n  if (!insertedAtRaw) return insertedAtById;\n  try {\n    const parsed = JSON.parse(insertedAtRaw) as unknown;\n    if (!isRecord(parsed)) return insertedAtById;\n    for (const [memoryId, value] of Object.entries(parsed)) {\n      if (typeof value === \"string\") insertedAtById.set(memoryId, value);\n    }\n  } catch {\n    // Malformed insertion metadata leaves ordering on the recordedAt fallback.\n  }\n  return insertedAtById;\n}\n\nfunction projectSourceBackedNode(\n  node: AbstractionNode,\n  sourceMemories: SourceMemoryMap,\n  memoryDir: string,\n  temporalExpiredInInjection: boolean,\n  nowMs: number\n): AbstractionNode | null {\n  const sourceMemoryIds = node.sourceMemoryIds ?? [];\n  if (sourceMemoryIds.length === 0) return node;\n\n  const activeSourceMemoryIds = sourceMemoryIds.filter((memoryId) => {\n    const memory = sourceMemories.get(memoryId);\n    return (\n      memory !== undefined &&\n      // #2332: a private support-passport record leaves the eligible set the\n      // same way a rejected one does — a node title or anchor attribution\n      // rebuilt from it would leak governed metadata into the deep-recall\n      // frontier (and every other graph reader) before any content check runs.\n      !isSupportPassportPrivateMemory(memory) &&\n      inferMemoryStatus(memory.frontmatter, toMemoryPathRel(memoryDir, memory.path)) === \"active\" &&\n      (temporalExpiredInInjection || !isValidityExpiredNow(memory.frontmatter, nowMs))\n    );\n  });\n  if (activeSourceMemoryIds.length === 0) return null;\n\n // Newest-first source order keeps the projected title and summary on the most\n // recently inserted facts. Equal or missing timestamps fall back to ascending\n // id order, which matches the stored sourceMemoryIds order.\n const insertedAtById = parseSourceMemoryInsertedAt(node);\n const insertedAtMs = (memoryId: string): number => {\n   const parsedMs = Date.parse(insertedAtById.get(memoryId) ?? \"\");\n   return Number.isFinite(parsedMs) ? parsedMs : Date.parse(node.recordedAt);\n };\n activeSourceMemoryIds.sort(\n   (left, right) =>\n     insertedAtMs(right) - insertedAtMs(left) || compareDeterministicStrings(left, right)\n );\n\n  const activeMemories = activeSourceMemoryIds.flatMap((memoryId) => {\n    const memory = sourceMemories.get(memoryId);\n    return memory ? [memory] : [];\n  });\n  const activeContents = activeMemories.map((memory) =>\n    memory.frontmatter.structuredAttributes ? stripAttributesSuffix(memory.content) : memory.content\n  );\n let metadata: Record<string, string> | undefined;\n const activeInsertedAt = activeSourceMemoryIds.flatMap((memoryId) => {\n   const value = insertedAtById.get(memoryId);\n   return typeof value === \"string\" ? [[memoryId, value] as const] : [];\n });\n if (activeInsertedAt.length > 0) {\n   metadata = {\n     [HARMONIC_SOURCE_MEMORY_INSERTED_AT_KEY]: JSON.stringify(Object.fromEntries(activeInsertedAt)),\n   };\n  }\n\n return {\n   ...node,\n   sourceMemoryIds: activeSourceMemoryIds,\n   title: activeContents[0]?.slice(0, 80) ?? node.title,\n   summary: activeContents.slice(0, 3).join(\"; \").slice(0, 400),\n   tags: [...new Set(activeMemories.flatMap((memory) => memory.frontmatter.tags))].sort(compareDeterministicStrings),\n   entityRefs: [\n     ...new Set(\n       activeMemories.flatMap((memory) =>\n         typeof memory.frontmatter.entityRef === \"string\" ? [memory.frontmatter.entityRef] : []\n       )\n     ),\n   ].sort(compareDeterministicStrings),\n   metadata,\n };\n}\n\nfunction anchorMatchesProjectedNode(\n  anchor: CueAnchor,\n  nodeRef: string,\n  node: AbstractionNode,\n  allowLegacyAttribution: boolean\n): boolean {\n  const activeSourceMemoryIds = node.sourceMemoryIds ?? [];\n  if (activeSourceMemoryIds.length === 0) return true;\n  if (!anchor.sourceMemoryIdsByNodeRef) return allowLegacyAttribution;\n  const anchorSourceMemoryIds = anchor.sourceMemoryIdsByNodeRef[nodeRef] ?? [];\n  return anchorSourceMemoryIds.some((sourceMemoryId) => activeSourceMemoryIds.includes(sourceMemoryId));\n}\n\nexport interface HarmonicMatchedAnchor {\n  anchorId: string;\n  anchorType: CueAnchorType;\n  anchorValue: string;\n}\n\nexport interface HarmonicRetrievalResult {\n  node: AbstractionNode;\n  score: number;\n  nodeScore: number;\n  anchorScore: number;\n  matchedFields: string[];\n  matchedAnchors: HarmonicMatchedAnchor[];\n}\n\ninterface HarmonicCandidate {\n  node: AbstractionNode;\n  nodeScore: number;\n  anchorScore: number;\n  matchedFields: Set<string>;\n  matchedAnchors: Map<string, HarmonicMatchedAnchor>;\n}\n\nfunction scoreNode(node: AbstractionNode, queryTokens: Set<string>): { score: number; matchedFields: string[] } {\n  const matchedFields: string[] = [];\n  let score = 0;\n\n  const titleMatches = countRecallTokenOverlap(queryTokens, node.title);\n  if (titleMatches > 0) {\n    score += titleMatches * 3;\n    matchedFields.push(\"title\");\n  }\n\n  const summaryMatches = countRecallTokenOverlap(queryTokens, node.summary);\n  if (summaryMatches > 0) {\n    score += summaryMatches * 3;\n    matchedFields.push(\"summary\");\n  }\n\n  const tagMatches = countRecallTokenOverlap(queryTokens, node.tags?.join(\" \"));\n  if (tagMatches > 0) {\n    score += tagMatches * 2;\n    matchedFields.push(\"tags\");\n  }\n\n  const entityMatches = countRecallTokenOverlap(queryTokens, node.entityRefs?.join(\" \"));\n  if (entityMatches > 0) {\n    score += entityMatches * 2;\n    matchedFields.push(\"entityRefs\");\n  }\n\n  const kindMatches = countRecallTokenOverlap(queryTokens, `${node.kind} ${node.abstractionLevel}`);\n  if (kindMatches > 0) {\n    score += kindMatches;\n    matchedFields.push(\"kind\");\n  }\n\n  return { score, matchedFields };\n}\n\nfunction scoreAnchor(\n  anchor: CueAnchor,\n  queryTokens: Set<string>,\n  eligibleNodeTags: readonly string[]\n): { score: number; matchedFields: string[] } {\n  const matchedFields: string[] = [];\n  let score = 0;\n\n  const valueMatches = countRecallTokenOverlap(queryTokens, anchor.anchorValue);\n  const normalizedMatches = countRecallTokenOverlap(queryTokens, anchor.normalizedCue);\n  const cueMatches = Math.max(valueMatches, normalizedMatches);\n  if (cueMatches > 0) {\n    score += cueMatches * 4;\n    if (valueMatches > 0) matchedFields.push(\"anchorValue\");\n    if (normalizedMatches > 0) matchedFields.push(\"anchor\");\n  }\n\n  const typeMatches = countRecallTokenOverlap(queryTokens, anchor.anchorType);\n  if (typeMatches > 0) {\n    score += typeMatches;\n    matchedFields.push(\"anchorType\");\n  }\n\n  const tagMatches = countRecallTokenOverlap(queryTokens, eligibleNodeTags.join(\" \"));\n  if (tagMatches > 0) {\n    score += tagMatches * 2;\n    matchedFields.push(\"anchorTags\");\n  }\n\n  return { score, matchedFields };\n}\n\nexport async function readAbstractionNodes(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n}): Promise<AbstractionNode[]> {\n  const rootDir = resolveAbstractionNodeStoreDir(options.memoryDir, options.abstractionNodeStoreDir);\n  const files = await listJsonFilesStrict(path.join(rootDir, \"nodes\"), { allowMissingDirectory: true });\n  const nodes: AbstractionNode[] = [];\n  for (const filePath of files) {\n    try {\n      nodes.push(validateAbstractionNode(await readJsonFile(filePath)));\n    } catch {\n      // fail-open: invalid artifacts stay visible via status tooling instead of recall\n    }\n  }\n  return nodes;\n}\n\nexport async function readCueAnchors(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n}): Promise<CueAnchor[]> {\n  const abstractionRoot = resolveAbstractionNodeStoreDir(options.memoryDir, options.abstractionNodeStoreDir);\n  const rootDir = resolveCueAnchorStoreDir(abstractionRoot);\n  const files = await listJsonFilesStrict(rootDir, { allowMissingDirectory: true });\n  const anchors: CueAnchor[] = [];\n  for (const filePath of files) {\n    try {\n      anchors.push(validateCueAnchor(await readJsonFile(filePath)));\n    } catch {\n      // fail-open: invalid artifacts stay visible via status tooling instead of recall\n    }\n  }\n  return anchors;\n}\n\nexport interface ProjectedHarmonicGraph {\n  nodes: AbstractionNode[];\n  anchors: CueAnchor[];\n}\n\n/**\n * Read nodes + anchors and project BOTH against the namespace's current active\n * memories. This is the single projection every graph reader shares: a raw\n * `readAbstractionNodes` / `readCueAnchors` pair still carries the stored title,\n * summary, tags, and anchor attribution of a memory that was later rejected,\n * quarantined, or otherwise moved out of the active set, so a second reader\n * that skipped the projection could leak governed metadata even when the\n * memory itself is excluded from the final results.\n *\n * - A node whose every source memory left the active set is dropped.\n * - A surviving node's title/summary/tags/entityRefs are rebuilt from its\n *   active sources only.\n * - An anchor keeps a node reference only while its attribution runs through\n *   one of that node's surviving active sources, and is dropped once no\n *   reference survives.\n */\nasync function buildProjectedHarmonicGraph(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n  anchorsEnabled: boolean;\n  abortSignal?: AbortSignal;\n  temporalExpiredInInjection?: boolean;\n  nowMs?: number;\n}): Promise<ProjectedHarmonicGraph> {\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const nodes = await readAbstractionNodes(options);\n  const sourceMemoryIds = [...new Set(nodes.flatMap((node) => node.sourceMemoryIds ?? []))];\n  const sourceMemories: SourceMemoryMap = sourceMemoryIds.length > 0\n    ? await readSourceMemories({\n        memoryDir: options.memoryDir,\n        abortSignal: options.abortSignal,\n        sourceMemoryIds,\n        nowMs: options.nowMs,\n      })\n    : new Map();\n  const nowMs = options.nowMs ?? Date.now();\n  // A node whose full stored source set survived projection keeps legacy\n  // anchor attribution (an anchor written before per-node source ids existed).\n  const legacyCompatibleNodeRefs = new Set<string>();\n  const projectedNodes = nodes.flatMap((node) => {\n    const projected = projectSourceBackedNode(\n      node,\n      sourceMemories,\n      options.memoryDir,\n      options.temporalExpiredInInjection === true,\n      nowMs\n    );\n    if (\n      projected &&\n      (node.sourceMemoryIds?.length ?? 0) > 0 &&\n      projected.sourceMemoryIds?.length === node.sourceMemoryIds?.length\n    ) {\n      legacyCompatibleNodeRefs.add(node.nodeId);\n    }\n    return projected ? [projected] : [];\n  });\n  if (!options.anchorsEnabled) return { nodes: projectedNodes, anchors: [] };\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const nodeIndex = new Map(projectedNodes.map((node) => [node.nodeId, node]));\n  const anchors = (await readCueAnchors(options)).flatMap((anchor) => {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const nodeRefs = anchor.nodeRefs.filter((nodeRef) => {\n      const node = nodeIndex.get(nodeRef);\n      return (\n        node !== undefined &&\n        anchorMatchesProjectedNode(anchor, nodeRef, node, legacyCompatibleNodeRefs.has(nodeRef))\n      );\n    });\n    return nodeRefs.length > 0 ? [{ ...anchor, nodeRefs }] : [];\n  });\n  return { nodes: projectedNodes, anchors };\n}\n\nconst GRAPH_CACHE_TTL_MS = 30_000;\nconst GRAPH_CACHE_MAX_ENTRIES = 8;\n\ninterface GraphCacheEntry {\n  stamp: string;\n  startedAtMs: number;\n  graph: ProjectedHarmonicGraph;\n}\n\nconst graphCache = new Map<string, GraphCacheEntry>();\n/** Counters for tests and diagnostics. */\nexport const harmonicGraphCacheStats = { hits: 0, misses: 0 };\n\n/** Freeze records and their nested arrays/objects so a caller cannot corrupt the shared cache. */\nfunction deepFreeze<T extends object>(value: T): T {\n  // isFrozen is true for primitives and null, and a frozen value is not revisited, so this ends on cycles too.\n  if (Object.isFrozen(value)) return value;\n  Object.freeze(value);\n  for (const child of Object.values(value)) deepFreeze(child);\n  return value;\n}\n\nexport function clearHarmonicGraphCache(): void {\n  graphCache.clear();\n}\n\n/**\n * `readProjectedHarmonicGraph` with an opt-in in-memory cache. Every recall used\n * to re-read all nodes, anchors and source memories from disk (about 4.7 s on a\n * 2107 node, 9199 anchor, 4105 source graph). With `useCache` a completed graph is\n * reused while the stamp below is unchanged: the memory corpus, memory status and\n * cold-write version sentinels (bumped by every memory write, in any process) and\n * the graph version sentinel (bumped by node and anchor writes). A stamp read is\n * four stats, not a scan of the memories. The TTL bounds the one input a sentinel\n * cannot see, which is wall-clock validity expiry. An explicit `nowMs` bypasses the\n * cache so tests stay deterministic. The cached arrays are frozen: callers must not\n * mutate them.\n */\nexport async function readProjectedHarmonicGraph(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n  anchorsEnabled: boolean;\n  abortSignal?: AbortSignal;\n  temporalExpiredInInjection?: boolean;\n  nowMs?: number;\n  useCache?: boolean;\n}): Promise<ProjectedHarmonicGraph> {\n  if (options.useCache !== true || options.nowMs !== undefined) return buildProjectedHarmonicGraph(options);\n  // Same cancellation contract as the builder: a cache hit must not mask an aborted signal.\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const nodeStoreDir = resolveAbstractionNodeStoreDir(options.memoryDir, options.abstractionNodeStoreDir);\n  const key = JSON.stringify([\n    options.memoryDir,\n    nodeStoreDir,\n    options.anchorsEnabled === true,\n    options.temporalExpiredInInjection === true,\n  ]);\n  // The stamp is read BEFORE the build, so a write that lands mid-build leaves the\n  // entry stale and the next call rebuilds.\n  const stamp = readHarmonicGraphStamp(options.memoryDir, nodeStoreDir);\n  const startedAtMs = Date.now();\n  const hit = graphCache.get(key);\n  if (hit && hit.stamp === stamp && startedAtMs - hit.startedAtMs < GRAPH_CACHE_TTL_MS) {\n    harmonicGraphCacheStats.hits++;\n    graphCache.delete(key);\n    graphCache.set(key, hit);\n    return hit.graph;\n  }\n  harmonicGraphCacheStats.misses++;\n  const built = await buildProjectedHarmonicGraph(options);\n  const graph = {\n    nodes: deepFreeze(built.nodes),\n    anchors: deepFreeze(built.anchors),\n  };\n  graphCache.delete(key);\n  graphCache.set(key, { stamp, startedAtMs, graph });\n  while (graphCache.size > GRAPH_CACHE_MAX_ENTRIES) {\n    const oldest = graphCache.keys().next().value;\n    if (oldest === undefined) break;\n    graphCache.delete(oldest);\n  }\n  return graph;\n}\n\nexport async function searchHarmonicRetrieval(options: {\n  memoryDir: string;\n  abstractionNodeStoreDir?: string;\n  query: string;\n  maxResults: number;\n  sessionKey?: string;\n  anchorsEnabled: boolean;\n  abortSignal?: AbortSignal;\n  temporalExpiredInInjection?: boolean;\n  /** Share one projected graph between recalls until a write bumps a version sentinel (see readProjectedHarmonicGraph). */\n  useGraphCache?: boolean;\n}): Promise<HarmonicRetrievalResult[]> {\n  throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n  const queryTokens = new Set(normalizeRecallTokens(options.query, [\"what\", \"which\"]));\n  if (queryTokens.size === 0 || options.maxResults <= 0) return [];\n\n  // One projection for every graph reader: nodes and anchors both arrive\n  // already narrowed to the namespace's current active memories.\n  const { nodes: eligibleNodes, anchors } = await readProjectedHarmonicGraph({\n    ...options,\n    useCache: options.useGraphCache === true,\n  });\n  const candidates = new Map<string, HarmonicCandidate>();\n\n  for (const node of eligibleNodes) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const { score, matchedFields } = scoreNode(node, queryTokens);\n    if (score <= 0) continue;\n    candidates.set(node.nodeId, {\n      node,\n      nodeScore: score,\n      anchorScore: 0,\n      matchedFields: new Set(matchedFields),\n      matchedAnchors: new Map(),\n    });\n  }\n\n  if (options.anchorsEnabled) {\n    throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n    const nodeIndex = new Map(eligibleNodes.map((node) => [node.nodeId, node]));\n    for (const anchor of anchors) {\n      throwIfAborted(options.abortSignal, \"harmonic retrieval aborted\");\n      // `nodeRefs` are the projection's surviving references already.\n      const eligibleNodeRefs = anchor.nodeRefs;\n      const eligibleNodeTags = new Set(eligibleNodeRefs.flatMap((nodeRef) => nodeIndex.get(nodeRef)?.tags ?? []));\n      const eligibleAnchorTags = anchor.tags?.filter((tag) => eligibleNodeTags.has(tag)) ?? [];\n      const { score, matchedFields } = scoreAnchor(anchor, queryTokens, eligibleAnchorTags);\n      if (score <= 0) continue;\n      for (const nodeRef of eligibleNodeRefs) {\n        const node = nodeIndex.get(nodeRef);\n        if (!node) continue;\n        const existing = candidates.get(nodeRef) ?? {\n          node,\n          nodeScore: 0,\n          anchorScore: 0,\n          matchedFields: new Set<string>(),\n          matchedAnchors: new Map<string, HarmonicMatchedAnchor>(),\n        };\n        existing.anchorScore += score;\n        existing.matchedFields.add(\"anchor\");\n        for (const field of matchedFields) existing.matchedFields.add(field);\n        existing.matchedAnchors.set(anchor.anchorId, {\n          anchorId: anchor.anchorId,\n          anchorType: anchor.anchorType,\n          anchorValue: anchor.anchorValue,\n        });\n        candidates.set(nodeRef, existing);\n      }\n    }\n  }\n\n  return [...candidates.values()]\n    .map((candidate) => {\n      let score = candidate.nodeScore + candidate.anchorScore;\n      if (options.sessionKey && candidate.node.sessionKey === options.sessionKey) score += 0.5;\n      return {\n        node: candidate.node,\n        score,\n        nodeScore: candidate.nodeScore,\n        anchorScore: candidate.anchorScore,\n        matchedFields: [...candidate.matchedFields].sort(),\n        matchedAnchors: [...candidate.matchedAnchors.values()].sort(\n          (left, right) =>\n            left.anchorType.localeCompare(right.anchorType) || left.anchorValue.localeCompare(right.anchorValue)\n        ),\n      };\n    })\n    .filter((result) => result.nodeScore > 0 || result.anchorScore > 0)\n    .sort(\n      (left, right) =>\n        right.score - left.score ||\n        right.anchorScore - left.anchorScore ||\n        right.node.recordedAt.localeCompare(left.node.recordedAt)\n    )\n    .slice(0, options.maxResults);\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,UAAU;AACjB,SAAS,gBAAgB;AA+BzB,IAAM,mBAAmB,IAAI;AAC7B,IAAM,SAAS;AAEf,SAAS,aAAa,WAAmB,OAAyB;AAChE,QAAM,OAAiB,CAAC;AACxB,WAAS,MAAM,KAAK,OAAO,YAAY,UAAU,MAAM,IAAI,QAAQ,OAAO,OAAO,OAAO,QAAQ;AAC9F,SAAK,KAAK,IAAI,KAAK,GAAG,EAAE,YAAY,EAAE,MAAM,GAAG,EAAE,CAAC;AAAA,EACpD;AACA,SAAO;AACT;AAOA,SAAS,0BAA0B,WAAmB,IAAY,MAA0B;AAC1F,QAAM,QAAkB,CAAC;AACzB,aAAW,QAAQ,CAAC,WAAW,KAAK,KAAK,WAAW,MAAM,CAAC,GAAG;AAC5D,eAAW,OAAO,sBAAsB;AACtC,YAAM,KAAK,KAAK,KAAK,MAAM,KAAK,GAAG,EAAE,KAAK,CAAC;AAC3C,iBAAW,OAAO,KAAM,OAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,GAAG,EAAE,KAAK,CAAC;AAAA,IAC1E;AAAA,EACF;AACA,SAAO;AACT;AAGA,eAAe,0BAA0B,SAKL;AAElC,QAAM,QAAQ,0BAA0B,QAAQ,WAAW,QAAQ,eAAe;AAClF,QAAM,YAAY,KAAK,MAAM,OAAO,aAAa,EAAE;AACnD,MAAI,CAAC,OAAO,YAAY,CAAC,MAAM,aAAa,CAAC,OAAO,SAAS,SAAS,KAAK,QAAQ,QAAQ,YAAY,iBAAkB,QAAO;AAChI,QAAM,WAAW,MAAM,SAAS,QAAQ,SAAS,EAAE,MAAM,MAAM,IAAI;AACnE,MAAI,aAAa,KAAM,QAAO;AAE9B,QAAM,UAAU,IAAI,eAAe,QAAQ,SAAS;AACpD,QAAM,OAAO,aAAa,WAAW,QAAQ,KAAK;AAClD,QAAM,iBAAkC,oBAAI,IAAI;AAChD,QAAM,UAAoB,CAAC;AAC3B,aAAW,MAAM,QAAQ,iBAAiB;AACxC,UAAM,QAAQ,MAAM,OAAO,IAAI,EAAE;AAEjC,QAAI,SAAS;AACb,QAAI;AACF,4BAAsB,IAAI,gBAAgB;AAAA,IAC5C,QAAQ;AACN,eAAS;AAAA,IACX;AAEA,UAAM,aAAa,QACf,CAAC,MAAM,MAAM,KAAK,KAAK,QAAQ,WAAW,QAAQ,MAAM,OAAO,CAAC,IAChE,SAAS,0BAA0B,QAAQ,WAAW,IAAI,IAAI,IAAI,CAAC;AACvE,QAAI,QAAQ;AACZ,eAAW,aAAa,YAAY;AAClC,YAAM,SAAS,MAAM,yBAAyB,SAAS,UAAU,WAAW,QAAQ,WAAW;AAC/F,UAAI,QAAQ,YAAY,OAAO,GAAI;AACnC,qBAAe,IAAI,IAAI,MAAM;AAC7B,cAAQ;AACR;AAAA,IACF;AACA,QAAI,CAAC,MAAO,SAAQ,KAAK,EAAE;AAAA,EAC7B;AACA,MAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,QAAM,aAAa,MAAM,8BAA8B;AAAA,IACrD;AAAA,IAAS;AAAA,IAAU,WAAW,MAAM;AAAA,IAAW,iBAAiB;AAAA,IAChE,OAAO,QAAQ;AAAA,IAAO,aAAa,QAAQ;AAAA,EAC7C,CAAC;AACD,aAAW,CAAC,IAAI,MAAM,KAAK,WAAY,gBAAe,IAAI,IAAI,MAAM;AACpE,SAAO;AACT;AAEA,eAAe,yBAAyB,SAGX;AAC3B,QAAM,iBAAkC,oBAAI,IAAI;AAChD,MAAI;AACF,UAAM,UAAU,IAAI,eAAe,QAAQ,SAAS;AACpD,UAAM,CAAC,aAAa,YAAY,IAAI,MAAM,QAAQ,IAAI;AAAA,MACpD,QAAQ,gBAAgB,EAAE,aAAa,QAAQ,YAAY,CAAC;AAAA,MAC5D,QAAQ,oBAAoB,EAAE,aAAa,QAAQ,YAAY,CAAC;AAAA,IAClE,CAAC;AACD,eAAW,UAAU,CAAC,GAAG,aAAa,GAAG,YAAY,GAAG;AACtD,qBAAe,QAAQ,aAAa,4BAA4B;AAChE,qBAAe,IAAI,OAAO,YAAY,IAAI,MAAM;AAAA,IAClD;AAAA,EACF,SAAS,KAAK;AACZ,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAI,eAAe,uBAAwB,QAAO,oBAAI,IAAI;AAG1D,mBAAe,MAAM;AAAA,EACvB;AACA,SAAO;AACT;AAEA,eAAe,mBAAmB,SAKL;AAC3B,MAAI;AACF,UAAM,UAAU,MAAM,0BAA0B;AAAA,MAC9C,WAAW,QAAQ;AAAA,MACnB,aAAa,QAAQ;AAAA,MACrB,iBAAiB,QAAQ;AAAA,MACzB,OAAO,QAAQ,SAAS,KAAK,IAAI;AAAA,IACnC,CAAC;AACD,QAAI,QAAS,QAAO;AAAA,EACtB,SAAS,KAAK;AACZ,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAI,eAAe,uBAAwB,QAAO,oBAAI,IAAI;AAAA,EAC5D;AACA,SAAO,yBAAyB,OAAO;AACzC;AAEA,SAAS,4BAA4B,MAA4C;AAC/E,QAAM,iBAAiB,oBAAI,IAAoB;AAC/C,QAAM,gBAAgB,KAAK,WAAW,sCAAsC;AAC5E,MAAI,CAAC,cAAe,QAAO;AAC3B,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,aAAa;AACvC,QAAI,CAAC,SAAS,MAAM,EAAG,QAAO;AAC9B,eAAW,CAAC,UAAU,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACtD,UAAI,OAAO,UAAU,SAAU,gBAAe,IAAI,UAAU,KAAK;AAAA,IACnE;AAAA,EACF,QAAQ;AAAA,EAER;AACA,SAAO;AACT;AAEA,SAAS,wBACP,MACA,gBACA,WACA,4BACA,OACwB;AACxB,QAAM,kBAAkB,KAAK,mBAAmB,CAAC;AACjD,MAAI,gBAAgB,WAAW,EAAG,QAAO;AAEzC,QAAM,wBAAwB,gBAAgB,OAAO,CAAC,aAAa;AACjE,UAAM,SAAS,eAAe,IAAI,QAAQ;AAC1C,WACE,WAAW;AAAA;AAAA;AAAA;AAAA,IAKX,CAAC,+BAA+B,MAAM,KACtC,kBAAkB,OAAO,aAAa,gBAAgB,WAAW,OAAO,IAAI,CAAC,MAAM,aAClF,8BAA8B,CAAC,qBAAqB,OAAO,aAAa,KAAK;AAAA,EAElF,CAAC;AACD,MAAI,sBAAsB,WAAW,EAAG,QAAO;AAKhD,QAAM,iBAAiB,4BAA4B,IAAI;AACvD,QAAM,eAAe,CAAC,aAA6B;AACjD,UAAM,WAAW,KAAK,MAAM,eAAe,IAAI,QAAQ,KAAK,EAAE;AAC9D,WAAO,OAAO,SAAS,QAAQ,IAAI,WAAW,KAAK,MAAM,KAAK,UAAU;AAAA,EAC1E;AACA,wBAAsB;AAAA,IACpB,CAAC,MAAM,UACL,aAAa,KAAK,IAAI,aAAa,IAAI,KAAK,4BAA4B,MAAM,KAAK;AAAA,EACvF;AAEC,QAAM,iBAAiB,sBAAsB,QAAQ,CAAC,aAAa;AACjE,UAAM,SAAS,eAAe,IAAI,QAAQ;AAC1C,WAAO,SAAS,CAAC,MAAM,IAAI,CAAC;AAAA,EAC9B,CAAC;AACD,QAAM,iBAAiB,eAAe;AAAA,IAAI,CAAC,WACzC,OAAO,YAAY,uBAAuB,sBAAsB,OAAO,OAAO,IAAI,OAAO;AAAA,EAC3F;AACD,MAAI;AACJ,QAAM,mBAAmB,sBAAsB,QAAQ,CAAC,aAAa;AACnE,UAAM,QAAQ,eAAe,IAAI,QAAQ;AACzC,WAAO,OAAO,UAAU,WAAW,CAAC,CAAC,UAAU,KAAK,CAAU,IAAI,CAAC;AAAA,EACrE,CAAC;AACD,MAAI,iBAAiB,SAAS,GAAG;AAC/B,eAAW;AAAA,MACT,CAAC,sCAAsC,GAAG,KAAK,UAAU,OAAO,YAAY,gBAAgB,CAAC;AAAA,IAC/F;AAAA,EACD;AAED,SAAO;AAAA,IACL,GAAG;AAAA,IACH,iBAAiB;AAAA,IACjB,OAAO,eAAe,CAAC,GAAG,MAAM,GAAG,EAAE,KAAK,KAAK;AAAA,IAC/C,SAAS,eAAe,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,EAAE,MAAM,GAAG,GAAG;AAAA,IAC3D,MAAM,CAAC,GAAG,IAAI,IAAI,eAAe,QAAQ,CAAC,WAAW,OAAO,YAAY,IAAI,CAAC,CAAC,EAAE,KAAK,2BAA2B;AAAA,IAChH,YAAY;AAAA,MACV,GAAG,IAAI;AAAA,QACL,eAAe;AAAA,UAAQ,CAAC,WACtB,OAAO,OAAO,YAAY,cAAc,WAAW,CAAC,OAAO,YAAY,SAAS,IAAI,CAAC;AAAA,QACvF;AAAA,MACF;AAAA,IACF,EAAE,KAAK,2BAA2B;AAAA,IAClC;AAAA,EACF;AACD;AAEA,SAAS,2BACP,QACA,SACA,MACA,wBACS;AACT,QAAM,wBAAwB,KAAK,mBAAmB,CAAC;AACvD,MAAI,sBAAsB,WAAW,EAAG,QAAO;AAC/C,MAAI,CAAC,OAAO,yBAA0B,QAAO;AAC7C,QAAM,wBAAwB,OAAO,yBAAyB,OAAO,KAAK,CAAC;AAC3E,SAAO,sBAAsB,KAAK,CAAC,mBAAmB,sBAAsB,SAAS,cAAc,CAAC;AACtG;AAyBA,SAAS,UAAU,MAAuB,aAAsE;AAC9G,QAAM,gBAA0B,CAAC;AACjC,MAAI,QAAQ;AAEZ,QAAM,eAAe,wBAAwB,aAAa,KAAK,KAAK;AACpE,MAAI,eAAe,GAAG;AACpB,aAAS,eAAe;AACxB,kBAAc,KAAK,OAAO;AAAA,EAC5B;AAEA,QAAM,iBAAiB,wBAAwB,aAAa,KAAK,OAAO;AACxE,MAAI,iBAAiB,GAAG;AACtB,aAAS,iBAAiB;AAC1B,kBAAc,KAAK,SAAS;AAAA,EAC9B;AAEA,QAAM,aAAa,wBAAwB,aAAa,KAAK,MAAM,KAAK,GAAG,CAAC;AAC5E,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,QAAM,gBAAgB,wBAAwB,aAAa,KAAK,YAAY,KAAK,GAAG,CAAC;AACrF,MAAI,gBAAgB,GAAG;AACrB,aAAS,gBAAgB;AACzB,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,QAAM,cAAc,wBAAwB,aAAa,GAAG,KAAK,IAAI,IAAI,KAAK,gBAAgB,EAAE;AAChG,MAAI,cAAc,GAAG;AACnB,aAAS;AACT,kBAAc,KAAK,MAAM;AAAA,EAC3B;AAEA,SAAO,EAAE,OAAO,cAAc;AAChC;AAEA,SAAS,YACP,QACA,aACA,kBAC4C;AAC5C,QAAM,gBAA0B,CAAC;AACjC,MAAI,QAAQ;AAEZ,QAAM,eAAe,wBAAwB,aAAa,OAAO,WAAW;AAC5E,QAAM,oBAAoB,wBAAwB,aAAa,OAAO,aAAa;AACnF,QAAM,aAAa,KAAK,IAAI,cAAc,iBAAiB;AAC3D,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,QAAI,eAAe,EAAG,eAAc,KAAK,aAAa;AACtD,QAAI,oBAAoB,EAAG,eAAc,KAAK,QAAQ;AAAA,EACxD;AAEA,QAAM,cAAc,wBAAwB,aAAa,OAAO,UAAU;AAC1E,MAAI,cAAc,GAAG;AACnB,aAAS;AACT,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,QAAM,aAAa,wBAAwB,aAAa,iBAAiB,KAAK,GAAG,CAAC;AAClF,MAAI,aAAa,GAAG;AAClB,aAAS,aAAa;AACtB,kBAAc,KAAK,YAAY;AAAA,EACjC;AAEA,SAAO,EAAE,OAAO,cAAc;AAChC;AAEA,eAAsB,qBAAqB,SAGZ;AAC7B,QAAM,UAAU,+BAA+B,QAAQ,WAAW,QAAQ,uBAAuB;AACjG,QAAM,QAAQ,MAAM,oBAAoB,KAAK,KAAK,SAAS,OAAO,GAAG,EAAE,uBAAuB,KAAK,CAAC;AACpG,QAAM,QAA2B,CAAC;AAClC,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,YAAM,KAAK,wBAAwB,MAAM,aAAa,QAAQ,CAAC,CAAC;AAAA,IAClE,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAEA,eAAsB,eAAe,SAGZ;AACvB,QAAM,kBAAkB,+BAA+B,QAAQ,WAAW,QAAQ,uBAAuB;AACzG,QAAM,UAAU,yBAAyB,eAAe;AACxD,QAAM,QAAQ,MAAM,oBAAoB,SAAS,EAAE,uBAAuB,KAAK,CAAC;AAChF,QAAM,UAAuB,CAAC;AAC9B,aAAW,YAAY,OAAO;AAC5B,QAAI;AACF,cAAQ,KAAK,kBAAkB,MAAM,aAAa,QAAQ,CAAC,CAAC;AAAA,IAC9D,QAAQ;AAAA,IAER;AAAA,EACF;AACA,SAAO;AACT;AAuBA,eAAe,4BAA4B,SAOP;AAClC,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,QAAQ,MAAM,qBAAqB,OAAO;AAChD,QAAM,kBAAkB,CAAC,GAAG,IAAI,IAAI,MAAM,QAAQ,CAAC,SAAS,KAAK,mBAAmB,CAAC,CAAC,CAAC,CAAC;AACxF,QAAM,iBAAkC,gBAAgB,SAAS,IAC7D,MAAM,mBAAmB;AAAA,IACvB,WAAW,QAAQ;AAAA,IACnB,aAAa,QAAQ;AAAA,IACrB;AAAA,IACA,OAAO,QAAQ;AAAA,EACjB,CAAC,IACD,oBAAI,IAAI;AACZ,QAAM,QAAQ,QAAQ,SAAS,KAAK,IAAI;AAGxC,QAAM,2BAA2B,oBAAI,IAAY;AACjD,QAAM,iBAAiB,MAAM,QAAQ,CAAC,SAAS;AAC7C,UAAM,YAAY;AAAA,MAChB;AAAA,MACA;AAAA,MACA,QAAQ;AAAA,MACR,QAAQ,+BAA+B;AAAA,MACvC;AAAA,IACF;AACA,QACE,cACC,KAAK,iBAAiB,UAAU,KAAK,KACtC,UAAU,iBAAiB,WAAW,KAAK,iBAAiB,QAC5D;AACA,+BAAyB,IAAI,KAAK,MAAM;AAAA,IAC1C;AACA,WAAO,YAAY,CAAC,SAAS,IAAI,CAAC;AAAA,EACpC,CAAC;AACD,MAAI,CAAC,QAAQ,eAAgB,QAAO,EAAE,OAAO,gBAAgB,SAAS,CAAC,EAAE;AACzE,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,YAAY,IAAI,IAAI,eAAe,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAC3E,QAAM,WAAW,MAAM,eAAe,OAAO,GAAG,QAAQ,CAAC,WAAW;AAClE,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,WAAW,OAAO,SAAS,OAAO,CAAC,YAAY;AACnD,YAAM,OAAO,UAAU,IAAI,OAAO;AAClC,aACE,SAAS,UACT,2BAA2B,QAAQ,SAAS,MAAM,yBAAyB,IAAI,OAAO,CAAC;AAAA,IAE3F,CAAC;AACD,WAAO,SAAS,SAAS,IAAI,CAAC,EAAE,GAAG,QAAQ,SAAS,CAAC,IAAI,CAAC;AAAA,EAC5D,CAAC;AACD,SAAO,EAAE,OAAO,gBAAgB,QAAQ;AAC1C;AAEA,IAAM,qBAAqB;AAC3B,IAAM,0BAA0B;AAQhC,IAAM,aAAa,oBAAI,IAA6B;AAE7C,IAAM,0BAA0B,EAAE,MAAM,GAAG,QAAQ,EAAE;AAG5D,SAAS,WAA6B,OAAa;AAEjD,MAAI,OAAO,SAAS,KAAK,EAAG,QAAO;AACnC,SAAO,OAAO,KAAK;AACnB,aAAW,SAAS,OAAO,OAAO,KAAK,EAAG,YAAW,KAAK;AAC1D,SAAO;AACT;AAEO,SAAS,0BAAgC;AAC9C,aAAW,MAAM;AACnB;AAcA,eAAsB,2BAA2B,SAQb;AAClC,MAAI,QAAQ,aAAa,QAAQ,QAAQ,UAAU,OAAW,QAAO,4BAA4B,OAAO;AAExG,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,eAAe,+BAA+B,QAAQ,WAAW,QAAQ,uBAAuB;AACtG,QAAM,MAAM,KAAK,UAAU;AAAA,IACzB,QAAQ;AAAA,IACR;AAAA,IACA,QAAQ,mBAAmB;AAAA,IAC3B,QAAQ,+BAA+B;AAAA,EACzC,CAAC;AAGD,QAAM,QAAQ,uBAAuB,QAAQ,WAAW,YAAY;AACpE,QAAM,cAAc,KAAK,IAAI;AAC7B,QAAM,MAAM,WAAW,IAAI,GAAG;AAC9B,MAAI,OAAO,IAAI,UAAU,SAAS,cAAc,IAAI,cAAc,oBAAoB;AACpF,4BAAwB;AACxB,eAAW,OAAO,GAAG;AACrB,eAAW,IAAI,KAAK,GAAG;AACvB,WAAO,IAAI;AAAA,EACb;AACA,0BAAwB;AACxB,QAAM,QAAQ,MAAM,4BAA4B,OAAO;AACvD,QAAM,QAAQ;AAAA,IACZ,OAAO,WAAW,MAAM,KAAK;AAAA,IAC7B,SAAS,WAAW,MAAM,OAAO;AAAA,EACnC;AACA,aAAW,OAAO,GAAG;AACrB,aAAW,IAAI,KAAK,EAAE,OAAO,aAAa,MAAM,CAAC;AACjD,SAAO,WAAW,OAAO,yBAAyB;AAChD,UAAM,SAAS,WAAW,KAAK,EAAE,KAAK,EAAE;AACxC,QAAI,WAAW,OAAW;AAC1B,eAAW,OAAO,MAAM;AAAA,EAC1B;AACA,SAAO;AACT;AAEA,eAAsB,wBAAwB,SAWP;AACrC,iBAAe,QAAQ,aAAa,4BAA4B;AAChE,QAAM,cAAc,IAAI,IAAI,sBAAsB,QAAQ,OAAO,CAAC,QAAQ,OAAO,CAAC,CAAC;AACnF,MAAI,YAAY,SAAS,KAAK,QAAQ,cAAc,EAAG,QAAO,CAAC;AAI/D,QAAM,EAAE,OAAO,eAAe,QAAQ,IAAI,MAAM,2BAA2B;AAAA,IACzE,GAAG;AAAA,IACH,UAAU,QAAQ,kBAAkB;AAAA,EACtC,CAAC;AACD,QAAM,aAAa,oBAAI,IAA+B;AAEtD,aAAW,QAAQ,eAAe;AAChC,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,EAAE,OAAO,cAAc,IAAI,UAAU,MAAM,WAAW;AAC5D,QAAI,SAAS,EAAG;AAChB,eAAW,IAAI,KAAK,QAAQ;AAAA,MAC1B;AAAA,MACA,WAAW;AAAA,MACX,aAAa;AAAA,MACb,eAAe,IAAI,IAAI,aAAa;AAAA,MACpC,gBAAgB,oBAAI,IAAI;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,MAAI,QAAQ,gBAAgB;AAC1B,mBAAe,QAAQ,aAAa,4BAA4B;AAChE,UAAM,YAAY,IAAI,IAAI,cAAc,IAAI,CAAC,SAAS,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC;AAC1E,eAAW,UAAU,SAAS;AAC5B,qBAAe,QAAQ,aAAa,4BAA4B;AAEhE,YAAM,mBAAmB,OAAO;AAChC,YAAM,mBAAmB,IAAI,IAAI,iBAAiB,QAAQ,CAAC,YAAY,UAAU,IAAI,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC;AAC1G,YAAM,qBAAqB,OAAO,MAAM,OAAO,CAAC,QAAQ,iBAAiB,IAAI,GAAG,CAAC,KAAK,CAAC;AACvF,YAAM,EAAE,OAAO,cAAc,IAAI,YAAY,QAAQ,aAAa,kBAAkB;AACpF,UAAI,SAAS,EAAG;AAChB,iBAAW,WAAW,kBAAkB;AACtC,cAAM,OAAO,UAAU,IAAI,OAAO;AAClC,YAAI,CAAC,KAAM;AACX,cAAM,WAAW,WAAW,IAAI,OAAO,KAAK;AAAA,UAC1C;AAAA,UACA,WAAW;AAAA,UACX,aAAa;AAAA,UACb,eAAe,oBAAI,IAAY;AAAA,UAC/B,gBAAgB,oBAAI,IAAmC;AAAA,QACzD;AACA,iBAAS,eAAe;AACxB,iBAAS,cAAc,IAAI,QAAQ;AACnC,mBAAW,SAAS,cAAe,UAAS,cAAc,IAAI,KAAK;AACnE,iBAAS,eAAe,IAAI,OAAO,UAAU;AAAA,UAC3C,UAAU,OAAO;AAAA,UACjB,YAAY,OAAO;AAAA,UACnB,aAAa,OAAO;AAAA,QACtB,CAAC;AACD,mBAAW,IAAI,SAAS,QAAQ;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAEA,SAAO,CAAC,GAAG,WAAW,OAAO,CAAC,EAC3B,IAAI,CAAC,cAAc;AAClB,QAAI,QAAQ,UAAU,YAAY,UAAU;AAC5C,QAAI,QAAQ,cAAc,UAAU,KAAK,eAAe,QAAQ,WAAY,UAAS;AACrF,WAAO;AAAA,MACL,MAAM,UAAU;AAAA,MAChB;AAAA,MACA,WAAW,UAAU;AAAA,MACrB,aAAa,UAAU;AAAA,MACvB,eAAe,CAAC,GAAG,UAAU,aAAa,EAAE,KAAK;AAAA,MACjD,gBAAgB,CAAC,GAAG,UAAU,eAAe,OAAO,CAAC,EAAE;AAAA,QACrD,CAAC,MAAM,UACL,KAAK,WAAW,cAAc,MAAM,UAAU,KAAK,KAAK,YAAY,cAAc,MAAM,WAAW;AAAA,MACvG;AAAA,IACF;AAAA,EACF,CAAC,EACA,OAAO,CAAC,WAAW,OAAO,YAAY,KAAK,OAAO,cAAc,CAAC,EACjE;AAAA,IACC,CAAC,MAAM,UACL,MAAM,QAAQ,KAAK,SACnB,MAAM,cAAc,KAAK,eACzB,MAAM,KAAK,WAAW,cAAc,KAAK,KAAK,UAAU;AAAA,EAC5D,EACC,MAAM,GAAG,QAAQ,UAAU;AAChC;","names":[]}