@inerrata-corporation/errata 2.0.23-dev.4863 → 2.0.23-dev.4864

package/errata.mjs

@@ -18892,10 +18892,10 @@ function wmCalibrationCells(store) {
     }
   })();
   for (const n of rows) {
-    const live3 = n.validTo === null;
+    const live4 = n.validTo === null;
     const prev = newest.get(n.logicalId);
-    if (prev && (prev.live || !live3 && prev.version >= n.version)) continue;
-    newest.set(n.logicalId, { version: n.version, live: live3, attrs: n.attrs });
+    if (prev && (prev.live || !live4 && prev.version >= n.version)) continue;
+    newest.set(n.logicalId, { version: n.version, live: live4, attrs: n.attrs });
   }
   for (const { attrs } of newest.values()) {
     const shown = num(attrs["shownCount"]);
@@ -22560,7 +22560,7 @@ CREATE INDEX IF NOT EXISTS nodes_revisit_true ON nodes(valid_from) WHERE json_ty
         return out2;
       }
       liveNodeIds(ids) {
-        const live3 = /* @__PURE__ */ new Set();
+        const live4 = /* @__PURE__ */ new Set();
         const CHUNK2 = 900;
         for (let i2 = 0; i2 < ids.length; i2 += CHUNK2) {
           const slice = ids.slice(i2, i2 + CHUNK2);
@@ -22568,9 +22568,9 @@ CREATE INDEX IF NOT EXISTS nodes_revisit_true ON nodes(valid_from) WHERE json_ty
           const rows = this.db.prepare(
             `SELECT id FROM nodes WHERE valid_to IS NULL AND id IN (${slice.map(() => "?").join(",")})`
           ).all(...slice);
-          for (const r of rows) live3.add(r.id);
+          for (const r of rows) live4.add(r.id);
         }
-        return live3;
+        return live4;
       }
       /**
        * Live edges WITH their endpoint labels and ids, resolved in ONE join.
@@ -22639,9 +22639,9 @@ CREATE INDEX IF NOT EXISTS nodes_revisit_true ON nodes(valid_from) WHERE json_ty
       // the indexer calls freezeNode inside its own store.transaction(). So this
       // method does NOT open a transaction — callers needing atomicity wrap it.
       freezeNode(liveId, t) {
-        const live3 = this.getNode(liveId);
-        if (!live3) return null;
-        const version3 = live3.version ?? 1;
+        const live4 = this.getNode(liveId);
+        if (!live4) return null;
+        const version3 = live4.version ?? 1;
         const frozenId = `${liveId}@v${version3}`;
         if (this.getNode(frozenId)) {
           this.stmts.advanceLive.run({ live_id: liveId, t });
@@ -22791,11 +22791,11 @@ function walk(store, opts) {
     }
   }
   best.delete(seed.id);
-  const ranked = [];
+  const ranked2 = [];
   for (const [id, r] of best) {
     const node2 = store.getNode(id);
     if (!node2) continue;
-    ranked.push({
+    ranked2.push({
       id,
       label: node2.label,
       description: node2.description,
@@ -22805,11 +22805,11 @@ function walk(store, opts) {
       // product of conductances along best path
     });
   }
-  ranked.sort(
+  ranked2.sort(
     (a, b) => b.relevance - a.relevance || a.hops - b.hops
   );
-  const truncated = ranked.length > limit;
-  return { seedId: seed.id, nodes: ranked.slice(0, limit), truncated };
+  const truncated = ranked2.length > limit;
+  return { seedId: seed.id, nodes: ranked2.slice(0, limit), truncated };
 }
 function findPath(store, opts) {
   const maxHops = opts.maxHops ?? 6;
@@ -24914,8 +24914,8 @@ function anchorNodeToDiff(store, nodeId, expectLabel, changedPaths, workspaceId2
 }
 function solutionForProblem(store, problemId) {
   const sols = store.outEdges(problemId, ["SOLVED_BY"]).map((e) => store.getNode(e.to)).filter((n) => n !== null);
-  const live3 = sols.filter((s) => s.validTo == null && !isAutoMinted(s));
-  const pick2 = (live3.length > 0 ? live3 : sols).reduce(
+  const live4 = sols.filter((s) => s.validTo == null && !isAutoMinted(s));
+  const pick2 = (live4.length > 0 ? live4 : sols).reduce(
     (best, s) => !best || s.createdAt > best.createdAt ? s : best,
     null
   );
@@ -25663,13 +25663,13 @@ function recallableCorpus(store) {
   let cache2 = bagCache.get(store);
   if (!cache2) bagCache.set(store, cache2 = /* @__PURE__ */ new Map());
   const docs = [];
-  const live3 = /* @__PURE__ */ new Set();
+  const live4 = /* @__PURE__ */ new Set();
   for (const row of store.selectNodes({ labels: RECALLABLE, attrs: RECALL_FILTER_KEYS })) {
     if (row.attrs["mergedInto"] !== void 0) continue;
     if (row.label === "Problem" && row.attrs["resolvedAt"] != null && !isConstraintProblem(row)) {
       continue;
     }
-    live3.add(row.id);
+    live4.add(row.id);
     let entry = cache2.get(row.id);
     if (!entry || entry.description !== row.description) {
       entry = { description: row.description, bag: retrievalTokens(row.description) };
@@ -25678,7 +25678,7 @@ function recallableCorpus(store) {
     if (entry.bag.length === 0) continue;
     docs.push({ id: row.id, descLength: row.description.length, bag: entry.bag });
   }
-  for (const id of cache2.keys()) if (!live3.has(id)) cache2.delete(id);
+  for (const id of cache2.keys()) if (!live4.has(id)) cache2.delete(id);
   return docs;
 }
 var FIELD_LINE, RECALLABLE, MIN_INTENT_TOKENS, DEFAULT_MIN_COVERAGE, RECALL_FILTER_KEYS, bagCache;
@@ -27057,7 +27057,7 @@ function communitySeeds(store, opts = {}) {
     byCommunity.set(cid, l);
   }
   if (byCommunity.size === 0) return [];
-  const ranked = [...byCommunity.entries()].map(([cid, mem]) => ({ cid, mem, fresh: Math.max(...mem.map((m) => m.ts)) })).sort((a, b) => b.fresh - a.fresh).slice(0, maxCommunities);
+  const ranked2 = [...byCommunity.entries()].map(([cid, mem]) => ({ cid, mem, fresh: Math.max(...mem.map((m) => m.ts)) })).sort((a, b) => b.fresh - a.fresh).slice(0, maxCommunities);
   const seeds = [];
   const seen = /* @__PURE__ */ new Set();
   const push = (id) => {
@@ -27065,7 +27065,7 @@ function communitySeeds(store, opts = {}) {
     seen.add(id);
     seeds.push(id);
   };
-  for (const { mem } of ranked) {
+  for (const { mem } of ranked2) {
     const ordered = [...mem].sort(
       (a, b) => a.pulled === b.pulled ? b.ts - a.ts : a.pulled ? -1 : 1
     );
@@ -31325,12 +31325,12 @@ function hasCloudCredential(cfg) {
 }
 function persistProfileTokens(profileName, t) {
   const current = loadConfig();
-  const live3 = current.installationProfiles[profileName];
-  if (!live3) return;
+  const live4 = current.installationProfiles[profileName];
+  if (!live4) return;
   current.installationProfiles = {
     ...current.installationProfiles,
     [profileName]: {
-      ...live3,
+      ...live4,
       accessToken: t.accessToken,
       ...t.refreshToken ? { refreshToken: t.refreshToken } : {}
     }
@@ -34221,11 +34221,11 @@ function bindCanonicalNeighbors(store, opts) {
       store.outEdges(p.id, ["MATCHES", "INSTANCE_OF", "RELATES_TO"]).map((e) => e.to)
     );
     if (existing.size >= k) continue;
-    const ranked = pool.filter(
+    const ranked2 = pool.filter(
       (c) => c.id !== p.id && !existing.has(c.id) && c.embedding.length === p.embedding.length && (c.attrs["embeddingVersion"] ?? "") === (p.attrs["embeddingVersion"] ?? "")
     ).map((c) => ({ c, s: cosine(p.embedding, c.embedding) })).filter((x) => x.s >= CANONICAL_BIND_MIN && x.s < NEMORI_DEDUP_COSINE).sort((a, b) => b.s - a.s);
     const picked = [];
-    for (const cand of ranked) {
+    for (const cand of ranked2) {
       if (picked.length + existing.size >= k) break;
       if (picked.some((q) => cosine(q.c.embedding, cand.c.embedding) >= NEMORI_DEDUP_COSINE)) continue;
       picked.push(cand);
@@ -35882,14 +35882,14 @@ function localBurst(store, seedId, opts = {}) {
   }).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, {
+  const live4 = seeds.filter((s) => s.weight > 0);
+  if (live4.length === 0) return [];
+  const { act, hopOf, viaOf } = spreadActivation(store, live4, {
     maxHops: opts.maxHops ?? 3,
     nodeCap: opts.nodeCap ?? 300,
     accumulate: true
   });
-  const seedIds = new Set(live3.map((s) => s.id));
+  const seedIds = new Set(live4.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;
@@ -36583,10 +36583,10 @@ function createSessionRegistry(opts = {}) {
     originSessions: () => [...origins.keys()],
     isOwn: (sessionId, viewer) => sessionId === viewer || parentOf.get(sessionId) === viewer,
     version(nowMs) {
-      let live3 = 0;
-      for (const id of lastSeen.keys()) if (ownLive(id, nowMs)) live3++;
-      if (live3 !== lastLiveCount) {
-        lastLiveCount = live3;
+      let live4 = 0;
+      for (const id of lastSeen.keys()) if (ownLive(id, nowMs)) live4++;
+      if (live4 !== lastLiveCount) {
+        lastLiveCount = live4;
         ver++;
       }
       return ver;
@@ -38083,7 +38083,7 @@ function lazySymbolLexicon(store) {
   const members = /* @__PURE__ */ new Map();
   const docs = /* @__PURE__ */ new Map();
   const entries = /* @__PURE__ */ new Map();
-  const member = (name2) => {
+  const member2 = (name2) => {
     if (!members.has(name2)) {
       const hit = isDistinctiveIdentifier(name2) ? store.firstLiveByNameOrQname(labels, name2) : null;
       members.set(name2, hit ? { kind: kindOf.get(hit.label), description: hit.description, qname: hit.qname } : null);
@@ -38104,13 +38104,13 @@ function lazySymbolLexicon(store) {
     }
     return docs.get(name2);
   };
-  const isKnown = (tok) => member(tok) !== null;
+  const isKnown = (tok) => member2(tok) !== null;
   let anySymbol;
   return {
     has: isKnown,
     get(name2) {
       if (!entries.has(name2)) {
-        const m = member(name2);
+        const m = member2(name2);
         let entry = null;
         if (m) {
           entry = { kind: m.kind };
@@ -39129,17 +39129,17 @@ async function rankHits(store, query, hits, opts = {}) {
       if (p != null && p !== i2 && best[p] > best[i2]) best[i2] = best[p];
     });
   }
-  const ranked = hits.map((h, i2) => {
+  const ranked2 = hits.map((h, i2) => {
     const r = rankKnowledge({ ...inputs[i2], ...best[i2] > own[i2] ? { inherited: best[i2] } : {} }, weights);
     return { hit: h, i: i2, r };
   });
-  ranked.sort((a, b) => b.r.score - a.r.score || a.i - b.i);
-  return ranked.map(({ hit, r }) => ({ ...hit, score: r.score, rank: r.components }));
+  ranked2.sort((a, b) => b.r.score - a.r.score || a.i - b.i);
+  return ranked2.map(({ hit, r }) => ({ ...hit, score: r.score, rank: r.components }));
 }
-function interleaveLanes(ranked, isKnowledge, limit) {
-  const lanes = [ranked.filter((r) => isKnowledge(r.label)), ranked.filter((r) => !isKnowledge(r.label))];
+function interleaveLanes(ranked2, isKnowledge, limit) {
+  const lanes = [ranked2.filter((r) => isKnowledge(r.label)), ranked2.filter((r) => !isKnowledge(r.label))];
   const out2 = [];
-  for (let i2 = 0; out2.length < limit && i2 < ranked.length; i2++) {
+  for (let i2 = 0; out2.length < limit && i2 < ranked2.length; i2++) {
     const round2 = lanes.flatMap((lane) => lane[i2] ? [lane[i2]] : []).sort((a, b) => (b.score ?? 0) - (a.score ?? 0));
     for (const hit of round2) if (out2.length < limit) out2.push(hit);
   }
@@ -39153,12 +39153,12 @@ async function rankDualNodes(store, query, nodes, cloudEvidence2) {
     const parent = n.via?.parentId;
     return parent ? { ...n, parentId: parent } : n;
   });
-  const ranked = await rankHits(store, query, withParents, cloudEvidence2 ? { cloudEvidence: cloudEvidence2 } : {});
-  return ranked.map(({ rank, score: score2, ...n }) => ({ ...n, score: score2, why: rankWhy(rank) }));
+  const ranked2 = await rankHits(store, query, withParents, cloudEvidence2 ? { cloudEvidence: cloudEvidence2 } : {});
+  return ranked2.map(({ rank, score: score2, ...n }) => ({ ...n, score: score2, why: rankWhy(rank) }));
 }
 async function rankSimilarLocal(store, seedText, hits) {
-  const ranked = await rankHits(store, seedQuery(seedText), hits.map((h) => ({ ...h, hops: 0 })));
-  return ranked.map(({ rank, score: score2, hops: _hops, ...h }) => ({ ...h, score: score2, why: rankWhy(rank) }));
+  const ranked2 = await rankHits(store, seedQuery(seedText), hits.map((h) => ({ ...h, hops: 0 })));
+  return ranked2.map(({ rank, score: score2, hops: _hops, ...h }) => ({ ...h, score: score2, why: rankWhy(rank) }));
 }
 function withCite(records, isKnowledge) {
   return records.map((r) => isKnowledge(String(r["label"])) ? { ...r, cite: String(r["id"]) } : r);
@@ -39180,6 +39180,104 @@ var init_one_search = __esm({
   }
 });
 
+// src/chain-complete.ts
+function fixesOf(store, problemId, causes) {
+  const own = store.outEdges(problemId, [...FIX_EDGES]).map((e) => e.to).filter((id) => live2(store, id));
+  if (own.length > 0) return own.map((id) => ({ id }));
+  const borrowed = /* @__PURE__ */ new Map();
+  for (const c of causes) {
+    for (const e of store.inEdges(c, ["CAUSED_BY"])) {
+      if (e.from === problemId || live2(store, e.from)?.label !== "Problem") continue;
+      for (const f of store.outEdges(e.from, [...FIX_EDGES])) if (!borrowed.has(f.to) && live2(store, f.to)) borrowed.set(f.to, e.from);
+    }
+  }
+  return [...borrowed].map(([id, via]) => ({ id, via }));
+}
+async function ranked(store, about, ids) {
+  const hits = ids.flatMap(({ id, via }) => {
+    const n = live2(store, id);
+    return n ? [{ id, label: n.label, name: n.description, hops: 0, ...via ? { via } : {} }] : [];
+  });
+  const order = hits.length > 1 ? await rankHits(store, about, hits) : hits;
+  return order.flatMap((h) => member(store, h.id, h.via) ?? []);
+}
+async function chainOf(store, problemId) {
+  const p = live2(store, problemId);
+  if (!p || p.label !== "Problem") return void 0;
+  const causes = store.outEdges(problemId, ["CAUSED_BY"]).map((e) => e.to).filter((id) => live2(store, id)?.label === "RootCause");
+  const [cause] = await ranked(store, p.description, causes.map((id) => ({ id })));
+  const fixIds = fixesOf(store, problemId, causes);
+  const [fix, ...rest2] = await ranked(store, [p.description, cause?.text ?? ""].join(" "), fixIds);
+  if (!cause && !fix) return void 0;
+  const alsoFixes = rest2.slice(0, ALSO_FIXES);
+  return {
+    ...cause ? { cause } : {},
+    ...fix ? { fix, fixes: fixIds.length } : {},
+    ...alsoFixes.length > 0 ? { alsoFixes } : {}
+  };
+}
+function statementOf(description) {
+  const s = description?.replace(/\s+@\s+\S+\s*$/, "").trim().toLowerCase();
+  return s ? s : void 0;
+}
+function searchChainsEnabled(env2 = process.env) {
+  return !/^(0|off|false|no)$/i.test((env2["ERRATA_SEARCH_CHAINS"] ?? "").trim());
+}
+async function completeChains(store, hits) {
+  if (!searchChainsEnabled()) return [...hits];
+  const idOf = (h) => String(h.id ?? "");
+  const isProblem = (h) => h.label === "Problem";
+  const chains = /* @__PURE__ */ new Map();
+  for (const h of hits) {
+    if (!isProblem(h)) continue;
+    const c = await chainOf(store, idOf(h));
+    if (c) chains.set(idOf(h), c);
+  }
+  const out2 = [];
+  const shownAt = /* @__PURE__ */ new Map();
+  const statementAt = /* @__PURE__ */ new Map();
+  const carried = /* @__PURE__ */ new Set();
+  for (const h of hits) {
+    const id = idOf(h);
+    if (carried.has(id)) continue;
+    const chain2 = chains.get(id);
+    const owner = chain2?.fix?.via;
+    const statement = isProblem(h) ? statementOf(live2(store, id)?.description) : void 0;
+    let into = owner && shownAt.has(owner) ? shownAt.get(owner) : out2.findIndex((o) => o.chain?.fix?.via === id);
+    if (into < 0 && statement && statementAt.has(statement)) into = statementAt.get(statement);
+    if (into >= 0) {
+      const at = out2[into];
+      const adopt = !at.chain?.fix && chain2?.fix ? { chain: { ...chain2, ...at.chain?.cause ? { cause: at.chain.cause } : {} } } : {};
+      out2[into] = { ...at, ...adopt, alsoReportedAs: [...at.alsoReportedAs ?? [], id] };
+      for (const m of membersOf(chain2)) carried.add(m.id);
+      continue;
+    }
+    if (statement) statementAt.set(statement, out2.length);
+    shownAt.set(id, out2.length);
+    out2.push(chain2 ? { ...h, chain: chain2 } : h);
+    for (const m of membersOf(chain2)) carried.add(m.id);
+  }
+  return out2;
+}
+var FIX_EDGES, live2, member, ALSO_FIXES, membersOf;
+var init_chain_complete = __esm({
+  "src/chain-complete.ts"() {
+    "use strict";
+    init_one_search();
+    FIX_EDGES = ["SOLVED_BY", "FIXED_BY"];
+    live2 = (store, id) => {
+      const n = store.getNode(id);
+      return n && n.validTo == null ? n : null;
+    };
+    member = (store, id, via) => {
+      const n = live2(store, id);
+      return n ? { id, text: n.description, ...via ? { via } : {} } : void 0;
+    };
+    ALSO_FIXES = 2;
+    membersOf = (c) => c ? [c.cause, c.fix, ...c.alsoFixes ?? []].filter((m) => m != null) : [];
+  }
+});
+
 // src/daemon-generalize-client.ts
 function daemonLoopbackUrl(lockPath = globalDaemonLock()) {
   const url2 = readDaemonLock(lockPath)?.webUiUrl;
@@ -39938,12 +40036,12 @@ async function incrementalReindex(store, rootPath, workspaceId2, changedAbsPaths
   if (changedIds.length > 0) {
     store.transaction(() => {
       for (const nid of changedIds) {
-        const live3 = store.getNode(nid);
-        if (!live3) continue;
-        const history = store.nodeHistory(live3.logicalId ?? nid);
+        const live4 = store.getNode(nid);
+        if (!live4) continue;
+        const history = store.nodeHistory(live4.logicalId ?? nid);
         const birth = history[0];
         if (!birth || birth.id === nid) continue;
-        const currentSim = live3.attrs["bodySimhash"];
+        const currentSim = live4.attrs["bodySimhash"];
         const birthSim = birth.attrs["bodySimhash"];
         if (!hasForkedDrift(currentSim, birthSim)) continue;
         const forkId = edgeId(nid, "FORKED_FROM", birth.id);
@@ -48169,12 +48267,12 @@ function reapOrphanedFiles(store, rootPath, workspaceId2, ignoreDirs = []) {
   if (listed === null) return { reaped: 0, symbolsClosed: 0, skipped: "no-git-listing" };
   if (listed.length === 0) return { reaped: 0, symbolsClosed: 0, skipped: "empty-listing" };
   const onDisk = new Set(listed);
-  const live3 = store.selectNodes({ labels: ["File"], attrs: ["workspaceId", "relPath"] }).filter((f) => f.attrs["workspaceId"] === workspaceId2);
-  const orphans = live3.filter((f) => {
+  const live4 = store.selectNodes({ labels: ["File"], attrs: ["workspaceId", "relPath"] }).filter((f) => f.attrs["workspaceId"] === workspaceId2);
+  const orphans = live4.filter((f) => {
     const rel = f.attrs["relPath"];
     return typeof rel === "string" && !onDisk.has(rel);
   });
-  const allowance = Math.max(ORPHAN_REAP_MIN_ALLOWANCE, live3.length * ORPHAN_REAP_MAX_FRACTION);
+  const allowance = Math.max(ORPHAN_REAP_MIN_ALLOWANCE, live4.length * ORPHAN_REAP_MAX_FRACTION);
   if (orphans.length > allowance) {
     return {
       reaped: 0,
@@ -48559,17 +48657,17 @@ function searchEntries(query, matches) {
   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));
+function withoutSymbolInternals(store, ranked2) {
+  const ids = new Set(ranked2.map((r) => r.id));
   const internal = /* @__PURE__ */ new Set();
-  for (const r of ranked) {
+  for (const r of ranked2) {
     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;
+  return internal.size > 0 ? ranked2.filter((r) => !internal.has(r.id)) : ranked2;
 }
 function searchWalkEnabled(env2 = process.env) {
   return !/^(0|off|false|no)$/i.test((env2["ERRATA_SEARCH_WALK"] ?? "").trim());
@@ -48584,11 +48682,11 @@ function searchGraphWalk(store, query, limit) {
     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]);
+  const ranked2 = [];
+  for (let i2 = 0; ranked2.length < limit && i2 < walked.length; i2++) {
+    for (const lane of lanes) if (lane[i2] && ranked2.length < limit) ranked2.push(lane[i2]);
   }
-  return ranked.map((r) => {
+  return ranked2.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(store, r.node);
@@ -48954,6 +49052,7 @@ var init_mcp = __esm({
     init_identity2();
     init_registry();
     init_dual_augment();
+    init_chain_complete();
     init_one_search();
     init_dual_burst();
     init_twin_index();
@@ -49068,7 +49167,7 @@ var init_mcp = __esm({
               limit
             });
             if (dual.status === "merged") {
-              const ranked = await rankHits(
+              const ranked2 = await rankHits(
                 store,
                 query,
                 dual.merged.nodes.map((n) => ({
@@ -49080,17 +49179,12 @@ var init_mcp = __esm({
                 })),
                 { cloudEvidence: dual.cloudEvidence }
               );
-              const chosen = interleaveLanes(ranked, isKnowledge, limit);
+              const chosen = interleaveLanes(ranked2, isKnowledge, limit);
               const why = new Map(chosen.map((n) => [n.id, rankWhy(n.rank)]));
               const formatted = formatDualNodes({ ...dual.merged, nodes: chosen.map(({ rank: _rank, viaText: _via, ...n }) => n) });
-              return {
-                query,
-                collectiveReachable: true,
-                collectiveStatus: "merged",
-                count: formatted.length,
-                corroborated: dual.merged.corroboratedCount,
-                collective: dual.merged.collectiveCount,
-                results: withLinks(
+              const results = withLinks(
+                store,
+                await completeChains(
                   store,
                   withCite(
                     formatted.map((r) => ({
@@ -49101,9 +49195,18 @@ var init_mcp = __esm({
                     isKnowledge
                   )
                 )
+              );
+              return {
+                query,
+                collectiveReachable: true,
+                collectiveStatus: "merged",
+                count: results.length,
+                corroborated: dual.merged.corroboratedCount,
+                collective: dual.merged.collectiveCount,
+                results
               };
             }
-            const local = withLinks(store, await rankLocal());
+            const local = withLinks(store, await completeChains(store, await rankLocal()));
             return {
               query,
               collectiveReachable: dual.status === "empty",
@@ -49113,7 +49216,7 @@ var init_mcp = __esm({
               results: local
             };
           }
-          return withLinks(store, await rankLocal());
+          return withLinks(store, await completeChains(store, await rankLocal()));
         }
       },
       {
@@ -49263,7 +49366,7 @@ var init_mcp = __esm({
           if (seedForBurst && seedForBurst.embedding.length === 0) {
             await ensureNodeEmbedded(store, id);
           }
-          const ranked = localBurst(store, id, {
+          const ranked2 = localBurst(store, id, {
             // Hold an embeddingless candidate's neutral semantic under the dual-burst
             // cloud cap so unknown local code can't outrank the capped collective (see
             // DUAL_BURST_SEMANTIC_NEUTRAL). No-op for local-only bursts.
@@ -49271,7 +49374,7 @@ var init_mcp = __esm({
             ...args2["maxHops"] != null ? { maxHops: Number(args2["maxHops"]) } : {},
             ...args2["limit"] != null ? { limit: Number(args2["limit"]) } : {}
           });
-          const localHits = ranked.map((r) => ({
+          const localHits = ranked2.map((r) => ({
             id: r.id,
             node: { label: r.node.label, description: r.node.description },
             score: r.score,
@@ -49504,8 +49607,8 @@ var init_mcp = __esm({
               if (!ex || node2.hops < ex.hops) merged.set(node2.id, node2);
             }
           }
-          const ranked = [...merged.values()].sort((a, b) => b.relevance - a.relevance);
-          return { found: true, seedId: id, nodes: ranked.slice(0, limit), truncated: ranked.length > limit };
+          const ranked2 = [...merged.values()].sort((a, b) => b.relevance - a.relevance);
+          return { found: true, seedId: id, nodes: ranked2.slice(0, limit), truncated: ranked2.length > limit };
         }
       },
       {
@@ -49766,8 +49869,8 @@ var init_mcp = __esm({
             };
           }
           const fanIn = store.inDegreeByType([...CODE_REACH_EDGES]);
-          const ranked = store.selectNodes({ labels: CODE }).map((n) => ({ id: n.id, label: n.label, name: n.description, fanIn: fanIn.get(n.id) ?? 0 })).sort((a, b) => b.fanIn - a.fanIn).slice(0, limit);
-          return { kind: "fan-in", items: ranked };
+          const ranked2 = store.selectNodes({ labels: CODE }).map((n) => ({ id: n.id, label: n.label, name: n.description, fanIn: fanIn.get(n.id) ?? 0 })).sort((a, b) => b.fanIn - a.fanIn).slice(0, limit);
+          return { kind: "fan-in", items: ranked2 };
         }
       },
       {
@@ -50290,8 +50393,8 @@ function formatBurstMd(r, opts) {
   lines.push("legend: \u25A3 local \xB7 \u25CC collective \xB7 \u2713 corroborated");
   lines.push("");
   lines.push(`## neighborhood (${r.results.length})`);
-  const ranked = [...r.results].sort((a, b) => b.score - a.score);
-  for (const n of ranked) {
+  const ranked2 = [...r.results].sort((a, b) => b.score - a.score);
+  for (const n of ranked2) {
     const usage = n.usageCount != null ? ` \xB7 ${n.usageCount} proj` : "";
     const rel = n.rel ? ` \xB7 ${n.rel}` : "";
     lines.push(
@@ -58292,8 +58395,8 @@ function fileRecall(store, relPath) {
   const priors = priorsForFile(store, relPath);
   if (!priors) return null;
   const pool = [...priors.openProblems, ...priors.constraints, ...priors.related];
-  const ranked = rankByRelevance(store, priors.file.id, pool.map((n) => n.id));
-  const rank = new Map(ranked.map((r, i2) => [r.id, i2]));
+  const ranked2 = rankByRelevance(store, priors.file.id, pool.map((n) => n.id));
+  const rank = new Map(ranked2.map((r, i2) => [r.id, i2]));
   const byRank = (a, b) => (rank.get(a.id) ?? 0) - (rank.get(b.id) ?? 0);
   priors.openProblems.sort(byRank);
   priors.constraints.sort(byRank);
@@ -58329,8 +58432,8 @@ ${lines.join("\n")}
 function editVerdict(store, relPath) {
   const priors = priorsForFile(store, relPath);
   if (!priors || priors.openProblems.length === 0) return null;
-  const ranked = rankByRelevance(store, priors.file.id, priors.openProblems.map((n) => n.id));
-  const rank = new Map(ranked.map((r, i2) => [r.id, i2]));
+  const ranked2 = rankByRelevance(store, priors.file.id, priors.openProblems.map((n) => n.id));
+  const rank = new Map(ranked2.map((r, i2) => [r.id, i2]));
   const asked = [...priors.openProblems].sort((a, b) => (rank.get(a.id) ?? 0) - (rank.get(b.id) ?? 0)).slice(0, 3);
   const lines = asked.map(
     (p) => closableByCaller(p) ? recallLine(p, `fixed: ${TAG_EXAMPLE.fix(p.id)} \xB7 not a real problem: retract it (block below) \xB7 still open: say nothing`) : recallLine(p, `another membrane's \u2014 not yours to close: ${TAG_EXAMPLE.confirm(p.id)} it held \xB7 ${TAG_EXAMPLE.refute(p.id)}`)
@@ -78129,11 +78232,11 @@ function isLive2(verb) {
 function nextHtml(n, opts) {
   if (!n) return "";
   const cmd2 = `errata ${n.verb}${n.arg ? " " + n.arg : ""}`;
-  const live3 = isLive2(n.verb);
-  if (!live3 && !opts.includeFutureVerbs) return "";
+  const live4 = isLive2(n.verb);
+  if (!live4 && !opts.includeFutureVerbs) return "";
   const hint = n.hint ? ` \u2014 ${esc3(n.hint)}` : "";
-  const cls = live3 ? "next" : "next soon";
-  const tag = live3 ? `<code>${esc3(cmd2)}</code>` : `<span class="vsoon">${esc3(cmd2)} \xB7 soon</span>`;
+  const cls = live4 ? "next" : "next soon";
+  const tag = live4 ? `<code>${esc3(cmd2)}</code>` : `<span class="vsoon">${esc3(cmd2)} \xB7 soon</span>`;
   return `<div class="${cls}">next: ${tag}${hint}</div>`;
 }
 function shell(title, body2) {
@@ -81442,8 +81545,8 @@ function createSubagentState() {
     for (const [id, a] of agents) if (nowMs - a.lastSeenMs > SUBAGENT_IDLE_TTL_MS) agents.delete(id);
     while (agents.size > MAX_AGENTS) agents.delete(agents.keys().next().value);
     for (const [sid, list] of pending) {
-      const live3 = list.filter((s) => nowMs - s.atMs <= SPAWN_CLAIM_TTL_MS);
-      if (live3.length) pending.set(sid, live3);
+      const live4 = list.filter((s) => nowMs - s.atMs <= SPAWN_CLAIM_TTL_MS);
+      if (live4.length) pending.set(sid, live4);
       else pending.delete(sid);
     }
   };
@@ -81525,12 +81628,12 @@ function walkIntent(store, intent, opts) {
   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(
+  const ranked2 = 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) {
+  for (const r of ranked2) {
     if (out2.length >= opts.limit) break;
     if (shown.has(r.id) || seedIds.has(r.id)) continue;
     const n = r.node;
@@ -84008,19 +84111,19 @@ import { appendFileSync as appendFileSync2, existsSync as existsSync23, readFile
 import { join as join27 } from "node:path";
 
 // src/isolate-census.ts
-var live2 = 0;
+var live3 = 0;
 var spawnedTotal = 0;
 var peak = 0;
 function noteIsolateSpawned() {
-  live2 += 1;
+  live3 += 1;
   spawnedTotal += 1;
-  if (live2 > peak) peak = live2;
+  if (live3 > peak) peak = live3;
 }
 function noteIsolateExited() {
-  if (live2 > 0) live2 -= 1;
+  if (live3 > 0) live3 -= 1;
 }
 function isolateCensus() {
-  return { live: live2, spawnedTotal, peak };
+  return { live: live3, spawnedTotal, peak };
 }
 
 // src/io-reads.ts
@@ -84245,8 +84348,8 @@ function recordEpisode(store, workspaceId2, t, delta, causal) {
         minted++;
       }
       if (s.change === "changed") {
-        const live3 = store.getNode(s.nodeId);
-        const prev = (live3?.version ?? 2) - 1;
+        const live4 = store.getNode(s.nodeId);
+        const prev = (live4?.version ?? 2) - 1;
         const frozenId = `${s.nodeId}@v${prev}`;
         if (store.getNode(frozenId)) {
           store.mergeEdge(producedEdge(id, frozenId, t));
@@ -87399,7 +87502,7 @@ var INTENT_TTL_MS = 15 * 60 * 1e3;
 function createIntentState(ttlMs = INTENT_TTL_MS) {
   const bySession = /* @__PURE__ */ new Map();
   let recent4 = null;
-  const live3 = (s, nowMs) => s !== void 0 && nowMs - s.atMs < ttlMs;
+  const live4 = (s, nowMs) => s !== void 0 && nowMs - s.atMs < ttlMs;
   return {
     set(sessionId, text, nowMs) {
       const trimmed = text.trim();
@@ -87413,7 +87516,7 @@ function createIntentState(ttlMs = INTENT_TTL_MS) {
     },
     get(sessionId, nowMs) {
       const s = bySession.get(sessionId);
-      return live3(s, nowMs) ? s.text : void 0;
+      return live4(s, nowMs) ? s.text : void 0;
     },
     mostRecent(nowMs) {
       if (!recent4) return void 0;
@@ -87515,17 +87618,17 @@ function saveWitnessQueue(path3, queue) {
 }
 function pruneWitnessQueueWithDispositions(queue, now) {
   const dropped = { expiredTtl: 0, exhaustedAttempts: 0, cappedOverflow: 0 };
-  const live3 = [];
+  const live4 = [];
   for (const w of queue) {
     if (now - w.ts >= WITNESS_TTL_MS) dropped.expiredTtl++;
     else if (w.attempts >= WITNESS_MAX_ATTEMPTS) dropped.exhaustedAttempts++;
-    else live3.push(w);
+    else live4.push(w);
   }
-  if (live3.length > WITNESS_QUEUE_CAP) {
-    dropped.cappedOverflow = live3.length - WITNESS_QUEUE_CAP;
-    return { queue: live3.slice(live3.length - WITNESS_QUEUE_CAP), dropped };
+  if (live4.length > WITNESS_QUEUE_CAP) {
+    dropped.cappedOverflow = live4.length - WITNESS_QUEUE_CAP;
+    return { queue: live4.slice(live4.length - WITNESS_QUEUE_CAP), dropped };
   }
-  return { queue: live3, dropped };
+  return { queue: live4, dropped };
 }
 function enqueueWitnessesWithDispositions(queue, fresh, now) {
   const byKey = new Map(queue.map((w) => [`${w.channel}:${w.witnessKey}`, w]));
@@ -88218,7 +88321,7 @@ function createWatchBreaker(deps) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.23-dev.4863" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.23-dev.4864" : "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;
@@ -91601,16 +91704,16 @@ function settleEdgeOutcomes(queue, sent, verdicts, now) {
     if (prior?.state === "parked") counts.edgesReparked++;
     else counts.edgesParked++;
   }
-  const live3 = [];
+  const live4 = [];
   for (const e of byKey.values()) {
     if (e.state === "parked" && now - e.ts >= EDGE_PARK_TTL_MS) {
       counts.edgesDroppedExpired++;
       continue;
     }
     if (e.state === "dropped" && now - (e.droppedAt ?? e.ts) >= tombstoneTtl(e)) continue;
-    live3.push(e);
+    live4.push(e);
   }
-  let next = live3;
+  let next = live4;
   if (next.length > EDGE_PARK_CAP) {
     const over = next.length - EDGE_PARK_CAP;
     const order = [...next].sort((a, b) => (a.state === b.state ? 0 : a.state === "dropped" ? -1 : 1) || a.ts - b.ts);
@@ -91860,8 +91963,8 @@ function mintPackageGraph(store, sbom, workspaceId2, ts) {
     for (const to of d.dependsOn) {
       if (!minted.has(to)) continue;
       const id = `edge_${digest({ from: d.ref, type: "DEPENDS_ON", to })}`.slice(0, 24);
-      const live3 = store.getEdge(id);
-      if (live3 && (live3.validTo ?? null) === null) {
+      const live4 = store.getEdge(id);
+      if (live4 && (live4.validTo ?? null) === null) {
         edges++;
         continue;
       }
@@ -92794,8 +92897,8 @@ function cloudWireId(n) {
 function buildCausalEdgeBackfill(store, profile, daemonVersion) {
   const edges = [];
   const seenEdge = /* @__PURE__ */ new Set();
-  const live3 = store.selectNodes({ labels: CAUSAL_LABELS, attrs: WIRE_ATTRS });
-  const byId = new Map(live3.map((n) => [n.id, n]));
+  const live4 = store.selectNodes({ labels: CAUSAL_LABELS, attrs: WIRE_ATTRS });
+  const byId = new Map(live4.map((n) => [n.id, n]));
   const wireIds = /* @__PURE__ */ new Map();
   const wireIdOf = (id) => {
     if (wireIds.has(id)) return wireIds.get(id);
@@ -92803,7 +92906,7 @@ function buildCausalEdgeBackfill(store, profile, daemonVersion) {
     wireIds.set(id, w);
     return w;
   };
-  for (const n of live3) {
+  for (const n of live4) {
     for (const e of store.outEdges(n.id, [...CAUSAL_EDGES2])) {
       if (seenEdge.has(e.id)) continue;
       seenEdge.add(e.id);
@@ -93474,9 +93577,9 @@ function saveCausalEdgeQueue(path3, queue) {
   }
 }
 function pruneCausalEdgeQueue(queue, now) {
-  const live3 = queue.filter((p) => now - p.ts < CAUSAL_EDGE_TTL_MS);
-  if (live3.length <= CAUSAL_EDGE_QUEUE_CAP) return live3;
-  return [...live3].sort((a, b) => a.ts - b.ts).slice(live3.length - CAUSAL_EDGE_QUEUE_CAP);
+  const live4 = queue.filter((p) => now - p.ts < CAUSAL_EDGE_TTL_MS);
+  if (live4.length <= CAUSAL_EDGE_QUEUE_CAP) return live4;
+  return [...live4].sort((a, b) => a.ts - b.ts).slice(live4.length - CAUSAL_EDGE_QUEUE_CAP);
 }
 
 // src/project-reanchor.ts
@@ -94731,7 +94834,7 @@ function narrativeSources(unit, group) {
   if (!group || group.length === 0) return [{ commitSha: unit.sha, text: message(unit).trim() }].filter((s) => s.text.length > 0);
   const members = group.filter((g) => g.groupSha === (unit.groupSha ?? unit.sha)).sort((a, b) => a.subIndex - b.subIndex);
   const source = members.length > 0 ? members : [...group].sort((a, b) => a.subIndex - b.subIndex);
-  return source.map((member) => ({ commitSha: member.sha, text: message(member).trim() })).filter((s) => s.text.length > 0);
+  return source.map((member2) => ({ commitSha: member2.sha, text: message(member2).trim() })).filter((s) => s.text.length > 0);
 }
 
 // src/git-batch.ts
@@ -96408,8 +96511,8 @@ function misfiledTarget(roots, home) {
   if (roots.includes(home)) return null;
   const tally = /* @__PURE__ */ new Map();
   for (const r of roots) tally.set(r, (tally.get(r) ?? 0) + 1);
-  const ranked = [...tally].sort((a, b) => b[1] - a[1]);
-  const [top, next] = ranked;
+  const ranked2 = [...tally].sort((a, b) => b[1] - a[1]);
+  const [top, next] = ranked2;
   if (!top || top[1] < FOCUS_QUORUM || next && next[1] === top[1]) return null;
   return top[0];
 }
@@ -103265,9 +103368,9 @@ async function gatherRepo(store, ws) {
   }
   let hotspots;
   if (byFile.size > 0) {
-    const ranked = [...byFile].sort((a, b) => b[1] - a[1]).slice(0, 6);
-    const maxC = ranked[0]?.[1] ?? 1;
-    hotspots = ranked.map(([file2, c]) => ({
+    const ranked2 = [...byFile].sort((a, b) => b[1] - a[1]).slice(0, 6);
+    const maxC = ranked2[0]?.[1] ?? 1;
+    hotspots = ranked2.map(([file2, c]) => ({
       file: file2.split(/[\\/]/).pop() ?? file2,
       problemCount: c,
       weight: c / maxC,

package/package.json

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

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

@@ -1,6 +1,6 @@
 {
   "name": "errata-context",
-  "version": "2.0.23-dev.4863",
+  "version": "2.0.23-dev.4864",
   "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 @@
-f59c13f62c676dc38ff4e530c9c84c0311604c29b16e4084605e5b4921e9af4b  .codex-plugin/plugin.json
+d2a34f333032bcc14b4e3da00eaa5038b377c3d0f1e279b9b245e4c1634d5992  .codex-plugin/plugin.json
 a7bebae9fb01c838d6c75fc784129e28be571233fa66ff5ee8039b574f35ccf7  assets/icon.png
 fc38b64e4df1e0b72c35764bef6c4c05430d97c9009ad0ecc8a9e75b4deab232  configure-local.mjs
 73dc6028b3b070257c7c31f252d11e55a9e096f4aed0f187f10cb21716e1e6d7  dist/client.js