@descryy/core 0.3.0 → 0.5.0

package/dist/graph/merge.d.ts

@@ -1,41 +1,7 @@
 /**
- * The merge policy — DEC-012.
- *
- * Two adapters finding the same relationship produce the same edge id, by
- * construction: `hash(from, to, type)` deliberately excludes resolution,
- * confidence and producer. On the prior-art graphs measured for this build, 30%
- * of edges were exact duplicates, so this is the common path rather than an
- * edge case.
- *
- * ## The rule
- *
- *   higher `resolution` wins
- *   → tie: higher `confidence` wins
- *   → tie: lexicographically smaller `producedBy` wins
- *
- * ## What the rule refuses to do
- *
- * **Confidence is never combined.** Two adapters each 0.8 confident does not
- * make 0.96, or 0.8, or anything else — there is no evidence-combination model
- * here, the two adapters are not independent observers, and inventing a formula
- * would silently move every impact score in §12.4 with nothing in the output to
- * show it happened. Corroboration is recorded as a fact (`attrs.corroboratedBy`)
- * rather than folded into a number.
- *
- * The third tie-break exists only to make the result independent of the order
- * batches arrive in. Lexicographic order is arbitrary; determinism is not.
- *
- * ## Why the rule is written twice
- *
- * The merge has to hold in two places: in memory, when the Graph Builder folds
- * several batches together, and in SQL, when a later batch upserts onto an edge
- * an earlier one already wrote. A rule enforced in only the first is not
- * enforced at all, because the writer is reachable directly.
- *
- * So it appears as a TypeScript predicate and as a SQL `WHERE` fragment, side by
- * side, with a differential test that runs the same case table through both.
- * Two copies with a test that they agree beats one copy that only covers one of
- * the two paths.
+ * Merge policy (DEC-012): higher `resolution` wins, then `confidence`, then smaller `producedBy`.
+ * Confidence is never combined — recorded as `attrs.corroboratedBy` instead of folded into a number.
+ * Enforced twice, TypeScript predicate + SQL `WHERE` fragment, with a differential test proving they agree.
  */
 import type { IREdge, IRNode } from "@descryy/ir";
 /** The fields the merge decides between. Both the graph and a stored row satisfy it. */
@@ -44,52 +10,18 @@ export interface Mergeable {
     readonly confidence: number;
     readonly producedBy: string;
 }
-/**
- * Should `incoming` replace `existing`?
- *
- * Strict: an exact tie on all three keeps what is already there, so re-ingesting
- * the same batch is a no-op rather than a rewrite.
- */
+/** Should `incoming` replace `existing`? Strict: an exact tie keeps what's there — re-ingest is a no-op. */
 export declare function preferIncoming(incoming: Mergeable, existing: Mergeable): boolean;
-/**
- * The same rule as a SQL `WHERE` clause on an upsert's `DO UPDATE`.
- *
- * `excluded` is the incoming row, `edges` the one already stored — SQLite's
- * upsert names them that way. Kept adjacent to `preferIncoming` on purpose:
- * `merge.test.ts` runs one case table through both and fails if they disagree.
- */
+/** Same rule as SQL `WHERE` on an upsert. `excluded` = incoming, `edges` = stored; `merge.test.ts` checks both agree. */
 export declare const EDGE_MERGE_CONDITION = "\n  excluded.resolution > edges.resolution\n  OR (excluded.resolution = edges.resolution AND excluded.confidence > edges.confidence)\n  OR (excluded.resolution = edges.resolution\n      AND excluded.confidence = edges.confidence\n      AND excluded.produced_by < edges.produced_by)\n";
 /** The same, for nodes. Nodes carry no confidence, so the middle key drops out. */
 export declare const NODE_MERGE_CONDITION = "\n  excluded.resolution > nodes.resolution\n  OR (excluded.resolution = nodes.resolution AND excluded.produced_by < nodes.produced_by)\n";
-/**
- * Producers that corroborated a merged item, sorted and de-duplicated.
- *
- * DEC-012 records this instead of combining confidence. It is not decoration:
- * "two independent adapters agree" is a materially different statement from "one
- * adapter is fairly sure", and it is the only form in which the graph can carry
- * that distinction without inventing an evidence model.
- */
+/** Producers that corroborated a merged item, sorted/deduped. DEC-012 records this instead of combining confidence. */
 export declare function corroborators(existing: Readonly<Record<string, unknown>> | undefined, ...producers: string[]): string[];
 /** Merge two edges that share an id. Returns the winner, carrying corroboration. */
 export declare function mergeEdge(incoming: IREdge, existing: IREdge): IREdge;
-/**
- * Merge two nodes that share an id.
- *
- * Attributes are NOT unioned. `attrs` is language- and framework-specific detail
- * (§11A.4), so pooling two adapters' attributes would produce a node describing
- * a thing that does not exist. The winner's attrs are kept whole and the loser is
- * recorded as a corroborator.
- */
+/** Merge two nodes sharing an id. Unions non-conflicting attrs; on conflict keeps the winner's value and records the key in `attrs.disputedAttrs`. Supersedes DEC-012's all-or-nothing rule. */
 export declare function mergeNode(incoming: IRNode, existing: IRNode): IRNode;
-/**
- * The fields two nodes sharing an id must agree on.
- *
- * Compared as one opaque string rather than field by field. That is not only
- * tidier: `n.language !== m.language` reads to the boundary lint as branching on
- * a language, and the lint is right to be suspicious — the exception here is
- * that this asks whether two nodes *disagree*, never which language either one
- * is. Folding both fields into a fingerprint states that intent in the code
- * rather than in a lint suppression.
- */
+/** Fields two nodes sharing an id must agree on. Compared as one opaque string — field-by-field would read as branching on language to the boundary lint. */
 export declare function identityFingerprint(node: IRNode): string;
 //# sourceMappingURL=merge.d.ts.map

package/dist/graph/merge.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"merge.d.ts","sourceRoot":"","sources":["../../src/graph/merge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAElD,wFAAwF;AACxF,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,GAAG,OAAO,CAQhF;AAED;;;;;;GAMG;AACH,eAAO,MAAM,oBAAoB,gSAMhC,CAAC;AAEF,mFAAmF;AACnF,eAAO,MAAM,oBAAoB,6IAGhC,CAAC;AAEF;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG,SAAS,EACvD,GAAG,SAAS,EAAE,MAAM,EAAE,GACrB,MAAM,EAAE,CAKV;AAED,oFAAoF;AACpF,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAWpE;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAcpE;AAED;;;;;;;;;GASG;AACH,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAExD"}
+{"version":3,"file":"merge.d.ts","sourceRoot":"","sources":["../../src/graph/merge.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAElD,wFAAwF;AACxF,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,4GAA4G;AAC5G,wBAAgB,cAAc,CAAC,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,SAAS,GAAG,OAAO,CAQhF;AAED,yHAAyH;AACzH,eAAO,MAAM,oBAAoB,gSAMhC,CAAC;AAEF,mFAAmF;AACnF,eAAO,MAAM,oBAAoB,6IAGhC,CAAC;AAEF,uHAAuH;AACvH,wBAAgB,aAAa,CAC3B,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,GAAG,SAAS,EACvD,GAAG,SAAS,EAAE,MAAM,EAAE,GACrB,MAAM,EAAE,CAKV;AAED,oFAAoF;AACpF,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAWpE;AAKD,gMAAgM;AAChM,wBAAgB,SAAS,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAkCpE;AAED,6JAA6J;AAC7J,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAExD"}

package/dist/graph/merge.js

@@ -1,48 +1,9 @@
 /**
- * The merge policy — DEC-012.
- *
- * Two adapters finding the same relationship produce the same edge id, by
- * construction: `hash(from, to, type)` deliberately excludes resolution,
- * confidence and producer. On the prior-art graphs measured for this build, 30%
- * of edges were exact duplicates, so this is the common path rather than an
- * edge case.
- *
- * ## The rule
- *
- *   higher `resolution` wins
- *   → tie: higher `confidence` wins
- *   → tie: lexicographically smaller `producedBy` wins
- *
- * ## What the rule refuses to do
- *
- * **Confidence is never combined.** Two adapters each 0.8 confident does not
- * make 0.96, or 0.8, or anything else — there is no evidence-combination model
- * here, the two adapters are not independent observers, and inventing a formula
- * would silently move every impact score in §12.4 with nothing in the output to
- * show it happened. Corroboration is recorded as a fact (`attrs.corroboratedBy`)
- * rather than folded into a number.
- *
- * The third tie-break exists only to make the result independent of the order
- * batches arrive in. Lexicographic order is arbitrary; determinism is not.
- *
- * ## Why the rule is written twice
- *
- * The merge has to hold in two places: in memory, when the Graph Builder folds
- * several batches together, and in SQL, when a later batch upserts onto an edge
- * an earlier one already wrote. A rule enforced in only the first is not
- * enforced at all, because the writer is reachable directly.
- *
- * So it appears as a TypeScript predicate and as a SQL `WHERE` fragment, side by
- * side, with a differential test that runs the same case table through both.
- * Two copies with a test that they agree beats one copy that only covers one of
- * the two paths.
- */
-/**
- * Should `incoming` replace `existing`?
- *
- * Strict: an exact tie on all three keeps what is already there, so re-ingesting
- * the same batch is a no-op rather than a rewrite.
+ * Merge policy (DEC-012): higher `resolution` wins, then `confidence`, then smaller `producedBy`.
+ * Confidence is never combined — recorded as `attrs.corroboratedBy` instead of folded into a number.
+ * Enforced twice, TypeScript predicate + SQL `WHERE` fragment, with a differential test proving they agree.
  */
+/** Should `incoming` replace `existing`? Strict: an exact tie keeps what's there — re-ingest is a no-op. */
 export function preferIncoming(incoming, existing) {
     if (incoming.resolution !== existing.resolution) {
         return incoming.resolution > existing.resolution;
@@ -52,13 +13,7 @@ export function preferIncoming(incoming, existing) {
     }
     return incoming.producedBy < existing.producedBy;
 }
-/**
- * The same rule as a SQL `WHERE` clause on an upsert's `DO UPDATE`.
- *
- * `excluded` is the incoming row, `edges` the one already stored — SQLite's
- * upsert names them that way. Kept adjacent to `preferIncoming` on purpose:
- * `merge.test.ts` runs one case table through both and fails if they disagree.
- */
+/** Same rule as SQL `WHERE` on an upsert. `excluded` = incoming, `edges` = stored; `merge.test.ts` checks both agree. */
 export const EDGE_MERGE_CONDITION = `
   excluded.resolution > edges.resolution
   OR (excluded.resolution = edges.resolution AND excluded.confidence > edges.confidence)
@@ -71,14 +26,7 @@ export const NODE_MERGE_CONDITION = `
   excluded.resolution > nodes.resolution
   OR (excluded.resolution = nodes.resolution AND excluded.produced_by < nodes.produced_by)
 `;
-/**
- * Producers that corroborated a merged item, sorted and de-duplicated.
- *
- * DEC-012 records this instead of combining confidence. It is not decoration:
- * "two independent adapters agree" is a materially different statement from "one
- * adapter is fairly sure", and it is the only form in which the graph can carry
- * that distinction without inventing an evidence model.
- */
+/** Producers that corroborated a merged item, sorted/deduped. DEC-012 records this instead of combining confidence. */
 export function corroborators(existing, ...producers) {
     const prior = existing?.["corroboratedBy"];
     const all = new Set(Array.isArray(prior) ? prior : []);
@@ -95,36 +43,38 @@ export function mergeEdge(incoming, existing) {
         attrs: { ...(winner.attrs ?? {}), corroboratedBy },
     };
 }
-/**
- * Merge two nodes that share an id.
- *
- * Attributes are NOT unioned. `attrs` is language- and framework-specific detail
- * (§11A.4), so pooling two adapters' attributes would produce a node describing
- * a thing that does not exist. The winner's attrs are kept whole and the loser is
- * recorded as a corroborator.
- */
+/** Bookkeeping keys `mergeNode` itself writes — never unioned/disputed as ordinary data, always recomputed. */
+const MERGE_BOOKKEEPING_KEYS = new Set(["corroboratedBy", "disputedAttrs"]);
+/** Merge two nodes sharing an id. Unions non-conflicting attrs; on conflict keeps the winner's value and records the key in `attrs.disputedAttrs`. Supersedes DEC-012's all-or-nothing rule. */
 export function mergeNode(incoming, existing) {
     const winner = preferIncoming({ ...incoming, confidence: 0 }, { ...existing, confidence: 0 })
         ? incoming
         : existing;
+    const loser = winner === incoming ? existing : incoming;
+    const winnerAttrs = winner.attrs ?? {};
+    const loserAttrs = loser.attrs ?? {};
+    const merged = { ...winnerAttrs };
+    const disputed = new Set(Array.isArray(winnerAttrs["disputedAttrs"]) ? winnerAttrs["disputedAttrs"] : []);
+    for (const key of Object.keys(loserAttrs)) {
+        if (MERGE_BOOKKEEPING_KEYS.has(key))
+            continue;
+        if (!(key in winnerAttrs)) {
+            merged[key] = loserAttrs[key];
+        }
+        else if (JSON.stringify(winnerAttrs[key]) !== JSON.stringify(loserAttrs[key])) {
+            disputed.add(key);
+        }
+    }
     return {
         ...winner,
         attrs: {
-            ...winner.attrs,
+            ...merged,
             corroboratedBy: corroborators(existing.attrs, existing.producedBy, incoming.producedBy),
+            ...(disputed.size > 0 ? { disputedAttrs: [...disputed].sort() } : {}),
         },
     };
 }
-/**
- * The fields two nodes sharing an id must agree on.
- *
- * Compared as one opaque string rather than field by field. That is not only
- * tidier: `n.language !== m.language` reads to the boundary lint as branching on
- * a language, and the lint is right to be suspicious — the exception here is
- * that this asks whether two nodes *disagree*, never which language either one
- * is. Folding both fields into a fingerprint states that intent in the code
- * rather than in a lint suppression.
- */
+/** Fields two nodes sharing an id must agree on. Compared as one opaque string — field-by-field would read as branching on language to the boundary lint. */
 export function identityFingerprint(node) {
     return JSON.stringify([node.type, node.language]);
 }

package/dist/graph/merge.js.map

@@ -1 +1 @@
-{"version":3,"file":"merge.js","sourceRoot":"","sources":["../../src/graph/merge.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AAWH;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,QAAmB,EAAE,QAAmB;IACrE,IAAI,QAAQ,CAAC,UAAU,KAAK,QAAQ,CAAC,UAAU,EAAE,CAAC;QAChD,OAAO,QAAQ,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;IACnD,CAAC;IACD,IAAI,QAAQ,CAAC,UAAU,KAAK,QAAQ,CAAC,UAAU,EAAE,CAAC;QAChD,OAAO,QAAQ,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;IACnD,CAAC;IACD,OAAO,QAAQ,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;AACnD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG;;;;;;CAMnC,CAAC;AAEF,mFAAmF;AACnF,MAAM,CAAC,MAAM,oBAAoB,GAAG;;;CAGnC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,UAAU,aAAa,CAC3B,QAAuD,EACvD,GAAG,SAAmB;IAEtB,MAAM,KAAK,GAAG,QAAQ,EAAE,CAAC,gBAAgB,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAE,KAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7E,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACzB,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,SAAS,CAAC,QAAgB,EAAE,QAAgB;IAC1D,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;IACxE,MAAM,cAAc,GAAG,aAAa,CAClC,EAAE,GAAG,QAAQ,CAAC,KAAK,EAAE,GAAG,QAAQ,CAAC,KAAK,EAAE,EACxC,QAAQ,CAAC,UAAU,EACnB,QAAQ,CAAC,UAAU,CACpB,CAAC;IACF,OAAO;QACL,GAAG,MAAM;QACT,KAAK,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,cAAc,EAAE;KACnD,CAAC;AACJ,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,QAAgB,EAAE,QAAgB;IAC1D,MAAM,MAAM,GAAG,cAAc,CAC3B,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,CAAC,EAAE,EAC9B,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,CAAC,EAAE,CAC/B;QACC,CAAC,CAAC,QAAQ;QACV,CAAC,CAAC,QAAQ,CAAC;IACb,OAAO;QACL,GAAG,MAAM;QACT,KAAK,EAAE;YACL,GAAG,MAAM,CAAC,KAAK;YACf,cAAc,EAAE,aAAa,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,UAAU,CAAC;SACxF;KACF,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;AACpD,CAAC"}
+{"version":3,"file":"merge.js","sourceRoot":"","sources":["../../src/graph/merge.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAWH,4GAA4G;AAC5G,MAAM,UAAU,cAAc,CAAC,QAAmB,EAAE,QAAmB;IACrE,IAAI,QAAQ,CAAC,UAAU,KAAK,QAAQ,CAAC,UAAU,EAAE,CAAC;QAChD,OAAO,QAAQ,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;IACnD,CAAC;IACD,IAAI,QAAQ,CAAC,UAAU,KAAK,QAAQ,CAAC,UAAU,EAAE,CAAC;QAChD,OAAO,QAAQ,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;IACnD,CAAC;IACD,OAAO,QAAQ,CAAC,UAAU,GAAG,QAAQ,CAAC,UAAU,CAAC;AACnD,CAAC;AAED,yHAAyH;AACzH,MAAM,CAAC,MAAM,oBAAoB,GAAG;;;;;;CAMnC,CAAC;AAEF,mFAAmF;AACnF,MAAM,CAAC,MAAM,oBAAoB,GAAG;;;CAGnC,CAAC;AAEF,uHAAuH;AACvH,MAAM,UAAU,aAAa,CAC3B,QAAuD,EACvD,GAAG,SAAmB;IAEtB,MAAM,KAAK,GAAG,QAAQ,EAAE,CAAC,gBAAgB,CAAC,CAAC;IAC3C,MAAM,GAAG,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAE,KAAkB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7E,KAAK,MAAM,CAAC,IAAI,SAAS;QAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;AACzB,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,SAAS,CAAC,QAAgB,EAAE,QAAgB;IAC1D,MAAM,MAAM,GAAG,cAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;IACxE,MAAM,cAAc,GAAG,aAAa,CAClC,EAAE,GAAG,QAAQ,CAAC,KAAK,EAAE,GAAG,QAAQ,CAAC,KAAK,EAAE,EACxC,QAAQ,CAAC,UAAU,EACnB,QAAQ,CAAC,UAAU,CACpB,CAAC;IACF,OAAO;QACL,GAAG,MAAM;QACT,KAAK,EAAE,EAAE,GAAG,CAAC,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,cAAc,EAAE;KACnD,CAAC;AACJ,CAAC;AAED,+GAA+G;AAC/G,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAC,CAAC,gBAAgB,EAAE,eAAe,CAAC,CAAC,CAAC;AAE5E,gMAAgM;AAChM,MAAM,UAAU,SAAS,CAAC,QAAgB,EAAE,QAAgB;IAC1D,MAAM,MAAM,GAAG,cAAc,CAC3B,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,CAAC,EAAE,EAC9B,EAAE,GAAG,QAAQ,EAAE,UAAU,EAAE,CAAC,EAAE,CAC/B;QACC,CAAC,CAAC,QAAQ;QACV,CAAC,CAAC,QAAQ,CAAC;IACb,MAAM,KAAK,GAAG,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC;IAExD,MAAM,WAAW,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;IACvC,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;IAErC,MAAM,MAAM,GAA4B,EAAE,GAAG,WAAW,EAAE,CAAC;IAC3D,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAE,WAAW,CAAC,eAAe,CAAc,CAAC,CAAC,CAAC,EAAE,CAC9F,CAAC;IAEF,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;QAC1C,IAAI,sBAAsB,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QAC9C,IAAI,CAAC,CAAC,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC;QAChC,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAChF,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,OAAO;QACL,GAAG,MAAM;QACT,KAAK,EAAE;YACL,GAAG,MAAM;YACT,cAAc,EAAE,aAAa,CAAC,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC,UAAU,CAAC;YACvF,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtE;KACF,CAAC;AACJ,CAAC;AAED,6JAA6J;AAC7J,MAAM,UAAU,mBAAmB,CAAC,IAAY;IAC9C,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;AACpD,CAAC"}

package/dist/graph/observed-tests.d.ts

@@ -1,55 +1,7 @@
 /**
- * `observed_tests` — the EARNED record of which tests actually ran.
- *
- * This is the coverage axis, and coverage is deliberately not confidence: AI
- * layer §20 separates *"what I actually verified"* from *"how sure am I"*, and
- * the five report categories say nothing about the first. This module is the
- * carrier for that separation, ruled in
- * `documents/decisions-inbox/DEC-NEXT-test-run-coverage-has-no-carrier.md`.
- *
- * ## Why this is a table and not an R4 edge promotion
- *
- * The obvious-looking design is to run the suite and promote each `TESTS` edge
- * it exercised to R4, reusing {@link applyRuntimeObservations}. That is not
- * available, and the reason is the same one `observe-runtime.ts`'s header
- * already gives for refusing to derive edges from correlated evidence.
- *
- * An edge needs **two endpoints and a witnessed relationship between them**. A
- * test-runner's evidence carries no stack — every item it emits has
- * `stackTrace: null` — so an observed test names exactly one node, its own
- * `TEST_CASE`. Nothing in the run witnesses which function that test reached.
- * Pairing the test with a function that merely co-occurred in the same run
- * would mint an edge from temporal coincidence, which is precisely the
- * wrong-direction failure rule 2 exists to prevent, arriving through the one
- * mechanism built to make the graph *more* trustworthy.
- *
- * So the honest fact a test run establishes is a fact about **one node**: this
- * test case executed, and this is what happened. That is not an edge and R4 in
- * this store is a property of an edge, so it needs a carrier of its own.
- *
- * ## Why EARNED
- *
- * Same argument as `observed_edges`, one step over. Nothing in the source says
- * which tests ran — the source says which tests *exist*. A rebuild that dropped
- * this table would silently turn "what I actually verified" back into "what
- * might be affected", which is the exact collapse the coverage axis exists to
- * prevent.
- *
- * ## What this module refuses to do
- *
- * - **Invent a node.** An observation naming a node this graph does not hold is
- *   refused with its reason, never created — rule 2, and the same posture
- *   {@link applyRuntimeObservations} takes for an edge endpoint.
- * - **Accept a category error.** A test outcome against a node that is not a
- *   `TEST_CASE` is refused rather than written. The graph holds the id, so this
- *   is not a missing-node refusal; it is a claim that would make every later
- *   coverage read meaningless, and it is far more likely to be a resolver bug
- *   than a real observation.
- * - **Judge anything.** No finding, no hypothesis, no report category. It
- *   records what ran; whether that is *enough* is a judgement for a layer above
- *   this one.
- *
- * @see `packages/core/src/graph/runtime-confirmation.ts` — the edge half.
+ * `observed_tests` — EARNED record of which tests ran (coverage axis, separate from confidence per AI layer §20; DEC-NEXT-test-run-coverage-has-no-carrier).
+ * Not an R4 edge promotion: a runner's evidence has no stack trace, so it witnesses only its own TEST_CASE node, never which function it reached — pairing on co-occurrence would mint an edge from coincidence (rule 2).
+ * EARNED because source says which tests exist, never which ran. Refuses to invent a node, accept a non-TEST_CASE target, or judge anything.
  */
 import type { SqlDriver } from "../store/driver/driver.ts";
 /** What a runner reported for one test. `skipped` covers `.skip` and `.todo` alike. */
@@ -57,14 +9,8 @@ export type ObservedTestOutcome = "passed" | "failed" | "skipped";
 export interface ObservedTestObservation {
     /** The `TEST_CASE` node this test resolved to. Resolution happens above this module. */
     readonly nodeId: string;
-    /**
-     * The runner's own suite-prefixed name, kept verbatim.
-     *
-     * Stored even though `nodeId` already identifies the test, because the two
-     * can disagree later: the node id survives a rename, the recorded name is
-     * what the run actually printed, and a reader comparing them is how a
-     * mis-resolution becomes visible instead of silently plausible.
-     */
+    /** Runner's own suite-prefixed name, kept verbatim. Stored alongside nodeId
+     *  so a later mismatch (rename vs. printed name) becomes visible. */
     readonly qualifiedName: string;
     readonly outcome: ObservedTestOutcome;
     /** Null when the runner did not report one — never defaulted to zero, which would read as "instant". */
@@ -101,15 +47,8 @@ export interface ObservedTestRow {
 export interface Clock {
     now(): number;
 }
-/**
- * Record a run's test observations.
- *
- * Total over its input: every observation lands in exactly one of
- * {@link ObservedTestsResult.recorded} or {@link ObservedTestsResult.refused},
- * so a caller can account for all of them without inspecting the store. Never
- * throws for an observation it cannot act on — that is a refusal, per the
- * five-result-states rule the tool contract applies one layer up.
- */
+/** Record a run's test observations. Total over its input: every observation
+ *  lands in `recorded` or `refused`. Never throws — a refusal instead. */
 export declare function applyObservedTests(driver: SqlDriver, input: ObservedTestsInput, clock?: Clock): ObservedTestsResult;
 /** Read the EARNED ledger, newest observation first, optionally for one run. */
 export declare function observedTests(driver: SqlDriver, options?: {

package/dist/graph/observed-tests.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"observed-tests.d.ts","sourceRoot":"","sources":["../../src/graph/observed-tests.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoDG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAE3D,uFAAuF;AACvF,MAAM,MAAM,mBAAmB,GAAG,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAC;AAElE,MAAM,WAAW,uBAAuB;IACtC,wFAAwF;IACxF,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;;;;;;;OAOG;IACH,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,wGAAwG;IACxG,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CACpC;AAED,MAAM,WAAW,kBAAkB;IACjC,uFAAuF;IACvF,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,0HAA0H;IAC1H,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,YAAY,EAAE,SAAS,uBAAuB,EAAE,CAAC;CAC3D;AAED,oFAAoF;AACpF,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,mBAAmB;IAClC,wBAAwB;IACxB,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,OAAO,EAAE,SAAS,mBAAmB,EAAE,CAAC;CAClD;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,gGAAgG;AAChG,MAAM,WAAW,KAAK;IACpB,GAAG,IAAI,MAAM,CAAC;CACf;AAaD;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,kBAAkB,EACzB,KAAK,GAAE,KAAoB,GAC1B,mBAAmB,CAqDrB;AAED,gFAAgF;AAChF,wBAAgB,aAAa,CAC3B,MAAM,EAAE,SAAS,EACjB,OAAO,GAAE;IAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAO,GACxC,SAAS,eAAe,EAAE,CA0B5B"}
+{"version":3,"file":"observed-tests.d.ts","sourceRoot":"","sources":["../../src/graph/observed-tests.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAE3D,uFAAuF;AACvF,MAAM,MAAM,mBAAmB,GAAG,QAAQ,GAAG,QAAQ,GAAG,SAAS,CAAC;AAElE,MAAM,WAAW,uBAAuB;IACtC,wFAAwF;IACxF,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB;yEACqE;IACrE,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,wGAAwG;IACxG,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;CACpC;AAED,MAAM,WAAW,kBAAkB;IACjC,uFAAuF;IACvF,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,0HAA0H;IAC1H,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,YAAY,EAAE,SAAS,uBAAuB,EAAE,CAAC;CAC3D;AAED,oFAAoF;AACpF,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,mBAAmB;IAClC,wBAAwB;IACxB,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,OAAO,EAAE,SAAS,mBAAmB,EAAE,CAAC;CAClD;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,OAAO,EAAE,mBAAmB,CAAC;IACtC,QAAQ,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC7B;AAED,gGAAgG;AAChG,MAAM,WAAW,KAAK;IACpB,GAAG,IAAI,MAAM,CAAC;CACf;AAaD;0EAC0E;AAC1E,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,SAAS,EACjB,KAAK,EAAE,kBAAkB,EACzB,KAAK,GAAE,KAAoB,GAC1B,mBAAmB,CAqDrB;AAED,gFAAgF;AAChF,wBAAgB,aAAa,CAC3B,MAAM,EAAE,SAAS,EACjB,OAAO,GAAE;IAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAA;CAAO,GACxC,SAAS,eAAe,EAAE,CA0B5B"}

package/dist/graph/observed-tests.js

@@ -1,70 +1,15 @@
 /**
- * `observed_tests` — the EARNED record of which tests actually ran.
- *
- * This is the coverage axis, and coverage is deliberately not confidence: AI
- * layer §20 separates *"what I actually verified"* from *"how sure am I"*, and
- * the five report categories say nothing about the first. This module is the
- * carrier for that separation, ruled in
- * `documents/decisions-inbox/DEC-NEXT-test-run-coverage-has-no-carrier.md`.
- *
- * ## Why this is a table and not an R4 edge promotion
- *
- * The obvious-looking design is to run the suite and promote each `TESTS` edge
- * it exercised to R4, reusing {@link applyRuntimeObservations}. That is not
- * available, and the reason is the same one `observe-runtime.ts`'s header
- * already gives for refusing to derive edges from correlated evidence.
- *
- * An edge needs **two endpoints and a witnessed relationship between them**. A
- * test-runner's evidence carries no stack — every item it emits has
- * `stackTrace: null` — so an observed test names exactly one node, its own
- * `TEST_CASE`. Nothing in the run witnesses which function that test reached.
- * Pairing the test with a function that merely co-occurred in the same run
- * would mint an edge from temporal coincidence, which is precisely the
- * wrong-direction failure rule 2 exists to prevent, arriving through the one
- * mechanism built to make the graph *more* trustworthy.
- *
- * So the honest fact a test run establishes is a fact about **one node**: this
- * test case executed, and this is what happened. That is not an edge and R4 in
- * this store is a property of an edge, so it needs a carrier of its own.
- *
- * ## Why EARNED
- *
- * Same argument as `observed_edges`, one step over. Nothing in the source says
- * which tests ran — the source says which tests *exist*. A rebuild that dropped
- * this table would silently turn "what I actually verified" back into "what
- * might be affected", which is the exact collapse the coverage axis exists to
- * prevent.
- *
- * ## What this module refuses to do
- *
- * - **Invent a node.** An observation naming a node this graph does not hold is
- *   refused with its reason, never created — rule 2, and the same posture
- *   {@link applyRuntimeObservations} takes for an edge endpoint.
- * - **Accept a category error.** A test outcome against a node that is not a
- *   `TEST_CASE` is refused rather than written. The graph holds the id, so this
- *   is not a missing-node refusal; it is a claim that would make every later
- *   coverage read meaningless, and it is far more likely to be a resolver bug
- *   than a real observation.
- * - **Judge anything.** No finding, no hypothesis, no report category. It
- *   records what ran; whether that is *enough* is a judgement for a layer above
- *   this one.
- *
- * @see `packages/core/src/graph/runtime-confirmation.ts` — the edge half.
+ * `observed_tests` — EARNED record of which tests ran (coverage axis, separate from confidence per AI layer §20; DEC-NEXT-test-run-coverage-has-no-carrier).
+ * Not an R4 edge promotion: a runner's evidence has no stack trace, so it witnesses only its own TEST_CASE node, never which function it reached — pairing on co-occurrence would mint an edge from coincidence (rule 2).
+ * EARNED because source says which tests exist, never which ran. Refuses to invent a node, accept a non-TEST_CASE target, or judge anything.
  */
 const SYSTEM_CLOCK = { now: () => Date.now() };
 function nodeTypeOf(driver, id) {
     const row = driver.prepare("SELECT type FROM nodes WHERE id = ?").get(id);
     return row?.type;
 }
-/**
- * Record a run's test observations.
- *
- * Total over its input: every observation lands in exactly one of
- * {@link ObservedTestsResult.recorded} or {@link ObservedTestsResult.refused},
- * so a caller can account for all of them without inspecting the store. Never
- * throws for an observation it cannot act on — that is a refusal, per the
- * five-result-states rule the tool contract applies one layer up.
- */
+/** Record a run's test observations. Total over its input: every observation
+ *  lands in `recorded` or `refused`. Never throws — a refusal instead. */
 export function applyObservedTests(driver, input, clock = SYSTEM_CLOCK) {
     const recorded = [];
     const refused = [];

package/dist/graph/observed-tests.js.map

@@ -1 +1 @@
-{"version":3,"file":"observed-tests.js","sourceRoot":"","sources":["../../src/graph/observed-tests.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoDG;AA4DH,MAAM,YAAY,GAAU,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;AAMtD,SAAS,UAAU,CAAC,MAAiB,EAAE,EAAU;IAC/C,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,CAAC,EAAE,CAA4B,CAAC;IACrG,OAAO,GAAG,EAAE,IAAI,CAAC;AACnB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAiB,EACjB,KAAyB,EACzB,QAAe,YAAY;IAE3B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;IAExB,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE;QACtB,KAAK,MAAM,WAAW,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;YAEpD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC;oBACX,MAAM,EAAE,WAAW,CAAC,MAAM;oBAC1B,aAAa,EAAE,WAAW,CAAC,aAAa;oBACxC,MAAM,EACJ,GAAG,WAAW,CAAC,MAAM,6EAA6E;wBAClG,gDAAgD;iBACnD,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,IAAI,IAAI,KAAK,WAAW,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC;oBACX,MAAM,EAAE,WAAW,CAAC,MAAM;oBAC1B,aAAa,EAAE,WAAW,CAAC,aAAa;oBACxC,MAAM,EACJ,GAAG,WAAW,CAAC,MAAM,SAAS,IAAI,+DAA+D;wBACjG,0EAA0E;iBAC7E,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,MAAM;iBACH,OAAO,CACN,6GAA6G;gBAC3G,+BAA+B;gBAC/B,uFAAuF;gBACvF,qGAAqG,CACxG;iBACA,GAAG,CACF,WAAW,CAAC,MAAM,EAClB,KAAK,CAAC,KAAK,EACX,WAAW,CAAC,aAAa,EACzB,WAAW,CAAC,OAAO,EACnB,WAAW,CAAC,UAAU,EACtB,KAAK,CAAC,SAAS,EACf,GAAG,CACJ,CAAC;YAEJ,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;AAC/B,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,aAAa,CAC3B,MAAiB,EACjB,UAAuC,EAAE;IAEzC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC;IACrE,MAAM,GAAG,GACP,uFAAuF;QACvF,uBAAuB,KAAK,yCAAyC,CAAC;IACxE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAChE,OAAO,MAAM;SACV,OAAO,CAQL,GAAG,CAAC;SACN,GAAG,CAAC,GAAG,IAAI,CAAC;SACZ,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACb,MAAM,EAAE,GAAG,CAAC,OAAO;QACnB,KAAK,EAAE,GAAG,CAAC,MAAM;QACjB,aAAa,EAAE,GAAG,CAAC,cAAc;QACjC,OAAO,EAAE,GAAG,CAAC,OAA8B;QAC3C,UAAU,EAAE,GAAG,CAAC,WAAW;QAC3B,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,UAAU,EAAE,GAAG,CAAC,WAAW;KAC5B,CAAC,CAAC,CAAC;AACR,CAAC"}
+{"version":3,"file":"observed-tests.js","sourceRoot":"","sources":["../../src/graph/observed-tests.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAsDH,MAAM,YAAY,GAAU,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;AAMtD,SAAS,UAAU,CAAC,MAAiB,EAAE,EAAU;IAC/C,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,CAAC,EAAE,CAA4B,CAAC;IACrG,OAAO,GAAG,EAAE,IAAI,CAAC;AACnB,CAAC;AAED;0EAC0E;AAC1E,MAAM,UAAU,kBAAkB,CAChC,MAAiB,EACjB,KAAyB,EACzB,QAAe,YAAY;IAE3B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;IAExB,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE;QACtB,KAAK,MAAM,WAAW,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;YAEpD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC;oBACX,MAAM,EAAE,WAAW,CAAC,MAAM;oBAC1B,aAAa,EAAE,WAAW,CAAC,aAAa;oBACxC,MAAM,EACJ,GAAG,WAAW,CAAC,MAAM,6EAA6E;wBAClG,gDAAgD;iBACnD,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,IAAI,IAAI,KAAK,WAAW,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC;oBACX,MAAM,EAAE,WAAW,CAAC,MAAM;oBAC1B,aAAa,EAAE,WAAW,CAAC,aAAa;oBACxC,MAAM,EACJ,GAAG,WAAW,CAAC,MAAM,SAAS,IAAI,+DAA+D;wBACjG,0EAA0E;iBAC7E,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,MAAM;iBACH,OAAO,CACN,6GAA6G;gBAC3G,+BAA+B;gBAC/B,uFAAuF;gBACvF,qGAAqG,CACxG;iBACA,GAAG,CACF,WAAW,CAAC,MAAM,EAClB,KAAK,CAAC,KAAK,EACX,WAAW,CAAC,aAAa,EACzB,WAAW,CAAC,OAAO,EACnB,WAAW,CAAC,UAAU,EACtB,KAAK,CAAC,SAAS,EACf,GAAG,CACJ,CAAC;YAEJ,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;AAC/B,CAAC;AAED,gFAAgF;AAChF,MAAM,UAAU,aAAa,CAC3B,MAAiB,EACjB,UAAuC,EAAE;IAEzC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,mBAAmB,CAAC;IACrE,MAAM,GAAG,GACP,uFAAuF;QACvF,uBAAuB,KAAK,yCAAyC,CAAC;IACxE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAChE,OAAO,MAAM;SACV,OAAO,CAQL,GAAG,CAAC;SACN,GAAG,CAAC,GAAG,IAAI,CAAC;SACZ,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACb,MAAM,EAAE,GAAG,CAAC,OAAO;QACnB,KAAK,EAAE,GAAG,CAAC,MAAM;QACjB,aAAa,EAAE,GAAG,CAAC,cAAc;QACjC,OAAO,EAAE,GAAG,CAAC,OAA8B;QAC3C,UAAU,EAAE,GAAG,CAAC,WAAW;QAC3B,SAAS,EAAE,GAAG,CAAC,UAAU;QACzB,UAAU,EAAE,GAAG,CAAC,WAAW;KAC5B,CAAC,CAAC,CAAC;AACR,CAAC"}

package/dist/graph/persist.d.ts

@@ -1,29 +1,6 @@
 /**
- * Writing a built graph back out, split by producer.
- *
- * `buildGraph` merges many producers into one graph; `writeBatch` invalidates
- * and writes **one producer's** rows at a time, because DEC-014's invalidation
- * rule is per-adapter — re-running the Python adapter must not evict the
- * TypeScript adapter's rows. So the merged graph has to be partitioned back
- * before it can be stored.
- *
- * That partition was written out by hand in every bench script that has ever
- * stored a graph, identically, five times. It is not a measurement concern: it
- * is the engine's own write path, and the MCP server needs it too. Lifted here
- * so there is one copy and one place for it to be wrong.
- *
- * ## The subtlety worth stating
- *
- * The rows written for a producer are the **post-merge** ones, not the batch's
- * originals. A node supplied by two adapters is merged (DEC-012) and the merged
- * row carries the winning `producedBy`; writing the pre-merge originals would
- * store the losing version under the loser's producer and then let the next
- * incremental run resurrect it. Filtering the merged graph by `producedBy` is
- * what makes the store agree with the builder.
- *
- * A batch that contributed nothing after the merge is still written, with empty
- * rows, on purpose: that is how a re-run that *removes* a symbol evicts the row
- * it used to own. Skipping empty batches would make deletions invisible.
+ * Writing a built graph back out, split by producer. `writeBatch` invalidates per-producer (DEC-014): re-running one adapter must not evict another's rows, so the merged graph is partitioned back before storing.
+ * Rows written are post-merge (DEC-012's winning `producedBy`), never pre-merge originals, or the loser gets resurrected next incremental run. An empty-after-merge batch is still written (empty rows) so a removed symbol's row gets evicted, not left invisible.
  */
 import type { IRBatch } from "@descryy/ir";
 import type { SqlDriver } from "../store/driver/driver.ts";

package/dist/graph/persist.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"persist.d.ts","sourceRoot":"","sources":["../../src/graph/persist.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAE3C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAc,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACrF,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;IACxC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,4FAA4F;IAC5F,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED,wBAAgB,YAAY,CAC1B,MAAM,EAAE,SAAS,EACjB,OAAO,EAAE,SAAS,OAAO,EAAE,EAC3B,KAAK,EAAE,WAAW,EAClB,OAAO,GAAE,YAAiB,GACzB,aAAa,CA6Bf"}
+{"version":3,"file":"persist.d.ts","sourceRoot":"","sources":["../../src/graph/persist.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAE3C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAc,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,MAAM,oBAAoB,CAAC;AACrF,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,MAAM,EAAE,SAAS,WAAW,EAAE,CAAC;IACxC,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAC;IACnC,4FAA4F;IAC5F,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAChC;AAED,wBAAgB,YAAY,CAC1B,MAAM,EAAE,SAAS,EACjB,OAAO,EAAE,SAAS,OAAO,EAAE,EAC3B,KAAK,EAAE,WAAW,EAClB,OAAO,GAAE,YAAiB,GACzB,aAAa,CA6Bf"}

package/dist/graph/persist.js

@@ -1,29 +1,6 @@
 /**
- * Writing a built graph back out, split by producer.
- *
- * `buildGraph` merges many producers into one graph; `writeBatch` invalidates
- * and writes **one producer's** rows at a time, because DEC-014's invalidation
- * rule is per-adapter — re-running the Python adapter must not evict the
- * TypeScript adapter's rows. So the merged graph has to be partitioned back
- * before it can be stored.
- *
- * That partition was written out by hand in every bench script that has ever
- * stored a graph, identically, five times. It is not a measurement concern: it
- * is the engine's own write path, and the MCP server needs it too. Lifted here
- * so there is one copy and one place for it to be wrong.
- *
- * ## The subtlety worth stating
- *
- * The rows written for a producer are the **post-merge** ones, not the batch's
- * originals. A node supplied by two adapters is merged (DEC-012) and the merged
- * row carries the winning `producedBy`; writing the pre-merge originals would
- * store the losing version under the loser's producer and then let the next
- * incremental run resurrect it. Filtering the merged graph by `producedBy` is
- * what makes the store agree with the builder.
- *
- * A batch that contributed nothing after the merge is still written, with empty
- * rows, on purpose: that is how a re-run that *removes* a symbol evicts the row
- * it used to own. Skipping empty batches would make deletions invisible.
+ * Writing a built graph back out, split by producer. `writeBatch` invalidates per-producer (DEC-014): re-running one adapter must not evict another's rows, so the merged graph is partitioned back before storing.
+ * Rows written are post-merge (DEC-012's winning `producedBy`), never pre-merge originals, or the loser gets resurrected next incremental run. An empty-after-merge batch is still written (empty rows) so a removed symbol's row gets evicted, not left invisible.
  */
 import { writeBatch } from "../store/writer.js";
 export function persistGraph(driver, batches, built, options = {}) {

package/dist/graph/persist.js.map

@@ -1 +1 @@
-{"version":3,"file":"persist.js","sourceRoot":"","sources":["../../src/graph/persist.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AAKH,OAAO,EAAE,UAAU,EAAuC,MAAM,oBAAoB,CAAC;AAarF,MAAM,UAAU,YAAY,CAC1B,MAAiB,EACjB,OAA2B,EAC3B,KAAkB,EAClB,UAAwB,EAAE;IAE1B,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,CAAC,IAAI,CACT,UAAU,CACR,MAAM,EACN;YACE,GAAG,KAAK;YACR,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,CAAC;YACzE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,CAAC;YACzE,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,CAAC;SAClF,EACD,OAAO,CACR,CACF,CAAC;IACJ,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,MAAM;QAAE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAErF,OAAO;QACL,MAAM;QACN,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;QAC5D,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;QAC5D,iBAAiB,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC;QACtE,YAAY,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE;QACjC,aAAa,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;KAC/D,CAAC;AACJ,CAAC"}
+{"version":3,"file":"persist.js","sourceRoot":"","sources":["../../src/graph/persist.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAE,UAAU,EAAuC,MAAM,oBAAoB,CAAC;AAarF,MAAM,UAAU,YAAY,CAC1B,MAAiB,EACjB,OAA2B,EAC3B,KAAkB,EAClB,UAAwB,EAAE;IAE1B,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,CAAC,IAAI,CACT,UAAU,CACR,MAAM,EACN;YACE,GAAG,KAAK;YACR,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,CAAC;YACzE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,CAAC;YACzE,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,KAAK,KAAK,CAAC,UAAU,CAAC;SAClF,EACD,OAAO,CACR,CACF,CAAC;IACJ,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,MAAM;QAAE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAErF,OAAO;QACL,MAAM;QACN,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;QAC5D,YAAY,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,YAAY,EAAE,CAAC,CAAC;QAC5D,iBAAiB,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC;QACtE,YAAY,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE;QACjC,aAAa,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC;KAC/D,CAAC;AACJ,CAAC"}