@nicia-ai/typegraph 0.32.0 → 0.34.0

package/dist/graph-merge/index.cjs

@@ -1,29 +1,49 @@
 'use strict';
 
-var chunk2LAT5BIK_cjs = require('../chunk-2LAT5BIK.cjs');
+var chunk3BRVBQQD_cjs = require('../chunk-3BRVBQQD.cjs');
 require('../chunk-HTGDWIDE.cjs');
-var chunkSB65GJNY_cjs = require('../chunk-SB65GJNY.cjs');
-var chunkLAZGHOZW_cjs = require('../chunk-LAZGHOZW.cjs');
-var chunkEEYV6UOE_cjs = require('../chunk-EEYV6UOE.cjs');
-require('../chunk-3QRBXYT5.cjs');
-require('../chunk-6RMLO5O4.cjs');
-require('../chunk-YQGLVWB2.cjs');
-require('../chunk-ZFWNO3GE.cjs');
-var chunkKTIEB7VH_cjs = require('../chunk-KTIEB7VH.cjs');
-require('../chunk-6G35I3VW.cjs');
-var chunkRP7YITHX_cjs = require('../chunk-RP7YITHX.cjs');
-require('../chunk-CFNT3ITG.cjs');
-var chunk73KASJGO_cjs = require('../chunk-73KASJGO.cjs');
+require('../chunk-JJRCLAUN.cjs');
+var chunkKNHYNQQ3_cjs = require('../chunk-KNHYNQQ3.cjs');
+require('../chunk-N6WTUSBV.cjs');
+var chunk6HVOHZHS_cjs = require('../chunk-6HVOHZHS.cjs');
+var chunkACSVZPK7_cjs = require('../chunk-ACSVZPK7.cjs');
+var chunkT6SPUYLX_cjs = require('../chunk-T6SPUYLX.cjs');
+require('../chunk-TGJE22RM.cjs');
+require('../chunk-2JXB3NYJ.cjs');
+require('../chunk-RRKQAKD6.cjs');
+var chunkZY4GXIVN_cjs = require('../chunk-ZY4GXIVN.cjs');
+require('../chunk-WL2SG7ZV.cjs');
+var chunkHK5SATYM_cjs = require('../chunk-HK5SATYM.cjs');
+var chunkZ5HBYM7U_cjs = require('../chunk-Z5HBYM7U.cjs');
+var chunk5IQIX7LU_cjs = require('../chunk-5IQIX7LU.cjs');
+require('../chunk-UNNPKQUG.cjs');
+require('../chunk-YC6PWTHY.cjs');
+require('../chunk-RHZWOJVA.cjs');
+require('../chunk-YAZE7QZR.cjs');
+require('../chunk-NAUA4PW5.cjs');
+require('../chunk-JQGIPGVL.cjs');
+require('../chunk-3E7SNSIA.cjs');
+require('../chunk-DI74SMXS.cjs');
 var chunkJIEJCTDS_cjs = require('../chunk-JIEJCTDS.cjs');
 require('../chunk-FLRCVI2G.cjs');
 var zod = require('zod');
 
 // src/graph-merge/canonical-props.ts
 function canonicalizeProps(props) {
-  return JSON.stringify(props, chunkRP7YITHX_cjs.sortedReplacer);
+  return JSON.stringify(props, chunkACSVZPK7_cjs.sortedReplacer);
 }
 function canonicalValueKey(value) {
-  return JSON.stringify(value, chunkRP7YITHX_cjs.sortedReplacer);
+  return JSON.stringify(value, chunkACSVZPK7_cjs.sortedReplacer);
+}
+function edgeStateSignature(edge) {
+  return JSON.stringify([
+    edge.fromKind,
+    edge.fromId,
+    edge.toKind,
+    edge.toId,
+    edge.live,
+    canonicalizeProps(edge.props)
+  ]);
 }
 function parseRowProps(props) {
   let parsed;
@@ -48,9 +68,6 @@ function mergeKey(kind, id) {
   }
   return `${kind}${SEPARATOR}${id}`;
 }
-function compareStrings(left, right) {
-  return left < right ? -1 : left > right ? 1 : 0;
-}
 function mergeKeyOf(node) {
   return mergeKey(node.kind, node.id);
 }
@@ -224,15 +241,16 @@ function diffEdgeKind(kind, baseRows, forkRows) {
   return { new: created, modified, deleted };
 }
 function byId(left, right) {
-  return compareStrings(left.id, right.id);
+  return chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id);
 }
-async function diffAgainstBase(baseStore, forkStore) {
+async function diffAgainstBase(baseStore, forkStore, captureForkState = true) {
   const graph = baseStore.graph;
-  const nodeKinds = chunkEEYV6UOE_cjs.getNodeKinds(graph);
-  const edgeKinds = chunkEEYV6UOE_cjs.getEdgeKinds(graph);
+  const nodeKinds = chunkT6SPUYLX_cjs.getNodeKinds(graph);
+  const edgeKinds = chunkT6SPUYLX_cjs.getEdgeKinds(graph);
   const newNodes = [];
   const modifiedNodes = [];
   const deletedNodes = [];
+  const forkNodeVersions = /* @__PURE__ */ new Map();
   for (const kind of nodeKinds) {
     const baseRows = await enumerateAllNodes(
       baseStore.backend,
@@ -244,6 +262,11 @@ async function diffAgainstBase(baseStore, forkStore) {
       forkStore.graphId,
       kind
     );
+    if (captureForkState) {
+      for (const row of forkRows) {
+        forkNodeVersions.set(mergeKey(kind, row.id), row.version);
+      }
+    }
     const delta = diffNodeKind(kind, baseRows, forkRows);
     for (const entry of delta.new) {
       newNodes.push(entry);
@@ -258,6 +281,7 @@ async function diffAgainstBase(baseStore, forkStore) {
   const newEdges = [];
   const modifiedEdges = [];
   const deletedEdges = [];
+  const forkEdgeSignatures = /* @__PURE__ */ new Map();
   for (const kind of edgeKinds) {
     const baseRows = await enumerateAllEdges(
       baseStore.backend,
@@ -269,6 +293,21 @@ async function diffAgainstBase(baseStore, forkStore) {
       forkStore.graphId,
       kind
     );
+    if (captureForkState) {
+      for (const row of forkRows) {
+        forkEdgeSignatures.set(
+          mergeKey(kind, row.id),
+          edgeStateSignature({
+            fromKind: row.from_kind,
+            fromId: row.from_id,
+            toKind: row.to_kind,
+            toId: row.to_id,
+            live: isLive(row),
+            props: parseRowProps(row.props)
+          })
+        );
+      }
+    }
     const delta = diffEdgeKind(kind, baseRows, forkRows);
     for (const entry of delta.new) {
       newEdges.push(entry);
@@ -290,7 +329,9 @@ async function diffAgainstBase(baseStore, forkStore) {
       new: newEdges.sort((left, right) => byId(left, right)),
       modified: modifiedEdges.sort((left, right) => byId(left, right)),
       deleted: deletedEdges.sort((left, right) => byId(left, right))
-    }
+    },
+    forkNodeVersions,
+    forkEdgeSignatures
   };
 }
 
@@ -311,16 +352,16 @@ async function readActiveSchemaVersion(backend, graphId) {
 }
 async function computeSchemaComponent(store) {
   const version = await readActiveSchemaVersion(store.backend, store.graphId);
-  return chunkLAZGHOZW_cjs.computeSchemaHash(chunkLAZGHOZW_cjs.serializeSchema(store.graph, version));
+  return chunk6HVOHZHS_cjs.computeSchemaHash(chunk6HVOHZHS_cjs.serializeSchema(store.graph, version));
 }
 function byDigestEntry(left, right) {
-  const byKind = compareStrings(left.kind, right.kind);
-  return byKind === 0 ? compareStrings(left.id, right.id) : byKind;
+  const byKind = chunkZ5HBYM7U_cjs.compareStrings(left.kind, right.kind);
+  return byKind === 0 ? chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id) : byKind;
 }
 var CONTENT_FINGERPRINT_BYTES = 16;
 async function computeContentComponent(backend, graphId, graph) {
-  const nodeKinds = chunkEEYV6UOE_cjs.getNodeKinds(graph);
-  const edgeKinds = chunkEEYV6UOE_cjs.getEdgeKinds(graph);
+  const nodeKinds = chunkT6SPUYLX_cjs.getNodeKinds(graph);
+  const edgeKinds = chunkT6SPUYLX_cjs.getEdgeKinds(graph);
   const nodeDigest = [];
   for (const kind of nodeKinds) {
     const rows = await enumerateAllNodes(backend, graphId, kind);
@@ -355,7 +396,7 @@ async function computeContentComponent(backend, graphId, graph) {
       }
     }
   }
-  return chunk73KASJGO_cjs.sha256Hex(
+  return chunkZY4GXIVN_cjs.sha256Hex(
     canonicalizeProps({
       nodes: nodeDigest.sort((left, right) => byDigestEntry(left, right)),
       edges: edgeDigest.sort((left, right) => byDigestEntry(left, right))
@@ -446,17 +487,17 @@ var CLONE_IMPORT_BATCH_SIZE = 1e3;
 function cloneWorkingCopyStrategy(makeBackend) {
   return {
     create: async (baseStore) => {
-      const data = await chunkSB65GJNY_cjs.exportGraph(baseStore, {
+      const data = await chunkKNHYNQQ3_cjs.exportGraph(baseStore, {
         includeMeta: true,
         includeDeleted: false
       });
       const backend = await makeBackend();
       try {
-        const [freshStore] = await chunk2LAT5BIK_cjs.createStoreWithSchema(
+        const [freshStore] = await chunk3BRVBQQD_cjs.createStoreWithSchema(
           baseStore.graph,
           backend
         );
-        const result = await chunkSB65GJNY_cjs.importGraph(freshStore, data, {
+        const result = await chunkKNHYNQQ3_cjs.importGraph(freshStore, data, {
           onConflict: "error",
           onUnknownProperty: "error",
           validateReferences: true,
@@ -484,12 +525,12 @@ function cloneWorkingCopyStrategy(makeBackend) {
 async function branch(baseStore, makeBackend, options, strategy) {
   try {
     const base = await computeBaseVersion(baseStore);
-    const id = options?.id ?? asBranchId(chunk2LAT5BIK_cjs.generateId());
+    const id = options?.id ?? asBranchId(chunk5IQIX7LU_cjs.generateId());
     const workingCopyStrategy = strategy ?? cloneWorkingCopyStrategy(makeBackend);
     const store = await workingCopyStrategy.create(baseStore);
-    return chunkKTIEB7VH_cjs.ok({ id, base, store });
+    return chunkHK5SATYM_cjs.ok({ id, base, store });
   } catch (error) {
-    return chunkKTIEB7VH_cjs.err(
+    return chunkHK5SATYM_cjs.err(
       new BranchError("Failed to create working-copy branch of base store", {
         cause: error
       })
@@ -513,7 +554,7 @@ function constraintSignature(node, constraint) {
       return void 0;
     }
   }
-  return `${constraint.name}${KEY_PART_SEPARATOR}${chunk2LAT5BIK_cjs.computeUniqueKey(
+  return `${constraint.name}${KEY_PART_SEPARATOR}${chunk5IQIX7LU_cjs.computeUniqueKey(
     props,
     constraint.fields,
     constraint.collation
@@ -550,12 +591,12 @@ function blockNodes(newNodes, resolveConfig, uniqueConstraints = []) {
     }
   }
   const sortedKeys = [...buckets.keys()].sort(
-    (left, right) => compareStrings(left, right)
+    (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right)
   );
   const ordered = /* @__PURE__ */ new Map();
   for (const key of sortedKeys) {
     const members = [...buckets.get(key)].sort(
-      (left, right) => compareStrings(left.id, right.id)
+      (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id)
     );
     ordered.set(key, members);
   }
@@ -572,7 +613,7 @@ function buildBranchRank(branchOrder, allBranchIds) {
       next += 1;
     }
   }
-  const remaining = allBranchIds.filter((branchId) => !rank.has(branchId)).sort((left, right) => compareStrings(left, right));
+  const remaining = allBranchIds.filter((branchId) => !rank.has(branchId)).sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right));
   for (const branchId of remaining) {
     if (!rank.has(branchId)) {
       rank.set(branchId, next);
@@ -644,8 +685,8 @@ function collectConflictingValues(property, contributions) {
     values.push({ branchId, value });
   }
   return [...values].sort((left, right) => {
-    const byBranch = compareStrings(left.branchId, right.branchId);
-    return byBranch === 0 ? compareStrings(
+    const byBranch = chunkZ5HBYM7U_cjs.compareStrings(left.branchId, right.branchId);
+    return byBranch === 0 ? chunkZ5HBYM7U_cjs.compareStrings(
       canonicalValueKey(left.value),
       canonicalValueKey(right.value)
     ) : byBranch;
@@ -772,7 +813,7 @@ function unionProperties(canonicalMember, members, context, baseContext, branchR
   const props = {};
   const conflicts = [];
   for (const property of [...propertyNames].sort(
-    (left, right) => compareStrings(left, right)
+    (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right)
   )) {
     const values = collectConflictingValues(property, members);
     if (values.length === 0) {
@@ -837,14 +878,14 @@ function canonicalizeCluster(cluster, members, policy, branchRank, weights, cano
   );
   const memberIds = [
     ...new Set(cluster.members.map((member) => idOf(member)))
-  ].sort((left, right) => compareStrings(left, right));
+  ].sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right));
   const branchOrigins = [
     ...new Set(
       members.map((member) => member.branchId).filter(
         (branchId) => branchId !== BASE_PROVENANCE_BRANCH && branchId !== preferredBranchId
       )
     )
-  ].sort((left, right) => compareStrings(left, right));
+  ].sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right));
   const resolution = {
     canonicalId,
     memberIds,
@@ -904,7 +945,7 @@ var UnionFind = class {
 var SUB_CLASS_OF_META_EDGE = "subClassOf";
 var EQUIVALENT_TO_META_EDGE = "equivalentTo";
 function buildSubClassClosure(ontology) {
-  const unionFind = new UnionFind(compareStrings);
+  const unionFind = new UnionFind(chunkZ5HBYM7U_cjs.compareStrings);
   for (const relation of ontology) {
     unionFind.add(relation.from);
     unionFind.add(relation.to);
@@ -935,7 +976,7 @@ function buildSubClassClosure(ontology) {
     relations.push([child, parent]);
   }
   return {
-    closure: chunkKTIEB7VH_cjs.computeTransitiveClosure(relations),
+    closure: chunkHK5SATYM_cjs.computeTransitiveClosure(relations),
     canonicalOf
   };
 }
@@ -948,7 +989,7 @@ function isReachable2(closure, from, to) {
   if (fromRep === toRep) {
     return from !== to;
   }
-  return chunkKTIEB7VH_cjs.isReachable(closure.closure, fromRep, toRep);
+  return chunkHK5SATYM_cjs.isReachable(closure.closure, fromRep, toRep);
 }
 
 // src/graph-merge/similarity.ts
@@ -1131,37 +1172,37 @@ function scorePrepared(left, right, strategy, ctx) {
   switch (strategy.kind) {
     case "custom": {
       const raw = strategy.score(left.node, right.node);
-      return chunkKTIEB7VH_cjs.ok(clampScore(raw));
+      return chunkHK5SATYM_cjs.ok(clampScore(raw));
     }
     case "fulltext": {
       if (left.text.length === 0 || right.text.length === 0) {
-        return chunkKTIEB7VH_cjs.ok(NO_EVIDENCE_SCORE);
+        return chunkHK5SATYM_cjs.ok(NO_EVIDENCE_SCORE);
       }
-      return chunkKTIEB7VH_cjs.ok(clampScore(diceFromMultisets(left.grams, right.grams)));
+      return chunkHK5SATYM_cjs.ok(clampScore(diceFromMultisets(left.grams, right.grams)));
     }
     case "vector": {
       if (ctx.embeddings === void 0) {
-        return chunkKTIEB7VH_cjs.err(embedderUnavailable("vector", ctx));
+        return chunkHK5SATYM_cjs.err(embedderUnavailable("vector", ctx));
       }
       if (left.text.length === 0 || right.text.length === 0) {
-        return chunkKTIEB7VH_cjs.ok(NO_EVIDENCE_SCORE);
+        return chunkHK5SATYM_cjs.ok(NO_EVIDENCE_SCORE);
       }
       const cosine = cosineFromLookup(ctx.embeddings, left.text, right.text);
-      return chunkKTIEB7VH_cjs.ok(clampScore(cosine));
+      return chunkHK5SATYM_cjs.ok(clampScore(cosine));
     }
     case "hybrid": {
       if (ctx.embeddings === void 0) {
-        return chunkKTIEB7VH_cjs.err(embedderUnavailable("hybrid", ctx));
+        return chunkHK5SATYM_cjs.err(embedderUnavailable("hybrid", ctx));
       }
       if (left.text.length === 0 || right.text.length === 0) {
-        return chunkKTIEB7VH_cjs.ok(NO_EVIDENCE_SCORE);
+        return chunkHK5SATYM_cjs.ok(NO_EVIDENCE_SCORE);
       }
       const vectorScore = clampScore(
         cosineFromLookup(ctx.embeddings, left.text, right.text)
       );
       const fulltextScore = diceFromMultisets(left.grams, right.grams);
       const weights = normalizeHybridWeights(strategy.weights);
-      return chunkKTIEB7VH_cjs.ok(
+      return chunkHK5SATYM_cjs.ok(
         clampScore(
           weights.vector * vectorScore + weights.fulltext * fulltextScore
         )
@@ -1219,7 +1260,7 @@ function scoreCandidates(input, resolveConfig, ctx, ceilingPolicy, maxComparison
   }
   if (maxComparisonsPerKind !== void 0 && fuzzy.length > maxComparisonsPerKind) {
     if (ceilingPolicy === "error") {
-      return chunkKTIEB7VH_cjs.err(
+      return chunkHK5SATYM_cjs.err(
         new MergeError(
           `Comparison ceiling exceeded: ${fuzzy.length} candidate pairs > maxComparisonsPerKind ${maxComparisonsPerKind}.`,
           {
@@ -1232,7 +1273,7 @@ function scoreCandidates(input, resolveConfig, ctx, ceilingPolicy, maxComparison
         )
       );
     }
-    return chunkKTIEB7VH_cjs.ok({
+    return chunkHK5SATYM_cjs.ok({
       edges: [...forced].sort(
         (left, right) => compareCandidateEdges(left, right)
       ),
@@ -1250,14 +1291,14 @@ function scoreCandidates(input, resolveConfig, ctx, ceilingPolicy, maxComparison
   const edges = [...forced];
   for (const { left, right, a, b } of fuzzy) {
     const scored = scorer(a, left, b, right);
-    if (chunkKTIEB7VH_cjs.isErr(scored)) {
-      return chunkKTIEB7VH_cjs.err(scored.error);
+    if (chunkHK5SATYM_cjs.isErr(scored)) {
+      return chunkHK5SATYM_cjs.err(scored.error);
     }
     if (scored.data >= threshold) {
       edges.push({ a, b, score: scored.data });
     }
   }
-  return chunkKTIEB7VH_cjs.ok({
+  return chunkHK5SATYM_cjs.ok({
     edges: edges.sort((left, right) => compareCandidateEdges(left, right)),
     warnings: []
   });
@@ -1467,7 +1508,7 @@ function pickHighestPriorityBranch(branchIds, branchRank) {
   let chosenRank = branchRank.get(chosen) ?? Number.MAX_SAFE_INTEGER;
   for (const candidate of branchIds.slice(1)) {
     const candidateRank = branchRank.get(candidate) ?? Number.MAX_SAFE_INTEGER;
-    if (candidateRank < chosenRank || candidateRank === chosenRank && compareStrings(candidate, chosen) < 0) {
+    if (candidateRank < chosenRank || candidateRank === chosenRank && chunkZ5HBYM7U_cjs.compareStrings(candidate, chosen) < 0) {
       chosen = candidate;
       chosenRank = candidateRank;
     }
@@ -1560,20 +1601,20 @@ function resolveDeleteModifyOver(modified, deleted, modifiedEntity, deletedEntit
   }
   return {
     survivingModifications: [...survivingModifications].sort((left, right) => {
-      const byId2 = compareStrings(
+      const byId2 = chunkZ5HBYM7U_cjs.compareStrings(
         modifiedEntity(left).id,
         modifiedEntity(right).id
       );
-      return byId2 === 0 ? compareStrings(left.branchId, right.branchId) : byId2;
+      return byId2 === 0 ? chunkZ5HBYM7U_cjs.compareStrings(left.branchId, right.branchId) : byId2;
     }),
     deletions: [...deletions].sort(
-      (left, right) => compareStrings(left.id, right.id)
+      (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id)
     ),
     conflicts: [...conflicts].sort(
-      (left, right) => compareStrings(left.entityId, right.entityId)
+      (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.entityId, right.entityId)
     ),
     dropped: [...dropped].sort(
-      (left, right) => compareStrings(left.id, right.id)
+      (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id)
     )
   };
 }
@@ -1617,11 +1658,11 @@ function reconcileOver(survivingModifications, entityOf, rebuild, policy, branch
   }
   return {
     survivingModifications: [...out].sort((left, right) => {
-      const byId2 = compareStrings(entityOf(left).id, entityOf(right).id);
-      return byId2 === 0 ? compareStrings(left.branchId, right.branchId) : byId2;
+      const byId2 = chunkZ5HBYM7U_cjs.compareStrings(entityOf(left).id, entityOf(right).id);
+      return byId2 === 0 ? chunkZ5HBYM7U_cjs.compareStrings(left.branchId, right.branchId) : byId2;
     }),
     conflicts: conflicts.sort(
-      (left, right) => compareStrings(
+      (left, right) => chunkZ5HBYM7U_cjs.compareStrings(
         `${left.entityId}|${left.property}`,
         `${right.entityId}|${right.property}`
       )
@@ -1655,7 +1696,7 @@ function threeWayMergeProps(entityId, kind, baseProps, contributions, context, b
       propertyNames.add(name);
     }
   }
-  for (const property of [...propertyNames].sort(compareStrings)) {
+  for (const property of [...propertyNames].sort(chunkZ5HBYM7U_cjs.compareStrings)) {
     const baseHas = property in baseProps;
     const baseKey = baseHas ? canonicalValueKey(baseProps[property]) : void 0;
     const changed = contributions.filter((contribution) => {
@@ -1792,7 +1833,7 @@ function unionEdgeProps(survivorId, kind, survivor, edges, context, branchRank,
   const conflicts = [];
   const contributions = edges.map((edge) => edge.staged);
   for (const property of [...propertyNames].sort(
-    (left, right) => compareStrings(left, right)
+    (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right)
   )) {
     const values = collectConflictingValues(property, contributions);
     if (values.length === 0) {
@@ -1861,7 +1902,7 @@ function repointEdges(stagedEdges, canonicalOf, deletedNodeIds, policy, branchRa
   const merged = [];
   const conflicts = [];
   const sortedGroups = [...dedupeKeyByGroup.keys()].sort(
-    (left, right) => compareStrings(left, right)
+    (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right)
   );
   for (const group of sortedGroups) {
     const dedupeKeys = [...dedupeKeyByGroup.get(group)];
@@ -1873,7 +1914,7 @@ function repointEdges(stagedEdges, canonicalOf, deletedNodeIds, policy, branchRa
     }
     const survivor = pickSurvivor(groupEdges, preferredBranchId);
     const survivorId = survivor.staged.id;
-    const mergedIds = [...groupEdges].map((edge) => edge.staged.id).sort((left, right) => compareStrings(left, right));
+    const mergedIds = [...groupEdges].map((edge) => edge.staged.id).sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right));
     const fromId = idOf(survivor.fromKey);
     const fromKind = kindOf(survivor.fromKey);
     const toId = idOf(survivor.toKey);
@@ -1922,12 +1963,12 @@ function repointEdges(stagedEdges, canonicalOf, deletedNodeIds, policy, branchRa
       mergeKey(edge.toKind, edge.toId),
       edge.props
     )
-  })).sort((left, right) => compareStrings(left.sortKey, right.sortKey)).map(({ edge }) => edge);
+  })).sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.sortKey, right.sortKey)).map(({ edge }) => edge);
   return {
     edges: sortedEdges,
-    dropped: dropped.sort((left, right) => compareStrings(left.id, right.id)),
+    dropped: dropped.sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id)),
     conflicts: conflicts.sort(
-      (left, right) => compareStrings(
+      (left, right) => chunkZ5HBYM7U_cjs.compareStrings(
         `${left.entityId}|${left.property}`,
         `${right.entityId}|${right.property}`
       )
@@ -2056,7 +2097,7 @@ function normalizeMergeOptions(options = {}) {
     ...provenanceWeights === void 0 ? {} : { provenanceWeights }
   };
 }
-var Provenance = chunkLAZGHOZW_cjs.defineNode("Provenance", {
+var Provenance = chunk6HVOHZHS_cjs.defineNode("Provenance", {
   schema: zod.z.object({
     targetGraphId: zod.z.string(),
     role: zod.z.enum(["node", "edge"]),
@@ -2070,14 +2111,14 @@ function provenanceGraphId(targetGraphId) {
   return `${targetGraphId}::merge-provenance`;
 }
 function buildProvenanceGraph(targetGraphId) {
-  return chunkEEYV6UOE_cjs.defineGraph({
+  return chunkT6SPUYLX_cjs.defineGraph({
     id: provenanceGraphId(targetGraphId),
     nodes: { Provenance: { type: Provenance } },
     edges: {}
   });
 }
 async function openProvenanceStore(backend, targetGraphId) {
-  const [store] = await chunk2LAT5BIK_cjs.createStoreWithSchema(
+  const [store] = await chunk3BRVBQQD_cjs.createStoreWithSchema(
     buildProvenanceGraph(targetGraphId),
     backend
   );
@@ -2097,7 +2138,7 @@ async function provenanceNodeId(targetGraphId, record) {
     record.branchId,
     record.sourceId
   ].join(ID_SEPARATOR);
-  const digest = await chunk73KASJGO_cjs.sha256Hex(tuple, ID_DIGEST_BYTES);
+  const digest = await chunkZY4GXIVN_cjs.sha256Hex(tuple, ID_DIGEST_BYTES);
   return `prov_${digest}`;
 }
 async function persistProvenanceRecords(store, targetGraphId, records) {
@@ -2124,7 +2165,7 @@ async function readProvenance(store, query = {}) {
   const all = await store.nodes.Provenance.find();
   return all.filter(
     (node) => (query.branchId === void 0 || node.branchId === query.branchId) && (query.canonicalId === void 0 || node.canonicalId === query.canonicalId) && (query.role === void 0 || node.role === query.role)
-  ).sort((left, right) => compareStrings(left.id, right.id));
+  ).sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id));
 }
 
 // src/graph-merge/sources.ts
@@ -2134,10 +2175,10 @@ function orderEndpoints(left, right) {
   return compareMergeKeys(leftKey, rightKey) <= 0 ? { a: leftKey, b: rightKey, left, right } : { a: rightKey, b: leftKey, left: right, right: left };
 }
 function sortMembersById(members) {
-  return [...members].sort((left, right) => compareStrings(left.id, right.id));
+  return [...members].sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id));
 }
 function sortedBucketKeys(blocks) {
-  return [...blocks.keys()].sort((left, right) => compareStrings(left, right));
+  return [...blocks.keys()].sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right));
 }
 var NODE_SYSTEM_FIELDS = /* @__PURE__ */ new Set(["id", "kind", "meta"]);
 function nodeProps(node) {
@@ -2165,7 +2206,7 @@ function windowedPairs(members, config) {
     key: fieldText(node, config.sortFields)
   }));
   keyed.sort(
-    (left, right) => left.key === right.key ? compareStrings(left.node.id, right.node.id) : compareStrings(left.key, right.key)
+    (left, right) => left.key === right.key ? chunkZ5HBYM7U_cjs.compareStrings(left.node.id, right.node.id) : chunkZ5HBYM7U_cjs.compareStrings(left.key, right.key)
   );
   const pairs = [];
   for (let index = 0; index < keyed.length; index += 1) {
@@ -2223,7 +2264,7 @@ function ontologyRetypeEdges(stagedIdentities, isRetypeCompatible) {
     }
   }
   const edges = [];
-  for (const id of [...identitiesById.keys()].sort(compareStrings)) {
+  for (const id of [...identitiesById.keys()].sort(chunkZ5HBYM7U_cjs.compareStrings)) {
     const identities = [...new Set(identitiesById.get(id))].sort(
       compareMergeKeys
     );
@@ -2315,7 +2356,7 @@ var baseUniqueSource = {
     const forcedEdges = [];
     const baseMembers = /* @__PURE__ */ new Map();
     const constraints = [...uniqueConstraints].sort(
-      (left, right) => compareStrings(left.name, right.name)
+      (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.name, right.name)
     );
     const items = nodes.map((node) => ({ props: nodeProps(node) }));
     const matchesByConstraint = await Promise.all(
@@ -2358,7 +2399,7 @@ var baseUniqueSource = {
       pairs: [],
       forcedEdges,
       baseMembers: [...baseMembers.values()].sort(
-        (left, right) => compareStrings(left.id, right.id)
+        (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id)
       )
     };
   }
@@ -2415,7 +2456,7 @@ var baseKeySource = {
       pairs,
       forcedEdges: [],
       baseMembers: [...baseMembers.values()].sort(
-        (left, right) => compareStrings(left.id, right.id)
+        (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id)
       )
     };
   }
@@ -2427,16 +2468,16 @@ var CANDIDATE_SOURCES = [
 
 // src/graph-merge/staging.ts
 function compareByIdThenBranch(left, right) {
-  const byId2 = compareStrings(left.id, right.id);
-  return byId2 === 0 ? compareStrings(left.branchId, right.branchId) : byId2;
+  const byId2 = chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id);
+  return byId2 === 0 ? chunkZ5HBYM7U_cjs.compareStrings(left.branchId, right.branchId) : byId2;
 }
 function compareByKindIdBranch(left, right) {
-  const byKind = compareStrings(left.kind, right.kind);
+  const byKind = chunkZ5HBYM7U_cjs.compareStrings(left.kind, right.kind);
   if (byKind !== 0) {
     return byKind;
   }
-  const byId2 = compareStrings(left.id, right.id);
-  return byId2 === 0 ? compareStrings(left.branchId, right.branchId) : byId2;
+  const byId2 = chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id);
+  return byId2 === 0 ? chunkZ5HBYM7U_cjs.compareStrings(left.branchId, right.branchId) : byId2;
 }
 function groupByKind(items) {
   const buckets = /* @__PURE__ */ new Map();
@@ -2450,7 +2491,7 @@ function groupByKind(items) {
   }
   const ordered = /* @__PURE__ */ new Map();
   for (const kind of [...buckets.keys()].sort(
-    (left, right) => compareStrings(left, right)
+    (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right)
   )) {
     ordered.set(
       kind,
@@ -2461,16 +2502,26 @@ function groupByKind(items) {
   }
   return ordered;
 }
-async function stageBranches(baseStore, branches) {
+async function stageBranches(baseStore, branches, captureTargetStateFor) {
   const newNodes = [];
   const modifiedNodes = [];
   const deletedNodes = [];
   const newEdges = [];
   const modifiedEdges = [];
   const deletedEdges = [];
+  let targetNodeVersions = /* @__PURE__ */ new Map();
+  let targetEdgeSignatures = /* @__PURE__ */ new Map();
   for (const branch2 of branches) {
-    const diff = await diffAgainstBase(baseStore, branch2.store);
     const branchId = branch2.id;
+    const diff = await diffAgainstBase(
+      baseStore,
+      branch2.store,
+      branchId === captureTargetStateFor
+    );
+    if (branchId === captureTargetStateFor) {
+      targetNodeVersions = diff.forkNodeVersions;
+      targetEdgeSignatures = diff.forkEdgeSignatures;
+    }
     for (const node of diff.nodes.new) {
       newNodes.push({ branchId, node, kind: node.kind, id: node.id });
     }
@@ -2504,7 +2555,9 @@ async function stageBranches(baseStore, branches) {
     ),
     deletedEdges: [...deletedEdges].sort(
       (left, right) => compareByKindIdBranch(left, right)
-    )
+    ),
+    targetNodeVersions,
+    targetEdgeSignatures
   };
 }
 
@@ -2553,7 +2606,7 @@ async function withTxConflictRetry(commit) {
 // src/graph-merge/type-reconcile.ts
 var INCOMPATIBLE_TYPES_FLAG_REASON = "type-reconcile:incompatible-kinds";
 function distinctKinds(kinds) {
-  return [...new Set(kinds)].sort((left, right) => compareStrings(left, right));
+  return [...new Set(kinds)].sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right));
 }
 function areEquivalent(closure, left, right) {
   return left !== right && isReachable2(closure, left, right) && isReachable2(closure, right, left);
@@ -2571,7 +2624,7 @@ function mostSpecificCommonKind(closure, kinds) {
   if (qualifiers.length === 0) {
     return void 0;
   }
-  return [...qualifiers].sort((left, right) => compareStrings(left, right))[0];
+  return [...qualifiers].sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right))[0];
 }
 function reconcileTypes(clusters, closure, mode) {
   if (mode === "off") {
@@ -2608,10 +2661,10 @@ function reconcileTypes(clusters, closure, mode) {
   }
   return {
     reconciliations: reconciliations.sort(
-      (left, right) => compareStrings(left.entityId, right.entityId)
+      (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.entityId, right.entityId)
     ),
     retypeMap,
-    dropped: dropped.sort((left, right) => compareStrings(left.id, right.id))
+    dropped: dropped.sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left.id, right.id))
   };
 }
 
@@ -2630,8 +2683,8 @@ function newNodesByKind(staging) {
     ordered.set(
       kind,
       [...items].sort((left, right) => {
-        const byId2 = compareStrings(left.node.id, right.node.id);
-        return byId2 === 0 ? compareStrings(left.branchId, right.branchId) : byId2;
+        const byId2 = chunkZ5HBYM7U_cjs.compareStrings(left.node.id, right.node.id);
+        return byId2 === 0 ? chunkZ5HBYM7U_cjs.compareStrings(left.branchId, right.branchId) : byId2;
       })
     );
   }
@@ -2663,7 +2716,7 @@ async function precomputeEmbeddings(byKind, resolve, embedder) {
     return lookup;
   }
   const orderedTexts = [...texts].sort(
-    (left, right) => compareStrings(left, right)
+    (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right)
   );
   const vectors = await embedder(orderedTexts);
   if (vectors.length !== orderedTexts.length) {
@@ -2699,7 +2752,7 @@ async function embedMissingPairTexts(base, pairs, strategy, embedder) {
     return existing;
   }
   const orderedTexts = [...missing].sort(
-    (left, right) => compareStrings(left, right)
+    (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right)
   );
   const vectors = await embedder(orderedTexts);
   if (vectors.length !== orderedTexts.length) {
@@ -2729,7 +2782,7 @@ async function generateAllCandidates(target, staging, options, introspectionKind
       async ([kind, items]) => {
         const resolveConfig = options.resolve[kind];
         if (resolveConfig === void 0) {
-          return chunkKTIEB7VH_cjs.ok({ edges: [], warnings: [], baseMembers: [] });
+          return chunkHK5SATYM_cjs.ok({ edges: [], warnings: [], baseMembers: [] });
         }
         const nodes = items.map((staged) => asNode(staged));
         const uniqueConstraints = uniqueConstraintsFor(
@@ -2772,10 +2825,10 @@ async function generateAllCandidates(target, staging, options, introspectionKind
           options.onComparisonCeiling,
           options.maxComparisonsPerKind
         );
-        if (chunkKTIEB7VH_cjs.isErr(scored)) {
-          return chunkKTIEB7VH_cjs.err(scored.error);
+        if (chunkHK5SATYM_cjs.isErr(scored)) {
+          return chunkHK5SATYM_cjs.err(scored.error);
         }
-        return chunkKTIEB7VH_cjs.ok({
+        return chunkHK5SATYM_cjs.ok({
           edges: scored.data.edges,
           warnings: scored.data.warnings.map(
             (warning) => `[${kind}] ${warning.message}`
@@ -2786,14 +2839,14 @@ async function generateAllCandidates(target, staging, options, introspectionKind
     )
   );
   for (const result of perKind) {
-    if (chunkKTIEB7VH_cjs.isErr(result)) {
-      return chunkKTIEB7VH_cjs.err(result.error);
+    if (chunkHK5SATYM_cjs.isErr(result)) {
+      return chunkHK5SATYM_cjs.err(result.error);
     }
     allEdges.push(...result.data.edges);
     warnings.push(...result.data.warnings);
     baseMembers.push(...result.data.baseMembers);
   }
-  return chunkKTIEB7VH_cjs.ok({
+  return chunkHK5SATYM_cjs.ok({
     // The ONE shared `(a, b)` edge comparator (id-first `(kind, id)` order), so this
     // stage emits edges in exactly the order clustering consumes them.
     edges: allEdges.sort((left, right) => compareCandidateEdges(left, right)),
@@ -2896,9 +2949,9 @@ function buildProvenanceIndex(records) {
   for (const [branchId, sets] of byBranch) {
     frozen.set(branchId, {
       nodeIds: [...sets.nodeIds].sort(
-        (left, right) => compareStrings(left, right)
+        (left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right)
       ),
-      edgeIds: [...sets.edgeIds].sort((left, right) => compareStrings(left, right)).map((id) => id)
+      edgeIds: [...sets.edgeIds].sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right)).map((id) => id)
     });
   }
   return {
@@ -3113,7 +3166,7 @@ function planMerge(staging, candidateEdges, candidateWarnings, baseMembers, opti
     ...repoint2.dropped,
     ...reconciliation.dropped
   ].sort(
-    (left, right) => compareStrings(`${left.kind}|${left.id}`, `${right.kind}|${right.id}`)
+    (left, right) => chunkZ5HBYM7U_cjs.compareStrings(`${left.kind}|${left.id}`, `${right.kind}|${right.id}`)
   );
   return {
     canonicalEntities,
@@ -3146,7 +3199,7 @@ function planMerge(staging, candidateEdges, candidateWarnings, baseMembers, opti
           mergeKey(left.kind, left.entityId),
           mergeKey(right.kind, right.entityId)
         );
-        return byEntity === 0 ? compareStrings(left.property, right.property) : byEntity;
+        return byEntity === 0 ? chunkZ5HBYM7U_cjs.compareStrings(left.property, right.property) : byEntity;
       }
     ),
     deleteModifyConflicts: [
@@ -3334,7 +3387,7 @@ async function validateBaseVersions(target, branches) {
   const targetVersion = await computeBaseVersion(target);
   for (const branch2 of branches) {
     if (branch2.base !== targetVersion) {
-      return chunkKTIEB7VH_cjs.err(
+      return chunkHK5SATYM_cjs.err(
         new BaseVersionMismatchError(
           `Branch "${branch2.id}" forked from base@V "${branch2.base}", which does not match the merge target's current base@V "${targetVersion}".`,
           {
@@ -3348,20 +3401,20 @@ async function validateBaseVersions(target, branches) {
       );
     }
   }
-  return chunkKTIEB7VH_cjs.ok(targetVersion);
+  return chunkHK5SATYM_cjs.ok(targetVersion);
 }
 function tryNormalize(optionsInput) {
   try {
-    return chunkKTIEB7VH_cjs.ok(normalizeMergeOptions(optionsInput));
+    return chunkHK5SATYM_cjs.ok(normalizeMergeOptions(optionsInput));
   } catch (error) {
-    return chunkKTIEB7VH_cjs.err(new MergeError("Invalid merge options.", { cause: error }));
+    return chunkHK5SATYM_cjs.err(new MergeError("Invalid merge options.", { cause: error }));
   }
 }
 async function resolveMerge(store, target, branches, options, useBaseSources, incremental, expectedBaseVersion) {
   let targetBranchSeen = false;
   for (const branch2 of branches) {
     if (branch2.id === BASE_PROVENANCE_BRANCH) {
-      return chunkKTIEB7VH_cjs.err(
+      return chunkHK5SATYM_cjs.err(
         new MergeError(
           `Branch id "${BASE_PROVENANCE_BRANCH}" is reserved for committed-base provenance and cannot be used as a branch id.`,
           { details: { branchId: branch2.id } }
@@ -3370,7 +3423,7 @@ async function resolveMerge(store, target, branches, options, useBaseSources, in
     }
     if (branch2.id === COMMITTED_TARGET_BRANCH) {
       if (incremental?.targetBranchId !== COMMITTED_TARGET_BRANCH || targetBranchSeen) {
-        return chunkKTIEB7VH_cjs.err(
+        return chunkHK5SATYM_cjs.err(
           new MergeError(
             `Branch id "${COMMITTED_TARGET_BRANCH}" is reserved for the committed incremental target and cannot be used as a branch id.`,
             { details: { branchId: branch2.id } }
@@ -3381,8 +3434,8 @@ async function resolveMerge(store, target, branches, options, useBaseSources, in
     }
   }
   try {
-    const staging = await stageBranches(store, branches);
     const preferredBranchId = incremental?.targetBranchId;
+    const staging = await stageBranches(store, branches, preferredBranchId);
     const branchIds = branches.map((branch2) => branch2.id);
     const branchOrder = preferredBranchId === void 0 ? options.branchOrder ?? [] : [
       preferredBranchId,
@@ -3415,8 +3468,8 @@ async function resolveMerge(store, target, branches, options, useBaseSources, in
       useBaseSources,
       options.embedder
     );
-    if (chunkKTIEB7VH_cjs.isErr(candidates)) {
-      return chunkKTIEB7VH_cjs.err(candidates.error);
+    if (chunkHK5SATYM_cjs.isErr(candidates)) {
+      return chunkHK5SATYM_cjs.err(candidates.error);
     }
     const plan = planMerge(
       staging,
@@ -3436,7 +3489,9 @@ async function resolveMerge(store, target, branches, options, useBaseSources, in
       // anything NEW the in-tx re-probe surfaces is a window write.
       plannedBaseMatchKeys: new Set(
         candidates.data.baseMembers.map((member) => mergeKeyOf(member))
-      )
+      ),
+      targetNodeVersions: staging.targetNodeVersions,
+      targetEdgeSignatures: staging.targetEdgeSignatures
     });
     const provenance = options.provenance ? buildProvenanceIndex(plan.provenanceRecords) : { byBranch: () => ({ nodeIds: [], edgeIds: [] }) };
     const warnings = [...plan.warnings];
@@ -3474,12 +3529,12 @@ async function resolveMerge(store, target, branches, options, useBaseSources, in
       warnings,
       ...provenancePersisted === void 0 ? {} : { provenancePersisted }
     };
-    return chunkKTIEB7VH_cjs.ok(report);
+    return chunkHK5SATYM_cjs.ok(report);
   } catch (error) {
     if (error instanceof MergeError) {
-      return chunkKTIEB7VH_cjs.err(error);
+      return chunkHK5SATYM_cjs.err(error);
     }
-    return chunkKTIEB7VH_cjs.err(
+    return chunkHK5SATYM_cjs.err(
       new MergeError(
         `Merge failed while staging or committing: ${describeCause(error)}`,
         { cause: error }
@@ -3489,14 +3544,14 @@ async function resolveMerge(store, target, branches, options, useBaseSources, in
 }
 async function merge(store, branches, optionsInput = {}) {
   const normalized = tryNormalize(optionsInput);
-  if (chunkKTIEB7VH_cjs.isErr(normalized)) {
-    return chunkKTIEB7VH_cjs.err(normalized.error);
+  if (chunkHK5SATYM_cjs.isErr(normalized)) {
+    return chunkHK5SATYM_cjs.err(normalized.error);
   }
   const options = normalized.data;
   const target = options.target ?? store;
   const precondition = await validateBaseVersions(target, branches);
-  if (chunkKTIEB7VH_cjs.isErr(precondition)) {
-    return chunkKTIEB7VH_cjs.err(precondition.error);
+  if (chunkHK5SATYM_cjs.isErr(precondition)) {
+    return chunkHK5SATYM_cjs.err(precondition.error);
   }
   return resolveMerge(
     store,
@@ -3512,7 +3567,7 @@ async function validateForkPointVersions(forkPoint, branches) {
   const forkVersion = await computeBaseVersion(forkPoint);
   for (const branch2 of branches) {
     if (branch2.base !== forkVersion) {
-      return chunkKTIEB7VH_cjs.err(
+      return chunkHK5SATYM_cjs.err(
         new BaseVersionMismatchError(
           `Branch "${branch2.id}" forked from base@V "${branch2.base}", which does not match the fork-point's base@V "${forkVersion}". mergeIncremental() requires every branch to have forked from the supplied forkPoint.`,
           {
@@ -3526,7 +3581,7 @@ async function validateForkPointVersions(forkPoint, branches) {
       );
     }
   }
-  return chunkKTIEB7VH_cjs.ok(forkVersion);
+  return chunkHK5SATYM_cjs.ok(forkVersion);
 }
 function nodeSchemaFor(target, kind) {
   const registry = target.graph.nodes;
@@ -3737,7 +3792,7 @@ async function validateIncrementalEdgeWrites(target, edgesApi, plan) {
       }
     }
   }
-  const notFound = [...plannedKindById.keys()].filter((id) => !existingById.has(id)).sort((left, right) => compareStrings(left, right));
+  const notFound = [...plannedKindById.keys()].filter((id) => !existingById.has(id)).sort((left, right) => chunkZ5HBYM7U_cjs.compareStrings(left, right));
   if (notFound.length > 0) {
     const crossKindById = /* @__PURE__ */ new Map();
     for (const kind of Object.keys(target.graph.edges)) {
@@ -3866,6 +3921,99 @@ async function assertBaseResolutionStable(lookupStore, guard) {
     }
   );
 }
+function bucketInheritedRefsByKind(refs, identities) {
+  const seen = /* @__PURE__ */ new Set();
+  const idsByKind = /* @__PURE__ */ new Map();
+  for (const ref of refs) {
+    const identity = mergeKey(ref.kind, ref.id);
+    if (!identities.has(identity) || seen.has(identity)) {
+      continue;
+    }
+    seen.add(identity);
+    const bucket = idsByKind.get(ref.kind) ?? [];
+    bucket.push(ref.id);
+    idsByKind.set(ref.kind, bucket);
+  }
+  return idsByKind;
+}
+async function assertInheritedUnchanged(args) {
+  if (args.expected.size === 0) {
+    return;
+  }
+  const idsByKind = bucketInheritedRefsByKind(args.refs, args.expected);
+  for (const [kind, ids] of idsByKind) {
+    const rows = await args.fetchRows(kind, ids);
+    for (const [index, id] of ids.entries()) {
+      const expected = args.expected.get(mergeKey(kind, id));
+      const current = args.deriveValue(rows[index]);
+      if (current === expected) {
+        continue;
+      }
+      throw args.buildError(id, kind, expected, current);
+    }
+  }
+}
+async function assertInheritedTargetUnchanged(nodesApi, edgesApi, guard, plan) {
+  await Promise.all([
+    assertInheritedNodesUnchanged(nodesApi, guard, plan),
+    assertInheritedEdgesUnchanged(edgesApi, guard, plan)
+  ]);
+}
+async function assertInheritedNodesUnchanged(nodesApi, guard, plan) {
+  const nodeRefs = plannedNodeWrites(plan).map(
+    (write) => ({ kind: write.kind, id: write.id })
+  );
+  for (const [identity, kind] of plan.nodeDeletions) {
+    nodeRefs.push({ kind, id: idOf(identity) });
+  }
+  await assertInheritedUnchanged({
+    refs: nodeRefs,
+    expected: guard.targetNodeVersions,
+    fetchRows: (kind, ids) => nodeCollection(nodesApi, kind).getByIds(ids, INCLUDE_TOMBSTONES),
+    deriveValue: (row) => row?.meta.version,
+    buildError: (id, kind, expected, current) => new BaseVersionMismatchError(
+      `mergeIncremental() observed committed node "${id}" (kind "${kind}") at version ${expected} while planning, but it changed before the commit transaction; the resolved plan no longer describes the live target and was not applied.`,
+      {
+        details: {
+          id,
+          kind,
+          expectedVersion: expected,
+          currentVersion: current
+        },
+        suggestion: "Re-run mergeIncremental(); the re-planned merge resolves the inherited modifications against the now-committed rows."
+      }
+    )
+  });
+}
+async function assertInheritedEdgesUnchanged(edgesApi, guard, plan) {
+  const edgeRefs = plan.mergedEdges.map((edge) => ({
+    kind: edge.kind,
+    id: edge.id
+  }));
+  for (const [identity, kind] of plan.edgeDeletions) {
+    edgeRefs.push({ kind, id: idOf(identity) });
+  }
+  await assertInheritedUnchanged({
+    refs: edgeRefs,
+    expected: guard.targetEdgeSignatures,
+    fetchRows: (kind, ids) => edgeCollection(edgesApi, kind).getByIds(ids, INCLUDE_TOMBSTONES),
+    deriveValue: (row) => row === void 0 ? void 0 : edgeStateSignature({
+      fromKind: row.fromKind,
+      fromId: row.fromId,
+      toKind: row.toKind,
+      toId: row.toId,
+      live: row.meta.deletedAt === void 0,
+      props: edgeProps(row)
+    }),
+    buildError: (id, kind) => new BaseVersionMismatchError(
+      `mergeIncremental() observed committed edge "${id}" (kind "${kind}") while planning, but its endpoints, liveness, or props changed before the commit transaction; the resolved plan no longer describes the live target and was not applied.`,
+      {
+        details: { id, kind },
+        suggestion: "Re-run mergeIncremental(); the re-planned merge resolves the inherited modifications against the now-committed rows."
+      }
+    )
+  });
+}
 async function commitIncrementalPlan(target, plan, guard) {
   if (!target.backend.capabilities.transactions) {
     throw new MergeError(
@@ -3878,6 +4026,7 @@ async function commitIncrementalPlan(target, plan, guard) {
       const nodesApi = tx.nodes;
       const edgesApi = tx.edges;
       await assertBaseResolutionStable(tx, guard);
+      await assertInheritedTargetUnchanged(nodesApi, edgesApi, guard, plan);
       await validateIncrementalNodeWrites(target, nodesApi, plan);
       await validateIncrementalEdgeWrites(target, edgesApi, plan);
       return applyMergePlan(plan, nodesApi, edgesApi);
@@ -3887,12 +4036,12 @@ async function commitIncrementalPlan(target, plan, guard) {
 async function mergeIncremental(args) {
   const { forkPoint, target, branches } = args;
   const normalized = tryNormalize(args.options ?? {});
-  if (chunkKTIEB7VH_cjs.isErr(normalized)) {
-    return chunkKTIEB7VH_cjs.err(normalized.error);
+  if (chunkHK5SATYM_cjs.isErr(normalized)) {
+    return chunkHK5SATYM_cjs.err(normalized.error);
   }
   const options = normalized.data;
   if (options.onBasePropertyConflict !== "flag") {
-    return chunkKTIEB7VH_cjs.err(
+    return chunkHK5SATYM_cjs.err(
       new MergeError(
         'mergeIncremental() requires onBasePropertyConflict: "flag" (keep-base); a non-keep-base policy could overwrite a newer committed base value with a stale branch value.',
         { details: {} }
@@ -3900,8 +4049,8 @@ async function mergeIncremental(args) {
     );
   }
   const forkPrecondition = await validateForkPointVersions(forkPoint, branches);
-  if (chunkKTIEB7VH_cjs.isErr(forkPrecondition)) {
-    return chunkKTIEB7VH_cjs.err(forkPrecondition.error);
+  if (chunkHK5SATYM_cjs.isErr(forkPrecondition)) {
+    return chunkHK5SATYM_cjs.err(forkPrecondition.error);
   }
   const forkVersion = forkPrecondition.data;
   const [forkSchema, targetSchema] = await Promise.all([
@@ -3909,7 +4058,7 @@ async function mergeIncremental(args) {
     computeSchemaComponent(target)
   ]);
   if (forkSchema !== targetSchema) {
-    return chunkKTIEB7VH_cjs.err(
+    return chunkHK5SATYM_cjs.err(
       new MergeError(
         "mergeIncremental() requires target and forkPoint to share a schema; schema drift is not supported (the target content may differ \u2014 only the schema must match).",
         { details: {} }
@@ -3933,15 +4082,15 @@ async function mergeIncremental(args) {
 
 Object.defineProperty(exports, "isErr", {
   enumerable: true,
-  get: function () { return chunkKTIEB7VH_cjs.isErr; }
+  get: function () { return chunkHK5SATYM_cjs.isErr; }
 });
 Object.defineProperty(exports, "isOk", {
   enumerable: true,
-  get: function () { return chunkKTIEB7VH_cjs.isOk; }
+  get: function () { return chunkHK5SATYM_cjs.isOk; }
 });
 Object.defineProperty(exports, "unwrap", {
   enumerable: true,
-  get: function () { return chunkKTIEB7VH_cjs.unwrap; }
+  get: function () { return chunkHK5SATYM_cjs.unwrap; }
 });
 exports.BaseVersionMismatchError = BaseVersionMismatchError;
 exports.BranchError = BranchError;