@fortemi/core 2026.6.1 → 2026.6.2

package/dist/index.js

@@ -917,6 +917,28 @@ var migration0008 = {
   `
 };
 
+// src/migrations/0009_vector_selector_performance.ts
+var migration0009 = {
+  version: 9,
+  name: "0009_vector_selector_performance",
+  sql: `
+    CREATE INDEX IF NOT EXISTS idx_embedding_set_kind ON embedding_set(kind);
+    CREATE INDEX IF NOT EXISTS idx_embedding_set_member_set ON embedding_set_member(embedding_set_id);
+    CREATE INDEX IF NOT EXISTS idx_embedding_set_member_note ON embedding_set_member(note_id);
+    CREATE INDEX IF NOT EXISTS idx_embedding_set_member_embedding ON embedding_set_member(embedding_id);
+
+    CREATE INDEX IF NOT EXISTS idx_note_source ON note(source);
+    CREATE INDEX IF NOT EXISTS idx_note_format ON note(format);
+    CREATE INDEX IF NOT EXISTS idx_note_visibility ON note(visibility);
+    CREATE INDEX IF NOT EXISTS idx_note_starred ON note(is_starred);
+    CREATE INDEX IF NOT EXISTS idx_note_archived ON note(is_archived);
+    CREATE INDEX IF NOT EXISTS idx_note_updated_at ON note(updated_at);
+
+    CREATE INDEX IF NOT EXISTS idx_note_revised_current_user_edited ON note_revised_current(is_user_edited);
+    CREATE INDEX IF NOT EXISTS idx_note_revised_current_generation_count ON note_revised_current(generation_count);
+  `
+};
+
 // src/migrations/index.ts
 var allMigrations = [
   migration0001,
@@ -926,7 +948,8 @@ var allMigrations = [
   migration0005,
   migration0006,
   migration0007,
-  migration0008
+  migration0008,
+  migration0009
 ];
 
 // src/archive-manager.ts
@@ -1725,6 +1748,9 @@ function dateString(value) {
 function dateMillis(value) {
   return value instanceof Date ? value.getTime() : new Date(value).getTime();
 }
+function hashJson(value) {
+  return computeHash(new TextEncoder().encode(JSON.stringify(value)));
+}
 var EmbeddingSetsRepository = class {
   constructor(db) {
     this.db = db;
@@ -1772,7 +1798,12 @@ var EmbeddingSetsRepository = class {
         input.updatedAt ?? null
       ]
     );
-    return this.get(id);
+    const row = await this.get(id);
+    if (input.materialization?.allowed) {
+      await this.refreshMaterializedVirtualSet(id);
+      return this.get(id);
+    }
+    return row;
   }
   async ensureDefault() {
     const existing = await this.db.query(
@@ -1864,14 +1895,97 @@ var EmbeddingSetsRepository = class {
       const set = await this.get(selector.embeddingSetId);
       if (set.kind === "virtual") {
         const definition = this.definitionFromRow(set);
-        return this.resolveDefinition({ kind: "embedding-set", embeddingSetId: set.id }, definition);
+        return this.resolveDefinition({ kind: "embedding-set", embeddingSetId: set.id }, definition, set);
       }
       return this.resolvePhysicalSet(selector, set.id);
     }
     if (!selector.definition) throw new Error("virtual-definition selector requires definition");
     return this.resolveDefinition(selector, selector.definition);
   }
-  async resolveDefinition(selector, definition) {
+  async refreshMaterializedVirtualSet(setId) {
+    const set = await this.get(setId);
+    if (set.kind !== "virtual") throw new Error(`Embedding set is not virtual: ${setId}`);
+    const definition = this.definitionFromRow(set);
+    if (!definition.materialization?.allowed) {
+      throw new Error(`Virtual embedding set does not allow materialization: ${setId}`);
+    }
+    const live = await this.resolveDefinition(
+      { kind: "embedding-set", embeddingSetId: setId },
+      definition,
+      set,
+      { forceLive: true }
+    );
+    await this.db.query(`DELETE FROM embedding_set_member WHERE embedding_set_id = $1`, [setId]);
+    for (const row of live.rows) {
+      await this.db.query(
+        `INSERT INTO embedding_set_member (embedding_set_id, note_id, embedding_id)
+         VALUES ($1, $2, $3)
+         ON CONFLICT DO NOTHING`,
+        [setId, row.note_id, row.embedding_id]
+      );
+    }
+    const inputHash = this.resolutionInputHash(definition, live.rows);
+    const generatedAt = (/* @__PURE__ */ new Date()).toISOString();
+    const materialization = {
+      ...definition.materialization,
+      allowed: true,
+      includeResolvedMembers: true,
+      freshness: "fresh",
+      inputHash,
+      generatedAt,
+      resolvedMemberCount: live.rows.length
+    };
+    const freshness = {
+      status: "fresh",
+      sourceHash: inputHash,
+      checkedAt: generatedAt
+    };
+    await this.db.query(
+      `UPDATE embedding_set
+       SET materialization_json = $2::jsonb, freshness_json = $3::jsonb, updated_at = now()
+       WHERE id = $1`,
+      [setId, jsonParam(materialization), jsonParam(freshness)]
+    );
+    return this.finalizeResolution(
+      { kind: "embedding-set", embeddingSetId: setId },
+      live.rows,
+      live.errors,
+      definition.compatibility,
+      "fresh",
+      "materialized"
+    );
+  }
+  async markVirtualSetStale(setId, reason) {
+    const set = await this.get(setId);
+    if (set.kind !== "virtual") throw new Error(`Embedding set is not virtual: ${setId}`);
+    const definition = this.definitionFromRow(set);
+    const now = (/* @__PURE__ */ new Date()).toISOString();
+    const materialization = definition.materialization ? { ...definition.materialization, freshness: "stale" } : null;
+    await this.db.query(
+      `UPDATE embedding_set
+       SET materialization_json = $2::jsonb, freshness_json = $3::jsonb, updated_at = now()
+       WHERE id = $1`,
+      [
+        setId,
+        jsonParam(materialization),
+        jsonParam({ status: "stale", sourceHash: definition.materialization?.inputHash, checkedAt: now, reason })
+      ]
+    );
+  }
+  async resolveDefinition(selector, definition, set, options = {}) {
+    if (!options.forceLive && set && definition.materialization?.allowed && definition.materialization.freshness === "fresh") {
+      const materialized = await this.resolveMaterializedRows(set.id);
+      if (materialized.length > 0 || definition.materialization.resolvedMemberCount === 0) {
+        return this.finalizeResolution(
+          selector,
+          materialized,
+          [],
+          definition.compatibility,
+          "fresh",
+          "materialized"
+        );
+      }
+    }
     let rows;
     const errors = [];
     switch (definition.source.type) {
@@ -1893,10 +2007,10 @@ var EmbeddingSetsRepository = class {
       default:
         rows = [];
     }
-    return this.finalizeResolution(selector, rows, errors, definition.compatibility, definition.materialization?.freshness ?? "unknown");
+    return this.finalizeResolution(selector, rows, errors, definition.compatibility, definition.materialization?.freshness ?? "unknown", "live");
   }
   async resolvePhysicalSet(selector, setId) {
-    return this.finalizeResolution(selector, await this.resolvePhysicalRows(setId), [], DEFAULT_COMPATIBILITY, "fresh");
+    return this.finalizeResolution(selector, await this.resolvePhysicalRows(setId), [], DEFAULT_COMPATIBILITY, "fresh", "live");
   }
   async resolvePhysicalRows(setId) {
     const result = await this.db.query(
@@ -1908,6 +2022,17 @@ var EmbeddingSetsRepository = class {
     );
     return result.rows;
   }
+  async resolveMaterializedRows(setId) {
+    const result = await this.db.query(
+      `SELECT e.note_id, e.embedding_set_id, e.id as embedding_id, e.vector::text as vector, e.created_at
+       FROM embedding_set_member m
+       JOIN embedding e ON e.id = m.embedding_id
+       WHERE m.embedding_set_id = $1
+       ORDER BY e.note_id, e.created_at DESC`,
+      [setId]
+    );
+    return result.rows;
+  }
   async resolveCriteriaSource(source) {
     const criteria = source.criteria;
     if (criteria.conceptIds && criteria.conceptIds.length > 0) {
@@ -1928,6 +2053,50 @@ var EmbeddingSetsRepository = class {
       conditions.push(`EXISTS (SELECT 1 FROM collection_note cn WHERE cn.note_id = n.id AND cn.collection_id = ANY($${idx++}))`);
       params.push(criteria.collectionIds);
     }
+    if (criteria.sources?.length) {
+      conditions.push(`n.source = ANY($${idx++})`);
+      params.push(criteria.sources);
+    }
+    if (criteria.formats?.length) {
+      conditions.push(`n.format = ANY($${idx++})`);
+      params.push(criteria.formats);
+    }
+    if (criteria.visibilities?.length) {
+      conditions.push(`n.visibility = ANY($${idx++})`);
+      params.push(criteria.visibilities);
+    }
+    if (criteria.isStarred !== void 0) {
+      conditions.push(`n.is_starred = $${idx++}`);
+      params.push(criteria.isStarred);
+    }
+    if (criteria.isArchived !== void 0) {
+      conditions.push(`n.is_archived = $${idx++}`);
+      params.push(criteria.isArchived);
+    }
+    if (criteria.hasTitle !== void 0) {
+      conditions.push(criteria.hasTitle ? `n.title IS NOT NULL AND n.title <> ''` : `(n.title IS NULL OR n.title = '')`);
+    }
+    if (criteria.hasEmbedding === false) {
+      conditions.push("FALSE");
+    }
+    if (criteria.isUserEdited !== void 0) {
+      conditions.push(`COALESCE(c.is_user_edited, false) = $${idx++}`);
+      params.push(criteria.isUserEdited);
+    }
+    if (criteria.hasAiMetadata !== void 0) {
+      conditions.push(criteria.hasAiMetadata ? `c.ai_metadata IS NOT NULL` : `c.ai_metadata IS NULL`);
+    }
+    if (criteria.hasRevisions !== void 0) {
+      conditions.push(criteria.hasRevisions ? `EXISTS (SELECT 1 FROM note_revision nr WHERE nr.note_id = n.id)` : `NOT EXISTS (SELECT 1 FROM note_revision nr WHERE nr.note_id = n.id)`);
+    }
+    if (criteria.minGenerationCount !== void 0) {
+      conditions.push(`COALESCE(c.generation_count, 0) >= $${idx++}`);
+      params.push(criteria.minGenerationCount);
+    }
+    if (criteria.maxGenerationCount !== void 0) {
+      conditions.push(`COALESCE(c.generation_count, 0) <= $${idx++}`);
+      params.push(criteria.maxGenerationCount);
+    }
     if (criteria.updatedAfter) {
       conditions.push(`n.updated_at >= $${idx++}`);
       params.push(criteria.updatedAfter);
@@ -2018,7 +2187,7 @@ var EmbeddingSetsRepository = class {
     }
     return resolved.sort((a, b) => a.note_id.localeCompare(b.note_id));
   }
-  finalizeResolution(selector, rows, errors, compatibility, freshness) {
+  finalizeResolution(selector, rows, errors, compatibility, freshness, resolutionSource) {
     const deduped = this.resolveDuplicateRows(rows, compatibility, errors);
     return {
       selector,
@@ -2026,9 +2195,17 @@ var EmbeddingSetsRepository = class {
       noteIds: deduped.map((row) => row.note_id),
       embeddingIds: deduped.map((row) => row.embedding_id),
       errors,
-      freshness: { status: freshness }
+      freshness: { status: freshness },
+      resolutionSource
     };
   }
+  resolutionInputHash(definition, rows) {
+    return hashJson({
+      source: definition.source,
+      compatibility: definition.compatibility,
+      members: rows.map((row) => [row.note_id, row.embedding_set_id, row.embedding_id])
+    });
+  }
   definitionFromRow(row) {
     const source = asObject(row.source_json);
     if (!source) throw new Error(`Virtual embedding set has no source definition: ${row.id}`);
@@ -2433,8 +2610,9 @@ var SearchRepository = class {
 };
 
 // src/repositories/graph-repository.ts
-var SIMILARITY_GRAPH_ALGORITHM = "knn-v1";
-function hashJson(value) {
+var SIMILARITY_GRAPH_ALGORITHM = "knn-batched-v1";
+var DEFAULT_GRAPH_BATCH_SIZE = 64;
+function hashJson2(value) {
   return computeHash(new TextEncoder().encode(JSON.stringify(value)));
 }
 function sourceIdFor(inputHash) {
@@ -2445,6 +2623,45 @@ function jsonObject(value) {
   if (typeof value === "string") return JSON.parse(value);
   return value;
 }
+async function yieldToEventLoop() {
+  const scheduler = globalThis.scheduler;
+  if (scheduler?.yield) {
+    await scheduler.yield();
+    return;
+  }
+  await new Promise((resolve) => setTimeout(resolve, 0));
+}
+async function maybeYield(done, every) {
+  if (every > 0 && done > 0 && done % every === 0) {
+    await yieldToEventLoop();
+  }
+}
+function parseVector(value) {
+  return value.replace(/^\[/, "").replace(/\]$/, "").split(",").filter((part) => part.length > 0).map(Number);
+}
+function vectorScore(left, right, metric) {
+  let dot = 0;
+  let leftNorm = 0;
+  let rightNorm = 0;
+  let squaredDistance = 0;
+  for (let i = 0; i < Math.min(left.length, right.length); i++) {
+    dot += left[i] * right[i];
+    leftNorm += left[i] * left[i];
+    rightNorm += right[i] * right[i];
+    const diff = left[i] - right[i];
+    squaredDistance += diff * diff;
+  }
+  if (metric === "inner_product") {
+    return { distance: -dot, similarity: dot };
+  }
+  if (metric === "l2") {
+    const distance = Math.sqrt(squaredDistance);
+    return { distance, similarity: -distance };
+  }
+  const denominator = Math.sqrt(leftNorm) * Math.sqrt(rightNorm);
+  const similarity = denominator === 0 ? 0 : dot / denominator;
+  return { distance: 1 - similarity, similarity };
+}
 function detectCommunities(edges, nodes = [], options = {}) {
   const nodeIds = new Set(nodes.map((n) => n.id));
   for (const edge of edges) {
@@ -2521,7 +2738,7 @@ var GraphRepository = class {
     const normalized = this.normalizeSimilarityRequest(request);
     const resolved = await new EmbeddingSetsRepository(this.db).resolveSelector(normalized.selector);
     const cacheKey = await this.computeSimilarityGraphCacheKey(normalized, resolved);
-    const inputHash = hashJson(cacheKey);
+    const inputHash = hashJson2(cacheKey);
     const source = await this.findGraphSource(inputHash);
     if (!source) return null;
     const graph = await this.graphFromArtifact(source.id, resolved.noteIds);
@@ -2536,7 +2753,7 @@ var GraphRepository = class {
     const normalized = this.normalizeSimilarityRequest(request);
     const resolved = await new EmbeddingSetsRepository(this.db).resolveSelector(normalized.selector);
     const cacheKey = await this.computeSimilarityGraphCacheKey(normalized, resolved);
-    const inputHash = hashJson(cacheKey);
+    const inputHash = hashJson2(cacheKey);
     if (normalized.source !== "live-only") {
       const cached = await this.findGraphSource(inputHash);
       if (cached?.freshness === "fresh") {
@@ -2569,7 +2786,7 @@ var GraphRepository = class {
     };
   }
   async saveSimilarityGraphArtifact(input) {
-    const inputHash = hashJson(input.cacheKey);
+    const inputHash = hashJson2(input.cacheKey);
     const id = sourceIdFor(inputHash);
     const parameters = {
       k: input.request.k,
@@ -2620,27 +2837,32 @@ var GraphRepository = class {
   async buildSimilarityGraphFromResolved(resolved, options) {
     const k = options.k ?? 5;
     const minSimilarity = options.minSimilarity ?? options.threshold ?? -1;
+    const metric = options.metric ?? "cosine";
+    const yieldEvery = options.yieldEvery ?? options.batchSize ?? DEFAULT_GRAPH_BATCH_SIZE;
     const embeddings = resolved.rows;
     const nodes = embeddings.map((row) => ({ id: row.note_id }));
     const edgeMap = /* @__PURE__ */ new Map();
-    for (const row of embeddings) {
-      const neighbors = await this.db.query(
-        `SELECT note_id, 1 - (vector <=> $2::vector) as similarity
-         FROM embedding
-         WHERE id = ANY($1) AND note_id != $3
-         ORDER BY vector <=> $2::vector ASC
-         LIMIT $4`,
-        [resolved.embeddingIds, row.vector, row.note_id, k]
-      );
-      for (const neighbor of neighbors.rows) {
+    const vectors = embeddings.map((row) => ({
+      row,
+      vector: parseVector(row.vector)
+    }));
+    options.onProgress?.({ phase: "prepare", done: vectors.length, total: vectors.length });
+    for (const [index, item] of vectors.entries()) {
+      const neighbors = vectors.filter((candidate) => candidate.row.note_id !== item.row.note_id).map((candidate) => {
+        const score = vectorScore(item.vector, candidate.vector, metric);
+        return { noteId: candidate.row.note_id, ...score };
+      }).sort((a, b) => a.distance - b.distance || a.noteId.localeCompare(b.noteId)).slice(0, k);
+      for (const neighbor of neighbors) {
         if (neighbor.similarity < minSimilarity) continue;
-        const [source, target] = [row.note_id, neighbor.note_id].sort();
+        const [source, target] = [item.row.note_id, neighbor.noteId].sort();
         const id = `${source}\0${target}`;
         const existing = edgeMap.get(id);
         if (!existing || neighbor.similarity > existing.weight) {
           edgeMap.set(id, { source, target, weight: neighbor.similarity, kind: "similarity" });
         }
       }
+      options.onProgress?.({ phase: "neighbors", done: index + 1, total: vectors.length });
+      await maybeYield(index + 1, yieldEvery);
     }
     const edges = Array.from(edgeMap.values()).sort(
       (a, b) => a.source.localeCompare(b.source) || a.target.localeCompare(b.target)
@@ -2651,7 +2873,7 @@ var GraphRepository = class {
     const firstSetId = resolved.rows[0]?.embedding_set_id;
     const set = firstSetId ? await new EmbeddingSetsRepository(this.db).get(firstSetId) : null;
     return {
-      selectorHash: hashJson(request.selector),
+      selectorHash: hashJson2(request.selector),
       resolvedEmbeddingSetId: request.selector.kind === "embedding-set" ? request.selector.embeddingSetId : void 0,
       virtualSetId: request.selector.kind === "virtual-definition" ? request.selector.definition?.id : void 0,
       k: request.k,
@@ -2660,9 +2882,9 @@ var GraphRepository = class {
       model: set?.model_name ?? "unknown",
       dimension: set?.dimensions ?? 0,
       truncateDimension: set?.truncate_dimension ?? null,
-      memberHash: hashJson(resolved.rows.map((row) => [row.note_id, row.embedding_set_id, row.embedding_id])),
-      vectorHash: hashJson(resolved.rows.map((row) => [row.embedding_id, row.vector])),
-      parameterHash: hashJson({ k: request.k, minSimilarity: request.minSimilarity, metric: request.metric, algorithm: SIMILARITY_GRAPH_ALGORITHM })
+      memberHash: hashJson2(resolved.rows.map((row) => [row.note_id, row.embedding_set_id, row.embedding_id])),
+      vectorHash: hashJson2(resolved.rows.map((row) => [row.embedding_id, row.vector])),
+      parameterHash: hashJson2({ k: request.k, minSimilarity: request.minSimilarity, metric: request.metric, algorithm: SIMILARITY_GRAPH_ALGORITHM })
     };
   }
   async findGraphSource(inputHash) {
@@ -5651,7 +5873,7 @@ function embeddingToShard(emb) {
     id: emb.id,
     note_id: emb.note_id,
     embedding_set_id: emb.embedding_set_id,
-    vector: typeof emb.vector === "string" ? parseVector(emb.vector) : emb.vector,
+    vector: typeof emb.vector === "string" ? parseVector2(emb.vector) : emb.vector,
     created_at: toISOString(emb.created_at)
   };
 }
@@ -5717,7 +5939,7 @@ function toISOString(date) {
   if (date instanceof Date) return date.toISOString();
   return date;
 }
-function parseVector(vectorStr) {
+function parseVector2(vectorStr) {
   const inner = vectorStr.replace(/^\[/, "").replace(/\]$/, "");
   return inner.split(",").map(Number);
 }
@@ -5891,6 +6113,7 @@ async function exportShard(db, options) {
   if (options?.includeEmbeddings) {
     const embeddingSetIds = options.embeddingSetIds?.filter(Boolean) ?? [];
     const setScoped = embeddingSetIds.length > 0;
+    const includeMaterializedSelectors = options.includeMaterializedSelectors === true;
     const embSetRows = await db.query(
       `SELECT * FROM embedding_set
        ${setScoped ? "WHERE id = ANY($1)" : ""}
@@ -5898,7 +6121,14 @@ async function exportShard(db, options) {
       setScoped ? [embeddingSetIds] : []
     );
     const exportedSetIds = new Set(embSetRows.rows.map((row) => row.id));
-    const shardEmbSets = embSetRows.rows.map(embeddingSetToShard);
+    const virtualSetIds = new Set(embSetRows.rows.filter((row) => row.kind === "virtual").map((row) => row.id));
+    const shardEmbSets = embSetRows.rows.map((row) => embeddingSetToShard(
+      row.kind === "virtual" && !includeMaterializedSelectors ? {
+        ...row,
+        materialization_json: void 0,
+        freshness_json: { status: "unknown" }
+      } : row
+    ));
     files.set("embedding_sets.json", encoder.encode(JSON.stringify(shardEmbSets)));
     components.push("embedding_sets");
     counts.embedding_sets = shardEmbSets.length;
@@ -5908,7 +6138,7 @@ async function exportShard(db, options) {
       setScoped ? [embeddingSetIds] : []
     );
     const scopedEmbMemberRows = embMemberRows.rows.filter(
-      (member) => exportedSetIds.has(member.embedding_set_id) && exportedNoteIds.has(member.note_id)
+      (member) => exportedSetIds.has(member.embedding_set_id) && exportedNoteIds.has(member.note_id) && (includeMaterializedSelectors || !virtualSetIds.has(member.embedding_set_id))
     );
     const membersJsonl = scopedEmbMemberRows.map((m) => JSON.stringify(embeddingSetMemberToShard(m))).join("\n");
     files.set("embedding_set_members.jsonl", encoder.encode(membersJsonl));
@@ -6044,7 +6274,7 @@ async function exportShard(db, options) {
 // src/shard/shard-import.ts
 var decoder = new TextDecoder();
 var DEFAULT_BATCH_SIZE = 250;
-async function yieldToEventLoop() {
+async function yieldToEventLoop2() {
   const scheduler = globalThis.scheduler;
   if (scheduler?.yield) {
     await scheduler.yield();
@@ -6052,9 +6282,9 @@ async function yieldToEventLoop() {
   }
   await new Promise((resolve) => setTimeout(resolve, 0));
 }
-async function maybeYield(done, batchSize) {
+async function maybeYield2(done, batchSize) {
   if (batchSize > 0 && done > 0 && done % batchSize === 0) {
-    await yieldToEventLoop();
+    await yieldToEventLoop2();
   }
 }
 async function importShard(db, data, options) {
@@ -6218,7 +6448,7 @@ async function importShard(db, data, options) {
         }
         counts.collections++;
         report?.({ phase: "collections", done: index + 1, total: parsedCollections.length });
-        await maybeYield(index + 1, batchSize);
+        await maybeYield2(index + 1, batchSize);
       }
       report?.({ phase: "notes", done: 0, total: parsedNotes.length });
       for (const [index, shardNote] of parsedNotes.entries()) {
@@ -6299,7 +6529,7 @@ async function importShard(db, data, options) {
         }
         counts.notes++;
         report?.({ phase: "notes", done: index + 1, total: parsedNotes.length });
-        await maybeYield(index + 1, batchSize);
+        await maybeYield2(index + 1, batchSize);
       }
       const totalSkos = parsedSkosSchemes.length + parsedSkosConcepts.length + parsedSkosRelations.length + parsedNoteSkosTags.length;
       let doneSkos = 0;
@@ -6321,7 +6551,7 @@ async function importShard(db, data, options) {
         }
         counts.skos_schemes++;
         report?.({ phase: "skos", done: ++doneSkos, total: totalSkos });
-        await maybeYield(doneSkos, batchSize);
+        await maybeYield2(doneSkos, batchSize);
       }
       for (const concept of parsedSkosConcepts) {
         const altLabels = JSON.stringify(concept.alt_labels ?? []);
@@ -6341,7 +6571,7 @@ async function importShard(db, data, options) {
         }
         counts.skos_concepts++;
         report?.({ phase: "skos", done: ++doneSkos, total: totalSkos });
-        await maybeYield(doneSkos, batchSize);
+        await maybeYield2(doneSkos, batchSize);
       }
       report?.({ phase: "links", done: 0, total: parsedLinks.length });
       for (const [index, shardLink] of parsedLinks.entries()) {
@@ -6362,7 +6592,7 @@ async function importShard(db, data, options) {
         }
         counts.links++;
         report?.({ phase: "links", done: index + 1, total: parsedLinks.length });
-        await maybeYield(index + 1, batchSize);
+        await maybeYield2(index + 1, batchSize);
       }
       for (const relation of parsedSkosRelations) {
         if (strategy === "replace") {
@@ -6381,7 +6611,7 @@ async function importShard(db, data, options) {
         }
         counts.skos_relations++;
         report?.({ phase: "skos", done: ++doneSkos, total: totalSkos });
-        await maybeYield(doneSkos, batchSize);
+        await maybeYield2(doneSkos, batchSize);
       }
       for (const tag of parsedNoteSkosTags) {
         await tx.query(
@@ -6392,7 +6622,7 @@ async function importShard(db, data, options) {
         );
         counts.note_skos_tags++;
         report?.({ phase: "skos", done: ++doneSkos, total: totalSkos });
-        await maybeYield(doneSkos, batchSize);
+        await maybeYield2(doneSkos, batchSize);
       }
       report?.({ phase: "provenance", done: 0, total: parsedProvenanceEdges.length });
       for (const [index, edge] of parsedProvenanceEdges.entries()) {
@@ -6413,7 +6643,7 @@ async function importShard(db, data, options) {
         }
         counts.provenance_edges++;
         report?.({ phase: "provenance", done: index + 1, total: parsedProvenanceEdges.length });
-        await maybeYield(index + 1, batchSize);
+        await maybeYield2(index + 1, batchSize);
       }
       report?.({ phase: "embedding_sets", done: 0, total: parsedEmbSets.length });
       for (const [index, shardSet] of parsedEmbSets.entries()) {
@@ -6440,7 +6670,7 @@ async function importShard(db, data, options) {
         }
         counts.embedding_sets++;
         report?.({ phase: "embedding_sets", done: index + 1, total: parsedEmbSets.length });
-        await maybeYield(index + 1, batchSize);
+        await maybeYield2(index + 1, batchSize);
       }
       report?.({ phase: "embeddings", done: 0, total: parsedEmbeddings.length });
       for (const [index, shardEmb] of parsedEmbeddings.entries()) {
@@ -6461,7 +6691,7 @@ async function importShard(db, data, options) {
         }
         counts.embeddings++;
         report?.({ phase: "embeddings", done: index + 1, total: parsedEmbeddings.length });
-        await maybeYield(index + 1, batchSize);
+        await maybeYield2(index + 1, batchSize);
       }
       const totalGraph = parsedGraphSources.length + parsedGraphEdges.length;
       let doneGraph = 0;
@@ -6479,7 +6709,7 @@ async function importShard(db, data, options) {
         );
         counts.graph_sources++;
         report?.({ phase: "graph", done: ++doneGraph, total: totalGraph });
-        await maybeYield(doneGraph, batchSize);
+        await maybeYield2(doneGraph, batchSize);
       }
       for (const edge of parsedGraphEdges) {
         const metadata = edge.metadata == null ? null : JSON.stringify(edge.metadata);
@@ -6491,7 +6721,7 @@ async function importShard(db, data, options) {
         );
         counts.graph_edges++;
         report?.({ phase: "graph", done: ++doneGraph, total: totalGraph });
-        await maybeYield(doneGraph, batchSize);
+        await maybeYield2(doneGraph, batchSize);
       }
       const totalCommunities = parsedCommunitySets.length + parsedCommunitySets.reduce((sum, set) => sum + (set.communities?.length ?? 0), 0) + parsedCommunityAssignments.length;
       let doneCommunities = 0;
@@ -6507,7 +6737,7 @@ async function importShard(db, data, options) {
         );
         counts.community_sets++;
         report?.({ phase: "communities", done: ++doneCommunities, total: totalCommunities });
-        await maybeYield(doneCommunities, batchSize);
+        await maybeYield2(doneCommunities, batchSize);
         for (const community of set.communities ?? []) {
           const metadata = community.metadata == null ? null : JSON.stringify(community.metadata);
           await tx.query(
@@ -6518,7 +6748,7 @@ async function importShard(db, data, options) {
           );
           counts.communities++;
           report?.({ phase: "communities", done: ++doneCommunities, total: totalCommunities });
-          await maybeYield(doneCommunities, batchSize);
+          await maybeYield2(doneCommunities, batchSize);
         }
       }
       for (const assignment of parsedCommunityAssignments) {
@@ -6531,7 +6761,7 @@ async function importShard(db, data, options) {
         );
         counts.community_assignments++;
         report?.({ phase: "communities", done: ++doneCommunities, total: totalCommunities });
-        await maybeYield(doneCommunities, batchSize);
+        await maybeYield2(doneCommunities, batchSize);
       }
       report?.({ phase: "embedding_set_members", done: 0, total: parsedEmbMembers.length });
       for (const [index, member] of parsedEmbMembers.entries()) {
@@ -6542,7 +6772,7 @@ async function importShard(db, data, options) {
         );
         counts.embedding_set_members++;
         report?.({ phase: "embedding_set_members", done: index + 1, total: parsedEmbMembers.length });
-        await maybeYield(index + 1, batchSize);
+        await maybeYield2(index + 1, batchSize);
       }
     });
     report?.({ phase: "index", done: 1, total: 1 });
@@ -6596,8 +6826,15 @@ var VALID_TYPES = /* @__PURE__ */ new Set([
   "crm.organization",
   "crm.event",
   "crm.interaction",
-  "aiwg.artifact"
+  "aiwg.artifact",
+  "docs.page"
 ]);
+var DEFAULT_QUERY_WEIGHTS = {
+  title: 4,
+  tag: 3,
+  concept: 2,
+  text: 1
+};
 function hasString(value) {
   return typeof value === "string" && value.length > 0;
 }
@@ -6605,6 +6842,16 @@ function pushFacet(counts, name, value) {
   counts[name] ??= {};
   counts[name][value] = (counts[name][value] ?? 0) + 1;
 }
+function hasNonNegativeInteger(value) {
+  return Number.isInteger(value) && typeof value === "number" && value >= 0;
+}
+function hasPositiveInteger(value) {
+  return Number.isInteger(value) && typeof value === "number" && value > 0;
+}
+function isFacetCounts(value) {
+  if (!value || typeof value !== "object" || Array.isArray(value)) return false;
+  return Object.values(value).every((counts) => !!counts && typeof counts === "object" && !Array.isArray(counts) && Object.values(counts).every((count) => hasNonNegativeInteger(count)));
+}
 function validateAiwgFortemiIndexExport(value) {
   const errors = [];
   const counts = {};
@@ -6656,6 +6903,87 @@ function assertAiwgFortemiIndexExport(value) {
   }
   return value;
 }
+function validateAiwgFortemiChunkManifest(value) {
+  const errors = [];
+  const data = value;
+  if (data?.schema_version !== "aiwg.fortemi.index.chunk-manifest.v1") {
+    errors.push("schema_version must be aiwg.fortemi.index.chunk-manifest.v1");
+  }
+  if (!hasString(data?.generated_at)) errors.push("generated_at is required");
+  if (!hasString(data?.source?.repo)) errors.push("source.repo is required");
+  if (!hasString(data?.source?.privacy)) errors.push("source.privacy is required");
+  if (!hasNonNegativeInteger(data?.total)) errors.push("total must be a non-negative integer");
+  if (!hasPositiveInteger(data?.part_size)) errors.push("part_size must be a positive integer");
+  if (data.facets !== void 0 && !isFacetCounts(data.facets)) {
+    errors.push("facets must be a nested string-to-number count object");
+  }
+  if (!Array.isArray(data?.parts)) errors.push("parts must be an array");
+  let expectedOffset = 0;
+  const parts = Array.isArray(data?.parts) ? data.parts : [];
+  for (const [index, part] of parts.entries()) {
+    if (!hasString(part.href)) errors.push("parts[" + index + "].href is required");
+    if (!hasNonNegativeInteger(part.offset)) errors.push("parts[" + index + "].offset must be a non-negative integer");
+    if (!hasNonNegativeInteger(part.count)) errors.push("parts[" + index + "].count must be a non-negative integer");
+    if (hasNonNegativeInteger(part.offset) && part.offset !== expectedOffset) {
+      errors.push("parts[" + index + "].offset must be " + expectedOffset);
+    }
+    if (hasNonNegativeInteger(part.count)) expectedOffset += part.count;
+  }
+  if (hasNonNegativeInteger(data?.total) && expectedOffset !== data.total) {
+    errors.push("parts counts must add up to total");
+  }
+  return { valid: errors.length === 0, errors };
+}
+function assertAiwgFortemiChunkManifest(value) {
+  const result = validateAiwgFortemiChunkManifest(value);
+  if (!result.valid) {
+    throw new Error("Invalid AIWG Fortemi chunk manifest:\n" + result.errors.join("\n"));
+  }
+  return value;
+}
+function validateAiwgFortemiChunkPart(value, partRef, manifest) {
+  const errors = [];
+  const data = value;
+  if (data?.schema_version !== "aiwg.fortemi.index.chunk.v1") {
+    errors.push("schema_version must be aiwg.fortemi.index.chunk.v1");
+  }
+  if (data?.manifest_schema_version !== "aiwg.fortemi.index.chunk-manifest.v1") {
+    errors.push("manifest_schema_version must be aiwg.fortemi.index.chunk-manifest.v1");
+  }
+  if (!hasNonNegativeInteger(data?.offset)) errors.push("offset must be a non-negative integer");
+  if (!Array.isArray(data?.items)) errors.push("items must be an array");
+  if (partRef && hasNonNegativeInteger(data?.offset) && data.offset !== partRef.offset) {
+    errors.push("offset must match manifest part offset " + partRef.offset);
+  }
+  if (partRef && Array.isArray(data?.items) && data.items.length !== partRef.count) {
+    errors.push("items length must match manifest part count " + partRef.count);
+  }
+  if (Array.isArray(data?.items)) {
+    const validation = validateAiwgFortemiIndexExport({
+      schema_version: "aiwg.fortemi.index.export.v1",
+      generated_at: manifest?.generated_at ?? "1970-01-01T00:00:00.000Z",
+      source: manifest?.source ?? { repo: "chunk", privacy: "public" },
+      items: data.items
+    });
+    errors.push(...validation.errors.map((error) => "items." + error));
+  }
+  return { valid: errors.length === 0, errors };
+}
+function assertAiwgFortemiChunkPart(value, partRef, manifest) {
+  const result = validateAiwgFortemiChunkPart(value, partRef, manifest);
+  if (!result.valid) {
+    throw new Error("Invalid AIWG Fortemi chunk part:\n" + result.errors.join("\n"));
+  }
+  return value;
+}
+function createAiwgFetchChunkLoader(baseUrl) {
+  return async (part) => {
+    const href = baseUrl ? new URL(part.href, baseUrl).toString() : part.href;
+    const response = await fetch(href);
+    if (!response.ok) throw new Error("Failed to fetch AIWG index chunk " + href + ": " + response.status);
+    return response.json();
+  };
+}
 function getAiwgFortemiFacets(items) {
   const result = {};
   for (const item of items) {
@@ -6678,27 +7006,167 @@ function matchesFacetFilters(item, filters) {
   if (!filters) return true;
   return Object.entries(filters).every(([name, expected]) => includesAll(item.facets[name] ?? [], expected));
 }
-function queryAiwgFortemiIndex(index, query = "", options = {}) {
-  const q = query.trim().toLowerCase();
-  const filtered = index.items.filter((item) => {
-    if (q) {
-      const haystack = [item.title, item.text, ...item.tags, ...item.concepts].join("\n").toLowerCase();
-      if (!haystack.includes(q)) return false;
-    }
+function queryMatches(item, q) {
+  if (!q) return [];
+  const matches = [];
+  if (item.title.toLowerCase().includes(q)) matches.push({ field: "title", value: item.title });
+  if (item.text.toLowerCase().includes(q)) matches.push({ field: "text", value: item.text });
+  for (const tag of item.tags) {
+    if (tag.toLowerCase().includes(q)) matches.push({ field: "tag", value: tag });
+  }
+  for (const concept of item.concepts) {
+    if (concept.toLowerCase().includes(q)) matches.push({ field: "concept", value: concept });
+  }
+  return matches;
+}
+function rankMatches(matches, weights) {
+  return matches.reduce((total, match) => total + weights[match.field], 0);
+}
+function clipSnippet(value, q, maxLength) {
+  const normalizedLength = Math.max(20, maxLength);
+  if (!value) return "";
+  if (!q) return value.length > normalizedLength ? `${value.slice(0, normalizedLength).trimEnd()}...` : value;
+  const lower = value.toLowerCase();
+  const index = lower.indexOf(q);
+  if (index < 0) return value.length > normalizedLength ? `${value.slice(0, normalizedLength).trimEnd()}...` : value;
+  const context = Math.max(0, Math.floor((normalizedLength - q.length) / 2));
+  const start = Math.max(0, index - context);
+  const end = Math.min(value.length, start + normalizedLength);
+  const prefix = start > 0 ? "..." : "";
+  const suffix = end < value.length ? "..." : "";
+  return `${prefix}${value.slice(start, end).trim()}${suffix}`;
+}
+function createSnippet(item, matches, q, maxLength) {
+  const textMatch = matches.find((match) => match.field === "text");
+  const titleMatch = matches.find((match) => match.field === "title");
+  const firstMatch = textMatch ?? titleMatch ?? matches[0];
+  return clipSnippet(firstMatch?.value ?? item.text, q, maxLength);
+}
+function createRankedEntries(items, q, options, ordinalBase = 0) {
+  const weights = { ...DEFAULT_QUERY_WEIGHTS, ...options.weights };
+  return items.map((item, ordinal) => ({ item, ordinal: ordinalBase + ordinal, matches: queryMatches(item, q) })).filter(({ item, matches }) => {
+    if (q && matches.length === 0) return false;
     if (options.types && !options.types.includes(item.type)) return false;
     if (options.privacy && !options.privacy.includes(item.privacy.classification)) return false;
     if (!includesAll(item.tags, options.tags)) return false;
     if (!includesAll(item.concepts, options.concepts)) return false;
     if (!matchesFacetFilters(item, options.facets)) return false;
-    if (options.relationshipTargetId && !item.relationships.some((rel) => rel.target_id === options.relationshipTargetId)) return false;
+    if (options.relationshipTargetId && !item.relationships.some((rel) => rel.target_id === options.relationshipTargetId)) {
+      return false;
+    }
     return true;
+  }).map(({ item, ordinal, matches }) => ({
+    item,
+    ordinal,
+    rank: rankMatches(matches, weights),
+    matches
+  }));
+}
+function sortRankedEntries(entries, rank) {
+  return [...entries].sort((left, right) => {
+    if (rank) return right.rank - left.rank || left.ordinal - right.ordinal;
+    return left.ordinal - right.ordinal;
   });
+}
+function createQueryResultFromRankedEntries(entries, query, options) {
+  const ranked = sortRankedEntries(entries, options.rank);
   const offset = options.offset ?? 0;
-  const limit = options.limit ?? filtered.length;
+  const limit = options.limit ?? ranked.length;
+  const page = ranked.slice(offset, offset + limit);
+  const result = {
+    items: page.map((entry) => entry.item),
+    total: ranked.length,
+    facets: getAiwgFortemiFacets(ranked.map((entry) => entry.item))
+  };
+  if (options.rank || options.snippets || options.includeMatches) {
+    const snippetLength = options.snippetLength ?? 160;
+    result.rankedItems = page.map((entry) => ({
+      item: entry.item,
+      rank: entry.rank,
+      ...options.snippets ? { snippet: createSnippet(entry.item, entry.matches, query, snippetLength) } : {},
+      ...options.includeMatches ? { matches: entry.matches } : {}
+    }));
+  }
+  return result;
+}
+function queryAiwgFortemiIndex(index, query = "", options = {}) {
+  const q = query.trim().toLowerCase();
+  return createQueryResultFromRankedEntries(createRankedEntries(index.items, q, options), q, options);
+}
+function chunkPartCacheKey(part) {
+  return `${part.offset}:${part.href}`;
+}
+function clampMaxCachedParts(value) {
+  if (!hasPositiveInteger(value)) return 3;
+  return value;
+}
+function isDirectChunkBrowse(query, options) {
+  return query.trim() === "" && !options.rank && !options.snippets && !options.includeMatches && !options.types && !options.facets && !options.tags && !options.concepts && !options.privacy && !options.relationshipTargetId;
+}
+function getPartsForRange(manifest, offset, limit) {
+  const end = offset + limit;
+  return manifest.parts.filter((part) => part.count > 0 && part.offset < end && part.offset + part.count > offset);
+}
+async function loadChunkPart(runtime, part) {
+  const key = chunkPartCacheKey(part);
+  const cached = runtime.partCache.get(key);
+  if (cached) {
+    runtime.partCache.delete(key);
+    runtime.partCache.set(key, cached);
+    return { part: cached, fetched: false };
+  }
+  const parsed = assertAiwgFortemiChunkPart(await runtime.loader(part, runtime.manifest), part, runtime.manifest);
+  runtime.partCache.set(key, parsed);
+  while (runtime.partCache.size > runtime.maxCachedParts) {
+    const oldest = runtime.partCache.keys().next().value;
+    if (oldest === void 0) break;
+    runtime.partCache.delete(oldest);
+  }
+  return { part: parsed, fetched: true };
+}
+async function queryChunkedAiwgFortemiIndex(runtime, query = "", options = {}) {
+  const q = query.trim().toLowerCase();
+  let scannedParts = 0;
+  let fetchedParts = 0;
+  if (isDirectChunkBrowse(query, options)) {
+    const offset = options.offset ?? 0;
+    const limit = options.limit ?? runtime.manifest.total;
+    const parts = getPartsForRange(runtime.manifest, offset, limit);
+    const items = [];
+    for (const partRef of parts) {
+      const loaded = await loadChunkPart(runtime, partRef);
+      if (loaded.fetched) fetchedParts += 1;
+      scannedParts += 1;
+      options.onProgress?.({ phase: "part", done: scannedParts, total: parts.length, href: partRef.href });
+      const start = Math.max(0, offset - partRef.offset);
+      const end = Math.min(loaded.part.items.length, offset + limit - partRef.offset);
+      items.push(...loaded.part.items.slice(start, end));
+    }
+    return {
+      items,
+      total: runtime.manifest.total,
+      facets: runtime.manifest.facets ?? {},
+      manifestTotal: runtime.manifest.total,
+      scannedParts,
+      fetchedParts,
+      complete: true
+    };
+  }
+  const entries = [];
+  for (const partRef of runtime.manifest.parts) {
+    const loaded = await loadChunkPart(runtime, partRef);
+    if (loaded.fetched) fetchedParts += 1;
+    scannedParts += 1;
+    options.onProgress?.({ phase: "part", done: scannedParts, total: runtime.manifest.parts.length, href: partRef.href });
+    entries.push(...createRankedEntries(loaded.part.items, q, options, partRef.offset));
+    options.onProgress?.({ phase: "query", done: scannedParts, total: runtime.manifest.parts.length, href: partRef.href });
+  }
   return {
-    items: filtered.slice(offset, offset + limit),
-    total: filtered.length,
-    facets: getAiwgFortemiFacets(filtered)
+    ...createQueryResultFromRankedEntries(entries, q, options),
+    manifestTotal: runtime.manifest.total,
+    scannedParts,
+    fetchedParts,
+    complete: true
   };
 }
 function createAiwgReviewDecisionExport(source, decisions, generatedAt = (/* @__PURE__ */ new Date()).toISOString()) {
@@ -6709,6 +7177,137 @@ function createAiwgReviewDecisionExport(source, decisions, generatedAt = (/* @__
     decisions: [...decisions].sort((left, right) => left.item_id.localeCompare(right.item_id))
   };
 }
+function createAiwgIndexController(initialIndex) {
+  let index = initialIndex ?? null;
+  let chunked = null;
+  let data = null;
+  let error = null;
+  let reviewDecisions = [];
+  const listeners = /* @__PURE__ */ new Set();
+  const snapshot = () => ({
+    index,
+    chunked: chunked ? {
+      manifest: chunked.manifest,
+      cachedParts: chunked.partCache.size,
+      maxCachedParts: chunked.maxCachedParts
+    } : null,
+    data,
+    error,
+    reviewDecisions: [...reviewDecisions]
+  });
+  const notify = () => {
+    const current = snapshot();
+    for (const listener of listeners) listener(current);
+  };
+  const requireIndex = () => {
+    if (!index) throw new Error("No AIWG index export loaded");
+    return index;
+  };
+  return {
+    loadIndex(value) {
+      try {
+        const parsed = assertAiwgFortemiIndexExport(value);
+        index = parsed;
+        chunked = null;
+        data = null;
+        reviewDecisions = [];
+        error = null;
+        notify();
+        return parsed;
+      } catch (err) {
+        error = err instanceof Error ? err : new Error(String(err));
+        notify();
+        throw error;
+      }
+    },
+    loadChunkedIndex(manifest, loader, options = {}) {
+      try {
+        const parsed = assertAiwgFortemiChunkManifest(manifest);
+        index = null;
+        chunked = {
+          manifest: parsed,
+          loader,
+          maxCachedParts: clampMaxCachedParts(options.maxCachedParts),
+          partCache: /* @__PURE__ */ new Map()
+        };
+        data = null;
+        reviewDecisions = [];
+        error = null;
+        notify();
+        return parsed;
+      } catch (err) {
+        error = err instanceof Error ? err : new Error(String(err));
+        notify();
+        throw error;
+      }
+    },
+    getIndex() {
+      return index;
+    },
+    getChunkedManifest() {
+      return chunked?.manifest ?? null;
+    },
+    getSnapshot() {
+      return snapshot();
+    },
+    query(query = "", options) {
+      const result = queryAiwgFortemiIndex(requireIndex(), query, options);
+      data = result;
+      error = null;
+      notify();
+      return result;
+    },
+    async queryChunked(query = "", options) {
+      if (!chunked) throw new Error("No AIWG chunked index manifest loaded");
+      try {
+        const result = await queryChunkedAiwgFortemiIndex(chunked, query, options);
+        data = result;
+        error = null;
+        notify();
+        return result;
+      } catch (err) {
+        error = err instanceof Error ? err : new Error(String(err));
+        notify();
+        throw error;
+      }
+    },
+    clearChunkCache() {
+      chunked?.partCache.clear();
+      error = null;
+      notify();
+    },
+    toCommunityGraph(options) {
+      return aiwgFortemiIndexToCommunityGraph(requireIndex(), options);
+    },
+    setReviewDecision(input) {
+      const decision = {
+        ...input,
+        updated_at: (/* @__PURE__ */ new Date()).toISOString()
+      };
+      reviewDecisions = [
+        ...reviewDecisions.filter((item) => item.item_id !== decision.item_id),
+        decision
+      ].sort((left, right) => left.item_id.localeCompare(right.item_id));
+      error = null;
+      notify();
+      return decision;
+    },
+    clearReviewDecision(itemId) {
+      reviewDecisions = reviewDecisions.filter((item) => item.item_id !== itemId);
+      error = null;
+      notify();
+    },
+    createReviewDecisionExport(generatedAt) {
+      return createAiwgReviewDecisionExport(requireIndex(), reviewDecisions, generatedAt);
+    },
+    subscribe(listener) {
+      listeners.add(listener);
+      return () => {
+        listeners.delete(listener);
+      };
+    }
+  };
+}
 function aiwgFortemiIndexToCommunityGraph(index, options = {}) {
   const ids = new Set(index.items.map((item) => item.id));
   const relationshipWeights = options.relationshipWeights ?? {};
@@ -6754,8 +7353,8 @@ function communityIdsFor(item, options) {
 }
 
 // src/index.ts
-var VERSION = "2026.6.1";
+var VERSION = "2026.6.2";
 
-export { ArchiveManager, AttachmentsRepository, CURRENT_SHARD_VERSION, CapabilityManager, CaptureKnowledgeInputSchema, CollectionsRepository, CommunitiesRepository, EmbeddingSetsRepository, FallbackRouter, FortemiToolManifest, GetNoteInputSchema, GraphRepository, JOB_CAPABILITIES, JOB_PRIORITIES, JobQueueWorker, LOCAL_ENDPOINTS, LinksRepository, ListNotesInputSchema, ManageArchiveInputSchema, ManageAttachmentsInputSchema, ManageCapabilitiesInputSchema, ManageCollectionsInputSchema, ManageLinksInputSchema, ManageNoteInputSchema, ManageTagsInputSchema, MemoryBlobStore, MigrationRunner, NotesRepository, OpenAICompatibleProvider, PGliteStorageBackend, PGliteStorageBackendFactory, PGliteWorkerClient, PGliteWorkerStorageBackend, PGliteWorkerStorageBackendFactory, ProviderRegistry, SHARD_FORMAT, SearchInputSchema, SearchRepository, SkosRepository, TagsRepository, TransactionProxy, TypedEventBus, VERSION, aiRevisionHandler, aiwgFortemiIndexToCommunityGraph, allMigrations, appendPluginScript, assertAiwgFortemiIndexExport, buildNoteConditions, buildPluginCsp, captureKnowledge, chunkText, classifyError, classifyModel, collectionFromShard, collectionToShard, computeHash, computeSri, conceptTaggingHandler, cosineSimilarity, createAiwgReviewDecisionExport, createBlobStore, createCspReportHandler, createFortemi, createLegacyProvider, createPGliteInstance, createRoutes, defaultStorageBackendFactory, detectCommunities, detectGpuCapabilities, detectInferenceCapabilities, discoverLocalProviders, embeddingFromShard, embeddingGenerationHandler, embeddingSetFromShard, embeddingSetMemberToShard, embeddingSetToShard, embeddingToShard, enqueueFullWorkflow, enqueueJob, enqueueNoteCreationJobs, estimateModelFit, estimateVramMB, estimateVramTier, exportShard, fetchPluginScript, fortemiManifest, generateId, getAiwgFortemiFacets, getEmbedFunction, getFortemiBridge, getFortemiSecretStore, getJobQueueStatus, getLlmFunction, getNote, hasFortemiSecureSecrets, importShard, isPluginScriptAllowed, linkFromShard, linkToShard, linkingHandler, listNotes, manageArchive, manageAttachments, manageCapabilities, manageCollections, manageLinks, manageNote, manageTags, matchRoute, noteFromShard, noteSkosTagToShard, noteToShard, packTarGz, parseCspReport, provenanceEdgeToShard, queryAiwgFortemiIndex, registerLlmCapability, registerSemanticCapability, registerServiceWorker, searchTool, selectLlmModel, setEmbedFunction, setLlmFunction, sha256Hex, skosConceptToShard, skosRelationToShard, skosSchemeToShard, suggestTags, tagsFromShard, tagsToShard, titleGenerationHandler, unpackTarGz, unregisterLlmCapability, unregisterSemanticCapability, validateAiwgFortemiIndexExport, validateChecksums, verifySri };
+export { ArchiveManager, AttachmentsRepository, CURRENT_SHARD_VERSION, CapabilityManager, CaptureKnowledgeInputSchema, CollectionsRepository, CommunitiesRepository, EmbeddingSetsRepository, FallbackRouter, FortemiToolManifest, GetNoteInputSchema, GraphRepository, JOB_CAPABILITIES, JOB_PRIORITIES, JobQueueWorker, LOCAL_ENDPOINTS, LinksRepository, ListNotesInputSchema, ManageArchiveInputSchema, ManageAttachmentsInputSchema, ManageCapabilitiesInputSchema, ManageCollectionsInputSchema, ManageLinksInputSchema, ManageNoteInputSchema, ManageTagsInputSchema, MemoryBlobStore, MigrationRunner, NotesRepository, OpenAICompatibleProvider, PGliteStorageBackend, PGliteStorageBackendFactory, PGliteWorkerClient, PGliteWorkerStorageBackend, PGliteWorkerStorageBackendFactory, ProviderRegistry, SHARD_FORMAT, SearchInputSchema, SearchRepository, SkosRepository, TagsRepository, TransactionProxy, TypedEventBus, VERSION, aiRevisionHandler, aiwgFortemiIndexToCommunityGraph, allMigrations, appendPluginScript, assertAiwgFortemiChunkManifest, assertAiwgFortemiChunkPart, assertAiwgFortemiIndexExport, buildNoteConditions, buildPluginCsp, captureKnowledge, chunkText, classifyError, classifyModel, collectionFromShard, collectionToShard, computeHash, computeSri, conceptTaggingHandler, cosineSimilarity, createAiwgFetchChunkLoader, createAiwgIndexController, createAiwgReviewDecisionExport, createBlobStore, createCspReportHandler, createFortemi, createLegacyProvider, createPGliteInstance, createRoutes, defaultStorageBackendFactory, detectCommunities, detectGpuCapabilities, detectInferenceCapabilities, discoverLocalProviders, embeddingFromShard, embeddingGenerationHandler, embeddingSetFromShard, embeddingSetMemberToShard, embeddingSetToShard, embeddingToShard, enqueueFullWorkflow, enqueueJob, enqueueNoteCreationJobs, estimateModelFit, estimateVramMB, estimateVramTier, exportShard, fetchPluginScript, fortemiManifest, generateId, getAiwgFortemiFacets, getEmbedFunction, getFortemiBridge, getFortemiSecretStore, getJobQueueStatus, getLlmFunction, getNote, hasFortemiSecureSecrets, importShard, isPluginScriptAllowed, linkFromShard, linkToShard, linkingHandler, listNotes, manageArchive, manageAttachments, manageCapabilities, manageCollections, manageLinks, manageNote, manageTags, matchRoute, noteFromShard, noteSkosTagToShard, noteToShard, packTarGz, parseCspReport, provenanceEdgeToShard, queryAiwgFortemiIndex, registerLlmCapability, registerSemanticCapability, registerServiceWorker, searchTool, selectLlmModel, setEmbedFunction, setLlmFunction, sha256Hex, skosConceptToShard, skosRelationToShard, skosSchemeToShard, suggestTags, tagsFromShard, tagsToShard, titleGenerationHandler, unpackTarGz, unregisterLlmCapability, unregisterSemanticCapability, validateAiwgFortemiChunkManifest, validateAiwgFortemiChunkPart, validateAiwgFortemiIndexExport, validateChecksums, verifySri };
 //# sourceMappingURL=index.js.map
 //# sourceMappingURL=index.js.map