@inerrata-corporation/errata 2.0.23-dev.4796 → 2.0.23-dev.4821

package/consolidate-worker.mjs

@@ -16146,7 +16146,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([
@@ -17607,6 +17625,15 @@ function detectCommunitiesLeiden(input, opts = {}) {
 var DEMAND_HOT = Math.log1p(10);
 var DEMAND_WARM = Math.log1p(5);
 
+// ../../packages/math/src/reader-evidence.ts
+var FIELD_CODES = {
+  a: "acceptedCount",
+  c: "corroborationCount",
+  f: "failureReportCount",
+  p: "contradictionPressure"
+};
+var FIELDS = Object.values(FIELD_CODES);
+
 // ../../packages/local-graph/src/node-select.ts
 var SELECT_INDEXES = [
   "nodes_live_local_community",

package/errata.mjs

@@ -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,22 @@ var init_momentum = __esm({
 });
 
 // ../../packages/math/src/persistence.ts
+function reinforcementFactor(count) {
+  const n = Math.max(0, count ?? 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, CONTRADICTION_MAX_DAMPENER, CONTRADICTION_K;
 var init_persistence = __esm({
   "../../packages/math/src/persistence.ts"() {
     "use strict";
+    REINFORCEMENT_ALPHA = 0.3;
+    REINFORCEMENT_K = 20;
+    CONTRADICTION_MAX_DAMPENER = 0.25;
+    CONTRADICTION_K = 10;
   }
 });
 
@@ -19731,6 +19766,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 +20527,78 @@ 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);
+  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 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"];
+  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 +20626,8 @@ var init_src3 = __esm({
     init_motif_gate();
     init_bko();
     init_pagerank_local();
+    init_rank_knowledge();
+    init_reader_evidence();
   }
 });
 
@@ -27483,6 +27631,22 @@ 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: "regression-recognize",
         what: "marks a resolved problem as resolutionSuspect when it recurs at the door",
@@ -29386,7 +29550,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 +29578,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 +29594,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 +30251,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 +30271,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,
@@ -38371,6 +38535,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"]) {
+    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 +38556,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 +38727,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 +38939,124 @@ 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 local = store?.getNode(h.id)?.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 evidence = poolEvidence(localEvidence(local), 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();
+    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;
@@ -48519,6 +48814,7 @@ var init_mcp = __esm({
     init_identity2();
     init_registry();
     init_dual_augment();
+    init_one_search();
     init_dual_burst();
     init_twin_index();
     init_src5();
@@ -48586,7 +48882,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 +48894,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 +48919,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 +49135,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 +49144,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 +49162,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))
           };
         }
       },
@@ -49436,24 +49756,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 ?? []) };
         }
       },
       {
@@ -81771,7 +82094,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 +82867,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 +82928,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 +83256,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 +83276,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";
@@ -87527,7 +87886,7 @@ function createWatchBreaker(deps) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.23-dev.4796" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.23-dev.4821" : "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;
@@ -88650,6 +89009,7 @@ function createWorkspaceEngine(opts) {
     let exposureRecent = 0;
     let corroboratedEdges = 0;
     let refutesStamped = 0;
+    let confirmsStamped = 0;
     let recurrencesMarked = 0;
     let reopenedFromRegression = 0;
     let fixHeldConfirmed = 0;
@@ -88838,6 +89198,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;
@@ -89522,6 +89890,7 @@ 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,
         // RG-recognize tier A: resolved problems the door saw recur this pass.
         recurrencesMarked,
         // RG-reopen: closes flipped open on the two-touch evidence bar.
@@ -90912,7 +91281,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 +91303,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];
   }
@@ -101580,9 +101949,11 @@ async function cmdLink(args2) {
           saveConfig(synced.config);
         }
       }
-      if (!consents.mineHistory) console.log("history: not mined (consent off)");
-      else if (reported?.stopRequested) console.log("history: a stop request is standing in the console; the daemon honours it");
-      else console.log(`history: consents recorded${consents.contributeHistory ? "" : " (mine only)"} \xB7 the daemon walks the repo on its next pass`);
+      if (historyIngestEnabled()) {
+        if (!consents.mineHistory) console.log("history: not mined (consent off)");
+        else if (reported?.stopRequested) console.log("history: a stop request is standing in the console; the daemon honours it");
+        else console.log(`history: consents recorded${consents.contributeHistory ? "" : " (mine only)"} \xB7 the daemon walks the repo on its next pass`);
+      }
       return;
     } catch (err2) {
       const message2 = err2 instanceof Error ? err2.message : String(err2);

package/generalize-worker.mjs

@@ -14867,7 +14867,25 @@ function normalizeParam(v) {
 }
 
 // ../../packages/local-shared/src/tag-grammar.ts
-var TAG_CANONICAL_ID_PREFIXES = ["pat", "sol", "drc", "dcause", "dfix", "dprob", "dvuln", "prob", "claim", "err"];
+var 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"
+];
 var TAG_HANDLE_SOURCE = String.raw`\[([a-z0-9][\w-]{0,80})\]|((?:${TAG_CANONICAL_ID_PREFIXES.join("|")})_[0-9a-f]{6,})`;
 var TAG_THREAD_SOURCE = String.raw`#([a-z][\w-]{0,63})`;
 var TAG_PLACEHOLDER_HANDLES = /* @__PURE__ */ new Set([
@@ -16004,6 +16022,15 @@ function pageRankScale(ranks) {
 var DEMAND_HOT = Math.log1p(10);
 var DEMAND_WARM = Math.log1p(5);
 
+// ../../packages/math/src/reader-evidence.ts
+var FIELD_CODES = {
+  a: "acceptedCount",
+  c: "corroborationCount",
+  f: "failureReportCount",
+  p: "contradictionPressure"
+};
+var FIELDS = Object.values(FIELD_CODES);
+
 // ../../packages/local-graph/src/node-select.ts
 var SELECT_INDEXES = [
   "nodes_live_local_community",

package/package.json

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

package/pass-worker.mjs

@@ -16534,7 +16534,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([
@@ -26976,6 +26994,15 @@ function pagerankLocal(input) {
   return { scores, iterations: iter, converged };
 }
 
+// ../../packages/math/src/reader-evidence.ts
+var FIELD_CODES = {
+  a: "acceptedCount",
+  c: "corroborationCount",
+  f: "failureReportCount",
+  p: "contradictionPressure"
+};
+var FIELDS = Object.values(FIELD_CODES);
+
 // ../../packages/local-graph/src/node-select.ts
 var SELECT_INDEXES = [
   "nodes_live_local_community",
@@ -30379,6 +30406,22 @@ var MECHANISMS = [
     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: "regression-recognize",
     what: "marks a resolved problem as resolutionSuspect when it recurs at the door",

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

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

package/resources/context-plugin/SHA256SUMS

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