@descryy/core 0.7.0 → 0.9.0

package/dist/store/incremental-cache.d.ts

@@ -0,0 +1,120 @@
+/**
+ * Gap 6 (steps 1-2): a real per-file IR cache, not a hash-gate.
+ *
+ * `file_hashes` (writer.ts) only ever stored a hash — no cached IR — so there was
+ * no way to "still supply" a skipped file's nodes/edges to `writeBatch` without
+ * re-parsing it. `writeBatch`'s hard invariant is that the batch a producer
+ * supplies is the *complete truth* for `producedBy`+`repo` (DEC-015): anything a
+ * prior run owned that a batch doesn't re-supply is evicted. Naive hash-gating
+ * that simply omitted an unchanged file from a batch would therefore have the
+ * writer silently evict that file's rows as stale.
+ *
+ * This module stores each file's actual contribution — its nodes, the edges
+ * whose `from` node lives in it, and its unresolved refs — so a caller (see
+ * `analyze.ts`) can reconstruct a producer's *entire* batch from cache when
+ * nothing changed, and re-supply it to `writeBatch` intact. The invariant is
+ * preserved by construction: the reconstructed batch is byte-for-byte what the
+ * last real run produced, so nothing the writer would evict is ever missing.
+ *
+ * Cross-file invalidation is explicitly out of scope for this pass (a renamed
+ * export in file A affecting file B's call-resolution edges, say). That is safe
+ * here only because the decision this cache feeds (`planIncrementalReuse` in
+ * `analyze.ts`) is whole-producer, not per-file: a batch is only ever
+ * reconstructed from cache when *every* file the producer last read is
+ * confirmed byte-identical, so whatever cross-file synthesis the producer would
+ * have computed from its complete input is unchanged too (assuming the producer
+ * is a deterministic function of its input, which `writeBatch`'s own same-batch
+ * idempotence already relies on). What this module does NOT support — and must
+ * not be used for — is reusing one file's cached contribution while a *sibling*
+ * file changed; that would risk exactly the cross-file staleness this comment
+ * warns about, which is why nothing here offers a partial/per-file reconstruction
+ * path.
+ */
+import type { IREdge, IRNode, SkippedFile, UnresolvedRef } from "@descryy/ir";
+import type { SqlDriver } from "./driver/driver.ts";
+export interface CachedFileEntry {
+    readonly filePath: string;
+    readonly contentHash: string;
+    readonly nodes: readonly IRNode[];
+    readonly edges: readonly IREdge[];
+    readonly unresolved: readonly UnresolvedRef[];
+}
+export interface CachedProducerFiles {
+    readonly files: ReadonlyMap<string, CachedFileEntry>;
+    /** `undefined` only when `files` is empty — a cold cache. */
+    readonly reachedResolution: number | undefined;
+    readonly skippedFiles: readonly SkippedFile[];
+}
+/** Sentinel `file_path` for a batch's fileless/cross-file contribution — nodes
+ *  with no `file`, plus edges whose `from` node isn't attributable to any one
+ *  cached file. Never compared for change on its own (see the module doc); only
+ *  ever reused as part of a whole-producer reconstruction. */
+export declare const FILELESS_CACHE_KEY = "";
+export declare function getCachedFiles(driver: SqlDriver, producedBy: string, repo: string): CachedProducerFiles;
+/** Replaces the entire per-file cache for one producer — always a full
+ *  delete+reinsert, never a partial update: the caller only calls this right
+ *  after a real, complete `emit()`, so partial-update bookkeeping (which rows
+ *  survive, which don't) is not a distinction this module needs to make. */
+export declare function replaceCachedFiles(driver: SqlDriver, producedBy: string, repo: string, entries: readonly CachedFileEntry[], reachedResolution: number, skippedFiles: readonly SkippedFile[], now: number): void;
+/** Partitions one producer's batch by file, so each file's contribution can be
+ *  cached and later reconstructed without the others. Every entry in
+ *  `sourceFiles` gets a bucket even when it contributed nothing (an empty file,
+ *  or one that only produced unresolved refs) — omitting it would silently drop
+ *  it from a reconstructed batch's `sourceFiles`, which is exactly the eviction
+ *  bug this module exists to prevent. An edge is attributed to the file of its
+ *  `from` node when that node is in this same batch; otherwise (and for every
+ *  fileless node) it lands in `FILELESS_CACHE_KEY`. `contentHash` is left for
+ *  the caller to fill in (it needs to read the file off disk, which this pure
+ *  function deliberately does not do) — this returns nodes/edges/unresolved
+ *  only, keyed by file path. */
+export declare function partitionBatchByFile(batch: {
+    readonly sourceFiles: readonly string[];
+    readonly nodes: readonly IRNode[];
+    readonly edges: readonly IREdge[];
+    readonly unresolved: readonly UnresolvedRef[];
+}): ReadonlyMap<string, {
+    nodes: IRNode[];
+    edges: IREdge[];
+    unresolved: UnresolvedRef[];
+}>;
+export interface IncrementalReuseInput {
+    /** The real (non-sentinel) file paths a producer's cache currently holds —
+     *  i.e. `[...getCachedFiles(...).files.keys()].filter((k) => k !== FILELESS_CACHE_KEY)`. */
+    readonly cachedPaths: readonly string[];
+    /** Every path the working tree currently has, or `null` when it could not be
+     *  determined (git unavailable, not a repository, ...). `null` always forces a
+     *  full reparse — "cannot tell whether a new file appeared" is never treated
+     *  as "no new file appeared". */
+    readonly repoPaths: readonly string[] | null;
+    /** Current on-disk content hash, for `cachedPaths` only — the caller need not
+     *  hash anything else, since only `cachedPaths` participate in the isChanged
+     *  check below. */
+    readonly currentHashes: ReadonlyMap<string, string>;
+    readonly cachedHashes: ReadonlyMap<string, string>;
+}
+export interface IncrementalReuseDecision {
+    readonly canReuse: boolean;
+    readonly reason: string;
+}
+/** Whole-producer reuse decision (Gap 6 step 3). Deliberately conservative and
+ *  deliberately NOT per-file: partial (some-files-cached, some-fresh) reuse
+ *  would require re-invoking a `LanguageAdapter` on a file subset, which this
+ *  codebase has no safe, verified way to do (adapters live in the separate
+ *  `descry-adapters` repo and are a black box behind `IRSource.emit()` — see
+ *  the module doc). This function instead answers one coarser, safe question:
+ *  "is EVERY file this producer read last time still byte-identical, with no
+ *  new candidate file added?" When yes, the whole cached batch can be reused
+ *  verbatim; when no (or when it cannot be determined), the caller must fall
+ *  back to a full `emit()` — a decision that is always safe, just sometimes
+ *  more conservative than strictly necessary (rule 7: a skip that never
+ *  triggers is still correct, only slower).
+ *
+ * The "new candidate file" check is itself a heuristic, disclosed here rather
+ * than silently assumed sound: it flags any current repo path whose extension
+ * matches an extension already seen among `cachedPaths`. A file whose extension
+ * this producer has genuinely never emitted before (the very first `.mts` file
+ * in a repo the adapter had previously only seen as `.ts`) would not be flagged
+ * and could be silently missed. This is a narrow, accepted gap — analogous in
+ * kind to this codebase's other disclosed heuristics — not a hidden one. */
+export declare function planIncrementalReuse(input: IncrementalReuseInput): IncrementalReuseDecision;
+//# sourceMappingURL=incremental-cache.d.ts.map

package/dist/store/incremental-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"incremental-cache.d.ts","sourceRoot":"","sources":["../../src/store/incremental-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAIH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE9E,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAEpD,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,UAAU,EAAE,SAAS,aAAa,EAAE,CAAC;CAC/C;AAED,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;IACrD,6DAA6D;IAC7D,QAAQ,CAAC,iBAAiB,EAAE,MAAM,GAAG,SAAS,CAAC;IAC/C,QAAQ,CAAC,YAAY,EAAE,SAAS,WAAW,EAAE,CAAC;CAC/C;AAYD;;;8DAG8D;AAC9D,eAAO,MAAM,kBAAkB,KAAK,CAAC;AAErC,wBAAgB,cAAc,CAAC,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,mBAAmB,CA2BvG;AAED;;;4EAG4E;AAC5E,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,SAAS,EACjB,UAAU,EAAE,MAAM,EAClB,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,SAAS,eAAe,EAAE,EACnC,iBAAiB,EAAE,MAAM,EACzB,YAAY,EAAE,SAAS,WAAW,EAAE,EACpC,GAAG,EAAE,MAAM,GACV,IAAI,CAyBN;AAED;;;;;;;;;;gCAUgC;AAChC,wBAAgB,oBAAoB,CAAC,KAAK,EAAE;IAC1C,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,UAAU,EAAE,SAAS,aAAa,EAAE,CAAC;CAC/C,GAAG,WAAW,CAAC,MAAM,EAAE;IAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,KAAK,EAAE,MAAM,EAAE,CAAC;IAAC,UAAU,EAAE,aAAa,EAAE,CAAA;CAAE,CAAC,CA4BzF;AAED,MAAM,WAAW,qBAAqB;IACpC;gGAC4F;IAC5F,QAAQ,CAAC,WAAW,EAAE,SAAS,MAAM,EAAE,CAAC;IACxC;;;qCAGiC;IACjC,QAAQ,CAAC,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IAC7C;;uBAEmB;IACnB,QAAQ,CAAC,aAAa,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpD,QAAQ,CAAC,YAAY,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACpD;AAED,MAAM,WAAW,wBAAwB;IACvC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED;;;;;;;;;;;;;;;;;;;4EAmB4E;AAC5E,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,qBAAqB,GAAG,wBAAwB,CA6B3F"}

package/dist/store/incremental-cache.js

@@ -0,0 +1,161 @@
+/**
+ * Gap 6 (steps 1-2): a real per-file IR cache, not a hash-gate.
+ *
+ * `file_hashes` (writer.ts) only ever stored a hash — no cached IR — so there was
+ * no way to "still supply" a skipped file's nodes/edges to `writeBatch` without
+ * re-parsing it. `writeBatch`'s hard invariant is that the batch a producer
+ * supplies is the *complete truth* for `producedBy`+`repo` (DEC-015): anything a
+ * prior run owned that a batch doesn't re-supply is evicted. Naive hash-gating
+ * that simply omitted an unchanged file from a batch would therefore have the
+ * writer silently evict that file's rows as stale.
+ *
+ * This module stores each file's actual contribution — its nodes, the edges
+ * whose `from` node lives in it, and its unresolved refs — so a caller (see
+ * `analyze.ts`) can reconstruct a producer's *entire* batch from cache when
+ * nothing changed, and re-supply it to `writeBatch` intact. The invariant is
+ * preserved by construction: the reconstructed batch is byte-for-byte what the
+ * last real run produced, so nothing the writer would evict is ever missing.
+ *
+ * Cross-file invalidation is explicitly out of scope for this pass (a renamed
+ * export in file A affecting file B's call-resolution edges, say). That is safe
+ * here only because the decision this cache feeds (`planIncrementalReuse` in
+ * `analyze.ts`) is whole-producer, not per-file: a batch is only ever
+ * reconstructed from cache when *every* file the producer last read is
+ * confirmed byte-identical, so whatever cross-file synthesis the producer would
+ * have computed from its complete input is unchanged too (assuming the producer
+ * is a deterministic function of its input, which `writeBatch`'s own same-batch
+ * idempotence already relies on). What this module does NOT support — and must
+ * not be used for — is reusing one file's cached contribution while a *sibling*
+ * file changed; that would risk exactly the cross-file staleness this comment
+ * warns about, which is why nothing here offers a partial/per-file reconstruction
+ * path.
+ */
+import { extname } from "node:path";
+/** Sentinel `file_path` for a batch's fileless/cross-file contribution — nodes
+ *  with no `file`, plus edges whose `from` node isn't attributable to any one
+ *  cached file. Never compared for change on its own (see the module doc); only
+ *  ever reused as part of a whole-producer reconstruction. */
+export const FILELESS_CACHE_KEY = "";
+export function getCachedFiles(driver, producedBy, repo) {
+    const rows = driver
+        .prepare(`SELECT file_path, content_hash, nodes_json, edges_json, unresolved_json, reached_resolution, skipped_files_json
+       FROM file_ir_cache WHERE produced_by = ? AND repo = ?`)
+        .all(producedBy, repo);
+    const files = new Map();
+    let reachedResolution;
+    let skippedFiles = [];
+    for (const row of rows) {
+        files.set(row.file_path, {
+            filePath: row.file_path,
+            contentHash: row.content_hash,
+            nodes: JSON.parse(row.nodes_json),
+            edges: JSON.parse(row.edges_json),
+            unresolved: JSON.parse(row.unresolved_json),
+        });
+        // Denormalised onto every row for this producer (schema.ts's comment on
+        // file_ir_cache explains why) — any row's copy is as good as any other's.
+        reachedResolution = row.reached_resolution;
+        skippedFiles = JSON.parse(row.skipped_files_json);
+    }
+    return { files, reachedResolution, skippedFiles };
+}
+/** Replaces the entire per-file cache for one producer — always a full
+ *  delete+reinsert, never a partial update: the caller only calls this right
+ *  after a real, complete `emit()`, so partial-update bookkeeping (which rows
+ *  survive, which don't) is not a distinction this module needs to make. */
+export function replaceCachedFiles(driver, producedBy, repo, entries, reachedResolution, skippedFiles, now) {
+    driver.transaction(() => {
+        driver.prepare("DELETE FROM file_ir_cache WHERE produced_by = ? AND repo = ?").run(producedBy, repo);
+        const insert = driver.prepare(`INSERT INTO file_ir_cache
+         (produced_by, repo, file_path, content_hash, nodes_json, edges_json, unresolved_json,
+          reached_resolution, skipped_files_json, cached_at)
+       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`);
+        const skippedJson = JSON.stringify(skippedFiles);
+        for (const entry of entries) {
+            insert.run(producedBy, repo, entry.filePath, entry.contentHash, JSON.stringify(entry.nodes), JSON.stringify(entry.edges), JSON.stringify(entry.unresolved), reachedResolution, skippedJson, now);
+        }
+    });
+}
+/** Partitions one producer's batch by file, so each file's contribution can be
+ *  cached and later reconstructed without the others. Every entry in
+ *  `sourceFiles` gets a bucket even when it contributed nothing (an empty file,
+ *  or one that only produced unresolved refs) — omitting it would silently drop
+ *  it from a reconstructed batch's `sourceFiles`, which is exactly the eviction
+ *  bug this module exists to prevent. An edge is attributed to the file of its
+ *  `from` node when that node is in this same batch; otherwise (and for every
+ *  fileless node) it lands in `FILELESS_CACHE_KEY`. `contentHash` is left for
+ *  the caller to fill in (it needs to read the file off disk, which this pure
+ *  function deliberately does not do) — this returns nodes/edges/unresolved
+ *  only, keyed by file path. */
+export function partitionBatchByFile(batch) {
+    const buckets = new Map();
+    const ensure = (key) => {
+        let bucket = buckets.get(key);
+        if (bucket === undefined) {
+            bucket = { nodes: [], edges: [], unresolved: [] };
+            buckets.set(key, bucket);
+        }
+        return bucket;
+    };
+    for (const file of batch.sourceFiles)
+        ensure(file);
+    ensure(FILELESS_CACHE_KEY);
+    const nodeFile = new Map();
+    for (const node of batch.nodes) {
+        const key = node.file ?? FILELESS_CACHE_KEY;
+        nodeFile.set(node.id, key);
+        ensure(key).nodes.push(node);
+    }
+    for (const edge of batch.edges) {
+        ensure(nodeFile.get(edge.from) ?? FILELESS_CACHE_KEY).edges.push(edge);
+    }
+    for (const ref of batch.unresolved) {
+        ensure(ref.file ?? FILELESS_CACHE_KEY).unresolved.push(ref);
+    }
+    return buckets;
+}
+/** Whole-producer reuse decision (Gap 6 step 3). Deliberately conservative and
+ *  deliberately NOT per-file: partial (some-files-cached, some-fresh) reuse
+ *  would require re-invoking a `LanguageAdapter` on a file subset, which this
+ *  codebase has no safe, verified way to do (adapters live in the separate
+ *  `descry-adapters` repo and are a black box behind `IRSource.emit()` — see
+ *  the module doc). This function instead answers one coarser, safe question:
+ *  "is EVERY file this producer read last time still byte-identical, with no
+ *  new candidate file added?" When yes, the whole cached batch can be reused
+ *  verbatim; when no (or when it cannot be determined), the caller must fall
+ *  back to a full `emit()` — a decision that is always safe, just sometimes
+ *  more conservative than strictly necessary (rule 7: a skip that never
+ *  triggers is still correct, only slower).
+ *
+ * The "new candidate file" check is itself a heuristic, disclosed here rather
+ * than silently assumed sound: it flags any current repo path whose extension
+ * matches an extension already seen among `cachedPaths`. A file whose extension
+ * this producer has genuinely never emitted before (the very first `.mts` file
+ * in a repo the adapter had previously only seen as `.ts`) would not be flagged
+ * and could be silently missed. This is a narrow, accepted gap — analogous in
+ * kind to this codebase's other disclosed heuristics — not a hidden one. */
+export function planIncrementalReuse(input) {
+    if (input.cachedPaths.length === 0) {
+        return { canReuse: false, reason: "no cached files for this producer yet" };
+    }
+    if (input.repoPaths === null) {
+        return { canReuse: false, reason: "could not determine the current file listing" };
+    }
+    const extensions = new Set(input.cachedPaths.map((path) => extname(path)));
+    const candidatePaths = [...new Set(input.repoPaths.filter((path) => extensions.has(extname(path))))].sort();
+    const cachedSorted = [...input.cachedPaths].sort();
+    if (candidatePaths.length !== cachedSorted.length ||
+        candidatePaths.some((path, index) => path !== cachedSorted[index])) {
+        return {
+            canReuse: false,
+            reason: "the set of candidate files changed since the last run (added, removed, or renamed)",
+        };
+    }
+    for (const path of cachedSorted) {
+        if (input.currentHashes.get(path) !== input.cachedHashes.get(path)) {
+            return { canReuse: false, reason: `${path} changed since the last run` };
+        }
+    }
+    return { canReuse: true, reason: `all ${String(cachedSorted.length)} cached file(s) unchanged` };
+}
+//# sourceMappingURL=incremental-cache.js.map

package/dist/store/incremental-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"incremental-cache.js","sourceRoot":"","sources":["../../src/store/incremental-cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AA+BpC;;;8DAG8D;AAC9D,MAAM,CAAC,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAErC,MAAM,UAAU,cAAc,CAAC,MAAiB,EAAE,UAAkB,EAAE,IAAY;IAChF,MAAM,IAAI,GAAG,MAAM;SAChB,OAAO,CACN;6DACuD,CACxD;SACA,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAEzB,MAAM,KAAK,GAAG,IAAI,GAAG,EAA2B,CAAC;IACjD,IAAI,iBAAqC,CAAC;IAC1C,IAAI,YAAY,GAA2B,EAAE,CAAC;IAE9C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,EAAE;YACvB,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,WAAW,EAAE,GAAG,CAAC,YAAY;YAC7B,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAsB;YACtD,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAsB;YACtD,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,CAA6B;SACxE,CAAC,CAAC;QACH,wEAAwE;QACxE,0EAA0E;QAC1E,iBAAiB,GAAG,GAAG,CAAC,kBAAkB,CAAC;QAC3C,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAA2B,CAAC;IAC9E,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,iBAAiB,EAAE,YAAY,EAAE,CAAC;AACpD,CAAC;AAED;;;4EAG4E;AAC5E,MAAM,UAAU,kBAAkB,CAChC,MAAiB,EACjB,UAAkB,EAClB,IAAY,EACZ,OAAmC,EACnC,iBAAyB,EACzB,YAAoC,EACpC,GAAW;IAEX,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE;QACtB,MAAM,CAAC,OAAO,CAAC,8DAA8D,CAAC,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACrG,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAC3B;;;6CAGuC,CACxC,CAAC;QACF,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QACjD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,CAAC,GAAG,CACR,UAAU,EACV,IAAI,EACJ,KAAK,CAAC,QAAQ,EACd,KAAK,CAAC,WAAW,EACjB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,EAC3B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,EAC3B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,EAChC,iBAAiB,EACjB,WAAW,EACX,GAAG,CACJ,CAAC;QACJ,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;;gCAUgC;AAChC,MAAM,UAAU,oBAAoB,CAAC,KAKpC;IACC,MAAM,OAAO,GAAG,IAAI,GAAG,EAA6E,CAAC;IACrG,MAAM,MAAM,GAAG,CAAC,GAAW,EAAqE,EAAE;QAChG,IAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;YAClD,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW;QAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACnD,MAAM,CAAC,kBAAkB,CAAC,CAAC;IAE3B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,IAAI,kBAAkB,CAAC;QAC5C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzE,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACnC,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,kBAAkB,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9D,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAuBD;;;;;;;;;;;;;;;;;;;4EAmB4E;AAC5E,MAAM,UAAU,oBAAoB,CAAC,KAA4B;IAC/D,IAAI,KAAK,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnC,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,uCAAuC,EAAE,CAAC;IAC9E,CAAC;IACD,IAAI,KAAK,CAAC,SAAS,KAAK,IAAI,EAAE,CAAC;QAC7B,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,8CAA8C,EAAE,CAAC;IACrF,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3E,MAAM,cAAc,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC5G,MAAM,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,CAAC;IAEnD,IACE,cAAc,CAAC,MAAM,KAAK,YAAY,CAAC,MAAM;QAC7C,cAAc,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,KAAK,YAAY,CAAC,KAAK,CAAC,CAAC,EAClE,CAAC;QACD,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,MAAM,EAAE,oFAAoF;SAC7F,CAAC;IACJ,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACnE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,IAAI,6BAA6B,EAAE,CAAC;QAC3E,CAAC;IACH,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,2BAA2B,EAAE,CAAC;AACnG,CAAC"}

package/dist/store/index.d.ts

@@ -23,6 +23,8 @@ export { DERIVED_TABLES, DERIVED_DROP_ORDER, EARNED_TABLES, IR_SCHEMA_VERSION, N
 export type { DerivedTable, EarnedTable } from "./schema.ts";
 export { writeBatch, invalidateAdapter, runIdFor, putFileHash, getFileHash, evictStaleConfirmedIncidentNodes, } from "./writer.ts";
 export type { WriteResult, WriteOptions } from "./writer.ts";
+export { FILELESS_CACHE_KEY, getCachedFiles, replaceCachedFiles, partitionBatchByFile, planIncrementalReuse, } from "./incremental-cache.ts";
+export type { CachedFileEntry, CachedProducerFiles, IncrementalReuseDecision, IncrementalReuseInput, } from "./incremental-cache.ts";
 export { getNode, findNodes, nodesOfType, nodesInFiles, outgoing, incoming, counts, contentHash } from "./reader.ts";
 export type { StoreCounts } from "./reader.ts";
 //# sourceMappingURL=index.d.ts.map

package/dist/store/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/store/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAGjE,MAAM,WAAW,gBAAiB,SAAQ,WAAW;IACnD,0EAA0E;IAC1E,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC;CAC7B;AAED,MAAM,WAAW,KAAK;IACpB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,qFAAqF;IACrF,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,KAAK,IAAI,IAAI,CAAC;CACf;AAED;iGACiG;AACjG,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,KAAK,CAwB7E;AAED,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,YAAY,EACV,aAAa,EACb,WAAW,EACX,SAAS,EACT,SAAS,EACT,QAAQ,EACR,YAAY,GACb,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAC3G,OAAO,EACL,cAAc,EACd,kBAAkB,EAClB,aAAa,EACb,iBAAiB,EACjB,cAAc,EACd,UAAU,GACX,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE7D,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,QAAQ,EACR,WAAW,EACX,WAAW,EACX,gCAAgC,GACjC,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE7D,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AACrH,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/store/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAGjE,MAAM,WAAW,gBAAiB,SAAQ,WAAW;IACnD,0EAA0E;IAC1E,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC;CAC7B;AAED,MAAM,WAAW,KAAK;IACpB,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC;IAC3B,qFAAqF;IACrF,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,KAAK,IAAI,IAAI,CAAC;CACf;AAED;iGACiG;AACjG,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,KAAK,CAwB7E;AAED,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACjD,YAAY,EACV,aAAa,EACb,WAAW,EACX,SAAS,EACT,SAAS,EACT,QAAQ,EACR,YAAY,GACb,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAC3G,OAAO,EACL,cAAc,EACd,kBAAkB,EAClB,aAAa,EACb,iBAAiB,EACjB,cAAc,EACd,UAAU,GACX,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE7D,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,QAAQ,EACR,WAAW,EACX,WAAW,EACX,gCAAgC,GACjC,MAAM,aAAa,CAAC;AACrB,YAAY,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAE7D,OAAO,EACL,kBAAkB,EAClB,cAAc,EACd,kBAAkB,EAClB,oBAAoB,EACpB,oBAAoB,GACrB,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,eAAe,EACf,mBAAmB,EACnB,wBAAwB,EACxB,qBAAqB,GACtB,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AACrH,YAAY,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC"}

package/dist/store/index.js

@@ -36,5 +36,6 @@ export { NodeSqliteDriver } from "./driver/node-sqlite.js";
 export { migrate, verifyReadOnly, dropDerived, rebuildStaleGraph, SchemaVersionError } from "./migrate.js";
 export { DERIVED_TABLES, DERIVED_DROP_ORDER, EARNED_TABLES, IR_SCHEMA_VERSION, NODE_ID_SCHEME, SCHEMA_SQL, } from "./schema.js";
 export { writeBatch, invalidateAdapter, runIdFor, putFileHash, getFileHash, evictStaleConfirmedIncidentNodes, } from "./writer.js";
+export { FILELESS_CACHE_KEY, getCachedFiles, replaceCachedFiles, partitionBatchByFile, planIncrementalReuse, } from "./incremental-cache.js";
 export { getNode, findNodes, nodesOfType, nodesInFiles, outgoing, incoming, counts, contentHash } from "./reader.js";
 //# sourceMappingURL=index.js.map

package/dist/store/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/store/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAcvD;iGACiG;AACjG,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,UAA4B,EAAE;IACpE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,IAAI,gBAAgB,EAAE,CAAC;IACxD,MAAM,WAAW,GAAgB;QAC/B,GAAG,CAAC,OAAO,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC;QAC1D,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC;KAC1E,CAAC;IACF,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC/B,IAAI,CAAC;QACH,0FAA0F;QAC1F,wFAAwF;QACxF,IAAI,OAAO,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC9B,cAAc,CAAC,MAAM,CAAC,CAAC;YACvB,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC;QACjE,CAAC;QACD,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QACpC,OAAO;YACL,MAAM;YACN,OAAO;YACP,KAAK,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE;SAC5B,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AASjD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAC3G,OAAO,EACL,cAAc,EACd,kBAAkB,EAClB,aAAa,EACb,iBAAiB,EACjB,cAAc,EACd,UAAU,GACX,MAAM,aAAa,CAAC;AAGrB,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,QAAQ,EACR,WAAW,EACX,WAAW,EACX,gCAAgC,GACjC,MAAM,aAAa,CAAC;AAGrB,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/store/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAcvD;iGACiG;AACjG,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,UAA4B,EAAE;IACpE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,IAAI,gBAAgB,EAAE,CAAC;IACxD,MAAM,WAAW,GAAgB;QAC/B,GAAG,CAAC,OAAO,CAAC,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC;QAC1D,GAAG,CAAC,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,CAAC;KAC1E,CAAC;IACF,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;IAC/B,IAAI,CAAC;QACH,0FAA0F;QAC1F,wFAAwF;QACxF,IAAI,OAAO,CAAC,QAAQ,KAAK,IAAI,EAAE,CAAC;YAC9B,cAAc,CAAC,MAAM,CAAC,CAAC;YACvB,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC;QACjE,CAAC;QACD,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QACpC,OAAO;YACL,MAAM;YACN,OAAO;YACP,KAAK,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE;SAC5B,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,EAAE,CAAC;QACf,MAAM,KAAK,CAAC;IACd,CAAC;AACH,CAAC;AAED,OAAO,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AASjD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAC3G,OAAO,EACL,cAAc,EACd,kBAAkB,EAClB,aAAa,EACb,iBAAiB,EACjB,cAAc,EACd,UAAU,GACX,MAAM,aAAa,CAAC;AAGrB,OAAO,EACL,UAAU,EACV,iBAAiB,EACjB,QAAQ,EACR,WAAW,EACX,WAAW,EACX,gCAAgC,GACjC,MAAM,aAAa,CAAC;AAGrB,OAAO,EACL,kBAAkB,EAClB,cAAc,EACd,kBAAkB,EAClB,oBAAoB,EACpB,oBAAoB,GACrB,MAAM,wBAAwB,CAAC;AAQhC,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC"}

package/dist/store/schema.d.ts

@@ -5,14 +5,14 @@
  *  `(source/target, type)` indices (max in-degree 1,036). Derived/earned: DEC-017. */
 /** Bumped when the IR itself changes shape, not when an adapter changes.
  *  DEC-017: on mismatch, refuse to read, drop derived, rebuild, migrate earned. */
-export declare const IR_SCHEMA_VERSION = 5;
+export declare const IR_SCHEMA_VERSION = 6;
 /** Tag on every node id, derived from the constant, not restated — a
  *  literal here would keep validating the old scheme after an id change. */
 export declare const NODE_ID_SCHEME: string;
 /**
  * Regenerable from source. Dropping these loses time, never information.
  */
-export declare const DERIVED_TABLES: readonly ["nodes", "edges", "unresolved_refs", "file_hashes", "embeddings", "adapter_runs"];
+export declare const DERIVED_TABLES: readonly ["nodes", "edges", "unresolved_refs", "file_hashes", "file_ir_cache", "embeddings", "adapter_runs"];
 /** Cannot be regenerated — a witnessed edge, an executed test, or a human's
  *  correction exists nowhere in source. These survive every rebuild. */
 export declare const EARNED_TABLES: readonly ["observed_edges", "observed_tests", "edge_corrections", "incident_links", "pr_scopes"];
@@ -21,6 +21,6 @@ export type EarnedTable = (typeof EARNED_TABLES)[number];
 /** Children before parents, stated explicitly (not derived by reversing
  *  `DERIVED_TABLES`) — `PRAGMA foreign_keys` can't change mid-transaction,
  *  so wrong order fails or leans on cascade to rescue it. */
-export declare const DERIVED_DROP_ORDER: readonly ["embeddings", "unresolved_refs", "edges", "nodes", "file_hashes", "adapter_runs"];
-export declare const SCHEMA_SQL = "\n-- ---------------------------------------------------------------------------\n-- graph_meta \u2014 identity of the store itself. Read before anything else.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS graph_meta (\n  key   TEXT PRIMARY KEY,\n  value TEXT NOT NULL\n) STRICT;\n\n-- ---------------------------------------------------------------------------\n-- adapter_runs \u2014 one row per accepted IRBatch. \u00A724.1's adapter registry state\n-- and DEC-015's invalidation key are the same thing, so they are one table.\n--\n-- id is derived (hash of producer + repo + commit + source files), never an\n-- autoincrement rowid: re-ingesting an identical batch must reuse the same row,\n-- or idempotence is impossible to state.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS adapter_runs (\n  id                 TEXT PRIMARY KEY,\n  repo               TEXT    NOT NULL,\n  -- The identity scope workspace-scoped ids in this batch were computed under\n  -- (DEC-054). NULL means \"this repository alone\". Recorded because the scope is\n  -- configuration: once it changes, no node id in this run can be re-derived from\n  -- the row itself, and a workspace typo is otherwise invisible after the fact.\n  workspace          TEXT,\n  commit_sha         TEXT    NOT NULL,\n  adapter_id         TEXT    NOT NULL,   -- the part before '@'\n  adapter_version    TEXT    NOT NULL,   -- the part after '@'\n  produced_by        TEXT    NOT NULL,   -- adapter_id@adapter_version, as written on every row\n  reached_resolution INTEGER NOT NULL,\n  source_files       TEXT    NOT NULL,   -- JSON array; the invalidation key (DEC-015)\n  file_count         INTEGER NOT NULL,\n  written_at         INTEGER NOT NULL\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_runs_adapter ON adapter_runs(adapter_id);\nCREATE INDEX IF NOT EXISTS idx_runs_producer ON adapter_runs(produced_by);\n\n-- ---------------------------------------------------------------------------\n-- nodes\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS nodes (\n  id          TEXT PRIMARY KEY,\n  type        TEXT    NOT NULL,\n  name        TEXT    NOT NULL,\n  file_path   TEXT,                      -- null for fileless types (DEC-014)\n  start_line  INTEGER,\n  end_line    INTEGER,\n  language    TEXT,                      -- correction 4: nullable\n  produced_by TEXT    NOT NULL,\n  resolution  INTEGER NOT NULL,\n  attrs       TEXT    NOT NULL,          -- JSON; correction 1\n  external    TEXT,                      -- JSON ExternalProvenance, null for every in-repo node\n  run_id      TEXT    NOT NULL REFERENCES adapter_runs(id) ON DELETE CASCADE\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_nodes_type ON nodes(type);\nCREATE INDEX IF NOT EXISTS idx_nodes_name ON nodes(name);\nCREATE INDEX IF NOT EXISTS idx_nodes_file ON nodes(file_path);\nCREATE INDEX IF NOT EXISTS idx_nodes_resolution ON nodes(resolution);\nCREATE INDEX IF NOT EXISTS idx_nodes_run ON nodes(run_id);\n\n-- ---------------------------------------------------------------------------\n-- edges. Primary key is hash(from, to, type) per DEC-012, so two adapters\n-- finding the same relationship collide by construction \u2014 which is what makes\n-- a merge policy statable at all. 30% of prior-art edges were exact\n-- duplicates, so this is load-bearing rather than tidy.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS edges (\n  id              TEXT PRIMARY KEY,\n  source          TEXT    NOT NULL REFERENCES nodes(id) ON DELETE CASCADE,\n  target          TEXT    NOT NULL REFERENCES nodes(id) ON DELETE CASCADE,\n  type            TEXT    NOT NULL,\n  resolution      INTEGER NOT NULL,\n  confidence      REAL    NOT NULL,\n  produced_by     TEXT    NOT NULL,\n  observed_by_run TEXT,                  -- present exactly when resolution = 4\n  attrs           TEXT,                  -- JSON or null; corrections 1 and 2\n  run_id          TEXT    NOT NULL REFERENCES adapter_runs(id) ON DELETE CASCADE,\n  CHECK (resolution BETWEEN 0 AND 4),\n  CHECK (confidence BETWEEN 0.0 AND 1.0),\n  CHECK ((resolution = 4) = (observed_by_run IS NOT NULL))\n) STRICT;\n\n-- Correction 5: the real access paths. Every hop filters by type.\nCREATE INDEX IF NOT EXISTS idx_edges_source_type ON edges(source, type);\nCREATE INDEX IF NOT EXISTS idx_edges_target_type ON edges(target, type);\nCREATE INDEX IF NOT EXISTS idx_edges_resolution ON edges(resolution);\nCREATE INDEX IF NOT EXISTS idx_edges_run ON edges(run_id);\n\n-- ---------------------------------------------------------------------------\n-- unresolved_refs \u2014 DEC-016. What an adapter saw but could not resolve.\n--\n-- Not edges, because a name-matched guess is a false claim under \u00A711B.1. Not\n-- discarded either, because then \u00A711B.6 recall has no denominator and \u00A720.2's\n-- \"not analysable\" category has nothing to count. On the prior-art graphs this\n-- is 52-60% of everything emitted.\n-- ---------------------------------------------------------------------------\n-- id is a content hash, never an autoincrement rowid: an insertion-order key\n-- would make the permuted-ingest determinism proof impossible to state, and two\n-- byte-identical references are the same reference.\nCREATE TABLE IF NOT EXISTS unresolved_refs (\n  id           TEXT PRIMARY KEY,\n  from_node_id TEXT NOT NULL REFERENCES nodes(id) ON DELETE CASCADE,\n  edge_type    TEXT NOT NULL,\n  raw_target   TEXT NOT NULL,\n  file_path    TEXT,\n  line         INTEGER,\n  produced_by  TEXT NOT NULL,\n  reason       TEXT NOT NULL,\n  -- DEC-242's attrs.blockedBy/attrs.refusalClass live here, JSON or null --\n  -- same optional-attrs treatment as edges (correction 2), and deliberately\n  -- excluded from id's content hash below: this is classification of a\n  -- refusal, not part of what makes two refusals the same refusal. Added in\n  -- schema version 3 -- DEC-017 governs what that bump costs an existing\n  -- store (drop derived, rebuild; earned tables untouched).\n  attrs        TEXT,\n  run_id       TEXT NOT NULL REFERENCES adapter_runs(id) ON DELETE CASCADE\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_unresolved_from ON unresolved_refs(from_node_id);\nCREATE INDEX IF NOT EXISTS idx_unresolved_target ON unresolved_refs(raw_target);\nCREATE INDEX IF NOT EXISTS idx_unresolved_run ON unresolved_refs(run_id);\n\n-- ---------------------------------------------------------------------------\n-- file_hashes \u2014 \u00A711.14 rebuild acceleration. Layer 1 change detection is\n-- defined against this table and v2.1 never declared it.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS file_hashes (\n  file_path      TEXT PRIMARY KEY,\n  hash           TEXT    NOT NULL,\n  last_parsed_at INTEGER NOT NULL\n) STRICT;\n\n-- ---------------------------------------------------------------------------\n-- embeddings \u2014 pointer table only. No vector extension is loaded in this build;\n-- \u00A78.2 keeps vectors in pgvector hosted or a local extension, and a column of\n-- serialised floats with no index would be a scan, not a search.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS embeddings (\n  node_id          TEXT PRIMARY KEY REFERENCES nodes(id) ON DELETE CASCADE,\n  vector_reference TEXT NOT NULL,\n  model_version    TEXT NOT NULL\n) STRICT;\n\n-- ===========================================================================\n-- EARNED \u2014 DEC-017. Never dropped. No REFERENCES into the derived tables:\n-- a foreign key would cascade these away with the graph they describe, which\n-- is precisely the outcome the partition exists to prevent.\n-- ===========================================================================\n\n-- R4 evidence. An edge witnessed firing during a live run (\u00A711B.3). This is the\n-- product's core moat and cannot be recomputed from source at any price.\nCREATE TABLE IF NOT EXISTS observed_edges (\n  edge_id     TEXT NOT NULL,\n  run_id      TEXT NOT NULL,\n  from_node_id TEXT NOT NULL,\n  to_node_id  TEXT NOT NULL,\n  edge_type   TEXT NOT NULL,\n  commit_sha  TEXT NOT NULL,\n  observed_at INTEGER NOT NULL,\n  PRIMARY KEY (edge_id, run_id)\n) STRICT;\n\n-- Which tests actually ran, and what happened. The coverage axis \u2014 AI layer \u00A720's\n-- \"Verification status\" \u2014 a different question from confidence, needing a\n-- different carrier.\n--\n-- Earned for the same reason as observed_edges, one step over: nothing in the\n-- source says which tests executed, so a rebuild that dropped this would turn\n-- \"what I actually verified\" silently back into \"what might be affected\".\n--\n-- Not an edge, deliberately. A test-runner's evidence carries no stack, so an\n-- observed test names exactly one node \u2014 its own TEST_CASE \u2014 and pairing it with\n-- a function it merely co-occurred with would mint an edge from temporal\n-- coincidence. That is why this is a table and not a promotion of a TESTS edge\n-- to R4; see DEC-NEXT-test-run-coverage-has-no-carrier.md.\n--\n-- (node_id, run_id) is the identity: two runs of one test are two facts, while a\n-- retry inside one run is the same fact re-observed, so the latter updates in\n-- place. Within-run retries are therefore not distinguishable here \u2014 a disclosed\n-- limit, not an oversight; this table is a coverage carrier, not a flake detector.\nCREATE TABLE IF NOT EXISTS observed_tests (\n  node_id        TEXT NOT NULL,\n  run_id         TEXT NOT NULL,\n  qualified_name TEXT NOT NULL,\n  outcome        TEXT NOT NULL,         -- 'passed' | 'failed' | 'skipped'\n  -- REAL, not INTEGER, and this was an INTEGER until a real run proved it could\n  -- not be. Runners report fractional milliseconds \u2014 node:test emits 2.316958 \u2014\n  -- and a STRICT table refuses that value outright, so every write failed on\n  -- first contact with an actual suite while the unit tests, which all passed\n  -- integer literals, stayed green. Rounding was the other option and is worse:\n  -- sub-millisecond tests are ordinary here, and 0.36 rounded to 0 reads as\n  -- \"instant\", the same falsehood the null-rather-than-zero rule below refuses.\n  duration_ms    REAL,\n  commit_sha     TEXT NOT NULL,\n  observed_at    INTEGER NOT NULL,\n  PRIMARY KEY (node_id, run_id)\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_observed_tests_run ON observed_tests(run_id);\n\n-- \u00A711B.5. A human said an edge was wrong, or runtime contradicted it. Feeding\n-- this back is how precision improves; losing it repeats the same false claim.\nCREATE TABLE IF NOT EXISTS edge_corrections (\n  edge_id      TEXT PRIMARY KEY,\n  verdict      TEXT    NOT NULL,         -- 'wrong' | 'right'\n  reason       TEXT    NOT NULL,\n  corrected_at INTEGER NOT NULL\n) STRICT;\n\n-- \u00A714.2. One pull request's computed scope, and it is EARNED rather than derived\n-- for a reason that is easy to get backwards.\n--\n-- Everything else on the derived side can be regenerated from source because the\n-- source is what produced it. A PR scope cannot: it was computed against a graph\n-- at one commit, and that graph moves. Recomputing it later answers a DIFFERENT\n-- question and returns a plausible answer to it \u2014 so dropping this table does\n-- not lose time, it loses the COMPARISON BASIS. Overlap scoring between two PRs\n-- is only meaningful when both scopes were computed against the same graph, and\n-- nothing in a recomputed row would say that it was not.\n--\n-- graph_commit_sha is therefore not decoration: it is the field that makes two\n-- rows comparable or not, and a reader that ignores it will happily overlap a\n-- scope from last week with one from today and report a number.\n--\n-- scope_json holds the node id set. Kept opaque here on purpose: the shape of a\n-- scope is the scoping layer's business, and a column per dimension would need\n-- a migration every time that layer learns something. What the store guarantees\n-- is that the bytes come back unchanged with the commit they were computed at.\nCREATE TABLE IF NOT EXISTS pr_scopes (\n  pr_id            TEXT    NOT NULL,\n  repo             TEXT    NOT NULL,\n  -- The head commit of the PR itself.\n  head_sha         TEXT    NOT NULL,\n  -- The commit the GRAPH was at when this scope was computed. Two scopes are\n  -- comparable only when these agree.\n  graph_commit_sha TEXT    NOT NULL,\n  scope_json       TEXT    NOT NULL,\n  node_count       INTEGER NOT NULL,\n  computed_at      INTEGER NOT NULL,\n  PRIMARY KEY (repo, pr_id, graph_commit_sha)\n) STRICT;\n\n-- The access path for overlap scoring: every scope computed against one graph.\n-- Without it, comparing N PRs scans the whole table N times.\nCREATE INDEX IF NOT EXISTS idx_pr_scopes_graph ON pr_scopes(repo, graph_commit_sha);\n\n-- Incident and fix-pattern links. Accumulated from real failures over time.\nCREATE TABLE IF NOT EXISTS incident_links (\n  incident_node_id TEXT NOT NULL,\n  target_node_id   TEXT NOT NULL,\n  kind             TEXT NOT NULL,\n  created_at       INTEGER NOT NULL,\n  PRIMARY KEY (incident_node_id, target_node_id, kind)\n) STRICT;\n";
+export declare const DERIVED_DROP_ORDER: readonly ["embeddings", "unresolved_refs", "edges", "nodes", "file_hashes", "file_ir_cache", "adapter_runs"];
+export declare const SCHEMA_SQL = "\n-- ---------------------------------------------------------------------------\n-- graph_meta \u2014 identity of the store itself. Read before anything else.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS graph_meta (\n  key   TEXT PRIMARY KEY,\n  value TEXT NOT NULL\n) STRICT;\n\n-- ---------------------------------------------------------------------------\n-- adapter_runs \u2014 one row per accepted IRBatch. \u00A724.1's adapter registry state\n-- and DEC-015's invalidation key are the same thing, so they are one table.\n--\n-- id is derived (hash of producer + repo + commit + source files), never an\n-- autoincrement rowid: re-ingesting an identical batch must reuse the same row,\n-- or idempotence is impossible to state.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS adapter_runs (\n  id                 TEXT PRIMARY KEY,\n  repo               TEXT    NOT NULL,\n  -- The identity scope workspace-scoped ids in this batch were computed under\n  -- (DEC-054). NULL means \"this repository alone\". Recorded because the scope is\n  -- configuration: once it changes, no node id in this run can be re-derived from\n  -- the row itself, and a workspace typo is otherwise invisible after the fact.\n  workspace          TEXT,\n  commit_sha         TEXT    NOT NULL,\n  adapter_id         TEXT    NOT NULL,   -- the part before '@'\n  adapter_version    TEXT    NOT NULL,   -- the part after '@'\n  produced_by        TEXT    NOT NULL,   -- adapter_id@adapter_version, as written on every row\n  reached_resolution INTEGER NOT NULL,\n  source_files       TEXT    NOT NULL,   -- JSON array; the invalidation key (DEC-015)\n  file_count         INTEGER NOT NULL,\n  written_at         INTEGER NOT NULL\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_runs_adapter ON adapter_runs(adapter_id);\nCREATE INDEX IF NOT EXISTS idx_runs_producer ON adapter_runs(produced_by);\n\n-- ---------------------------------------------------------------------------\n-- nodes\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS nodes (\n  id          TEXT PRIMARY KEY,\n  type        TEXT    NOT NULL,\n  name        TEXT    NOT NULL,\n  file_path   TEXT,                      -- null for fileless types (DEC-014)\n  start_line  INTEGER,\n  end_line    INTEGER,\n  language    TEXT,                      -- correction 4: nullable\n  produced_by TEXT    NOT NULL,\n  resolution  INTEGER NOT NULL,\n  attrs       TEXT    NOT NULL,          -- JSON; correction 1\n  external    TEXT,                      -- JSON ExternalProvenance, null for every in-repo node\n  run_id      TEXT    NOT NULL REFERENCES adapter_runs(id) ON DELETE CASCADE\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_nodes_type ON nodes(type);\nCREATE INDEX IF NOT EXISTS idx_nodes_name ON nodes(name);\nCREATE INDEX IF NOT EXISTS idx_nodes_file ON nodes(file_path);\nCREATE INDEX IF NOT EXISTS idx_nodes_resolution ON nodes(resolution);\nCREATE INDEX IF NOT EXISTS idx_nodes_run ON nodes(run_id);\n\n-- ---------------------------------------------------------------------------\n-- edges. Primary key is hash(from, to, type) per DEC-012, so two adapters\n-- finding the same relationship collide by construction \u2014 which is what makes\n-- a merge policy statable at all. 30% of prior-art edges were exact\n-- duplicates, so this is load-bearing rather than tidy.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS edges (\n  id              TEXT PRIMARY KEY,\n  source          TEXT    NOT NULL REFERENCES nodes(id) ON DELETE CASCADE,\n  target          TEXT    NOT NULL REFERENCES nodes(id) ON DELETE CASCADE,\n  type            TEXT    NOT NULL,\n  resolution      INTEGER NOT NULL,\n  confidence      REAL    NOT NULL,\n  produced_by     TEXT    NOT NULL,\n  observed_by_run TEXT,                  -- present exactly when resolution = 4\n  attrs           TEXT,                  -- JSON or null; corrections 1 and 2\n  run_id          TEXT    NOT NULL REFERENCES adapter_runs(id) ON DELETE CASCADE,\n  CHECK (resolution BETWEEN 0 AND 4),\n  CHECK (confidence BETWEEN 0.0 AND 1.0),\n  CHECK ((resolution = 4) = (observed_by_run IS NOT NULL))\n) STRICT;\n\n-- Correction 5: the real access paths. Every hop filters by type.\nCREATE INDEX IF NOT EXISTS idx_edges_source_type ON edges(source, type);\nCREATE INDEX IF NOT EXISTS idx_edges_target_type ON edges(target, type);\nCREATE INDEX IF NOT EXISTS idx_edges_resolution ON edges(resolution);\nCREATE INDEX IF NOT EXISTS idx_edges_run ON edges(run_id);\n\n-- ---------------------------------------------------------------------------\n-- unresolved_refs \u2014 DEC-016. What an adapter saw but could not resolve.\n--\n-- Not edges, because a name-matched guess is a false claim under \u00A711B.1. Not\n-- discarded either, because then \u00A711B.6 recall has no denominator and \u00A720.2's\n-- \"not analysable\" category has nothing to count. On the prior-art graphs this\n-- is 52-60% of everything emitted.\n-- ---------------------------------------------------------------------------\n-- id is a content hash, never an autoincrement rowid: an insertion-order key\n-- would make the permuted-ingest determinism proof impossible to state, and two\n-- byte-identical references are the same reference.\nCREATE TABLE IF NOT EXISTS unresolved_refs (\n  id           TEXT PRIMARY KEY,\n  from_node_id TEXT NOT NULL REFERENCES nodes(id) ON DELETE CASCADE,\n  edge_type    TEXT NOT NULL,\n  raw_target   TEXT NOT NULL,\n  file_path    TEXT,\n  line         INTEGER,\n  produced_by  TEXT NOT NULL,\n  reason       TEXT NOT NULL,\n  -- DEC-242's attrs.blockedBy/attrs.refusalClass live here, JSON or null --\n  -- same optional-attrs treatment as edges (correction 2), and deliberately\n  -- excluded from id's content hash below: this is classification of a\n  -- refusal, not part of what makes two refusals the same refusal. Added in\n  -- schema version 3 -- DEC-017 governs what that bump costs an existing\n  -- store (drop derived, rebuild; earned tables untouched).\n  attrs        TEXT,\n  run_id       TEXT NOT NULL REFERENCES adapter_runs(id) ON DELETE CASCADE\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_unresolved_from ON unresolved_refs(from_node_id);\nCREATE INDEX IF NOT EXISTS idx_unresolved_target ON unresolved_refs(raw_target);\nCREATE INDEX IF NOT EXISTS idx_unresolved_run ON unresolved_refs(run_id);\n\n-- ---------------------------------------------------------------------------\n-- file_hashes \u2014 \u00A711.14 rebuild acceleration. Layer 1 change detection is\n-- defined against this table and v2.1 never declared it.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS file_hashes (\n  file_path      TEXT PRIMARY KEY,\n  hash           TEXT    NOT NULL,\n  last_parsed_at INTEGER NOT NULL\n) STRICT;\n\n-- ---------------------------------------------------------------------------\n-- file_ir_cache \u2014 Gap 6 incremental indexing. Unlike file_hashes above (which\n-- only ever stores a hash, with no cached IR to reconstruct from \u2014 the reason\n-- naive hash-gating in analyze.ts would silently evict unchanged files' rows),\n-- this holds each file's actual contribution to its producer's last successful\n-- batch, so an unchanged file's nodes/edges/unresolved-refs can be re-supplied\n-- to the writer without re-parsing anything.\n--\n-- Keyed by (produced_by, repo, file_path): two different producers reading the\n-- same path (a polyglot repo) must not collide, and DEC-228 already established\n-- the same for file_hashes' sibling problem.\n--\n-- One row uses file_path = '' as a sentinel for the batch's fileless/cross-file\n-- contribution (nodes with no file, plus edges whose \"from\" node isn't itself\n-- attributable to a single cached file) \u2014 content_hash is meaningless for that\n-- row and never compared; it is only ever reused as part of a whole-producer\n-- reconstruction where every real file already matched (see incremental-cache.ts).\n--\n-- reached_resolution/skipped_files_json are batch-level, not per-file, and are\n-- denormalised onto every row for one producer rather than kept in a second\n-- table \u2014 the same trade this schema already makes for adapter_runs vs a\n-- one-true-row-per-batch design.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS file_ir_cache (\n  produced_by         TEXT    NOT NULL,\n  repo                TEXT    NOT NULL,\n  file_path           TEXT    NOT NULL,\n  content_hash        TEXT    NOT NULL,\n  nodes_json          TEXT    NOT NULL,\n  edges_json          TEXT    NOT NULL,\n  unresolved_json     TEXT    NOT NULL,\n  reached_resolution  INTEGER NOT NULL,\n  skipped_files_json  TEXT    NOT NULL,\n  cached_at           INTEGER NOT NULL,\n  PRIMARY KEY (produced_by, repo, file_path)\n) STRICT;\n\n-- ---------------------------------------------------------------------------\n-- embeddings \u2014 pointer table only. No vector extension is loaded in this build;\n-- \u00A78.2 keeps vectors in pgvector hosted or a local extension, and a column of\n-- serialised floats with no index would be a scan, not a search.\n-- ---------------------------------------------------------------------------\nCREATE TABLE IF NOT EXISTS embeddings (\n  node_id          TEXT PRIMARY KEY REFERENCES nodes(id) ON DELETE CASCADE,\n  vector_reference TEXT NOT NULL,\n  model_version    TEXT NOT NULL\n) STRICT;\n\n-- ===========================================================================\n-- EARNED \u2014 DEC-017. Never dropped. No REFERENCES into the derived tables:\n-- a foreign key would cascade these away with the graph they describe, which\n-- is precisely the outcome the partition exists to prevent.\n-- ===========================================================================\n\n-- R4 evidence. An edge witnessed firing during a live run (\u00A711B.3). This is the\n-- product's core moat and cannot be recomputed from source at any price.\nCREATE TABLE IF NOT EXISTS observed_edges (\n  edge_id     TEXT NOT NULL,\n  run_id      TEXT NOT NULL,\n  from_node_id TEXT NOT NULL,\n  to_node_id  TEXT NOT NULL,\n  edge_type   TEXT NOT NULL,\n  commit_sha  TEXT NOT NULL,\n  observed_at INTEGER NOT NULL,\n  PRIMARY KEY (edge_id, run_id)\n) STRICT;\n\n-- Which tests actually ran, and what happened. The coverage axis \u2014 AI layer \u00A720's\n-- \"Verification status\" \u2014 a different question from confidence, needing a\n-- different carrier.\n--\n-- Earned for the same reason as observed_edges, one step over: nothing in the\n-- source says which tests executed, so a rebuild that dropped this would turn\n-- \"what I actually verified\" silently back into \"what might be affected\".\n--\n-- Not an edge, deliberately. A test-runner's evidence carries no stack, so an\n-- observed test names exactly one node \u2014 its own TEST_CASE \u2014 and pairing it with\n-- a function it merely co-occurred with would mint an edge from temporal\n-- coincidence. That is why this is a table and not a promotion of a TESTS edge\n-- to R4; see DEC-NEXT-test-run-coverage-has-no-carrier.md.\n--\n-- (node_id, run_id) is the identity: two runs of one test are two facts, while a\n-- retry inside one run is the same fact re-observed, so the latter updates in\n-- place. Within-run retries are therefore not distinguishable here \u2014 a disclosed\n-- limit, not an oversight; this table is a coverage carrier, not a flake detector.\nCREATE TABLE IF NOT EXISTS observed_tests (\n  node_id        TEXT NOT NULL,\n  run_id         TEXT NOT NULL,\n  qualified_name TEXT NOT NULL,\n  outcome        TEXT NOT NULL,         -- 'passed' | 'failed' | 'skipped'\n  -- REAL, not INTEGER, and this was an INTEGER until a real run proved it could\n  -- not be. Runners report fractional milliseconds \u2014 node:test emits 2.316958 \u2014\n  -- and a STRICT table refuses that value outright, so every write failed on\n  -- first contact with an actual suite while the unit tests, which all passed\n  -- integer literals, stayed green. Rounding was the other option and is worse:\n  -- sub-millisecond tests are ordinary here, and 0.36 rounded to 0 reads as\n  -- \"instant\", the same falsehood the null-rather-than-zero rule below refuses.\n  duration_ms    REAL,\n  commit_sha     TEXT NOT NULL,\n  observed_at    INTEGER NOT NULL,\n  PRIMARY KEY (node_id, run_id)\n) STRICT;\n\nCREATE INDEX IF NOT EXISTS idx_observed_tests_run ON observed_tests(run_id);\n\n-- \u00A711B.5. A human said an edge was wrong, or runtime contradicted it. Feeding\n-- this back is how precision improves; losing it repeats the same false claim.\nCREATE TABLE IF NOT EXISTS edge_corrections (\n  edge_id      TEXT PRIMARY KEY,\n  verdict      TEXT    NOT NULL,         -- 'wrong' | 'right'\n  reason       TEXT    NOT NULL,\n  corrected_at INTEGER NOT NULL\n) STRICT;\n\n-- \u00A714.2. One pull request's computed scope, and it is EARNED rather than derived\n-- for a reason that is easy to get backwards.\n--\n-- Everything else on the derived side can be regenerated from source because the\n-- source is what produced it. A PR scope cannot: it was computed against a graph\n-- at one commit, and that graph moves. Recomputing it later answers a DIFFERENT\n-- question and returns a plausible answer to it \u2014 so dropping this table does\n-- not lose time, it loses the COMPARISON BASIS. Overlap scoring between two PRs\n-- is only meaningful when both scopes were computed against the same graph, and\n-- nothing in a recomputed row would say that it was not.\n--\n-- graph_commit_sha is therefore not decoration: it is the field that makes two\n-- rows comparable or not, and a reader that ignores it will happily overlap a\n-- scope from last week with one from today and report a number.\n--\n-- scope_json holds the node id set. Kept opaque here on purpose: the shape of a\n-- scope is the scoping layer's business, and a column per dimension would need\n-- a migration every time that layer learns something. What the store guarantees\n-- is that the bytes come back unchanged with the commit they were computed at.\nCREATE TABLE IF NOT EXISTS pr_scopes (\n  pr_id            TEXT    NOT NULL,\n  repo             TEXT    NOT NULL,\n  -- The head commit of the PR itself.\n  head_sha         TEXT    NOT NULL,\n  -- The commit the GRAPH was at when this scope was computed. Two scopes are\n  -- comparable only when these agree.\n  graph_commit_sha TEXT    NOT NULL,\n  scope_json       TEXT    NOT NULL,\n  node_count       INTEGER NOT NULL,\n  computed_at      INTEGER NOT NULL,\n  PRIMARY KEY (repo, pr_id, graph_commit_sha)\n) STRICT;\n\n-- The access path for overlap scoring: every scope computed against one graph.\n-- Without it, comparing N PRs scans the whole table N times.\nCREATE INDEX IF NOT EXISTS idx_pr_scopes_graph ON pr_scopes(repo, graph_commit_sha);\n\n-- Incident and fix-pattern links. Accumulated from real failures over time.\nCREATE TABLE IF NOT EXISTS incident_links (\n  incident_node_id TEXT NOT NULL,\n  target_node_id   TEXT NOT NULL,\n  kind             TEXT NOT NULL,\n  created_at       INTEGER NOT NULL,\n  PRIMARY KEY (incident_node_id, target_node_id, kind)\n) STRICT;\n";
 //# sourceMappingURL=schema.d.ts.map

package/dist/store/schema.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../../src/store/schema.ts"],"names":[],"mappings":"AAAA;;;;sFAIsF;AAItF;mFACmF;AACnF,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAEnC;4EAC4E;AAC5E,eAAO,MAAM,cAAc,QAAkC,CAAC;AAE9D;;GAEG;AACH,eAAO,MAAM,cAAc,6FAOjB,CAAC;AAEX;wEACwE;AACxE,eAAO,MAAM,aAAa,kGAMhB,CAAC;AAEX,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAC3D,MAAM,MAAM,WAAW,GAAG,CAAC,OAAO,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC;AAEzD;;6DAE6D;AAC7D,eAAO,MAAM,kBAAkB,6FAOa,CAAC;AAE7C,eAAO,MAAM,UAAU,gnaAgQtB,CAAC"}
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../../src/store/schema.ts"],"names":[],"mappings":"AAAA;;;;sFAIsF;AAItF;mFACmF;AACnF,eAAO,MAAM,iBAAiB,IAAI,CAAC;AAOnC;4EAC4E;AAC5E,eAAO,MAAM,cAAc,QAAkC,CAAC;AAE9D;;GAEG;AACH,eAAO,MAAM,cAAc,8GAQjB,CAAC;AAEX;wEACwE;AACxE,eAAO,MAAM,aAAa,kGAMhB,CAAC;AAEX,MAAM,MAAM,YAAY,GAAG,CAAC,OAAO,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC;AAC3D,MAAM,MAAM,WAAW,GAAG,CAAC,OAAO,aAAa,CAAC,CAAC,MAAM,CAAC,CAAC;AAEzD;;6DAE6D;AAC7D,eAAO,MAAM,kBAAkB,8GAQa,CAAC;AAE7C,eAAO,MAAM,UAAU,2meAqStB,CAAC"}

package/dist/store/schema.js

@@ -6,7 +6,12 @@
 import { NODE_ID_PREFIX } from "@descryy/ir";
 /** Bumped when the IR itself changes shape, not when an adapter changes.
  *  DEC-017: on mismatch, refuse to read, drop derived, rebuild, migrate earned. */
-export const IR_SCHEMA_VERSION = 5; // 4 -> 5: nodes.external, the dependency boundary (DEC-NEXT-external-symbol-nodes-at-the-dependency-boundary)
+export const IR_SCHEMA_VERSION = 6; // 5 -> 6: API_ENDPOINT/DATABASE_TABLE/DATABASE_COLUMN fold
+// `repo` into their id unconditionally instead of letting a configured workspace strip it
+// (DEC-NEXT-endpoint-identity-repo-scoping) — every id of these three types computed under
+// version 5 is wrong for this build. DEC-017 handles it exactly as designed: refuse to read,
+// drop derived (nodes/edges/...), rebuild from source, keep earned data (R4 observations,
+// edge corrections, incident links) untouched.
 /** Tag on every node id, derived from the constant, not restated — a
  *  literal here would keep validating the old scheme after an id change. */
 export const NODE_ID_SCHEME = NODE_ID_PREFIX.replace(":", "");
@@ -18,6 +23,7 @@ export const DERIVED_TABLES = [
     "edges",
     "unresolved_refs",
     "file_hashes",
+    "file_ir_cache",
     "embeddings",
     "adapter_runs",
 ];
@@ -39,6 +45,7 @@ export const DERIVED_DROP_ORDER = [
     "edges",
     "nodes",
     "file_hashes",
+    "file_ir_cache",
     "adapter_runs",
 ];
 export const SCHEMA_SQL = `
@@ -175,6 +182,43 @@ CREATE TABLE IF NOT EXISTS file_hashes (
   last_parsed_at INTEGER NOT NULL
 ) STRICT;
 
+-- ---------------------------------------------------------------------------
+-- file_ir_cache — Gap 6 incremental indexing. Unlike file_hashes above (which
+-- only ever stores a hash, with no cached IR to reconstruct from — the reason
+-- naive hash-gating in analyze.ts would silently evict unchanged files' rows),
+-- this holds each file's actual contribution to its producer's last successful
+-- batch, so an unchanged file's nodes/edges/unresolved-refs can be re-supplied
+-- to the writer without re-parsing anything.
+--
+-- Keyed by (produced_by, repo, file_path): two different producers reading the
+-- same path (a polyglot repo) must not collide, and DEC-228 already established
+-- the same for file_hashes' sibling problem.
+--
+-- One row uses file_path = '' as a sentinel for the batch's fileless/cross-file
+-- contribution (nodes with no file, plus edges whose "from" node isn't itself
+-- attributable to a single cached file) — content_hash is meaningless for that
+-- row and never compared; it is only ever reused as part of a whole-producer
+-- reconstruction where every real file already matched (see incremental-cache.ts).
+--
+-- reached_resolution/skipped_files_json are batch-level, not per-file, and are
+-- denormalised onto every row for one producer rather than kept in a second
+-- table — the same trade this schema already makes for adapter_runs vs a
+-- one-true-row-per-batch design.
+-- ---------------------------------------------------------------------------
+CREATE TABLE IF NOT EXISTS file_ir_cache (
+  produced_by         TEXT    NOT NULL,
+  repo                TEXT    NOT NULL,
+  file_path           TEXT    NOT NULL,
+  content_hash        TEXT    NOT NULL,
+  nodes_json          TEXT    NOT NULL,
+  edges_json          TEXT    NOT NULL,
+  unresolved_json     TEXT    NOT NULL,
+  reached_resolution  INTEGER NOT NULL,
+  skipped_files_json  TEXT    NOT NULL,
+  cached_at           INTEGER NOT NULL,
+  PRIMARY KEY (produced_by, repo, file_path)
+) STRICT;
+
 -- ---------------------------------------------------------------------------
 -- embeddings — pointer table only. No vector extension is loaded in this build;
 -- §8.2 keeps vectors in pgvector hosted or a local extension, and a column of

package/dist/store/schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"schema.js","sourceRoot":"","sources":["../../src/store/schema.ts"],"names":[],"mappings":"AAAA;;;;sFAIsF;AAEtF,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAE7C;mFACmF;AACnF,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,CAAC,8GAA8G;AAElJ;4EAC4E;AAC5E,MAAM,CAAC,MAAM,cAAc,GAAG,cAAc,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;AAE9D;;GAEG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B,OAAO;IACP,OAAO;IACP,iBAAiB;IACjB,aAAa;IACb,YAAY;IACZ,cAAc;CACN,CAAC;AAEX;wEACwE;AACxE,MAAM,CAAC,MAAM,aAAa,GAAG;IAC3B,gBAAgB;IAChB,gBAAgB;IAChB,kBAAkB;IAClB,gBAAgB;IAChB,WAAW;CACH,CAAC;AAKX;;6DAE6D;AAC7D,MAAM,CAAC,MAAM,kBAAkB,GAAG;IAChC,YAAY;IACZ,iBAAiB;IACjB,OAAO;IACP,OAAO;IACP,aAAa;IACb,cAAc;CAC4B,CAAC;AAE7C,MAAM,CAAC,MAAM,UAAU,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAgQzB,CAAC"}
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../../src/store/schema.ts"],"names":[],"mappings":"AAAA;;;;sFAIsF;AAEtF,OAAO,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAE7C;mFACmF;AACnF,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,CAAC,CAAC,2DAA2D;AAC/F,0FAA0F;AAC1F,2FAA2F;AAC3F,6FAA6F;AAC7F,0FAA0F;AAC1F,+CAA+C;AAE/C;4EAC4E;AAC5E,MAAM,CAAC,MAAM,cAAc,GAAG,cAAc,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;AAE9D;;GAEG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B,OAAO;IACP,OAAO;IACP,iBAAiB;IACjB,aAAa;IACb,eAAe;IACf,YAAY;IACZ,cAAc;CACN,CAAC;AAEX;wEACwE;AACxE,MAAM,CAAC,MAAM,aAAa,GAAG;IAC3B,gBAAgB;IAChB,gBAAgB;IAChB,kBAAkB;IAClB,gBAAgB;IAChB,WAAW;CACH,CAAC;AAKX;;6DAE6D;AAC7D,MAAM,CAAC,MAAM,kBAAkB,GAAG;IAChC,YAAY;IACZ,iBAAiB;IACjB,OAAO;IACP,OAAO;IACP,aAAa;IACb,eAAe;IACf,cAAc;CAC4B,CAAC;AAE7C,MAAM,CAAC,MAAM,UAAU,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAqSzB,CAAC"}

package/dist/workspace/graph-layout.d.ts

@@ -0,0 +1,85 @@
+/**
+ * Where a workspace's shared graph lives, and the migration off the old
+ * one-graph-per-repository layout — Gap 1 of
+ * `documents/plans/site-claims-closure-production-plan.md`.
+ *
+ * Ported from `descry-desktop`'s `packages/session/src/indexing/graph-layout.ts`
+ * (H-2, "one graph per workspace, not per repository"), which solved the same
+ * problem for the desktop app's single, central engine root. The layout differs
+ * here because `descry-core` has no such root: every repository owns its own
+ * `.descry/` directory and its own `graph` path in `.descry/config.json`
+ * (`session.ts`'s `DescryConfig.graph`), so there is no `graph/${repositoryId}.db`
+ * convention to reuse. Two adaptations follow from that:
+ *
+ * 1. `workspaceGraphPath` keeps the desktop version's shape —
+ *    `join(rootDir, "graph", "workspace-<id>.db")` — but `rootDir` here is a
+ *    directory the caller chooses per invocation (the MCP `analyze_workspace`
+ *    tool uses the initiating repository's `.descry/` directory), not a
+ *    single app-wide engine root. That is a disclosed design choice, not an
+ *    inferred one: the shared graph physically lives inside whichever
+ *    repository's session first asked for it.
+ * 2. `migrateToWorkspaceGraph` takes each repository's *actual* existing graph
+ *    path directly (`RepoGraphLocation.graphPath`, read from that repo's own
+ *    config) rather than deriving one from a `repositoryId` the way the
+ *    desktop version does — `descry-core` already knows the real path per
+ *    repo without having to reconstruct it.
+ *
+ * The reasoning for *why* a migration is a move-and-reindex rather than a
+ * merge is unchanged from the desktop original: every node id in a
+ * pre-workspace graph was computed with `workspace` absent
+ * (`IdentityScope.workspace`, `packages/ir/src/identity.ts`), so
+ * workspace-scoped node types (`API_ENDPOINT`, `DATABASE_TABLE`,
+ * `DATABASE_COLUMN`, `INCIDENT`, `FIX_PATTERN`) in it carry repo-scoped ids —
+ * copying those rows into the shared store would populate it with ids nothing
+ * will ever produce again, which is worse than an empty graph because it looks
+ * full. So the honest handling is: move the stale database aside (never
+ * delete it), name the repository whose graph status must be treated as
+ * needing a fresh index, and let `indexWorkspace` (`../../  ../mcp/src
+ * /workspace-index.ts`) produce correct ids by reading the repository again.
+ */
+/** The one graph every repository in a workspace is indexed into. */
+export declare function workspaceGraphPath(rootDir: string, workspaceId: string): string;
+/** One repository's pre-workspace graph, as it actually sits on disk today. */
+export interface RepoGraphLocation {
+    readonly repo: string;
+    /** Absolute path to that repository's own (pre-workspace) graph file. */
+    readonly graphPath: string;
+}
+export interface MovedGraphDatabase {
+    readonly repo: string;
+    readonly from: string;
+    readonly to: string;
+}
+export interface GraphLayoutMigration {
+    readonly migrated: boolean;
+    readonly movedDatabases: readonly MovedGraphDatabase[];
+    /**
+     * Repositories whose old graph must be treated as gone, so the caller
+     * re-indexes them into the workspace graph. Leaving one out would mean a
+     * repository's rows silently missing from the shared store — nothing errors,
+     * a query about it just finds nothing, indistinguishable from "there is
+     * nothing there".
+     */
+    readonly reposToReindex: readonly string[];
+    /** Non-null whenever anything moved. Rule 7: a fallback is never silent. */
+    readonly disclosure: string | null;
+}
+export interface MigrateToWorkspaceGraphOptions {
+    /** Where the shared graph will live — `graph/` sits directly under it, same as `workspaceGraphPath`. */
+    readonly rootDir: string;
+    readonly workspaceId: string;
+    readonly repositories: readonly RepoGraphLocation[];
+    /** Injectable so the backup filename is not at the mercy of the wall clock. */
+    readonly now?: () => number;
+}
+/**
+ * Move every pre-workspace graph aside and report what has to be re-indexed.
+ *
+ * Idempotent: a second call finds nothing at the recorded paths (because the
+ * first call already moved them) and reports `migrated: false`. A path that
+ * does not exist — the common case for a repository that has simply never
+ * been analysed yet — is skipped without comment; there is nothing stale to
+ * move.
+ */
+export declare function migrateToWorkspaceGraph(options: MigrateToWorkspaceGraphOptions): GraphLayoutMigration;
+//# sourceMappingURL=graph-layout.d.ts.map

package/dist/workspace/graph-layout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-layout.d.ts","sourceRoot":"","sources":["../../src/workspace/graph-layout.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AAUH,qEAAqE;AACrE,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,MAAM,CAE/E;AAED,+EAA+E;AAC/E,MAAM,WAAW,iBAAiB;IAChC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,yEAAyE;IACzE,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,oBAAoB;IACnC,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,cAAc,EAAE,SAAS,kBAAkB,EAAE,CAAC;IACvD;;;;;;OAMG;IACH,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,4EAA4E;IAC5E,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CACpC;AAED,MAAM,WAAW,8BAA8B;IAC7C,wGAAwG;IACxG,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,YAAY,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACpD,+EAA+E;IAC/E,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CAC7B;AAED;;;;;;;;GAQG;AACH,wBAAgB,uBAAuB,CAAC,OAAO,EAAE,8BAA8B,GAAG,oBAAoB,CAkCrG"}