@nicia-ai/typegraph 0.34.0 → 0.36.0

package/dist/{chunk-6HVOHZHS.cjs → chunk-PWGX5DF5.cjs}

@@ -1,33 +1,33 @@
 'use strict';
 
+var chunk2THZ3TQI_cjs = require('./chunk-2THZ3TQI.cjs');
 var chunkACSVZPK7_cjs = require('./chunk-ACSVZPK7.cjs');
-var chunkT6SPUYLX_cjs = require('./chunk-T6SPUYLX.cjs');
-var chunkRRKQAKD6_cjs = require('./chunk-RRKQAKD6.cjs');
-var chunkZY4GXIVN_cjs = require('./chunk-ZY4GXIVN.cjs');
-var chunkHK5SATYM_cjs = require('./chunk-HK5SATYM.cjs');
-var chunkYC6PWTHY_cjs = require('./chunk-YC6PWTHY.cjs');
-var chunkRHZWOJVA_cjs = require('./chunk-RHZWOJVA.cjs');
-var chunkJQGIPGVL_cjs = require('./chunk-JQGIPGVL.cjs');
+var chunkUUT7UN2N_cjs = require('./chunk-UUT7UN2N.cjs');
+var chunkTEDRJXOG_cjs = require('./chunk-TEDRJXOG.cjs');
+var chunkJ3LEGNQB_cjs = require('./chunk-J3LEGNQB.cjs');
+var chunk4BCU6VFZ_cjs = require('./chunk-4BCU6VFZ.cjs');
+var chunkRSSQKPSZ_cjs = require('./chunk-RSSQKPSZ.cjs');
+var chunkH7YNSMA7_cjs = require('./chunk-H7YNSMA7.cjs');
 var chunkDI74SMXS_cjs = require('./chunk-DI74SMXS.cjs');
-var chunkJIEJCTDS_cjs = require('./chunk-JIEJCTDS.cjs');
+var chunkDIK74MXX_cjs = require('./chunk-DIK74MXX.cjs');
 var zod = require('zod');
 
 // src/core/node.ts
 function validateSchemaKeys(schema, name) {
-  chunkHK5SATYM_cjs.assertSchemaKeysAreFree(
+  chunk4BCU6VFZ_cjs.assertSchemaKeysAreFree(
     "Node",
     name,
     Object.keys(schema.shape),
-    chunkHK5SATYM_cjs.RESERVED_NODE_KEYS
+    chunk4BCU6VFZ_cjs.RESERVED_NODE_KEYS
   );
 }
 function defineNode(name, options) {
   validateSchemaKeys(options.schema, name);
   if (options.annotations !== void 0) {
-    chunkHK5SATYM_cjs.assertJsonValue(options.annotations, "annotations", `Node "${name}"`);
+    chunkJ3LEGNQB_cjs.assertJsonValue(options.annotations, "annotations", `Node "${name}"`);
   }
   return Object.freeze({
-    [chunkT6SPUYLX_cjs.NODE_TYPE_BRAND]: true,
+    [chunk2THZ3TQI_cjs.NODE_TYPE_BRAND]: true,
     kind: name,
     schema: options.schema,
     description: options.description,
@@ -36,21 +36,21 @@ function defineNode(name, options) {
 }
 var EMPTY_SCHEMA = zod.z.object({});
 function validateSchemaKeys2(schema, name) {
-  chunkHK5SATYM_cjs.assertSchemaKeysAreFree(
+  chunk4BCU6VFZ_cjs.assertSchemaKeysAreFree(
     "Edge",
     name,
     Object.keys(schema.shape),
-    chunkHK5SATYM_cjs.RESERVED_EDGE_KEYS
+    chunk4BCU6VFZ_cjs.RESERVED_EDGE_KEYS
   );
 }
 function defineEdge(name, options) {
   const schema = options?.schema ?? EMPTY_SCHEMA;
   validateSchemaKeys2(schema, name);
   if (options?.annotations !== void 0) {
-    chunkHK5SATYM_cjs.assertJsonValue(options.annotations, "annotations", `Edge "${name}"`);
+    chunkJ3LEGNQB_cjs.assertJsonValue(options.annotations, "annotations", `Edge "${name}"`);
   }
   return Object.freeze({
-    [chunkT6SPUYLX_cjs.EDGE_TYPE_BRAND]: true,
+    [chunk2THZ3TQI_cjs.EDGE_TYPE_BRAND]: true,
     kind: name,
     schema,
     description: options?.description,
@@ -87,7 +87,7 @@ function createMetaEdge(name, properties) {
     }
   });
 }
-var subClassOfMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_SUB_CLASS_OF, {
+var subClassOfMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_SUB_CLASS_OF, {
   transitive: true,
   inference: "subsumption",
   description: "Type inheritance (Podcast subClassOf Media)"
@@ -99,9 +99,9 @@ function subClassOf(child, parent) {
     to: parent
   };
 }
-var broaderMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_BROADER, {
+var broaderMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_BROADER, {
   transitive: true,
-  inverse: chunkHK5SATYM_cjs.META_EDGE_NARROWER,
+  inverse: chunkJ3LEGNQB_cjs.META_EDGE_NARROWER,
   inference: "hierarchy",
   description: "Broader concept (ML broader AI)"
 });
@@ -112,9 +112,9 @@ function broader(narrowerConcept, broaderConcept) {
     to: broaderConcept
   };
 }
-var narrowerMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_NARROWER, {
+var narrowerMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_NARROWER, {
   transitive: true,
-  inverse: chunkHK5SATYM_cjs.META_EDGE_BROADER,
+  inverse: chunkJ3LEGNQB_cjs.META_EDGE_BROADER,
   inference: "hierarchy",
   description: "Narrower concept (AI narrower ML)"
 });
@@ -125,7 +125,7 @@ function narrower(broaderConcept, narrowerConcept) {
     to: narrowerConcept
   };
 }
-var relatedToMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_RELATED_TO, {
+var relatedToMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_RELATED_TO, {
   symmetric: true,
   inference: "association",
   description: "Non-hierarchical association"
@@ -137,7 +137,7 @@ function relatedTo(conceptA, conceptB) {
     to: conceptB
   };
 }
-var equivalentToMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_EQUIVALENT_TO, {
+var equivalentToMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_EQUIVALENT_TO, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -150,7 +150,7 @@ function equivalentTo(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var sameAsMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_SAME_AS, {
+var sameAsMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_SAME_AS, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -163,7 +163,7 @@ function sameAs(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var differentFromMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_DIFFERENT_FROM, {
+var differentFromMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_DIFFERENT_FROM, {
   symmetric: true,
   inference: "constraint",
   description: "Explicitly different individuals"
@@ -175,7 +175,7 @@ function differentFrom(kindA, kindB) {
     to: kindB
   };
 }
-var disjointWithMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_DISJOINT_WITH, {
+var disjointWithMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_DISJOINT_WITH, {
   symmetric: true,
   inference: "constraint",
   description: "Mutually exclusive types"
@@ -187,9 +187,9 @@ function disjointWith(kindA, kindB) {
     to: kindB
   };
 }
-var partOfMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_PART_OF, {
+var partOfMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_PART_OF, {
   transitive: true,
-  inverse: chunkHK5SATYM_cjs.META_EDGE_HAS_PART,
+  inverse: chunkJ3LEGNQB_cjs.META_EDGE_HAS_PART,
   inference: "composition",
   description: "X is part of Y"
 });
@@ -200,9 +200,9 @@ function partOf(part, whole) {
     to: whole
   };
 }
-var hasPartMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_HAS_PART, {
+var hasPartMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_HAS_PART, {
   transitive: true,
-  inverse: chunkHK5SATYM_cjs.META_EDGE_PART_OF,
+  inverse: chunkJ3LEGNQB_cjs.META_EDGE_PART_OF,
   inference: "composition",
   description: "Y has part X"
 });
@@ -213,12 +213,12 @@ function hasPart(whole, part) {
     to: part
   };
 }
-var inverseOfMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_INVERSE_OF, {
+var inverseOfMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_INVERSE_OF, {
   symmetric: true,
   inference: "none",
   description: "Edge A is inverse of edge B"
 });
-var impliesMetaEdge = createMetaEdge(chunkHK5SATYM_cjs.META_EDGE_IMPLIES, {
+var impliesMetaEdge = createMetaEdge(chunkJ3LEGNQB_cjs.META_EDGE_IMPLIES, {
   transitive: true,
   inference: "none",
   description: "Edge A implies edge B exists"
@@ -872,7 +872,7 @@ var KindRegistry = class {
    * Checks if child is a subclass of parent (directly or transitively).
    */
   isSubClassOf(child, parent) {
-    return chunkHK5SATYM_cjs.isReachable(this.subClassAncestors, child, parent);
+    return chunkJ3LEGNQB_cjs.isReachable(this.subClassAncestors, child, parent);
   }
   /**
    * Expands a kind to include all its subclasses.
@@ -899,13 +899,13 @@ var KindRegistry = class {
    * Checks if narrowerConcept is narrower than broaderConcept.
    */
   isNarrowerThan(narrowerConcept, broaderConcept) {
-    return chunkHK5SATYM_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
+    return chunkJ3LEGNQB_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
   }
   /**
    * Checks if broaderConcept is broader than narrowerConcept.
    */
   isBroaderThan(broaderConcept, narrowerConcept) {
-    return chunkHK5SATYM_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
+    return chunkJ3LEGNQB_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
   }
   /**
    * Expands to include all narrower concepts.
@@ -969,7 +969,7 @@ var KindRegistry = class {
    * Checks if part is part of whole (directly or transitively).
    */
   isPartOf(part, whole) {
-    return chunkHK5SATYM_cjs.isReachable(this.partOfClosure, part, whole);
+    return chunkJ3LEGNQB_cjs.isReachable(this.partOfClosure, part, whole);
   }
   /**
    * Gets all wholes that contain this part.
@@ -1027,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.
    */
@@ -1080,57 +1091,57 @@ function computeClosuresFromOntology(ontology) {
     const fromName = getKindName(relation.from);
     const toName = getKindName(relation.to);
     switch (relation.metaEdge.name) {
-      case chunkHK5SATYM_cjs.META_EDGE_SUB_CLASS_OF: {
+      case chunkJ3LEGNQB_cjs.META_EDGE_SUB_CLASS_OF: {
         subClassRelations.push([fromName, toName]);
         break;
       }
-      case chunkHK5SATYM_cjs.META_EDGE_BROADER: {
+      case chunkJ3LEGNQB_cjs.META_EDGE_BROADER: {
         broaderRelations.push([fromName, toName]);
         break;
       }
-      case chunkHK5SATYM_cjs.META_EDGE_NARROWER: {
+      case chunkJ3LEGNQB_cjs.META_EDGE_NARROWER: {
         broaderRelations.push([toName, fromName]);
         break;
       }
-      case chunkHK5SATYM_cjs.META_EDGE_EQUIVALENT_TO:
-      case chunkHK5SATYM_cjs.META_EDGE_SAME_AS: {
+      case chunkJ3LEGNQB_cjs.META_EDGE_EQUIVALENT_TO:
+      case chunkJ3LEGNQB_cjs.META_EDGE_SAME_AS: {
         equivalentRelations.push([fromName, toName]);
         break;
       }
-      case chunkHK5SATYM_cjs.META_EDGE_DISJOINT_WITH: {
+      case chunkJ3LEGNQB_cjs.META_EDGE_DISJOINT_WITH: {
         disjointRelations.push([fromName, toName]);
         break;
       }
-      case chunkHK5SATYM_cjs.META_EDGE_PART_OF: {
+      case chunkJ3LEGNQB_cjs.META_EDGE_PART_OF: {
         partOfRelations.push([fromName, toName]);
         break;
       }
-      case chunkHK5SATYM_cjs.META_EDGE_HAS_PART: {
+      case chunkJ3LEGNQB_cjs.META_EDGE_HAS_PART: {
         partOfRelations.push([toName, fromName]);
         break;
       }
-      case chunkHK5SATYM_cjs.META_EDGE_INVERSE_OF: {
+      case chunkJ3LEGNQB_cjs.META_EDGE_INVERSE_OF: {
         inverseOfRelations.push([fromName, toName]);
         break;
       }
-      case chunkHK5SATYM_cjs.META_EDGE_IMPLIES: {
+      case chunkJ3LEGNQB_cjs.META_EDGE_IMPLIES: {
         impliesRelations.push([fromName, toName]);
         break;
       }
     }
   }
-  const subClassAncestors = chunkHK5SATYM_cjs.computeTransitiveClosure(subClassRelations);
-  const subClassDescendants = chunkHK5SATYM_cjs.invertClosure(subClassAncestors);
-  const broaderClosure = chunkHK5SATYM_cjs.computeTransitiveClosure(broaderRelations);
-  const narrowerClosure = chunkHK5SATYM_cjs.invertClosure(broaderClosure);
+  const subClassAncestors = chunkJ3LEGNQB_cjs.computeTransitiveClosure(subClassRelations);
+  const subClassDescendants = chunkJ3LEGNQB_cjs.invertClosure(subClassAncestors);
+  const broaderClosure = chunkJ3LEGNQB_cjs.computeTransitiveClosure(broaderRelations);
+  const narrowerClosure = chunkJ3LEGNQB_cjs.invertClosure(broaderClosure);
   const equivalenceSets = computeEquivalenceSets(equivalentRelations);
   const iriToKind = computeIriMapping(equivalentRelations);
   const disjointPairs = computeDisjointPairs(disjointRelations);
-  const partOfClosure = chunkHK5SATYM_cjs.computeTransitiveClosure(partOfRelations);
-  const hasPartClosure = chunkHK5SATYM_cjs.invertClosure(partOfClosure);
+  const partOfClosure = chunkJ3LEGNQB_cjs.computeTransitiveClosure(partOfRelations);
+  const hasPartClosure = chunkJ3LEGNQB_cjs.invertClosure(partOfClosure);
   const edgeInverses = computeEdgeInverses(inverseOfRelations);
-  const edgeImplicationsClosure = chunkHK5SATYM_cjs.computeTransitiveClosure(impliesRelations);
-  const edgeImplyingClosure = chunkHK5SATYM_cjs.invertClosure(edgeImplicationsClosure);
+  const edgeImplicationsClosure = chunkJ3LEGNQB_cjs.computeTransitiveClosure(impliesRelations);
+  const edgeImplyingClosure = chunkJ3LEGNQB_cjs.invertClosure(edgeImplicationsClosure);
   return {
     subClassAncestors,
     subClassDescendants,
@@ -1234,7 +1245,7 @@ function serializeSchema(graph, version) {
   return {
     graphId: graph.id,
     version,
-    generatedAt: chunkYC6PWTHY_cjs.nowIso(),
+    generatedAt: chunkRSSQKPSZ_cjs.nowIso(),
     nodes,
     edges,
     ontology,
@@ -1265,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 !== chunkHK5SATYM_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
+  if (document.version !== chunkJ3LEGNQB_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
   const { version: _omit, ...rest } = document;
   return rest;
 }
@@ -1314,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
@@ -1334,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 chunkT6SPUYLX_cjs.getNodeKinds(graph)) {
+  for (const kindName of chunk2THZ3TQI_cjs.getNodeKinds(graph)) {
     const registration = graph.nodes[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeNodeDef(registration);
@@ -1407,7 +1430,7 @@ function deserializeWherePredicate(serialized) {
 }
 function serializeEdges(graph) {
   const result = {};
-  for (const kindName of chunkT6SPUYLX_cjs.getEdgeKinds(graph)) {
+  for (const kindName of chunk2THZ3TQI_cjs.getEdgeKinds(graph)) {
     const registration = graph.edges[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeEdgeDef(registration);
@@ -1509,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) {
@@ -1556,7 +1575,7 @@ async function computeSchemaHash(schema) {
     ...schema.deprecatedKinds === void 0 ? {} : { deprecatedKinds: schema.deprecatedKinds }
   };
   const json = JSON.stringify(hashable, chunkACSVZPK7_cjs.sortedReplacer);
-  return chunkZY4GXIVN_cjs.sha256Hex(json);
+  return chunkTEDRJXOG_cjs.sha256Hex(json);
 }
 var COMPILE_NODE_CACHE = /* @__PURE__ */ new Map();
 var COMPILE_EDGE_SCHEMA_CACHE = /* @__PURE__ */ new WeakMap();
@@ -1672,7 +1691,7 @@ function compileProperty(property) {
 }
 function compileStringProperty(property) {
   if (property.searchable !== void 0) {
-    return applyStringRefinements(chunkJQGIPGVL_cjs.searchable(property.searchable), property);
+    return applyStringRefinements(chunkH7YNSMA7_cjs.searchable(property.searchable), property);
   }
   if (property.format === void 0) {
     return applyStringRefinements(zod.z.string(), property);
@@ -1722,7 +1741,7 @@ function compileEnumProperty(property) {
 }
 function compileArrayProperty(property) {
   if (property.embedding !== void 0) {
-    return chunkJQGIPGVL_cjs.embedding(property.embedding.dimensions);
+    return chunkH7YNSMA7_cjs.embedding(property.embedding.dimensions);
   }
   const inner = compilePropertyForArrayItem(property.items);
   return zod.z.array(inner);
@@ -1762,7 +1781,7 @@ function makeWherePredicate(field, op) {
   };
 }
 var META_EDGE_BY_NAME = Object.fromEntries(
-  chunkHK5SATYM_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
+  chunkJ3LEGNQB_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
 );
 function compileOntologyRelation(relation, nodeTypeByName) {
   const metaEdge = META_EDGE_BY_NAME[relation.metaEdge];
@@ -1801,7 +1820,7 @@ function mergeGraphExtension(graph, document) {
   if (graph.extension !== void 0 && chunkACSVZPK7_cjs.canonicalEqual(unionDocument, existingDocument)) {
     return graph;
   }
-  const validatedUnion = chunkHK5SATYM_cjs.unwrap(chunkHK5SATYM_cjs.validateGraphExtension(unionDocument));
+  const validatedUnion = chunkJ3LEGNQB_cjs.unwrap(chunkJ3LEGNQB_cjs.validateGraphExtension(unionDocument));
   const compiled = compileGraphExtension(validatedUnion);
   const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } = extensionKindNames(existingDocument);
   const nodeKinds = /* @__PURE__ */ new Map();
@@ -1903,7 +1922,7 @@ function deriveGraphExtensionVectorIndexes(compiledNodes) {
       ...compiled.unique.length === 0 ? {} : { unique: [...compiled.unique] }
     };
   }
-  return chunkT6SPUYLX_cjs.autoDeriveVectorIndexes(registrations).map(
+  return chunk2THZ3TQI_cjs.autoDeriveVectorIndexes(registrations).map(
     (index) => Object.freeze({ ...index, origin: "runtime" })
   );
 }
@@ -1921,7 +1940,7 @@ function mergeIndexesWithGraphExtension(existing, runtimeIndexes, graphId) {
   const runtimeRelational = runtimeIndexes.filter(
     (index) => index.entity !== "vector"
   );
-  const vectorMerged = chunkT6SPUYLX_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
+  const vectorMerged = chunk2THZ3TQI_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
   const merged = [...vectorMerged, ...runtimeRelational];
   assertUniqueIndexNames(merged, graphId);
   return merged;
@@ -1933,7 +1952,7 @@ function assertUniqueIndexNames(indexes, graphId) {
       seen.add(index.name);
       continue;
     }
-    throw new chunkJIEJCTDS_cjs.ConfigurationError(
+    throw new chunkDIK74MXX_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" },
       {
@@ -1949,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 chunkDIK74MXX_cjs.KindNotFoundError(document.kind, "node", {
           graphId,
           suggestion: "Declare the kind under `nodes` in this graph extension, or remove the index from `indexes`."
         });
       }
-      const declaration2 = chunkRRKQAKD6_cjs.defineNodeIndex(
+      const declaration2 = chunkUUT7UN2N_cjs.defineNodeIndex(
         node,
         toNodeIndexConfig(document)
       );
@@ -1963,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 chunkDIK74MXX_cjs.KindNotFoundError(document.kind, "edge", {
         graphId,
         suggestion: "Declare the edge under `edges` in this graph extension, or remove the index from `indexes`."
       });
     }
-    const declaration = chunkRRKQAKD6_cjs.defineEdgeIndex(
+    const declaration = chunkUUT7UN2N_cjs.defineEdgeIndex(
       edgeRegistration.type,
       toEdgeIndexConfig(document)
     );
@@ -1980,7 +1999,7 @@ function buildWhereCallback(where) {
   return (props) => {
     const builder = props[where.field];
     if (builder === void 0) {
-      throw new chunkJIEJCTDS_cjs.ConfigurationError(
+      throw new chunkDIK74MXX_cjs.ConfigurationError(
         `Graph-extension index \`where\` references unknown field "${where.field}".`,
         { field: where.field, code: "EXTENSION_INDEX_WHERE_UNKNOWN_FIELD" }
       );
@@ -2055,14 +2074,14 @@ function isEmptyExtension(extension) {
 }
 function assertNoCollision(kindName, entity, collides, graphId) {
   if (!collides) return;
-  throw new chunkHK5SATYM_cjs.KindCollisionError(kindName, entity, graphId);
+  throw new chunkJ3LEGNQB_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 chunkHK5SATYM_cjs.GraphExtensionUnresolvedEndpointError(
+      throw new chunkJ3LEGNQB_cjs.GraphExtensionUnresolvedEndpointError(
         context.edgeKind,
         context.side,
         entry,
@@ -2077,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 chunkDIK74MXX_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: chunkJ3LEGNQB_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 chunk2THZ3TQI_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 chunk2THZ3TQI_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"]);
@@ -2126,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"),
@@ -2202,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"),
@@ -2407,7 +2526,7 @@ function parseSerializedSchema(json) {
   try {
     parsed = JSON.parse(json);
   } catch {
-    throw new chunkJIEJCTDS_cjs.DatabaseOperationError(
+    throw new chunkDIK74MXX_cjs.DatabaseOperationError(
       "Stored schema document is not valid JSON",
       { operation: "select", entity: "schema" }
     );
@@ -2415,7 +2534,7 @@ 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 chunkDIK74MXX_cjs.DatabaseOperationError(
       `Stored schema document is malformed: ${issues}`,
       { operation: "select", entity: "schema" }
     );
@@ -2432,7 +2551,7 @@ async function loadActiveSchemaWithBootstrap(backend, graphId) {
   try {
     return await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (backend.bootstrapTables && chunkRHZWOJVA_cjs.isMissingTableError(error)) {
+    if (backend.bootstrapTables && chunkRSSQKPSZ_cjs.isMissingTableError(error)) {
       await backend.bootstrapTables();
       return await backend.getActiveSchema(graphId);
     }
@@ -2526,7 +2645,7 @@ async function ensureSchema(backend, graph, options) {
   }
   const actions = getMigrationActions(diff);
   if (throwOnBreaking) {
-    throw new chunkJIEJCTDS_cjs.MigrationError(
+    throw new chunkDIK74MXX_cjs.MigrationError(
       `Schema migration required: ${diff.summary}. ${actions.length} migration action(s) needed. Use getSchemaChanges() to review, then migrateSchema() to apply.`,
       {
         graphId: graph.id,
@@ -2562,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 chunkDIK74MXX_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,
@@ -2580,7 +2699,7 @@ async function readActiveSchemaPure(backend, graphId) {
   try {
     activeRow = await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (chunkRHZWOJVA_cjs.isMissingTableError(error)) {
+    if (chunkRSSQKPSZ_cjs.isMissingTableError(error)) {
       throw schemaNotInitializedError(graphId, error);
     }
     throw error;
@@ -2591,7 +2710,7 @@ async function readActiveSchemaPure(backend, graphId) {
   return activeRow;
 }
 function schemaNotInitializedError(graphId, cause) {
-  return new chunkJIEJCTDS_cjs.ConfigurationError(
+  return new chunkDIK74MXX_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 },
     {
@@ -2601,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({
@@ -2620,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);
@@ -2634,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 chunkDIK74MXX_cjs.MigrationError(
       `Cannot rollback graph "${graphId}": no active schema version exists.`,
       { graphId, fromVersion: 0, toVersion: targetVersion }
     );
@@ -2662,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;
@@ -2778,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-6HVOHZHS.cjs.map
-//# sourceMappingURL=chunk-6HVOHZHS.cjs.map
+exports.validateImpliesEndpointCompatibility = validateImpliesEndpointCompatibility;
+//# sourceMappingURL=chunk-PWGX5DF5.cjs.map
+//# sourceMappingURL=chunk-PWGX5DF5.cjs.map