@inerrata-corporation/errata 2.0.22-dev.4020 → 2.0.22-dev.4049

package/consolidate-worker.mjs

@@ -16508,6 +16508,38 @@ function installHistoryAttrSlim(db) {
   db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(HISTORY_ATTR_SLIM_KEY, "done");
 }
 
+// ../../packages/local-graph/src/text-index.ts
+var TEXT_INDEX_KEY = "text-index-trigram-1";
+var TEXT_INDEX_MIN_TERM = 3;
+function installTextIndex(db) {
+  if (db.prepare("SELECT value FROM store_meta WHERE key = ?").get(TEXT_INDEX_KEY)) return;
+  try {
+    db.exec(`CREATE VIRTUAL TABLE temp.fts5_probe USING fts5(x, tokenize='trigram'); DROP TABLE temp.fts5_probe`);
+  } catch {
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(TEXT_INDEX_KEY, "unavailable");
+    return;
+  }
+  db.transaction(() => {
+    db.exec(`CREATE VIRTUAL TABLE IF NOT EXISTS nodes_text
+      USING fts5(description, content='nodes', content_rowid='rowid', tokenize='trigram')`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_insert AFTER INSERT ON nodes WHEN NEW.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(rowid, description) VALUES (NEW.rowid, NEW.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_update_out AFTER UPDATE OF description, valid_to ON nodes
+      WHEN OLD.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(nodes_text, rowid, description) VALUES ('delete', OLD.rowid, OLD.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_update_in AFTER UPDATE OF description, valid_to ON nodes
+      WHEN NEW.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(rowid, description) VALUES (NEW.rowid, NEW.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_delete AFTER DELETE ON nodes WHEN OLD.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(nodes_text, rowid, description) VALUES ('delete', OLD.rowid, OLD.description); END;`);
+    db.exec(`INSERT INTO nodes_text(rowid, description) SELECT rowid, description FROM nodes WHERE valid_to IS NULL`);
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(TEXT_INDEX_KEY, "installed");
+  });
+}
+function textIndexReady(db) {
+  return db.prepare("SELECT value FROM store_meta WHERE key = ?").get(TEXT_INDEX_KEY)?.["value"] === "installed";
+}
+
 // ../../packages/math/src/constants.ts
 var NEMORI_DEDUP_COSINE = 0.88;
 
@@ -16983,6 +17015,7 @@ var SqliteGraphStore = class {
     installEditPlaceholderRetirement(this.db);
     installCloudAttrCompaction(this.db);
     installHistoryAttrSlim(this.db);
+    installTextIndex(this.db);
     if (!this.db.prepare("SELECT value FROM store_meta WHERE key = ?").get(SESSION_REPAIR_KEY)) {
       this.db.transaction(() => {
         this.repairSessionAliases();
@@ -17637,6 +17670,20 @@ var SqliteGraphStore = class {
   }
   searchTextCandidates(terms) {
     if (terms.length === 0) return [];
+    const indexed = terms.filter((t) => t.length >= TEXT_INDEX_MIN_TERM);
+    if (indexed.length > 0 && textIndexReady(this.db)) {
+      const short = terms.filter((t) => t.length < TEXT_INDEX_MIN_TERM).map((t) => t.toLowerCase());
+      const rows2 = this.db.prepare(`WITH hits AS MATERIALIZED (
+        SELECT t.rowid AS rid, COUNT(*) AS matched FROM json_each(:terms) q, nodes_text t
+        WHERE t.description LIKE '%' || q.value || '%' GROUP BY t.rowid
+      ) SELECT ${TEXT_SEARCH_COLUMNS}, hits.matched FROM hits JOIN nodes ON nodes.rowid = hits.rid
+        WHERE nodes.valid_to IS NULL ORDER BY page_rank DESC, last_updated_at DESC`).all({ terms: JSON.stringify(indexed) });
+      return rows2.map((row) => {
+        const text = row.description.toLowerCase();
+        const extra = short.filter((t) => text.includes(t)).length;
+        return { node: textSearchNode(row), matched: row.matched + extra };
+      });
+    }
     const rows = this.db.prepare(`WITH matches AS MATERIALIZED (
       SELECT n.id, COUNT(*) AS matched FROM nodes n INDEXED BY nodes_live_description, json_each(:terms) t
       WHERE n.valid_to IS NULL AND n.description LIKE '%' || t.value || '%'
@@ -17645,6 +17692,18 @@ var SqliteGraphStore = class {
       JOIN matches USING (id) ORDER BY page_rank DESC, last_updated_at DESC`).all({ terms: JSON.stringify(terms) });
     return rows.map((row) => ({ node: textSearchNode(row), matched: row.matched }));
   }
+  commentAnchors(commentIds) {
+    const out = /* @__PURE__ */ new Map();
+    if (commentIds.length === 0) return out;
+    const rows = this.db.prepare(`WITH a AS MATERIALIZED (
+      SELECT q.value AS cid, COALESCE(
+        (SELECT to_id FROM edges WHERE from_id = q.value AND type IN ('EXPLAINS', 'ANNOTATES') AND valid_to IS NULL LIMIT 1),
+        (SELECT from_id FROM edges WHERE to_id = q.value AND type = 'DOCUMENTED_BY' AND valid_to IS NULL LIMIT 1)
+      ) AS aid FROM json_each(:ids) q
+    ) SELECT a.cid AS cid, ${TEXT_SEARCH_COLUMNS} FROM a JOIN nodes ON nodes.id = a.aid AND nodes.valid_to IS NULL`).all({ ids: JSON.stringify(commentIds) });
+    for (const row of rows) out.set(row.cid, textSearchNode(row));
+    return out;
+  }
   getTextSearchNode(id) {
     const row = this.db.prepare(`SELECT ${TEXT_SEARCH_COLUMNS} FROM nodes WHERE id = ? AND valid_to IS NULL`).get(id);
     return row ? textSearchNode(row) : null;

package/errata.mjs

@@ -18483,6 +18483,44 @@ var init_history_attr_slim = __esm({
   }
 });
 
+// ../../packages/local-graph/src/text-index.ts
+function installTextIndex(db) {
+  if (db.prepare("SELECT value FROM store_meta WHERE key = ?").get(TEXT_INDEX_KEY)) return;
+  try {
+    db.exec(`CREATE VIRTUAL TABLE temp.fts5_probe USING fts5(x, tokenize='trigram'); DROP TABLE temp.fts5_probe`);
+  } catch {
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(TEXT_INDEX_KEY, "unavailable");
+    return;
+  }
+  db.transaction(() => {
+    db.exec(`CREATE VIRTUAL TABLE IF NOT EXISTS nodes_text
+      USING fts5(description, content='nodes', content_rowid='rowid', tokenize='trigram')`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_insert AFTER INSERT ON nodes WHEN NEW.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(rowid, description) VALUES (NEW.rowid, NEW.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_update_out AFTER UPDATE OF description, valid_to ON nodes
+      WHEN OLD.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(nodes_text, rowid, description) VALUES ('delete', OLD.rowid, OLD.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_update_in AFTER UPDATE OF description, valid_to ON nodes
+      WHEN NEW.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(rowid, description) VALUES (NEW.rowid, NEW.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_delete AFTER DELETE ON nodes WHEN OLD.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(nodes_text, rowid, description) VALUES ('delete', OLD.rowid, OLD.description); END;`);
+    db.exec(`INSERT INTO nodes_text(rowid, description) SELECT rowid, description FROM nodes WHERE valid_to IS NULL`);
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(TEXT_INDEX_KEY, "installed");
+  });
+}
+function textIndexReady(db) {
+  return db.prepare("SELECT value FROM store_meta WHERE key = ?").get(TEXT_INDEX_KEY)?.["value"] === "installed";
+}
+var TEXT_INDEX_KEY, TEXT_INDEX_MIN_TERM;
+var init_text_index = __esm({
+  "../../packages/local-graph/src/text-index.ts"() {
+    "use strict";
+    TEXT_INDEX_KEY = "text-index-trigram-1";
+    TEXT_INDEX_MIN_TERM = 3;
+  }
+});
+
 // ../../packages/math/src/constants.ts
 var SURPRISE_MOMENTUM, SURPRISE_LEARNING_RATE, SURPRISE_LEARNING_RATE_SCALING, TIER_HALFLIFE_MULTIPLIER, HIT_RATE_SCALING_ALPHA, BASE_HALF_LIFE_SEQ, MOMENTUM_GATE_FLOOR, SURPRISE_RECENCY_LAMBDA_SEQ, NEMORI_SOFT_WRITE_MIN_COSINE, NEMORI_SOFT_WRITE_MAX_COSINE, NEMORI_DEDUP_COSINE, NEMORI_SOFT_ALPHA_MIN, NEMORI_SOFT_ALPHA_MAX, NEMORI_HIGH_SURPRISE_THRESHOLD, NEMORI_PREDICTION_FLOOR, REVIEW_SURPRISE_THRESHOLD, REVIEW_HITS_THRESHOLD;
 var init_constants = __esm({
@@ -19426,7 +19464,7 @@ function graphStoreNeedsPreparation(path2) {
     for (const match2 of (SCHEMA_SQL + TEMPORAL_INDEX_SQL).matchAll(/CREATE INDEX IF NOT EXISTS (\w+)/g)) {
       if (!indexes.has(match2[1])) return true;
     }
-    return [SESSION_REPAIR_KEY, HISTORY_CACHE_FLOOR_KEY, EDIT_PLACEHOLDER_FLOOR_KEY, CLOUD_ATTR_COMPACTION_KEY, HISTORY_ATTR_SLIM_KEY].some((key) => !db.prepare("SELECT value FROM store_meta WHERE key = ?").get(key));
+    return [SESSION_REPAIR_KEY, HISTORY_CACHE_FLOOR_KEY, EDIT_PLACEHOLDER_FLOOR_KEY, CLOUD_ATTR_COMPACTION_KEY, HISTORY_ATTR_SLIM_KEY, TEXT_INDEX_KEY].some((key) => !db.prepare("SELECT value FROM store_meta WHERE key = ?").get(key));
   } catch {
     return true;
   } finally {
@@ -19504,6 +19542,7 @@ var init_store = __esm({
     init_edit_placeholder_retirement();
     init_cloud_attr_compaction();
     init_history_attr_slim();
+    init_text_index();
     init_src3();
     PAGE_RANK_SCALE_KEY = "pageRankScale.p95.v1";
     TEXT_SEARCH_COLUMNS = `id, label, description, page_rank,
@@ -19716,6 +19755,7 @@ CREATE INDEX IF NOT EXISTS nodes_enrichment_pending ON nodes(json_extract(attrs_
         installEditPlaceholderRetirement(this.db);
         installCloudAttrCompaction(this.db);
         installHistoryAttrSlim(this.db);
+        installTextIndex(this.db);
         if (!this.db.prepare("SELECT value FROM store_meta WHERE key = ?").get(SESSION_REPAIR_KEY)) {
           this.db.transaction(() => {
             this.repairSessionAliases();
@@ -20370,6 +20410,20 @@ CREATE INDEX IF NOT EXISTS nodes_enrichment_pending ON nodes(json_extract(attrs_
       }
       searchTextCandidates(terms) {
         if (terms.length === 0) return [];
+        const indexed = terms.filter((t) => t.length >= TEXT_INDEX_MIN_TERM);
+        if (indexed.length > 0 && textIndexReady(this.db)) {
+          const short = terms.filter((t) => t.length < TEXT_INDEX_MIN_TERM).map((t) => t.toLowerCase());
+          const rows2 = this.db.prepare(`WITH hits AS MATERIALIZED (
+        SELECT t.rowid AS rid, COUNT(*) AS matched FROM json_each(:terms) q, nodes_text t
+        WHERE t.description LIKE '%' || q.value || '%' GROUP BY t.rowid
+      ) SELECT ${TEXT_SEARCH_COLUMNS}, hits.matched FROM hits JOIN nodes ON nodes.rowid = hits.rid
+        WHERE nodes.valid_to IS NULL ORDER BY page_rank DESC, last_updated_at DESC`).all({ terms: JSON.stringify(indexed) });
+          return rows2.map((row) => {
+            const text = row.description.toLowerCase();
+            const extra = short.filter((t) => text.includes(t)).length;
+            return { node: textSearchNode(row), matched: row.matched + extra };
+          });
+        }
         const rows = this.db.prepare(`WITH matches AS MATERIALIZED (
       SELECT n.id, COUNT(*) AS matched FROM nodes n INDEXED BY nodes_live_description, json_each(:terms) t
       WHERE n.valid_to IS NULL AND n.description LIKE '%' || t.value || '%'
@@ -20378,6 +20432,18 @@ CREATE INDEX IF NOT EXISTS nodes_enrichment_pending ON nodes(json_extract(attrs_
       JOIN matches USING (id) ORDER BY page_rank DESC, last_updated_at DESC`).all({ terms: JSON.stringify(terms) });
         return rows.map((row) => ({ node: textSearchNode(row), matched: row.matched }));
       }
+      commentAnchors(commentIds) {
+        const out2 = /* @__PURE__ */ new Map();
+        if (commentIds.length === 0) return out2;
+        const rows = this.db.prepare(`WITH a AS MATERIALIZED (
+      SELECT q.value AS cid, COALESCE(
+        (SELECT to_id FROM edges WHERE from_id = q.value AND type IN ('EXPLAINS', 'ANNOTATES') AND valid_to IS NULL LIMIT 1),
+        (SELECT from_id FROM edges WHERE to_id = q.value AND type = 'DOCUMENTED_BY' AND valid_to IS NULL LIMIT 1)
+      ) AS aid FROM json_each(:ids) q
+    ) SELECT a.cid AS cid, ${TEXT_SEARCH_COLUMNS} FROM a JOIN nodes ON nodes.id = a.aid AND nodes.valid_to IS NULL`).all({ ids: JSON.stringify(commentIds) });
+        for (const row of rows) out2.set(row.cid, textSearchNode(row));
+        return out2;
+      }
       getTextSearchNode(id) {
         const row = this.db.prepare(`SELECT ${TEXT_SEARCH_COLUMNS} FROM nodes WHERE id = ? AND valid_to IS NULL`).get(id);
         return row ? textSearchNode(row) : null;
@@ -32983,42 +33049,77 @@ function burstStaticConductance(type, seedLabel) {
 function burstConductance(edge2, seedLabel) {
   return learnedConductance(burstStaticConductance(edge2.type, seedLabel), edge2);
 }
-function localBurst(store, seedId, opts = {}) {
-  const maxHops = opts.maxHops ?? 3;
-  const limit = opts.limit ?? 20;
-  const nodeCap = opts.nodeCap ?? 200;
-  const seed = store.getNode(seedId);
-  if (!seed) return [];
-  const act = /* @__PURE__ */ new Map([[seedId, 1]]);
-  const hopOf = /* @__PURE__ */ new Map([[seedId, 0]]);
+function spreadActivation(store, seeds, opts) {
+  const act = /* @__PURE__ */ new Map();
+  const hopOf = /* @__PURE__ */ new Map();
   const viaOf = /* @__PURE__ */ new Map();
+  const originLabel = /* @__PURE__ */ new Map();
+  const bestArrival = /* @__PURE__ */ new Map();
+  const seedIds = new Set(seeds.map((s) => s.id));
   const expanded = /* @__PURE__ */ new Set();
   const frontier = new ActivationHeap();
-  frontier.push(seedId, 1);
+  for (const s of seeds) {
+    act.set(s.id, (act.get(s.id) ?? 0) + s.weight);
+    hopOf.set(s.id, 0);
+    if (!originLabel.has(s.id)) originLabel.set(s.id, s.label);
+  }
+  for (const s of seeds) frontier.push(s.id, act.get(s.id));
   let strongest = 0;
-  while (frontier.size > 0 && expanded.size < nodeCap) {
+  while (frontier.size > 0 && expanded.size < opts.nodeCap) {
     const top = frontier.pop();
     if (expanded.has(top.id) || top.a < (act.get(top.id) ?? 0)) continue;
     if (top.a < ACTIVATION_EPSILON || top.a < strongest * BURST_RELATIVE_FLOOR) break;
     expanded.add(top.id);
     const hops = hopOf.get(top.id) ?? 0;
-    if (hops >= maxHops) continue;
+    if (hops >= opts.maxHops) continue;
+    const label = originLabel.get(top.id) ?? "";
     const edges = [
       ...store.outEdges(top.id).map((e) => ({ e, nb: e.to, forward: true })),
       ...store.inEdges(top.id).map((e) => ({ e, nb: e.from, forward: false }))
     ].filter(({ e }) => walksRelatedness(e.type));
     const damp = BURST_STEP_DAMPING / Math.sqrt(Math.max(1, edges.length));
     for (const { e, nb, forward } of edges) {
-      if (nb === seedId || expanded.has(nb)) continue;
-      const a = top.a * burstConductance(e, seed.label) * damp;
+      if (nb === top.id) continue;
+      const a = top.a * burstConductance(e, label) * damp;
+      if (opts.accumulate) {
+        if (a < ACTIVATION_EPSILON) continue;
+        const total = (act.get(nb) ?? 0) + a;
+        act.set(nb, total);
+        if (a > (bestArrival.get(nb) ?? 0)) {
+          bestArrival.set(nb, a);
+          if (!seedIds.has(nb)) {
+            hopOf.set(nb, hops + 1);
+            viaOf.set(nb, { edgeType: e.type, parentId: top.id, forward });
+            originLabel.set(nb, label);
+          }
+        }
+        if (!seedIds.has(nb) && total > strongest) strongest = total;
+        if (!expanded.has(nb)) frontier.push(nb, total);
+        continue;
+      }
+      if (seedIds.has(nb) || expanded.has(nb)) continue;
       if (a <= (act.get(nb) ?? 0)) continue;
       act.set(nb, a);
       if (a > strongest) strongest = a;
       hopOf.set(nb, hops + 1);
       viaOf.set(nb, { edgeType: e.type, parentId: top.id, forward });
+      originLabel.set(nb, label);
       frontier.push(nb, a);
     }
   }
+  return { act, hopOf, viaOf };
+}
+function localBurst(store, seedId, opts = {}) {
+  const maxHops = opts.maxHops ?? 3;
+  const limit = opts.limit ?? 20;
+  const nodeCap = opts.nodeCap ?? 200;
+  const seed = store.getNode(seedId);
+  if (!seed) return [];
+  const { act, hopOf, viaOf } = spreadActivation(store, [{ id: seedId, weight: 1, label: seed.label }], {
+    maxHops,
+    nodeCap,
+    accumulate: false
+  });
   act.delete(seedId);
   const ctxSeed = seed.embedding.length > 0 ? { seedEmbedding: seed.embedding, seedEmbeddingVersion: seed.attrs["embeddingVersion"] } : {};
   const gated = seed.embedding.length > 0;
@@ -33040,6 +33141,32 @@ function localBurst(store, seedId, opts = {}) {
     return { id: node2.id, score: score2, components: r.components, node: node2, hops: hopOf.get(node2.id) ?? 0, ...via ? { via } : {} };
   }).filter((r) => !gated || r.score > 0).sort((a, b) => b.score - a.score).slice(0, limit);
 }
+function burstFromSeeds(store, seeds, opts = {}) {
+  const live3 = seeds.filter((s) => s.weight > 0);
+  if (live3.length === 0) return [];
+  const { act, hopOf, viaOf } = spreadActivation(store, live3, {
+    maxHops: opts.maxHops ?? 3,
+    nodeCap: opts.nodeCap ?? 300,
+    accumulate: true
+  });
+  const seedIds = new Set(live3.map((s) => s.id));
+  const labelOf = store.nodeLabels([...act.keys()]);
+  const pool = (keep) => [...act.entries()].filter(([id]) => keep(labelOf.get(id) ?? "")).sort((x, y) => y[1] - x[1]).slice(0, BURST_SCORED_CANDIDATES);
+  const isKnowledge = (label) => typeRelevance(label) >= KNOWLEDGE_TYPE_RELEVANCE;
+  const reached = [...new Map([...pool(isKnowledge), ...pool((l) => !isKnowledge(l))]).entries()].map(([id, a]) => ({ node: store.getNode(id), a })).filter((x) => x.node != null);
+  const maxAct = Math.max(1e-12, ...reached.map((x) => x.a));
+  const weights = { centralityScale: store.pageRankScale?.() ?? 1, ...opts.weights };
+  const now = store.currentIngestSeq();
+  const typed = opts.typeRelevanceForSeeds ?? true;
+  const hubDamp = (id) => seedIds.has(id) ? 1 : 1 / Math.sqrt(Math.max(1, store.outEdges(id).length + store.inEdges(id).length));
+  return reached.map(({ node: node2, a }) => {
+    const r = scoreCandidate(node2, { decay: nodeFreshness(node2, now) }, weights);
+    const type = typed || !seedIds.has(node2.id) ? typeRelevance(node2.label) : 1;
+    const score2 = a / maxAct * r.score * type * hubDamp(node2.id);
+    const via = viaOf.get(node2.id);
+    return { id: node2.id, score: score2, components: r.components, node: node2, hops: hopOf.get(node2.id) ?? 0, ...via ? { via } : {} };
+  }).sort((a, b) => b.score - a.score).slice(0, opts.limit ?? 20);
+}
 var BURST_STEP_DAMPING, ACTIVATION_EPSILON, BURST_RELATIVE_FLOOR, BURST_SCORED_CANDIDATES, KNOWLEDGE_TYPE_RELEVANCE, BURST_ANCHORED_AT_CONDUCTANCE, BURST_DEPENDS_ON_FLOOR, ActivationHeap;
 var init_relevance_rank = __esm({
   "../../packages/generalizer/src/relevance-rank.ts"() {
@@ -33165,6 +33292,7 @@ __export(src_exports3, {
   bindCanonicalNeighbors: () => bindCanonicalNeighbors,
   bindResolvedRegressions: () => bindResolvedRegressions,
   burstConductance: () => burstConductance,
+  burstFromSeeds: () => burstFromSeeds,
   burstStaticConductance: () => burstStaticConductance,
   closeProblem: () => closeProblem,
   commandSignature: () => commandSignature,
@@ -35652,8 +35780,28 @@ function mergeDualBurst(local, cloud, opts = {}) {
     if (parent === n.id) delete n.via;
     else if (parent !== n.via.parentId) n.via = { ...n.via, parentId: parent };
   }
+  if (opts.fuse === "rank") fuseByRank();
   nodes.sort((a, b) => b.score - a.score);
   return { nodes, collectiveCount, corroboratedCount };
+  function fuseByRank() {
+    const localRank = /* @__PURE__ */ new Map();
+    local.filter((l) => !isSeedTwin(l.id)).forEach((l, i2) => {
+      const n = byId.get(l.id) ?? byId.get(recordedBy.get(l.id) ?? "");
+      if (n && !localRank.has(n.id)) localRank.set(n.id, i2);
+    });
+    const cloudRank = /* @__PURE__ */ new Map();
+    cloud.forEach((c, i2) => {
+      if (isSeedTwin(c.id)) return;
+      const mine = twins?.localOf(c.id);
+      const n = owner.get(c.id) ?? byId.get(c.id) ?? (mine ? byId.get(mine.id) : void 0);
+      if (n && !cloudRank.has(n.id)) cloudRank.set(n.id, i2);
+    });
+    for (const n of nodes) {
+      const lr = localRank.get(n.id);
+      const cr = cloudRank.get(n.id);
+      n.score = (lr === void 0 ? 0 : 1 / (SEARCH_FUSE_K + lr + 1)) + (cr === void 0 ? 0 : SEARCH_FUSE_NETWORK_WEIGHT / (SEARCH_FUSE_K + cr + 1));
+    }
+  }
   function canonicalId(id) {
     if (opts.seedId && isSeedTwin(id)) return opts.seedId;
     return owner.get(id)?.id ?? recordedBy.get(id) ?? twins?.localOf(id)?.id ?? id;
@@ -35735,11 +35883,13 @@ function searchResultToCloudHits(result) {
     };
   });
 }
-var DUAL_BURST_SEMANTIC_NEUTRAL;
+var DUAL_BURST_SEMANTIC_NEUTRAL, SEARCH_FUSE_K, SEARCH_FUSE_NETWORK_WEIGHT;
 var init_dual_burst = __esm({
   "src/dual-burst.ts"() {
     "use strict";
     DUAL_BURST_SEMANTIC_NEUTRAL = 0.3;
+    SEARCH_FUSE_K = 10;
+    SEARCH_FUSE_NETWORK_WEIGHT = 0.7;
   }
 });
 
@@ -35874,7 +36024,8 @@ async function dualAugment(opts) {
         const parent = c.via?.parentId;
         return parent ? [c.id, parent] : [c.id];
       })),
-      ...seedNode ? { seedId: seedNode.id } : {}
+      ...seedNode ? { seedId: seedNode.id } : {},
+      ...opts.fuse ? { fuse: opts.fuse } : {}
     }),
     seedProvenance,
     seedUsageCount
@@ -45027,10 +45178,17 @@ __export(mcp_exports, {
   INSTRUCTIONS: () => INSTRUCTIONS,
   RG_REFUTED_DAMP: () => RG_REFUTED_DAMP,
   RG_SUSPECT_BOOST: () => RG_SUSPECT_BOOST,
+  SEARCH_CODE_SEEDS: () => SEARCH_CODE_SEEDS,
+  SEARCH_KNOWLEDGE_SEEDS: () => SEARCH_KNOWLEDGE_SEEDS,
   createMcpHandler: () => createMcpHandler,
   runMcpServer: () => runMcpServer,
   runTool: () => runTool,
-  searchGraph: () => searchGraph
+  searchEntries: () => searchEntries,
+  searchGraph: () => searchGraph,
+  searchGraphWalk: () => searchGraphWalk,
+  searchWalkEnabled: () => searchWalkEnabled,
+  textMatches: () => textMatches,
+  withLinks: () => withLinks
 });
 import { existsSync as existsSync17, readFileSync as readFileSync16 } from "node:fs";
 import { resolve as resolve4 } from "node:path";
@@ -45152,49 +45310,166 @@ function localCommunityOf(node2) {
   return typeof cid === "string" ? cid : null;
 }
 function searchGraph(store, query, limit) {
+  if (!Number.isFinite(limit) || limit < 1) return [];
+  return textMatches(store, query).slice(0, limit).map((m) => toSearchHit(m.node, m.via, m.rg));
+}
+function toSearchHit(node2, via, rg) {
+  return {
+    id: node2.id,
+    label: node2.label,
+    description: node2.description,
+    pageRank: node2.pageRank,
+    ...via ? { via } : {},
+    ...rg.state ? { state: rg.state } : {},
+    ...rg.refutedWhy ? { refutedWhy: rg.refutedWhy } : {}
+  };
+}
+function textMatches(store, query) {
   const q = query.trim();
-  if (!q || !Number.isFinite(limit) || limit < 1) return [];
+  if (!q) return [];
   const terms = q.split(/\s+/).filter((t) => t.length >= 2);
   const raw2 = /* @__PURE__ */ new Map();
   const searchTerms = terms.length <= 1 ? [q] : terms;
   const scored = store.searchTextCandidates ? store.searchTextCandidates(searchTerms) : store.searchDescriptionTerms(searchTerms, Number.MAX_SAFE_INTEGER);
   for (const hit of scored) raw2.set(hit.node.id, hit);
+  const lowered = searchTerms.map((t) => t.toLowerCase());
+  const hasTerm = /* @__PURE__ */ new Map();
+  const df = lowered.map(() => 0);
+  for (const { node: node2 } of raw2.values()) {
+    const text = node2.description.toLowerCase();
+    const has = lowered.map((t) => text.includes(t));
+    has.forEach((h, i2) => {
+      if (h) df[i2] += 1;
+    });
+    hasTerm.set(node2.id, has);
+  }
+  const idf = df.map((d) => Math.log(1 + raw2.size / (1 + d)));
+  const idfTotal = idf.reduce((a, b) => a + b, 0) || 1;
+  const coverageOf = (id) => {
+    const has = hasTerm.get(id);
+    return has ? has.reduce((a, h, i2) => a + (h ? idf[i2] : 0), 0) / idfTotal : 0;
+  };
   const merged = /* @__PURE__ */ new Map();
-  const add = (node2, matched, via) => {
+  const add = (node2, matched, coverage, via) => {
     const e = merged.get(node2.id);
     if (e) {
       e.matched = Math.max(e.matched, matched);
+      e.coverage = Math.max(e.coverage, coverage);
       if (!e.via && via) e.via = via;
     } else {
-      merged.set(node2.id, { node: node2, matched, via });
+      merged.set(node2.id, { node: node2, matched, coverage, via });
     }
   };
   const anchors = /* @__PURE__ */ new Map();
+  const batched = store.commentAnchors?.(
+    [...raw2.values()].filter((h) => h.node.label === "Comment").map((h) => h.node.id)
+  );
   for (const { node: node2, matched } of raw2.values()) {
     if (node2.label === "Comment") {
-      const anchorId = commentAnchorId(store, node2.id);
-      if (anchorId && !anchors.has(anchorId)) {
-        anchors.set(anchorId, store.getTextSearchNode ? store.getTextSearchNode(anchorId) : store.getNode(anchorId));
+      let anchor;
+      if (batched) {
+        anchor = batched.get(node2.id) ?? null;
+      } else {
+        const anchorId = commentAnchorId(store, node2.id);
+        if (anchorId && !anchors.has(anchorId)) {
+          anchors.set(anchorId, store.getTextSearchNode ? store.getTextSearchNode(anchorId) : store.getNode(anchorId));
+        }
+        anchor = anchorId ? anchors.get(anchorId) : null;
       }
-      const anchor = anchorId ? anchors.get(anchorId) : null;
       if (anchor) {
-        add(anchor, matched, { kind: "comment", text: node2.description });
+        add(anchor, matched, coverageOf(node2.id), { kind: "comment", text: node2.description });
         continue;
       }
     }
-    add(node2, matched);
+    add(node2, matched, coverageOf(node2.id));
   }
   return [...merged.values()].map((e) => ({ ...e, rg: hitState(e.node) })).sort(
     (a, b) => rankTier(a.node) - rankTier(b.node) || b.matched - a.matched || b.node.pageRank * b.rg.factor - a.node.pageRank * a.rg.factor
-  ).slice(0, limit).map(({ node: node2, via, rg }) => ({
-    id: node2.id,
-    label: node2.label,
-    description: node2.description,
-    pageRank: node2.pageRank,
-    ...via ? { via } : {},
-    ...rg.state ? { state: rg.state } : {},
-    ...rg.refutedWhy ? { refutedWhy: rg.refutedWhy } : {}
-  }));
+  ).map(({ node: node2, via, rg, coverage, matched }) => ({ node: node2, via, rg, coverage, matched }));
+}
+function isIdentifierToken(t) {
+  return t.length >= 4 && IDENTIFIER_TOKEN.test(t) && (/[a-z][A-Z]/.test(t) || /_/.test(t) || t.includes("."));
+}
+function symbolName(description) {
+  return description.split(/[\s—(]/, 1)[0] ?? "";
+}
+function withLinks(store, hits) {
+  const idOf = (h) => String(h.id ?? "");
+  const ids = new Set(hits.map(idOf));
+  return hits.map((h) => {
+    const id = idOf(h);
+    const links = store.outEdges(id).filter((e) => e.to !== id && ids.has(e.to)).map((e) => ({ edgeType: e.type, to: e.to }));
+    return links.length > 0 ? { ...h, links } : h;
+  });
+}
+function searchEntries(query, matches) {
+  const words = query.trim().split(/\s+/).filter(Boolean);
+  const idents = new Set(words.filter(isIdentifierToken));
+  const phrases = [];
+  for (let i2 = 0; i2 + PHRASE_WORDS <= words.length; i2++) {
+    phrases.push(words.slice(i2, i2 + PHRASE_WORDS).join(" ").toLowerCase());
+  }
+  const seeds = /* @__PURE__ */ new Map();
+  const put = (m, weight) => {
+    const w = weight * m.rg.factor;
+    const prev = seeds.get(m.node.id);
+    if (!prev || prev.weight < w) seeds.set(m.node.id, { id: m.node.id, label: m.node.label, weight: w });
+  };
+  for (const m of matches) {
+    if (idents.size === 0) break;
+    const name2 = symbolName(m.node.description);
+    const last = name2.slice(name2.lastIndexOf(".") + 1);
+    if (idents.has(name2) || idents.has(last)) put(m, m.coverage * m.coverage * (SEED_TIER_WEIGHT[rankTier(m.node)] ?? 1));
+  }
+  const knowledge = matches.filter((m) => KNOWLEDGE_LABELS.has(m.node.label)).map((m) => {
+    const text = m.node.description.toLowerCase();
+    return { m, w: phrases.some((ph) => text.includes(ph)) ? 1 : m.coverage * m.coverage };
+  }).filter(({ m, w }) => w === 1 || (words.length < 2 || m.matched >= 2) && m.coverage >= DEFAULT_MIN_COVERAGE).sort((a, b) => b.w - a.w).slice(0, SEARCH_KNOWLEDGE_SEEDS);
+  for (const { m, w } of knowledge) put(m, w);
+  const code = matches.filter((m) => !KNOWLEDGE_LABELS.has(m.node.label)).map((m) => ({ m, w: m.coverage * m.coverage * (SEED_TIER_WEIGHT[rankTier(m.node)] ?? 1) })).sort((a, b) => b.w - a.w).slice(0, SEARCH_CODE_SEEDS);
+  for (const { m, w } of code) put(m, w);
+  return [...seeds.values()].filter((sd) => sd.weight > 0);
+}
+function withoutSymbolInternals(store, ranked) {
+  const ids = new Set(ranked.map((r) => r.id));
+  const internal = /* @__PURE__ */ new Set();
+  for (const r of ranked) {
+    for (const e of store.inEdges(r.id, ["DEFINES"])) {
+      if (!ids.has(e.from)) continue;
+      const parent = store.getNode(e.from);
+      if (parent && SYMBOL_PARENT_LABELS.has(parent.label)) internal.add(r.id);
+    }
+  }
+  return internal.size > 0 ? ranked.filter((r) => !internal.has(r.id)) : ranked;
+}
+function searchWalkEnabled(env2 = process.env) {
+  return !/^(0|off|false|no)$/i.test((env2["ERRATA_SEARCH_WALK"] ?? "").trim());
+}
+function searchGraphWalk(store, query, limit) {
+  if (!Number.isFinite(limit) || limit < 1) return [];
+  const matches = textMatches(store, query);
+  if (matches.length === 0) return [];
+  const byId = new Map(matches.map((m) => [m.node.id, m]));
+  const walked = withoutSymbolInternals(
+    store,
+    burstFromSeeds(store, searchEntries(query, matches), { limit: limit * 4, typeRelevanceForSeeds: false })
+  );
+  const lanes = [walked.filter((r) => KNOWLEDGE_LABELS.has(r.node.label)), walked.filter((r) => !KNOWLEDGE_LABELS.has(r.node.label))];
+  const ranked = [];
+  for (let i2 = 0; ranked.length < limit && i2 < walked.length; i2++) {
+    for (const lane of lanes) if (lane[i2] && ranked.length < limit) ranked.push(lane[i2]);
+  }
+  return ranked.map((r) => {
+    const m = byId.get(r.id);
+    if (m) return { ...toSearchHit(m.node, m.via, m.rg), score: r.score, matched: true };
+    const rg = hitState(r.node);
+    return {
+      ...toSearchHit(r.node, void 0, rg),
+      score: r.score,
+      matched: false,
+      ...r.via ? { reachedVia: { edgeType: r.via.edgeType, from: r.via.parentId } } : {}
+    };
+  });
 }
 function runTool(name2, args2, store, ctx = {}) {
   const tool = TOOLS.find((t) => t.name === name2);
@@ -45530,7 +45805,7 @@ async function runMcpServer(workspaceRoot, options = {}) {
     if (resp) process.stdout.write(JSON.stringify(resp) + "\n");
   }
 }
-var INSTRUCTIONS, AUDIT_RUN_THRESHOLD, AUDIT_NUDGE_COOLDOWN, DISCRIMINATOR_NUDGE_COOLDOWN, AUDIT_FLAG_NUDGE, RG_REFUTED_DAMP, RG_SUSPECT_BOOST, TOOLS;
+var INSTRUCTIONS, AUDIT_RUN_THRESHOLD, AUDIT_NUDGE_COOLDOWN, DISCRIMINATOR_NUDGE_COOLDOWN, AUDIT_FLAG_NUDGE, RG_REFUTED_DAMP, RG_SUSPECT_BOOST, SEARCH_KNOWLEDGE_SEEDS, SEARCH_CODE_SEEDS, PHRASE_WORDS, KNOWLEDGE_LABELS, IDENTIFIER_TOKEN, SYMBOL_PARENT_LABELS, SEED_TIER_WEIGHT, TOOLS;
 var init_mcp = __esm({
   "src/mcp.ts"() {
     "use strict";
@@ -45563,6 +45838,13 @@ var init_mcp = __esm({
     AUDIT_FLAG_NUDGE = "\u26A1 errata \u2014 reading/auditing? anything you notice that's off, flag it inline as `[!one line]` (`[?\u2026]` = TODO) \u2014 no tool call, we harvest it.";
     RG_REFUTED_DAMP = 0.75;
     RG_SUSPECT_BOOST = 1.25;
+    SEARCH_KNOWLEDGE_SEEDS = 30;
+    SEARCH_CODE_SEEDS = 15;
+    PHRASE_WORDS = 3;
+    KNOWLEDGE_LABELS = new Set(SEMANTIC_NODE_LABELS);
+    IDENTIFIER_TOKEN = /^(?:[A-Za-z_$][\w$]*\.)*[A-Za-z_$][\w$]*$/;
+    SYMBOL_PARENT_LABELS = /* @__PURE__ */ new Set(["Function", "Method", "Class", "Interface"]);
+    SEED_TIER_WEIGHT = [1, 0.4, 0.4];
     TOOLS = [
       {
         name: "errata.switch_context",
@@ -45601,7 +45883,7 @@ var init_mcp = __esm({
       },
       {
         name: "errata.search",
-        description: "Find a symbol, string, or comment across the live code graph \u2014 reaches matches by structure, not just text. Multi-word queries are tokenized and OR'd (more terms matched ranks higher, then pageRank), so word order and punctuation don't matter. Returns up to `limit` hits with id, label, description, and pageRank (higher pageRank = more central \u2014 start there). A comment that documents a symbol resolves to that SYMBOL (the comment rides along as `via` \u2014 it's the why, not the destination); test scaffolding and floating comments sort below production code. When the collective is reachable, results BLEND cross-project knowledge, each tagged `provenance` (local | collective | corroborated) with `usageCount`.",
+        description: "Find a symbol, string, comment, or the knowledge around them, as a GRAPH search. The query's words pick entry points \u2014 a symbol an identifier names, knowledge carrying the query's words (a literal phrase counts most), the strongest code matches \u2014 and one walk from all of them ranks what sits at their centre, so a Problem anchored on the function you named surfaces without repeating your words. Knowledge and code alternate down the list. Each hit carries `matched` (true = the text matched; false = the walk reached it, with `reachedVia` {edgeType, from}), `score`, and `links` \u2014 its edges to the OTHER hits in this answer, so a Problem \u2014CAUSED_BY\u2192 RootCause or a fix \u2014ANCHORED_AT\u2192 the function reads as a chain. Word order and punctuation don't matter. A comment that documents a symbol resolves to that SYMBOL (the comment rides along as `via` \u2014 it's the why, not the destination); test scaffolding and floating comments sort below production code. When the collective is reachable, results BLEND cross-project knowledge, each tagged `provenance` (local | collective | corroborated) with `usageCount`.",
         inputSchema: {
           type: "object",
           properties: {
@@ -45613,13 +45895,16 @@ var init_mcp = __esm({
         handler: async (args2, store, ctx) => {
           const query = String(args2["query"] ?? "");
           const limit = Math.max(1, Math.min(100, Number(args2["limit"] ?? 20)));
-          const hits = searchGraph(store, query, limit);
+          const hits = withLinks(
+            store,
+            searchWalkEnabled() ? searchGraphWalk(store, query, limit) : searchGraph(store, query, limit).map((h) => ({ ...h, score: h.pageRank, matched: true }))
+          );
           if (ctx.cloud && query.trim()) {
             const localHits = hits.map((h) => ({
               id: h.id,
               node: { label: h.label, description: h.description },
-              score: h.pageRank,
-              hops: 0
+              score: h.score,
+              hops: h.matched ? 0 : 1
             }));
             const dual = await dualAugment({
               store,
@@ -45627,7 +45912,8 @@ var init_mcp = __esm({
               ...ctx.generalizeSoft ? { generalizeSoft: ctx.generalizeSoft } : {},
               localHits,
               queryText: query,
-              limit
+              limit,
+              fuse: "rank"
             });
             if (dual.status === "merged") {
               return {
@@ -45637,7 +45923,7 @@ var init_mcp = __esm({
                 count: dual.merged.nodes.length,
                 corroborated: dual.merged.corroboratedCount,
                 collective: dual.merged.collectiveCount,
-                results: formatDualNodes(dual.merged)
+                results: withLinks(store, formatDualNodes(dual.merged))
               };
             }
             return {
@@ -77688,9 +77974,38 @@ function createSubagentState() {
 // src/subagent-context.ts
 init_src6();
 init_src8();
-init_src5();
 init_src2();
 init_recall_signal();
+
+// src/intent-walk.ts
+init_src8();
+init_src5();
+var INTENT_WALK_SEEDS = 30;
+var RECALLABLE2 = /* @__PURE__ */ new Set(["Problem", "Solution", "RootCause", "Pattern"]);
+function walkIntent(store, intent, opts) {
+  const entries = searchByIntent(store, intent, { limit: INTENT_WALK_SEEDS });
+  if (entries.length === 0) return [];
+  const out2 = entries.slice(0, opts.limit);
+  if (out2.length >= opts.limit) return out2;
+  const shown = new Set(out2.map((h) => h.node.id));
+  const seedIds = new Set(entries.map((h) => h.node.id));
+  const ranked = burstFromSeeds(
+    store,
+    entries.map((h) => ({ id: h.node.id, label: h.node.label, weight: h.coverage * h.coverage })),
+    { limit: opts.limit * 10, typeRelevanceForSeeds: false }
+  );
+  for (const r of ranked) {
+    if (out2.length >= opts.limit) break;
+    if (shown.has(r.id) || seedIds.has(r.id)) continue;
+    const n = r.node;
+    if (!RECALLABLE2.has(n.label) || n.attrs["mergedInto"] !== void 0) continue;
+    if (n.label === "Problem" && n.attrs["resolvedAt"] != null && !isConstraintProblem(n)) continue;
+    out2.push({ node: n, coverage: 0, matched: [] });
+  }
+  return out2;
+}
+
+// src/subagent-context.ts
 var MAX_SHARED_PRIORS = 8;
 var INTENT_HITS = 4;
 function resolveSharedPriors(store, wanted, handleMap, remote) {
@@ -77713,7 +78028,7 @@ function renderSubagentBlock(args2) {
     const slice = sliceForFile(store, entry.workingFile, args2.atCommit);
     if (slice) snapshot.workingFile = slice;
   }
-  const hits = entry.intent ? searchByIntent(store, entry.intent, { limit: INTENT_HITS }).map((h) => ({
+  const hits = entry.intent ? walkIntent(store, entry.intent, { limit: INTENT_HITS }).map((h) => ({
     id: h.node.id,
     label: h.node.label,
     description: h.node.description,
@@ -84076,7 +84391,7 @@ function createWatchBreaker(deps) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.22-dev.4020" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.22-dev.4049" : "2.0.0-alpha.0";
 var IGNORED_PATH = /[\\/](?:\.git|node_modules|\.errata|\.claude|\.codex|\.cursor|\.turbo|\.next|dist|coverage|test-results|playwright-report|__pycache__)(?:[\\/]|$)/;
 var IGNORED_NOISE = /castalia\.db|eventlog\.sqlite|turn-cursors/;
 var GIT_OP_MUTE_MS = 4e3;
@@ -84546,7 +84861,7 @@ function createWorkspaceEngine(opts) {
     const collective = intentRemote?.forIntent === intent ? intentRemote : null;
     return {
       text: intent,
-      hits: searchByIntent(store, intent, { limit: 4 }).map((h) => ({
+      hits: walkIntent(store, intent, { limit: 4 }).map((h) => ({
         id: h.node.id,
         label: h.node.label,
         description: h.node.description,

package/generalize-worker.mjs

@@ -15093,6 +15093,38 @@ function installHistoryAttrSlim(db) {
   db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(HISTORY_ATTR_SLIM_KEY, "done");
 }
 
+// ../../packages/local-graph/src/text-index.ts
+var TEXT_INDEX_KEY = "text-index-trigram-1";
+var TEXT_INDEX_MIN_TERM = 3;
+function installTextIndex(db) {
+  if (db.prepare("SELECT value FROM store_meta WHERE key = ?").get(TEXT_INDEX_KEY)) return;
+  try {
+    db.exec(`CREATE VIRTUAL TABLE temp.fts5_probe USING fts5(x, tokenize='trigram'); DROP TABLE temp.fts5_probe`);
+  } catch {
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(TEXT_INDEX_KEY, "unavailable");
+    return;
+  }
+  db.transaction(() => {
+    db.exec(`CREATE VIRTUAL TABLE IF NOT EXISTS nodes_text
+      USING fts5(description, content='nodes', content_rowid='rowid', tokenize='trigram')`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_insert AFTER INSERT ON nodes WHEN NEW.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(rowid, description) VALUES (NEW.rowid, NEW.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_update_out AFTER UPDATE OF description, valid_to ON nodes
+      WHEN OLD.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(nodes_text, rowid, description) VALUES ('delete', OLD.rowid, OLD.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_update_in AFTER UPDATE OF description, valid_to ON nodes
+      WHEN NEW.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(rowid, description) VALUES (NEW.rowid, NEW.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_delete AFTER DELETE ON nodes WHEN OLD.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(nodes_text, rowid, description) VALUES ('delete', OLD.rowid, OLD.description); END;`);
+    db.exec(`INSERT INTO nodes_text(rowid, description) SELECT rowid, description FROM nodes WHERE valid_to IS NULL`);
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(TEXT_INDEX_KEY, "installed");
+  });
+}
+function textIndexReady(db) {
+  return db.prepare("SELECT value FROM store_meta WHERE key = ?").get(TEXT_INDEX_KEY)?.["value"] === "installed";
+}
+
 // ../../packages/math/src/relevance.ts
 function pageRankScale(ranks) {
   const positive = [...ranks].filter((r) => Number.isFinite(r) && r > 0).sort((a, b) => a - b);
@@ -15391,6 +15423,7 @@ var SqliteGraphStore = class {
     installEditPlaceholderRetirement(this.db);
     installCloudAttrCompaction(this.db);
     installHistoryAttrSlim(this.db);
+    installTextIndex(this.db);
     if (!this.db.prepare("SELECT value FROM store_meta WHERE key = ?").get(SESSION_REPAIR_KEY)) {
       this.db.transaction(() => {
         this.repairSessionAliases();
@@ -16045,6 +16078,20 @@ var SqliteGraphStore = class {
   }
   searchTextCandidates(terms) {
     if (terms.length === 0) return [];
+    const indexed = terms.filter((t) => t.length >= TEXT_INDEX_MIN_TERM);
+    if (indexed.length > 0 && textIndexReady(this.db)) {
+      const short = terms.filter((t) => t.length < TEXT_INDEX_MIN_TERM).map((t) => t.toLowerCase());
+      const rows2 = this.db.prepare(`WITH hits AS MATERIALIZED (
+        SELECT t.rowid AS rid, COUNT(*) AS matched FROM json_each(:terms) q, nodes_text t
+        WHERE t.description LIKE '%' || q.value || '%' GROUP BY t.rowid
+      ) SELECT ${TEXT_SEARCH_COLUMNS}, hits.matched FROM hits JOIN nodes ON nodes.rowid = hits.rid
+        WHERE nodes.valid_to IS NULL ORDER BY page_rank DESC, last_updated_at DESC`).all({ terms: JSON.stringify(indexed) });
+      return rows2.map((row) => {
+        const text = row.description.toLowerCase();
+        const extra = short.filter((t) => text.includes(t)).length;
+        return { node: textSearchNode(row), matched: row.matched + extra };
+      });
+    }
     const rows = this.db.prepare(`WITH matches AS MATERIALIZED (
       SELECT n.id, COUNT(*) AS matched FROM nodes n INDEXED BY nodes_live_description, json_each(:terms) t
       WHERE n.valid_to IS NULL AND n.description LIKE '%' || t.value || '%'
@@ -16053,6 +16100,18 @@ var SqliteGraphStore = class {
       JOIN matches USING (id) ORDER BY page_rank DESC, last_updated_at DESC`).all({ terms: JSON.stringify(terms) });
     return rows.map((row) => ({ node: textSearchNode(row), matched: row.matched }));
   }
+  commentAnchors(commentIds) {
+    const out = /* @__PURE__ */ new Map();
+    if (commentIds.length === 0) return out;
+    const rows = this.db.prepare(`WITH a AS MATERIALIZED (
+      SELECT q.value AS cid, COALESCE(
+        (SELECT to_id FROM edges WHERE from_id = q.value AND type IN ('EXPLAINS', 'ANNOTATES') AND valid_to IS NULL LIMIT 1),
+        (SELECT from_id FROM edges WHERE to_id = q.value AND type = 'DOCUMENTED_BY' AND valid_to IS NULL LIMIT 1)
+      ) AS aid FROM json_each(:ids) q
+    ) SELECT a.cid AS cid, ${TEXT_SEARCH_COLUMNS} FROM a JOIN nodes ON nodes.id = a.aid AND nodes.valid_to IS NULL`).all({ ids: JSON.stringify(commentIds) });
+    for (const row of rows) out.set(row.cid, textSearchNode(row));
+    return out;
+  }
   getTextSearchNode(id) {
     const row = this.db.prepare(`SELECT ${TEXT_SEARCH_COLUMNS} FROM nodes WHERE id = ? AND valid_to IS NULL`).get(id);
     return row ? textSearchNode(row) : null;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@inerrata-corporation/errata",
-  "version": "2.0.22-dev.4020",
+  "version": "2.0.22-dev.4049",
   "description": "errata - local-first observation engine for AI coding agents",
   "type": "module",
   "bin": {

package/pass-worker.mjs

@@ -25515,6 +25515,38 @@ function installHistoryAttrSlim(db) {
   db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(HISTORY_ATTR_SLIM_KEY, "done");
 }
 
+// ../../packages/local-graph/src/text-index.ts
+var TEXT_INDEX_KEY = "text-index-trigram-1";
+var TEXT_INDEX_MIN_TERM = 3;
+function installTextIndex(db) {
+  if (db.prepare("SELECT value FROM store_meta WHERE key = ?").get(TEXT_INDEX_KEY)) return;
+  try {
+    db.exec(`CREATE VIRTUAL TABLE temp.fts5_probe USING fts5(x, tokenize='trigram'); DROP TABLE temp.fts5_probe`);
+  } catch {
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(TEXT_INDEX_KEY, "unavailable");
+    return;
+  }
+  db.transaction(() => {
+    db.exec(`CREATE VIRTUAL TABLE IF NOT EXISTS nodes_text
+      USING fts5(description, content='nodes', content_rowid='rowid', tokenize='trigram')`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_insert AFTER INSERT ON nodes WHEN NEW.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(rowid, description) VALUES (NEW.rowid, NEW.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_update_out AFTER UPDATE OF description, valid_to ON nodes
+      WHEN OLD.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(nodes_text, rowid, description) VALUES ('delete', OLD.rowid, OLD.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_update_in AFTER UPDATE OF description, valid_to ON nodes
+      WHEN NEW.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(rowid, description) VALUES (NEW.rowid, NEW.description); END;`);
+    db.exec(`CREATE TRIGGER IF NOT EXISTS nodes_text_delete AFTER DELETE ON nodes WHEN OLD.valid_to IS NULL
+      BEGIN INSERT INTO nodes_text(nodes_text, rowid, description) VALUES ('delete', OLD.rowid, OLD.description); END;`);
+    db.exec(`INSERT INTO nodes_text(rowid, description) SELECT rowid, description FROM nodes WHERE valid_to IS NULL`);
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(TEXT_INDEX_KEY, "installed");
+  });
+}
+function textIndexReady(db) {
+  return db.prepare("SELECT value FROM store_meta WHERE key = ?").get(TEXT_INDEX_KEY)?.["value"] === "installed";
+}
+
 // ../../packages/math/src/pagerank.ts
 function pagerank(input) {
   const damping = input.damping ?? 0.85;
@@ -26249,6 +26281,7 @@ var SqliteGraphStore = class {
     installEditPlaceholderRetirement(this.db);
     installCloudAttrCompaction(this.db);
     installHistoryAttrSlim(this.db);
+    installTextIndex(this.db);
     if (!this.db.prepare("SELECT value FROM store_meta WHERE key = ?").get(SESSION_REPAIR_KEY)) {
       this.db.transaction(() => {
         this.repairSessionAliases();
@@ -26903,6 +26936,20 @@ var SqliteGraphStore = class {
   }
   searchTextCandidates(terms) {
     if (terms.length === 0) return [];
+    const indexed = terms.filter((t) => t.length >= TEXT_INDEX_MIN_TERM);
+    if (indexed.length > 0 && textIndexReady(this.db)) {
+      const short = terms.filter((t) => t.length < TEXT_INDEX_MIN_TERM).map((t) => t.toLowerCase());
+      const rows2 = this.db.prepare(`WITH hits AS MATERIALIZED (
+        SELECT t.rowid AS rid, COUNT(*) AS matched FROM json_each(:terms) q, nodes_text t
+        WHERE t.description LIKE '%' || q.value || '%' GROUP BY t.rowid
+      ) SELECT ${TEXT_SEARCH_COLUMNS}, hits.matched FROM hits JOIN nodes ON nodes.rowid = hits.rid
+        WHERE nodes.valid_to IS NULL ORDER BY page_rank DESC, last_updated_at DESC`).all({ terms: JSON.stringify(indexed) });
+      return rows2.map((row) => {
+        const text = row.description.toLowerCase();
+        const extra = short.filter((t) => text.includes(t)).length;
+        return { node: textSearchNode(row), matched: row.matched + extra };
+      });
+    }
     const rows = this.db.prepare(`WITH matches AS MATERIALIZED (
       SELECT n.id, COUNT(*) AS matched FROM nodes n INDEXED BY nodes_live_description, json_each(:terms) t
       WHERE n.valid_to IS NULL AND n.description LIKE '%' || t.value || '%'
@@ -26911,6 +26958,18 @@ var SqliteGraphStore = class {
       JOIN matches USING (id) ORDER BY page_rank DESC, last_updated_at DESC`).all({ terms: JSON.stringify(terms) });
     return rows.map((row) => ({ node: textSearchNode(row), matched: row.matched }));
   }
+  commentAnchors(commentIds) {
+    const out2 = /* @__PURE__ */ new Map();
+    if (commentIds.length === 0) return out2;
+    const rows = this.db.prepare(`WITH a AS MATERIALIZED (
+      SELECT q.value AS cid, COALESCE(
+        (SELECT to_id FROM edges WHERE from_id = q.value AND type IN ('EXPLAINS', 'ANNOTATES') AND valid_to IS NULL LIMIT 1),
+        (SELECT from_id FROM edges WHERE to_id = q.value AND type = 'DOCUMENTED_BY' AND valid_to IS NULL LIMIT 1)
+      ) AS aid FROM json_each(:ids) q
+    ) SELECT a.cid AS cid, ${TEXT_SEARCH_COLUMNS} FROM a JOIN nodes ON nodes.id = a.aid AND nodes.valid_to IS NULL`).all({ ids: JSON.stringify(commentIds) });
+    for (const row of rows) out2.set(row.cid, textSearchNode(row));
+    return out2;
+  }
   getTextSearchNode(id) {
     const row = this.db.prepare(`SELECT ${TEXT_SEARCH_COLUMNS} FROM nodes WHERE id = ? AND valid_to IS NULL`).get(id);
     return row ? textSearchNode(row) : null;

package/resources/context-plugin/.codex-plugin/plugin.json

@@ -1,6 +1,6 @@
 {
   "name": "errata-context",
-  "version": "2.0.22-dev.4020",
+  "version": "2.0.22-dev.4049",
   "description": "A minimal 3D view of loaded Errata priors and recent graph bursts.",
   "author": {
     "name": "inErrata"

package/resources/context-plugin/SHA256SUMS

@@ -1,4 +1,4 @@
-cefcb61c20b7e27f11cb65c4ab1bf3352957edd54c21cd575122b54dfd7f6581  .codex-plugin/plugin.json
+fed0cc007727934c2ac9ad932429797dfe773ebb96c0219d09141979f2886c84  .codex-plugin/plugin.json
 a7bebae9fb01c838d6c75fc784129e28be571233fa66ff5ee8039b574f35ccf7  assets/icon.png
 fc38b64e4df1e0b72c35764bef6c4c05430d97c9009ad0ecc8a9e75b4deab232  configure-local.mjs
 73dc6028b3b070257c7c31f252d11e55a9e096f4aed0f187f10cb21716e1e6d7  dist/client.js