@nicia-ai/typegraph 0.44.0 → 0.46.0

package/dist/{chunk-2VLBGQBY.cjs → chunk-N3257XE6.cjs}

@@ -1,25 +1,28 @@
 'use strict';
 
-var chunkTRF4EBJT_cjs = require('./chunk-TRF4EBJT.cjs');
-var chunkEE7N5XXQ_cjs = require('./chunk-EE7N5XXQ.cjs');
-var chunkACSVZPK7_cjs = require('./chunk-ACSVZPK7.cjs');
-var chunkWBUFJ7BS_cjs = require('./chunk-WBUFJ7BS.cjs');
-var chunkQB6VMOJ2_cjs = require('./chunk-QB6VMOJ2.cjs');
-var chunkZTAJL4DT_cjs = require('./chunk-ZTAJL4DT.cjs');
-var chunkA2I2XO52_cjs = require('./chunk-A2I2XO52.cjs');
+var chunkNK5Q7UNE_cjs = require('./chunk-NK5Q7UNE.cjs');
+var chunkXNLIZYRZ_cjs = require('./chunk-XNLIZYRZ.cjs');
+var chunkXMQSEJCF_cjs = require('./chunk-XMQSEJCF.cjs');
+var chunkPWLJ77UV_cjs = require('./chunk-PWLJ77UV.cjs');
+var chunkBSFJMMV3_cjs = require('./chunk-BSFJMMV3.cjs');
+var chunkNFCVHQ5P_cjs = require('./chunk-NFCVHQ5P.cjs');
+var chunkCXBHOOIQ_cjs = require('./chunk-CXBHOOIQ.cjs');
+var chunkE4WNQBEF_cjs = require('./chunk-E4WNQBEF.cjs');
+var chunkQ7Q4WSLJ_cjs = require('./chunk-Q7Q4WSLJ.cjs');
+var chunkU63GDNRC_cjs = require('./chunk-U63GDNRC.cjs');
 var chunkZY4GXIVN_cjs = require('./chunk-ZY4GXIVN.cjs');
-var chunk764JHTLT_cjs = require('./chunk-764JHTLT.cjs');
+var chunkVCRRKBLN_cjs = require('./chunk-VCRRKBLN.cjs');
 var chunkHAHNRASW_cjs = require('./chunk-HAHNRASW.cjs');
-var chunkQYWINYEA_cjs = require('./chunk-QYWINYEA.cjs');
-var chunkSVJ5GEXW_cjs = require('./chunk-SVJ5GEXW.cjs');
-var chunkDI74SMXS_cjs = require('./chunk-DI74SMXS.cjs');
-var chunkC4F7VJ5D_cjs = require('./chunk-C4F7VJ5D.cjs');
+var chunk7BQXPCGN_cjs = require('./chunk-7BQXPCGN.cjs');
+var chunkXUO3KQFO_cjs = require('./chunk-XUO3KQFO.cjs');
+var chunkNI72YOJB_cjs = require('./chunk-NI72YOJB.cjs');
+var chunkN66HCGCY_cjs = require('./chunk-N66HCGCY.cjs');
 var zod = require('zod');
 
 // src/ontology/core-meta-edges.ts
 function createMetaEdge(name, properties) {
   return Object.freeze({
-    [chunkEE7N5XXQ_cjs.META_EDGE_BRAND]: true,
+    [chunkNK5Q7UNE_cjs.META_EDGE_BRAND]: true,
     name,
     properties: {
       transitive: properties.transitive ?? false,
@@ -31,7 +34,7 @@ function createMetaEdge(name, properties) {
     }
   });
 }
-var subClassOfMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_SUB_CLASS_OF, {
+var subClassOfMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_SUB_CLASS_OF, {
   transitive: true,
   inference: "subsumption",
   description: "Type inheritance (Podcast subClassOf Media)"
@@ -43,9 +46,9 @@ function subClassOf(child, parent) {
     to: parent
   };
 }
-var broaderMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_BROADER, {
+var broaderMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_BROADER, {
   transitive: true,
-  inverse: chunkSVJ5GEXW_cjs.META_EDGE_NARROWER,
+  inverse: chunkXUO3KQFO_cjs.META_EDGE_NARROWER,
   inference: "hierarchy",
   description: "Broader concept (ML broader AI)"
 });
@@ -56,9 +59,9 @@ function broader(narrowerConcept, broaderConcept) {
     to: broaderConcept
   };
 }
-var narrowerMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_NARROWER, {
+var narrowerMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_NARROWER, {
   transitive: true,
-  inverse: chunkSVJ5GEXW_cjs.META_EDGE_BROADER,
+  inverse: chunkXUO3KQFO_cjs.META_EDGE_BROADER,
   inference: "hierarchy",
   description: "Narrower concept (AI narrower ML)"
 });
@@ -69,7 +72,7 @@ function narrower(broaderConcept, narrowerConcept) {
     to: narrowerConcept
   };
 }
-var relatedToMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_RELATED_TO, {
+var relatedToMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_RELATED_TO, {
   symmetric: true,
   inference: "association",
   description: "Non-hierarchical association"
@@ -81,7 +84,7 @@ function relatedTo(conceptA, conceptB) {
     to: conceptB
   };
 }
-var equivalentToMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_EQUIVALENT_TO, {
+var equivalentToMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_EQUIVALENT_TO, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -94,11 +97,11 @@ function equivalentTo(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var sameAsMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_SAME_AS, {
+var sameAsMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_SAME_AS, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
-  description: "Same individual (for deduplication)"
+  description: "Deprecated type-level equivalence alias"
 });
 function sameAs(kindA, kindBOrIri) {
   return {
@@ -107,10 +110,10 @@ function sameAs(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var differentFromMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_DIFFERENT_FROM, {
+var differentFromMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_DIFFERENT_FROM, {
   symmetric: true,
   inference: "constraint",
-  description: "Explicitly different individuals"
+  description: "Deprecated decorative type-level non-identity relation"
 });
 function differentFrom(kindA, kindB) {
   return {
@@ -119,7 +122,7 @@ function differentFrom(kindA, kindB) {
     to: kindB
   };
 }
-var disjointWithMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_DISJOINT_WITH, {
+var disjointWithMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_DISJOINT_WITH, {
   symmetric: true,
   inference: "constraint",
   description: "Mutually exclusive types"
@@ -131,9 +134,9 @@ function disjointWith(kindA, kindB) {
     to: kindB
   };
 }
-var partOfMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_PART_OF, {
+var partOfMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_PART_OF, {
   transitive: true,
-  inverse: chunkSVJ5GEXW_cjs.META_EDGE_HAS_PART,
+  inverse: chunkXUO3KQFO_cjs.META_EDGE_HAS_PART,
   inference: "composition",
   description: "X is part of Y"
 });
@@ -144,9 +147,9 @@ function partOf(part, whole) {
     to: whole
   };
 }
-var hasPartMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_HAS_PART, {
+var hasPartMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_HAS_PART, {
   transitive: true,
-  inverse: chunkSVJ5GEXW_cjs.META_EDGE_PART_OF,
+  inverse: chunkXUO3KQFO_cjs.META_EDGE_PART_OF,
   inference: "composition",
   description: "Y has part X"
 });
@@ -157,12 +160,12 @@ function hasPart(whole, part) {
     to: part
   };
 }
-var inverseOfMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_INVERSE_OF, {
+var inverseOfMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_INVERSE_OF, {
   symmetric: true,
   inference: "none",
   description: "Edge A is inverse of edge B"
 });
-var impliesMetaEdge = createMetaEdge(chunkSVJ5GEXW_cjs.META_EDGE_IMPLIES, {
+var impliesMetaEdge = createMetaEdge(chunkXUO3KQFO_cjs.META_EDGE_IMPLIES, {
   transitive: true,
   inference: "none",
   description: "Edge A implies edge B exists"
@@ -201,7 +204,9 @@ var core = {
   narrower,
   relatedTo,
   equivalentTo,
+  // eslint-disable-next-line @typescript-eslint/no-deprecated -- compatibility member until the next major
   sameAs,
+  // eslint-disable-next-line @typescript-eslint/no-deprecated -- compatibility member until the next major
   differentFrom,
   disjointWith,
   partOf,
@@ -215,6 +220,7 @@ function computeSchemaDiff(before, after) {
   const nodeChanges = diffNodes(before.nodes, after.nodes);
   const edgeChanges = diffEdges(before.edges, after.edges);
   const ontologyChanges = diffOntology(before.ontology, after.ontology);
+  const identityChange = diffIdentity(before.identity, after.identity);
   const indexChanges = diffIndexes(before.indexes, after.indexes);
   const extensionChange = diffExtension(before.extension, after.extension);
   const deprecatedKindsChange = diffDeprecatedKinds(
@@ -227,14 +233,13 @@ function computeSchemaDiff(before, after) {
     ...ontologyChanges,
     ...indexChanges
   ];
-  const hasBreakingChanges = allChanges.some(
-    (change) => change.severity === "breaking"
-  );
-  const hasChanges = allChanges.length > 0 || extensionChange !== void 0 || deprecatedKindsChange !== void 0;
+  const hasBreakingChanges = allChanges.some((change) => change.severity === "breaking") || identityChange?.severity === "breaking";
+  const hasChanges = allChanges.length > 0 || identityChange !== void 0 || extensionChange !== void 0 || deprecatedKindsChange !== void 0;
   const summary = generateSummary(
     nodeChanges,
     edgeChanges,
     ontologyChanges,
+    identityChange,
     indexChanges,
     extensionChange,
     deprecatedKindsChange
@@ -245,6 +250,7 @@ function computeSchemaDiff(before, after) {
     nodes: nodeChanges,
     edges: edgeChanges,
     ontology: ontologyChanges,
+    ...identityChange === void 0 ? {} : { identity: identityChange },
     indexes: indexChanges,
     ...extensionChange === void 0 ? {} : { extension: extensionChange },
     ...deprecatedKindsChange === void 0 ? {} : { deprecatedKinds: deprecatedKindsChange },
@@ -254,6 +260,29 @@ function computeSchemaDiff(before, after) {
     summary
   };
 }
+function diffIdentity(before, after) {
+  if (before === void 0 && after === void 0) return;
+  if (before === void 0) {
+    return {
+      type: "added",
+      severity: "safe",
+      details: "Operational Identity enabled"
+    };
+  }
+  if (after === void 0) {
+    return {
+      type: "removed",
+      severity: "breaking",
+      details: "Operational Identity disabled"
+    };
+  }
+  if (before.sameIdAcrossKinds === after.sameIdAcrossKinds) return;
+  return {
+    type: "modified",
+    severity: "breaking",
+    details: `Operational Identity sameIdAcrossKinds changed from "${before.sameIdAcrossKinds}" to "${after.sameIdAcrossKinds}"`
+  };
+}
 function diffNodes(before, after) {
   const changes = [];
   const beforeNames = new Set(Object.keys(before));
@@ -282,8 +311,8 @@ function diffNodes(before, after) {
   }
   for (const name of beforeNames) {
     if (afterNames.has(name)) {
-      const nodeBefore = chunk764JHTLT_cjs.requireDefined(before[name]);
-      const nodeAfter = chunk764JHTLT_cjs.requireDefined(after[name]);
+      const nodeBefore = chunkN66HCGCY_cjs.requireDefined(before[name]);
+      const nodeAfter = chunkN66HCGCY_cjs.requireDefined(after[name]);
       const nodeChanges = diffNodeDef(name, nodeBefore, nodeAfter);
       changes.push(...nodeChanges);
     }
@@ -317,11 +346,11 @@ var SUBSCHEMA_MAP_KEYWORDS = /* @__PURE__ */ new Set([
 ]);
 var DEPENDENT_REQUIRED_KEYWORD = "dependentRequired";
 function canonicalKey(value) {
-  return JSON.stringify(value, chunkACSVZPK7_cjs.sortedReplacer);
+  return JSON.stringify(value, chunkPWLJ77UV_cjs.sortedReplacer);
 }
 function sortedByCanonicalForm(items) {
   return items.toSorted(
-    (left, right) => chunkTRF4EBJT_cjs.compareStrings(canonicalKey(left), canonicalKey(right))
+    (left, right) => chunkXMQSEJCF_cjs.compareStrings(canonicalKey(left), canonicalKey(right))
   );
 }
 function orderNormalizedSchema(value) {
@@ -329,7 +358,7 @@ function orderNormalizedSchema(value) {
     return value.map((item) => orderNormalizedSchema(item));
   }
   if (value !== null && typeof value === "object") {
-    const normalized = {};
+    const normalized = chunkN66HCGCY_cjs.createDataKeyedBag();
     for (const [key, entry] of Object.entries(value)) {
       normalized[key] = normalizedKeywordValue(key, entry);
     }
@@ -352,7 +381,7 @@ function normalizedDependentRequired(value) {
   if (value === null || typeof value !== "object" || Array.isArray(value)) {
     return value;
   }
-  const normalized = {};
+  const normalized = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [name, required] of Object.entries(value)) {
     normalized[name] = Array.isArray(required) ? sortedByCanonicalForm(required) : required;
   }
@@ -362,20 +391,20 @@ function normalizedSubschemaMap(value) {
   if (value === null || typeof value !== "object" || Array.isArray(value)) {
     return orderNormalizedSchema(value);
   }
-  const normalized = {};
+  const normalized = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [name, subschema] of Object.entries(value)) {
     normalized[name] = orderNormalizedSchema(subschema);
   }
   return normalized;
 }
 function propertySchemasEqual(before, after) {
-  return chunkACSVZPK7_cjs.canonicalEqual(
+  return chunkPWLJ77UV_cjs.canonicalEqual(
     orderNormalizedSchema(before),
     orderNormalizedSchema(after)
   );
 }
 function endpointKindsEqual(before, after) {
-  return chunkACSVZPK7_cjs.canonicalEqual(before?.toSorted(), after?.toSorted());
+  return chunkPWLJ77UV_cjs.canonicalEqual(before?.toSorted(), after?.toSorted());
 }
 function diffNodeDef(name, before, after) {
   const changes = [];
@@ -404,7 +433,7 @@ function diffNodeDef(name, before, after) {
       after
     });
   }
-  if (!chunkACSVZPK7_cjs.canonicalEqual(before.uniqueConstraints, after.uniqueConstraints)) {
+  if (!chunkPWLJ77UV_cjs.canonicalEqual(before.uniqueConstraints, after.uniqueConstraints)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -442,7 +471,7 @@ var NON_CONSTRAINING_KEYWORDS = /* @__PURE__ */ new Set([
   "$schema"
 ]);
 function stripSchemaMetadata(schema) {
-  const stripped = {};
+  const stripped = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [key, value] of Object.entries(schema)) {
     if (!NON_CONSTRAINING_KEYWORDS.has(key)) stripped[key] = value;
   }
@@ -472,7 +501,7 @@ function isBreakingObjectSchemaChange(before, after) {
   const beforeRequired = new Set(before.required);
   const afterRequired = new Set(after.required);
   for (const key of Object.keys(beforeProps)) {
-    if (!(key in afterProps)) return true;
+    if (!chunkN66HCGCY_cjs.hasOwnKey(afterProps, key)) return true;
   }
   for (const key of afterRequired) {
     if (!beforeRequired.has(key)) return true;
@@ -489,14 +518,20 @@ function classifyPropertyChanges(kind, before, after) {
   const afterProps = after.properties ?? {};
   const beforeRequired = new Set(before.required);
   const afterRequired = new Set(after.required);
-  const removed = Object.keys(beforeProps).filter((p) => !(p in afterProps));
-  const added = Object.keys(afterProps).filter((p) => !(p in beforeProps));
-  const newRequired = [...afterRequired].filter((p) => !beforeRequired.has(p));
+  const removed = Object.keys(beforeProps).filter(
+    (property) => !chunkN66HCGCY_cjs.hasOwnKey(afterProps, property)
+  );
+  const added = Object.keys(afterProps).filter(
+    (property) => !chunkN66HCGCY_cjs.hasOwnKey(beforeProps, property)
+  );
+  const newRequired = [...afterRequired].filter(
+    (property) => !beforeRequired.has(property)
+  );
   const breakingProps = [];
   for (const [property, beforeProperty] of Object.entries(beforeProps)) {
     const afterProperty = afterProps[property];
     if (afterProperty === void 0) continue;
-    if (chunkACSVZPK7_cjs.canonicalEqual(beforeProperty, afterProperty)) continue;
+    if (chunkPWLJ77UV_cjs.canonicalEqual(beforeProperty, afterProperty)) continue;
     if (isBreakingPropertyChange(beforeProperty, afterProperty)) {
       breakingProps.push(property);
     }
@@ -555,8 +590,8 @@ function diffEdges(before, after) {
   }
   for (const name of beforeNames) {
     if (afterNames.has(name)) {
-      const edgeBefore = chunk764JHTLT_cjs.requireDefined(before[name]);
-      const edgeAfter = chunk764JHTLT_cjs.requireDefined(after[name]);
+      const edgeBefore = chunkN66HCGCY_cjs.requireDefined(before[name]);
+      const edgeAfter = chunkN66HCGCY_cjs.requireDefined(after[name]);
       const edgeChanges = diffEdgeDef(name, edgeBefore, edgeAfter);
       changes.push(...edgeChanges);
     }
@@ -625,7 +660,7 @@ function diffEdgeDef(name, before, after) {
 function annotationsChanged(before, after) {
   if (before === void 0 && after === void 0) return false;
   if (before === void 0 || after === void 0) return true;
-  return !chunkACSVZPK7_cjs.canonicalEqual(before, after);
+  return !chunkPWLJ77UV_cjs.canonicalEqual(before, after);
 }
 function diffOntology(before, after) {
   const changes = [];
@@ -724,7 +759,7 @@ function diffIndexes(before, after) {
   for (const [name, beforeIndex] of beforeByName) {
     const afterIndex = afterByName.get(name);
     if (!afterIndex) continue;
-    if (!chunkACSVZPK7_cjs.canonicalEqual(beforeIndex, afterIndex)) {
+    if (!chunkPWLJ77UV_cjs.canonicalEqual(beforeIndex, afterIndex)) {
       changes.push({
         type: "modified",
         name,
@@ -754,7 +789,7 @@ function diffExtension(before, after) {
       details: "Graph extension document was removed"
     };
   }
-  if (chunkACSVZPK7_cjs.canonicalEqual(before, after)) return void 0;
+  if (chunkPWLJ77UV_cjs.canonicalEqual(before, after)) return void 0;
   return {
     type: "modified",
     severity: "safe",
@@ -785,7 +820,7 @@ function diffDeprecatedKinds(before, after) {
     details: `Deprecated kinds: ${parts.join("; ")}`
   };
 }
-function generateSummary(nodeChanges, edgeChanges, ontologyChanges, indexChanges, extensionChange, deprecatedKindsChange) {
+function generateSummary(nodeChanges, edgeChanges, ontologyChanges, identityChange, indexChanges, extensionChange, deprecatedKindsChange) {
   const parts = [];
   const nodeAdded = nodeChanges.filter((c) => c.type === "added").length;
   const nodeRemoved = nodeChanges.filter((c) => c.type === "removed").length;
@@ -812,6 +847,9 @@ function generateSummary(nodeChanges, edgeChanges, ontologyChanges, indexChanges
   if (ontologyAdded > 0 || ontologyRemoved > 0) {
     parts.push(`Ontology: ${ontologyAdded} added, ${ontologyRemoved} removed`);
   }
+  if (identityChange !== void 0) {
+    parts.push(`Identity: ${identityChange.type}`);
+  }
   const indexAdded = indexChanges.filter((c) => c.type === "added").length;
   const indexRemoved = indexChanges.filter((c) => c.type === "removed").length;
   const indexModified = indexChanges.filter(
@@ -860,419 +898,30 @@ function getMigrationActions(diff) {
       actions.push(`DELETE data for removed edge kind "${change.kind}"`);
     }
   }
-  return actions;
-}
-
-// src/registry/kind-registry.ts
-var KindRegistry = class {
-  // === Node & Edge Kinds ===
-  nodeKinds;
-  edgeKinds;
-  // === Subsumption (subClassOf) ===
-  // Transitive closure for inheritance
-  subClassAncestors;
-  subClassDescendants;
-  // === Hierarchy (broader/narrower) ===
-  // Transitive closure for concept hierarchy (separate from subClassOf!)
-  broaderClosure;
-  narrowerClosure;
-  // === Equivalence ===
-  equivalenceSets;
-  iriToKind;
-  // === Constraints ===
-  disjointPairs;
-  // Normalized pairs: "Organization|Person"
-  // === Composition ===
-  partOfClosure;
-  hasPartClosure;
-  // === Edge Relationships ===
-  edgeInverses;
-  edgeImplicationsClosure;
-  edgeImplyingClosure;
-  constructor(nodeKinds, edgeKinds, closures) {
-    this.nodeKinds = nodeKinds;
-    this.edgeKinds = edgeKinds;
-    this.subClassAncestors = closures.subClassAncestors;
-    this.subClassDescendants = closures.subClassDescendants;
-    this.broaderClosure = closures.broaderClosure;
-    this.narrowerClosure = closures.narrowerClosure;
-    this.equivalenceSets = closures.equivalenceSets;
-    this.iriToKind = closures.iriToKind;
-    this.disjointPairs = closures.disjointPairs;
-    this.partOfClosure = closures.partOfClosure;
-    this.hasPartClosure = closures.hasPartClosure;
-    this.edgeInverses = closures.edgeInverses;
-    this.edgeImplicationsClosure = closures.edgeImplicationsClosure;
-    this.edgeImplyingClosure = closures.edgeImplyingClosure;
-  }
-  // === Subsumption Methods ===
-  /**
-   * Checks if child is a subclass of parent (directly or transitively).
-   */
-  isSubClassOf(child, parent) {
-    return chunkQYWINYEA_cjs.isReachable(this.subClassAncestors, child, parent);
-  }
-  /**
-   * Expands a kind to include all its subclasses.
-   * Returns [kind, ...subclasses].
-   */
-  expandSubClasses(kind) {
-    const descendants = this.subClassDescendants.get(kind) ?? /* @__PURE__ */ new Set();
-    return [kind, ...descendants];
-  }
-  /**
-   * Gets all ancestors of a kind (via subClassOf).
-   */
-  getAncestors(kind) {
-    return this.subClassAncestors.get(kind) ?? /* @__PURE__ */ new Set();
-  }
-  /**
-   * Gets all descendants of a kind (via subClassOf).
-   */
-  getDescendants(kind) {
-    return this.subClassDescendants.get(kind) ?? /* @__PURE__ */ new Set();
-  }
-  // === Hierarchy Methods ===
-  /**
-   * Checks if narrowerConcept is narrower than broaderConcept.
-   */
-  isNarrowerThan(narrowerConcept, broaderConcept) {
-    return chunkQYWINYEA_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
-  }
-  /**
-   * Checks if broaderConcept is broader than narrowerConcept.
-   */
-  isBroaderThan(broaderConcept, narrowerConcept) {
-    return chunkQYWINYEA_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
-  }
-  /**
-   * Expands to include all narrower concepts.
-   */
-  expandNarrower(kind) {
-    const narrower2 = this.narrowerClosure.get(kind) ?? /* @__PURE__ */ new Set();
-    return [kind, ...narrower2];
-  }
-  /**
-   * Expands to include all broader concepts.
-   */
-  expandBroader(kind) {
-    const broader2 = this.broaderClosure.get(kind) ?? /* @__PURE__ */ new Set();
-    return [kind, ...broader2];
-  }
-  // === Equivalence Methods ===
-  /**
-   * Checks if two kinds are equivalent.
-   */
-  areEquivalent(a, b) {
-    const equivalents = this.equivalenceSets.get(a);
-    return equivalents?.has(b) ?? false;
-  }
-  /**
-   * Gets all equivalents of a kind (including external IRIs).
-   */
-  getEquivalents(kind) {
-    const equivalents = this.equivalenceSets.get(kind);
-    return equivalents ? [...equivalents] : [];
-  }
-  /**
-   * Resolves an external IRI to an internal kind name.
-   */
-  resolveIri(iri) {
-    return this.iriToKind.get(iri);
-  }
-  // === Constraint Methods ===
-  /**
-   * Checks if two kinds are disjoint.
-   */
-  areDisjoint(a, b) {
-    const normalizedPair = a < b ? `${a}|${b}` : `${b}|${a}`;
-    return this.disjointPairs.has(normalizedPair);
-  }
-  /**
-   * Gets all kinds that are disjoint with the given kind.
-   */
-  getDisjointKinds(kind) {
-    const result = [];
-    for (const pair of this.disjointPairs) {
-      const parts = pair.split("|");
-      const firstKind = chunk764JHTLT_cjs.requireDefined(parts[0]);
-      const secondKind = chunk764JHTLT_cjs.requireDefined(parts[1]);
-      if (firstKind === kind) result.push(secondKind);
-      else if (secondKind === kind) result.push(firstKind);
-    }
-    return result;
-  }
-  // === Composition Methods ===
-  /**
-   * Checks if part is part of whole (directly or transitively).
-   */
-  isPartOf(part, whole) {
-    return chunkQYWINYEA_cjs.isReachable(this.partOfClosure, part, whole);
-  }
-  /**
-   * Gets all wholes that contain this part.
-   */
-  getWholes(part) {
-    const wholes = this.partOfClosure.get(part);
-    return wholes ? [...wholes] : [];
-  }
-  /**
-   * Gets all parts of this whole.
-   */
-  getParts(whole) {
-    const parts = this.hasPartClosure.get(whole);
-    return parts ? [...parts] : [];
-  }
-  // === Edge Relationship Methods ===
-  /**
-   * Gets the inverse edge kind for a given edge kind.
-   * If edgeA inverseOf edgeB, then getInverseEdge("edgeA") returns "edgeB".
-   */
-  getInverseEdge(edgeKind) {
-    return this.edgeInverses.get(edgeKind);
-  }
-  /**
-   * Gets all edges implied by a given edge (transitively).
-   * If A implies B and B implies C, then getImpliedEdges("A") returns ["B", "C"].
-   */
-  getImpliedEdges(edgeKind) {
-    const implied = this.edgeImplicationsClosure.get(edgeKind);
-    return implied ? [...implied] : [];
-  }
-  /**
-   * Gets all edges that imply a given edge (transitively).
-   * If A implies B and B implies C, then getImplyingEdges("C") returns ["A", "B"].
-   * Used for query-time expansion: when querying for C, also include A and B edges.
-   */
-  getImplyingEdges(edgeKind) {
-    const implying = this.edgeImplyingClosure.get(edgeKind);
-    return implying ? [...implying] : [];
-  }
-  /**
-   * Expands an edge kind to include all edges that imply it.
-   * Returns [edgeKind, ...implyingEdges].
-   */
-  expandImplyingEdges(edgeKind) {
-    const implying = this.edgeImplyingClosure.get(edgeKind) ?? /* @__PURE__ */ new Set();
-    return [edgeKind, ...implying];
-  }
-  // === Edge Endpoint Validation ===
-  /**
-   * Checks if a concrete kind is assignable to a target kind.
-   * Uses subsumption: Company is assignable to Organization if Company subClassOf Organization.
-   */
-  isAssignableTo(concreteKind, targetKind) {
-    if (concreteKind === targetKind) return true;
-    return this.isSubClassOf(concreteKind, targetKind);
-  }
-  /**
-   * Checks if a concrete kind is assignable to at least one of the given
-   * target kinds. Shared by every "is this kind usable where one of these
-   * kinds is expected" check (edge endpoint validation, ontology relation
-   * endpoint compatibility) so they can't independently drift.
-   */
-  isAssignableToAny(concreteKind, targetKinds) {
-    return targetKinds.some(
-      (targetKind) => this.isAssignableTo(concreteKind, targetKind)
-    );
-  }
-  /**
-   * Validates that a kind exists in the registry.
-   */
-  hasNodeType(name) {
-    return this.nodeKinds.has(name);
-  }
-  /**
-   * Validates that an edge kind exists in the registry.
-   */
-  hasEdgeType(name) {
-    return this.edgeKinds.has(name);
-  }
-  /**
-   * Gets a node kind by name.
-   */
-  getNodeType(name) {
-    return this.nodeKinds.get(name);
-  }
-  /**
-   * Gets an edge kind by name.
-   */
-  getEdgeType(name) {
-    return this.edgeKinds.get(name);
-  }
-};
-function createEmptyClosures() {
-  return {
-    subClassAncestors: /* @__PURE__ */ new Map(),
-    subClassDescendants: /* @__PURE__ */ new Map(),
-    broaderClosure: /* @__PURE__ */ new Map(),
-    narrowerClosure: /* @__PURE__ */ new Map(),
-    equivalenceSets: /* @__PURE__ */ new Map(),
-    iriToKind: /* @__PURE__ */ new Map(),
-    disjointPairs: /* @__PURE__ */ new Set(),
-    partOfClosure: /* @__PURE__ */ new Map(),
-    hasPartClosure: /* @__PURE__ */ new Map(),
-    edgeInverses: /* @__PURE__ */ new Map(),
-    edgeImplicationsClosure: /* @__PURE__ */ new Map(),
-    edgeImplyingClosure: /* @__PURE__ */ new Map()
-  };
-}
-function computeClosuresFromOntology(ontology) {
-  const subClassRelations = [];
-  const broaderRelations = [];
-  const equivalentRelations = [];
-  const disjointRelations = [];
-  const partOfRelations = [];
-  const inverseOfRelations = [];
-  const impliesRelations = [];
-  for (const relation of ontology) {
-    const fromName = getKindName(relation.from);
-    const toName = getKindName(relation.to);
-    switch (relation.metaEdge.name) {
-      case chunkSVJ5GEXW_cjs.META_EDGE_SUB_CLASS_OF: {
-        subClassRelations.push([fromName, toName]);
-        break;
-      }
-      case chunkSVJ5GEXW_cjs.META_EDGE_BROADER: {
-        broaderRelations.push([fromName, toName]);
-        break;
-      }
-      case chunkSVJ5GEXW_cjs.META_EDGE_NARROWER: {
-        broaderRelations.push([toName, fromName]);
-        break;
-      }
-      case chunkSVJ5GEXW_cjs.META_EDGE_EQUIVALENT_TO:
-      case chunkSVJ5GEXW_cjs.META_EDGE_SAME_AS: {
-        equivalentRelations.push([fromName, toName]);
+  if (diff.identity !== void 0) {
+    switch (diff.identity.type) {
+      case "added": {
+        actions.push(
+          `BUILD Operational Identity closure: ${diff.identity.details} (materializes the closure table, running a same-id fold scan when sameIdAcrossKinds is "fold")`
+        );
         break;
       }
-      case chunkSVJ5GEXW_cjs.META_EDGE_DISJOINT_WITH: {
-        disjointRelations.push([fromName, toName]);
+      case "modified": {
+        actions.push(
+          `REBUILD Operational Identity closure: ${diff.identity.details} (every areSame/membersOf/includeIdentityMembers answer is recomputed under the new profile)`
+        );
         break;
       }
-      case chunkSVJ5GEXW_cjs.META_EDGE_PART_OF: {
-        partOfRelations.push([fromName, toName]);
+      case "removed": {
+        actions.push(
+          `DISABLE Operational Identity: ${diff.identity.details} (the materialized closure is left in place, unread; the identity API becomes unavailable)`
+        );
         break;
       }
-      case chunkSVJ5GEXW_cjs.META_EDGE_HAS_PART: {
-        partOfRelations.push([toName, fromName]);
-        break;
-      }
-      case chunkSVJ5GEXW_cjs.META_EDGE_INVERSE_OF: {
-        inverseOfRelations.push([fromName, toName]);
-        break;
-      }
-      case chunkSVJ5GEXW_cjs.META_EDGE_IMPLIES: {
-        impliesRelations.push([fromName, toName]);
-        break;
-      }
-    }
-  }
-  const subClassAncestors = chunkQYWINYEA_cjs.computeTransitiveClosure(subClassRelations);
-  const subClassDescendants = chunkQYWINYEA_cjs.invertClosure(subClassAncestors);
-  const broaderClosure = chunkQYWINYEA_cjs.computeTransitiveClosure(broaderRelations);
-  const narrowerClosure = chunkQYWINYEA_cjs.invertClosure(broaderClosure);
-  const equivalenceSets = computeEquivalenceSets(equivalentRelations);
-  const iriToKind = computeIriMapping(equivalentRelations);
-  const disjointPairs = computeDisjointPairs(disjointRelations);
-  const partOfClosure = chunkQYWINYEA_cjs.computeTransitiveClosure(partOfRelations);
-  const hasPartClosure = chunkQYWINYEA_cjs.invertClosure(partOfClosure);
-  const edgeInverses = computeEdgeInverses(inverseOfRelations);
-  const edgeImplicationsClosure = chunkQYWINYEA_cjs.computeTransitiveClosure(impliesRelations);
-  const edgeImplyingClosure = chunkQYWINYEA_cjs.invertClosure(edgeImplicationsClosure);
-  return {
-    subClassAncestors,
-    subClassDescendants,
-    broaderClosure,
-    narrowerClosure,
-    equivalenceSets,
-    iriToKind,
-    disjointPairs,
-    partOfClosure,
-    hasPartClosure,
-    edgeInverses,
-    edgeImplicationsClosure,
-    edgeImplyingClosure
-  };
-}
-function getKindName(kindOrIri) {
-  if (typeof kindOrIri === "string") {
-    return kindOrIri;
-  }
-  return kindOrIri.kind;
-}
-function isExternalIri(value) {
-  return value.startsWith("http://") || value.startsWith("https://");
-}
-function computeEquivalenceSets(relations) {
-  const parent = /* @__PURE__ */ new Map();
-  function find(x) {
-    if (!parent.has(x)) {
-      parent.set(x, x);
-      return x;
-    }
-    const parentNode = chunk764JHTLT_cjs.requireDefined(parent.get(x));
-    if (parentNode === x) return x;
-    const root = find(parentNode);
-    parent.set(x, root);
-    return root;
-  }
-  function union(a, b) {
-    const rootA = find(a);
-    const rootB = find(b);
-    if (rootA !== rootB) {
-      parent.set(rootA, rootB);
-    }
-  }
-  for (const [a, b] of relations) {
-    union(a, b);
-  }
-  const classes = /* @__PURE__ */ new Map();
-  for (const key of parent.keys()) {
-    const root = find(key);
-    const existing = classes.get(root) ?? /* @__PURE__ */ new Set();
-    existing.add(key);
-    classes.set(root, existing);
-  }
-  const result = /* @__PURE__ */ new Map();
-  for (const members of classes.values()) {
-    for (const member of members) {
-      const others = new Set(members);
-      others.delete(member);
-      result.set(member, others);
-    }
-  }
-  return result;
-}
-function computeIriMapping(relations) {
-  const result = /* @__PURE__ */ new Map();
-  for (const [a, b] of relations) {
-    if (isExternalIri(a) && !isExternalIri(b)) {
-      result.set(a, b);
-    } else if (isExternalIri(b) && !isExternalIri(a)) {
-      result.set(b, a);
     }
   }
-  return result;
-}
-function computeDisjointPairs(relations) {
-  const result = /* @__PURE__ */ new Set();
-  for (const [a, b] of relations) {
-    const normalized = a < b ? `${a}|${b}` : `${b}|${a}`;
-    result.add(normalized);
-  }
-  return result;
-}
-function computeEdgeInverses(relations) {
-  const result = /* @__PURE__ */ new Map();
-  for (const [a, b] of relations) {
-    result.set(a, b);
-    result.set(b, a);
-  }
-  return result;
+  return actions;
 }
-
-// src/schema/serializer.ts
 function serializeSchema(graph, version) {
   const nodes = serializeNodes(graph);
   const edges = serializeEdges(graph);
@@ -1283,7 +932,7 @@ function serializeSchema(graph, version) {
   return {
     graphId: graph.id,
     version,
-    generatedAt: chunkZTAJL4DT_cjs.nowIso(),
+    generatedAt: chunkQ7Q4WSLJ_cjs.nowIso(),
     nodes,
     edges,
     ontology,
@@ -1291,6 +940,7 @@ function serializeSchema(graph, version) {
       onNodeDelete: graph.defaults.onNodeDelete,
       temporalMode: graph.defaults.temporalMode
     },
+    ...graph.identity === void 0 ? {} : { identity: graph.identity },
     // `serializeIndexes` collapses both absent and empty inputs to
     // `undefined` (see the helper's docstring); omit the field entirely
     // in that case so legacy graphs hash byte-identically to the
@@ -1314,7 +964,7 @@ function serializeDeprecatedKinds(set) {
 function canonicalExtension(document) {
   if (document === void 0) return void 0;
   if (document.version === void 0) return document;
-  if (document.version !== chunkQYWINYEA_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
+  if (document.version !== chunk7BQXPCGN_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
   const { version: _omit, ...rest } = document;
   return rest;
 }
@@ -1399,13 +1049,13 @@ function serializeEdgeIndexDeclaration(declaration) {
   };
 }
 function serializeNodes(graph) {
-  const result = {};
-  for (const kindName of chunkQB6VMOJ2_cjs.getNodeKinds(graph)) {
+  const result = chunkN66HCGCY_cjs.createDataKeyedBag();
+  for (const kindName of chunkCXBHOOIQ_cjs.getNodeKinds(graph)) {
     const registration = graph.nodes[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeNodeDef(registration);
   }
-  return result;
+  return { ...result };
 }
 function serializeNodeDef(registration) {
   const node = registration.type;
@@ -1429,26 +1079,16 @@ function serializeUniqueConstraints(constraints) {
   }));
 }
 function serializeWherePredicate(whereFunction) {
-  const builder = new Proxy(
-    {},
-    {
-      get(_target, field) {
-        return {
-          isNull: () => ({
-            __type: "unique_predicate",
-            field,
-            op: "isNull"
-          }),
-          isNotNull: () => ({
-            __type: "unique_predicate",
-            field,
-            op: "isNotNull"
-          })
-        };
+  const predicate = chunkE4WNQBEF_cjs.captureWherePredicate(whereFunction);
+  if (predicate === void 0) {
+    throw new chunkNI72YOJB_cjs.ConfigurationError(
+      `A unique constraint's \`where\` callback did not return a predicate, so it cannot be persisted.`,
+      {},
+      {
+        suggestion: `Return a field predicate, e.g. \`where: (fields) => fields.someField.isNotNull()\`.`
       }
-    }
-  );
-  const predicate = whereFunction(builder);
+    );
+  }
   return JSON.stringify({ field: predicate.field, op: predicate.op });
 }
 function deserializeWherePredicate(serialized) {
@@ -1467,13 +1107,13 @@ function deserializeWherePredicate(serialized) {
   };
 }
 function serializeEdges(graph) {
-  const result = {};
-  for (const kindName of chunkQB6VMOJ2_cjs.getEdgeKinds(graph)) {
+  const result = chunkN66HCGCY_cjs.createDataKeyedBag();
+  for (const kindName of chunkCXBHOOIQ_cjs.getEdgeKinds(graph)) {
     const registration = graph.edges[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeEdgeDef(registration);
   }
-  return result;
+  return { ...result };
 }
 function serializeEdgeDef(registration) {
   const edge = registration.type;
@@ -1497,7 +1137,7 @@ function serializeOntology(relations) {
       metaEdgeMap.set(metaEdge.name, metaEdge);
     }
   }
-  const metaEdges = {};
+  const metaEdges = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [name, metaEdge] of metaEdgeMap) {
     metaEdges[name] = serializeMetaEdge(metaEdge);
   }
@@ -1506,7 +1146,7 @@ function serializeOntology(relations) {
   );
   const closures = serializeClosures(relations);
   return {
-    metaEdges,
+    metaEdges: { ...metaEdges },
     relations: serializedRelations,
     closures
   };
@@ -1525,8 +1165,8 @@ function serializeMetaEdge(metaEdge) {
 function serializeOntologyRelation(relation) {
   return {
     metaEdge: relation.metaEdge.name,
-    from: chunkEE7N5XXQ_cjs.getTypeName(relation.from),
-    to: chunkEE7N5XXQ_cjs.getTypeName(relation.to)
+    from: chunkNK5Q7UNE_cjs.getTypeName(relation.from),
+    to: chunkNK5Q7UNE_cjs.getTypeName(relation.to)
   };
 }
 function serializeClosures(relations) {
@@ -1546,7 +1186,7 @@ function serializeClosures(relations) {
       edgeImplyingClosure: {}
     };
   }
-  const computed = computeClosuresFromOntology(relations);
+  const computed = chunk7BQXPCGN_cjs.computeClosuresFromOntology(relations);
   return {
     subClassAncestors: mapToRecord(computed.subClassAncestors),
     subClassDescendants: mapToRecord(computed.subClassDescendants),
@@ -1563,11 +1203,11 @@ function serializeClosures(relations) {
   };
 }
 function mapToRecord(map) {
-  const result = {};
+  const result = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [key, values] of map) {
     result[key] = [...values];
   }
-  return result;
+  return { ...result };
 }
 function mapToSimpleRecord(map) {
   return Object.fromEntries(map);
@@ -1608,11 +1248,12 @@ async function computeSchemaHash(schema) {
     edges: schema.edges,
     ontology: schema.ontology,
     defaults: schema.defaults,
+    ...schema.identity === void 0 ? {} : { identity: schema.identity },
     ...schema.indexes === void 0 ? {} : { indexes: schema.indexes },
     ...schema.extension === void 0 ? {} : { extension: schema.extension },
     ...schema.deprecatedKinds === void 0 ? {} : { deprecatedKinds: schema.deprecatedKinds }
   };
-  const json = JSON.stringify(hashable, chunkACSVZPK7_cjs.sortedReplacer);
+  const json = JSON.stringify(hashable, chunkPWLJ77UV_cjs.sortedReplacer);
   return chunkZY4GXIVN_cjs.sha256Hex(json);
 }
 var COMPILE_NODE_CACHE = /* @__PURE__ */ new Map();
@@ -1659,9 +1300,9 @@ function compileNodeCached(kindName, document) {
 }
 function compileNode(kindName, document) {
   const schema = buildObjectSchema(document.properties);
-  const type = chunkEE7N5XXQ_cjs.defineNode(
+  const type = chunkNK5Q7UNE_cjs.defineNode(
     kindName,
-    chunkDI74SMXS_cjs.compactUndefined({
+    chunkN66HCGCY_cjs.compactUndefined({
       schema,
       description: document.description,
       annotations: document.annotations
@@ -1685,7 +1326,7 @@ function compileEdge(kindName, document, nodeTypeByName) {
     (name) => nodeTypeByName.get(name) ?? name
   );
   return Object.freeze(
-    chunkDI74SMXS_cjs.compactUndefined({
+    chunkN66HCGCY_cjs.compactUndefined({
       kindName,
       schema,
       description: document.description,
@@ -1696,7 +1337,7 @@ function compileEdge(kindName, document, nodeTypeByName) {
   );
 }
 function buildObjectSchema(properties) {
-  const shape = {};
+  const shape = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [propertyName, propertyType] of Object.entries(properties)) {
     shape[propertyName] = applyOptional(
       compileProperty(propertyType),
@@ -1819,7 +1460,7 @@ function makeWherePredicate(field, op) {
   };
 }
 var META_EDGE_BY_NAME = Object.fromEntries(
-  chunkSVJ5GEXW_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
+  chunkXUO3KQFO_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
 );
 function compileOntologyRelation(relation, nodeTypeByName) {
   const metaEdge = META_EDGE_BY_NAME[relation.metaEdge];
@@ -1837,7 +1478,7 @@ function graphExtensionOntologyKey(entry) {
   return `${entry.metaEdge}|${entry.from}|${entry.to}`;
 }
 function compileTimeOntologyKey(relation) {
-  return `${relation.metaEdge.name}|${chunkEE7N5XXQ_cjs.getTypeName(relation.from)}|${chunkEE7N5XXQ_cjs.getTypeName(relation.to)}`;
+  return `${relation.metaEdge.name}|${chunkNK5Q7UNE_cjs.getTypeName(relation.from)}|${chunkNK5Q7UNE_cjs.getTypeName(relation.to)}`;
 }
 function buildGraphExtensionOntologyKeySet(document) {
   return new Set(
@@ -1855,10 +1496,10 @@ function extensionKindNames(document) {
 function mergeGraphExtension(graph, document) {
   const existingDocument = graph.extension ?? Object.freeze({});
   const unionDocument = unionDocuments(existingDocument, document);
-  if (graph.extension !== void 0 && chunkACSVZPK7_cjs.canonicalEqual(unionDocument, existingDocument)) {
+  if (graph.extension !== void 0 && chunkPWLJ77UV_cjs.canonicalEqual(unionDocument, existingDocument)) {
     return graph;
   }
-  const validatedUnion = chunkQYWINYEA_cjs.unwrap(chunkQYWINYEA_cjs.validateGraphExtension(unionDocument));
+  const validatedUnion = chunk7BQXPCGN_cjs.unwrap(chunk7BQXPCGN_cjs.validateGraphExtension(unionDocument));
   const compiled = compileGraphExtension(validatedUnion);
   const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } = extensionKindNames(existingDocument);
   const nodeKinds = /* @__PURE__ */ new Map();
@@ -1875,7 +1516,7 @@ function mergeGraphExtension(graph, document) {
     );
     nodeKinds.set(node.type.kind, node.type);
   }
-  const mergedNodes = {};
+  const mergedNodes = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [name, registration] of Object.entries(graph.nodes)) {
     if (runtimeNodeNames.has(name)) continue;
     mergedNodes[name] = registration;
@@ -1886,7 +1527,7 @@ function mergeGraphExtension(graph, document) {
       ...node.unique.length === 0 ? {} : { unique: [...node.unique] }
     };
   }
-  const mergedEdges = {};
+  const mergedEdges = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [name, registration] of Object.entries(graph.edges)) {
     if (runtimeEdgeNames.has(name)) continue;
     mergedEdges[name] = registration;
@@ -1895,7 +1536,7 @@ function mergeGraphExtension(graph, document) {
     assertNoCollision(
       edge.kindName,
       "edge",
-      mergedEdges[edge.kindName] !== void 0,
+      chunkN66HCGCY_cjs.hasOwnKey(mergedEdges, edge.kindName),
       graph.id
     );
     const from = resolveEndpoints(edge.from, nodeKinds, {
@@ -1908,9 +1549,9 @@ function mergeGraphExtension(graph, document) {
       edgeKind: edge.kindName,
       side: "to"
     });
-    const type = chunkEE7N5XXQ_cjs.defineEdge(
+    const type = chunkNK5Q7UNE_cjs.defineEdge(
       edge.kindName,
-      chunkDI74SMXS_cjs.compactUndefined({
+      chunkN66HCGCY_cjs.compactUndefined({
         schema: edge.schema,
         description: edge.description,
         annotations: edge.annotations,
@@ -1927,7 +1568,7 @@ function mergeGraphExtension(graph, document) {
   const mergedOntology = [
     ...compileTimeOntology,
     ...compiled.ontology.map(
-      (relation) => resolveOntologyEndpoints(relation, nodeKinds)
+      (relation) => resolveOntologyEndpoints(relation, nodeKinds, mergedEdges, graph.id)
     )
   ];
   const runtimeVectorIndexes = deriveGraphExtensionVectorIndexes(compiled.nodes);
@@ -1944,8 +1585,8 @@ function mergeGraphExtension(graph, document) {
   );
   return Object.freeze({
     ...graph,
-    nodes: mergedNodes,
-    edges: mergedEdges,
+    nodes: { ...mergedNodes },
+    edges: { ...mergedEdges },
     ontology: mergedOntology,
     indexes: mergedIndexes,
     extension: validatedUnion
@@ -1953,14 +1594,14 @@ function mergeGraphExtension(graph, document) {
 }
 function deriveGraphExtensionVectorIndexes(compiledNodes) {
   if (compiledNodes.length === 0) return [];
-  const registrations = {};
+  const registrations = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const compiled of compiledNodes) {
     registrations[compiled.type.kind] = {
       type: compiled.type,
       ...compiled.unique.length === 0 ? {} : { unique: [...compiled.unique] }
     };
   }
-  return chunkQB6VMOJ2_cjs.autoDeriveVectorIndexes(registrations).map(
+  return chunkCXBHOOIQ_cjs.autoDeriveVectorIndexes(registrations).map(
     (index) => Object.freeze({ ...index, origin: "runtime" })
   );
 }
@@ -1978,7 +1619,7 @@ function mergeIndexesWithGraphExtension(existing, runtimeIndexes, graphId) {
   const runtimeRelational = runtimeIndexes.filter(
     (index) => index.entity !== "vector"
   );
-  const vectorMerged = chunkQB6VMOJ2_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
+  const vectorMerged = chunkCXBHOOIQ_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
   const merged = [...vectorMerged, ...runtimeRelational];
   assertUniqueIndexNames(merged, graphId);
   return merged;
@@ -1990,7 +1631,7 @@ function assertUniqueIndexNames(indexes, graphId) {
       seen.add(index.name);
       continue;
     }
-    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
+    throw new chunkNI72YOJB_cjs.ConfigurationError(
       `Duplicate index name "${index.name}" after merging graph extension into graph "${graphId}". Index names must be unique within a graph.`,
       { graphId, indexName: index.name, code: "DUPLICATE_INDEX_NAME" },
       {
@@ -2006,12 +1647,12 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
     if (document.entity === "node") {
       const node = nodeKinds.get(document.kind);
       if (node === void 0) {
-        throw new chunkC4F7VJ5D_cjs.KindNotFoundError(document.kind, "node", {
+        throw new chunkNI72YOJB_cjs.KindNotFoundError(document.kind, "node", {
           graphId,
           suggestion: "Declare the kind under `nodes` in this graph extension, or remove the index from `indexes`."
         });
       }
-      const declaration2 = chunkA2I2XO52_cjs.defineNodeIndex(
+      const declaration2 = chunkU63GDNRC_cjs.defineNodeIndex(
         node,
         toNodeIndexConfig(document)
       );
@@ -2020,12 +1661,12 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
     }
     const edgeRegistration = mergedEdges[document.kind];
     if (edgeRegistration === void 0) {
-      throw new chunkC4F7VJ5D_cjs.KindNotFoundError(document.kind, "edge", {
+      throw new chunkNI72YOJB_cjs.KindNotFoundError(document.kind, "edge", {
         graphId,
         suggestion: "Declare the edge under `edges` in this graph extension, or remove the index from `indexes`."
       });
     }
-    const declaration = chunkA2I2XO52_cjs.defineEdgeIndex(
+    const declaration = chunkU63GDNRC_cjs.defineEdgeIndex(
       edgeRegistration.type,
       toEdgeIndexConfig(document)
     );
@@ -2037,7 +1678,7 @@ function buildWhereCallback(where) {
   return (props) => {
     const builder = props[where.field];
     if (builder === void 0) {
-      throw new chunkC4F7VJ5D_cjs.ConfigurationError(
+      throw new chunkNI72YOJB_cjs.ConfigurationError(
         `Graph-extension index \`where\` references unknown field "${where.field}".`,
         { field: where.field, code: "EXTENSION_INDEX_WHERE_UNKNOWN_FIELD" }
       );
@@ -2046,7 +1687,7 @@ function buildWhereCallback(where) {
   };
 }
 function toNodeIndexConfig(document) {
-  return chunkDI74SMXS_cjs.compactUndefined({
+  return chunkN66HCGCY_cjs.compactUndefined({
     fields: document.fields,
     coveringFields: document.coveringFields,
     unique: document.unique,
@@ -2056,7 +1697,7 @@ function toNodeIndexConfig(document) {
   });
 }
 function toEdgeIndexConfig(document) {
-  return chunkDI74SMXS_cjs.compactUndefined({
+  return chunkN66HCGCY_cjs.compactUndefined({
     fields: document.fields,
     coveringFields: document.coveringFields,
     unique: document.unique,
@@ -2102,7 +1743,7 @@ function dedupBy(items, keyFunction, strategy = "first") {
       seen.set(key, item);
     }
   }
-  return order.map((key) => chunk764JHTLT_cjs.requireDefined(seen.get(key)));
+  return order.map((key) => chunkN66HCGCY_cjs.requireDefined(seen.get(key)));
 }
 function indexCompositeKey(entry) {
   return `${entry.entity}|${entry.kind}|${entry.name ?? ""}|${entry.fields.join(",")}`;
@@ -2112,14 +1753,14 @@ function isEmptyExtension(extension) {
 }
 function assertNoCollision(kindName, entity, collides, graphId) {
   if (!collides) return;
-  throw new chunkQYWINYEA_cjs.KindCollisionError(kindName, entity, graphId);
+  throw new chunk7BQXPCGN_cjs.KindCollisionError(kindName, entity, graphId);
 }
 function resolveEndpoints(entries, nodeKinds, context) {
   return entries.map((entry) => {
     if (typeof entry !== "string") return entry;
     const resolved = nodeKinds.get(entry);
     if (resolved === void 0) {
-      throw new chunkQYWINYEA_cjs.GraphExtensionUnresolvedEndpointError(
+      throw new chunk7BQXPCGN_cjs.GraphExtensionUnresolvedEndpointError(
         context.edgeKind,
         context.side,
         entry,
@@ -2129,11 +1770,38 @@ function resolveEndpoints(entries, nodeKinds, context) {
     return resolved;
   });
 }
-function resolveOntologyEndpoints(relation, nodeKinds) {
+function resolveOntologyEndpoints(relation, nodeKinds, edgeKinds, graphId) {
+  if (relation.metaEdge.name === chunkXUO3KQFO_cjs.META_EDGE_INVERSE_OF || relation.metaEdge.name === chunkXUO3KQFO_cjs.META_EDGE_IMPLIES) {
+    return {
+      ...relation,
+      from: resolveOntologyEdgeEndpoint(
+        relation.metaEdge.name,
+        relation.from,
+        edgeKinds,
+        graphId
+      ),
+      to: resolveOntologyEdgeEndpoint(
+        relation.metaEdge.name,
+        relation.to,
+        edgeKinds,
+        graphId
+      )
+    };
+  }
   const from = typeof relation.from === "string" ? nodeKinds.get(relation.from) ?? relation.from : relation.from;
   const to = typeof relation.to === "string" ? nodeKinds.get(relation.to) ?? relation.to : relation.to;
   return { ...relation, from, to };
 }
+function resolveOntologyEdgeEndpoint(metaEdge, endpoint, edgeKinds, graphId) {
+  if (typeof endpoint !== "string") return endpoint;
+  if (Object.hasOwn(edgeKinds, endpoint)) return endpoint;
+  if (chunk7BQXPCGN_cjs.isExternalIri(endpoint)) return endpoint;
+  throw new chunk7BQXPCGN_cjs.GraphExtensionUnresolvedOntologyEndpointError(
+    metaEdge,
+    endpoint,
+    graphId
+  );
+}
 
 // src/graph-extension/remove.ts
 function planRemovals(graph, names) {
@@ -2151,10 +1819,10 @@ function planRemovals(graph, names) {
   );
   for (const name of namesSet) {
     if (compileTimeNodeNames.has(name)) {
-      throw new chunkQYWINYEA_cjs.RemoveCompileTimeKindError(name, "node", graph.id);
+      throw new chunk7BQXPCGN_cjs.RemoveCompileTimeKindError(name, "node", graph.id);
     }
     if (compileTimeEdgeNames.has(name)) {
-      throw new chunkQYWINYEA_cjs.RemoveCompileTimeKindError(name, "edge", graph.id);
+      throw new chunk7BQXPCGN_cjs.RemoveCompileTimeKindError(name, "edge", graph.id);
     }
   }
   const removedNodeKinds = [...namesSet].filter(
@@ -2170,7 +1838,7 @@ function planRemovals(graph, names) {
   for (const kindName of removedNodeKinds) {
     const referents = referentsByKind.get(kindName);
     if (referents !== void 0 && referents.length > 0) {
-      throw new chunkQYWINYEA_cjs.KindHasReferentsError(kindName, referents, graph.id);
+      throw new chunk7BQXPCGN_cjs.KindHasReferentsError(kindName, referents, graph.id);
     }
   }
   if (document === void 0) {
@@ -2183,7 +1851,7 @@ function planRemovals(graph, names) {
   const removedNodeKindsSet = new Set(removedNodeKinds);
   const explicitlyRemovedEdgeKindsSet = new Set(explicitlyRemovedEdgeKinds);
   const cascadeEdges = /* @__PURE__ */ new Set();
-  const updatedEdges = {};
+  const updatedEdges = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [edgeName, edgeDocument] of Object.entries(document.edges ?? {})) {
     if (explicitlyRemovedEdgeKindsSet.has(edgeName)) {
       cascadeEdges.add(edgeName);
@@ -2205,7 +1873,7 @@ function planRemovals(graph, names) {
       to: newTo
     };
   }
-  const updatedNodes = {};
+  const updatedNodes = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [nodeName, nodeDocument] of Object.entries(document.nodes ?? {})) {
     if (removedNodeKindsSet.has(nodeName)) continue;
     updatedNodes[nodeName] = nodeDocument;
@@ -2223,8 +1891,11 @@ function planRemovals(graph, names) {
   );
   const newDocument = Object.freeze({
     ...document.version === void 0 ? {} : { version: document.version },
-    ...Object.keys(updatedNodes).length === 0 ? {} : { nodes: updatedNodes },
-    ...Object.keys(updatedEdges).length === 0 ? {} : { edges: updatedEdges },
+    // Spread at the boundary: these land on the returned extension document,
+    // which is public as `graph.extension`. See `createDataKeyedBag` in
+    // ../utils/object.ts.
+    ...Object.keys(updatedNodes).length === 0 ? {} : { nodes: { ...updatedNodes } },
+    ...Object.keys(updatedEdges).length === 0 ? {} : { edges: { ...updatedEdges } },
     ...survivingOntology.length === 0 ? {} : { ontology: survivingOntology },
     ...survivingIndexes.length === 0 ? {} : { indexes: survivingIndexes }
   });
@@ -2244,12 +1915,12 @@ function stripGraphExtension(graph) {
   if (document === void 0) return graph;
   const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } = extensionKindNames(document);
   const runtimeOntologyKeys = buildGraphExtensionOntologyKeySet(document);
-  const compileNodes = {};
+  const compileNodes = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [name, registration] of Object.entries(graph.nodes)) {
     if (runtimeNodeNames.has(name)) continue;
     compileNodes[name] = registration;
   }
-  const compileEdges = {};
+  const compileEdges = chunkN66HCGCY_cjs.createDataKeyedBag();
   for (const [name, registration] of Object.entries(graph.edges)) {
     if (runtimeEdgeNames.has(name)) continue;
     compileEdges[name] = registration;
@@ -2262,8 +1933,8 @@ function stripGraphExtension(graph) {
   );
   return Object.freeze({
     ...graph,
-    nodes: compileNodes,
-    edges: compileEdges,
+    nodes: { ...compileNodes },
+    edges: { ...compileEdges },
     ontology: compileOntology,
     indexes: compileIndexes.length === 0 ? void 0 : compileIndexes,
     extension: void 0
@@ -2300,8 +1971,8 @@ function buildCompileTimeReferentIndex(graph, runtimeEdgeNames) {
   );
   for (const relation of graph.ontology) {
     if (runtimeOntologyKeys.has(compileTimeOntologyKey(relation))) continue;
-    const fromName = chunkEE7N5XXQ_cjs.getTypeName(relation.from);
-    const toName = chunkEE7N5XXQ_cjs.getTypeName(relation.to);
+    const fromName = chunkNK5Q7UNE_cjs.getTypeName(relation.from);
+    const toName = chunkNK5Q7UNE_cjs.getTypeName(relation.to);
     const referent = {
       type: "compile-time-ontology",
       name: `${relation.metaEdge.name}(${fromName}, ${toName})`
@@ -2312,6 +1983,244 @@ function buildCompileTimeReferentIndex(graph, runtimeEdgeNames) {
   return index;
 }
 
+// src/identity/schema-transition.ts
+function identityTableNames(schema) {
+  return {
+    identityAssertions: schema.tables.identityAssertions,
+    recordedIdentityAssertions: schema.tables.recordedIdentityAssertions,
+    identityClosure: schema.tables.identityClosure,
+    identitySeparation: schema.tables.identitySeparation
+  };
+}
+var IDENTITY_SEPARATION_RELATION = "identitySeparation";
+var UPGRADEABLE_DERIVED_RELATIONS = /* @__PURE__ */ new Set([
+  IDENTITY_SEPARATION_RELATION
+]);
+var NOTHING_OWED = { provisionInCommit: [] };
+async function ensureIdentitySchemaStorage(backend, schema, options) {
+  const ensureIdentityTables = backend.ensureIdentityTables;
+  if (ensureIdentityTables === void 0) return NOTHING_OWED;
+  const tableNames = identityTableNames(schema);
+  const missingTables = await ensureIdentityTables(tableNames, {
+    provisionMissing: options.enablement
+  });
+  if (options.enablement) return NOTHING_OWED;
+  assertIdentityStoragePresent(
+    options.graphId,
+    missingTables.filter((name) => !UPGRADEABLE_DERIVED_RELATIONS.has(name))
+  );
+  const separationMissing = missingTables.includes(
+    IDENTITY_SEPARATION_RELATION
+  );
+  const rebuildRequired = await chunkXNLIZYRZ_cjs.separationRebuildRequired(
+    backend,
+    schema,
+    options.graphId,
+    { relationExists: !separationMissing, registry: options.registry }
+  );
+  if (!separationMissing && !rebuildRequired) return NOTHING_OWED;
+  const recompute = options.recomputeDerivedRelations;
+  if (recompute === void 0) {
+    return provisioningForCommit(backend, tableNames, options.graphId, {
+      ensureIdentityTables,
+      separationMissing,
+      rebuildRequired
+    });
+  }
+  await provisionDerivedRelations(backend, tableNames, options.graphId, {
+    ensureIdentityTables,
+    recompute,
+    separationMissing,
+    rebuildRequired
+  });
+  return NOTHING_OWED;
+}
+async function provisioningForCommit(backend, tableNames, graphId, input) {
+  if (!input.separationMissing) return NOTHING_OWED;
+  const identityTableDdl = backend.identityTableDdl;
+  if (identityTableDdl !== void 0) {
+    return { provisionInCommit: identityTableDdl(tableNames) };
+  }
+  if (input.rebuildRequired) {
+    throw identityDerivedUpgradeUnsupportedError(graphId, ["identityTableDdl"]);
+  }
+  await input.ensureIdentityTables(tableNames, { provisionMissing: true });
+  return NOTHING_OWED;
+}
+async function provisionDerivedRelations(backend, tableNames, graphId, ports) {
+  if (!ports.separationMissing) {
+    await ports.recompute(backend);
+    return;
+  }
+  if (!ports.rebuildRequired) {
+    await ports.ensureIdentityTables(tableNames, { provisionMissing: true });
+    return;
+  }
+  const fence = backend.schemaWriteTransaction;
+  const identityTableDdl = backend.identityTableDdl;
+  if (fence === void 0 || identityTableDdl === void 0) {
+    throw identityDerivedUpgradeUnsupportedError(graphId, [
+      ...fence === void 0 ? ["schemaWriteTransaction"] : [],
+      ...identityTableDdl === void 0 ? ["identityTableDdl"] : []
+    ]);
+  }
+  await withIdentityDdlRaceRetry(
+    async () => fence(graphId, async (target) => {
+      await lockIdentityDdl(target);
+      await executeIdentityDdl(
+        (ddl) => target.executeSchemaDdl(ddl),
+        identityTableDdl(tableNames)
+      );
+      await ports.recompute(target);
+    })
+  );
+}
+var IDENTITY_DDL_RACES = /* @__PURE__ */ new WeakSet();
+function markIdentityDdlRace(error) {
+  if (typeof error === "object" && error !== null) {
+    IDENTITY_DDL_RACES.add(error);
+  }
+  return error;
+}
+function isIdentityDdlRace(error) {
+  for (const link of chunkBSFJMMV3_cjs.errorChain(error)) {
+    if (typeof link === "object" && link !== null && IDENTITY_DDL_RACES.has(link)) {
+      return true;
+    }
+  }
+  return false;
+}
+async function executeIdentityDdl(execute, statements) {
+  for (const statement of statements) {
+    try {
+      await execute(statement);
+    } catch (error) {
+      if (chunkBSFJMMV3_cjs.isPostgresConcurrentDdlRaceError(error)) {
+        throw markIdentityDdlRace(error);
+      }
+      throw error;
+    }
+  }
+}
+async function withIdentityDdlRaceRetry(attempt) {
+  try {
+    return await attempt();
+  } catch (error) {
+    if (!isIdentityDdlRace(error)) throw error;
+    return attempt();
+  }
+}
+async function lockIdentityDdl(target) {
+  if (target.dialect !== "postgres") return;
+  await target.execute(
+    chunkVCRRKBLN_cjs.asCompiledRowsSql(chunkVCRRKBLN_cjs.sql`
+      SELECT pg_advisory_xact_lock(hashtext(${IDENTITY_DDL_LOCK_KEY}), 0)
+    `)
+  );
+}
+var IDENTITY_DDL_LOCK_KEY = "typegraph:identity-ddl";
+function identityDerivedUpgradeUnsupportedError(graphId, missingPorts) {
+  return new chunkNI72YOJB_cjs.ConfigurationError(
+    "This backend cannot publish an Operational Identity derived-relation upgrade atomically.",
+    {
+      code: "IDENTITY_UPGRADE_REQUIRES_ATOMIC_DDL",
+      graphId,
+      missingPorts,
+      tables: [IDENTITY_SEPARATION_RELATION]
+    },
+    {
+      suggestion: "Use a backend that implements schemaWriteTransaction and identityTableDdl (both bundled Drizzle backends do when transactions are enabled). Creating the separation relation and filling it as two steps would leave it readable and empty in between, where every pair reads as not separated. To upgrade out of band, create the relation with the standard TypeGraph DDL and run rebuildIdentityClosure(store) before serving traffic."
+    }
+  );
+}
+async function identityKindCascadeNeeded(backend, schema, graphId, droppedNodeKinds) {
+  if (droppedNodeKinds.length === 0) return false;
+  const ensureIdentityTables = backend.ensureIdentityTables;
+  if (ensureIdentityTables === void 0) return false;
+  const missingTables = await ensureIdentityTables(identityTableNames(schema), {
+    provisionMissing: false
+  });
+  if (missingTables.length > 0) return false;
+  return chunkXNLIZYRZ_cjs.hasAssertionsTouchingKinds(backend, schema, graphId, droppedNodeKinds);
+}
+function assertIdentityStoragePresent(graphId, missingTables) {
+  if (missingTables.length === 0) return;
+  throw new chunkNI72YOJB_cjs.ConfigurationError(
+    "Operational Identity storage was missing from an already enabled graph.",
+    {
+      code: "IDENTITY_STORAGE_MISSING",
+      graphId,
+      tables: missingTables
+    },
+    {
+      suggestion: "Restore missing assertion-ledger tables from backup. If only the derived relations (closure, separation) are missing, recreate them with the standard TypeGraph DDL, open the Store, and run rebuildIdentityClosure() before serving traffic."
+    }
+  );
+}
+function identitySchemaCommitPreflight(ctx, options) {
+  return async (target) => {
+    await provisionDerivedRelationsInCommit(
+      target,
+      ctx.graphId,
+      options.provisionDerivedRelations ?? []
+    );
+    await chunkXMQSEJCF_cjs.lockRecordedGraphWrite(target, ctx.graphId);
+    await chunkXNLIZYRZ_cjs.lockIdentityGraph(target, ctx.graphId);
+    if (options.enablement) {
+      await chunkXNLIZYRZ_cjs.lockIdentityEnablementNodes(target, ctx.schema);
+      await chunkXMQSEJCF_cjs.withRecordedIdentityMutationTarget(
+        target,
+        (rawTarget, touch) => chunkXNLIZYRZ_cjs.purgeAssertionsWithUnregisteredKinds(
+          rawTarget,
+          ctx.schema,
+          ctx.graphId,
+          new Set(ctx.registry.nodeKinds.keys()),
+          touch
+        )
+      );
+    }
+    const droppedNodeKinds = options.droppedNodeKinds ?? [];
+    if (droppedNodeKinds.length > 0) {
+      await chunkXMQSEJCF_cjs.withRecordedIdentityMutationTarget(
+        target,
+        (rawTarget, touch) => chunkXNLIZYRZ_cjs.deleteAssertionsTouchingKinds(
+          rawTarget,
+          ctx.schema,
+          ctx.graphId,
+          droppedNodeKinds,
+          touch
+        )
+      );
+    }
+    await chunkXNLIZYRZ_cjs.rebuildIdentityClosureForContext({ ...ctx, backend: target });
+  };
+}
+async function provisionDerivedRelationsInCommit(target, graphId, ddl) {
+  if (ddl.length === 0) return;
+  const executeSchemaDdl = target.executeSchemaDdl;
+  if (executeSchemaDdl === void 0) {
+    throw identityDerivedUpgradeUnsupportedError(graphId, ["executeSchemaDdl"]);
+  }
+  await lockIdentityDdl(target);
+  await executeIdentityDdl((statement) => executeSchemaDdl(statement), ddl);
+}
+function identityKindCascadePreflight(ctx, droppedNodeKinds) {
+  return async (target) => {
+    await chunkXMQSEJCF_cjs.lockRecordedGraphWrite(target, ctx.graphId);
+    await chunkXNLIZYRZ_cjs.lockIdentityGraph(target, ctx.graphId);
+    await chunkXMQSEJCF_cjs.withRecordedIdentityMutationTarget(
+      target,
+      (rawTarget, touch) => chunkXNLIZYRZ_cjs.deleteAssertionsTouchingKinds(
+        rawTarget,
+        ctx.schema,
+        ctx.graphId,
+        droppedNodeKinds,
+        touch
+      )
+    );
+  };
+}
+
 // src/registry/validate-implies.ts
 function validateImpliesEndpointCompatibility(edgeEndpoints, registry) {
   for (const [impliedEdgeKind, impliedEndpoints] of edgeEndpoints) {
@@ -2345,10 +2254,10 @@ function assertEndpointCompatible(side, implyingEdgeKind, implyingKinds, implied
     (kind) => !registry.isAssignableToAny(kind, impliedKinds)
   );
   if (incompatibleKinds.length === 0) return;
-  throw new chunkC4F7VJ5D_cjs.ConfigurationError(
+  throw new chunkNI72YOJB_cjs.ConfigurationError(
     `implies("${implyingEdgeKind}", "${impliedEdgeKind}") is endpoint-incompatible: ${side} kind(s) [${incompatibleKinds.join(", ")}] declared on "${implyingEdgeKind}" cannot be assigned to any of "${impliedEdgeKind}"'s ${side} kind(s) [${impliedKinds.join(", ")}].`,
     {
-      metaEdge: chunkSVJ5GEXW_cjs.META_EDGE_IMPLIES,
+      metaEdge: chunkXUO3KQFO_cjs.META_EDGE_IMPLIES,
       implyingEdge: implyingEdgeKind,
       impliedEdge: impliedEdgeKind,
       endpoint: side,
@@ -2361,17 +2270,132 @@ function assertEndpointCompatible(side, implyingEdgeKind, implyingKinds, implied
   );
 }
 
+// src/registry/validate-inverse.ts
+function validateInverseEndpointCompatibility(ontology, edgeEndpoints, registry) {
+  for (const relation of ontology) {
+    if (relation.metaEdge !== chunkXUO3KQFO_cjs.META_EDGE_INVERSE_OF) continue;
+    const left = edgeEndpoints.get(relation.from);
+    const right = edgeEndpoints.get(relation.to);
+    if (left === void 0 || right === void 0) continue;
+    assertInverseSideCompatible(
+      relation.from,
+      "from",
+      left.from,
+      relation.to,
+      "to",
+      right.to,
+      registry
+    );
+    assertInverseSideCompatible(
+      relation.from,
+      "to",
+      left.to,
+      relation.to,
+      "from",
+      right.from,
+      registry
+    );
+    if (relation.from === relation.to) continue;
+    assertInverseSideCompatible(
+      relation.to,
+      "from",
+      right.from,
+      relation.from,
+      "to",
+      left.to,
+      registry
+    );
+    assertInverseSideCompatible(
+      relation.to,
+      "to",
+      right.to,
+      relation.from,
+      "from",
+      left.from,
+      registry
+    );
+  }
+}
+function assertInverseSideCompatible(sourceEdge, sourceSide, sourceKinds, inverseEdge, inverseSide, inverseKinds, registry) {
+  const incompatibleKinds = sourceKinds.filter(
+    (kind) => !registry.isAssignableToAny(kind, inverseKinds)
+  );
+  if (incompatibleKinds.length === 0) return;
+  throw new chunkNI72YOJB_cjs.ConfigurationError(
+    `inverseOf("${sourceEdge}", "${inverseEdge}") is endpoint-incompatible: ${sourceSide} kind(s) [${incompatibleKinds.join(", ")}] declared on "${sourceEdge}" cannot be assigned to any of "${inverseEdge}"'s ${inverseSide} kind(s) [${inverseKinds.join(", ")}].`,
+    {
+      metaEdge: chunkXUO3KQFO_cjs.META_EDGE_INVERSE_OF,
+      sourceEdge,
+      inverseEdge,
+      sourceEndpoint: sourceSide,
+      inverseEndpoint: inverseSide,
+      incompatibleKinds,
+      allowedKinds: inverseKinds
+    },
+    {
+      suggestion: "Make the inverse edge declarations exact reversals (allowing subClassOf assignability), or remove the inverseOf relation."
+    }
+  );
+}
+
+// src/registry/build-validated.ts
+function buildValidatedKindRegistry(input) {
+  if (input.ontology.length === 0) {
+    const registry2 = new chunk7BQXPCGN_cjs.KindRegistry(
+      input.nodeKinds,
+      input.edgeKinds,
+      chunk7BQXPCGN_cjs.createEmptyClosures(),
+      input.identity
+    );
+    validateImpliesEndpointCompatibility(input.edgeEndpoints, registry2);
+    return registry2;
+  }
+  const issues = chunk7BQXPCGN_cjs.validateOntologyRelations(input.ontology);
+  if (issues.length > 0) {
+    const firstIssue = chunkN66HCGCY_cjs.requireDefined(issues[0]);
+    throw new chunkNI72YOJB_cjs.ConfigurationError(
+      `Ontology is incoherent: ${firstIssue.message}`,
+      {
+        code: firstIssue.code,
+        issues
+      },
+      {
+        suggestion: "Correct the ontology relations before constructing or loading the graph registry."
+      }
+    );
+  }
+  const closures = chunk7BQXPCGN_cjs.computeClosuresFromNamedOntology(input.ontology);
+  const registry = new chunk7BQXPCGN_cjs.KindRegistry(
+    input.nodeKinds,
+    input.edgeKinds,
+    closures,
+    input.identity
+  );
+  validateImpliesEndpointCompatibility(input.edgeEndpoints, registry);
+  validateInverseEndpointCompatibility(
+    input.ontology,
+    input.edgeEndpoints,
+    registry
+  );
+  return registry;
+}
+
 // src/registry/builders.ts
+var EMPTY_NAMED_ONTOLOGY = [];
 function buildKindRegistry(graph) {
   const nodeTypes = extractNodeTypes(graph);
   const edgeTypes = extractEdgeTypes(graph);
-  const closures = graph.ontology.length > 0 ? computeClosuresFromOntology(graph.ontology) : createEmptyClosures();
-  const registry = new KindRegistry(nodeTypes, edgeTypes, closures);
-  validateImpliesEndpointCompatibility(
-    buildEdgeEndpointKinds(graph.edges),
-    registry
-  );
-  return registry;
+  return buildValidatedKindRegistry({
+    nodeKinds: nodeTypes,
+    edgeKinds: edgeTypes,
+    ontology: graph.ontology.length === 0 ? EMPTY_NAMED_ONTOLOGY : graph.ontology.map((relation) => ({
+      metaEdge: relation.metaEdge.name,
+      from: typeof relation.from === "string" ? relation.from : relation.from.kind,
+      to: typeof relation.to === "string" ? relation.to : relation.to.kind
+    })),
+    edgeEndpoints: buildEdgeEndpointKinds(graph.edges),
+    ...graph.identity === void 0 ? {} : { identity: graph.identity }
+  });
 }
 function buildEdgeEndpointKinds(edges) {
   const result = /* @__PURE__ */ new Map();
@@ -2385,7 +2409,7 @@ function buildEdgeEndpointKinds(edges) {
 }
 function extractNodeTypes(graph) {
   const result = /* @__PURE__ */ new Map();
-  for (const typeName of chunkQB6VMOJ2_cjs.getNodeKinds(graph)) {
+  for (const typeName of chunkCXBHOOIQ_cjs.getNodeKinds(graph)) {
     const registration = graph.nodes[typeName];
     result.set(typeName, registration.type);
   }
@@ -2393,7 +2417,7 @@ function extractNodeTypes(graph) {
 }
 function extractEdgeTypes(graph) {
   const result = /* @__PURE__ */ new Map();
-  for (const typeName of chunkQB6VMOJ2_cjs.getEdgeKinds(graph)) {
+  for (const typeName of chunkCXBHOOIQ_cjs.getEdgeKinds(graph)) {
     const registration = graph.edges[typeName];
     result.set(typeName, registration.type);
   }
@@ -2697,6 +2721,7 @@ var serializedSchemaZod = zod.z.object({
     onNodeDelete: deleteBehaviorZod,
     temporalMode: temporalModeZod
   }).loose(),
+  identity: zod.z.object({ sameIdAcrossKinds: zod.z.enum(["fold", "ignore"]) }).readonly().optional(),
   /**
    * Index declarations attached to the graph.
    *
@@ -2741,7 +2766,7 @@ function parseSerializedSchema(json) {
   try {
     parsed = JSON.parse(json);
   } catch {
-    throw new chunkC4F7VJ5D_cjs.DatabaseOperationError(
+    throw new chunkNI72YOJB_cjs.DatabaseOperationError(
       "Stored schema document is not valid JSON",
       { operation: "select", entity: "schema" }
     );
@@ -2749,12 +2774,12 @@ function parseSerializedSchema(json) {
   const result = serializedSchemaZod.safeParse(parsed);
   if (!result.success) {
     const issues = result.error.issues.map((issue) => `${issue.path.join(".")}: ${issue.message}`).join("; ");
-    throw new chunkC4F7VJ5D_cjs.DatabaseOperationError(
+    throw new chunkNI72YOJB_cjs.DatabaseOperationError(
       `Stored schema document is malformed: ${issues}`,
       { operation: "select", entity: "schema" }
     );
   }
-  const validated = chunkDI74SMXS_cjs.freezeDeep(result.data);
+  const validated = chunkN66HCGCY_cjs.freezeDeep(result.data);
   if (PARSE_CACHE.size >= PARSE_CACHE_LIMIT) {
     const oldest = PARSE_CACHE.keys().next().value;
     if (oldest !== void 0) PARSE_CACHE.delete(oldest);
@@ -2766,7 +2791,7 @@ async function loadActiveSchemaWithBootstrap(backend, graphId) {
   try {
     return await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (backend.bootstrapTables && chunkWBUFJ7BS_cjs.isMissingTableError(error)) {
+    if (backend.bootstrapTables && chunkBSFJMMV3_cjs.isMissingTableError(error)) {
       await backend.bootstrapTables();
       return await backend.getActiveSchema(graphId);
     }
@@ -2812,7 +2837,9 @@ async function ensureSchema(backend, graph, options) {
   const preloaded = options?.preloaded;
   const activeSchema = preloaded === void 0 ? await loadActiveSchemaWithBootstrap(backend, graph.id) : preloaded.activeRow;
   if (activeSchema === void 0) {
-    const result = await initializeSchema(backend, graph);
+    const result = await initializeSchema(backend, graph, {
+      ...options?.schema === void 0 ? {} : { schema: options.schema }
+    });
     return {
       status: "initialized",
       version: result.version,
@@ -2839,10 +2866,15 @@ async function ensureSchema(backend, graph, options) {
         diff
       };
       await options?.onBeforeMigrate?.(hookContext);
-      const committedRow = await commitNewSchemaVersion(
+      const preflight = graph.identity === void 0 ? void 0 : await prepareIdentitySchemaCommit(backend, graph, {
+        enablement: storedSchema.identity === void 0,
+        ...options?.schema === void 0 ? {} : { schema: options.schema }
+      });
+      const committedRow = preflight === void 0 ? await commitNewSchemaVersion(backend, graph, activeSchema.version) : await commitNewSchemaVersionWithPreflight(
         backend,
         graph,
-        activeSchema.version
+        activeSchema.version,
+        preflight
       );
       await options?.onAfterMigrate?.(hookContext);
       return {
@@ -2864,7 +2896,7 @@ async function ensureSchema(backend, graph, options) {
     const removesKind = [...diff.nodes, ...diff.edges].some(
       (change) => change.type === "removed"
     );
-    throw new chunkC4F7VJ5D_cjs.MigrationError(
+    throw new chunkNI72YOJB_cjs.MigrationError(
       `Schema migration required: ${diff.summary}. ${actions.length} migration action(s) needed. Use getSchemaChanges() to review, then migrateSchema() to apply.` + (removesKind ? ` This diff removes a kind: migrateSchema() refuses to drop one that still holds rows, so export or delete those rows first and retry.` : ""),
       {
         graphId: graph.id,
@@ -2917,7 +2949,7 @@ async function assertVectorContributionsInitialized(backend, graph) {
 function schemaBehindError(graphId, fromVersion, diff) {
   const actions = getMigrationActions(diff);
   const qualifier = isBackwardsCompatible(diff) ? "safe auto-migration" : "breaking change";
-  return new chunkC4F7VJ5D_cjs.MigrationError(
+  return new chunkNI72YOJB_cjs.MigrationError(
     `Schema verification failed for graph "${graphId}": ${diff.summary} (${qualifier}). ${actions.length} migration action(s) needed. The least-privilege runtime cannot migrate \u2014 run createStoreWithSchema(graph, adminBackend) under a privileged role (after any generated migration SQL, if you manage DDL externally) before attaching with createStore() / createVerifiedStore().`,
     {
       graphId,
@@ -2937,7 +2969,7 @@ async function readActiveSchemaPure(backend, graphId) {
   try {
     activeRow = await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (chunkWBUFJ7BS_cjs.isMissingTableError(error)) {
+    if (chunkBSFJMMV3_cjs.isMissingTableError(error)) {
       throw schemaNotInitializedError(graphId, error);
     }
     throw error;
@@ -2948,7 +2980,7 @@ async function readActiveSchemaPure(backend, graphId) {
   return activeRow;
 }
 function schemaNotInitializedError(graphId, cause) {
-  return new chunkC4F7VJ5D_cjs.ConfigurationError(
+  return new chunkNI72YOJB_cjs.ConfigurationError(
     `Cannot verify graph "${graphId}": no schema has been initialized. Run createStoreWithSchema(graph, adminBackend) once under a privileged role (which commits the schema_versions row and materializes contribution markers) before attaching with createStore() / createVerifiedStore(). Generated migration SQL creates the tables but does not initialize the schema row.`,
     { graphId },
     {
@@ -2957,17 +2989,39 @@ function schemaNotInitializedError(graphId, cause) {
     }
   );
 }
-async function initializeSchema(backend, graph) {
+function requireCommitWithPreflight(backend, graph) {
+  const commitWithPreflight = backend.commitSchemaVersionWithPreflight;
+  if (commitWithPreflight === void 0) {
+    throw new chunkNI72YOJB_cjs.ConfigurationError(
+      "This backend cannot atomically commit identity data with a schema transition.",
+      {
+        code: "IDENTITY_REQUIRES_ATOMIC_BACKEND",
+        graphId: graph.id
+      }
+    );
+  }
+  return commitWithPreflight;
+}
+async function initializeSchema(backend, graph, options) {
   buildKindRegistry(graph);
   const schema = serializeSchema(graph, 1);
   const hash = await computeSchemaHash(schema);
-  return backend.commitSchemaVersion({
+  const commit = {
     graphId: graph.id,
     expected: { kind: "initial" },
     version: 1,
     schemaHash: hash,
     schemaDoc: schema
+  };
+  if (graph.identity === void 0) {
+    return backend.commitSchemaVersion(commit);
+  }
+  const preflight = await prepareIdentitySchemaCommit(backend, graph, {
+    enablement: true,
+    ...options?.schema === void 0 ? {} : { schema: options.schema }
   });
+  const commitWithPreflight = requireCommitWithPreflight(backend, graph);
+  return withIdentityDdlRaceRetry(() => commitWithPreflight(commit, preflight));
 }
 async function migrateSchema(backend, graph, currentVersion, options) {
   const {
@@ -2976,24 +3030,106 @@ async function migrateSchema(backend, graph, currentVersion, options) {
     activeRow
   } = await loadAndMergeGraphExtensionDocument(backend, graph);
   if (activeRow !== void 0 && activeRow.version !== currentVersion) {
-    throw new chunkC4F7VJ5D_cjs.StaleVersionError({
+    throw new chunkNI72YOJB_cjs.StaleVersionError({
       graphId: graph.id,
       expected: currentVersion,
       actual: activeRow.version
     });
   }
   const dropped = storedSchema === void 0 ? [] : [
-    ...droppedKinds(storedSchema.nodes, chunkQB6VMOJ2_cjs.getNodeKinds(target), "node"),
-    ...droppedKinds(storedSchema.edges, chunkQB6VMOJ2_cjs.getEdgeKinds(target), "edge")
+    ...droppedKinds(storedSchema.nodes, chunkCXBHOOIQ_cjs.getNodeKinds(target), "node"),
+    ...droppedKinds(storedSchema.edges, chunkCXBHOOIQ_cjs.getEdgeKinds(target), "edge")
   ];
-  const committed = dropped.length > 0 && options?.discardDroppedKindRows !== true ? await commitDroppedKindsOnlyWhenEmpty(
+  const guardedDrops = options?.discardDroppedKindRows === true ? [] : dropped;
+  const droppedNodeKinds = dropped.filter((drop) => drop.entity === "node").map((drop) => drop.kind);
+  const identityPreflight = activeRow === void 0 ? void 0 : target.identity === void 0 ? (
+    // Identity being OFF in the target is not evidence the ledger is empty:
+    // disabling retains the assertion rows. A drop committed here would
+    // strand every assertion touching the kind — a later re-enablement
+    // filters them out of the closure while raw ledger reads and merge
+    // staging still see them.
+    await prepareIdentityKindCascade(backend, target, {
+      droppedNodeKinds,
+      probeBeforeCascade: storedSchema?.identity === void 0,
+      ...options?.schema === void 0 ? {} : { schema: options.schema }
+    })
+  ) : await prepareIdentitySchemaCommit(backend, target, {
+    enablement: storedSchema?.identity === void 0,
+    droppedNodeKinds,
+    ...options?.schema === void 0 ? {} : { schema: options.schema }
+  });
+  const committed = identityPreflight === void 0 ? guardedDrops.length > 0 ? await commitDroppedKindsOnlyWhenEmpty(
     backend,
     target,
     currentVersion,
-    dropped
-  ) : await commitNewSchemaVersion(backend, target, currentVersion);
+    guardedDrops
+  ) : await commitNewSchemaVersion(backend, target, currentVersion) : await commitNewSchemaVersionWithPreflight(
+    backend,
+    target,
+    currentVersion,
+    async (transactionBackend) => {
+      await assertDroppedKindsEmpty(
+        transactionBackend,
+        target.id,
+        currentVersion,
+        guardedDrops
+      );
+      await identityPreflight(transactionBackend);
+    }
+  );
   return committed.version;
 }
+async function prepareIdentityKindCascade(backend, target, options) {
+  if (options.droppedNodeKinds.length === 0) return void 0;
+  const schema = options.schema === void 0 ? chunkNFCVHQ5P_cjs.createSqlSchema(backend.tableNames) : chunkNFCVHQ5P_cjs.requireSqlSchema(options.schema, "The schema option");
+  if (options.probeBeforeCascade) {
+    const needed = await identityKindCascadeNeeded(
+      backend,
+      schema,
+      target.id,
+      options.droppedNodeKinds
+    );
+    if (!needed) return void 0;
+  }
+  return identityKindCascadePreflight(
+    { graphId: target.id, schema },
+    options.droppedNodeKinds
+  );
+}
+async function prepareIdentitySchemaCommit(backend, target, options) {
+  const schema = options.schema === void 0 ? chunkNFCVHQ5P_cjs.createSqlSchema(backend.tableNames) : chunkNFCVHQ5P_cjs.requireSqlSchema(options.schema, "The schema option");
+  const registry = buildKindRegistry(target);
+  const provisioning = await ensureIdentitySchemaStorage(backend, schema, {
+    graphId: target.id,
+    enablement: options.enablement,
+    registry
+  });
+  return identitySchemaCommitPreflight(
+    {
+      graphId: target.id,
+      registry,
+      schema,
+      sameIdAcrossKinds: target.identity?.sameIdAcrossKinds ?? "ignore"
+    },
+    {
+      enablement: options.enablement,
+      droppedNodeKinds: options.droppedNodeKinds ?? [],
+      provisionDerivedRelations: provisioning.provisionInCommit
+    }
+  );
+}
+async function assertDroppedKindsEmpty(backend, graphId, currentVersion, dropped) {
+  const counts = await Promise.all(
+    dropped.map(async (entry) => ({
+      entity: entry.entity,
+      kind: entry.kind,
+      count: entry.entity === "node" ? await backend.countNodesByKind({ graphId, kind: entry.kind }) : await backend.countEdgesByKind({ graphId, kind: entry.kind })
+    }))
+  );
+  const populated = counts.filter((entry) => entry.count > 0);
+  if (populated.length === 0) return;
+  throwPopulatedKindRemovalError(graphId, currentVersion, populated);
+}
 async function commitDroppedKindsOnlyWhenEmpty(backend, graph, currentVersion, dropped) {
   const result = await commitNewSchemaVersionIfKindsEmpty(
     backend,
@@ -3006,7 +3142,7 @@ async function commitDroppedKindsOnlyWhenEmpty(backend, graph, currentVersion, d
 }
 function throwPopulatedKindRemovalError(graphId, currentVersion, populated) {
   const named = populated.map((entry) => `${entry.entity} "${entry.kind}" (${String(entry.count)})`).join(", ");
-  throw new chunkC4F7VJ5D_cjs.MigrationError(
+  throw new chunkNI72YOJB_cjs.MigrationError(
     `Refusing to commit a schema for graph "${graphId}" that drops kinds still holding rows: ${named}. Committing would make those rows unreachable, and the next materializeRemovals() would delete them. Export or delete those rows, then retry. Pass { discardDroppedKindRows: true } if losing them is the intent.`,
     {
       graphId,
@@ -3032,7 +3168,7 @@ async function commitNewSchemaVersionIfKindsEmpty(backend, graph, currentVersion
   const params = await buildNewSchemaVersionCommit(graph, currentVersion);
   const commitIfKindsEmpty = backend.commitSchemaVersionIfKindsEmpty;
   if (commitIfKindsEmpty === void 0) {
-    throw new chunkC4F7VJ5D_cjs.ConfigurationError(
+    throw new chunkNI72YOJB_cjs.ConfigurationError(
       "This backend cannot atomically fence entity writes while checking schema kind emptiness.",
       {
         code: "SCHEMA_KIND_EMPTINESS_FENCE_UNSUPPORTED",
@@ -3055,10 +3191,18 @@ async function buildNewSchemaVersionCommit(graph, currentVersion) {
     schemaDoc: schema
   };
 }
+async function commitNewSchemaVersionWithPreflight(backend, graph, currentVersion, preflight) {
+  if (backend.commitSchemaVersionWithPreflight === void 0) {
+    buildKindRegistry(graph);
+  }
+  const commitWithPreflight = requireCommitWithPreflight(backend, graph);
+  const commit = await buildNewSchemaVersionCommit(graph, currentVersion);
+  return withIdentityDdlRaceRetry(() => commitWithPreflight(commit, preflight));
+}
 async function rollbackSchema(backend, graphId, targetVersion) {
   const activeRow = await backend.getActiveSchema(graphId);
   if (activeRow === void 0) {
-    throw new chunkC4F7VJ5D_cjs.MigrationError(
+    throw new chunkNI72YOJB_cjs.MigrationError(
       `Cannot rollback graph "${graphId}": no active schema version exists.`,
       {
         graphId,
@@ -3103,15 +3247,16 @@ async function getCommittedSchemaVersion(backend, graphId) {
   return row?.version;
 }
 
-exports.KindRegistry = KindRegistry;
 exports.applyDeprecatedKinds = applyDeprecatedKinds;
 exports.assertSchemaCurrent = assertSchemaCurrent;
 exports.broader = broader;
 exports.buildGraphExtensionOntologyKeySet = buildGraphExtensionOntologyKeySet;
 exports.buildKindRegistry = buildKindRegistry;
+exports.buildValidatedKindRegistry = buildValidatedKindRegistry;
 exports.classifySchemaChanges = classifySchemaChanges;
 exports.commitNewSchemaVersion = commitNewSchemaVersion;
 exports.commitNewSchemaVersionIfKindsEmpty = commitNewSchemaVersionIfKindsEmpty;
+exports.commitNewSchemaVersionWithPreflight = commitNewSchemaVersionWithPreflight;
 exports.compileTimeOntologyKey = compileTimeOntologyKey;
 exports.computeSchemaDiff = computeSchemaDiff;
 exports.computeSchemaHash = computeSchemaHash;
@@ -3119,6 +3264,7 @@ exports.core = core;
 exports.deserializeWherePredicate = deserializeWherePredicate;
 exports.differentFrom = differentFrom;
 exports.disjointWith = disjointWith;
+exports.ensureIdentitySchemaStorage = ensureIdentitySchemaStorage;
 exports.ensureSchema = ensureSchema;
 exports.equivalentTo = equivalentTo;
 exports.extensionKindNames = extensionKindNames;
@@ -3127,6 +3273,8 @@ exports.getCommittedSchemaVersion = getCommittedSchemaVersion;
 exports.getMigrationActions = getMigrationActions;
 exports.getSchemaChanges = getSchemaChanges;
 exports.hasPart = hasPart;
+exports.identityKindCascadeNeeded = identityKindCascadeNeeded;
+exports.identitySchemaCommitPreflight = identitySchemaCommitPreflight;
 exports.implies = implies;
 exports.initializeSchema = initializeSchema;
 exports.inverseOf = inverseOf;
@@ -3150,6 +3298,5 @@ exports.serializeSchema = serializeSchema;
 exports.serializeSchemaProperties = serializeSchemaProperties;
 exports.stripGraphExtension = stripGraphExtension;
 exports.subClassOf = subClassOf;
-exports.validateImpliesEndpointCompatibility = validateImpliesEndpointCompatibility;
-//# sourceMappingURL=chunk-2VLBGQBY.cjs.map
-//# sourceMappingURL=chunk-2VLBGQBY.cjs.map
+//# sourceMappingURL=chunk-N3257XE6.cjs.map
+//# sourceMappingURL=chunk-N3257XE6.cjs.map