@inerrata-corporation/errata 2.0.23-dev.4803 → 2.0.23-dev.4826

package/errata.mjs

@@ -5198,8 +5198,8 @@ var init_az = __esm({
 });
 
 // ../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/locales/be.js
-function getBelarusianPlural(count, one, few, many) {
-  const absCount = Math.abs(count);
+function getBelarusianPlural(count2, one, few, many) {
+  const absCount = Math.abs(count2);
   const lastDigit = absCount % 10;
   const lastTwoDigits = absCount % 100;
   if (lastTwoDigits >= 11 && lastTwoDigits <= 19) {
@@ -7113,8 +7113,8 @@ var init_hu = __esm({
 });
 
 // ../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/locales/hy.js
-function getArmenianPlural(count, one, many) {
-  return Math.abs(count) === 1 ? one : many;
+function getArmenianPlural(count2, one, many) {
+  return Math.abs(count2) === 1 ? one : many;
 }
 function withDefiniteArticle(word) {
   if (!word)
@@ -9229,8 +9229,8 @@ var init_pt = __esm({
 });
 
 // ../../node_modules/.pnpm/zod@4.3.6/node_modules/zod/v4/locales/ru.js
-function getRussianPlural(count, one, few, many) {
-  const absCount = Math.abs(count);
+function getRussianPlural(count2, one, few, many) {
+  const absCount = Math.abs(count2);
   const lastDigit = absCount % 10;
   const lastTwoDigits = absCount % 100;
   if (lastTwoDigits >= 11 && lastTwoDigits <= 19) {
@@ -15538,7 +15538,7 @@ function looksLikeSecretValue(raw2, quoted) {
   return raw2.length > 0;
 }
 function applyRule(text, rule, removed) {
-  let count = 0;
+  let count2 = 0;
   const out2 = text.replace(rule.re, (...args2) => {
     const m = args2.slice(0, -2);
     const r = rule.replace(m);
@@ -15551,10 +15551,10 @@ function applyRule(text, rule, removed) {
         if (literal2 && !literal2.includes("[redacted:")) removed.add(literal2);
       }
     }
-    count += 1;
+    count2 += 1;
     return r;
   });
-  return { text: out2, count };
+  return { text: out2, count: count2 };
 }
 function scrubHistoryText(text) {
   return scrubText(text);
@@ -18334,7 +18334,25 @@ var TAG_CANONICAL_ID_PREFIXES, TAG_HANDLE_SOURCE, TAG_THREAD_SOURCE, TAG_PLACEHO
 var init_tag_grammar = __esm({
   "../../packages/local-shared/src/tag-grammar.ts"() {
     "use strict";
-    TAG_CANONICAL_ID_PREFIXES = ["pat", "sol", "drc", "dcause", "dfix", "dprob", "dvuln", "prob", "claim", "err"];
+    TAG_CANONICAL_ID_PREFIXES = [
+      "motif_community_projn",
+      "motif_community_orgn",
+      "motif",
+      "projn",
+      "orgn",
+      "dtri",
+      "dom",
+      "pat",
+      "sol",
+      "drc",
+      "dcause",
+      "dfix",
+      "dprob",
+      "dvuln",
+      "prob",
+      "claim",
+      "err"
+    ];
     TAG_HANDLE_SOURCE = String.raw`\[([a-z0-9][\w-]{0,80})\]|((?:${TAG_CANONICAL_ID_PREFIXES.join("|")})_[0-9a-f]{6,})`;
     TAG_THREAD_SOURCE = String.raw`#([a-z][\w-]{0,63})`;
     TAG_PLACEHOLDER_HANDLES = /* @__PURE__ */ new Set([
@@ -19571,7 +19589,7 @@ var init_lineage_integrity = __esm({
 });
 
 // ../../packages/math/src/constants.ts
-var SURPRISE_MOMENTUM, SURPRISE_LEARNING_RATE, SURPRISE_LEARNING_RATE_SCALING, TIER_HALFLIFE_MULTIPLIER, HIT_RATE_SCALING_ALPHA, BASE_HALF_LIFE_SEQ, MOMENTUM_GATE_FLOOR, SURPRISE_RECENCY_LAMBDA_SEQ, NEMORI_SOFT_WRITE_MIN_COSINE, NEMORI_SOFT_WRITE_MAX_COSINE, NEMORI_DEDUP_COSINE, NEMORI_SOFT_ALPHA_MIN, NEMORI_SOFT_ALPHA_MAX, NEMORI_HIGH_SURPRISE_THRESHOLD, NEMORI_PREDICTION_FLOOR, REVIEW_SURPRISE_THRESHOLD, REVIEW_HITS_THRESHOLD;
+var SURPRISE_MOMENTUM, SURPRISE_LEARNING_RATE, SURPRISE_LEARNING_RATE_SCALING, TIER_HALFLIFE_MULTIPLIER, HIT_RATE_SCALING_ALPHA, BASE_HALF_LIFE_SEQ, MOMENTUM_GATE_FLOOR, EVIDENCE_HALFLIFE_SEQ, EVIDENCE_ACCEPTED_HALFLIFE_MULT, EVIDENCE_DECAY_FLOOR, CORROBORATION_WEIGHT, SURPRISE_RECENCY_LAMBDA_SEQ, NEMORI_SOFT_WRITE_MIN_COSINE, NEMORI_SOFT_WRITE_MAX_COSINE, NEMORI_DEDUP_COSINE, NEMORI_SOFT_ALPHA_MIN, NEMORI_SOFT_ALPHA_MAX, NEMORI_HIGH_SURPRISE_THRESHOLD, NEMORI_PREDICTION_FLOOR, REVIEW_SURPRISE_THRESHOLD, REVIEW_HITS_THRESHOLD;
 var init_constants = __esm({
   "../../packages/math/src/constants.ts"() {
     "use strict";
@@ -19586,6 +19604,10 @@ var init_constants = __esm({
     HIT_RATE_SCALING_ALPHA = 0.5;
     BASE_HALF_LIFE_SEQ = 500;
     MOMENTUM_GATE_FLOOR = 0.5;
+    EVIDENCE_HALFLIFE_SEQ = 500;
+    EVIDENCE_ACCEPTED_HALFLIFE_MULT = 1.5;
+    EVIDENCE_DECAY_FLOOR = 0.3;
+    CORROBORATION_WEIGHT = 0.3;
     SURPRISE_RECENCY_LAMBDA_SEQ = 36e-4;
     NEMORI_SOFT_WRITE_MIN_COSINE = 0.8;
     NEMORI_SOFT_WRITE_MAX_COSINE = 0.88;
@@ -19686,9 +19708,23 @@ var init_momentum = __esm({
 });
 
 // ../../packages/math/src/persistence.ts
+function reinforcementFactor(count2) {
+  const n = Math.max(0, count2 ?? 0);
+  return 1 + REINFORCEMENT_ALPHA * Math.tanh(n / REINFORCEMENT_K);
+}
+function contradictionFactor(pressure) {
+  const p = Math.max(0, pressure ?? 0);
+  return 1 - CONTRADICTION_MAX_DAMPENER * Math.tanh(p / CONTRADICTION_K);
+}
+var REINFORCEMENT_ALPHA, REINFORCEMENT_K, SUPERSESSION_DAMPENER, CONTRADICTION_MAX_DAMPENER, CONTRADICTION_K;
 var init_persistence = __esm({
   "../../packages/math/src/persistence.ts"() {
     "use strict";
+    REINFORCEMENT_ALPHA = 0.3;
+    REINFORCEMENT_K = 20;
+    SUPERSESSION_DAMPENER = 0.7;
+    CONTRADICTION_MAX_DAMPENER = 0.25;
+    CONTRADICTION_K = 10;
   }
 });
 
@@ -19731,6 +19767,45 @@ var init_decay = __esm({
 });
 
 // ../../packages/math/src/uncertainty.ts
+function evidenceDecaySeq(referenceSeq, currentIngestSeq, opts) {
+  if (referenceSeq == null || currentIngestSeq == null) return 1;
+  const delta = Math.max(0, currentIngestSeq - referenceSeq);
+  const halfLife = EVIDENCE_HALFLIFE_SEQ * (opts?.isAccepted ? EVIDENCE_ACCEPTED_HALFLIFE_MULT : 1);
+  const raw2 = Math.pow(0.5, delta / halfLife);
+  return Math.max(EVIDENCE_DECAY_FLOOR, Math.min(1, raw2));
+}
+function computeNodeUncertainty(node2, currentIngestSeq) {
+  const referenceSeq = node2.lastValidatedAtSeq ?? node2.createdAtSeq;
+  const decay = evidenceDecaySeq(referenceSeq, currentIngestSeq, {
+    isAccepted: node2.validated === true
+  });
+  const acceptedCount = Math.max(0, node2.acceptedCount ?? 0);
+  const corroborationCount = Math.max(0, node2.corroborationCount ?? 0);
+  const failureReportCount = Math.max(0, node2.failureReportCount ?? 0);
+  const decayedValidations = (acceptedCount + CORROBORATION_WEIGHT * corroborationCount) * decay;
+  const decayedFailures = failureReportCount * decay;
+  const alpha = 1 + decayedValidations;
+  const beta = 1 + decayedFailures;
+  const rawUncertainty = beta / (alpha + beta);
+  const uncertainty = Number.isFinite(rawUncertainty) ? rawUncertainty : 0.5;
+  const rawVariance = alpha * beta / ((alpha + beta) ** 2 * (alpha + beta + 1));
+  const variance = Number.isFinite(rawVariance) ? rawVariance : 0;
+  return {
+    nodeId: node2.id,
+    uncertainty: Math.max(0, Math.min(1, uncertainty)),
+    alpha,
+    beta,
+    variance,
+    components: {
+      decayedValidations,
+      decayedFailures,
+      priorStrength: alpha + beta
+    }
+  };
+}
+function uncertaintyAdjustedScore(originalScore, uncertainty) {
+  return originalScore * (1.25 - 0.5 * uncertainty);
+}
 var init_uncertainty = __esm({
   "../../packages/math/src/uncertainty.ts"() {
     "use strict";
@@ -20453,6 +20528,82 @@ var init_pagerank_local = __esm({
   }
 });
 
+// ../../packages/math/src/rank-knowledge.ts
+function rankKnowledge(input, weights) {
+  const w = { ...DEFAULT_RANK_KNOWLEDGE_WEIGHTS, ...weights };
+  const semantic = input.semantic == null || !Number.isFinite(input.semantic) ? null : clamp012((input.semantic - w.semanticFloor) / (1 - w.semanticFloor));
+  const lexical = clamp012(input.lexical);
+  const own = semantic == null ? lexical : 1 - (1 - semantic) * (1 - lexical);
+  const relevance = Math.max(own, clamp012(input.inherited ?? 0));
+  const hop = Math.max(w.hopFloor, 1 - w.hopPenalty * Math.max(0, input.hops ?? 0));
+  const e = input.evidence ?? {};
+  const persistence = reinforcementFactor(e.reinforcementCount) * contradictionFactor(e.contradictionPressure) * supersessionFactor(e.supersededBy);
+  const { uncertainty } = computeNodeUncertainty({
+    id: "",
+    acceptedCount: e.acceptedCount ?? 0,
+    corroborationCount: e.corroborationCount ?? 0,
+    failureReportCount: e.failureReportCount ?? 0
+  });
+  const reliability = uncertaintyAdjustedScore(1, uncertainty);
+  return {
+    score: relevance * hop * persistence * reliability,
+    components: { relevance, semantic, lexical, hop, persistence, reliability, uncertainty }
+  };
+}
+function supersessionFactor(supersededBy) {
+  const n = Math.max(0, supersededBy ?? 0);
+  return 1 - (1 - SUPERSESSION_DAMPENER) * (1 - Math.exp(-n));
+}
+function termCoverage(terms, text, weightOf) {
+  if (terms.length === 0) return 0;
+  const hay = text.toLowerCase();
+  let total = 0;
+  let held = 0;
+  for (const t of terms) {
+    const wt = Math.max(0, weightOf(t));
+    total += wt;
+    if (hay.includes(t.toLowerCase())) held += wt;
+  }
+  return total > 0 ? held / total : 0;
+}
+function poolEvidence(a, b) {
+  if (!a) return b;
+  if (!b) return a;
+  const keys = ["acceptedCount", "corroborationCount", "failureReportCount", "contradictionPressure", "reinforcementCount", "supersededBy"];
+  const out2 = {};
+  for (const k of keys) out2[k] = Math.max(a[k] ?? 0, b[k] ?? 0);
+  return out2;
+}
+var DEFAULT_RANK_KNOWLEDGE_WEIGHTS, clamp012;
+var init_rank_knowledge = __esm({
+  "../../packages/math/src/rank-knowledge.ts"() {
+    "use strict";
+    init_persistence();
+    init_uncertainty();
+    DEFAULT_RANK_KNOWLEDGE_WEIGHTS = {
+      semanticFloor: 0.5,
+      hopPenalty: 0.15,
+      hopFloor: 0.3
+    };
+    clamp012 = (x) => x < 0 ? 0 : x > 1 ? 1 : x;
+  }
+});
+
+// ../../packages/math/src/reader-evidence.ts
+var FIELD_CODES, FIELDS;
+var init_reader_evidence = __esm({
+  "../../packages/math/src/reader-evidence.ts"() {
+    "use strict";
+    FIELD_CODES = {
+      a: "acceptedCount",
+      c: "corroborationCount",
+      f: "failureReportCount",
+      p: "contradictionPressure"
+    };
+    FIELDS = Object.values(FIELD_CODES);
+  }
+});
+
 // ../../packages/math/src/index.ts
 var init_src3 = __esm({
   "../../packages/math/src/index.ts"() {
@@ -20480,6 +20631,8 @@ var init_src3 = __esm({
     init_motif_gate();
     init_bko();
     init_pagerank_local();
+    init_rank_knowledge();
+    init_reader_evidence();
   }
 });
 
@@ -21883,11 +22036,11 @@ CREATE INDEX IF NOT EXISTS nodes_revisit_true ON nodes(valid_from) WHERE json_ty
        *  kept with the change-feed reading of the rows it counts — triggers bump it on
        *  every write from any connection, so a hit is exact, not a TTL guess. */
       counts = /* @__PURE__ */ new Map();
-      countAt(key, scopes, count) {
+      countAt(key, scopes, count2) {
         const seq = readChangeSeq(this.db, scopes);
         const hit = this.counts.get(key);
         if (hit && hit.seq === seq) return hit.n;
-        const n = count();
+        const n = count2();
         this.counts.set(key, { seq, n });
         return n;
       }
@@ -24318,7 +24471,7 @@ function recordVulnerabilityCause(store, findingId, causes, ts) {
   const finding = store.getNode(findingId);
   if (finding?.label !== "Vulnerability") return 0;
   let from = findingId;
-  let count = 0;
+  let count2 = 0;
   for (const description of causes) {
     if (isPlaceholderStatement(description)) continue;
     const id = genericCanonicalId("dcause", { findingId, description: description.trim() });
@@ -24330,9 +24483,9 @@ function recordVulnerabilityCause(store, findingId, causes, ts) {
     }));
     mergeEdge(store, from, id, "CAUSED_BY", ts);
     from = id;
-    count++;
+    count2++;
   }
-  return count;
+  return count2;
 }
 function canonicalizePatternText(name2) {
   const stripped = name2.replace(/^\s*pattern(?:\s*[×x]\s*\d+)?\s*(?:\(exemplar\))?\s*[:—–-]\s*/i, "").replace(/\s+/g, " ").trim();
@@ -24648,6 +24801,15 @@ function isFragmentFixNote(note) {
 function isAutoMinted(n) {
   return isEditPlaceholderSolution(n);
 }
+function sameFixStatement(a, b) {
+  const words = (t) => new Set(t.toLowerCase().split(/[^a-z0-9_]+/).filter((w) => w.length >= 3));
+  const x = words(a);
+  const y = words(b);
+  if (x.size === 0 || y.size === 0) return solutionTextKey(a) === solutionTextKey(b);
+  let shared = 0;
+  for (const w of x) if (y.has(w)) shared++;
+  return shared / (x.size + y.size - shared) >= SAME_FIX_JACCARD;
+}
 function solutionTextKey(text) {
   return text.trim().replace(/\s+/g, " ").toLowerCase();
 }
@@ -24674,7 +24836,7 @@ function priorsForFile(store, relPath) {
   const constraints = [];
   const resolvedProblems = [];
   const seenProblem = /* @__PURE__ */ new Set();
-  const related = /* @__PURE__ */ new Map();
+  const related2 = /* @__PURE__ */ new Map();
   const anchorEdges = [
     ...store.inEdges(file2.id, ["ANCHORED_AT"]),
     ...store.outEdges(file2.id, ["DEFINES"]).flatMap((d) => store.inEdges(d.to, ["ANCHORED_AT"]))
@@ -24691,14 +24853,14 @@ function priorsForFile(store, relPath) {
         resolvedProblems.push(n);
       }
     } else if (CITABLE_PRIOR_LABELS.has(n.label) && !isAutoMinted(n)) {
-      related.set(n.id, n);
+      related2.set(n.id, n);
     }
   }
   const solutionsByProblem = /* @__PURE__ */ new Map();
   for (const p of [...openProblems, ...constraints, ...resolvedProblems]) {
     for (const e of store.outEdges(p.id, ["SOLVED_BY", "CAUSED_BY", "INSTANCE_OF"])) {
       const n = store.getNode(e.to);
-      if (n && CITABLE_PRIOR_LABELS.has(n.label) && !isAutoMinted(n)) related.set(n.id, n);
+      if (n && CITABLE_PRIOR_LABELS.has(n.label) && !isAutoMinted(n)) related2.set(n.id, n);
       if (n && n.label === "Solution" && e.type === "SOLVED_BY" && !isAutoMinted(n)) {
         const list = solutionsByProblem.get(p.id) ?? [];
         if (!list.some((s) => s.id === n.id)) list.push(n);
@@ -24706,7 +24868,7 @@ function priorsForFile(store, relPath) {
       }
     }
   }
-  if (openProblems.length === 0 && constraints.length === 0 && resolvedProblems.length === 0 && related.size === 0)
+  if (openProblems.length === 0 && constraints.length === 0 && resolvedProblems.length === 0 && related2.size === 0)
     return null;
   const recentFirst = (a, b) => (b.lastUpdatedAt ?? 0) - (a.lastUpdatedAt ?? 0);
   openProblems.sort(recentFirst);
@@ -24719,7 +24881,7 @@ function priorsForFile(store, relPath) {
     openProblems,
     constraints,
     resolvedProblems,
-    related: [...related.values()],
+    related: [...related2.values()],
     solutionsByProblem
   };
 }
@@ -24747,8 +24909,13 @@ function anchorNodeToDiff(store, nodeId, expectLabel, changedPaths, workspaceId2
   return n;
 }
 function solutionForProblem(store, problemId) {
-  const e = store.outEdges(problemId, ["SOLVED_BY"])[0];
-  return e ? e.to : null;
+  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(
+    (best, s) => !best || s.createdAt > best.createdAt ? s : best,
+    null
+  );
+  return pick2 ? pick2.id : null;
 }
 function anchorProblemToWorkingFile(store, problemId, relPath, workspaceId2, ts, provenance = "edited", opts = {}) {
   const p = store.getNode(problemId);
@@ -24932,9 +25099,9 @@ function upgradeAnchorHints(store, workspaceId2, ts) {
   }
   return { upgraded, standing, unresolvable, blocked };
 }
-function resolveDesignProblemByStatement(store, statement, fixNote, t) {
+function resolveDesignProblemByStatement(store, statement, fixNote, t, session) {
   const problemId = identityId({ kind: "DesignProblem", statement });
-  return closeDesignProblem(store, problemId, fixNote, t);
+  return closeDesignProblem(store, problemId, fixNote, t, session);
 }
 function closableByCaller(node2) {
   if (node2.attrs["source"] !== "cloud") return true;
@@ -24944,17 +25111,19 @@ function closableByCaller(node2) {
 function isVerdictable(node2) {
   return node2.label === "Problem" && node2.attrs["resolvedAt"] == null && (node2.validTo ?? null) === null && !isConstraintProblem(node2) && node2.attrs["kind"] !== "todo";
 }
-function resolveDesignProblemById(store, id, fixNote, t) {
-  return closeDesignProblem(store, id.trim(), fixNote, t);
+function resolveDesignProblemById(store, id, fixNote, t, session) {
+  return closeDesignProblem(store, id.trim(), fixNote, t, session);
 }
-function closeDesignProblem(store, problemId, fixNote, t) {
+function closeDesignProblem(store, problemId, fixNote, t, session) {
   const p = store.getNode(problemId);
   if (!p || p.label !== "Problem" && p.label !== "Vulnerability") return false;
   if (!closableByCaller(p)) return false;
   if (p.attrs["resolvedAs"]) return false;
   if (fixNote?.trim() && !isFragmentFixNote(fixNote)) {
     const sols = store.outEdges(problemId, ["SOLVED_BY"]).map((e) => store.getNode(e.to)).filter((n) => n !== null);
-    if (sols.every((s) => isAutoMinted(s))) {
+    const real = sols.filter((s) => !isAutoMinted(s) && s.validTo == null);
+    const secondAnswer = session != null && real.length > 0 && real.every((s) => !(s.attrs["sources"] ?? []).includes(session)) && !real.some((s) => sameFixStatement(s.description, fixNote));
+    if (real.length === 0 || secondAnswer) {
       const reuse = p.label === "Vulnerability" ? null : findReusableSolution(store, fixNote);
       if (reuse) {
         mergeEdge(store, problemId, reuse.id, "SOLVED_BY", t);
@@ -24964,7 +25133,9 @@ function closeDesignProblem(store, problemId, fixNote, t) {
           buildNode(store, solId, "Solution", fixNote.trim(), t, {
             source: "convo",
             provisional: false,
-            ...p.label === "Vulnerability" ? { privateFinding: problemId, sources: p.attrs["sources"] } : {}
+            // Who stated the fix: a second answer is told from a re-witness by it,
+            // and the self-corroboration belt reads it (sources[0] = the minting session).
+            ...p.label === "Vulnerability" ? { privateFinding: problemId, sources: p.attrs["sources"] } : session ? { sources: [session] } : {}
           })
         );
         mergeEdge(store, problemId, solId, "SOLVED_BY", t);
@@ -25271,7 +25442,7 @@ function exposureOutcomeAttrs(node2, exposure, at) {
     lastOutcomeAt: typeof prev === "number" ? Math.max(prev, at.ts) : at.ts
   };
 }
-var DESIGN_PROMOTE_AT, ANCHOR_LABELS, ANCHOR_KEYS, STATEMENT_ALIAS_CAP, RECURRENCE_DEBOUNCE_MS, PATTERN_DEDUP_COSINE, PATTERN_ALIAS_CAP, DEDUP_STOPWORDS, SAME_ANCHOR_DEDUP_JACCARD, EMPTY_FOLD_REPORT, SAME_ANCHOR_SCOUT_AUTO_COSINE, SAME_ANCHOR_SCOUT_MIN_COSINE, SAME_ANCHOR_NOMINATE_JACCARD, REOPEN_MIN_SOURCES, RECURRENCE_SOURCES_CAP, CITABLE_PRIOR_LABELS, MAX_ANCHOR_FILES, ENCLOSING_SYMBOL_KINDS, ENCLOSING_WALK_DEPTH, MEMBER_VISIBILITIES, FIX_CANDIDATE_ASK_LIMIT, RECENCY_BANDS, EXPOSURE_LOG_MAX, EXPOSURE_LOG_KEYS;
+var DESIGN_PROMOTE_AT, ANCHOR_LABELS, ANCHOR_KEYS, STATEMENT_ALIAS_CAP, RECURRENCE_DEBOUNCE_MS, PATTERN_DEDUP_COSINE, PATTERN_ALIAS_CAP, DEDUP_STOPWORDS, SAME_ANCHOR_DEDUP_JACCARD, EMPTY_FOLD_REPORT, SAME_ANCHOR_SCOUT_AUTO_COSINE, SAME_ANCHOR_SCOUT_MIN_COSINE, SAME_ANCHOR_NOMINATE_JACCARD, REOPEN_MIN_SOURCES, RECURRENCE_SOURCES_CAP, CITABLE_PRIOR_LABELS, SAME_FIX_JACCARD, MAX_ANCHOR_FILES, ENCLOSING_SYMBOL_KINDS, ENCLOSING_WALK_DEPTH, MEMBER_VISIBILITIES, FIX_CANDIDATE_ASK_LIMIT, RECENCY_BANDS, EXPOSURE_LOG_MAX, EXPOSURE_LOG_KEYS;
 var init_design_problem = __esm({
   "../../packages/local-graph/src/design-problem.ts"() {
     "use strict";
@@ -25337,6 +25508,7 @@ var init_design_problem = __esm({
       "Technique",
       "AntiPattern"
     ]);
+    SAME_FIX_JACCARD = 0.5;
     MAX_ANCHOR_FILES = 5;
     ENCLOSING_SYMBOL_KINDS = /* @__PURE__ */ new Set([
       "Function",
@@ -25359,6 +25531,58 @@ var init_design_problem = __esm({
   }
 });
 
+// ../../packages/local-graph/src/lifecycle.ts
+function supersedersOf(store, id) {
+  const out2 = [];
+  for (const e of store.inEdges(id, ["SUPERSEDES"])) {
+    if (e.from === id) continue;
+    const s = store.getNode(e.from);
+    if (!s || s.validTo != null || s.label !== "Solution" || netRefuted(s)) continue;
+    out2.push(s.id);
+  }
+  return out2;
+}
+function lifecycleOf(store, node2) {
+  const a = node2.attrs;
+  const confirmations = count(a["confirmations"]);
+  const refutations = refutesOf(a);
+  const supersededBy = node2.label === "Solution" ? supersedersOf(store, node2.id) : [];
+  const reasons = a["refuteReasons"];
+  const base = { supersededBy, confirmations, refutations };
+  if (supersededBy.length > 0) return { ...base, state: "superseded" };
+  if (refutations > confirmations) return { ...base, state: "refuted", ...reasons?.[0] ? { refutedWhy: reasons[0] } : {} };
+  if (a["resolutionSuspect"] === true && a["resolvedAt"] != null) return { ...base, state: "regression-suspect" };
+  if (confirmations > 0 || a["fixHeldConfirmedAt"] != null && a["resolvedAt"] != null) return { ...base, state: "held" };
+  if (a["resolvedAt"] != null && a["resolvedAs"] == null) return { ...base, state: "resolved" };
+  return base;
+}
+function lifecycleNote(l, cite = (id) => id) {
+  switch (l.state) {
+    case "superseded":
+      return `superseded by ${l.supersededBy.map(cite).join(", ")} \u2014 prefer that fix`;
+    case "refuted":
+      return `refuted ${l.refutations}\xD7${l.refutedWhy ? ` \u2014 ${l.refutedWhy}` : ""}`;
+    case "regression-suspect":
+      return "resolved, but the problem may have come back \u2014 check before relying on the fix";
+    case "held":
+      return l.confirmations > 0 ? `held \u2014 confirmed by ${l.confirmations} session${l.confirmations === 1 ? "" : "s"}` : "held \u2014 the fix was confirmed to still hold";
+    default:
+      return void 0;
+  }
+}
+var count, refutesOf, netRefuted;
+var init_lifecycle = __esm({
+  "../../packages/local-graph/src/lifecycle.ts"() {
+    "use strict";
+    count = (v) => {
+      const n = Number(v);
+      return Number.isFinite(n) && n > 0 ? n : 0;
+    };
+    refutesOf = (a) => Math.max(count(a["refutations"]), a["refutedAt"] != null ? 1 : 0);
+    netRefuted = (n) => refutesOf(n.attrs) > count(n.attrs["confirmations"]);
+  }
+});
+
 // ../../packages/local-graph/src/intent.ts
 function parseIntentFences(text) {
   const out2 = [];
@@ -27346,24 +27570,24 @@ function evaluateFed(store, d, stamps) {
   if (d.fedIncoming && incomingRows) {
     const targets = new Set(store.liveEdgeTargets(d.fedIncoming.edgeTypes));
     const rows = d.fedIncoming.cloudOnly ? incomingRows.filter((r) => r.cloud) : incomingRows;
-    const count2 = rows.filter((r) => targets.has(r.id)).length;
-    return { count: count2, total: rows.length, fraction: rows.length === 0 ? 0 : count2 / rows.length };
+    const count3 = rows.filter((r) => targets.has(r.id)).length;
+    return { count: count3, total: rows.length, fraction: rows.length === 0 ? 0 : count3 / rows.length };
   }
   if (d.fedIncoming) {
-    const { count: count2, total } = store.incomingEdgeCoverage?.(
+    const { count: count3, total } = store.incomingEdgeCoverage?.(
       d.fedIncoming.label,
       d.fedIncoming.edgeTypes,
       d.fedIncoming.cloudOnly
     ) ?? { count: 0, total: 0 };
-    return { count: count2, total, fraction: total === 0 ? 0 : count2 / total };
+    return { count: count3, total, fraction: total === 0 ? 0 : count3 / total };
   }
   if (d.fedEdges) {
-    const { count: count2, total } = store.recentEdgeAttrCoverage(
+    const { count: count3, total } = store.recentEdgeAttrCoverage(
       d.fedEdges.marker,
       d.fedEdges.attr,
       d.fedEdges.recent
     );
-    return { count: count2, total, fraction: total === 0 ? 0 : count2 / total };
+    return { count: count3, total, fraction: total === 0 ? 0 : count3 / total };
   }
   if (!d.fed) return { count: 0, total: 0, fraction: 0 };
   const column2 = COLUMN_INPUTS[d.fed.attr];
@@ -27381,13 +27605,13 @@ function evaluateFed(store, d, stamps) {
     for (const n of window2) if (has(n) && n.createdAt < anchor) anchor = n.createdAt;
     window2 = anchor === Infinity ? [] : window2.filter((n) => n.createdAt >= anchor);
   }
-  let count = 0;
-  for (const n of window2) if (has(n)) count++;
-  return { count, total: window2.length, fraction: window2.length === 0 ? 0 : count / window2.length };
+  let count2 = 0;
+  for (const n of window2) if (has(n)) count2++;
+  return { count: count2, total: window2.length, fraction: window2.length === 0 ? 0 : count2 / window2.length };
 }
 function evaluateMechanisms(store, invocations = /* @__PURE__ */ new Map(), mechanisms = MECHANISMS) {
   const counts = /* @__PURE__ */ new Map();
-  const count = (label) => {
+  const count2 = (label) => {
     if (!counts.has(label)) counts.set(label, store.countNodesByLabel(label));
     return counts.get(label);
   };
@@ -27411,8 +27635,8 @@ function evaluateMechanisms(store, invocations = /* @__PURE__ */ new Map(), mech
     const span = inv?.firstTs === void 0 ? 0 : inv.lastTs - inv.firstTs;
     const stalled = backlog !== void 0 && backlog > 0 && effectCount === 0 && (inv?.runs ?? 0) >= STALL_MIN_RUNS && span >= STALL_MIN_SPAN_MS && (backlogWas === void 0 || backlog >= backlogWas);
     let verdict;
-    const hasInput = fed.total > 0 || Boolean(d.fed?.sinceFirstStamp && d.fed.labels.some((label) => count(label) > 0));
-    const missingRequiredNodes = d.requiresNodes?.some((label) => count(label) === 0) ?? false;
+    const hasInput = fed.total > 0 || Boolean(d.fed?.sinceFirstStamp && d.fed.labels.some((label) => count2(label) > 0));
+    const missingRequiredNodes = d.requiresNodes?.some((label) => count2(label) === 0) ?? false;
     if (d.configCounter && inv?.lastTotals?.[d.configCounter] === 0) verdict = "unconfigured";
     else if ((backlog ?? 0) === 0 && (!hasInput && !d.inputOptional || missingRequiredNodes)) verdict = "no-input";
     else if (!inv || inv.runs === 0) verdict = "never-invoked";
@@ -27483,6 +27707,37 @@ var init_mechanism_liveness = __esm({
         effectCounter: "refutesStamped",
         note: "RG-mark; reason text is local-only (wire ships nodeId+witnessKey)"
       },
+      {
+        id: "confirm-local-stamp",
+        what: "stamps a harvested confirm / leaned-on witness onto the LOCAL node (confirmedAt/confirmations)",
+        pass: "capture",
+        // The consumer is errata.search's one formula (apps/daemon one-search.ts
+        // localEvidence → packages/math rankKnowledge reliability). Self-gated and
+        // synthetic-gated at harvest, so a quiet counter can also mean every cite
+        // was the session's own — the written-at-all bar, like refutedAt.
+        fed: {
+          labels: ["Problem", "Solution", "RootCause", "Pattern"],
+          attr: "confirmedAt",
+          minFraction: 0
+        },
+        effectCounter: "confirmsStamped",
+        note: "consumed by one-search rankKnowledge; transport to cloud corroborationCount unchanged"
+      },
+      {
+        id: "supersession-ask",
+        what: "asks how a just-recorded fix relates to earlier fixes for the same symptom; the agent's answer mints SUPERSEDES/BUILDS_ON/ALTERNATIVE_TO",
+        pass: "capture",
+        // Conditional and rare (a fix landing beside earlier ones) — written-at-all
+        // bar. The consumer is supersededBy in rankKnowledge (local lifecycle.ts,
+        // cloud entry-rank.ts) and the superseded/held notes agents read.
+        fed: {
+          labels: ["Solution"],
+          attr: "supersessionAskedAt",
+          minFraction: 0
+        },
+        effectCounter: "structureLinksMinted",
+        note: "the answer is the agent's; nothing is inferred"
+      },
       {
         id: "regression-recognize",
         what: "marks a resolved problem as resolutionSuspect when it recurs at the door",
@@ -27916,6 +28171,8 @@ __export(src_exports2, {
   isUnfilledPlaceholder: () => isUnfilledPlaceholder,
   isVerdictable: () => isVerdictable,
   learnedConductance: () => learnedConductance,
+  lifecycleNote: () => lifecycleNote,
+  lifecycleOf: () => lifecycleOf,
   linkProblemToLanguages: () => linkProblemToLanguages,
   linkProblemToPackages: () => linkProblemToPackages,
   linkProblemToSymbols: () => linkProblemToSymbols,
@@ -27978,12 +28235,14 @@ __export(src_exports2, {
   retractDesignProblemByStatement: () => retractDesignProblemByStatement,
   revisitContradictedPrinciples: () => revisitContradictedPrinciples,
   revisitStaleRoutes: () => revisitStaleRoutes,
+  sameFixStatement: () => sameFixStatement,
   searchByIntent: () => searchByIntent,
   solutionForProblem: () => solutionForProblem,
   splittingAxis: () => splittingAxis,
   stampObservedOs: () => stampObservedOs,
   statementIdentityKey: () => statementIdentityKey,
   staticConductance: () => staticConductance,
+  supersedersOf: () => supersedersOf,
   symbolCandidatesInText: () => symbolCandidatesInText,
   symbolIndexForText: () => symbolIndexForText,
   toolNodeId: () => toolNodeId,
@@ -28009,6 +28268,7 @@ var init_src5 = __esm({
     init_crystallize();
     init_aggregate();
     init_design_problem();
+    init_lifecycle();
     init_intent();
     init_anchor_backfill();
     init_percolate();
@@ -28456,6 +28716,22 @@ function renderSnapshot(s) {
     );
     lines.push("");
   }
+  if (s.supersessionAsks?.length) {
+    lines.push("### \u2696\uFE0F Your fix vs earlier ones");
+    lines.push(
+      "_You just recorded a fix where earlier fixes for the same symptom exist. Say how they relate \u2014 otherwise the next agent is shown them as equally current answers and has to re-prove which one held:_"
+    );
+    for (const a of s.supersessionAsks) {
+      lines.push(`- your fix: **${a.fix.description}** \u2014 \`${a.fix.id}\``);
+      for (const p of a.priors) {
+        lines.push(`  - earlier: **${p.description}** \u2014 \`${p.id}\`${p.lifecycle ? ` _(${p.lifecycle})_` : ""}`);
+        lines.push(
+          `    - yours replaces it \u2192 (supersedes:[${p.id}]) \xB7 extends it \u2192 (builds-on:[${p.id}]) \xB7 both valid \u2192 (alternative:[${p.id}]) \xB7 it held too \u2192 ${TAG_VERDICT_TOKENS.confirm(p.id)} \xB7 it didn't \u2192 ${TAG_VERDICT_TOKENS.refute(p.id)}`
+        );
+      }
+    }
+    lines.push("");
+  }
   lines.push("### Recently observed problems in this workspace");
   if (s.recentProblems.length === 0 && s.recentResolved.length === 0 && s.recentConstraints.length === 0 && s.regressions.length === 0) {
     lines.push("- _none yet \u2014 errata is still building its model_");
@@ -28578,7 +28854,7 @@ function renderSnapshot(s) {
       lines.push("");
       lines.push("_Priors that speak to it \u2014 cite one with its `[handle]` if you lean on it:_");
       for (const h of si.hits) {
-        lines.push(`- **${h.description}** \u2014 \`${h.id}\``);
+        lines.push(`- **${h.description}** \u2014 \`${h.id}\`${h.lifecycle ? ` _(${h.lifecycle})_` : ""}`);
         if (h.verdict === "own") {
           lines.push(
             `  - still open \u2014 did this work settle it? fixed \u2192 (fix:[${h.id}]) \xB7 not a real problem \u2192 an \`errata-resolved\` block with \`id: ` + h.id + "`, `disposition: false_positive`, `reason: \u2026` \xB7 still open \u2192 say nothing"
@@ -28758,6 +29034,7 @@ function isolateSnapshot(s) {
     workingFile: _workingFile,
     statedIntent: _statedIntent,
     selfCiteSkips: _selfCiteSkips,
+    supersessionAsks: _supersessionAsks,
     pendingUpdate: _pendingUpdate,
     daemonDistress: _daemonDistress,
     reviewItems: _reviewItems,
@@ -29315,14 +29592,14 @@ function sidecarForNodes(sidecar, nodes) {
   const present = /* @__PURE__ */ new Set();
   for (const n of nodes) for (const tok of extractIdentifierTokens(n.description)) present.add(tok);
   const filtered = {};
-  let count = 0;
+  let count2 = 0;
   for (const [symbol2, entry] of Object.entries(sidecar)) {
     if (present.has(symbol2)) {
       filtered[symbol2] = entry;
-      count++;
+      count2++;
     }
   }
-  return count > 0 ? filtered : void 0;
+  return count2 > 0 ? filtered : void 0;
 }
 function wireVia(value) {
   if (!value || typeof value !== "object" || Array.isArray(value)) return null;
@@ -29386,7 +29663,7 @@ function toWirePayload(batch, runId) {
       toCanonicalId: e.to,
       type: e.type,
       attrs: {
-        ...typeof e.confidence === "number" ? { confidence: clamp012(e.confidence) } : {},
+        ...typeof e.confidence === "number" ? { confidence: clamp013(e.confidence) } : {},
         ...perContext ? { perContext } : {},
         ...triageDiscriminatorAttrs(e.type, e.attrs),
         // PJ-anchor-version: the two opaque version stamps ride on anchors only.
@@ -29414,7 +29691,7 @@ function toWirePayload(batch, runId) {
     ...symbolSummaries ? { symbolSummaries } : {}
   };
 }
-function clamp012(x) {
+function clamp013(x) {
   return Math.max(0, Math.min(1, x));
 }
 function compactAttrs(input) {
@@ -29430,7 +29707,7 @@ function textOrThrow(value, field) {
   return text;
 }
 function optionalEdgeAttrs(confidence) {
-  return typeof confidence === "number" ? { confidence: clamp012(confidence) } : void 0;
+  return typeof confidence === "number" ? { confidence: clamp013(confidence) } : void 0;
 }
 function makeEdge(fromCanonicalId, type, toCanonicalId, confidence) {
   const attrs = optionalEdgeAttrs(confidence);
@@ -30087,7 +30364,7 @@ var init_client = __esm({
           id: n.canonicalId,
           label: n.label,
           description: n.description,
-          extractionConfidence: typeof n.attrs["score"] === "number" ? clamp012(n.attrs["score"]) : 0.5,
+          extractionConfidence: typeof n.attrs["score"] === "number" ? clamp013(n.attrs["score"]) : 0.5,
           extractionSource: INGEST_EXTRACTION_SOURCES.includes(n.attrs["extractionSource"]) ? n.attrs["extractionSource"] : "cold-start-seed",
           embedding: [],
           cumulativeSurprise: 0,
@@ -30107,7 +30384,7 @@ var init_client = __esm({
           from: e.fromCanonicalId,
           to: e.toCanonicalId,
           type: e.type,
-          confidence: typeof e.attrs["confidence"] === "number" ? clamp012(e.attrs["confidence"]) : 0.5,
+          confidence: typeof e.attrs["confidence"] === "number" ? clamp013(e.attrs["confidence"]) : 0.5,
           extractionSource: "agent-observed",
           createdAt: now,
           lastSeenAt: now,
@@ -36137,9 +36414,9 @@ function contextCard(store, snapshot) {
   for (const r of snapshot.recentProblems) add(r.node);
   for (const n of snapshot.remote ?? []) add(n);
   for (const m of snapshot.motifs) add(m);
-  const count = plural(delivered.length, "prior");
+  const count2 = plural(delivered.length, "prior");
   const intent = snapshot.statedIntent?.text;
-  return deliveredCard(store, intent ? `${count} for \u201C${clipIntent(intent)}\u201D` : `${count} in context`, delivered);
+  return deliveredCard(store, intent ? `${count2} for \u201C${clipIntent(intent)}\u201D` : `${count2} in context`, delivered);
 }
 function writeContextCard(root, hash2, card) {
   writeFileSync6(join8(root, ".errata", CONTEXT_CARD_FILE), JSON.stringify({
@@ -36162,7 +36439,7 @@ function openProblemCount(store, now = Date.now()) {
   const hit = openProblemsCache.get(store);
   const seq = store.changeSeq?.(OPEN_PROBLEM_SCOPES);
   if (hit && (seq !== void 0 ? hit.seq === seq : now - hit.at < OPEN_PROBLEMS_TTL_MS)) return hit.count;
-  let count = 0;
+  let count2 = 0;
   const labels = ["Problem", "Vulnerability"];
   const plain = store.selectNodes({
     labels,
@@ -36184,10 +36461,10 @@ function openProblemCount(store, now = Date.now()) {
     return { ...row, attrs };
   });
   for (const p of [...plain, ...qualified]) {
-    if (live(p) && !p.attrs["resolvedAt"] && !isConstraintProblem(p)) count++;
+    if (live(p) && !p.attrs["resolvedAt"] && !isConstraintProblem(p)) count2++;
   }
-  openProblemsCache.set(store, { at: now, count, ...seq !== void 0 ? { seq } : {} });
-  return count;
+  openProblemsCache.set(store, { at: now, count: count2, ...seq !== void 0 ? { seq } : {} });
+  return count2;
 }
 var CONTEXT_CARD_FILE, OPEN_PROBLEMS_TTL_MS, openProblemsCache, OPEN_PROBLEM_SCOPES, OPEN_PROBLEM_ATTRS, HISTORY_QUALITY_READ_KEYS;
 var init_recall_signal = __esm({
@@ -38371,6 +38648,16 @@ function dedupCloudHits(hits) {
   }
   return [...byId.values()];
 }
+function cloudEvidence(raw2) {
+  if (!raw2 || typeof raw2 !== "object") return void 0;
+  const r = raw2;
+  const out2 = {};
+  for (const k of ["acceptedCount", "corroborationCount", "failureReportCount", "contradictionPressure", "reinforcementCount", "supersededBy"]) {
+    const v = r[k];
+    if (typeof v === "number" && Number.isFinite(v) && v > 0) out2[k] = v;
+  }
+  return Object.keys(out2).length ? out2 : void 0;
+}
 function searchResultToCloudHits(result) {
   const n = result.nodes.length;
   const scores = result.nodes.map((nd) => typeof nd.attrs?.["score"] === "number" ? nd.attrs["score"] : NaN);
@@ -38382,11 +38669,13 @@ function searchResultToCloudHits(result) {
     const communityId = node2.attrs?.["community"];
     const communityLabel = node2.attrs?.["communityLabel"];
     const via = result.via?.[node2.id];
+    const evidence = cloudEvidence(node2.attrs?.["evidence"]);
     return {
       id: node2.id,
       label: node2.label,
       description: node2.description,
       cloudScore,
+      ...evidence ? { evidence } : {},
       ...typeof usage === "number" ? { usageCount: usage } : {},
       ...typeof communityId === "number" ? { community: { id: communityId, label: typeof communityLabel === "string" ? communityLabel : null } } : {},
       ...via ? { via } : {}
@@ -38551,7 +38840,8 @@ async function dualAugment(opts) {
     status: "merged",
     merged,
     seedProvenance,
-    seedUsageCount
+    seedUsageCount,
+    cloudEvidence: new Map(deduped.flatMap((h) => h.evidence ? [[h.id, h.evidence]] : []))
   };
 }
 function federationHint(status) {
@@ -38762,6 +39052,130 @@ var init_dual_augment = __esm({
   }
 });
 
+// src/one-search.ts
+function localEvidence(attrs) {
+  if (!attrs) return void 0;
+  const n = (k) => {
+    const v = Number(attrs[k]);
+    return Number.isFinite(v) && v > 0 ? v : 0;
+  };
+  const refutations = n("refutations");
+  const evidence = {
+    // Verdict witnesses (prior-tags.ts): `(confirm:)` → confirmations, `(refute:)` → refutations.
+    corroborationCount: n("confirmations"),
+    failureReportCount: refutations,
+    contradictionPressure: refutations * REFUTE_PRESSURE,
+    // Re-observation of the same problem is reinforcement (§5.2), not validation:
+    // `corroborations` here counts the problem being raised again.
+    reinforcementCount: Math.max(n("corroborations"), n("observedCount") - 1)
+  };
+  return Object.values(evidence).some((v) => (v ?? 0) > 0) ? evidence : void 0;
+}
+async function rankHits(store, query, hits, opts = {}) {
+  const terms = query.trim().split(/\s+/).filter((t) => t.length >= 2);
+  const texts = hits.map((h) => [h.name ?? h.description ?? "", h.viaText ?? ""].join(" ").trim());
+  const lowered = terms.map((t) => t.toLowerCase());
+  const df = /* @__PURE__ */ new Map();
+  for (const text of texts) {
+    const hay = text.toLowerCase();
+    for (const t of lowered) if (hay.includes(t)) df.set(t, (df.get(t) ?? 0) + 1);
+  }
+  const weightOf = (t) => Math.log(1 + hits.length / (1 + (df.get(t.toLowerCase()) ?? 0)));
+  let vectors = [];
+  let floor;
+  try {
+    const out2 = await (opts.embed ?? defaultEmbed)([query, ...texts]);
+    const q = out2[0];
+    if (q) {
+      floor = semanticFloorFor(q.version);
+      vectors = out2.slice(1).map((v) => v && v.version === q.version ? v : null);
+      vectors.unshift(q);
+    }
+  } catch {
+    vectors = [];
+  }
+  const qv = vectors[0];
+  const weights = floor != null ? { semanticFloor: floor } : void 0;
+  const inputs = hits.map((h, i2) => {
+    const node2 = store?.getNode(h.id);
+    const local = node2?.attrs;
+    const cloud = [h.id, ...h.twins ?? []].map((id) => opts.cloudEvidence?.get(id)).reduce((acc, e) => poolEvidence(acc, e), void 0);
+    const cv = vectors[i2 + 1];
+    const superseded = store && node2?.label === "Solution" ? supersedersOf(store, h.id).length : 0;
+    const evidence = poolEvidence(
+      poolEvidence(localEvidence(local), superseded > 0 ? { supersededBy: superseded } : void 0),
+      cloud
+    );
+    return {
+      ...qv && cv ? { semantic: cosine(qv.vector, cv.vector) } : {},
+      lexical: termCoverage(terms, texts[i2], weightOf),
+      hops: h.hops ?? 0,
+      ...evidence ? { evidence } : {}
+    };
+  });
+  const indexOf = /* @__PURE__ */ new Map();
+  hits.forEach((h, i2) => {
+    for (const id of [h.id, ...h.twins ?? []]) if (!indexOf.has(id)) indexOf.set(id, i2);
+  });
+  const own = inputs.map((inp) => rankKnowledge(inp, weights).components.relevance);
+  const best = [...own];
+  for (let step = 0; step < INHERIT_DEPTH; step++) {
+    hits.forEach((h, i2) => {
+      const p = h.parentId != null ? indexOf.get(h.parentId) : void 0;
+      if (p != null && p !== i2 && best[p] > best[i2]) best[i2] = best[p];
+    });
+  }
+  const ranked = 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 }));
+}
+function interleaveLanes(ranked, isKnowledge, limit) {
+  const lanes = [ranked.filter((r) => isKnowledge(r.label)), ranked.filter((r) => !isKnowledge(r.label))];
+  const out2 = [];
+  for (let i2 = 0; out2.length < limit && i2 < ranked.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);
+  }
+  return out2;
+}
+function seedQuery(text) {
+  return text.replace(/([a-z0-9])([A-Z])/g, "$1 $2").replace(/[^A-Za-z0-9]+/g, " ").trim();
+}
+async function rankDualNodes(store, query, nodes, cloudEvidence2) {
+  const withParents = nodes.map((n) => {
+    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) }));
+}
+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) }));
+}
+function withCite(records, isKnowledge) {
+  return records.map((r) => isKnowledge(String(r["label"])) ? { ...r, cite: String(r["id"]) } : r);
+}
+function rankWhy(c) {
+  const r = (x) => Math.round(x * 1e3) / 1e3;
+  return { relevance: r(c.relevance), reliability: r(c.reliability), persistence: r(c.persistence) };
+}
+var REFUTE_PRESSURE, INHERIT_DEPTH, defaultEmbed;
+var init_one_search = __esm({
+  "src/one-search.ts"() {
+    "use strict";
+    init_src4();
+    init_src3();
+    init_src5();
+    REFUTE_PRESSURE = 0.6;
+    INHERIT_DEPTH = 3;
+    defaultEmbed = async (texts) => texts.map((t) => ({ vector: embed(t), version: EMBEDDING_VERSION }));
+  }
+});
+
 // src/daemon-generalize-client.ts
 function daemonLoopbackUrl(lockPath = globalDaemonLock()) {
   const url2 = readDaemonLock(lockPath)?.webUiUrl;
@@ -41163,9 +41577,9 @@ async function Module2(moduleArg = {}) {
     }
     __name(getString, "getString");
     function getStringList() {
-      var count2 = getLEB();
+      var count22 = getLEB();
       var rtn = [];
-      while (count2--) rtn.push(getString());
+      while (count22--) rtn.push(getString());
       return rtn;
     }
     __name(getStringList, "getStringList");
@@ -41214,8 +41628,8 @@ async function Module2(moduleArg = {}) {
       } else if (subsectionType === WASM_DYLINK_NEEDED) {
         customSection.neededDynlibs = getStringList();
       } else if (subsectionType === WASM_DYLINK_EXPORT_INFO) {
-        var count = getLEB();
-        while (count--) {
+        var count2 = getLEB();
+        while (count2--) {
           var symname = getString();
           var flags2 = getLEB();
           if (flags2 & WASM_SYMBOL_TLS) {
@@ -41223,8 +41637,8 @@ async function Module2(moduleArg = {}) {
           }
         }
       } else if (subsectionType === WASM_DYLINK_IMPORT_INFO) {
-        var count = getLEB();
-        while (count--) {
+        var count2 = getLEB();
+        while (count2--) {
           var modname = getString();
           var symname = getString();
           var flags2 = getLEB();
@@ -41383,9 +41797,9 @@ async function Module2(moduleArg = {}) {
     }
     return func2;
   }, "getWasmTableEntry");
-  var updateTableMap = /* @__PURE__ */ __name((offset, count) => {
+  var updateTableMap = /* @__PURE__ */ __name((offset, count2) => {
     if (functionsInTableMap) {
-      for (var i2 = offset; i2 < offset + count; i2++) {
+      for (var i2 = offset; i2 < offset + count2; i2++) {
         var item2 = getWasmTableEntry(i2);
         if (item2) {
           functionsInTableMap.set(item2, i2);
@@ -42812,12 +43226,12 @@ var init_web_tree_sitter = __esm({
           throw new TypeError("Argument must be a Tree");
         }
         C._ts_tree_get_changed_ranges_wasm(this[0], other[0]);
-        const count = C.getValue(TRANSFER_BUFFER, "i32");
+        const count2 = C.getValue(TRANSFER_BUFFER, "i32");
         const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, "i32");
-        const result = new Array(count);
-        if (count > 0) {
+        const result = new Array(count2);
+        if (count2 > 0) {
           let address = buffer;
-          for (let i2 = 0; i2 < count; i2++) {
+          for (let i2 = 0; i2 < count2; i2++) {
             result[i2] = unmarshalRange(address);
             address += SIZE_OF_RANGE;
           }
@@ -42828,12 +43242,12 @@ var init_web_tree_sitter = __esm({
       /** Get the included ranges that were used to parse the syntax tree. */
       getIncludedRanges() {
         C._ts_tree_included_ranges_wasm(this[0]);
-        const count = C.getValue(TRANSFER_BUFFER, "i32");
+        const count2 = C.getValue(TRANSFER_BUFFER, "i32");
         const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, "i32");
-        const result = new Array(count);
-        if (count > 0) {
+        const result = new Array(count2);
+        if (count2 > 0) {
           let address = buffer;
-          for (let i2 = 0; i2 < count; i2++) {
+          for (let i2 = 0; i2 < count2; i2++) {
             result[i2] = unmarshalRange(address);
             address += SIZE_OF_RANGE;
           }
@@ -43358,12 +43772,12 @@ var init_web_tree_sitter = __esm({
       childrenForFieldId(fieldId) {
         marshalNode(this);
         C._ts_node_children_by_field_id_wasm(this.tree[0], fieldId);
-        const count = C.getValue(TRANSFER_BUFFER, "i32");
+        const count2 = C.getValue(TRANSFER_BUFFER, "i32");
         const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, "i32");
-        const result = new Array(count);
-        if (count > 0) {
+        const result = new Array(count2);
+        if (count2 > 0) {
           let address = buffer;
-          for (let i2 = 0; i2 < count; i2++) {
+          for (let i2 = 0; i2 < count2; i2++) {
             result[i2] = unmarshalNode(this.tree, address);
             address += SIZE_OF_NODE;
           }
@@ -43435,12 +43849,12 @@ var init_web_tree_sitter = __esm({
         if (!this._children) {
           marshalNode(this);
           C._ts_node_children_wasm(this.tree[0]);
-          const count = C.getValue(TRANSFER_BUFFER, "i32");
+          const count2 = C.getValue(TRANSFER_BUFFER, "i32");
           const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, "i32");
-          this._children = new Array(count);
-          if (count > 0) {
+          this._children = new Array(count2);
+          if (count2 > 0) {
             let address = buffer;
-            for (let i2 = 0; i2 < count; i2++) {
+            for (let i2 = 0; i2 < count2; i2++) {
               this._children[i2] = unmarshalNode(this.tree, address);
               address += SIZE_OF_NODE;
             }
@@ -43458,12 +43872,12 @@ var init_web_tree_sitter = __esm({
         if (!this._namedChildren) {
           marshalNode(this);
           C._ts_node_named_children_wasm(this.tree[0]);
-          const count = C.getValue(TRANSFER_BUFFER, "i32");
+          const count2 = C.getValue(TRANSFER_BUFFER, "i32");
           const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, "i32");
-          this._namedChildren = new Array(count);
-          if (count > 0) {
+          this._namedChildren = new Array(count2);
+          if (count2 > 0) {
             let address = buffer;
-            for (let i2 = 0; i2 < count; i2++) {
+            for (let i2 = 0; i2 < count2; i2++) {
               this._namedChildren[i2] = unmarshalNode(this.tree, address);
               address += SIZE_OF_NODE;
             }
@@ -43826,12 +44240,12 @@ var init_web_tree_sitter = __esm({
        */
       get supertypes() {
         C._ts_language_supertypes_wasm(this[0]);
-        const count = C.getValue(TRANSFER_BUFFER, "i32");
+        const count2 = C.getValue(TRANSFER_BUFFER, "i32");
         const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, "i32");
-        const result = new Array(count);
-        if (count > 0) {
+        const result = new Array(count2);
+        if (count2 > 0) {
           let address = buffer;
-          for (let i2 = 0; i2 < count; i2++) {
+          for (let i2 = 0; i2 < count2; i2++) {
             result[i2] = C.getValue(address, "i16");
             address += SIZE_OF_SHORT;
           }
@@ -43843,12 +44257,12 @@ var init_web_tree_sitter = __esm({
        */
       subtypes(supertype) {
         C._ts_language_subtypes_wasm(this[0], supertype);
-        const count = C.getValue(TRANSFER_BUFFER, "i32");
+        const count2 = C.getValue(TRANSFER_BUFFER, "i32");
         const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, "i32");
-        const result = new Array(count);
-        if (count > 0) {
+        const result = new Array(count2);
+        if (count2 > 0) {
           let address = buffer;
-          for (let i2 = 0; i2 < count; i2++) {
+          for (let i2 = 0; i2 < count2; i2++) {
             result[i2] = C.getValue(address, "i16");
             address += SIZE_OF_SHORT;
           }
@@ -44087,12 +44501,12 @@ ${JSON.stringify(symbolNames, null, 2)}`);
       /** Get the ranges of text that the parser will include when parsing. */
       getIncludedRanges() {
         C._ts_parser_included_ranges_wasm(this[0]);
-        const count = C.getValue(TRANSFER_BUFFER, "i32");
+        const count2 = C.getValue(TRANSFER_BUFFER, "i32");
         const buffer = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, "i32");
-        const result = new Array(count);
-        if (count > 0) {
+        const result = new Array(count2);
+        if (count2 > 0) {
           let address = buffer;
-          for (let i2 = 0; i2 < count; i2++) {
+          for (let i2 = 0; i2 < count2; i2++) {
             result[i2] = unmarshalRange(address);
             address += SIZE_OF_RANGE;
           }
@@ -44482,14 +44896,14 @@ ${JSON.stringify(symbolNames, null, 2)}`);
           matchLimit,
           maxStartDepth
         );
-        const count = C.getValue(TRANSFER_BUFFER, "i32");
+        const count2 = C.getValue(TRANSFER_BUFFER, "i32");
         const startAddress = C.getValue(TRANSFER_BUFFER + SIZE_OF_INT, "i32");
         const didExceedMatchLimit = C.getValue(TRANSFER_BUFFER + 2 * SIZE_OF_INT, "i32");
         const result = new Array();
         this.exceededMatchLimit = Boolean(didExceedMatchLimit);
         const captures = new Array();
         let address = startAddress;
-        for (let i2 = 0; i2 < count; i2++) {
+        for (let i2 = 0; i2 < count2; i2++) {
           const patternIndex = C.getValue(address, "i32");
           address += SIZE_OF_INT;
           const captureCount = C.getValue(address, "i32");
@@ -47728,9 +48142,9 @@ function standingStrandedCount(store) {
     const byFile = { ...last.byFile };
     for (const f of changed) delete byFile[f];
     for (const s of store.strandedSymbolsForFiles(changed)) byFile[s.fileId] = (byFile[s.fileId] ?? 0) + 1;
-    const count = Object.values(byFile).reduce((a, b) => a + b, 0);
-    store.setMeta?.(STRANDED_KEY, JSON.stringify({ seq, count, byFile }));
-    return count;
+    const count2 = Object.values(byFile).reduce((a, b) => a + b, 0);
+    store.setMeta?.(STRANDED_KEY, JSON.stringify({ seq, count: count2, byFile }));
+    return count2;
   } catch {
     return null;
   }
@@ -47959,20 +48373,14 @@ function takeDiscriminatorNudge(path3) {
     shared.close();
   }
 }
-function hitState(n) {
-  const reasons = n.attrs["refuteReasons"];
-  if (n.attrs["resolutionSuspect"] === true && n.attrs["resolvedAt"] != null) {
-    return { state: "regression-suspect", factor: RG_SUSPECT_BOOST };
-  }
-  if (n.attrs["refutedAt"] != null) {
-    return { state: "refuted", ...reasons?.[0] ? { refutedWhy: reasons[0] } : {}, factor: RG_REFUTED_DAMP };
-  }
-  if (n.attrs["reopenedFrom"] === "regression") {
-    return { state: "reopened-regression", factor: RG_SUSPECT_BOOST };
-  }
-  if (n.attrs["resolvedAt"] != null && n.attrs["resolvedAs"] == null) {
-    return { state: "resolved", factor: 1 };
-  }
+function hitState(store, n) {
+  const l = lifecycleOf(store, n);
+  if (l.state === "superseded") return { state: "superseded", supersededBy: l.supersededBy, factor: supersessionFactor(l.supersededBy.length) };
+  if (l.state === "refuted") return { state: "refuted", ...l.refutedWhy ? { refutedWhy: l.refutedWhy } : {}, factor: RG_REFUTED_DAMP };
+  if (l.state === "regression-suspect") return { state: "regression-suspect", factor: RG_SUSPECT_BOOST };
+  if (n.attrs["reopenedFrom"] === "regression") return { state: "reopened-regression", factor: RG_SUSPECT_BOOST };
+  if (l.state === "held") return { state: "held", factor: 1 };
+  if (l.state === "resolved") return { state: "resolved", factor: 1 };
   return { factor: 1 };
 }
 function commentAnchorId(store, commentId) {
@@ -48015,7 +48423,8 @@ function toSearchHit(node2, via, rg) {
     pageRank: node2.pageRank,
     ...via ? { via } : {},
     ...rg.state ? { state: rg.state } : {},
-    ...rg.refutedWhy ? { refutedWhy: rg.refutedWhy } : {}
+    ...rg.refutedWhy ? { refutedWhy: rg.refutedWhy } : {},
+    ...rg.supersededBy?.length ? { supersededBy: rg.supersededBy } : {}
   };
 }
 function textMatches(store, query) {
@@ -48077,7 +48486,7 @@ function textMatches(store, query) {
     }
     add(node2, matched, coverageOf(node2.id));
   }
-  return [...merged.values()].map((e) => ({ ...e, rg: hitState(e.node) })).sort(
+  return [...merged.values()].map((e) => ({ ...e, rg: hitState(store, e.node) })).sort(
     (a, b) => rankTier(a.node) - rankTier(b.node) || b.matched - a.matched || b.node.pageRank * b.rg.factor - a.node.pageRank * a.rg.factor
   ).map(({ node: node2, via, rg, coverage, matched }) => ({ node: node2, via, rg, coverage, matched }));
 }
@@ -48156,7 +48565,7 @@ function searchGraphWalk(store, query, limit) {
   return ranked.map((r) => {
     const m = byId.get(r.id);
     if (m) return { ...toSearchHit(m.node, m.via, m.rg), score: r.score, matched: true };
-    const rg = hitState(r.node);
+    const rg = hitState(store, r.node);
     return {
       ...toSearchHit(r.node, void 0, rg),
       score: r.score,
@@ -48519,9 +48928,11 @@ var init_mcp = __esm({
     init_identity2();
     init_registry();
     init_dual_augment();
+    init_one_search();
     init_dual_burst();
     init_twin_index();
     init_src5();
+    init_src3();
     init_src2();
     init_src8();
     init_dual_burst();
@@ -48586,7 +48997,7 @@ var init_mcp = __esm({
       },
       {
         name: "errata.search",
-        description: "Find a symbol, string, comment, or the knowledge around them, as a GRAPH search. The query's words pick entry points \u2014 a symbol an identifier names, knowledge carrying the query's words (a literal phrase counts most), the strongest code matches \u2014 and one walk from all of them ranks what sits at their centre, so a Problem anchored on the function you named surfaces without repeating your words. Knowledge and code alternate down the list. Each hit carries `matched` (true = the text matched; false = the walk reached it, with `reachedVia` {edgeType, from}), `score`, and `links` \u2014 its edges to the OTHER hits in this answer, so a Problem \u2014CAUSED_BY\u2192 RootCause or a fix \u2014ANCHORED_AT\u2192 the function reads as a chain. Word order and punctuation don't matter. A comment that documents a symbol resolves to that SYMBOL (the comment rides along as `via` \u2014 it's the why, not the destination); test scaffolding and floating comments sort below production code. When the collective is reachable, results BLEND cross-project knowledge, each tagged `provenance` (local | collective | corroborated) with `usageCount`.",
+        description: "Find a symbol, string, comment, or the knowledge around them, as a GRAPH search. The query's words pick entry points \u2014 a symbol an identifier names, knowledge carrying the query's words (a literal phrase counts most), the strongest code matches \u2014 and one walk from all of them ranks what sits at their centre, so a Problem anchored on the function you named surfaces without repeating your words. Knowledge and code alternate down the list. Each hit carries `matched` (true = the text matched; false = the walk reached it, with `reachedVia` {edgeType, from}), `score`, and `links` \u2014 its edges to the OTHER hits in this answer, so a Problem \u2014CAUSED_BY\u2192 RootCause or a fix \u2014ANCHORED_AT\u2192 the function reads as a chain. Word order and punctuation don't matter. A comment that documents a symbol resolves to that SYMBOL (the comment rides along as `via` \u2014 it's the why, not the destination); test scaffolding and floating comments sort below production code. When the collective is reachable, results BLEND cross-project knowledge, each tagged `provenance` (local | collective | corroborated) with `usageCount`. Local and Network hits are ranked by one formula \u2014 relevance \xD7 evidence \u2014 and each knowledge hit's `why` shows its relevance and reliability. Judge a hit you relied on or ruled out by its `cite`: (confirm:<cite>) or (refute:<cite> why).",
         inputSchema: {
           type: "object",
           properties: {
@@ -48598,12 +49009,20 @@ var init_mcp = __esm({
         handler: async (args2, store, ctx) => {
           const query = String(args2["query"] ?? "");
           const limit = Math.max(1, Math.min(100, Number(args2["limit"] ?? 20)));
-          const hits = withLinks(
-            store,
-            searchWalkEnabled() ? searchGraphWalk(store, query, limit) : searchGraph(store, query, limit).map((h) => ({ ...h, score: h.pageRank, matched: true }))
-          );
+          const pool = searchWalkEnabled() ? searchGraphWalk(store, query, limit * 2) : searchGraph(store, query, limit * 2).map((h) => ({ ...h, score: h.pageRank, matched: true }));
+          const viaText = new Map(pool.flatMap((h) => h.via?.text ? [[h.id, h.via.text]] : []));
+          const parentOf = new Map(pool.flatMap((h) => {
+            const from = h.reachedVia?.from;
+            return from ? [[h.id, from]] : [];
+          }));
+          const isKnowledge = (label) => KNOWLEDGE_LABELS.has(label);
+          const rankLocal = async () => interleaveLanes(
+            await rankHits(store, query, pool.map((h) => ({ ...h, name: h.description, ...h.via?.text ? { viaText: h.via.text } : {}, ...parentOf.has(h.id) ? { parentId: parentOf.get(h.id) } : {}, hops: h.matched ? 0 : 1 }))),
+            isKnowledge,
+            limit
+          ).map(({ rank, ...h }) => ({ ...h, why: rankWhy(rank), ...isKnowledge(h.label) ? { cite: h.id } : {} }));
           if (ctx.cloud && query.trim()) {
-            const localHits = hits.map((h) => ({
+            const localHits = pool.map((h) => ({
               id: h.id,
               node: { label: h.label, description: h.description },
               score: h.score,
@@ -48615,30 +49034,45 @@ var init_mcp = __esm({
               ...ctx.generalizeSoft ? { generalizeSoft: ctx.generalizeSoft } : {},
               localHits,
               queryText: query,
-              limit,
-              fuse: "rank"
+              limit
             });
             if (dual.status === "merged") {
+              const ranked = await rankHits(
+                store,
+                query,
+                dual.merged.nodes.map((n) => ({
+                  ...n,
+                  ...viaText.has(n.id) ? { viaText: viaText.get(n.id) } : {},
+                  ...parentOf.get(n.id) ?? n.via?.parentId ? { parentId: parentOf.get(n.id) ?? n.via?.parentId } : {},
+                  // A Network entry matched the query; a node it reached by walking carries `via`.
+                  hops: n.provenance === "collective" ? n.via ? 1 : 0 : n.hops
+                })),
+                { cloudEvidence: dual.cloudEvidence }
+              );
+              const chosen = interleaveLanes(ranked, 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: dual.merged.nodes.length,
+                count: formatted.length,
                 corroborated: dual.merged.corroboratedCount,
                 collective: dual.merged.collectiveCount,
-                results: withLinks(store, formatDualNodes(dual.merged))
+                results: withLinks(store, withCite(formatted.map((r) => ({ ...r, why: why.get(String(r["id"])) })), isKnowledge))
               };
             }
+            const local = withLinks(store, await rankLocal());
             return {
               query,
               collectiveReachable: dual.status === "empty",
               collectiveStatus: dual.status,
               ...federationHint(dual.status) ? { collectiveHint: federationHint(dual.status) } : {},
-              count: hits.length,
-              results: hits
+              count: local.length,
+              results: local
             };
           }
-          return hits;
+          return withLinks(store, await rankLocal());
         }
       },
       {
@@ -48816,6 +49250,8 @@ var init_mcp = __esm({
               limit: args2["limit"] != null ? Number(args2["limit"]) : 20
             });
             if (dual.status === "merged") {
+              const nodes = await rankDualNodes(store, seedQuery(seedNode?.description ?? id), dual.merged.nodes, dual.cloudEvidence);
+              const why = new Map(nodes.map((n) => [n.id, n.why]));
               return {
                 seed: id,
                 ...seedTwinFields(args2, seedNode),
@@ -48823,14 +49259,17 @@ var init_mcp = __esm({
                 ...dual.seedUsageCount != null ? { seedUsageCount: dual.seedUsageCount } : {},
                 collectiveReachable: true,
                 collectiveStatus: "merged",
-                count: dual.merged.nodes.length,
+                count: nodes.length,
                 corroborated: dual.merged.corroboratedCount,
                 collective: dual.merged.collectiveCount,
-                results: formatDualNodes(dual.merged)
+                results: withCite(formatDualNodes({ ...dual.merged, nodes }).map((r) => ({ ...r, why: why.get(String(r["id"])) })), (l) => KNOWLEDGE_LABELS.has(l))
               };
             }
             collectiveStatus = dual.status;
           }
+          const localOnly = mergeDualBurst(localHits, [], { twins: storeTwinIndex(store, []), seedId: id });
+          const localNodes = await rankDualNodes(store, seedQuery(seedNode?.description ?? id), localOnly.nodes);
+          const localWhy = new Map(localNodes.map((n) => [n.id, n.why]));
           return {
             seed: id,
             ...seedTwinFields(args2, seedNode),
@@ -48838,12 +49277,8 @@ var init_mcp = __esm({
             collectiveReachable: collectiveStatus === "empty",
             collectiveStatus,
             ...federationHint(collectiveStatus) ? { collectiveHint: federationHint(collectiveStatus) } : {},
-            // 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) };
-            })()
+            count: localNodes.length,
+            results: withCite(formatDualNodes({ ...localOnly, nodes: localNodes }).map((r) => ({ ...r, why: localWhy.get(String(r["id"])) })), (l) => KNOWLEDGE_LABELS.has(l))
           };
         }
       },
@@ -49232,22 +49667,22 @@ var init_mcp = __esm({
           const orderCol = byRank ? "page_rank" : "created_at";
           const sqlSince = since && Number.isFinite(since);
           let nodes;
-          let count;
+          let count2;
           if (!like && (!since || sqlSince)) {
             const where = sqlSince ? [{ column: "created_at", gte: since }] : [];
             const q = { labels: [label], where };
-            count = store.countNodes(q);
+            count2 = store.countNodes(q);
             nodes = store.selectNodes({ ...q, orderBy: { column: orderCol, desc: true }, limit: sliceEnd(limit) });
           } else {
             nodes = store.selectNodes({ labels: [label] });
             if (like) nodes = nodes.filter((n) => n.description.toLowerCase().includes(like));
             if (since) nodes = nodes.filter((n) => n.createdAt >= since);
             nodes.sort((a, b) => byRank ? b.pageRank - a.pageRank : b.createdAt - a.createdAt);
-            count = nodes.length;
+            count2 = nodes.length;
           }
           return {
             label,
-            count,
+            count: count2,
             items: nodes.slice(0, limit).map((n) => ({
               id: n.id,
               label: n.label,
@@ -49350,11 +49785,11 @@ var init_mcp = __esm({
             for (const label of labels) {
               const col = isCodeLabel(label) ? "last_updated_at" : "created_at";
               const q = { labels: [label], where: [{ column: col, gte: since }] };
-              const count = store.countNodes(q);
-              if (count === 0) continue;
-              total += count;
+              const count2 = store.countNodes(q);
+              if (count2 === 0) continue;
+              total += count2;
               groups[label] = {
-                count,
+                count: count2,
                 items: store.selectNodes({
                   ...q,
                   orderBy: { column: col, desc: true },
@@ -49436,24 +49871,27 @@ var init_mcp = __esm({
               limit
             });
             if (dual.status === "merged") {
+              const nodes = (await rankDualNodes(store, seedQuery(node2.description), dual.merged.nodes, dual.cloudEvidence)).slice(0, limit);
+              const why = new Map(nodes.map((n) => [n.id, n.why]));
               return {
                 seedId: id,
                 collectiveReachable: true,
                 collectiveStatus: "merged",
-                count: dual.merged.nodes.length,
+                count: nodes.length,
                 corroborated: dual.merged.corroboratedCount,
                 collective: dual.merged.collectiveCount,
-                results: formatDualNodes(dual.merged)
+                results: withCite(formatDualNodes({ ...dual.merged, nodes }).map((r) => ({ ...r, why: why.get(String(r["id"])) })), (l) => KNOWLEDGE_LABELS.has(l))
               };
             }
             return {
               ...local,
+              hits: await rankSimilarLocal(store, node2.description, local.hits ?? []),
               collectiveReachable: dual.status === "empty",
               collectiveStatus: dual.status,
               ...federationHint(dual.status) ? { collectiveHint: federationHint(dual.status) } : {}
             };
           }
-          return local;
+          return { ...local, hits: await rankSimilarLocal(store, node2.description, local.hits ?? []) };
         }
       },
       {
@@ -57742,7 +58180,8 @@ __export(webui_exports, {
   findFileByPath: () => findFileByPath,
   hookAudience: () => hookAudience,
   recallForFile: () => recallForFile,
-  recallForTool: () => recallForTool
+  recallForTool: () => recallForTool,
+  shownFixes: () => shownFixes
 });
 function accumulateMessageDelta(messageId, index, delta, isFinal, nowMs) {
   return messageAccumulator.accumulate(messageId, index, delta, isFinal, nowMs);
@@ -58207,6 +58646,13 @@ function buildWebUi(deps) {
       }
       if (failed) recall = recallForError(deps.store, stderr || combined);
     }
+    if (event === "PostToolUse" && tool.startsWith("mcp__errata__") && deps.onKnowledgeShown) {
+      try {
+        const shown = shownFixes(input, body2["tool_response"]);
+        if (shown) deps.onKnowledgeShown(String(body2["session_id"] ?? ""), shown);
+      } catch {
+      }
+    }
     if (event === "PostToolUse" && tool && tool !== "Bash" && deps.onToolError) {
       const rawResp = body2["tool_response"];
       const respObj = rawResp && typeof rawResp === "object" ? rawResp : {};
@@ -58652,6 +59098,41 @@ function proposalToIngest(p, profile, daemonVersion) {
     payloadDigest: p.id
   };
 }
+function shownFixes(input, response) {
+  const query = typeof input["query"] === "string" ? input["query"].trim() : "";
+  if (!query) return null;
+  const texts = [];
+  if (typeof response === "string") texts.push(response);
+  else if (Array.isArray(response)) for (const c of response) {
+    const t = c?.text;
+    if (typeof t === "string") texts.push(t);
+  }
+  else if (response && typeof response === "object") {
+    const content = response.content;
+    if (Array.isArray(content)) for (const c of content) {
+      const t = c?.text;
+      if (typeof t === "string") texts.push(t);
+    }
+  }
+  const fixIds = [];
+  const walk11 = (v, depth) => {
+    if (depth > 6 || !v || typeof v !== "object") return;
+    if (Array.isArray(v)) {
+      for (const x of v) walk11(x, depth + 1);
+      return;
+    }
+    const o = v;
+    if (o["label"] === "Solution" && typeof o["id"] === "string" && !fixIds.includes(o["id"])) fixIds.push(o["id"]);
+    for (const x of Object.values(o)) walk11(x, depth + 1);
+  };
+  for (const t of texts) {
+    try {
+      walk11(JSON.parse(t), 0);
+    } catch {
+    }
+  }
+  return fixIds.length > 0 ? { query, fixIds } : null;
+}
 var messageAccumulator, GENERIC_ERROR_WORDS, wsPackagesCache, WS_PACKAGES_TTL_MS, loggedToolSessions, SUBAGENT_REFRESH_MIN_MS, WINDOW_RESET_SOURCES, FULL_BLOCK_PREFIX, FOCUS_NOTICE_FIELD, META_LABELS;
 var init_webui = __esm({
   "src/webui.ts"() {
@@ -69873,11 +70354,11 @@ var require_pluralizer = __commonJS({
         this.singular = singular;
         this.plural = plural2;
       }
-      pluralize(count) {
-        const one = count === 1;
+      pluralize(count2) {
+        const one = count2 === 1;
         const keys = one ? singulars : plurals;
         const noun = one ? this.singular : this.plural;
-        return { ...keys, count, noun };
+        return { ...keys, count: count2, noun };
       }
     };
   }
@@ -80194,12 +80675,12 @@ var FSWatcher = class extends EventEmitter {
     let timeoutObject;
     const clear = () => {
       const item2 = action.get(path3);
-      const count = item2 ? item2.count : 0;
+      const count2 = item2 ? item2.count : 0;
       action.delete(path3);
       clearTimeout(timeoutObject);
       if (item2)
         clearTimeout(item2.timeoutObject);
-      return count;
+      return count2;
     };
     timeoutObject = setTimeout(clear, timeout);
     const thr = { timeoutObject, clear, count: 0 };
@@ -81771,7 +82252,10 @@ var CITE_GROUP_RE = /\(((?:[^()\n]|\([^()\n]*\)){1,200})\)/g;
 var HANDLE_RE2 = new RegExp(TAG_HANDLE_SOURCE, "gi");
 var PLACEHOLDER_HANDLES = TAG_PLACEHOLDER_HANDLES;
 var isPlaceholderHandle = (h) => PLACEHOLDER_HANDLES.has(h.toLowerCase());
-var FLAG_BODY_HANDLE_RE = /^(?:[a-z0-9]+(?:-[a-z0-9]+){2,}-(?=[0-9a-f]{0,3}\d)[0-9a-f]{4}|(?:pat|sol|drc|dcause|dfix|dprob|dvuln|prob|claim|err)_[0-9a-f]{6,})$/i;
+var FLAG_BODY_HANDLE_RE = new RegExp(
+  String.raw`^(?:[a-z0-9]+(?:-[a-z0-9]+){2,}-(?=[0-9a-f]{0,3}\d)[0-9a-f]{4}|(?:${TAG_CANONICAL_ID_PREFIXES.join("|")})_[0-9a-f]{6,})$`,
+  "i"
+);
 var FIX_PREFIX = /^\s*fix:(?:#([a-z][\w-]{0,63}))?\s*/i;
 var CAUSE_PREFIX = /^\s*cause:(?:#([a-z][\w-]{0,63}))?\s*/i;
 var NEST2_UNIT = String.raw`(?:[^()\n]|\((?:[^()\n]|\([^()\n]*\))*\))`;
@@ -82541,6 +83025,32 @@ function applyLocalRefutations(store, refutes, ts) {
   }
   return out2;
 }
+function applyLocalConfirmations(store, confirms, ts) {
+  const out2 = { stamped: 0, duplicate: 0, unknownNode: 0 };
+  for (const c of confirms) {
+    const node2 = store.getNode(c.nodeId);
+    if (!node2) {
+      out2.unknownNode++;
+      continue;
+    }
+    const keys = node2.attrs["confirmWitnessKeys"] ?? [];
+    if (keys.includes(c.witnessKey)) {
+      out2.duplicate++;
+      continue;
+    }
+    store.updateNode(c.nodeId, {
+      attrs: {
+        ...node2.attrs,
+        confirmedAt: ts,
+        confirmations: (Number(node2.attrs["confirmations"]) || 0) + 1,
+        confirmWitnessKeys: [...keys, c.witnessKey].slice(-REFUTE_WITNESS_KEYS_CAP)
+      },
+      lastUpdatedAt: ts
+    });
+    out2.stamped++;
+  }
+  return out2;
+}
 var PRIOR_TAG_INSTRUCTION = buildAgentInstruction();
 function isEdgeElicitationEnabled() {
   return (process.env["EDGE_ELICITATION_ENABLED"] ?? "true").toLowerCase() !== "false";
@@ -82576,8 +83086,15 @@ function readPrimingHandles(path3) {
     return {};
   }
 }
+var BARE_KNOWLEDGE_ID_RE = new RegExp(
+  String.raw`^(?:${TAG_CANONICAL_ID_PREFIXES.filter((p) => p !== "dom").join("|")})_[0-9a-f]{6,}$`,
+  "i"
+);
+function isCloudBornKnowledgeId(store, id) {
+  return !store.getNode(id) && BARE_KNOWLEDGE_ID_RE.test(id);
+}
 function resolveHandle(store, handle2, handleMap) {
-  return handleMap[handle2]?.id ?? (store.getNode(handle2) ? handle2 : void 0);
+  return handleMap[handle2]?.id ?? (store.getNode(handle2) || BARE_KNOWLEDGE_ID_RE.test(handle2) ? handle2 : void 0);
 }
 var CITE_ANCHOR_LABELS = /* @__PURE__ */ new Set(["Problem", "Solution", "RootCause", "Pattern", "Claim", "Technique", "AntiPattern"]);
 var CITE_ANCHOR_PROMOTE_SESSIONS = 2;
@@ -82897,7 +83414,7 @@ function harvestInlineTags(store, text, opts) {
       const targetId = resolveCited(tag.kind, tag.handle);
       const target = targetId ? store.getNode(targetId) : null;
       const citedLabel = target?.label ?? opts.handleMap[tag.handle]?.label;
-      if (targetId && citedLabel && CORROBORATABLE_LABELS.has(citedLabel)) {
+      if (targetId && (citedLabel ? CORROBORATABLE_LABELS.has(citedLabel) : isCloudBornKnowledgeId(store, targetId))) {
         if (tag.kind === "confirm") {
           const witnessKey = `corrob:${targetId}:confirm:${digest({ h: tag.handle })}`.slice(0, 72);
           if (!plan.corroborations.some((c) => c.witnessKey === witnessKey)) {
@@ -82917,7 +83434,7 @@ function harvestInlineTags(store, text, opts) {
       const targetId = resolveCited("prior", tag.handle);
       const target = targetId ? store.getNode(targetId) : null;
       const citedLabel = target?.label ?? opts.handleMap[tag.handle]?.label;
-      if (targetId && citedLabel && CORROBORATABLE_LABELS.has(citedLabel)) {
+      if (targetId && (citedLabel ? CORROBORATABLE_LABELS.has(citedLabel) : isCloudBornKnowledgeId(store, targetId))) {
         const witnessKey = `corrob:${targetId}:lean:${digest({ h: tag.handle })}`.slice(0, 72);
         if (!plan.corroborations.some((c) => c.witnessKey === witnessKey)) {
           const exposure = typeof store.currentIngestSeq === "function" ? priorExposure(store, targetId, { seq: store.currentIngestSeq(), ts: opts.ts }) : "unshown";
@@ -82972,6 +83489,112 @@ function stampWitnessOrigin(items, origin) {
   return items.map((i2) => ({ ...i2, witnessKey: `${i2.witnessKey}:o:${o}` }));
 }
 
+// src/supersession-asks.ts
+init_src5();
+init_src();
+init_src3();
+var ASK_PRIORS_MAX = 3;
+var ASK_SIMILAR_COVERAGE = 0.6;
+var ASK_TTL_MS = 30 * 6e4;
+var STRUCTURE = ["SUPERSEDES", "BUILDS_ON", "ALTERNATIVE_TO"];
+var liveFixesOf = (store, problemId) => store.outEdges(problemId, ["SOLVED_BY"]).map((e) => store.getNode(e.to)).filter((s) => !!s && s.label === "Solution" && s.validTo == null && !isEditPlaceholderSolution(s));
+var termsOf = (text) => [...new Set(text.toLowerCase().split(/[^a-z0-9_.]+/).filter((t) => t.length >= 3))];
+var MIN_CONTAINED_TERMS = 3;
+function similarProblems(store, problem) {
+  const terms = termsOf(problem.description);
+  if (terms.length === 0) return [];
+  const hits = store.searchDescriptionTerms(terms, 60).filter((h) => h.node.label === "Problem" && h.node.id !== problem.id);
+  const df = /* @__PURE__ */ new Map();
+  for (const h of hits) for (const t of termsOf(h.node.description)) df.set(t, (df.get(t) ?? 0) + 1);
+  const weightOf = (t) => Math.log(1 + (hits.length + 1) / (1 + (df.get(t) ?? 0)));
+  return hits.filter((h) => {
+    const theirs = termsOf(h.node.description);
+    const ours = terms.length >= MIN_CONTAINED_TERMS ? termCoverage(terms, h.node.description, weightOf) : 0;
+    const contained = theirs.length >= MIN_CONTAINED_TERMS ? termCoverage(theirs, problem.description, weightOf) : 0;
+    return Math.max(ours, contained) >= ASK_SIMILAR_COVERAGE;
+  }).map((h) => h.node.id);
+}
+function related(store, a, b) {
+  return store.outEdges(a, [...STRUCTURE]).some((e) => e.to === b) || store.outEdges(b, [...STRUCTURE]).some((e) => e.to === a);
+}
+var SHOWN_PER_SESSION = 20;
+function statesSameSymptom(a, b) {
+  const ta = termsOf(a);
+  const tb = termsOf(b);
+  const pool = [a, b];
+  const df = /* @__PURE__ */ new Map();
+  for (const text of pool) for (const t of termsOf(text)) df.set(t, (df.get(t) ?? 0) + 1);
+  const weightOf = (t) => Math.log(1 + pool.length / (1 + (df.get(t) ?? 0)));
+  const ab = ta.length >= MIN_CONTAINED_TERMS ? termCoverage(ta, b, weightOf) : 0;
+  const ba = tb.length >= MIN_CONTAINED_TERMS ? termCoverage(tb, a, weightOf) : 0;
+  return Math.max(ab, ba) >= ASK_SIMILAR_COVERAGE;
+}
+function earlierFixes(store, problemId, fixId, shown = []) {
+  const problem = store.getNode(problemId);
+  const fix = store.getNode(fixId);
+  if (!problem || !fix) return [];
+  const eligible = (s) => !!s && s.id !== fixId && s.label === "Solution" && s.validTo == null && !isEditPlaceholderSolution(s) && !related(store, fixId, s.id) && lifecycleOf(store, s).state !== "superseded";
+  const shownIds = shown.filter((q) => statesSameSymptom(q.query, problem.description)).flatMap((q) => q.fixIds);
+  const problems = /* @__PURE__ */ new Set([problemId]);
+  for (const e of [...store.outEdges(problemId, ["REGRESSION_OF"]), ...store.inEdges(problemId, ["REGRESSION_OF"])]) {
+    problems.add(e.from === problemId ? e.to : e.from);
+  }
+  for (const id of similarProblems(store, problem)) problems.add(id);
+  const siblings = [...problems].flatMap((pid) => liveFixesOf(store, pid).map((s) => s.id));
+  const rivals = [];
+  const restatements = [];
+  for (const id of [...shownIds, ...siblings]) {
+    if (rivals.includes(id) || restatements.includes(id)) continue;
+    const s = store.getNode(id);
+    if (!eligible(s)) continue;
+    (sameFixStatement(s.description, fix.description) ? restatements : rivals).push(id);
+  }
+  return [...rivals, ...restatements].slice(0, ASK_PRIORS_MAX);
+}
+var SupersessionAsks = class {
+  bySession = /* @__PURE__ */ new Map();
+  shown = /* @__PURE__ */ new Map();
+  /** An errata tool showed this session these fixes for `query`. */
+  noteShown(sessionId, entry) {
+    if (!sessionId || entry.fixIds.length === 0) return;
+    const list = (this.shown.get(sessionId) ?? []).filter((e) => e.query !== entry.query);
+    list.push(entry);
+    this.shown.set(sessionId, list.slice(-SHOWN_PER_SESSION));
+  }
+  shownTo(sessionId) {
+    return this.shown.get(sessionId) ?? [];
+  }
+  /** Record (or refresh) the ask for a fix the session just recorded. */
+  add(sessionId, fixId, priorIds, now = Date.now()) {
+    if (priorIds.length === 0) return;
+    const asks = (this.bySession.get(sessionId) ?? []).filter((a) => a.fixId !== fixId);
+    asks.push({ fixId, priorIds, askedAt: now });
+    this.bySession.set(sessionId, asks);
+  }
+  forSession(sessionId, now = Date.now()) {
+    return (this.bySession.get(sessionId) ?? []).filter((a) => now - a.askedAt < ASK_TTL_MS);
+  }
+  /** The fix a session's unbound `(supersedes:[h])` answers — the ask that showed `[h]`. */
+  fixAsking(sessionId, priorId, now = Date.now()) {
+    return this.forSession(sessionId, now).find((a) => a.priorIds.includes(priorId))?.fixId;
+  }
+  /**
+   * After a harvest: drop the priors the session judged (any structure tag,
+   * confirm or refute names them), and what has outlived its TTL.
+   */
+  settle(sessionId, judged, now = Date.now()) {
+    const asks = this.bySession.get(sessionId);
+    if (!asks) return;
+    const next = asks.map((a) => ({ ...a, priorIds: a.priorIds.filter((id) => !judged.has(id)) })).filter((a) => a.priorIds.length > 0 && now - a.askedAt < ASK_TTL_MS);
+    if (next.length > 0) this.bySession.set(sessionId, next);
+    else this.bySession.delete(sessionId);
+  }
+  /** A cache-key fingerprint of what this session's block would show. */
+  version(sessionId) {
+    return this.forSession(sessionId).map((a) => `${a.fixId}:${a.priorIds.join(",")}`).join(";");
+  }
+};
+
 // src/rollup.ts
 function readConversation(transcriptPath, includeThinking = true, maxChars = 6e4) {
   const raw2 = readTail(transcriptPath, 4e6);
@@ -87113,12 +87736,12 @@ function maybeFlushDigests() {
   try {
     if (process.env["ERRATA_NO_NOTIFY"] || !loadConfig().notifications) return;
     const now = Date.now();
-    for (const [kind, count] of digestCounts) {
-      if (count <= 0) continue;
+    for (const [kind, count2] of digestCounts) {
+      if (count2 <= 0) continue;
       if (now - (digestWindowStart.get(kind) ?? now) < DIGEST_INTERVAL_MS) continue;
       digestWindowStart.set(kind, now);
       digestCounts.set(kind, 0);
-      notify("Errata \xB7 daily digest", DIGEST_RENDER[kind]?.(count) ?? `${count} ${kind} today.`);
+      notify("Errata \xB7 daily digest", DIGEST_RENDER[kind]?.(count2) ?? `${count2} ${kind} today.`);
     }
   } catch {
   }
@@ -87219,8 +87842,8 @@ var noteBreakerQuarantine = (path3) => {
     census.breakerQuarantined.push(path3);
   }
 };
-var noteWindowOffender = (path3, count, windowMs) => {
-  census.topOffender = { path: path3, count, windowMs, at: Date.now() };
+var noteWindowOffender = (path3, count2, windowMs) => {
+  census.topOffender = { path: path3, count: count2, windowMs, at: Date.now() };
 };
 function watchCensus() {
   return { ...census };
@@ -87527,7 +88150,7 @@ function createWatchBreaker(deps) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.23-dev.4803" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.23-dev.4826" : "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;
@@ -87969,6 +88592,7 @@ function createWorkspaceEngine(opts) {
   const sessions = createSessionRegistry({ originsPath: join37(paths.configDir, "session-origins.json") });
   const sessionRenders = /* @__PURE__ */ new Map();
   const selfCiteSkipsBySession = /* @__PURE__ */ new Map();
+  const supersessionAsks = new SupersessionAsks();
   const toolRuns = createToolRunState();
   let ctxRefreshTimer = null;
   let contextDirty = false;
@@ -88039,6 +88663,15 @@ function createWorkspaceEngine(opts) {
     }
     return signal;
   };
+  const lifecycleField = (n) => {
+    const note = lifecycleNote(lifecycleOf(store, n));
+    return note ? { lifecycle: note } : {};
+  };
+  const supersessionAsksFor = (sessionId) => supersessionAsks.forSession(sessionId).flatMap((a) => {
+    const fix = store.getNode(a.fixId);
+    const priors = a.priorIds.map((id) => store.getNode(id)).filter((n) => n !== null && n.validTo == null).map((n) => ({ id: n.id, description: n.description, ...lifecycleField(n) }));
+    return fix && priors.length > 0 ? [{ fix: { id: fix.id, description: fix.description }, priors }] : [];
+  });
   const statedIntentFor = (intent) => {
     const collective = intentRemote?.forIntent === intent ? intentRemote : null;
     return {
@@ -88048,7 +88681,8 @@ function createWorkspaceEngine(opts) {
         label: h.node.label,
         description: h.node.description,
         coverage: h.coverage,
-        ...isVerdictable(h.node) ? { verdict: closableByCaller(h.node) ? "own" : "foreign" } : {}
+        ...isVerdictable(h.node) ? { verdict: closableByCaller(h.node) ? "own" : "foreign" } : {},
+        ...lifecycleField(h.node)
       })),
       ...collective && collective.hits.length > 0 ? {
         remoteHits: collective.hits.slice(0, 4).map((n) => ({ id: n.id, label: n.label, description: n.description }))
@@ -88501,6 +89135,7 @@ function createWorkspaceEngine(opts) {
     const workingFile = workingFiles.get(sessionId);
     const skips = selfCiteSkipsBySession.get(sessionId) ?? 0;
     const key = JSON.stringify([
+      supersessionAsks.version(sessionId),
       subagentBaseVersion,
       lastRemoteAt,
       sessions.version(now),
@@ -88521,6 +89156,9 @@ function createWorkspaceEngine(opts) {
     }
     delete scoped.selfCiteSkips;
     if (skips > 0) scoped.selfCiteSkips = skips;
+    delete scoped.supersessionAsks;
+    const asks = supersessionAsksFor(sessionId);
+    if (asks.length > 0) scoped.supersessionAsks = asks;
     const pendingUpdate = opts.pendingUpdate?.() ?? null;
     const daemonDistress = opts.daemonDistress?.() ?? null;
     const reviewItems = pickReviewItems();
@@ -88650,6 +89288,9 @@ function createWorkspaceEngine(opts) {
     let exposureRecent = 0;
     let corroboratedEdges = 0;
     let refutesStamped = 0;
+    let confirmsStamped = 0;
+    let supersessionAsked = 0;
+    let structureLinksMinted = 0;
     let recurrencesMarked = 0;
     let reopenedFromRegression = 0;
     let fixHeldConfirmed = 0;
@@ -88770,7 +89411,7 @@ function createWorkspaceEngine(opts) {
       for (const r of parseDesignResolutions(turn.text)) {
         try {
           const retractAs = r.disposition === "false_positive" || r.disposition === "invalid" ? r.disposition : null;
-          const closed = retractAs ? r.id ? retractDesignProblemById(store, r.id, retractAs, r.reason, t) : retractDesignProblemByStatement(store, r.problem, retractAs, r.reason, t) : r.id ? resolveDesignProblemById(store, r.id, r.fix, t) : resolveDesignProblemByStatement(store, r.problem, r.fix, t);
+          const closed = retractAs ? r.id ? retractDesignProblemById(store, r.id, retractAs, r.reason, t) : retractDesignProblemByStatement(store, r.problem, retractAs, r.reason, t) : r.id ? resolveDesignProblemById(store, r.id, r.fix, t, sessionId) : resolveDesignProblemByStatement(store, r.problem, r.fix, t, sessionId);
           if (closed) {
             resolved++;
             if (!retractAs) {
@@ -88838,6 +89479,14 @@ function createWorkspaceEngine(opts) {
         citeAnchorsPromoted += plan.citeAnchorsPromoted;
         const refuteResult = applyLocalRefutations(store, plan.refutes, t);
         refutesStamped += refuteResult.stamped;
+        if (sessions.originOf(sessionId) === void 0) {
+          const confirmResult = applyLocalConfirmations(
+            store,
+            plan.corroborations.filter((c) => store.getNode(c.nodeId)?.attrs["sources"]?.[0] !== sessionId),
+            t
+          );
+          confirmsStamped += confirmResult.stamped;
+        }
         for (const c of plan.corroborations) {
           const node2 = store.getNode(c.nodeId);
           if (node2?.label !== "Solution") continue;
@@ -89090,7 +89739,7 @@ function createWorkspaceEngine(opts) {
             }
             continue;
           }
-          const closed = resolveDesignProblemById(store, pid, fx.fixNote, t);
+          const closed = resolveDesignProblemById(store, pid, fx.fixNote, t, sessionId);
           if (!closed) {
             const n = store.getNode(pid);
             if (n && n.attrs["resolvedAt"] == null && !closableByCaller(n)) {
@@ -89103,6 +89752,22 @@ function createWorkspaceEngine(opts) {
               );
             }
           }
+          if (fx.fixNote?.trim()) {
+            const fixId = solutionForProblem(store, pid);
+            if (fixId) {
+              try {
+                const priors = earlierFixes(store, pid, fixId, supersessionAsks.shownTo(sessionId));
+                supersessionAsks.add(sessionId, fixId, priors);
+                const fix = priors.length > 0 ? store.getNode(fixId) : null;
+                if (fix) {
+                  store.updateNode(fixId, { attrs: { ...fix.attrs, supersessionAskedAt: t }, lastUpdatedAt: t });
+                  supersessionAsked++;
+                }
+              } catch (err2) {
+                console.warn("[errata] supersession ask skipped:", err2 instanceof Error ? err2.message : err2);
+              }
+            }
+          }
           if (closed) {
             resolved++;
             const fxAnchor = editedTurnFile ?? turnFile ?? wf;
@@ -89302,8 +89967,9 @@ function createWorkspaceEngine(opts) {
           }
         }
         for (const sl of plan.solutionLinks) {
-          const pid = bindPid(sl);
-          const solId = pid ? solutionForProblem(store, pid) : void 0;
+          const asked = sl.threadId ? void 0 : sl.targetIds.map((id) => supersessionAsks.fixAsking(sessionId, id)).find(Boolean);
+          const pid = asked ? void 0 : bindPid(sl);
+          const solId = asked ?? (pid ? solutionForProblem(store, pid) : void 0);
           if (!solId) {
             console.warn(`[errata] ${sl.relation} tag dropped: no solution in scope \u2014 state it beside its (fix:\u2026)`);
             continue;
@@ -89311,10 +89977,22 @@ function createWorkspaceEngine(opts) {
           for (const targetId of sl.targetIds) {
             if (targetId === solId) continue;
             const target = store.getNode(targetId);
-            if (!target || target.label !== "Solution") continue;
+            if (!target || target.label !== "Solution") {
+              console.warn(`[errata] ${sl.relation} tag dropped: ${targetId.slice(0, 32)} is ${target ? `a ${target.label}` : "not in this store"}, not a fix`);
+              continue;
+            }
             mintCiteEdge(solId, targetId, sl.relation, 0.4, { solutionStructure: true, hypothesis: true });
+            structureLinksMinted++;
           }
         }
+        supersessionAsks.settle(
+          sessionId,
+          /* @__PURE__ */ new Set([
+            ...plan.solutionLinks.flatMap((sl) => sl.targetIds),
+            ...plan.corroborations.map((c) => c.nodeId),
+            ...plan.refutes.map((r) => r.nodeId)
+          ])
+        );
         const citingSession = sessionOriginKey(sessionId);
         const mintedHere = (nodeId) => store.getNode(nodeId)?.attrs["sources"]?.[0] === sessionId;
         const synthetic = sessions.originOf(sessionId) !== void 0;
@@ -89522,6 +90200,9 @@ function createWorkspaceEngine(opts) {
         // RG-mark: refute witnesses stamped onto local nodes (the local half of
         // the contradict channel; the wire half rides the witness ledger).
         refutesStamped,
+        confirmsStamped,
+        supersessionAsked,
+        structureLinksMinted,
         // RG-recognize tier A: resolved problems the door saw recur this pass.
         recurrencesMarked,
         // RG-reopen: closes flipped open on the two-touch evidence bar.
@@ -89913,6 +90594,7 @@ B: ${b}`,
       sessionContext,
       onHook: () => telemetry.count("hooks_fired"),
       onToolsObserved: (sessionId, toolNodeIds) => toolRuns.record(sessionId, toolNodeIds),
+      onKnowledgeShown: (sessionId, shown) => supersessionAsks.noteShown(sessionId, shown),
       onHookEvent,
       onShellEvent,
       onToolError,
@@ -90421,6 +91103,7 @@ async function startDaemon(opts) {
     onHookEvent: engine.webHooks.onHookEvent,
     onShellEvent: engine.webHooks.onShellEvent,
     onToolError: engine.webHooks.onToolError,
+    onKnowledgeShown: engine.webHooks.onKnowledgeShown,
     onDiagnostics: engine.webHooks.onDiagnostics,
     onTurn: engine.webHooks.onTurn,
     onSessionEnd: engine.webHooks.onSessionEnd
@@ -90862,7 +91545,8 @@ function settleEdgeOutcomes(queue, sent, verdicts, now) {
 
 // src/instance-receipts.ts
 import { createHash as createHash18 } from "node:crypto";
-var INSTANCE_SEMANTIC_EDGE_TYPES = ["CAUSED_BY", "SOLVED_BY"];
+var INSTANCE_SEMANTIC_EDGE_TYPES = ["CAUSED_BY", "SOLVED_BY", "SUPERSEDES", "BUILDS_ON", "ALTERNATIVE_TO"];
+var INSTANCE_STRUCTURE_EDGE_TYPES = /* @__PURE__ */ new Set(["SUPERSEDES", "BUILDS_ON", "ALTERNATIVE_TO"]);
 var INSTANCE_ANCHOR_EDGE_TYPES = ["OCCURS_IN", "DEPENDS_ON", "PERTAIN_TO", "CONCERNS"];
 function edgeReceiptKind(type) {
   if (INSTANCE_SEMANTIC_EDGE_TYPES.includes(type)) return "semantic";
@@ -90891,7 +91575,7 @@ function instanceEdgeReceipts(sent, received, cloudIds) {
     groups.set(group, expected);
   }
   const complete = new Set([...groups].filter(
-    ([, expected]) => [...expected].every(([key, count]) => !rejected.has(key) && (accepted.get(key) ?? 0) >= count)
+    ([, expected]) => [...expected].every(([key, count2]) => !rejected.has(key) && (accepted.get(key) ?? 0) >= count2)
   ).map(([group]) => group));
   return { complete: (source, kind) => complete.has(groupKey(source, kind)) };
 }
@@ -90912,7 +91596,7 @@ function instanceCloudWithdrawal(n, destination, getMeta) {
     return held;
   }
 }
-var FIELDS = ["cloudWithdrawn", "withdrawnAtCorrectionSeq", "contributedAtSeq", "cloudNodeId", "anchorsContributedDigest", "projectAnchorsContributedDigest", "semanticEdgesContributedDigest", "shipRefusedSinceSeq", "shipRefusedCount", "shipRefusedReason", "shipRefusedFingerprint"];
+var FIELDS2 = ["cloudWithdrawn", "withdrawnAtCorrectionSeq", "contributedAtSeq", "cloudNodeId", "anchorsContributedDigest", "projectAnchorsContributedDigest", "semanticEdgesContributedDigest", "shipRefusedSinceSeq", "shipRefusedCount", "shipRefusedReason", "shipRefusedFingerprint"];
 function instanceDestinationKey(input) {
   return createHash18("sha256").update(JSON.stringify([
     input.workspace,
@@ -90934,7 +91618,7 @@ function instanceReceipt(n, destination) {
 function updateInstanceReceipt(n, destination, patch, mirrorLegacy) {
   const receipt = { ...instanceReceipt(n, destination), ...patch };
   const attrs = { ...n.attrs, instanceReceipts: { ...receiptMap(n.attrs), [destination]: receipt } };
-  if (mirrorLegacy) for (const field of FIELDS) {
+  if (mirrorLegacy) for (const field of FIELDS2) {
     if (field in receipt) attrs[field] = receipt[field];
     else delete attrs[field];
   }
@@ -91867,6 +92551,11 @@ function buildInstanceIngest(store, profile, daemonVersion, ignorePatterns = [],
   }
   const edges = [];
   const semanticEdgeDigests = {};
+  const pulledStructureTarget = (e) => {
+    if (!INSTANCE_STRUCTURE_EDGE_TYPES.has(e.type)) return void 0;
+    const target = store.getNode(e.to) ?? opts.sharedStore?.getNode(e.to);
+    return target?.label === "Solution" && target.attrs["source"] === "cloud" ? e.to : void 0;
+  };
   for (const [sourceId, wireFrom] of semanticEndpoints) {
     const rawOuts = [
       ...store.outEdges(sourceId, [...INSTANCE_EDGES]),
@@ -91874,7 +92563,7 @@ function buildInstanceIngest(store, profile, daemonVersion, ignorePatterns = [],
     ];
     const dedup = /* @__PURE__ */ new Map();
     for (const e of rawOuts) dedup.set(`${e.type}>${e.to}`, e);
-    const outs = [...dedup.values()].map((e) => ({ e, wireTo: semanticEndpoints.get(e.to) })).filter((x) => {
+    const outs = [...dedup.values()].map((e) => ({ e, wireTo: semanticEndpoints.get(e.to) ?? pulledStructureTarget(e) })).filter((x) => {
       if (x.wireTo === wireFrom) {
         composition.collapsedEdges++;
         return false;
@@ -91901,7 +92590,7 @@ function buildInstanceIngest(store, profile, daemonVersion, ignorePatterns = [],
     const lexicon = opts.lexicon;
     const isKnown = (tok) => lexicon.has(tok);
     const sidecar = {};
-    let count = 0;
+    let count2 = 0;
     outer: for (const n of nodes) {
       if (!INSTANCE_LABELS.includes(n.label)) continue;
       for (const tok of extractIdentifierTokens(n.description)) {
@@ -91919,15 +92608,15 @@ function buildInstanceIngest(store, profile, daemonVersion, ignorePatterns = [],
           composition.sidecarDropReasons[dropBucket] = (composition.sidecarDropReasons[dropBucket] ?? 0) + 1;
           continue;
         }
-        if (count >= MAX_SIDECAR_SYMBOLS) {
+        if (count2 >= MAX_SIDECAR_SYMBOLS) {
           composition.sidecarTruncatedAtCap = 1;
           break outer;
         }
         sidecar[tok] = { kind: entry.kind, summary: scrubbed };
-        count++;
+        count2++;
       }
     }
-    if (count > 0) symbolSummaries = sidecar;
+    if (count2 > 0) symbolSummaries = sidecar;
   }
   edges.push(...anchorEdges);
   if (opts.edgeHolds && Object.keys(opts.edgeHolds).length > 0) {
@@ -95163,9 +95852,9 @@ function collectRepoFacts(root) {
     }
   };
   const roots = git3(["rev-list", "--max-parents=0", "HEAD"]);
-  const count = git3(["rev-list", "--count", "HEAD"]);
+  const count2 = git3(["rev-list", "--count", "HEAD"]);
   const rootCommitSha = roots?.split(/\s+/).filter(Boolean).pop();
-  const commitCount = count && /^\d+$/.test(count) ? Number(count) : void 0;
+  const commitCount = count2 && /^\d+$/.test(count2) ? Number(count2) : void 0;
   return {
     ...rootCommitSha && /^[0-9a-f]{40,64}$/i.test(rootCommitSha) ? { rootCommitSha } : {},
     ...typeof commitCount === "number" ? { commitCount } : {}
@@ -96163,6 +96852,8 @@ async function startMultiDaemon(opts = {}) {
       // and dropped the record on the floor — toolSessionsTracked read 0 across
       // 936 turns while the log showed records landing (VS-corroboration-rate).
       onToolsObserved: engine.webHooks.onToolsObserved,
+      // Wired on BOTH builders — the onToolsObserved lesson above.
+      onKnowledgeShown: engine.webHooks.onKnowledgeShown,
       onToolError: engine.webHooks.onToolError,
       onDiagnostics: engine.webHooks.onDiagnostics,
       onTurn: engine.webHooks.onTurn,
@@ -97670,18 +98361,18 @@ async function startMultiDaemon(opts = {}) {
               if (!owner) return;
               const fp = refusalFingerprint(reason, owner.n.description);
               const same = instanceReceipt(owner.n, destinationKey)["shipRefusedFingerprint"] === fp;
-              const count = same ? Number(instanceReceipt(owner.n, destinationKey)["shipRefusedCount"] ?? 0) + 1 : 1;
+              const count2 = same ? Number(instanceReceipt(owner.n, destinationKey)["shipRefusedCount"] ?? 0) + 1 : 1;
               if (instanceReceipt(owner.n, destinationKey)["shipRefusedSinceSeq"] !== void 0) repeat();
               owner.s.updateNode(id, {
                 attrs: updateInstanceReceipt(owner.n, destinationKey, {
                   ...instanceReceipt(owner.n, destinationKey),
                   ...same && instanceReceipt(owner.n, destinationKey)["shipRefusedSinceSeq"] !== void 0 ? {} : { shipRefusedSinceSeq: owner.s.currentIngestSeq() },
-                  shipRefusedCount: count,
+                  shipRefusedCount: count2,
                   shipRefusedReason: reason,
                   shipRefusedFingerprint: fp
                 }, owner.s === store)
               });
-              if (same && count === SHIP_TERMINAL_REFUSALS && !isRetryableRefusal(reason)) {
+              if (same && count2 === SHIP_TERMINAL_REFUSALS && !isRetryableRefusal(reason)) {
                 nowHeld.push({ id, reason });
               }
             };