@descryy/core 0.1.0

package/dist/worker/pool.d.ts

@@ -0,0 +1,73 @@
+/**
+ * A warm pool of traversal workers.
+ *
+ * ## Why warm, measured rather than assumed
+ *
+ * On this machine (Node v22.23.1, 16 cores):
+ *
+ * | | |
+ * | --- | --- |
+ * | cold worker spawn to ready | **~98–122 ms** |
+ * | round-trip on a warm worker | **~0.06 ms** |
+ * | a 200-node traversal | ~3 ms |
+ *
+ * The build plan estimated spawn at ~30 ms; it is three to four times that. A
+ * worker spawned per query would make the pre-push fast path **thirty times
+ * slower**, which is the opposite of the reason for having workers at all.
+ *
+ * The same numbers settle the other half: at 0.06 ms, dispatch is free relative
+ * to any traversal worth dispatching, so there is no main-thread fast path and
+ * no threshold to tune. Everything goes to the pool.
+ *
+ * ## The entry-point trap
+ *
+ * The worker file is `traversal.worker.ts` under Node's type stripping and
+ * `traversal.worker.js` after `tsc`. Hardcoding either breaks the other, and
+ * chasing that is — per the build plan — the most common reason a project gives
+ * up and adds a bundler. The fix is three lines: this module knows which form
+ * *it* is running as, from its own `import.meta.url`, and the worker beside it
+ * is always the same form.
+ */
+import type { ReachedWire, TraversalRequest } from "./protocol.ts";
+/**
+ * The worker entry beside this module, in whichever form this module is running.
+ *
+ * `import.meta.url` ends `.ts` when Node is stripping types and `.js` when
+ * running compiled output, and the worker is emitted next to it either way.
+ */
+export declare function workerEntryUrl(): URL;
+export interface TraversalPoolOptions {
+    /**
+     * Path to the graph. Must be a file — `:memory:` is per-connection, so a
+     * worker opening it would get its own empty database rather than the graph.
+     */
+    readonly databasePath: string;
+    readonly size?: number;
+    readonly taskTimeoutMs?: number;
+}
+export interface PoolTraversalResult {
+    readonly reached: readonly ReachedWire[];
+    readonly truncated: boolean;
+    readonly resolutionFloor: 0 | 1 | 2 | 3 | 4;
+    readonly path?: readonly {
+        from: string;
+        to: string;
+        type: string;
+    }[];
+}
+export interface TraversalPool {
+    readonly size: number;
+    /**
+     * Run a traversal on a pooled worker.
+     *
+     * `onChunk` fires as partial results arrive, which is the point of chunking:
+     * a caller streaming to an MCP client can emit the first rows long before the
+     * traversal finishes.
+     */
+    run(request: Omit<TraversalRequest, "id">, onChunk?: (items: readonly ReachedWire[]) => void): Promise<PoolTraversalResult>;
+    /** Round-trips every worker. Returns the ones that answered. */
+    healthCheck(): Promise<number>;
+    dispose(): Promise<void>;
+}
+export declare function createTraversalPool(options: TraversalPoolOptions): Promise<TraversalPool>;
+//# sourceMappingURL=pool.d.ts.map

package/dist/worker/pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool.d.ts","sourceRoot":"","sources":["../../src/worker/pool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAKH,OAAO,KAAK,EAEV,WAAW,EACX,gBAAgB,EAEjB,MAAM,eAAe,CAAC;AAEvB;;;;;GAKG;AACH,wBAAgB,cAAc,IAAI,GAAG,CAIpC;AAED,MAAM,WAAW,oBAAoB;IACnC;;;OAGG;IACH,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;CACjC;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,OAAO,EAAE,SAAS,WAAW,EAAE,CAAC;IACzC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,eAAe,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5C,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CACvE;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB;;;;;;OAMG;IACH,GAAG,CACD,OAAO,EAAE,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,EACrC,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,WAAW,EAAE,KAAK,IAAI,GAChD,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAChC,gEAAgE;IAChE,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IAC/B,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;CAC1B;AA6BD,wBAAsB,mBAAmB,CACvC,OAAO,EAAE,oBAAoB,GAC5B,OAAO,CAAC,aAAa,CAAC,CAgKxB"}

package/dist/worker/pool.js

@@ -0,0 +1,203 @@
+/**
+ * A warm pool of traversal workers.
+ *
+ * ## Why warm, measured rather than assumed
+ *
+ * On this machine (Node v22.23.1, 16 cores):
+ *
+ * | | |
+ * | --- | --- |
+ * | cold worker spawn to ready | **~98–122 ms** |
+ * | round-trip on a warm worker | **~0.06 ms** |
+ * | a 200-node traversal | ~3 ms |
+ *
+ * The build plan estimated spawn at ~30 ms; it is three to four times that. A
+ * worker spawned per query would make the pre-push fast path **thirty times
+ * slower**, which is the opposite of the reason for having workers at all.
+ *
+ * The same numbers settle the other half: at 0.06 ms, dispatch is free relative
+ * to any traversal worth dispatching, so there is no main-thread fast path and
+ * no threshold to tune. Everything goes to the pool.
+ *
+ * ## The entry-point trap
+ *
+ * The worker file is `traversal.worker.ts` under Node's type stripping and
+ * `traversal.worker.js` after `tsc`. Hardcoding either breaks the other, and
+ * chasing that is — per the build plan — the most common reason a project gives
+ * up and adds a bundler. The fix is three lines: this module knows which form
+ * *it* is running as, from its own `import.meta.url`, and the worker beside it
+ * is always the same form.
+ */
+import { Worker } from "node:worker_threads";
+import { cpus } from "node:os";
+/**
+ * The worker entry beside this module, in whichever form this module is running.
+ *
+ * `import.meta.url` ends `.ts` when Node is stripping types and `.js` when
+ * running compiled output, and the worker is emitted next to it either way.
+ */
+export function workerEntryUrl() {
+    const self = import.meta.url;
+    const extension = self.endsWith(".ts") ? ".ts" : ".js";
+    return new URL(`./traversal.worker${extension}`, self);
+}
+/**
+ * Default pool size.
+ *
+ * Leaves headroom for the main thread and for the parser pool that Stage 1 will
+ * add: this process is not the only thing that wants a core. Capped at 4 because
+ * traversal is memory-bound on the adjacency index rather than CPU-bound, so
+ * more threads mostly buys more open database handles.
+ */
+function defaultSize() {
+    return Math.max(1, Math.min(4, cpus().length - 2));
+}
+export async function createTraversalPool(options) {
+    const size = options.size ?? defaultSize();
+    const timeoutMs = options.taskTimeoutMs ?? 30_000;
+    const entry = workerEntryUrl();
+    const slots = [];
+    const pending = new Map();
+    const queue = [];
+    let nextId = 1;
+    let disposed = false;
+    function attach(slot) {
+        slot.worker.on("message", (message) => {
+            if (message.kind === "ready" || message.kind === "pong")
+                return;
+            const task = pending.get(message.id);
+            if (task === undefined)
+                return;
+            if (message.kind === "chunk") {
+                task.chunks.push(...message.items);
+                task.onChunk?.(message.items);
+                return;
+            }
+            clearTimeout(task.timer);
+            pending.delete(message.id);
+            slot.busy = false;
+            if (message.kind === "failed")
+                task.reject(new Error(message.message));
+            else
+                task.resolve({
+                    reached: task.chunks,
+                    truncated: message.truncated,
+                    resolutionFloor: message.resolutionFloor,
+                    ...(message.path === undefined ? {} : { path: message.path }),
+                });
+            queue.shift()?.();
+        });
+        slot.worker.on("error", (cause) => {
+            const error = cause instanceof Error ? cause : new Error(String(cause));
+            // The worker died. Fail whatever it was holding rather than letting the
+            // caller wait for a timeout, then replace it — a dead slot that stays in
+            // the pool silently reduces capacity until nothing is left.
+            slot.dead = true;
+            for (const [id, task] of pending) {
+                clearTimeout(task.timer);
+                task.reject(error);
+                pending.delete(id);
+            }
+            if (!disposed)
+                void replace(slot);
+        });
+    }
+    async function spawn() {
+        const worker = new Worker(entry, { workerData: { databasePath: options.databasePath } });
+        await new Promise((resolve, reject) => {
+            const onMessage = (message) => {
+                if (message.kind === "ready") {
+                    worker.off("error", onError);
+                    resolve();
+                }
+                else if (message.kind === "failed") {
+                    reject(new Error(message.message));
+                }
+            };
+            const onError = (error) => reject(error);
+            worker.once("message", onMessage);
+            worker.once("error", onError);
+        });
+        return worker;
+    }
+    async function replace(slot) {
+        await slot.worker.terminate().catch(() => undefined);
+        slot.worker = await spawn();
+        slot.busy = false;
+        slot.dead = false;
+        attach(slot);
+        queue.shift()?.();
+    }
+    for (let i = 0; i < size; i += 1) {
+        const slot = { worker: await spawn(), busy: false, dead: false };
+        attach(slot);
+        slots.push(slot);
+    }
+    function freeSlot() {
+        return slots.find((s) => !s.busy && !s.dead);
+    }
+    return {
+        size,
+        async run(request, onChunk) {
+            if (disposed)
+                throw new Error("traversal pool is disposed");
+            const slot = freeSlot() ?? (await new Promise((resolve) => {
+                queue.push(() => {
+                    const next = freeSlot();
+                    if (next !== undefined)
+                        resolve(next);
+                    else
+                        queue.push(() => resolve(freeSlot()));
+                });
+            }));
+            const id = nextId++;
+            slot.busy = true;
+            return new Promise((resolve, reject) => {
+                const timer = setTimeout(() => {
+                    pending.delete(id);
+                    slot.busy = false;
+                    reject(new Error(`traversal timed out after ${timeoutMs}ms`));
+                    queue.shift()?.();
+                }, timeoutMs);
+                // Do not hold the process open for a pending traversal.
+                timer.unref?.();
+                pending.set(id, { resolve, reject, onChunk, chunks: [], timer });
+                slot.worker.postMessage({
+                    kind: "traverse",
+                    request: { ...request, id },
+                });
+            });
+        },
+        async healthCheck() {
+            const results = await Promise.all(slots.map((slot) => new Promise((resolve) => {
+                if (slot.dead)
+                    return resolve(false);
+                const id = nextId++;
+                const timer = setTimeout(() => resolve(false), 2_000);
+                timer.unref?.();
+                const onMessage = (message) => {
+                    if (message.kind !== "pong" || message.id !== id)
+                        return;
+                    clearTimeout(timer);
+                    slot.worker.off("message", onMessage);
+                    resolve(true);
+                };
+                slot.worker.on("message", onMessage);
+                slot.worker.postMessage({ kind: "ping", id });
+            })));
+            return results.filter(Boolean).length;
+        },
+        async dispose() {
+            // Mandatory, not hygiene: each worker holds an open database handle, and
+            // a leaked pool is four of them plus four threads per repo.
+            disposed = true;
+            for (const task of pending.values()) {
+                clearTimeout(task.timer);
+                task.reject(new Error("traversal pool disposed"));
+            }
+            pending.clear();
+            await Promise.all(slots.map((s) => s.worker.terminate().catch(() => undefined)));
+        },
+    };
+}
+//# sourceMappingURL=pool.js.map

package/dist/worker/pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool.js","sourceRoot":"","sources":["../../src/worker/pool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAS/B;;;;;GAKG;AACH,MAAM,UAAU,cAAc;IAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;IAC7B,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;IACvD,OAAO,IAAI,GAAG,CAAC,qBAAqB,SAAS,EAAE,EAAE,IAAI,CAAC,CAAC;AACzD,CAAC;AAoDD;;;;;;;GAOG;AACH,SAAS,WAAW;IAClB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;AACrD,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,OAA6B;IAE7B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,WAAW,EAAE,CAAC;IAC3C,MAAM,SAAS,GAAG,OAAO,CAAC,aAAa,IAAI,MAAM,CAAC;IAClD,MAAM,KAAK,GAAG,cAAc,EAAE,CAAC;IAE/B,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAC3C,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,QAAQ,GAAG,KAAK,CAAC;IAErB,SAAS,MAAM,CAAC,IAAU;QACxB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,OAAsB,EAAE,EAAE;YACnD,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO;YAChE,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACrC,IAAI,IAAI,KAAK,SAAS;gBAAE,OAAO;YAE/B,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;gBACnC,IAAI,CAAC,OAAO,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC9B,OAAO;YACT,CAAC;YAED,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;YAElB,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ;gBAAE,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;;gBAErE,IAAI,CAAC,OAAO,CAAC;oBACX,OAAO,EAAE,IAAI,CAAC,MAAM;oBACpB,SAAS,EAAE,OAAO,CAAC,SAAS;oBAC5B,eAAe,EAAE,OAAO,CAAC,eAAe;oBACxC,GAAG,CAAC,OAAO,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC;iBAC9D,CAAC,CAAC;YAEL,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC;QACpB,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,KAAc,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YACxE,wEAAwE;YACxE,yEAAyE;YACzE,4DAA4D;YAC5D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;gBACjC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACnB,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACrB,CAAC;YACD,IAAI,CAAC,QAAQ;gBAAE,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC;IAED,KAAK,UAAU,KAAK;QAClB,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,KAAK,EAAE,EAAE,UAAU,EAAE,EAAE,YAAY,EAAE,OAAO,CAAC,YAAY,EAAE,EAAE,CAAC,CAAC;QACzF,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YAC1C,MAAM,SAAS,GAAG,CAAC,OAAsB,EAAQ,EAAE;gBACjD,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;oBAC7B,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;oBAC7B,OAAO,EAAE,CAAC;gBACZ,CAAC;qBAAM,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;oBACrC,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;gBACrC,CAAC;YACH,CAAC,CAAC;YACF,MAAM,OAAO,GAAG,CAAC,KAAY,EAAQ,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACtD,MAAM,CAAC,IAAI,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YAClC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,KAAK,UAAU,OAAO,CAAC,IAAU;QAC/B,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC;QACrD,IAAI,CAAC,MAAM,GAAG,MAAM,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;QAClB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;QAClB,MAAM,CAAC,IAAI,CAAC,CAAC;QACb,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC;IACpB,CAAC;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,GAAS,EAAE,MAAM,EAAE,MAAM,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACvE,MAAM,CAAC,IAAI,CAAC,CAAC;QACb,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,SAAS,QAAQ;QACf,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IAED,OAAO;QACL,IAAI;QAEJ,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO;YACxB,IAAI,QAAQ;gBAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;YAC5D,MAAM,IAAI,GAAG,QAAQ,EAAE,IAAI,CAAC,MAAM,IAAI,OAAO,CAAO,CAAC,OAAO,EAAE,EAAE;gBAC9D,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE;oBACd,MAAM,IAAI,GAAG,QAAQ,EAAE,CAAC;oBACxB,IAAI,IAAI,KAAK,SAAS;wBAAE,OAAO,CAAC,IAAI,CAAC,CAAC;;wBACjC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAG,CAAC,CAAC,CAAC;gBAC9C,CAAC,CAAC,CAAC;YACL,CAAC,CAAC,CAAC,CAAC;YAEJ,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YAEjB,OAAO,IAAI,OAAO,CAAsB,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;gBAC1D,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;oBAC5B,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;oBACnB,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;oBAClB,MAAM,CAAC,IAAI,KAAK,CAAC,6BAA6B,SAAS,IAAI,CAAC,CAAC,CAAC;oBAC9D,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,CAAC;gBACpB,CAAC,EAAE,SAAS,CAAC,CAAC;gBACd,wDAAwD;gBACxD,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;gBAEhB,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;gBACjE,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;oBACtB,IAAI,EAAE,UAAU;oBAChB,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,EAAE;iBACN,CAAC,CAAC;YAC3B,CAAC,CAAC,CAAC;QACL,CAAC;QAED,KAAK,CAAC,WAAW;YACf,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,GAAG,CAC/B,KAAK,CAAC,GAAG,CACP,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,OAAO,CAAU,CAAC,OAAO,EAAE,EAAE;gBAC/B,IAAI,IAAI,CAAC,IAAI;oBAAE,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC;gBACrC,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;gBACpB,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;gBACtD,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;gBAChB,MAAM,SAAS,GAAG,CAAC,OAAsB,EAAQ,EAAE;oBACjD,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC,EAAE,KAAK,EAAE;wBAAE,OAAO;oBACzD,YAAY,CAAC,KAAK,CAAC,CAAC;oBACpB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;oBACtC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,CAAC;gBACF,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;gBACrC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAwB,CAAC,CAAC;YACtE,CAAC,CAAC,CACL,CACF,CAAC;YACF,OAAO,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QACxC,CAAC;QAED,KAAK,CAAC,OAAO;YACX,yEAAyE;YACzE,4DAA4D;YAC5D,QAAQ,GAAG,IAAI,CAAC;YAChB,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;gBACpC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC,CAAC;YACpD,CAAC;YACD,OAAO,CAAC,KAAK,EAAE,CAAC;YAChB,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACnF,CAAC;KACF,CAAC;AACJ,CAAC"}

package/dist/worker/protocol.d.ts

@@ -0,0 +1,91 @@
+/**
+ * The main-thread ↔ worker message protocol.
+ *
+ * Everything crossing the boundary must survive structured clone, which rules
+ * out the one thing Step 9's traversal API takes: `weightFor` is a function.
+ * It is replaced here by an **edge-weight table**, which is what §12.4 actually
+ * specifies — `EdgeWeight` is tuning config keyed by edge *type*, never a
+ * per-edge value. So the serialisable form is not a compromise; it is the shape
+ * the architecture asked for, and passing a closure was the shortcut.
+ */
+import type { EdgeType, ResolutionLevel } from "@descryy/ir";
+import type { Direction } from "../query/traverse.ts";
+/** Serialisable stand-in for `WeightedOptions.weightFor`. */
+export interface EdgeWeightTable {
+    /** Per edge type. Absent types fall back to `fallback`. */
+    readonly weights: Partial<Record<EdgeType, number>>;
+    readonly fallback: number;
+    /**
+     * Multiply the type weight by the edge's own confidence, per §12.4's
+     * `EdgeConfidence` term. On by default: a guessed edge should propagate less
+     * impact than a proven one.
+     */
+    readonly useConfidence?: boolean;
+}
+export interface TraversalRequest {
+    readonly id: number;
+    readonly kind: "bfs" | "weightedBfs" | "findPath";
+    readonly seeds: readonly string[];
+    /** `findPath` only. */
+    readonly target?: string;
+    readonly types?: readonly EdgeType[];
+    readonly direction?: Direction;
+    readonly maxDepth?: number;
+    readonly budget?: number;
+    readonly minConfidence?: number;
+    readonly perNodeLimit?: number;
+    readonly minScore?: number;
+    readonly edgeWeights?: EdgeWeightTable;
+    /**
+     * Rows per `postMessage`. Results are chunked rather than sent whole so a
+     * 5,000-node answer reaches the caller progressively — the streaming-first
+     * requirement is about when the first row arrives, not the last.
+     */
+    readonly chunkSize?: number;
+}
+export interface ReachedWire {
+    readonly id: string;
+    readonly depth: number;
+    readonly score: number;
+    readonly viaType: EdgeType | null;
+    readonly viaFrom: string | null;
+    readonly viaTo: string | null;
+}
+export type WorkerMessage = {
+    readonly kind: "ready";
+} | {
+    readonly kind: "pong";
+    readonly id: number;
+} | {
+    readonly kind: "chunk";
+    readonly id: number;
+    readonly items: readonly ReachedWire[];
+} | {
+    readonly kind: "done";
+    readonly id: number;
+    readonly truncated: boolean;
+    readonly resolutionFloor: ResolutionLevel;
+    /** `findPath` only: the edges of the path, in order. */
+    readonly path?: readonly {
+        from: string;
+        to: string;
+        type: EdgeType;
+    }[];
+} | {
+    readonly kind: "failed";
+    readonly id: number;
+    readonly message: string;
+};
+export type MainMessage = {
+    readonly kind: "traverse";
+    readonly request: TraversalRequest;
+} | {
+    readonly kind: "ping";
+    readonly id: number;
+};
+/** Build a `weightFor` from the serialisable table. Shared by worker and tests. */
+export declare function weightFromTable(table: EdgeWeightTable): (edge: {
+    type: EdgeType;
+    confidence: number;
+}) => number;
+//# sourceMappingURL=protocol.d.ts.map

package/dist/worker/protocol.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"protocol.d.ts","sourceRoot":"","sources":["../../src/worker/protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAE7D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAEtD,6DAA6D;AAC7D,MAAM,WAAW,eAAe;IAC9B,2DAA2D;IAC3D,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC;IACpD,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B;;;;OAIG;IACH,QAAQ,CAAC,aAAa,CAAC,EAAE,OAAO,CAAC;CAClC;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,KAAK,GAAG,aAAa,GAAG,UAAU,CAAC;IAClD,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,uBAAuB;IACvB,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;IACrC,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,CAAC;IAC/B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,WAAW,CAAC,EAAE,eAAe,CAAC;IACvC;;;;OAIG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;CAC7B;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,OAAO,EAAE,QAAQ,GAAG,IAAI,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;CAC/B;AAED,MAAM,MAAM,aAAa,GACrB;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;CAAE,GAC1B;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GAC9C;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,WAAW,EAAE,CAAA;CAAE,GACvF;IACE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,eAAe,EAAE,eAAe,CAAC;IAC1C,wDAAwD;IACxD,QAAQ,CAAC,IAAI,CAAC,EAAE,SAAS;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,QAAQ,CAAA;KAAE,EAAE,CAAC;CACzE,GACD;IAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC;AAE/E,MAAM,MAAM,WAAW,GACnB;IAAE,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,OAAO,EAAE,gBAAgB,CAAA;CAAE,GACjE;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,CAAC;AAEnD,mFAAmF;AACnF,wBAAgB,eAAe,CAAC,KAAK,EAAE,eAAe,IAE5C,MAAM;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,KAAG,MAAM,CAI9D"}

package/dist/worker/protocol.js

@@ -0,0 +1,19 @@
+/**
+ * The main-thread ↔ worker message protocol.
+ *
+ * Everything crossing the boundary must survive structured clone, which rules
+ * out the one thing Step 9's traversal API takes: `weightFor` is a function.
+ * It is replaced here by an **edge-weight table**, which is what §12.4 actually
+ * specifies — `EdgeWeight` is tuning config keyed by edge *type*, never a
+ * per-edge value. So the serialisable form is not a compromise; it is the shape
+ * the architecture asked for, and passing a closure was the shortcut.
+ */
+/** Build a `weightFor` from the serialisable table. Shared by worker and tests. */
+export function weightFromTable(table) {
+    const useConfidence = table.useConfidence ?? true;
+    return (edge) => {
+        const base = table.weights[edge.type] ?? table.fallback;
+        return useConfidence ? base * edge.confidence : base;
+    };
+}
+//# sourceMappingURL=protocol.js.map

package/dist/worker/protocol.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"protocol.js","sourceRoot":"","sources":["../../src/worker/protocol.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAoEH,mFAAmF;AACnF,MAAM,UAAU,eAAe,CAAC,KAAsB;IACpD,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,IAAI,IAAI,CAAC;IAClD,OAAO,CAAC,IAA4C,EAAU,EAAE;QAC9D,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC;QACxD,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC;IACvD,CAAC,CAAC;AACJ,CAAC"}

package/dist/worker/traversal.worker.d.ts

@@ -0,0 +1,25 @@
+/**
+ * The traversal worker.
+ *
+ * `node:sqlite` is a **synchronous** API, so a 5,000-node traversal on the main
+ * thread holds the event loop for its whole duration — which blocks the MCP
+ * stream and breaks the streaming-first promise at exactly the moment the answer
+ * is most worth streaming.
+ *
+ * Two constraints shape this file:
+ *
+ * 1. **The database handle is opened here, not passed in.** Handles are not
+ *    structured-cloneable and cannot cross a thread boundary. The worker takes a
+ *    path and opens its own read-only handle — which is also why WAL matters:
+ *    without it a writer on the main thread blocks this reader.
+ *
+ * 2. **The handle is read-only, so `migrate` cannot run.** Even
+ *    `CREATE TABLE IF NOT EXISTS` needs write permission, so the ordinary open
+ *    path would fail on a perfectly healthy graph. `verifyReadOnly` performs the
+ *    same DEC-017 version check with reads only.
+ *
+ * Results are chunked rather than returned whole: streaming-first is about when
+ * the *first* row arrives, not the last.
+ */
+export {};
+//# sourceMappingURL=traversal.worker.d.ts.map

package/dist/worker/traversal.worker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.worker.d.ts","sourceRoot":"","sources":["../../src/worker/traversal.worker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG"}

package/dist/worker/traversal.worker.js

@@ -0,0 +1,124 @@
+/**
+ * The traversal worker.
+ *
+ * `node:sqlite` is a **synchronous** API, so a 5,000-node traversal on the main
+ * thread holds the event loop for its whole duration — which blocks the MCP
+ * stream and breaks the streaming-first promise at exactly the moment the answer
+ * is most worth streaming.
+ *
+ * Two constraints shape this file:
+ *
+ * 1. **The database handle is opened here, not passed in.** Handles are not
+ *    structured-cloneable and cannot cross a thread boundary. The worker takes a
+ *    path and opens its own read-only handle — which is also why WAL matters:
+ *    without it a writer on the main thread blocks this reader.
+ *
+ * 2. **The handle is read-only, so `migrate` cannot run.** Even
+ *    `CREATE TABLE IF NOT EXISTS` needs write permission, so the ordinary open
+ *    path would fail on a perfectly healthy graph. `verifyReadOnly` performs the
+ *    same DEC-017 version check with reads only.
+ *
+ * Results are chunked rather than returned whole: streaming-first is about when
+ * the *first* row arrives, not the last.
+ */
+import { parentPort, workerData } from "node:worker_threads";
+import { openStore } from "../store/index.js";
+import { createStoreProvider } from "../query/sqlite.js";
+import { bfs, findPath, weightedBfs } from "../query/traverse.js";
+import { weightFromTable } from "./protocol.js";
+const port = parentPort;
+if (port === null)
+    throw new Error("traversal.worker must be run as a worker thread");
+const init = workerData;
+let store;
+try {
+    store = openStore(init.databasePath, { readOnly: true });
+}
+catch (error) {
+    port.postMessage({
+        kind: "failed",
+        id: -1,
+        message: error instanceof Error ? error.message : String(error),
+    });
+    throw error;
+}
+const provider = createStoreProvider(store.driver);
+function baseOptions(request) {
+    return {
+        ...(request.types === undefined ? {} : { types: request.types }),
+        ...(request.direction === undefined ? {} : { direction: request.direction }),
+        ...(request.maxDepth === undefined ? {} : { maxDepth: request.maxDepth }),
+        ...(request.budget === undefined ? {} : { budget: request.budget }),
+        ...(request.minConfidence === undefined ? {} : { minConfidence: request.minConfidence }),
+        ...(request.perNodeLimit === undefined ? {} : { perNodeLimit: request.perNodeLimit }),
+    };
+}
+function send(message) {
+    port.postMessage(message);
+}
+function handle(request) {
+    const chunkSize = request.chunkSize ?? 500;
+    if (request.kind === "findPath") {
+        const target = request.target;
+        const seed = request.seeds[0];
+        if (seed === undefined || target === undefined) {
+            send({ kind: "failed", id: request.id, message: "findPath needs a seed and a target" });
+            return;
+        }
+        const path = findPath(provider, seed, target, baseOptions(request));
+        send({
+            kind: "done",
+            id: request.id,
+            truncated: false,
+            resolutionFloor: path.reduce((floor, e) => (e.resolution < floor ? e.resolution : floor), 4),
+            path: path.map((e) => ({ from: e.from, to: e.to, type: e.type })),
+        });
+        return;
+    }
+    const outcome = request.kind === "weightedBfs"
+        ? weightedBfs(provider, request.seeds, {
+            ...baseOptions(request),
+            ...(request.minScore === undefined ? {} : { minScore: request.minScore }),
+            ...(request.edgeWeights === undefined
+                ? {}
+                : { weightFor: weightFromTable(request.edgeWeights) }),
+        })
+        : bfs(provider, request.seeds, baseOptions(request));
+    for (let i = 0; i < outcome.reached.length; i += chunkSize) {
+        const items = outcome.reached.slice(i, i + chunkSize).map((r) => ({
+            id: r.id,
+            depth: r.depth,
+            score: r.score,
+            viaType: r.via?.type ?? null,
+            viaFrom: r.via?.from ?? null,
+            viaTo: r.via?.to ?? null,
+        }));
+        send({ kind: "chunk", id: request.id, items });
+    }
+    send({
+        kind: "done",
+        id: request.id,
+        truncated: outcome.truncated,
+        resolutionFloor: outcome.resolutionFloor,
+    });
+}
+port.on("message", (message) => {
+    if (message.kind === "ping") {
+        send({ kind: "pong", id: message.id });
+        return;
+    }
+    try {
+        handle(message.request);
+    }
+    catch (error) {
+        // A failed traversal must not take the worker with it — the pool would then
+        // pay a ~100ms respawn for what may be one malformed request.
+        send({
+            kind: "failed",
+            id: message.request.id,
+            message: error instanceof Error ? error.message : String(error),
+        });
+    }
+});
+send({ kind: "ready" });
+//# sourceMappingURL=traversal.worker.js.map

package/dist/worker/traversal.worker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.worker.js","sourceRoot":"","sources":["../../src/worker/traversal.worker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAE7D,OAAO,EAAE,SAAS,EAAc,MAAM,mBAAmB,CAAC;AAC1D,OAAO,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,WAAW,EAA+C,MAAM,sBAAsB,CAAC;AAC/G,OAAO,EAAE,eAAe,EAAiF,MAAM,eAAe,CAAC;AAM/H,MAAM,IAAI,GAAG,UAAU,CAAC;AACxB,IAAI,IAAI,KAAK,IAAI;IAAE,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;AAEtF,MAAM,IAAI,GAAG,UAAwB,CAAC;AACtC,IAAI,KAAY,CAAC;AACjB,IAAI,CAAC;IACH,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;AAC3D,CAAC;AAAC,OAAO,KAAK,EAAE,CAAC;IACf,IAAI,CAAC,WAAW,CAAC;QACf,IAAI,EAAE,QAAQ;QACd,EAAE,EAAE,CAAC,CAAC;QACN,OAAO,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;KACxC,CAAC,CAAC;IAC3B,MAAM,KAAK,CAAC;AACd,CAAC;AAED,MAAM,QAAQ,GAAG,mBAAmB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;AAEnD,SAAS,WAAW,CAAC,OAAyB;IAC5C,OAAO;QACL,GAAG,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,CAAC;QAChE,GAAG,CAAC,OAAO,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC,SAAS,EAAE,CAAC;QAC5E,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC;QACzE,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC;QACnE,GAAG,CAAC,OAAO,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,OAAO,CAAC,aAAa,EAAE,CAAC;QACxF,GAAG,CAAC,OAAO,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,OAAO,CAAC,YAAY,EAAE,CAAC;KACtF,CAAC;AACJ,CAAC;AAED,SAAS,IAAI,CAAC,OAAsB;IAClC,IAAK,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;AAC7B,CAAC;AAED,SAAS,MAAM,CAAC,OAAyB;IACvC,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,GAAG,CAAC;IAE3C,IAAI,OAAO,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC9B,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,IAAI,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC/C,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,OAAO,EAAE,oCAAoC,EAAE,CAAC,CAAC;YACxF,OAAO;QACT,CAAC;QACD,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC;QACpE,IAAI,CAAC;YACH,IAAI,EAAE,MAAM;YACZ,EAAE,EAAE,OAAO,CAAC,EAAE;YACd,SAAS,EAAE,KAAK;YAChB,eAAe,EAAE,IAAI,CAAC,MAAM,CAC1B,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,EAC3D,CAAC,CACF;YACD,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;SAClE,CAAC,CAAC;QACH,OAAO;IACT,CAAC;IAED,MAAM,OAAO,GACX,OAAO,CAAC,IAAI,KAAK,aAAa;QAC5B,CAAC,CAAC,WAAW,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE;YACnC,GAAG,WAAW,CAAC,OAAO,CAAC;YACvB,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC;YACzE,GAAG,CAAC,OAAO,CAAC,WAAW,KAAK,SAAS;gBACnC,CAAC,CAAC,EAAE;gBACJ,CAAC,CAAC,EAAE,SAAS,EAAE,eAAe,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;SAC/B,CAAC;QAC9B,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC;IAEzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;QAC3D,MAAM,KAAK,GAAkB,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/E,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,IAAI,IAAI;YAC5B,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,IAAI,IAAI,IAAI;YAC5B,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,EAAE,IAAI,IAAI;SACzB,CAAC,CAAC,CAAC;QACJ,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IACjD,CAAC;IAED,IAAI,CAAC;QACH,IAAI,EAAE,MAAM;QACZ,EAAE,EAAE,OAAO,CAAC,EAAE;QACd,SAAS,EAAE,OAAO,CAAC,SAAS;QAC5B,eAAe,EAAE,OAAO,CAAC,eAAe;KACzC,CAAC,CAAC;AACL,CAAC;AAED,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,OAAoB,EAAE,EAAE;IAC1C,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC5B,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC;QACvC,OAAO;IACT,CAAC;IACD,IAAI,CAAC;QACH,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,4EAA4E;QAC5E,8DAA8D;QAC9D,IAAI,CAAC;YACH,IAAI,EAAE,QAAQ;YACd,EAAE,EAAE,OAAO,CAAC,OAAO,CAAC,EAAE;YACtB,OAAO,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;SAChE,CAAC,CAAC;IACL,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC"}

package/package.json

@@ -0,0 +1,29 @@
+{
+  "name": "@descryy/core",
+  "version": "0.1.0",
+  "type": "module",
+  "description": "Descry graph engine: storage, graph builder, query layer, traversal, diff scoping, git source, MCP server.",
+  "license": "MIT",
+  "engines": {
+    "node": ">=22.5"
+  },
+  "exports": {
+    ".": {
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "publishConfig": {
+    "registry": "https://registry.npmjs.org",
+    "access": "public"
+  },
+  "scripts": {
+    "build": "tsc -b"
+  },
+  "dependencies": {
+    "@descryy/ir": "0.1.0"
+  }
+}