@inerrata-corporation/errata 2.0.21-dev.3918 → 2.0.21-dev.3930

package/consolidate-worker.mjs

@@ -16810,6 +16810,10 @@ CREATE INDEX IF NOT EXISTS nodes_anchor_hint_path ON nodes(json_extract(attrs_js
 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;
+-- Local nodes by the cloud twin their upload receipt recorded. Every burst /
+-- search fusion folds the Network copy of the caller's own knowledge back onto
+-- the local node; unindexed, the reverse lookup was a ~300ms attrs scan per call.
+CREATE INDEX IF NOT EXISTS nodes_cloud_node_id ON nodes(json_extract(attrs_json, '$.cloudNodeId')) 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
@@ -17779,6 +17783,19 @@ var SqliteGraphStore = class {
     ).get(attr, `%${marker}%`, limit);
     return { count: Number(r.count), total: Number(r.total) };
   }
+  liveNodeIdsByCloudNodeId(cloudIds) {
+    const out = /* @__PURE__ */ new Map();
+    const CHUNK = 900;
+    for (let i = 0; i < cloudIds.length; i += CHUNK) {
+      const slice = cloudIds.slice(i, i + CHUNK);
+      if (slice.length === 0) continue;
+      const rows = this.db.prepare(
+        `SELECT id, json_extract(attrs_json, '$.cloudNodeId') AS cloud FROM nodes INDEXED BY nodes_cloud_node_id WHERE json_extract(attrs_json, '$.cloudNodeId') IN (${slice.map(() => "?").join(",")}) AND valid_to IS NULL ORDER BY id`
+      ).all(...slice);
+      for (const r of rows) out.set(r.cloud, [...out.get(r.cloud) ?? [], r.id]);
+    }
+    return out;
+  }
   liveNodeIds(ids) {
     const live = /* @__PURE__ */ new Set();
     const CHUNK = 900;
@@ -17840,7 +17857,10 @@ var SqliteGraphStore = class {
     if (relPaths.length === 0) return [];
     const placeholders = relPaths.map(() => "?").join(",");
     const rows = this.db.prepare(
-      `SELECT * FROM nodes WHERE valid_to IS NULL AND json_extract(attrs_json, '$.relPath') IN (${placeholders})`
+      // INDEXED BY: unforced, the planner took nodes_live_page_rank and
+      // json-parsed every live row — 11–25s per reindexed file pair on the
+      // live store vs 7ms here (2026-10-08).
+      `SELECT * FROM nodes INDEXED BY nodes_relpath WHERE valid_to IS NULL AND json_extract(attrs_json, '$.relPath') IN (${placeholders})`
     ).all(...relPaths);
     return rows.map(rowToNode);
   }

package/errata.mjs

@@ -19568,6 +19568,10 @@ CREATE INDEX IF NOT EXISTS nodes_anchor_hint_path ON nodes(json_extract(attrs_js
 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;
+-- Local nodes by the cloud twin their upload receipt recorded. Every burst /
+-- search fusion folds the Network copy of the caller's own knowledge back onto
+-- the local node; unindexed, the reverse lookup was a ~300ms attrs scan per call.
+CREATE INDEX IF NOT EXISTS nodes_cloud_node_id ON nodes(json_extract(attrs_json, '$.cloudNodeId')) 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
@@ -20480,6 +20484,19 @@ CREATE INDEX IF NOT EXISTS nodes_enrichment_pending ON nodes(json_extract(attrs_
         ).get(attr, `%${marker}%`, limit);
         return { count: Number(r.count), total: Number(r.total) };
       }
+      liveNodeIdsByCloudNodeId(cloudIds) {
+        const out2 = /* @__PURE__ */ new Map();
+        const CHUNK = 900;
+        for (let i2 = 0; i2 < cloudIds.length; i2 += CHUNK) {
+          const slice = cloudIds.slice(i2, i2 + CHUNK);
+          if (slice.length === 0) continue;
+          const rows = this.db.prepare(
+            `SELECT id, json_extract(attrs_json, '$.cloudNodeId') AS cloud FROM nodes INDEXED BY nodes_cloud_node_id WHERE json_extract(attrs_json, '$.cloudNodeId') IN (${slice.map(() => "?").join(",")}) AND valid_to IS NULL ORDER BY id`
+          ).all(...slice);
+          for (const r of rows) out2.set(r.cloud, [...out2.get(r.cloud) ?? [], r.id]);
+        }
+        return out2;
+      }
       liveNodeIds(ids) {
         const live3 = /* @__PURE__ */ new Set();
         const CHUNK = 900;
@@ -20541,7 +20558,10 @@ CREATE INDEX IF NOT EXISTS nodes_enrichment_pending ON nodes(json_extract(attrs_
         if (relPaths.length === 0) return [];
         const placeholders = relPaths.map(() => "?").join(",");
         const rows = this.db.prepare(
-          `SELECT * FROM nodes WHERE valid_to IS NULL AND json_extract(attrs_json, '$.relPath') IN (${placeholders})`
+          // INDEXED BY: unforced, the planner took nodes_live_page_rank and
+          // json-parsed every live row — 11–25s per reindexed file pair on the
+          // live store vs 7ms here (2026-10-08).
+          `SELECT * FROM nodes INDEXED BY nodes_relpath WHERE valid_to IS NULL AND json_extract(attrs_json, '$.relPath') IN (${placeholders})`
         ).all(...relPaths);
         return rows.map(rowToNode);
       }
@@ -34982,33 +35002,90 @@ function collectiveScore(hit, cap) {
 function mergeDualBurst(local, cloud, opts = {}) {
   const boost = opts.corroborationBoost ?? 0.15;
   const cap = opts.collectiveScoreCap ?? 0.5;
-  const cloudById = new Map(cloud.map((c) => [c.id, c]));
-  const localIds = new Set(local.map((l) => l.id));
+  const twins = opts.twins;
+  const cloudIdsOf = (id) => twins?.cloudIdsOf(id) ?? [];
+  const seedSet = /* @__PURE__ */ new Set();
+  if (opts.seedId) {
+    seedSet.add(opts.seedId);
+    for (const c of cloudIdsOf(opts.seedId)) seedSet.add(c);
+  }
+  const isSeedTwin = (id) => seedSet.has(id) || opts.seedId != null && twins?.localOf(id)?.id === opts.seedId;
   const nodes = [];
+  const byId = /* @__PURE__ */ new Map();
+  const owner = /* @__PURE__ */ new Map();
   let corroboratedCount = 0;
-  for (const l of local) {
-    const twin = cloudById.get(l.id);
-    const corroborated = twin != null;
-    if (corroborated) corroboratedCount++;
-    nodes.push({
+  let collectiveCount = 0;
+  const keptLocal = local.filter((l) => !isSeedTwin(l.id)).sort((a, b) => b.score - a.score);
+  const recordedBy = /* @__PURE__ */ new Map();
+  for (const l of keptLocal) {
+    for (const c of cloudIdsOf(l.id)) if (c !== l.id && !recordedBy.has(c)) recordedBy.set(c, l.id);
+  }
+  const copies = [];
+  for (const l of keptLocal) {
+    if (recordedBy.has(l.id)) {
+      copies.push(l);
+      continue;
+    }
+    const n = {
       id: l.id,
       label: l.node.label,
       name: l.node.description,
-      score: corroborated ? l.score * (1 + boost) : l.score,
+      score: l.score,
       hops: l.hops,
-      provenance: corroborated ? "corroborated" : "local",
-      ...twin?.usageCount != null ? { usageCount: twin.usageCount } : {},
-      ...twin?.rel ? { rel: twin.rel } : {},
-      ...twin?.community ? { community: twin.community } : {},
+      provenance: "local",
       why: l.components,
       ...l.via ? { via: l.via } : {}
-    });
+    };
+    nodes.push(n);
+    byId.set(n.id, n);
+    for (const c of cloudIdsOf(l.id)) if (!owner.has(c)) owner.set(c, n);
+  }
+  for (const l of copies) {
+    const host = byId.get(recordedBy.get(l.id));
+    if (host) addTwin(host, l.id);
   }
-  let collectiveCount = 0;
   for (const c of cloud) {
-    if (localIds.has(c.id)) continue;
+    if (isSeedTwin(c.id)) continue;
+    const recorded = owner.get(c.id);
+    if (recorded) {
+      foldSelfUpload(recorded, c);
+      continue;
+    }
+    const exact = byId.get(c.id);
+    if (exact && exact.provenance !== "collective") {
+      absorb(exact, c);
+      continue;
+    }
+    const mine = twins?.localOf(c.id);
+    if (mine && !isSeedTwin(mine.id)) {
+      const existing = byId.get(mine.id);
+      if (existing) {
+        if (existing.provenance === "collective") {
+          existing.provenance = "local";
+          collectiveCount--;
+        }
+        owner.set(c.id, existing);
+        absorb(existing, c);
+        continue;
+      }
+      const n2 = {
+        id: mine.id,
+        label: mine.label,
+        name: mine.description,
+        score: collectiveScore(c, cap),
+        hops: 1,
+        provenance: "local"
+      };
+      nodes.push(n2);
+      byId.set(n2.id, n2);
+      for (const cid of cloudIdsOf(mine.id)) if (!owner.has(cid)) owner.set(cid, n2);
+      owner.set(c.id, n2);
+      absorb(n2, c);
+      continue;
+    }
+    if (exact) continue;
     collectiveCount++;
-    nodes.push({
+    const n = {
       id: c.id,
       label: c.label,
       name: c.description,
@@ -35020,10 +35097,53 @@ function mergeDualBurst(local, cloud, opts = {}) {
       ...c.rel ? { rel: c.rel } : {},
       ...c.community ? { community: c.community } : {},
       ...c.via ? { via: c.via } : {}
-    });
+    };
+    nodes.push(n);
+    byId.set(n.id, n);
+  }
+  for (const n of nodes) {
+    if (!n.via) continue;
+    const parent = canonicalId(n.via.parentId);
+    if (parent === n.id) delete n.via;
+    else if (parent !== n.via.parentId) n.via = { ...n.via, parentId: parent };
   }
   nodes.sort((a, b) => b.score - a.score);
   return { nodes, collectiveCount, corroboratedCount };
+  function canonicalId(id) {
+    if (opts.seedId && isSeedTwin(id)) return opts.seedId;
+    return owner.get(id)?.id ?? recordedBy.get(id) ?? twins?.localOf(id)?.id ?? id;
+  }
+  function absorb(n, c) {
+    if (c.id === n.id && cloudIdsOf(n.id).length === 0) corroborate(n, c);
+    else foldSelfUpload(n, c);
+  }
+  function corroborate(n, c) {
+    if (n.provenance !== "corroborated") {
+      corroboratedCount++;
+      n.provenance = "corroborated";
+      n.score = n.score * (1 + boost);
+      delete n.uploaded;
+    }
+    attachCloudFields(n, c);
+  }
+  function foldSelfUpload(n, c) {
+    addTwin(n, c.id);
+    if ((c.usageCount ?? 0) >= 2) return corroborate(n, c);
+    if (n.provenance === "local") n.uploaded = true;
+    attachCloudFields(n, c);
+  }
+  function attachCloudFields(n, c) {
+    if (c.usageCount != null && (n.usageCount ?? -1) < c.usageCount) n.usageCount = c.usageCount;
+    if (c.rel && !n.rel) n.rel = c.rel;
+    if (c.community && !n.community) n.community = c.community;
+    const v = c.via;
+    if (v && !n.via) n.via = v;
+  }
+}
+function addTwin(n, id) {
+  if (id === n.id) return;
+  const t = n.twins ?? (n.twins = []);
+  if (!t.includes(id)) t.push(id);
 }
 function packageNeighborhoodToCloudHits(pn) {
   const mk = (rel) => (r) => ({
@@ -35078,6 +35198,69 @@ var init_dual_burst = __esm({
   }
 });
 
+// src/twin-index.ts
+function recordedCloudIds(n) {
+  if (n.attrs["source"] === "cloud") return [];
+  const ids = [];
+  const add = (v) => {
+    if (typeof v === "string" && v.length > 0 && v !== n.id && !ids.includes(v)) ids.push(v);
+  };
+  add(n.attrs["cloudNodeId"]);
+  const receipts = n.attrs["instanceReceipts"];
+  if (receipts && typeof receipts === "object" && !Array.isArray(receipts)) {
+    for (const r of Object.values(receipts)) {
+      if (r && typeof r === "object") add(r["cloudNodeId"]);
+    }
+  }
+  return ids;
+}
+function localTwinOf(store, cloudId) {
+  return localTwinsOf(store, [cloudId]).get(cloudId) ?? null;
+}
+function localTwinsOf(store, cloudIds) {
+  const out2 = /* @__PURE__ */ new Map();
+  if (cloudIds.length === 0) return out2;
+  for (const [cloudId, localIds] of store.liveNodeIdsByCloudNodeId(cloudIds)) {
+    for (const id of localIds) {
+      if (id === cloudId) continue;
+      const n = store.getNode(id);
+      if (!n || n.attrs["source"] === "cloud") continue;
+      out2.set(cloudId, n);
+      break;
+    }
+  }
+  const rest2 = cloudIds.filter((id) => !out2.has(id));
+  for (const id of rest2.length ? store.liveNodeIds(rest2) : []) {
+    const n = store.getNode(id);
+    if (n && recordedCloudIds(n).length > 0) out2.set(id, n);
+  }
+  return out2;
+}
+function storeTwinIndex(store, cloudIds) {
+  const reverse = localTwinsOf(store, [...new Set(cloudIds)]);
+  const forward = /* @__PURE__ */ new Map();
+  return {
+    cloudIdsOf(localId) {
+      let ids = forward.get(localId);
+      if (!ids) {
+        const n = store.getNode(localId);
+        ids = n ? recordedCloudIds(n) : [];
+        forward.set(localId, ids);
+      }
+      return ids;
+    },
+    localOf(cloudId) {
+      const n = reverse.get(cloudId);
+      return n ? { id: n.id, label: n.label, description: n.description } : void 0;
+    }
+  };
+}
+var init_twin_index = __esm({
+  "src/twin-index.ts"() {
+    "use strict";
+  }
+});
+
 // src/dual-augment.ts
 function isHardBridge(n) {
   return n.label === "Package" || n.label === "Language" || n.label === "Claim" && Number(n.attrs["abstractionLevel"] ?? 0) >= 2;
@@ -35098,6 +35281,8 @@ async function dualAugment(opts) {
       const n = seedNode && nid === seedNode.id ? seedNode : store.getNode(nid);
       return !!n && isHardBridge(n);
     });
+    const seedTwinIds = seedNode ? recordedCloudIds(seedNode) : [];
+    const cloudSeeds = [.../* @__PURE__ */ new Set([...seedTwinIds, ...hardIds])];
     const softText = queryText ?? (seedNode && BRIDGE_LABELS.has(seedNode.label) ? seedNode.description : void 0);
     const softQ = softText ? await generalizeSoft?.(softText) ?? generalizeSymbols(softText, lexiconsFor(store).symbols, 1) : void 0;
     if (seedNode?.label === "Package") {
@@ -35111,9 +35296,9 @@ async function dualAugment(opts) {
         })
       );
     }
-    if (hardIds.length > 0 || softQ) {
+    if (cloudSeeds.length > 0 || softQ) {
       calls.push(
-        cloud.search({ stack: [], domains: [], kinds: [], seed: hardIds, ...softQ ? { q: softQ } : {}, limit, community: true, via: true }).then((res) => {
+        cloud.search({ stack: [], domains: [], kinds: [], seed: cloudSeeds, ...softQ ? { q: softQ } : {}, limit, community: true, via: true }).then((res) => {
           cloudHits.push(...searchResultToCloudHits(res));
         })
       );
@@ -35134,9 +35319,18 @@ async function dualAugment(opts) {
     return { status: "offline" };
   }
   if (cloudHits.length === 0) return { status: "empty" };
+  const deduped = dedupCloudHits(cloudHits);
   return {
     status: "merged",
-    merged: mergeDualBurst(localHits, dedupCloudHits(cloudHits)),
+    merged: mergeDualBurst(localHits, deduped, {
+      // A hit's `via` parent is resolved too, so an edge from a folded twin
+      // can be re-pointed at the entity it folded into.
+      twins: storeTwinIndex(store, deduped.flatMap((c) => {
+        const parent = c.via?.parentId;
+        return parent ? [c.id, parent] : [c.id];
+      })),
+      ...seedNode ? { seedId: seedNode.id } : {}
+    }),
     seedProvenance,
     seedUsageCount
   };
@@ -35291,7 +35485,9 @@ function formatDualNodes(merged) {
         trust: n.why.trust
       }
     } : {},
-    ...n.via ? { via: n.via } : {}
+    ...n.via ? { via: n.via } : {},
+    ...n.twins?.length ? { twins: n.twins } : {},
+    ...n.uploaded ? { uploaded: true } : {}
   }));
 }
 var BRIDGE_LABELS, CANONICAL_KNOWLEDGE_ID, UUID_ID;
@@ -35301,6 +35497,7 @@ var init_dual_augment = __esm({
     init_src2();
     init_generalize_graph();
     init_dual_burst();
+    init_twin_index();
     BRIDGE_LABELS = new Set(SEMANTIC_NODE_LABELS);
     CANONICAL_KNOWLEDGE_ID = /^[a-z][a-z0-9]*_[0-9a-f]{8,}$/;
     UUID_ID = /^[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}$/i;
@@ -44593,6 +44790,10 @@ function collectiveSeedMiss(args2, outcome) {
 function resolveSymbol2(store, args2) {
   const id = args2["nodeId"];
   if (typeof id === "string" && store.getNode(id)) return id;
+  if (typeof id === "string" && hasCloudNodeShape(id)) {
+    const twin = localTwinOf(store, id);
+    if (twin) return twin.id;
+  }
   const qname = args2["qname"];
   if (typeof qname === "string") {
     const hits = store.searchNodes({ descriptionLike: qname, limit: 5 });
@@ -44602,6 +44803,14 @@ function resolveSymbol2(store, args2) {
   }
   return null;
 }
+function seedTwinFields(args2, seed) {
+  const twins = seed ? recordedCloudIds(seed) : [];
+  const asked = args2["nodeId"];
+  return {
+    ...twins.length ? { seedTwins: twins } : {},
+    ...typeof asked === "string" && seed && asked !== seed.id ? { requestedSeed: asked } : {}
+  };
+}
 function isSynthesizedScope(name2) {
   return name2.includes(":") || name2.startsWith("anon@");
 }
@@ -44783,6 +44992,8 @@ var init_mcp = __esm({
     init_identity2();
     init_registry();
     init_dual_augment();
+    init_dual_burst();
+    init_twin_index();
     init_src5();
     init_src2();
     init_src8();
@@ -45065,6 +45276,7 @@ var init_mcp = __esm({
             if (dual.status === "merged") {
               return {
                 seed: id,
+                ...seedTwinFields(args2, seedNode),
                 seedProvenance: dual.seedProvenance,
                 ...dual.seedUsageCount != null ? { seedUsageCount: dual.seedUsageCount } : {},
                 collectiveReachable: true,
@@ -45079,25 +45291,17 @@ var init_mcp = __esm({
           }
           return {
             seed: id,
+            ...seedTwinFields(args2, seedNode),
             // reached-but-empty counts as reachable; offline/no-portal/local-only do not.
             collectiveReachable: collectiveStatus === "empty",
             collectiveStatus,
             ...federationHint(collectiveStatus) ? { collectiveHint: federationHint(collectiveStatus) } : {},
-            count: ranked.length,
-            results: ranked.map((r) => ({
-              id: r.id,
-              label: r.node.label,
-              name: r.node.description,
-              score: Number(r.score.toFixed(4)),
-              hops: r.hops,
-              provenance: "local",
-              why: {
-                semantic: Number(r.components.semantic.toFixed(3)),
-                centrality: Number(r.components.centrality.toFixed(3)),
-                trust: r.components.trust
-              },
-              ...r.via ? { via: r.via } : {}
-            }))
+            // Same twin fold as the merged path: a hydrated in-store copy of a hit
+            // (or of the seed) is not a second entity.
+            ...(() => {
+              const localOnly = mergeDualBurst(localHits, [], { twins: storeTwinIndex(store, []), seedId: id });
+              return { count: localOnly.nodes.length, results: formatDualNodes(localOnly) };
+            })()
           };
         }
       },
@@ -77678,11 +77882,26 @@ var CONFIRM_PREFIX = /^\s*confirm:\s*/i;
 var REFUTE_PREFIX = /^\s*refute:\s*/i;
 var REFUTE_REASON_MIN = 4;
 var PATTERN_RE = /\(\s*pattern:\s*([^()\n]{3,}?)\s*\)/gi;
-var DOMAIN_RE = /\(\s*domain:\s*([^()\n]{3,}?)\s*\)/gi;
+var DOMAIN_RE = /\(\s*domain:\s*([^()\n]{2,}?)\s*\)/gi;
 var PACKAGE_RE = /\(\s*package:\s*([^()\n]{2,}?)\s*\)/gi;
 var COMPONENT_RE = /\(\s*component:\s*([^()\n]{2,}?)\s*\)/gi;
 var CAUSE_TEXT_MIN = 8;
-var FLAG_RE = /\[([!?])(?:#([a-z][\w-]{0,63})\s+)?\s*((?:\[[^\]\n]*\]|[^\]\n])*?)\s*(?:@\s*([^\s\]]+?)(?::(\d+))?\s*)?\]/g;
+var FLAG_RE = /\[([!?])(?:#([a-z][\w-]{0,63})\s+)?\s*((?:\[[^[\]\n]*\]|[^\]\n])*?)\s*(?:@\s*([^\s\]]+?)(?::(\d+))?\s*)?\]/g;
+function flagScanView(text) {
+  let out2 = "";
+  let from = 0;
+  for (; ; ) {
+    const nl = text.indexOf("\n", from);
+    const end = nl < 0 ? text.length : nl;
+    const close = text.lastIndexOf("]", end - 1);
+    const keep = close >= from ? close + 1 : from;
+    out2 += text.slice(from, keep) + " ".repeat(end - keep);
+    if (nl < 0) return out2;
+    out2 += "\n";
+    from = nl + 1;
+  }
+}
+var MARKDOWN_LINK_RE = /\[([^[\]\n]+)\]\(([^()\s[\]]*[./][^()\s[\]]*)\)/g;
 var CONSTRAINT_MIN = 8;
 function clauseBefore(sentence, idx) {
   const win = sentence.slice(Math.max(0, idx - 80), idx);
@@ -77702,13 +77921,15 @@ var SIBLING_MARKUP_SOURCES = [
   CONSTRAINT_RE
 ].map((re) => ({ source: re.source, flags: re.flags.includes("g") ? re.flags : `${re.flags}g` }));
 function maskSiblingMarkup(sentence, tagStart, tagEnd) {
-  let masked = sentence;
+  let masked = sentence.replace(MARKDOWN_LINK_RE, (m, label, _target, at) => at <= tagStart && at + m.length >= tagEnd ? m : ` ${label}${" ".repeat(m.length - label.length - 1)}`);
   for (const { source, flags: flags2 } of SIBLING_MARKUP_SOURCES) {
-    masked = masked.replace(new RegExp(source, flags2), (m, ...rest2) => {
-      const at = rest2.find((v) => typeof v === "number");
-      if (at <= tagStart && at + m.length >= tagEnd) return m;
-      return " ".repeat(m.length);
-    });
+    const view = source === FLAG_RE.source ? flagScanView(masked) : masked;
+    const spans = [];
+    for (const m of view.matchAll(new RegExp(source, flags2))) {
+      const at = m.index;
+      if (!(at <= tagStart && at + m[0].length >= tagEnd)) spans.push([at, at + m[0].length]);
+    }
+    for (const [from, to] of spans) masked = masked.slice(0, from) + " ".repeat(to - from) + masked.slice(to);
   }
   return masked;
 }
@@ -77724,7 +77945,7 @@ function fixRationaleBefore(sentence, idx) {
     start2 = ws < 0 ? idx : start2 + ws;
   }
   const win = masked.slice(start2, idx).replace(/\s+$/, "").replace(/[.!?]$/, "");
-  const scan2 = win.replace(/`[^`]*`/g, (s) => s.replace(/[.;!?—]/g, "_"));
+  const scan2 = win.replace(/`[^`]*`/g, (s) => s.replace(/[.;!?—]/g, "_")).replace(/\.(?=[\w/])/g, "_");
   const m = /[.;!?—][^.;!?—]*$/.exec(scan2);
   const clause = (m ? win.slice(m.index + 1) : win).replace(/\*\*|__/g, "").replace(/^\s*(?:[-*+]|\d+[.)])\s+/, "").replace(/\s+([:;,])/g, "$1").replace(/\s+/g, " ").trim();
   if (clause.endsWith(":")) return "";
@@ -77742,7 +77963,7 @@ function fixRationaleAfter(sentence, endIdx) {
   const residual = RESIDUAL_OPENER_RE.exec(win);
   if (residual) win = win.slice(0, residual.index);
   const stripped = win.replace(/^[\s—:–,-]+/, "");
-  const m = /^[^.;!?—]*/.exec(stripped);
+  const m = /^(?:[^.;!?]|\.(?=[\w/]))*/.exec(stripped);
   const clause = (m ? m[0] : stripped).replace(/\s+/g, " ").trim();
   if (/^(and|but|or|nor|so|yet|also|plus)\b/i.test(clause)) return "";
   return clause;
@@ -77885,7 +78106,7 @@ function* captureSentences(text) {
       yield line;
       continue;
     }
-    const flags2 = [...line.matchAll(new RegExp(FLAG_RE.source, FLAG_RE.flags))].map((m) => ({ start: m.index, end: m.index + m[0].length }));
+    const flags2 = [...flagScanView(line).matchAll(new RegExp(FLAG_RE.source, FLAG_RE.flags))].map((m) => ({ start: m.index, end: m.index + m[0].length }));
     let flag = 0;
     let start2 = 0;
     for (const boundary of line.matchAll(/(?<=[.!?])\s+(?!\(fix:)/g)) {
@@ -77917,12 +78138,14 @@ function parseInlineTagsWithDispositions(text) {
     });
     const sfield = sentence.replace(/\s+/g, " ").trim().slice(0, 160);
     const citeMatched = /* @__PURE__ */ new Set();
+    const flagSpans = [...flagScanView(sentence).matchAll(new RegExp(FLAG_RE.source, FLAG_RE.flags))].map((m) => [m.index, m.index + m[0].length]);
     CITE_GROUP_RE.lastIndex = 0;
     let g;
     while ((g = CITE_GROUP_RE.exec(sentence)) !== null) {
       citeMatched.add(g.index);
       let content = g[1];
       if (/^\s*pattern:/i.test(content)) continue;
+      if (/^\s*failed:/i.test(content)) continue;
       const fixM = FIX_PREFIX.exec(content);
       const causeM = fixM ? null : CAUSE_PREFIX.exec(content);
       const aidsM = fixM || causeM ? null : AIDS_PREFIX.exec(content);
@@ -77985,6 +78208,17 @@ function parseInlineTagsWithDispositions(text) {
       const verbThread = fixM?.[1] ?? causeM?.[1] ?? void 0;
       if (isFix) content = content.replace(FIX_PREFIX, "");
       else if (isCause) content = content.replace(CAUSE_PREFIX, "");
+      if (isFix) {
+        const joined = /[,;]\s*cause:\s*/i.exec(content);
+        if (joined) {
+          const causeBody = content.slice(joined.index + joined[0].length);
+          content = content.slice(0, joined.index);
+          const fixed = new RegExp(HANDLE_RE.source, "i").exec(content);
+          const symptom = fixed && !/^\s*\[/.test(causeBody) ? `${fixed[0]} ` : "";
+          const cause = parseCauseTag(`${symptom}${causeBody}`, sfield, verbThread, dispositions);
+          if (cause) out2.push(cause);
+        }
+      }
       if (isCause) {
         const cause = parseCauseTag(content, sfield, verbThread, dispositions);
         if (cause) out2.push(cause);
@@ -78023,6 +78257,8 @@ function parseInlineTagsWithDispositions(text) {
         const note = content.replace(/\s+/g, " ").trim();
         if (note.length >= FIX_RATIONALE_MIN)
           out2.push({ kind: "fix", fixRationale: note, sentence: sfield, ...verbThread ? { threadId: verbThread } : {} });
+        else if (verbThread && fixRationale && !flagSpans.some(([a2, b]) => a2 < g.index && g.index < b))
+          out2.push({ kind: "fix", fixRationale, sentence: sfield, threadId: verbThread });
         else dispositions.unparseable++;
       } else if (!isFix && !emittedHandle && BRACKETED_TOKEN_RE.test(content)) {
         dispositions.unparseable++;
@@ -78106,8 +78342,9 @@ function parseInlineTagsWithDispositions(text) {
       }
     }
     FLAG_RE.lastIndex = 0;
+    const flagView = flagScanView(sentence);
     let f;
-    while ((f = FLAG_RE.exec(sentence)) !== null) {
+    while ((f = FLAG_RE.exec(flagView)) !== null) {
       const flagThread = f[2];
       const raw3 = f[3].trim();
       if (/^vuln\b/i.test(raw3)) {
@@ -78224,7 +78461,7 @@ function parseInlineTagsWithDispositions(text) {
     let dm;
     while ((dm = DOMAIN_RE.exec(sentence)) !== null) {
       const raw3 = dm[1].replace(/\s+/g, " ").trim();
-      if (raw3.length >= 3) out2.push({ kind: "domain", domainText: raw3, sentence: sfield });
+      if (raw3.length >= 2) out2.push({ kind: "domain", domainText: raw3, sentence: sfield });
     }
     PACKAGE_RE.lastIndex = 0;
     let pk;
@@ -83212,7 +83449,7 @@ function createWatchBreaker(deps) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.21-dev.3918" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.21-dev.3930" : "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;

package/generalize-worker.mjs

@@ -15204,6 +15204,10 @@ CREATE INDEX IF NOT EXISTS nodes_anchor_hint_path ON nodes(json_extract(attrs_js
 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;
+-- Local nodes by the cloud twin their upload receipt recorded. Every burst /
+-- search fusion folds the Network copy of the caller's own knowledge back onto
+-- the local node; unindexed, the reverse lookup was a ~300ms attrs scan per call.
+CREATE INDEX IF NOT EXISTS nodes_cloud_node_id ON nodes(json_extract(attrs_json, '$.cloudNodeId')) 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
@@ -16173,6 +16177,19 @@ var SqliteGraphStore = class {
     ).get(attr, `%${marker}%`, limit);
     return { count: Number(r.count), total: Number(r.total) };
   }
+  liveNodeIdsByCloudNodeId(cloudIds) {
+    const out = /* @__PURE__ */ new Map();
+    const CHUNK = 900;
+    for (let i = 0; i < cloudIds.length; i += CHUNK) {
+      const slice = cloudIds.slice(i, i + CHUNK);
+      if (slice.length === 0) continue;
+      const rows = this.db.prepare(
+        `SELECT id, json_extract(attrs_json, '$.cloudNodeId') AS cloud FROM nodes INDEXED BY nodes_cloud_node_id WHERE json_extract(attrs_json, '$.cloudNodeId') IN (${slice.map(() => "?").join(",")}) AND valid_to IS NULL ORDER BY id`
+      ).all(...slice);
+      for (const r of rows) out.set(r.cloud, [...out.get(r.cloud) ?? [], r.id]);
+    }
+    return out;
+  }
   liveNodeIds(ids) {
     const live = /* @__PURE__ */ new Set();
     const CHUNK = 900;
@@ -16234,7 +16251,10 @@ var SqliteGraphStore = class {
     if (relPaths.length === 0) return [];
     const placeholders = relPaths.map(() => "?").join(",");
     const rows = this.db.prepare(
-      `SELECT * FROM nodes WHERE valid_to IS NULL AND json_extract(attrs_json, '$.relPath') IN (${placeholders})`
+      // INDEXED BY: unforced, the planner took nodes_live_page_rank and
+      // json-parsed every live row — 11–25s per reindexed file pair on the
+      // live store vs 7ms here (2026-10-08).
+      `SELECT * FROM nodes INDEXED BY nodes_relpath WHERE valid_to IS NULL AND json_extract(attrs_json, '$.relPath') IN (${placeholders})`
     ).all(...relPaths);
     return rows.map(rowToNode);
   }

package/package.json

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

package/pass-worker.mjs

@@ -26063,6 +26063,10 @@ CREATE INDEX IF NOT EXISTS nodes_anchor_hint_path ON nodes(json_extract(attrs_js
 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;
+-- Local nodes by the cloud twin their upload receipt recorded. Every burst /
+-- search fusion folds the Network copy of the caller's own knowledge back onto
+-- the local node; unindexed, the reverse lookup was a ~300ms attrs scan per call.
+CREATE INDEX IF NOT EXISTS nodes_cloud_node_id ON nodes(json_extract(attrs_json, '$.cloudNodeId')) 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
@@ -27032,6 +27036,19 @@ var SqliteGraphStore = class {
     ).get(attr, `%${marker}%`, limit);
     return { count: Number(r.count), total: Number(r.total) };
   }
+  liveNodeIdsByCloudNodeId(cloudIds) {
+    const out2 = /* @__PURE__ */ new Map();
+    const CHUNK = 900;
+    for (let i2 = 0; i2 < cloudIds.length; i2 += CHUNK) {
+      const slice = cloudIds.slice(i2, i2 + CHUNK);
+      if (slice.length === 0) continue;
+      const rows = this.db.prepare(
+        `SELECT id, json_extract(attrs_json, '$.cloudNodeId') AS cloud FROM nodes INDEXED BY nodes_cloud_node_id WHERE json_extract(attrs_json, '$.cloudNodeId') IN (${slice.map(() => "?").join(",")}) AND valid_to IS NULL ORDER BY id`
+      ).all(...slice);
+      for (const r of rows) out2.set(r.cloud, [...out2.get(r.cloud) ?? [], r.id]);
+    }
+    return out2;
+  }
   liveNodeIds(ids) {
     const live = /* @__PURE__ */ new Set();
     const CHUNK = 900;
@@ -27093,7 +27110,10 @@ var SqliteGraphStore = class {
     if (relPaths.length === 0) return [];
     const placeholders = relPaths.map(() => "?").join(",");
     const rows = this.db.prepare(
-      `SELECT * FROM nodes WHERE valid_to IS NULL AND json_extract(attrs_json, '$.relPath') IN (${placeholders})`
+      // INDEXED BY: unforced, the planner took nodes_live_page_rank and
+      // json-parsed every live row — 11–25s per reindexed file pair on the
+      // live store vs 7ms here (2026-10-08).
+      `SELECT * FROM nodes INDEXED BY nodes_relpath WHERE valid_to IS NULL AND json_extract(attrs_json, '$.relPath') IN (${placeholders})`
     ).all(...relPaths);
     return rows.map(rowToNode);
   }

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

@@ -1,6 +1,6 @@
 {
   "name": "errata-context",
-  "version": "2.0.21-dev.3918",
+  "version": "2.0.21-dev.3930",
   "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 @@
-b107a94e4e9828c1c6f57f4acb3e914b4e2ed683a0c75446defb85835e5010ce  .codex-plugin/plugin.json
+7e11496cf4ef348e9e19cd5d191ad21dd9e54860dcb0c7b67fccd266dde126d1  .codex-plugin/plugin.json
 a7bebae9fb01c838d6c75fc784129e28be571233fa66ff5ee8039b574f35ccf7  assets/icon.png
 fc38b64e4df1e0b72c35764bef6c4c05430d97c9009ad0ecc8a9e75b4deab232  configure-local.mjs
 73dc6028b3b070257c7c31f252d11e55a9e096f4aed0f187f10cb21716e1e6d7  dist/client.js