@nicia-ai/typegraph 0.33.0 → 0.35.0

package/dist/{chunk-NG5N7R45.cjs → chunk-CK5BVQOW.cjs}

@@ -1,31 +1,33 @@
 'use strict';
 
-var chunkMBLXCV2Y_cjs = require('./chunk-MBLXCV2Y.cjs');
-var chunk3IR2GEMJ_cjs = require('./chunk-3IR2GEMJ.cjs');
-var chunkEF3Z645U_cjs = require('./chunk-EF3Z645U.cjs');
-var chunkZFWNO3GE_cjs = require('./chunk-ZFWNO3GE.cjs');
-var chunkKTIEB7VH_cjs = require('./chunk-KTIEB7VH.cjs');
-var chunkOIE2UPVG_cjs = require('./chunk-OIE2UPVG.cjs');
-var chunk73KASJGO_cjs = require('./chunk-73KASJGO.cjs');
-var chunkJIEJCTDS_cjs = require('./chunk-JIEJCTDS.cjs');
+var chunkACSVZPK7_cjs = require('./chunk-ACSVZPK7.cjs');
+var chunkVPYHY3LJ_cjs = require('./chunk-VPYHY3LJ.cjs');
+var chunkUUT7UN2N_cjs = require('./chunk-UUT7UN2N.cjs');
+var chunkTEDRJXOG_cjs = require('./chunk-TEDRJXOG.cjs');
+var chunkFL472AMI_cjs = require('./chunk-FL472AMI.cjs');
+var chunkGSQ6NPH6_cjs = require('./chunk-GSQ6NPH6.cjs');
+var chunkBLZDPRXT_cjs = require('./chunk-BLZDPRXT.cjs');
+var chunkH7YNSMA7_cjs = require('./chunk-H7YNSMA7.cjs');
+var chunkDI74SMXS_cjs = require('./chunk-DI74SMXS.cjs');
+var chunkLGEALRC6_cjs = require('./chunk-LGEALRC6.cjs');
 var zod = require('zod');
 
 // src/core/node.ts
 function validateSchemaKeys(schema, name) {
-  chunkKTIEB7VH_cjs.assertSchemaKeysAreFree(
+  chunkGSQ6NPH6_cjs.assertSchemaKeysAreFree(
     "Node",
     name,
     Object.keys(schema.shape),
-    chunkKTIEB7VH_cjs.RESERVED_NODE_KEYS
+    chunkGSQ6NPH6_cjs.RESERVED_NODE_KEYS
   );
 }
 function defineNode(name, options) {
   validateSchemaKeys(options.schema, name);
   if (options.annotations !== void 0) {
-    chunkKTIEB7VH_cjs.assertJsonValue(options.annotations, "annotations", `Node "${name}"`);
+    chunkFL472AMI_cjs.assertJsonValue(options.annotations, "annotations", `Node "${name}"`);
   }
   return Object.freeze({
-    [chunkMBLXCV2Y_cjs.NODE_TYPE_BRAND]: true,
+    [chunkVPYHY3LJ_cjs.NODE_TYPE_BRAND]: true,
     kind: name,
     schema: options.schema,
     description: options.description,
@@ -34,21 +36,21 @@ function defineNode(name, options) {
 }
 var EMPTY_SCHEMA = zod.z.object({});
 function validateSchemaKeys2(schema, name) {
-  chunkKTIEB7VH_cjs.assertSchemaKeysAreFree(
+  chunkGSQ6NPH6_cjs.assertSchemaKeysAreFree(
     "Edge",
     name,
     Object.keys(schema.shape),
-    chunkKTIEB7VH_cjs.RESERVED_EDGE_KEYS
+    chunkGSQ6NPH6_cjs.RESERVED_EDGE_KEYS
   );
 }
 function defineEdge(name, options) {
   const schema = options?.schema ?? EMPTY_SCHEMA;
   validateSchemaKeys2(schema, name);
   if (options?.annotations !== void 0) {
-    chunkKTIEB7VH_cjs.assertJsonValue(options.annotations, "annotations", `Edge "${name}"`);
+    chunkFL472AMI_cjs.assertJsonValue(options.annotations, "annotations", `Edge "${name}"`);
   }
   return Object.freeze({
-    [chunkMBLXCV2Y_cjs.EDGE_TYPE_BRAND]: true,
+    [chunkVPYHY3LJ_cjs.EDGE_TYPE_BRAND]: true,
     kind: name,
     schema,
     description: options?.description,
@@ -85,7 +87,7 @@ function createMetaEdge(name, properties) {
     }
   });
 }
-var subClassOfMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_SUB_CLASS_OF, {
+var subClassOfMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_SUB_CLASS_OF, {
   transitive: true,
   inference: "subsumption",
   description: "Type inheritance (Podcast subClassOf Media)"
@@ -97,9 +99,9 @@ function subClassOf(child, parent) {
     to: parent
   };
 }
-var broaderMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_BROADER, {
+var broaderMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_BROADER, {
   transitive: true,
-  inverse: chunkKTIEB7VH_cjs.META_EDGE_NARROWER,
+  inverse: chunkFL472AMI_cjs.META_EDGE_NARROWER,
   inference: "hierarchy",
   description: "Broader concept (ML broader AI)"
 });
@@ -110,9 +112,9 @@ function broader(narrowerConcept, broaderConcept) {
     to: broaderConcept
   };
 }
-var narrowerMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_NARROWER, {
+var narrowerMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_NARROWER, {
   transitive: true,
-  inverse: chunkKTIEB7VH_cjs.META_EDGE_BROADER,
+  inverse: chunkFL472AMI_cjs.META_EDGE_BROADER,
   inference: "hierarchy",
   description: "Narrower concept (AI narrower ML)"
 });
@@ -123,7 +125,7 @@ function narrower(broaderConcept, narrowerConcept) {
     to: narrowerConcept
   };
 }
-var relatedToMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_RELATED_TO, {
+var relatedToMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_RELATED_TO, {
   symmetric: true,
   inference: "association",
   description: "Non-hierarchical association"
@@ -135,7 +137,7 @@ function relatedTo(conceptA, conceptB) {
     to: conceptB
   };
 }
-var equivalentToMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_EQUIVALENT_TO, {
+var equivalentToMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_EQUIVALENT_TO, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -148,7 +150,7 @@ function equivalentTo(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var sameAsMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_SAME_AS, {
+var sameAsMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_SAME_AS, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -161,7 +163,7 @@ function sameAs(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var differentFromMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_DIFFERENT_FROM, {
+var differentFromMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_DIFFERENT_FROM, {
   symmetric: true,
   inference: "constraint",
   description: "Explicitly different individuals"
@@ -173,7 +175,7 @@ function differentFrom(kindA, kindB) {
     to: kindB
   };
 }
-var disjointWithMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_DISJOINT_WITH, {
+var disjointWithMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_DISJOINT_WITH, {
   symmetric: true,
   inference: "constraint",
   description: "Mutually exclusive types"
@@ -185,9 +187,9 @@ function disjointWith(kindA, kindB) {
     to: kindB
   };
 }
-var partOfMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_PART_OF, {
+var partOfMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_PART_OF, {
   transitive: true,
-  inverse: chunkKTIEB7VH_cjs.META_EDGE_HAS_PART,
+  inverse: chunkFL472AMI_cjs.META_EDGE_HAS_PART,
   inference: "composition",
   description: "X is part of Y"
 });
@@ -198,9 +200,9 @@ function partOf(part, whole) {
     to: whole
   };
 }
-var hasPartMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_HAS_PART, {
+var hasPartMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_HAS_PART, {
   transitive: true,
-  inverse: chunkKTIEB7VH_cjs.META_EDGE_PART_OF,
+  inverse: chunkFL472AMI_cjs.META_EDGE_PART_OF,
   inference: "composition",
   description: "Y has part X"
 });
@@ -211,12 +213,12 @@ function hasPart(whole, part) {
     to: part
   };
 }
-var inverseOfMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_INVERSE_OF, {
+var inverseOfMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_INVERSE_OF, {
   symmetric: true,
   inference: "none",
   description: "Edge A is inverse of edge B"
 });
-var impliesMetaEdge = createMetaEdge(chunkKTIEB7VH_cjs.META_EDGE_IMPLIES, {
+var impliesMetaEdge = createMetaEdge(chunkFL472AMI_cjs.META_EDGE_IMPLIES, {
   transitive: true,
   inference: "none",
   description: "Edge A implies edge B exists"
@@ -346,25 +348,11 @@ function diffNodes(before, after) {
 }
 function diffNodeDef(name, before, after) {
   const changes = [];
-  if (!chunkOIE2UPVG_cjs.canonicalEqual(before.properties, after.properties)) {
-    const beforeProps = before.properties.properties ?? {};
-    const afterProps = after.properties.properties ?? {};
-    const beforeRequired = new Set(before.properties.required);
-    const afterRequired = new Set(after.properties.required);
-    const addedProps = Object.keys(afterProps).filter(
-      (p) => !(p in beforeProps)
-    );
-    const removedProps = Object.keys(beforeProps).filter(
-      (p) => !(p in afterProps)
-    );
-    const newRequired = [...afterRequired].filter(
-      (p) => !beforeRequired.has(p)
-    );
-    const { severity, details } = computePropertyChangeSeverity(
+  if (!chunkACSVZPK7_cjs.canonicalEqual(before.properties, after.properties)) {
+    const { severity, details } = classifyPropertyChanges(
       name,
-      removedProps,
-      addedProps,
-      newRequired
+      before.properties,
+      after.properties
     );
     changes.push({
       type: "modified",
@@ -385,7 +373,7 @@ function diffNodeDef(name, before, after) {
       after
     });
   }
-  if (!chunkOIE2UPVG_cjs.canonicalEqual(before.uniqueConstraints, after.uniqueConstraints)) {
+  if (!chunkACSVZPK7_cjs.canonicalEqual(before.uniqueConstraints, after.uniqueConstraints)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -407,29 +395,103 @@ function diffNodeDef(name, before, after) {
   }
   return changes;
 }
-function computePropertyChangeSeverity(name, removedProps, addedProps, newRequired) {
-  if (removedProps.length > 0) {
+function propertyTypeSignature(schema) {
+  if (schema.type !== void 0) return JSON.stringify(schema.type);
+  if (schema.const !== void 0) return "const";
+  if (schema.enum !== void 0) return "enum";
+  if (schema.anyOf !== void 0) return "anyOf";
+  if (schema.oneOf !== void 0) return "oneOf";
+  if (schema.allOf !== void 0) return "allOf";
+  return "unknown";
+}
+var NON_CONSTRAINING_KEYWORDS = /* @__PURE__ */ new Set([
+  "description",
+  "title",
+  "default",
+  "$schema"
+]);
+function stripSchemaMetadata(schema) {
+  const stripped = {};
+  for (const [key, value] of Object.entries(schema)) {
+    if (!NON_CONSTRAINING_KEYWORDS.has(key)) stripped[key] = value;
+  }
+  return stripped;
+}
+function isObjectSchema(schema) {
+  return schema.type === "object" || schema.properties !== void 0;
+}
+function isBreakingPropertyChange(before, after) {
+  if (chunkACSVZPK7_cjs.canonicalEqual(stripSchemaMetadata(before), stripSchemaMetadata(after))) {
+    return false;
+  }
+  if (propertyTypeSignature(before) !== propertyTypeSignature(after)) {
+    return true;
+  }
+  if (isObjectSchema(before) && isObjectSchema(after)) {
+    return isBreakingObjectSchemaChange(before, after);
+  }
+  return true;
+}
+function isBreakingObjectSchemaChange(before, after) {
+  const beforeProps = before.properties ?? {};
+  const afterProps = after.properties ?? {};
+  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;
+  }
+  for (const key of afterRequired) {
+    if (!beforeRequired.has(key)) return true;
+  }
+  for (const [key, beforeChild] of Object.entries(beforeProps)) {
+    const afterChild = afterProps[key];
+    if (afterChild === void 0) continue;
+    if (isBreakingPropertyChange(beforeChild, afterChild)) return true;
+  }
+  return false;
+}
+function classifyPropertyChanges(kind, before, after) {
+  const beforeProps = before.properties ?? {};
+  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 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 (isBreakingPropertyChange(beforeProperty, afterProperty)) {
+      breakingProps.push(property);
+    }
+  }
+  if (removed.length > 0) {
+    return {
+      severity: "breaking",
+      details: `Properties removed from "${kind}": ${removed.join(", ")}`
+    };
+  }
+  if (breakingProps.length > 0) {
     return {
       severity: "breaking",
-      details: `Properties removed from "${name}": ${removedProps.join(", ")}`
+      details: `Property schemas changed incompatibly in "${kind}": ${breakingProps.join(", ")}`
     };
   }
   if (newRequired.length > 0) {
     return {
       severity: "breaking",
-      details: `New required properties in "${name}": ${newRequired.join(", ")}`
+      details: `New required properties in "${kind}": ${newRequired.join(", ")}`
     };
   }
-  if (addedProps.length > 0) {
+  if (added.length > 0) {
     return {
       severity: "safe",
-      details: `Properties added to "${name}": ${addedProps.join(", ")}`
+      details: `Properties added to "${kind}": ${added.join(", ")}`
     };
   }
-  return {
-    severity: "safe",
-    details: `Properties changed in "${name}"`
-  };
+  return { severity: "safe", details: `Properties changed in "${kind}"` };
 }
 function diffEdges(before, after) {
   const changes = [];
@@ -469,7 +531,7 @@ function diffEdges(before, after) {
 }
 function diffEdgeDef(name, before, after) {
   const changes = [];
-  if (!chunkOIE2UPVG_cjs.canonicalEqual(before.fromKinds, after.fromKinds)) {
+  if (!chunkACSVZPK7_cjs.canonicalEqual(before.fromKinds, after.fromKinds)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -479,7 +541,7 @@ function diffEdgeDef(name, before, after) {
       after
     });
   }
-  if (!chunkOIE2UPVG_cjs.canonicalEqual(before.toKinds, after.toKinds)) {
+  if (!chunkACSVZPK7_cjs.canonicalEqual(before.toKinds, after.toKinds)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -499,12 +561,17 @@ function diffEdgeDef(name, before, after) {
       after
     });
   }
-  if (!chunkOIE2UPVG_cjs.canonicalEqual(before.properties, after.properties)) {
+  if (!chunkACSVZPK7_cjs.canonicalEqual(before.properties, after.properties)) {
+    const { severity, details } = classifyPropertyChanges(
+      name,
+      before.properties,
+      after.properties
+    );
     changes.push({
       type: "modified",
       kind: name,
-      severity: "safe",
-      details: `Properties changed for "${name}"`,
+      severity,
+      details,
       before,
       after
     });
@@ -524,7 +591,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 !chunkOIE2UPVG_cjs.canonicalEqual(before, after);
+  return !chunkACSVZPK7_cjs.canonicalEqual(before, after);
 }
 function diffOntology(before, after) {
   const changes = [];
@@ -623,7 +690,7 @@ function diffIndexes(before, after) {
   for (const [name, beforeIndex] of beforeByName) {
     const afterIndex = afterByName.get(name);
     if (!afterIndex) continue;
-    if (!chunkOIE2UPVG_cjs.canonicalEqual(beforeIndex, afterIndex)) {
+    if (!chunkACSVZPK7_cjs.canonicalEqual(beforeIndex, afterIndex)) {
       changes.push({
         type: "modified",
         name,
@@ -653,7 +720,7 @@ function diffExtension(before, after) {
       details: "Graph extension document was removed"
     };
   }
-  if (chunkOIE2UPVG_cjs.canonicalEqual(before, after)) return void 0;
+  if (chunkACSVZPK7_cjs.canonicalEqual(before, after)) return void 0;
   return {
     type: "modified",
     severity: "safe",
@@ -805,7 +872,7 @@ var KindRegistry = class {
    * Checks if child is a subclass of parent (directly or transitively).
    */
   isSubClassOf(child, parent) {
-    return chunkKTIEB7VH_cjs.isReachable(this.subClassAncestors, child, parent);
+    return chunkFL472AMI_cjs.isReachable(this.subClassAncestors, child, parent);
   }
   /**
    * Expands a kind to include all its subclasses.
@@ -832,13 +899,13 @@ var KindRegistry = class {
    * Checks if narrowerConcept is narrower than broaderConcept.
    */
   isNarrowerThan(narrowerConcept, broaderConcept) {
-    return chunkKTIEB7VH_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
+    return chunkFL472AMI_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
   }
   /**
    * Checks if broaderConcept is broader than narrowerConcept.
    */
   isBroaderThan(broaderConcept, narrowerConcept) {
-    return chunkKTIEB7VH_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
+    return chunkFL472AMI_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
   }
   /**
    * Expands to include all narrower concepts.
@@ -902,7 +969,7 @@ var KindRegistry = class {
    * Checks if part is part of whole (directly or transitively).
    */
   isPartOf(part, whole) {
-    return chunkKTIEB7VH_cjs.isReachable(this.partOfClosure, part, whole);
+    return chunkFL472AMI_cjs.isReachable(this.partOfClosure, part, whole);
   }
   /**
    * Gets all wholes that contain this part.
@@ -960,6 +1027,17 @@ var KindRegistry = class {
     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.
    */
@@ -1013,57 +1091,57 @@ function computeClosuresFromOntology(ontology) {
     const fromName = getKindName(relation.from);
     const toName = getKindName(relation.to);
     switch (relation.metaEdge.name) {
-      case chunkKTIEB7VH_cjs.META_EDGE_SUB_CLASS_OF: {
+      case chunkFL472AMI_cjs.META_EDGE_SUB_CLASS_OF: {
         subClassRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_BROADER: {
+      case chunkFL472AMI_cjs.META_EDGE_BROADER: {
         broaderRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_NARROWER: {
+      case chunkFL472AMI_cjs.META_EDGE_NARROWER: {
         broaderRelations.push([toName, fromName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_EQUIVALENT_TO:
-      case chunkKTIEB7VH_cjs.META_EDGE_SAME_AS: {
+      case chunkFL472AMI_cjs.META_EDGE_EQUIVALENT_TO:
+      case chunkFL472AMI_cjs.META_EDGE_SAME_AS: {
         equivalentRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_DISJOINT_WITH: {
+      case chunkFL472AMI_cjs.META_EDGE_DISJOINT_WITH: {
         disjointRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_PART_OF: {
+      case chunkFL472AMI_cjs.META_EDGE_PART_OF: {
         partOfRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_HAS_PART: {
+      case chunkFL472AMI_cjs.META_EDGE_HAS_PART: {
         partOfRelations.push([toName, fromName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_INVERSE_OF: {
+      case chunkFL472AMI_cjs.META_EDGE_INVERSE_OF: {
         inverseOfRelations.push([fromName, toName]);
         break;
       }
-      case chunkKTIEB7VH_cjs.META_EDGE_IMPLIES: {
+      case chunkFL472AMI_cjs.META_EDGE_IMPLIES: {
         impliesRelations.push([fromName, toName]);
         break;
       }
     }
   }
-  const subClassAncestors = chunkKTIEB7VH_cjs.computeTransitiveClosure(subClassRelations);
-  const subClassDescendants = chunkKTIEB7VH_cjs.invertClosure(subClassAncestors);
-  const broaderClosure = chunkKTIEB7VH_cjs.computeTransitiveClosure(broaderRelations);
-  const narrowerClosure = chunkKTIEB7VH_cjs.invertClosure(broaderClosure);
+  const subClassAncestors = chunkFL472AMI_cjs.computeTransitiveClosure(subClassRelations);
+  const subClassDescendants = chunkFL472AMI_cjs.invertClosure(subClassAncestors);
+  const broaderClosure = chunkFL472AMI_cjs.computeTransitiveClosure(broaderRelations);
+  const narrowerClosure = chunkFL472AMI_cjs.invertClosure(broaderClosure);
   const equivalenceSets = computeEquivalenceSets(equivalentRelations);
   const iriToKind = computeIriMapping(equivalentRelations);
   const disjointPairs = computeDisjointPairs(disjointRelations);
-  const partOfClosure = chunkKTIEB7VH_cjs.computeTransitiveClosure(partOfRelations);
-  const hasPartClosure = chunkKTIEB7VH_cjs.invertClosure(partOfClosure);
+  const partOfClosure = chunkFL472AMI_cjs.computeTransitiveClosure(partOfRelations);
+  const hasPartClosure = chunkFL472AMI_cjs.invertClosure(partOfClosure);
   const edgeInverses = computeEdgeInverses(inverseOfRelations);
-  const edgeImplicationsClosure = chunkKTIEB7VH_cjs.computeTransitiveClosure(impliesRelations);
-  const edgeImplyingClosure = chunkKTIEB7VH_cjs.invertClosure(edgeImplicationsClosure);
+  const edgeImplicationsClosure = chunkFL472AMI_cjs.computeTransitiveClosure(impliesRelations);
+  const edgeImplyingClosure = chunkFL472AMI_cjs.invertClosure(edgeImplicationsClosure);
   return {
     subClassAncestors,
     subClassDescendants,
@@ -1167,7 +1245,7 @@ function serializeSchema(graph, version) {
   return {
     graphId: graph.id,
     version,
-    generatedAt: chunkMBLXCV2Y_cjs.nowIso(),
+    generatedAt: chunkBLZDPRXT_cjs.nowIso(),
     nodes,
     edges,
     ontology,
@@ -1198,7 +1276,7 @@ function serializeDeprecatedKinds(set) {
 function canonicalExtension(document) {
   if (document === void 0) return void 0;
   if (document.version === void 0) return document;
-  if (document.version !== chunkKTIEB7VH_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
+  if (document.version !== chunkFL472AMI_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
   const { version: _omit, ...rest } = document;
   return rest;
 }
@@ -1247,6 +1325,16 @@ function serializeNodeIndexDeclaration(declaration) {
     unique: declaration.unique,
     scope: declaration.scope,
     where: declaration.where,
+    // `method: "btree"` is canonicalized by absence, like `origin` below.
+    ...declaration.method === void 0 ? {} : { method: declaration.method },
+    // `keySystemColumns: []` is canonicalized by absence, same rule. Checked
+    // against length, not just `undefined` — `NodeIndexDeclaration` is
+    // exported and `defineGraph` accepts pre-built declarations directly
+    // (bypassing `defineNodeIndex`'s own canonicalization and the
+    // `nodeIndexDeclarationZod` parse boundary, which rejects an explicit
+    // `[]` via `.min(1)`), so an in-memory declaration can still carry a
+    // present-but-empty array that must canonicalize to absent here.
+    ...declaration.keySystemColumns === void 0 || declaration.keySystemColumns.length === 0 ? {} : { keySystemColumns: declaration.keySystemColumns },
     // `origin: "compile-time"` is the default and is omitted from the
     // canonical form (absence == compile-time). Only `runtime` is
     // emitted explicitly so the restart loader can route the declaration
@@ -1267,12 +1355,14 @@ function serializeEdgeIndexDeclaration(declaration) {
     unique: declaration.unique,
     scope: declaration.scope,
     where: declaration.where,
+    // `method: "btree"` is canonicalized by absence, like `origin`.
+    ...declaration.method === void 0 ? {} : { method: declaration.method },
     ...declaration.origin === "runtime" ? { origin: "runtime" } : {}
   };
 }
 function serializeNodes(graph) {
   const result = {};
-  for (const kindName of chunkMBLXCV2Y_cjs.getNodeKinds(graph)) {
+  for (const kindName of chunkVPYHY3LJ_cjs.getNodeKinds(graph)) {
     const registration = graph.nodes[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeNodeDef(registration);
@@ -1340,7 +1430,7 @@ function deserializeWherePredicate(serialized) {
 }
 function serializeEdges(graph) {
   const result = {};
-  for (const kindName of chunkMBLXCV2Y_cjs.getEdgeKinds(graph)) {
+  for (const kindName of chunkVPYHY3LJ_cjs.getEdgeKinds(graph)) {
     const registration = graph.edges[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeEdgeDef(registration);
@@ -1442,11 +1532,7 @@ function mapToRecord(map) {
   return result;
 }
 function mapToSimpleRecord(map) {
-  const result = {};
-  for (const [key, value] of map) {
-    result[key] = value;
-  }
-  return result;
+  return Object.fromEntries(map);
 }
 var SCHEMA_PROPERTIES_CACHE = /* @__PURE__ */ new WeakMap();
 function serializeSchemaProperties(schema) {
@@ -1488,8 +1574,8 @@ async function computeSchemaHash(schema) {
     ...schema.extension === void 0 ? {} : { extension: schema.extension },
     ...schema.deprecatedKinds === void 0 ? {} : { deprecatedKinds: schema.deprecatedKinds }
   };
-  const json = JSON.stringify(hashable, chunkOIE2UPVG_cjs.sortedReplacer);
-  return chunk73KASJGO_cjs.sha256Hex(json);
+  const json = JSON.stringify(hashable, chunkACSVZPK7_cjs.sortedReplacer);
+  return chunkTEDRJXOG_cjs.sha256Hex(json);
 }
 var COMPILE_NODE_CACHE = /* @__PURE__ */ new Map();
 var COMPILE_EDGE_SCHEMA_CACHE = /* @__PURE__ */ new WeakMap();
@@ -1537,7 +1623,7 @@ function compileNode(kindName, document) {
   const schema = buildObjectSchema(document.properties);
   const type = defineNode(
     kindName,
-    chunkKTIEB7VH_cjs.compactUndefined({
+    chunkDI74SMXS_cjs.compactUndefined({
       schema,
       description: document.description,
       annotations: document.annotations
@@ -1561,7 +1647,7 @@ function compileEdge(kindName, document, nodeTypeByName) {
     (name) => nodeTypeByName.get(name) ?? name
   );
   return Object.freeze(
-    chunkKTIEB7VH_cjs.compactUndefined({
+    chunkDI74SMXS_cjs.compactUndefined({
       kindName,
       schema,
       description: document.description,
@@ -1605,7 +1691,7 @@ function compileProperty(property) {
 }
 function compileStringProperty(property) {
   if (property.searchable !== void 0) {
-    return applyStringRefinements(chunkEF3Z645U_cjs.searchable(property.searchable), property);
+    return applyStringRefinements(chunkH7YNSMA7_cjs.searchable(property.searchable), property);
   }
   if (property.format === void 0) {
     return applyStringRefinements(zod.z.string(), property);
@@ -1655,7 +1741,7 @@ function compileEnumProperty(property) {
 }
 function compileArrayProperty(property) {
   if (property.embedding !== void 0) {
-    return chunkZFWNO3GE_cjs.embedding(property.embedding.dimensions);
+    return chunkH7YNSMA7_cjs.embedding(property.embedding.dimensions);
   }
   const inner = compilePropertyForArrayItem(property.items);
   return zod.z.array(inner);
@@ -1695,7 +1781,7 @@ function makeWherePredicate(field, op) {
   };
 }
 var META_EDGE_BY_NAME = Object.fromEntries(
-  chunkKTIEB7VH_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
+  chunkFL472AMI_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
 );
 function compileOntologyRelation(relation, nodeTypeByName) {
   const metaEdge = META_EDGE_BY_NAME[relation.metaEdge];
@@ -1731,10 +1817,10 @@ function extensionKindNames(document) {
 function mergeGraphExtension(graph, document) {
   const existingDocument = graph.extension ?? Object.freeze({});
   const unionDocument = unionDocuments(existingDocument, document);
-  if (graph.extension !== void 0 && chunkOIE2UPVG_cjs.canonicalEqual(unionDocument, existingDocument)) {
+  if (graph.extension !== void 0 && chunkACSVZPK7_cjs.canonicalEqual(unionDocument, existingDocument)) {
     return graph;
   }
-  const validatedUnion = chunkKTIEB7VH_cjs.unwrap(chunkKTIEB7VH_cjs.validateGraphExtension(unionDocument));
+  const validatedUnion = chunkFL472AMI_cjs.unwrap(chunkFL472AMI_cjs.validateGraphExtension(unionDocument));
   const compiled = compileGraphExtension(validatedUnion);
   const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } = extensionKindNames(existingDocument);
   const nodeKinds = /* @__PURE__ */ new Map();
@@ -1786,7 +1872,7 @@ function mergeGraphExtension(graph, document) {
     });
     const type = defineEdge(
       edge.kindName,
-      chunkKTIEB7VH_cjs.compactUndefined({
+      chunkDI74SMXS_cjs.compactUndefined({
         schema: edge.schema,
         description: edge.description,
         annotations: edge.annotations,
@@ -1836,7 +1922,7 @@ function deriveGraphExtensionVectorIndexes(compiledNodes) {
       ...compiled.unique.length === 0 ? {} : { unique: [...compiled.unique] }
     };
   }
-  return chunkMBLXCV2Y_cjs.autoDeriveVectorIndexes(registrations).map(
+  return chunkVPYHY3LJ_cjs.autoDeriveVectorIndexes(registrations).map(
     (index) => Object.freeze({ ...index, origin: "runtime" })
   );
 }
@@ -1854,7 +1940,7 @@ function mergeIndexesWithGraphExtension(existing, runtimeIndexes, graphId) {
   const runtimeRelational = runtimeIndexes.filter(
     (index) => index.entity !== "vector"
   );
-  const vectorMerged = chunkMBLXCV2Y_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
+  const vectorMerged = chunkVPYHY3LJ_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
   const merged = [...vectorMerged, ...runtimeRelational];
   assertUniqueIndexNames(merged, graphId);
   return merged;
@@ -1866,7 +1952,7 @@ function assertUniqueIndexNames(indexes, graphId) {
       seen.add(index.name);
       continue;
     }
-    throw new chunkJIEJCTDS_cjs.ConfigurationError(
+    throw new chunkLGEALRC6_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" },
       {
@@ -1882,12 +1968,12 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
     if (document.entity === "node") {
       const node = nodeKinds.get(document.kind);
       if (node === void 0) {
-        throw new chunkJIEJCTDS_cjs.KindNotFoundError(document.kind, "node", {
+        throw new chunkLGEALRC6_cjs.KindNotFoundError(document.kind, "node", {
           graphId,
           suggestion: "Declare the kind under `nodes` in this graph extension, or remove the index from `indexes`."
         });
       }
-      const declaration2 = chunk3IR2GEMJ_cjs.defineNodeIndex(
+      const declaration2 = chunkUUT7UN2N_cjs.defineNodeIndex(
         node,
         toNodeIndexConfig(document)
       );
@@ -1896,12 +1982,12 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
     }
     const edgeRegistration = mergedEdges[document.kind];
     if (edgeRegistration === void 0) {
-      throw new chunkJIEJCTDS_cjs.KindNotFoundError(document.kind, "edge", {
+      throw new chunkLGEALRC6_cjs.KindNotFoundError(document.kind, "edge", {
         graphId,
         suggestion: "Declare the edge under `edges` in this graph extension, or remove the index from `indexes`."
       });
     }
-    const declaration = chunk3IR2GEMJ_cjs.defineEdgeIndex(
+    const declaration = chunkUUT7UN2N_cjs.defineEdgeIndex(
       edgeRegistration.type,
       toEdgeIndexConfig(document)
     );
@@ -1913,7 +1999,7 @@ function buildWhereCallback(where) {
   return (props) => {
     const builder = props[where.field];
     if (builder === void 0) {
-      throw new chunkJIEJCTDS_cjs.ConfigurationError(
+      throw new chunkLGEALRC6_cjs.ConfigurationError(
         `Graph-extension index \`where\` references unknown field "${where.field}".`,
         { field: where.field, code: "EXTENSION_INDEX_WHERE_UNKNOWN_FIELD" }
       );
@@ -1922,7 +2008,7 @@ function buildWhereCallback(where) {
   };
 }
 function toNodeIndexConfig(document) {
-  return chunkKTIEB7VH_cjs.compactUndefined({
+  return chunkDI74SMXS_cjs.compactUndefined({
     fields: document.fields,
     coveringFields: document.coveringFields,
     unique: document.unique,
@@ -1932,7 +2018,7 @@ function toNodeIndexConfig(document) {
   });
 }
 function toEdgeIndexConfig(document) {
-  return chunkKTIEB7VH_cjs.compactUndefined({
+  return chunkDI74SMXS_cjs.compactUndefined({
     fields: document.fields,
     coveringFields: document.coveringFields,
     unique: document.unique,
@@ -1988,14 +2074,14 @@ function isEmptyExtension(extension) {
 }
 function assertNoCollision(kindName, entity, collides, graphId) {
   if (!collides) return;
-  throw new chunkKTIEB7VH_cjs.KindCollisionError(kindName, entity, graphId);
+  throw new chunkFL472AMI_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 chunkKTIEB7VH_cjs.GraphExtensionUnresolvedEndpointError(
+      throw new chunkFL472AMI_cjs.GraphExtensionUnresolvedEndpointError(
         context.edgeKind,
         context.side,
         entry,
@@ -2010,6 +2096,94 @@ function resolveOntologyEndpoints(relation, nodeKinds) {
   const to = typeof relation.to === "string" ? nodeKinds.get(relation.to) ?? relation.to : relation.to;
   return { ...relation, from, to };
 }
+
+// src/registry/validate-implies.ts
+function validateImpliesEndpointCompatibility(edgeEndpoints, registry) {
+  for (const [impliedEdgeKind, impliedEndpoints] of edgeEndpoints) {
+    for (const implyingEdgeKind of registry.expandImplyingEdges(
+      impliedEdgeKind
+    )) {
+      if (implyingEdgeKind === impliedEdgeKind) continue;
+      const implyingEndpoints = edgeEndpoints.get(implyingEdgeKind);
+      if (!implyingEndpoints) continue;
+      assertEndpointCompatible(
+        "from",
+        implyingEdgeKind,
+        implyingEndpoints.from,
+        impliedEdgeKind,
+        impliedEndpoints.from,
+        registry
+      );
+      assertEndpointCompatible(
+        "to",
+        implyingEdgeKind,
+        implyingEndpoints.to,
+        impliedEdgeKind,
+        impliedEndpoints.to,
+        registry
+      );
+    }
+  }
+}
+function assertEndpointCompatible(side, implyingEdgeKind, implyingKinds, impliedEdgeKind, impliedKinds, registry) {
+  const incompatibleKinds = implyingKinds.filter(
+    (kind) => !registry.isAssignableToAny(kind, impliedKinds)
+  );
+  if (incompatibleKinds.length === 0) return;
+  throw new chunkLGEALRC6_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: chunkFL472AMI_cjs.META_EDGE_IMPLIES,
+      implyingEdge: implyingEdgeKind,
+      impliedEdge: impliedEdgeKind,
+      endpoint: side,
+      incompatibleKinds,
+      allowedKinds: impliedKinds
+    },
+    {
+      suggestion: `Add a subClassOf relation from each of [${incompatibleKinds.join(", ")}] to one of "${impliedEdgeKind}"'s ${side} kind(s) [${impliedKinds.join(", ")}], narrow "${implyingEdgeKind}"'s ${side} declaration to exclude [${incompatibleKinds.join(", ")}], or remove implies("${implyingEdgeKind}", "${impliedEdgeKind}").`
+    }
+  );
+}
+
+// src/registry/builders.ts
+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;
+}
+function buildEdgeEndpointKinds(edges) {
+  const result = /* @__PURE__ */ new Map();
+  for (const [kind, registration] of Object.entries(edges)) {
+    result.set(kind, {
+      from: registration.from.map((node) => node.kind),
+      to: registration.to.map((node) => node.kind)
+    });
+  }
+  return result;
+}
+function extractNodeTypes(graph) {
+  const result = /* @__PURE__ */ new Map();
+  for (const typeName of chunkVPYHY3LJ_cjs.getNodeKinds(graph)) {
+    const registration = graph.nodes[typeName];
+    result.set(typeName, registration.type);
+  }
+  return result;
+}
+function extractEdgeTypes(graph) {
+  const result = /* @__PURE__ */ new Map();
+  for (const typeName of chunkVPYHY3LJ_cjs.getEdgeKinds(graph)) {
+    const registration = graph.edges[typeName];
+    result.set(typeName, registration.type);
+  }
+  return result;
+}
 var deleteBehaviorZod = zod.z.enum(["restrict", "cascade", "disconnect"]);
 var cardinalityZod = zod.z.enum(["many", "one", "unique", "oneActive"]);
 var endpointExistenceZod = zod.z.enum(["notDeleted", "currentlyValid", "ever"]);
@@ -2059,6 +2233,12 @@ var systemColumnNameZod = zod.z.enum([
   "updated_at",
   "version"
 ]);
+var nodeSystemColumnNameZod = systemColumnNameZod.exclude([
+  "from_kind",
+  "from_id",
+  "to_kind",
+  "to_id"
+]);
 var indexWhereOperandZod = zod.z.discriminatedUnion("__type", [
   zod.z.object({
     __type: zod.z.literal("index_operand_system"),
@@ -2135,7 +2315,13 @@ var indexDeclarationCommonShape = {
 var nodeIndexDeclarationZod = zod.z.object({
   entity: zod.z.literal("node"),
   kind: zod.z.string(),
-  ...indexDeclarationCommonShape
+  ...indexDeclarationCommonShape,
+  // Node-only; canonicalized by absence like `method`, so absent/optional
+  // here matches `defineNodeIndex` only emitting it when non-empty.
+  // `.min(1)` rejects an explicit `[]` at the boundary rather than
+  // silently accepting a present-but-empty array that would have to be
+  // canonicalized away again downstream (see `serializeNodeIndexDeclaration`).
+  keySystemColumns: zod.z.array(nodeSystemColumnNameZod).min(1).optional()
 }).loose();
 var edgeIndexDeclarationZod = zod.z.object({
   entity: zod.z.literal("edge"),
@@ -2340,7 +2526,7 @@ function parseSerializedSchema(json) {
   try {
     parsed = JSON.parse(json);
   } catch {
-    throw new chunkJIEJCTDS_cjs.DatabaseOperationError(
+    throw new chunkLGEALRC6_cjs.DatabaseOperationError(
       "Stored schema document is not valid JSON",
       { operation: "select", entity: "schema" }
     );
@@ -2348,12 +2534,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 chunkJIEJCTDS_cjs.DatabaseOperationError(
+    throw new chunkLGEALRC6_cjs.DatabaseOperationError(
       `Stored schema document is malformed: ${issues}`,
       { operation: "select", entity: "schema" }
     );
   }
-  const validated = chunkKTIEB7VH_cjs.freezeDeep(result.data);
+  const validated = chunkDI74SMXS_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);
@@ -2365,7 +2551,7 @@ async function loadActiveSchemaWithBootstrap(backend, graphId) {
   try {
     return await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (backend.bootstrapTables && chunkOIE2UPVG_cjs.isMissingTableError(error)) {
+    if (backend.bootstrapTables && chunkBLZDPRXT_cjs.isMissingTableError(error)) {
       await backend.bootstrapTables();
       return await backend.getActiveSchema(graphId);
     }
@@ -2459,7 +2645,7 @@ async function ensureSchema(backend, graph, options) {
   }
   const actions = getMigrationActions(diff);
   if (throwOnBreaking) {
-    throw new chunkJIEJCTDS_cjs.MigrationError(
+    throw new chunkLGEALRC6_cjs.MigrationError(
       `Schema migration required: ${diff.summary}. ${actions.length} migration action(s) needed. Use getSchemaChanges() to review, then migrateSchema() to apply.`,
       {
         graphId: graph.id,
@@ -2495,7 +2681,7 @@ async function loadAndVerifyGraph(backend, graph) {
 function schemaBehindError(graphId, fromVersion, diff) {
   const actions = getMigrationActions(diff);
   const qualifier = isBackwardsCompatible(diff) ? "safe auto-migration" : "breaking change";
-  return new chunkJIEJCTDS_cjs.MigrationError(
+  return new chunkLGEALRC6_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,
@@ -2513,7 +2699,7 @@ async function readActiveSchemaPure(backend, graphId) {
   try {
     activeRow = await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (chunkOIE2UPVG_cjs.isMissingTableError(error)) {
+    if (chunkBLZDPRXT_cjs.isMissingTableError(error)) {
       throw schemaNotInitializedError(graphId, error);
     }
     throw error;
@@ -2524,7 +2710,7 @@ async function readActiveSchemaPure(backend, graphId) {
   return activeRow;
 }
 function schemaNotInitializedError(graphId, cause) {
-  return new chunkJIEJCTDS_cjs.ConfigurationError(
+  return new chunkLGEALRC6_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 },
     {
@@ -2534,6 +2720,7 @@ function schemaNotInitializedError(graphId, cause) {
   );
 }
 async function initializeSchema(backend, graph) {
+  buildKindRegistry(graph);
   const schema = serializeSchema(graph, 1);
   const hash = await computeSchemaHash(schema);
   return backend.commitSchemaVersion({
@@ -2553,6 +2740,7 @@ async function migrateSchema(backend, graph, currentVersion) {
   return committed.version;
 }
 async function commitNewSchemaVersion(backend, graph, currentVersion) {
+  buildKindRegistry(graph);
   const newVersion = currentVersion + 1;
   const schema = serializeSchema(graph, newVersion);
   const hash = await computeSchemaHash(schema);
@@ -2567,7 +2755,7 @@ async function commitNewSchemaVersion(backend, graph, currentVersion) {
 async function rollbackSchema(backend, graphId, targetVersion) {
   const activeRow = await backend.getActiveSchema(graphId);
   if (activeRow === void 0) {
-    throw new chunkJIEJCTDS_cjs.MigrationError(
+    throw new chunkLGEALRC6_cjs.MigrationError(
       `Cannot rollback graph "${graphId}": no active schema version exists.`,
       { graphId, fromVersion: 0, toVersion: targetVersion }
     );
@@ -2595,92 +2783,18 @@ async function getSchemaChanges(backend, graph) {
   return computeSchemaDiff(storedSchema, currentSchema);
 }
 
-// src/errors/validation.ts
-function zodIssuesToValidationIssues(error) {
-  return error.issues.map((issue) => ({
-    path: issue.path.join("."),
-    message: issue.message,
-    code: issue.code
-  }));
-}
-function buildLocationString(context) {
-  if (context.id) {
-    return `${context.kind}/${context.id}`;
-  }
-  return `new ${context.kind}`;
-}
-function validateProps(schema, props, context) {
-  const result = schema.safeParse(props);
-  if (result.success) {
-    return result.data;
-  }
-  const issues = zodIssuesToValidationIssues(result.error);
-  const location = buildLocationString(context);
-  throw new chunkJIEJCTDS_cjs.ValidationError(
-    `Invalid ${context.entityType} props for ${location}: ${result.error.message}`,
-    {
-      entityType: context.entityType,
-      kind: context.kind,
-      operation: context.operation,
-      ...context.id !== void 0 && { id: context.id },
-      issues
-    },
-    { cause: result.error }
-  );
-}
-function validateNodeProps(schema, props, context) {
-  return validateProps(schema, props, {
-    entityType: "node",
-    ...context
-  });
-}
-function validateEdgeProps(schema, props, context) {
-  return validateProps(schema, props, {
-    entityType: "edge",
-    ...context
-  });
-}
-function wrapZodError(error, context) {
-  const issues = zodIssuesToValidationIssues(error);
-  const location = buildLocationString(context);
-  return new chunkJIEJCTDS_cjs.ValidationError(
-    `Validation failed for ${context.entityType} ${location}: ${error.message}`,
-    {
-      entityType: context.entityType,
-      kind: context.kind,
-      operation: context.operation,
-      ...context.id !== void 0 && { id: context.id },
-      issues
-    },
-    { cause: error }
-  );
-}
-function createValidationError(message, issues, context) {
-  return new chunkJIEJCTDS_cjs.ValidationError(message, {
-    ...context?.entityType !== void 0 && {
-      entityType: context.entityType
-    },
-    ...context?.kind !== void 0 && { kind: context.kind },
-    ...context?.operation !== void 0 && { operation: context.operation },
-    ...context?.id !== void 0 && { id: context.id },
-    issues
-  });
-}
-
 exports.KindRegistry = KindRegistry;
 exports.META_EDGE_BRAND = META_EDGE_BRAND;
 exports.applyDeprecatedKinds = applyDeprecatedKinds;
 exports.assertSchemaCurrent = assertSchemaCurrent;
 exports.broader = broader;
 exports.buildGraphExtensionOntologyKeySet = buildGraphExtensionOntologyKeySet;
+exports.buildKindRegistry = buildKindRegistry;
 exports.commitNewSchemaVersion = commitNewSchemaVersion;
 exports.compileTimeOntologyKey = compileTimeOntologyKey;
-exports.computeClosuresFromOntology = computeClosuresFromOntology;
 exports.computeSchemaDiff = computeSchemaDiff;
 exports.computeSchemaHash = computeSchemaHash;
 exports.core = core;
-exports.createEmptyClosures = createEmptyClosures;
-exports.createValidationError = createValidationError;
 exports.defineEdge = defineEdge;
 exports.defineNode = defineNode;
 exports.deserializeWherePredicate = deserializeWherePredicate;
@@ -2711,12 +2825,10 @@ exports.partOf = partOf;
 exports.relatedTo = relatedTo;
 exports.rollbackSchema = rollbackSchema;
 exports.sameAs = sameAs;
+exports.serializeIndexDeclaration = serializeIndexDeclaration;
 exports.serializeSchema = serializeSchema;
 exports.serializeSchemaProperties = serializeSchemaProperties;
 exports.subClassOf = subClassOf;
-exports.validateEdgeProps = validateEdgeProps;
-exports.validateNodeProps = validateNodeProps;
-exports.validateProps = validateProps;
-exports.wrapZodError = wrapZodError;
-//# sourceMappingURL=chunk-NG5N7R45.cjs.map
-//# sourceMappingURL=chunk-NG5N7R45.cjs.map
+exports.validateImpliesEndpointCompatibility = validateImpliesEndpointCompatibility;
+//# sourceMappingURL=chunk-CK5BVQOW.cjs.map
+//# sourceMappingURL=chunk-CK5BVQOW.cjs.map