@inerrata-corporation/errata 2.0.21-dev.3745 → 2.0.21-dev.3763

package/consolidate-worker.mjs

@@ -15726,10 +15726,12 @@ var init_history_quality = __esm({
 });
 
 // ../../packages/shared/src/history-read.ts
+var CLOUD_ATTR_DUPLICATE_KEYS;
 var init_history_read = __esm({
   "../../packages/shared/src/history-read.ts"() {
     "use strict";
     init_history_dependencies();
+    CLOUD_ATTR_DUPLICATE_KEYS = ["attrsJson", "embedding"];
   }
 });
 
@@ -16396,7 +16398,237 @@ function installEditPlaceholderRetirement(db) {
   });
 }
 
+// ../../packages/local-graph/src/cloud-attr-compaction.ts
+init_src2();
+var CLOUD_ATTR_COMPACTION_KEY = "cloud-attr-compaction-1";
+var DUPES = CLOUD_ATTR_DUPLICATE_KEYS.map((k) => `'${k}'`).join(",");
+function compacted(row) {
+  const packed = `json_extract(${row}.attrs_json, '$.attrsJson')`;
+  const nested = `CASE WHEN json_type(${row}.attrs_json, '$.attrsJson') = 'text' AND json_valid(${packed})
+    AND json_type(${packed}) = 'object' THEN ${packed} ELSE '{}' END`;
+  const value = `CASE WHEN type IN ('array','object') THEN json(value) WHEN type IN ('true','false') THEN json(type) ELSE value END`;
+  return `(SELECT json_group_object(key, ${value}) FROM (
+      SELECT key, value, type, min(pri) FROM (
+        SELECT key, value, type, 0 AS pri FROM json_each(${row}.attrs_json)
+        UNION ALL
+        SELECT key, value, type, 1 AS pri FROM json_each(${nested})
+      ) WHERE key NOT IN (${DUPES}) GROUP BY key))`;
+}
+function dirty(row) {
+  const has = CLOUD_ATTR_DUPLICATE_KEYS.map((k) => `json_type(${row}.attrs_json, '$.${k}') IS NOT NULL`).join(" OR ");
+  return `json_extract(${row}.attrs_json, '$.source') = 'cloud' AND (${has})`;
+}
+function installCloudAttrCompaction(db) {
+  if (db.prepare("SELECT value FROM store_meta WHERE key = ?").get(CLOUD_ATTR_COMPACTION_KEY)) return;
+  db.transaction(() => {
+    for (const operation of ["INSERT", "UPDATE"]) {
+      db.exec(`CREATE TRIGGER IF NOT EXISTS cloud_attr_compact_${operation.toLowerCase()}
+        AFTER ${operation} ON nodes WHEN ${dirty("NEW")}
+        BEGIN UPDATE nodes SET attrs_json = ${compacted("nodes")} WHERE id = NEW.id; END;`);
+    }
+    db.exec(`UPDATE nodes SET attrs_json = ${compacted("nodes")} WHERE ${dirty("nodes")}`);
+    db.prepare("INSERT INTO store_meta(key,value) VALUES (?,?)").run(CLOUD_ATTR_COMPACTION_KEY, "installed");
+  });
+}
+
+// ../../packages/math/src/constants.ts
+var NEMORI_DEDUP_COSINE = 0.88;
+
+// ../../packages/math/src/triage.ts
+var TRIAGE_GLOBAL_BUCKET = "*";
+function triageContextBuckets(ctx) {
+  const out = [];
+  for (const s of ctx.stack ?? []) {
+    const t = s.trim().toLowerCase();
+    if (t) out.push(`stack:${t}`);
+  }
+  const domains = Array.isArray(ctx.domain) ? ctx.domain : typeof ctx.domain === "string" ? [ctx.domain] : [];
+  for (const d of domains) {
+    const t = d.trim().toLowerCase();
+    if (t) out.push(`domain:${t}`);
+  }
+  return out;
+}
+
+// ../../packages/math/src/relevance.ts
+function pageRankScale(ranks) {
+  const positive = [...ranks].filter((r) => Number.isFinite(r) && r > 0).sort((a, b) => a - b);
+  return positive.length ? Math.max(1e-9, positive[Math.floor((positive.length - 1) * 0.95)]) : 1;
+}
+
+// ../../packages/math/src/leiden.ts
+function buildGraph(nodeIds, adj) {
+  const nbr = /* @__PURE__ */ new Map();
+  const deg = /* @__PURE__ */ new Map();
+  const present = new Set(nodeIds);
+  for (const id of nodeIds) {
+    nbr.set(id, /* @__PURE__ */ new Map());
+    deg.set(id, 0);
+  }
+  let m2 = 0;
+  for (const id of nodeIds) {
+    for (const { to, weight } of adj.get(id) ?? []) {
+      if (!present.has(to)) continue;
+      const row = nbr.get(id);
+      row.set(to, (row.get(to) ?? 0) + weight);
+      deg.set(id, (deg.get(id) ?? 0) + weight);
+      m2 += weight;
+    }
+  }
+  return { nbr, deg, m2 };
+}
+function localMoving(nodeIds, g) {
+  const community = new Map(nodeIds.map((n) => [n, n]));
+  const comTot = new Map(nodeIds.map((n) => [n, g.deg.get(n) ?? 0]));
+  const order = [...nodeIds].sort();
+  const m2 = g.m2 > 0 ? g.m2 : 1;
+  let improved = true;
+  let iter = 0;
+  while (improved && iter < 100) {
+    improved = false;
+    iter++;
+    for (const node of order) {
+      const ci = community.get(node);
+      const ki = g.deg.get(node) ?? 0;
+      comTot.set(ci, (comTot.get(ci) ?? 0) - ki);
+      const wToComm = /* @__PURE__ */ new Map();
+      for (const [nb, w] of g.nbr.get(node) ?? []) {
+        if (nb === node) continue;
+        const c = community.get(nb);
+        wToComm.set(c, (wToComm.get(c) ?? 0) + w);
+      }
+      let bestC = ci;
+      let bestGain = (wToComm.get(ci) ?? 0) - (comTot.get(ci) ?? 0) * ki / m2;
+      for (const [c, kiIn] of [...wToComm.entries()].sort(
+        (a, b) => a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0
+      )) {
+        const gain = kiIn - (comTot.get(c) ?? 0) * ki / m2;
+        if (gain > bestGain) {
+          bestGain = gain;
+          bestC = c;
+        }
+      }
+      community.set(node, bestC);
+      comTot.set(bestC, (comTot.get(bestC) ?? 0) + ki);
+      if (bestC !== ci) improved = true;
+    }
+  }
+  return community;
+}
+function refineConnectivity(community, g) {
+  const members = /* @__PURE__ */ new Map();
+  for (const [id, c] of community) {
+    const l = members.get(c) ?? [];
+    l.push(id);
+    members.set(c, l);
+  }
+  const refined = /* @__PURE__ */ new Map();
+  for (const [, group] of members) {
+    const inGroup = new Set(group);
+    const seen = /* @__PURE__ */ new Set();
+    for (const start of [...group].sort()) {
+      if (seen.has(start)) continue;
+      const comp = [];
+      const stack = [start];
+      seen.add(start);
+      while (stack.length) {
+        const cur = stack.pop();
+        comp.push(cur);
+        for (const [nb] of g.nbr.get(cur) ?? []) {
+          if (inGroup.has(nb) && !seen.has(nb)) {
+            seen.add(nb);
+            stack.push(nb);
+          }
+        }
+      }
+      const anchor = [...comp].sort()[0];
+      for (const id of comp) refined.set(id, anchor);
+    }
+  }
+  return refined;
+}
+function normalize(assignment) {
+  const groups = /* @__PURE__ */ new Map();
+  for (const [id, c] of assignment) {
+    const l = groups.get(c) ?? [];
+    l.push(id);
+    groups.set(c, l);
+  }
+  const community = /* @__PURE__ */ new Map();
+  for (const grp of groups.values()) {
+    const anchor = [...grp].sort()[0];
+    const cid = `community_${anchor}`;
+    for (const m of grp) community.set(m, cid);
+  }
+  return { community, count: groups.size, iterations: 1 };
+}
+function causalComponents(nodeIds, pairs) {
+  const parent = new Map(nodeIds.map((n) => [n, n]));
+  const find = (x) => {
+    let r = x;
+    while (parent.get(r) !== r) r = parent.get(r);
+    let c = x;
+    while (parent.get(c) !== r) {
+      const next = parent.get(c);
+      parent.set(c, r);
+      c = next;
+    }
+    return r;
+  };
+  for (const [a, b] of pairs) {
+    const ra = find(a);
+    const rb = find(b);
+    if (ra !== rb) parent.set(ra < rb ? rb : ra, ra < rb ? ra : rb);
+  }
+  return find;
+}
+function detectCommunitiesLeiden(input, opts = {}) {
+  const idSet = new Set(input.nodeIds);
+  const protect = [...opts.protect ?? []].filter(
+    ([a, b]) => a !== b && idSet.has(a) && idSet.has(b)
+  );
+  if (protect.length === 0) {
+    const g = buildGraph(input.nodeIds, input.adj);
+    return normalize(refineConnectivity(localMoving(input.nodeIds, g), g));
+  }
+  const rep = causalComponents(input.nodeIds, protect);
+  const superIds = [...new Set(input.nodeIds.map(rep))];
+  const superAdj = /* @__PURE__ */ new Map();
+  const acc = /* @__PURE__ */ new Map();
+  for (const id of input.nodeIds) {
+    const ra = rep(id);
+    for (const { to, weight } of input.adj.get(id) ?? []) {
+      if (!idSet.has(to)) continue;
+      const rb = rep(to);
+      if (ra === rb) continue;
+      const row = acc.get(ra) ?? /* @__PURE__ */ new Map();
+      row.set(rb, (row.get(rb) ?? 0) + weight);
+      acc.set(ra, row);
+    }
+  }
+  for (const [a, row] of acc) superAdj.set(a, [...row].map(([to, weight]) => ({ to, weight })));
+  const sg = buildGraph(superIds, superAdj);
+  const superComm = refineConnectivity(localMoving(superIds, sg), sg);
+  const assignment = /* @__PURE__ */ new Map();
+  for (const id of input.nodeIds) assignment.set(id, superComm.get(rep(id)) ?? rep(id));
+  return normalize(assignment);
+}
+
 // ../../packages/local-graph/src/store.ts
+var PAGE_RANK_SCALE_KEY = "pageRankScale.p95.v1";
+var TEXT_SEARCH_COLUMNS = `id, label, description, page_rank,
+  json_object('test', json(CASE WHEN json_type(attrs_json, '$.test') = 'true' THEN 'true' ELSE 'false' END),
+    'relPath', json_extract(attrs_json, '$.relPath'),
+    'resolutionSuspect', json(CASE WHEN json_type(attrs_json, '$.resolutionSuspect') = 'true' THEN 'true' ELSE 'false' END),
+    'resolvedAt', json_extract(attrs_json, '$.resolvedAt'),
+    'refutedAt', json_extract(attrs_json, '$.refutedAt'),
+    'refuteReasons', json_extract(attrs_json, '$.refuteReasons'),
+    'reopenedFrom', json_extract(attrs_json, '$.reopenedFrom'),
+    'resolvedAs', json_extract(attrs_json, '$.resolvedAs')) AS search_attrs`;
+function textSearchNode(row) {
+  const attrs = JSON.parse(row.search_attrs);
+  return { id: row.id, label: row.label, description: row.description, pageRank: row.page_rank, attrs };
+}
 var LOCAL_RULE_OVERRIDES = {
   ANCHORED_AT: {
     from: EDGE_RULES["ANCHORED_AT"]?.from,
@@ -16540,6 +16772,9 @@ CREATE INDEX IF NOT EXISTS edges_session_evidence ON edges(id) WHERE ${SESSION_E
 DROP INDEX IF EXISTS nodes_live_fingerprint;
 DROP INDEX IF EXISTS nodes_instance_fingerprint;
 CREATE INDEX IF NOT EXISTS nodes_instance_fingerprint_v2 ON nodes(label, last_updated_at, last_reinforced_at_seq, created_at_seq) WHERE valid_to IS NULL AND label IN ('Problem','Vulnerability','Solution','RootCause');
+-- Calibrate rank from a covering scalar index; the global page-rank index
+-- requires a table lookup per node to exclude frozen versions.
+CREATE INDEX IF NOT EXISTS nodes_live_page_rank ON nodes(valid_to, page_rank);
 CREATE INDEX IF NOT EXISTS nodes_logical ON nodes(logical_id, version);
 CREATE INDEX IF NOT EXISTS edges_live ON edges(valid_to);
 -- Expression index on the per-node relPath (stored in attrs_json) so the
@@ -16552,6 +16787,12 @@ CREATE INDEX IF NOT EXISTS nodes_live_description ON nodes(description, label) W
 -- Problems by the file their anchor hint names: the harvest upgrades hints for
 -- every edited file of every turn, and a scan parses every Problem's attrs.
 CREATE INDEX IF NOT EXISTS nodes_anchor_hint_path ON nodes(json_extract(attrs_json, '$.anchorHint.path')) WHERE valid_to IS NULL;
+-- Problems by the command / checker / file that opened them. The generalizer
+-- looked these up per shell or tool EVENT by hydrating every Problem: ~12s of
+-- every minute of daemon main-thread time on a 3.4k-Problem store (2026-10-05).
+CREATE INDEX IF NOT EXISTS nodes_command_signature ON nodes(json_extract(attrs_json, '$.commandSignature')) WHERE valid_to IS NULL;
+CREATE INDEX IF NOT EXISTS nodes_diag_command ON nodes(json_extract(attrs_json, '$.diagCommand')) WHERE valid_to IS NULL;
+CREATE INDEX IF NOT EXISTS nodes_lsp_rel_path ON nodes(json_extract(attrs_json, '$.lspRelPath')) WHERE valid_to IS NULL;
 -- Nodes still waiting on a root-cause ask. The MCP server checks this on EVERY
 -- tool response (the enrichment piggyback), so it must not parse every
 -- Solution's and Problem's attrs per call. Not partial: the Problem pull reads
@@ -16638,6 +16879,7 @@ var SqliteGraphStore = class {
    *  ALL upserts incl. code reindex) — this counter is the knowledge-arrival axis
    *  Δseq is measured over, so code reindex churn must NOT advance it. */
   ingestSeq = 0;
+  initialPageRankScale;
   constructor(opts) {
     this.db = openDatabase(opts.path);
     this.db.exec(SCHEMA_SQL);
@@ -16654,6 +16896,7 @@ var SqliteGraphStore = class {
     this.db.exec(TEMPORAL_INDEX_SQL);
     installHistoryCacheFloor(this.db);
     installEditPlaceholderRetirement(this.db);
+    installCloudAttrCompaction(this.db);
     if (!this.db.prepare("SELECT value FROM store_meta WHERE key = ?").get(SESSION_REPAIR_KEY)) {
       this.db.transaction(() => {
         this.repairSessionAliases();
@@ -17257,6 +17500,34 @@ var SqliteGraphStore = class {
     ).all(...terms.map((t) => `%${t}%`), Math.max(1, limit));
     return rows.map((r) => ({ node: rowToNode(r), matched: Number(r.matched) }));
   }
+  searchTextCandidates(terms) {
+    if (terms.length === 0) return [];
+    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 || '%'
+      GROUP BY n.id
+    ) SELECT ${TEXT_SEARCH_COLUMNS}, matches.matched FROM nodes
+      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 }));
+  }
+  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;
+  }
+  readPageRankScale() {
+    const rows = this.db.prepare("SELECT page_rank FROM nodes WHERE valid_to IS NULL AND page_rank > 0").all();
+    return pageRankScale(rows.map((row) => row.page_rank));
+  }
+  pageRankScale() {
+    const value = Number(this.getMeta(PAGE_RANK_SCALE_KEY));
+    if (Number.isFinite(value) && value > 0) return value;
+    return this.initialPageRankScale ??= this.readPageRankScale();
+  }
+  refreshPageRankScale() {
+    const scale = this.readPageRankScale();
+    this.setMeta(PAGE_RANK_SCALE_KEY, String(scale));
+    return scale;
+  }
   typedEdgeStmt(sql) {
     let stmt = this.typedEdgeStmts.get(sql);
     if (!stmt) {
@@ -17802,183 +18073,6 @@ function percolate(l1, l2, opts) {
 init_src();
 init_src2();
 
-// ../../packages/math/src/constants.ts
-var NEMORI_DEDUP_COSINE = 0.88;
-
-// ../../packages/math/src/triage.ts
-var TRIAGE_GLOBAL_BUCKET = "*";
-function triageContextBuckets(ctx) {
-  const out = [];
-  for (const s of ctx.stack ?? []) {
-    const t = s.trim().toLowerCase();
-    if (t) out.push(`stack:${t}`);
-  }
-  const domains = Array.isArray(ctx.domain) ? ctx.domain : typeof ctx.domain === "string" ? [ctx.domain] : [];
-  for (const d of domains) {
-    const t = d.trim().toLowerCase();
-    if (t) out.push(`domain:${t}`);
-  }
-  return out;
-}
-
-// ../../packages/math/src/leiden.ts
-function buildGraph(nodeIds, adj) {
-  const nbr = /* @__PURE__ */ new Map();
-  const deg = /* @__PURE__ */ new Map();
-  const present = new Set(nodeIds);
-  for (const id of nodeIds) {
-    nbr.set(id, /* @__PURE__ */ new Map());
-    deg.set(id, 0);
-  }
-  let m2 = 0;
-  for (const id of nodeIds) {
-    for (const { to, weight } of adj.get(id) ?? []) {
-      if (!present.has(to)) continue;
-      const row = nbr.get(id);
-      row.set(to, (row.get(to) ?? 0) + weight);
-      deg.set(id, (deg.get(id) ?? 0) + weight);
-      m2 += weight;
-    }
-  }
-  return { nbr, deg, m2 };
-}
-function localMoving(nodeIds, g) {
-  const community = new Map(nodeIds.map((n) => [n, n]));
-  const comTot = new Map(nodeIds.map((n) => [n, g.deg.get(n) ?? 0]));
-  const order = [...nodeIds].sort();
-  const m2 = g.m2 > 0 ? g.m2 : 1;
-  let improved = true;
-  let iter = 0;
-  while (improved && iter < 100) {
-    improved = false;
-    iter++;
-    for (const node of order) {
-      const ci = community.get(node);
-      const ki = g.deg.get(node) ?? 0;
-      comTot.set(ci, (comTot.get(ci) ?? 0) - ki);
-      const wToComm = /* @__PURE__ */ new Map();
-      for (const [nb, w] of g.nbr.get(node) ?? []) {
-        if (nb === node) continue;
-        const c = community.get(nb);
-        wToComm.set(c, (wToComm.get(c) ?? 0) + w);
-      }
-      let bestC = ci;
-      let bestGain = (wToComm.get(ci) ?? 0) - (comTot.get(ci) ?? 0) * ki / m2;
-      for (const [c, kiIn] of [...wToComm.entries()].sort(
-        (a, b) => a[0] < b[0] ? -1 : a[0] > b[0] ? 1 : 0
-      )) {
-        const gain = kiIn - (comTot.get(c) ?? 0) * ki / m2;
-        if (gain > bestGain) {
-          bestGain = gain;
-          bestC = c;
-        }
-      }
-      community.set(node, bestC);
-      comTot.set(bestC, (comTot.get(bestC) ?? 0) + ki);
-      if (bestC !== ci) improved = true;
-    }
-  }
-  return community;
-}
-function refineConnectivity(community, g) {
-  const members = /* @__PURE__ */ new Map();
-  for (const [id, c] of community) {
-    const l = members.get(c) ?? [];
-    l.push(id);
-    members.set(c, l);
-  }
-  const refined = /* @__PURE__ */ new Map();
-  for (const [, group] of members) {
-    const inGroup = new Set(group);
-    const seen = /* @__PURE__ */ new Set();
-    for (const start of [...group].sort()) {
-      if (seen.has(start)) continue;
-      const comp = [];
-      const stack = [start];
-      seen.add(start);
-      while (stack.length) {
-        const cur = stack.pop();
-        comp.push(cur);
-        for (const [nb] of g.nbr.get(cur) ?? []) {
-          if (inGroup.has(nb) && !seen.has(nb)) {
-            seen.add(nb);
-            stack.push(nb);
-          }
-        }
-      }
-      const anchor = [...comp].sort()[0];
-      for (const id of comp) refined.set(id, anchor);
-    }
-  }
-  return refined;
-}
-function normalize(assignment) {
-  const groups = /* @__PURE__ */ new Map();
-  for (const [id, c] of assignment) {
-    const l = groups.get(c) ?? [];
-    l.push(id);
-    groups.set(c, l);
-  }
-  const community = /* @__PURE__ */ new Map();
-  for (const grp of groups.values()) {
-    const anchor = [...grp].sort()[0];
-    const cid = `community_${anchor}`;
-    for (const m of grp) community.set(m, cid);
-  }
-  return { community, count: groups.size, iterations: 1 };
-}
-function causalComponents(nodeIds, pairs) {
-  const parent = new Map(nodeIds.map((n) => [n, n]));
-  const find = (x) => {
-    let r = x;
-    while (parent.get(r) !== r) r = parent.get(r);
-    let c = x;
-    while (parent.get(c) !== r) {
-      const next = parent.get(c);
-      parent.set(c, r);
-      c = next;
-    }
-    return r;
-  };
-  for (const [a, b] of pairs) {
-    const ra = find(a);
-    const rb = find(b);
-    if (ra !== rb) parent.set(ra < rb ? rb : ra, ra < rb ? ra : rb);
-  }
-  return find;
-}
-function detectCommunitiesLeiden(input, opts = {}) {
-  const idSet = new Set(input.nodeIds);
-  const protect = [...opts.protect ?? []].filter(
-    ([a, b]) => a !== b && idSet.has(a) && idSet.has(b)
-  );
-  if (protect.length === 0) {
-    const g = buildGraph(input.nodeIds, input.adj);
-    return normalize(refineConnectivity(localMoving(input.nodeIds, g), g));
-  }
-  const rep = causalComponents(input.nodeIds, protect);
-  const superIds = [...new Set(input.nodeIds.map(rep))];
-  const superAdj = /* @__PURE__ */ new Map();
-  const acc = /* @__PURE__ */ new Map();
-  for (const id of input.nodeIds) {
-    const ra = rep(id);
-    for (const { to, weight } of input.adj.get(id) ?? []) {
-      if (!idSet.has(to)) continue;
-      const rb = rep(to);
-      if (ra === rb) continue;
-      const row = acc.get(ra) ?? /* @__PURE__ */ new Map();
-      row.set(rb, (row.get(rb) ?? 0) + weight);
-      acc.set(ra, row);
-    }
-  }
-  for (const [a, row] of acc) superAdj.set(a, [...row].map(([to, weight]) => ({ to, weight })));
-  const sg = buildGraph(superIds, superAdj);
-  const superComm = refineConnectivity(localMoving(superIds, sg), sg);
-  const assignment = /* @__PURE__ */ new Map();
-  for (const id of input.nodeIds) assignment.set(id, superComm.get(rep(id)) ?? rep(id));
-  return normalize(assignment);
-}
-
 // ../../packages/local-graph/src/triage.ts
 init_src();
 init_src();