@nicia-ai/typegraph 0.25.1 → 0.27.0

package/dist/{chunk-QMQYK3IF.cjs → chunk-ZGEMI7MJ.cjs}

@@ -1,29 +1,30 @@
 'use strict';
 
-var chunkE5JZSEGJ_cjs = require('./chunk-E5JZSEGJ.cjs');
-var chunkRCAJZG67_cjs = require('./chunk-RCAJZG67.cjs');
+var chunkWFUN6DCM_cjs = require('./chunk-WFUN6DCM.cjs');
+var chunkPYJOBZR3_cjs = require('./chunk-PYJOBZR3.cjs');
+var chunkIUIWCFG3_cjs = require('./chunk-IUIWCFG3.cjs');
 var chunkCTHNVU6K_cjs = require('./chunk-CTHNVU6K.cjs');
 var chunkEK6RJ373_cjs = require('./chunk-EK6RJ373.cjs');
 var chunkX3244EKP_cjs = require('./chunk-X3244EKP.cjs');
-var chunkW5MTHMTE_cjs = require('./chunk-W5MTHMTE.cjs');
+var chunkYEDQLNVE_cjs = require('./chunk-YEDQLNVE.cjs');
 var zod = require('zod');
 
 // src/core/node.ts
 function validateSchemaKeys(schema, name) {
-  chunkRCAJZG67_cjs.assertSchemaKeysAreFree(
+  chunkPYJOBZR3_cjs.assertSchemaKeysAreFree(
     "Node",
     name,
     Object.keys(schema.shape),
-    chunkRCAJZG67_cjs.RESERVED_NODE_KEYS
+    chunkPYJOBZR3_cjs.RESERVED_NODE_KEYS
   );
 }
 function defineNode(name, options) {
   validateSchemaKeys(options.schema, name);
   if (options.annotations !== void 0) {
-    chunkRCAJZG67_cjs.assertJsonValue(options.annotations, "annotations", `Node "${name}"`);
+    chunkPYJOBZR3_cjs.assertJsonValue(options.annotations, "annotations", `Node "${name}"`);
   }
   return Object.freeze({
-    [chunkE5JZSEGJ_cjs.NODE_TYPE_BRAND]: true,
+    [chunkWFUN6DCM_cjs.NODE_TYPE_BRAND]: true,
     kind: name,
     schema: options.schema,
     description: options.description,
@@ -32,21 +33,21 @@ function defineNode(name, options) {
 }
 var EMPTY_SCHEMA = zod.z.object({});
 function validateSchemaKeys2(schema, name) {
-  chunkRCAJZG67_cjs.assertSchemaKeysAreFree(
+  chunkPYJOBZR3_cjs.assertSchemaKeysAreFree(
     "Edge",
     name,
     Object.keys(schema.shape),
-    chunkRCAJZG67_cjs.RESERVED_EDGE_KEYS
+    chunkPYJOBZR3_cjs.RESERVED_EDGE_KEYS
   );
 }
 function defineEdge(name, options) {
   const schema = options?.schema ?? EMPTY_SCHEMA;
   validateSchemaKeys2(schema, name);
   if (options?.annotations !== void 0) {
-    chunkRCAJZG67_cjs.assertJsonValue(options.annotations, "annotations", `Edge "${name}"`);
+    chunkPYJOBZR3_cjs.assertJsonValue(options.annotations, "annotations", `Edge "${name}"`);
   }
   return Object.freeze({
-    [chunkE5JZSEGJ_cjs.EDGE_TYPE_BRAND]: true,
+    [chunkWFUN6DCM_cjs.EDGE_TYPE_BRAND]: true,
     kind: name,
     schema,
     description: options?.description,
@@ -83,7 +84,7 @@ function createMetaEdge(name, properties) {
     }
   });
 }
-var subClassOfMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_SUB_CLASS_OF, {
+var subClassOfMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_SUB_CLASS_OF, {
   transitive: true,
   inference: "subsumption",
   description: "Type inheritance (Podcast subClassOf Media)"
@@ -95,9 +96,9 @@ function subClassOf(child, parent) {
     to: parent
   };
 }
-var broaderMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_BROADER, {
+var broaderMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_BROADER, {
   transitive: true,
-  inverse: chunkRCAJZG67_cjs.META_EDGE_NARROWER,
+  inverse: chunkPYJOBZR3_cjs.META_EDGE_NARROWER,
   inference: "hierarchy",
   description: "Broader concept (ML broader AI)"
 });
@@ -108,9 +109,9 @@ function broader(narrowerConcept, broaderConcept) {
     to: broaderConcept
   };
 }
-var narrowerMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_NARROWER, {
+var narrowerMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_NARROWER, {
   transitive: true,
-  inverse: chunkRCAJZG67_cjs.META_EDGE_BROADER,
+  inverse: chunkPYJOBZR3_cjs.META_EDGE_BROADER,
   inference: "hierarchy",
   description: "Narrower concept (AI narrower ML)"
 });
@@ -121,7 +122,7 @@ function narrower(broaderConcept, narrowerConcept) {
     to: narrowerConcept
   };
 }
-var relatedToMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_RELATED_TO, {
+var relatedToMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_RELATED_TO, {
   symmetric: true,
   inference: "association",
   description: "Non-hierarchical association"
@@ -133,7 +134,7 @@ function relatedTo(conceptA, conceptB) {
     to: conceptB
   };
 }
-var equivalentToMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_EQUIVALENT_TO, {
+var equivalentToMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_EQUIVALENT_TO, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -146,7 +147,7 @@ function equivalentTo(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var sameAsMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_SAME_AS, {
+var sameAsMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_SAME_AS, {
   symmetric: true,
   transitive: true,
   inference: "substitution",
@@ -159,7 +160,7 @@ function sameAs(kindA, kindBOrIri) {
     to: kindBOrIri
   };
 }
-var differentFromMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_DIFFERENT_FROM, {
+var differentFromMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_DIFFERENT_FROM, {
   symmetric: true,
   inference: "constraint",
   description: "Explicitly different individuals"
@@ -171,7 +172,7 @@ function differentFrom(kindA, kindB) {
     to: kindB
   };
 }
-var disjointWithMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_DISJOINT_WITH, {
+var disjointWithMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_DISJOINT_WITH, {
   symmetric: true,
   inference: "constraint",
   description: "Mutually exclusive types"
@@ -183,9 +184,9 @@ function disjointWith(kindA, kindB) {
     to: kindB
   };
 }
-var partOfMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_PART_OF, {
+var partOfMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_PART_OF, {
   transitive: true,
-  inverse: chunkRCAJZG67_cjs.META_EDGE_HAS_PART,
+  inverse: chunkPYJOBZR3_cjs.META_EDGE_HAS_PART,
   inference: "composition",
   description: "X is part of Y"
 });
@@ -196,9 +197,9 @@ function partOf(part, whole) {
     to: whole
   };
 }
-var hasPartMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_HAS_PART, {
+var hasPartMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_HAS_PART, {
   transitive: true,
-  inverse: chunkRCAJZG67_cjs.META_EDGE_PART_OF,
+  inverse: chunkPYJOBZR3_cjs.META_EDGE_PART_OF,
   inference: "composition",
   description: "Y has part X"
 });
@@ -209,12 +210,12 @@ function hasPart(whole, part) {
     to: part
   };
 }
-var inverseOfMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_INVERSE_OF, {
+var inverseOfMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_INVERSE_OF, {
   symmetric: true,
   inference: "none",
   description: "Edge A is inverse of edge B"
 });
-var impliesMetaEdge = createMetaEdge(chunkRCAJZG67_cjs.META_EDGE_IMPLIES, {
+var impliesMetaEdge = createMetaEdge(chunkPYJOBZR3_cjs.META_EDGE_IMPLIES, {
   transitive: true,
   inference: "none",
   description: "Edge A implies edge B exists"
@@ -262,21 +263,6 @@ var core = {
   implies
 };
 
-// src/schema/canonical.ts
-function sortedReplacer(_key, value) {
-  if (value !== null && typeof value === "object" && !Array.isArray(value)) {
-    const sorted = {};
-    for (const key of Object.keys(value).toSorted()) {
-      sorted[key] = value[key];
-    }
-    return sorted;
-  }
-  return value;
-}
-function canonicalEqual(a, b) {
-  return JSON.stringify(a, sortedReplacer) === JSON.stringify(b, sortedReplacer);
-}
-
 // src/schema/migration.ts
 function computeSchemaDiff(before, after) {
   const nodeChanges = diffNodes(before.nodes, after.nodes);
@@ -359,7 +345,7 @@ function diffNodes(before, after) {
 }
 function diffNodeDef(name, before, after) {
   const changes = [];
-  if (!canonicalEqual(before.properties, after.properties)) {
+  if (!chunkIUIWCFG3_cjs.canonicalEqual(before.properties, after.properties)) {
     const beforeProps = before.properties.properties ?? {};
     const afterProps = after.properties.properties ?? {};
     const beforeRequired = new Set(before.properties.required);
@@ -398,7 +384,7 @@ function diffNodeDef(name, before, after) {
       after
     });
   }
-  if (!canonicalEqual(before.uniqueConstraints, after.uniqueConstraints)) {
+  if (!chunkIUIWCFG3_cjs.canonicalEqual(before.uniqueConstraints, after.uniqueConstraints)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -482,7 +468,7 @@ function diffEdges(before, after) {
 }
 function diffEdgeDef(name, before, after) {
   const changes = [];
-  if (!canonicalEqual(before.fromKinds, after.fromKinds)) {
+  if (!chunkIUIWCFG3_cjs.canonicalEqual(before.fromKinds, after.fromKinds)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -492,7 +478,7 @@ function diffEdgeDef(name, before, after) {
       after
     });
   }
-  if (!canonicalEqual(before.toKinds, after.toKinds)) {
+  if (!chunkIUIWCFG3_cjs.canonicalEqual(before.toKinds, after.toKinds)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -512,7 +498,7 @@ function diffEdgeDef(name, before, after) {
       after
     });
   }
-  if (!canonicalEqual(before.properties, after.properties)) {
+  if (!chunkIUIWCFG3_cjs.canonicalEqual(before.properties, after.properties)) {
     changes.push({
       type: "modified",
       kind: name,
@@ -537,7 +523,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 !canonicalEqual(before, after);
+  return !chunkIUIWCFG3_cjs.canonicalEqual(before, after);
 }
 function diffOntology(before, after) {
   const changes = [];
@@ -636,7 +622,7 @@ function diffIndexes(before, after) {
   for (const [name, beforeIndex] of beforeByName) {
     const afterIndex = afterByName.get(name);
     if (!afterIndex) continue;
-    if (!canonicalEqual(beforeIndex, afterIndex)) {
+    if (!chunkIUIWCFG3_cjs.canonicalEqual(beforeIndex, afterIndex)) {
       changes.push({
         type: "modified",
         name,
@@ -666,7 +652,7 @@ function diffExtension(before, after) {
       details: "Graph extension document was removed"
     };
   }
-  if (canonicalEqual(before, after)) return void 0;
+  if (chunkIUIWCFG3_cjs.canonicalEqual(before, after)) return void 0;
   return {
     type: "modified",
     severity: "safe",
@@ -818,7 +804,7 @@ var KindRegistry = class {
    * Checks if child is a subclass of parent (directly or transitively).
    */
   isSubClassOf(child, parent) {
-    return chunkRCAJZG67_cjs.isReachable(this.subClassAncestors, child, parent);
+    return chunkPYJOBZR3_cjs.isReachable(this.subClassAncestors, child, parent);
   }
   /**
    * Expands a kind to include all its subclasses.
@@ -845,13 +831,13 @@ var KindRegistry = class {
    * Checks if narrowerConcept is narrower than broaderConcept.
    */
   isNarrowerThan(narrowerConcept, broaderConcept) {
-    return chunkRCAJZG67_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
+    return chunkPYJOBZR3_cjs.isReachable(this.broaderClosure, narrowerConcept, broaderConcept);
   }
   /**
    * Checks if broaderConcept is broader than narrowerConcept.
    */
   isBroaderThan(broaderConcept, narrowerConcept) {
-    return chunkRCAJZG67_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
+    return chunkPYJOBZR3_cjs.isReachable(this.narrowerClosure, broaderConcept, narrowerConcept);
   }
   /**
    * Expands to include all narrower concepts.
@@ -915,7 +901,7 @@ var KindRegistry = class {
    * Checks if part is part of whole (directly or transitively).
    */
   isPartOf(part, whole) {
-    return chunkRCAJZG67_cjs.isReachable(this.partOfClosure, part, whole);
+    return chunkPYJOBZR3_cjs.isReachable(this.partOfClosure, part, whole);
   }
   /**
    * Gets all wholes that contain this part.
@@ -1026,57 +1012,57 @@ function computeClosuresFromOntology(ontology) {
     const fromName = getKindName(relation.from);
     const toName = getKindName(relation.to);
     switch (relation.metaEdge.name) {
-      case chunkRCAJZG67_cjs.META_EDGE_SUB_CLASS_OF: {
+      case chunkPYJOBZR3_cjs.META_EDGE_SUB_CLASS_OF: {
         subClassRelations.push([fromName, toName]);
         break;
       }
-      case chunkRCAJZG67_cjs.META_EDGE_BROADER: {
+      case chunkPYJOBZR3_cjs.META_EDGE_BROADER: {
         broaderRelations.push([fromName, toName]);
         break;
       }
-      case chunkRCAJZG67_cjs.META_EDGE_NARROWER: {
+      case chunkPYJOBZR3_cjs.META_EDGE_NARROWER: {
         broaderRelations.push([toName, fromName]);
         break;
       }
-      case chunkRCAJZG67_cjs.META_EDGE_EQUIVALENT_TO:
-      case chunkRCAJZG67_cjs.META_EDGE_SAME_AS: {
+      case chunkPYJOBZR3_cjs.META_EDGE_EQUIVALENT_TO:
+      case chunkPYJOBZR3_cjs.META_EDGE_SAME_AS: {
         equivalentRelations.push([fromName, toName]);
         break;
       }
-      case chunkRCAJZG67_cjs.META_EDGE_DISJOINT_WITH: {
+      case chunkPYJOBZR3_cjs.META_EDGE_DISJOINT_WITH: {
         disjointRelations.push([fromName, toName]);
         break;
       }
-      case chunkRCAJZG67_cjs.META_EDGE_PART_OF: {
+      case chunkPYJOBZR3_cjs.META_EDGE_PART_OF: {
         partOfRelations.push([fromName, toName]);
         break;
       }
-      case chunkRCAJZG67_cjs.META_EDGE_HAS_PART: {
+      case chunkPYJOBZR3_cjs.META_EDGE_HAS_PART: {
         partOfRelations.push([toName, fromName]);
         break;
       }
-      case chunkRCAJZG67_cjs.META_EDGE_INVERSE_OF: {
+      case chunkPYJOBZR3_cjs.META_EDGE_INVERSE_OF: {
         inverseOfRelations.push([fromName, toName]);
         break;
       }
-      case chunkRCAJZG67_cjs.META_EDGE_IMPLIES: {
+      case chunkPYJOBZR3_cjs.META_EDGE_IMPLIES: {
         impliesRelations.push([fromName, toName]);
         break;
       }
     }
   }
-  const subClassAncestors = chunkRCAJZG67_cjs.computeTransitiveClosure(subClassRelations);
-  const subClassDescendants = chunkRCAJZG67_cjs.invertClosure(subClassAncestors);
-  const broaderClosure = chunkRCAJZG67_cjs.computeTransitiveClosure(broaderRelations);
-  const narrowerClosure = chunkRCAJZG67_cjs.invertClosure(broaderClosure);
+  const subClassAncestors = chunkPYJOBZR3_cjs.computeTransitiveClosure(subClassRelations);
+  const subClassDescendants = chunkPYJOBZR3_cjs.invertClosure(subClassAncestors);
+  const broaderClosure = chunkPYJOBZR3_cjs.computeTransitiveClosure(broaderRelations);
+  const narrowerClosure = chunkPYJOBZR3_cjs.invertClosure(broaderClosure);
   const equivalenceSets = computeEquivalenceSets(equivalentRelations);
   const iriToKind = computeIriMapping(equivalentRelations);
   const disjointPairs = computeDisjointPairs(disjointRelations);
-  const partOfClosure = chunkRCAJZG67_cjs.computeTransitiveClosure(partOfRelations);
-  const hasPartClosure = chunkRCAJZG67_cjs.invertClosure(partOfClosure);
+  const partOfClosure = chunkPYJOBZR3_cjs.computeTransitiveClosure(partOfRelations);
+  const hasPartClosure = chunkPYJOBZR3_cjs.invertClosure(partOfClosure);
   const edgeInverses = computeEdgeInverses(inverseOfRelations);
-  const edgeImplicationsClosure = chunkRCAJZG67_cjs.computeTransitiveClosure(impliesRelations);
-  const edgeImplyingClosure = chunkRCAJZG67_cjs.invertClosure(edgeImplicationsClosure);
+  const edgeImplicationsClosure = chunkPYJOBZR3_cjs.computeTransitiveClosure(impliesRelations);
+  const edgeImplyingClosure = chunkPYJOBZR3_cjs.invertClosure(edgeImplicationsClosure);
   return {
     subClassAncestors,
     subClassDescendants,
@@ -1180,7 +1166,7 @@ function serializeSchema(graph, version) {
   return {
     graphId: graph.id,
     version,
-    generatedAt: chunkE5JZSEGJ_cjs.nowIso(),
+    generatedAt: chunkWFUN6DCM_cjs.nowIso(),
     nodes,
     edges,
     ontology,
@@ -1211,7 +1197,7 @@ function serializeDeprecatedKinds(set) {
 function canonicalExtension(document) {
   if (document === void 0) return void 0;
   if (document.version === void 0) return document;
-  if (document.version !== chunkRCAJZG67_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
+  if (document.version !== chunkPYJOBZR3_cjs.LEGACY_GRAPH_EXTENSION_VERSION) return document;
   const { version: _omit, ...rest } = document;
   return rest;
 }
@@ -1285,7 +1271,7 @@ function serializeEdgeIndexDeclaration(declaration) {
 }
 function serializeNodes(graph) {
   const result = {};
-  for (const kindName of chunkE5JZSEGJ_cjs.getNodeKinds(graph)) {
+  for (const kindName of chunkWFUN6DCM_cjs.getNodeKinds(graph)) {
     const registration = graph.nodes[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeNodeDef(registration);
@@ -1353,7 +1339,7 @@ function deserializeWherePredicate(serialized) {
 }
 function serializeEdges(graph) {
   const result = {};
-  for (const kindName of chunkE5JZSEGJ_cjs.getEdgeKinds(graph)) {
+  for (const kindName of chunkWFUN6DCM_cjs.getEdgeKinds(graph)) {
     const registration = graph.edges[kindName];
     if (registration === void 0) continue;
     result[kindName] = serializeEdgeDef(registration);
@@ -1501,7 +1487,7 @@ async function computeSchemaHash(schema) {
     ...schema.extension === void 0 ? {} : { extension: schema.extension },
     ...schema.deprecatedKinds === void 0 ? {} : { deprecatedKinds: schema.deprecatedKinds }
   };
-  const json = JSON.stringify(hashable, sortedReplacer);
+  const json = JSON.stringify(hashable, chunkIUIWCFG3_cjs.sortedReplacer);
   return chunkCTHNVU6K_cjs.sha256Hex(json);
 }
 var COMPILE_NODE_CACHE = /* @__PURE__ */ new Map();
@@ -1550,7 +1536,7 @@ function compileNode(kindName, document) {
   const schema = buildObjectSchema(document.properties);
   const type = defineNode(
     kindName,
-    chunkRCAJZG67_cjs.compactUndefined({
+    chunkPYJOBZR3_cjs.compactUndefined({
       schema,
       description: document.description,
       annotations: document.annotations
@@ -1574,7 +1560,7 @@ function compileEdge(kindName, document, nodeTypeByName) {
     (name) => nodeTypeByName.get(name) ?? name
   );
   return Object.freeze(
-    chunkRCAJZG67_cjs.compactUndefined({
+    chunkPYJOBZR3_cjs.compactUndefined({
       kindName,
       schema,
       description: document.description,
@@ -1708,7 +1694,7 @@ function makeWherePredicate(field, op) {
   };
 }
 var META_EDGE_BY_NAME = Object.fromEntries(
-  chunkRCAJZG67_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
+  chunkPYJOBZR3_cjs.ALL_META_EDGE_NAMES.map((name) => [name, core[`${name}MetaEdge`]])
 );
 function compileOntologyRelation(relation, nodeTypeByName) {
   const metaEdge = META_EDGE_BY_NAME[relation.metaEdge];
@@ -1744,10 +1730,10 @@ function extensionKindNames(document) {
 function mergeGraphExtension(graph, document) {
   const existingDocument = graph.extension ?? Object.freeze({});
   const unionDocument = unionDocuments(existingDocument, document);
-  if (graph.extension !== void 0 && canonicalEqual(unionDocument, existingDocument)) {
+  if (graph.extension !== void 0 && chunkIUIWCFG3_cjs.canonicalEqual(unionDocument, existingDocument)) {
     return graph;
   }
-  const validatedUnion = chunkRCAJZG67_cjs.unwrap(chunkRCAJZG67_cjs.validateGraphExtension(unionDocument));
+  const validatedUnion = chunkPYJOBZR3_cjs.unwrap(chunkPYJOBZR3_cjs.validateGraphExtension(unionDocument));
   const compiled = compileGraphExtension(validatedUnion);
   const { nodes: runtimeNodeNames, edges: runtimeEdgeNames } = extensionKindNames(existingDocument);
   const nodeKinds = /* @__PURE__ */ new Map();
@@ -1799,7 +1785,7 @@ function mergeGraphExtension(graph, document) {
     });
     const type = defineEdge(
       edge.kindName,
-      chunkRCAJZG67_cjs.compactUndefined({
+      chunkPYJOBZR3_cjs.compactUndefined({
         schema: edge.schema,
         description: edge.description,
         annotations: edge.annotations,
@@ -1849,7 +1835,7 @@ function deriveGraphExtensionVectorIndexes(compiledNodes) {
       ...compiled.unique.length === 0 ? {} : { unique: [...compiled.unique] }
     };
   }
-  return chunkE5JZSEGJ_cjs.autoDeriveVectorIndexes(registrations).map(
+  return chunkWFUN6DCM_cjs.autoDeriveVectorIndexes(registrations).map(
     (index) => Object.freeze({ ...index, origin: "runtime" })
   );
 }
@@ -1867,7 +1853,7 @@ function mergeIndexesWithGraphExtension(existing, runtimeIndexes, graphId) {
   const runtimeRelational = runtimeIndexes.filter(
     (index) => index.entity !== "vector"
   );
-  const vectorMerged = chunkE5JZSEGJ_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
+  const vectorMerged = chunkWFUN6DCM_cjs.mergeVectorIndexes(compileTimeIndexes, runtimeVectors);
   const merged = [...vectorMerged, ...runtimeRelational];
   assertUniqueIndexNames(merged, graphId);
   return merged;
@@ -1879,7 +1865,7 @@ function assertUniqueIndexNames(indexes, graphId) {
       seen.add(index.name);
       continue;
     }
-    throw new chunkW5MTHMTE_cjs.ConfigurationError(
+    throw new chunkYEDQLNVE_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" },
       {
@@ -1895,7 +1881,7 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
     if (document.entity === "node") {
       const node = nodeKinds.get(document.kind);
       if (node === void 0) {
-        throw new chunkW5MTHMTE_cjs.KindNotFoundError(document.kind, "node", {
+        throw new chunkYEDQLNVE_cjs.KindNotFoundError(document.kind, "node", {
           graphId,
           suggestion: "Declare the kind under `nodes` in this graph extension, or remove the index from `indexes`."
         });
@@ -1909,7 +1895,7 @@ function compileGraphExtensionRelationalIndexes(documents, nodeKinds, mergedEdge
     }
     const edgeRegistration = mergedEdges[document.kind];
     if (edgeRegistration === void 0) {
-      throw new chunkW5MTHMTE_cjs.KindNotFoundError(document.kind, "edge", {
+      throw new chunkYEDQLNVE_cjs.KindNotFoundError(document.kind, "edge", {
         graphId,
         suggestion: "Declare the edge under `edges` in this graph extension, or remove the index from `indexes`."
       });
@@ -1926,7 +1912,7 @@ function buildWhereCallback(where) {
   return (props) => {
     const builder = props[where.field];
     if (builder === void 0) {
-      throw new chunkW5MTHMTE_cjs.ConfigurationError(
+      throw new chunkYEDQLNVE_cjs.ConfigurationError(
         `Graph-extension index \`where\` references unknown field "${where.field}".`,
         { field: where.field, code: "EXTENSION_INDEX_WHERE_UNKNOWN_FIELD" }
       );
@@ -1935,7 +1921,7 @@ function buildWhereCallback(where) {
   };
 }
 function toNodeIndexConfig(document) {
-  return chunkRCAJZG67_cjs.compactUndefined({
+  return chunkPYJOBZR3_cjs.compactUndefined({
     fields: document.fields,
     coveringFields: document.coveringFields,
     unique: document.unique,
@@ -1945,7 +1931,7 @@ function toNodeIndexConfig(document) {
   });
 }
 function toEdgeIndexConfig(document) {
-  return chunkRCAJZG67_cjs.compactUndefined({
+  return chunkPYJOBZR3_cjs.compactUndefined({
     fields: document.fields,
     coveringFields: document.coveringFields,
     unique: document.unique,
@@ -2001,14 +1987,14 @@ function isEmptyExtension(extension) {
 }
 function assertNoCollision(kindName, entity, collides, graphId) {
   if (!collides) return;
-  throw new chunkRCAJZG67_cjs.KindCollisionError(kindName, entity, graphId);
+  throw new chunkPYJOBZR3_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 chunkRCAJZG67_cjs.GraphExtensionUnresolvedEndpointError(
+      throw new chunkPYJOBZR3_cjs.GraphExtensionUnresolvedEndpointError(
         context.edgeKind,
         context.side,
         entry,
@@ -2353,7 +2339,7 @@ function parseSerializedSchema(json) {
   try {
     parsed = JSON.parse(json);
   } catch {
-    throw new chunkW5MTHMTE_cjs.DatabaseOperationError(
+    throw new chunkYEDQLNVE_cjs.DatabaseOperationError(
       "Stored schema document is not valid JSON",
       { operation: "select", entity: "schema" }
     );
@@ -2361,12 +2347,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 chunkW5MTHMTE_cjs.DatabaseOperationError(
+    throw new chunkYEDQLNVE_cjs.DatabaseOperationError(
       `Stored schema document is malformed: ${issues}`,
       { operation: "select", entity: "schema" }
     );
   }
-  const validated = chunkRCAJZG67_cjs.freezeDeep(result.data);
+  const validated = chunkPYJOBZR3_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);
@@ -2374,25 +2360,11 @@ function parseSerializedSchema(json) {
   PARSE_CACHE.set(json, validated);
   return validated;
 }
-var MISSING_TABLE_PATTERNS = [
-  "no such table",
-  // SQLite
-  "does not exist",
-  // PostgreSQL ("relation ... does not exist")
-  "SQLITE_ERROR"
-  // D1 / Durable Objects error code
-];
-function isMissingTableError(error) {
-  const message = error instanceof Error ? error.message : String(error);
-  return MISSING_TABLE_PATTERNS.some((pattern) => message.includes(pattern));
-}
 async function loadActiveSchemaWithBootstrap(backend, graphId) {
   try {
-    const row = await backend.getActiveSchema(graphId);
-    await backend.ensureFulltextTable?.();
-    return row;
+    return await backend.getActiveSchema(graphId);
   } catch (error) {
-    if (backend.bootstrapTables && isMissingTableError(error)) {
+    if (backend.bootstrapTables && chunkIUIWCFG3_cjs.isMissingTableError(error)) {
       await backend.bootstrapTables();
       return await backend.getActiveSchema(graphId);
     }
@@ -2404,11 +2376,17 @@ async function loadAndMergeGraphExtensionDocument(backend, graph) {
   if (activeRow === void 0) {
     return { graph, activeRow: void 0, storedSchema: void 0 };
   }
+  const { graph: merged, storedSchema } = mergeStoredGraphExtension(
+    graph,
+    activeRow
+  );
+  return { graph: merged, activeRow, storedSchema };
+}
+function mergeStoredGraphExtension(graph, activeRow) {
   const storedSchema = parseSerializedSchema(activeRow.schema_doc);
   const merged = storedSchema.extension === void 0 ? graph : mergeGraphExtension(graph, storedSchema.extension);
   return {
     graph: applyDeprecatedKinds(merged, storedSchema.deprecatedKinds),
-    activeRow,
     storedSchema
   };
 }
@@ -2480,7 +2458,7 @@ async function ensureSchema(backend, graph, options) {
   }
   const actions = getMigrationActions(diff);
   if (throwOnBreaking) {
-    throw new chunkW5MTHMTE_cjs.MigrationError(
+    throw new chunkYEDQLNVE_cjs.MigrationError(
       `Schema migration required: ${diff.summary}. ${actions.length} migration action(s) needed. Use getSchemaChanges() to review, then migrateSchema() to apply.`,
       {
         graphId: graph.id,
@@ -2491,6 +2469,69 @@ async function ensureSchema(backend, graph, options) {
   }
   return { status: "breaking", diff, actions };
 }
+async function loadAndVerifyGraph(backend, graph) {
+  const activeRow = await readActiveSchemaPure(backend, graph.id);
+  const { graph: merged, storedSchema } = mergeStoredGraphExtension(
+    graph,
+    activeRow
+  );
+  const storedHash = activeRow.schema_hash;
+  const currentHash = await getSchemaHash(merged, activeRow.version + 1);
+  if (storedHash !== currentHash) {
+    const currentSchema = serializeSchema(merged, activeRow.version + 1);
+    const diff = computeSchemaDiff(storedSchema, currentSchema);
+    if (diff.hasChanges) {
+      throw schemaBehindError(merged.id, activeRow.version, diff);
+    }
+  }
+  await backend.assertRuntimeContributionsInitialized?.(merged.id);
+  return {
+    graph: merged,
+    activeRow,
+    result: { status: "unchanged", version: activeRow.version }
+  };
+}
+function schemaBehindError(graphId, fromVersion, diff) {
+  const actions = getMigrationActions(diff);
+  const qualifier = isBackwardsCompatible(diff) ? "safe auto-migration" : "breaking change";
+  return new chunkYEDQLNVE_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,
+      fromVersion,
+      toVersion: fromVersion + 1
+    }
+  );
+}
+async function assertSchemaCurrent(backend, graph) {
+  const { result } = await loadAndVerifyGraph(backend, graph);
+  return result;
+}
+async function readActiveSchemaPure(backend, graphId) {
+  let activeRow;
+  try {
+    activeRow = await backend.getActiveSchema(graphId);
+  } catch (error) {
+    if (chunkIUIWCFG3_cjs.isMissingTableError(error)) {
+      throw schemaNotInitializedError(graphId, error);
+    }
+    throw error;
+  }
+  if (activeRow === void 0) {
+    throw schemaNotInitializedError(graphId);
+  }
+  return activeRow;
+}
+function schemaNotInitializedError(graphId, cause) {
+  return new chunkYEDQLNVE_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 },
+    {
+      cause,
+      suggestion: "Run createStoreWithSchema(graph, adminBackend) once under a privileged role. If you manage DDL externally with drizzle-kit / generatePostgresMigrationSQL / generateSqliteMigrationSQL, apply that first, then still run createStoreWithSchema to commit the schema row and contribution markers."
+    }
+  );
+}
 async function initializeSchema(backend, graph) {
   const schema = serializeSchema(graph, 1);
   const hash = await computeSchemaHash(schema);
@@ -2525,7 +2566,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 chunkW5MTHMTE_cjs.MigrationError(
+    throw new chunkYEDQLNVE_cjs.MigrationError(
       `Cannot rollback graph "${graphId}": no active schema version exists.`,
       { graphId, fromVersion: 0, toVersion: targetVersion }
     );
@@ -2574,7 +2615,7 @@ function validateProps(schema, props, context) {
   }
   const issues = zodIssuesToValidationIssues(result.error);
   const location = buildLocationString(context);
-  throw new chunkW5MTHMTE_cjs.ValidationError(
+  throw new chunkYEDQLNVE_cjs.ValidationError(
     `Invalid ${context.entityType} props for ${location}: ${result.error.message}`,
     {
       entityType: context.entityType,
@@ -2601,7 +2642,7 @@ function validateEdgeProps(schema, props, context) {
 function wrapZodError(error, context) {
   const issues = zodIssuesToValidationIssues(error);
   const location = buildLocationString(context);
-  return new chunkW5MTHMTE_cjs.ValidationError(
+  return new chunkYEDQLNVE_cjs.ValidationError(
     `Validation failed for ${context.entityType} ${location}: ${error.message}`,
     {
       entityType: context.entityType,
@@ -2614,7 +2655,7 @@ function wrapZodError(error, context) {
   );
 }
 function createValidationError(message, issues, context) {
-  return new chunkW5MTHMTE_cjs.ValidationError(message, {
+  return new chunkYEDQLNVE_cjs.ValidationError(message, {
     ...context?.entityType !== void 0 && {
       entityType: context.entityType
     },
@@ -2628,9 +2669,9 @@ function createValidationError(message, issues, context) {
 exports.KindRegistry = KindRegistry;
 exports.META_EDGE_BRAND = META_EDGE_BRAND;
 exports.applyDeprecatedKinds = applyDeprecatedKinds;
+exports.assertSchemaCurrent = assertSchemaCurrent;
 exports.broader = broader;
 exports.buildGraphExtensionOntologyKeySet = buildGraphExtensionOntologyKeySet;
-exports.canonicalEqual = canonicalEqual;
 exports.commitNewSchemaVersion = commitNewSchemaVersion;
 exports.compileTimeOntologyKey = compileTimeOntologyKey;
 exports.computeClosuresFromOntology = computeClosuresFromOntology;
@@ -2660,6 +2701,7 @@ exports.isMetaEdge = isMetaEdge;
 exports.isSchemaInitialized = isSchemaInitialized;
 exports.loadActiveSchemaWithBootstrap = loadActiveSchemaWithBootstrap;
 exports.loadAndMergeGraphExtensionDocument = loadAndMergeGraphExtensionDocument;
+exports.loadAndVerifyGraph = loadAndVerifyGraph;
 exports.mergeGraphExtension = mergeGraphExtension;
 exports.migrateSchema = migrateSchema;
 exports.narrower = narrower;
@@ -2670,11 +2712,10 @@ exports.rollbackSchema = rollbackSchema;
 exports.sameAs = sameAs;
 exports.serializeSchema = serializeSchema;
 exports.serializeSchemaProperties = serializeSchemaProperties;
-exports.sortedReplacer = sortedReplacer;
 exports.subClassOf = subClassOf;
 exports.validateEdgeProps = validateEdgeProps;
 exports.validateNodeProps = validateNodeProps;
 exports.validateProps = validateProps;
 exports.wrapZodError = wrapZodError;
-//# sourceMappingURL=chunk-QMQYK3IF.cjs.map
-//# sourceMappingURL=chunk-QMQYK3IF.cjs.map
+//# sourceMappingURL=chunk-ZGEMI7MJ.cjs.map
+//# sourceMappingURL=chunk-ZGEMI7MJ.cjs.map