@inerrata-corporation/errata 2.0.2-dev.437 → 2.0.2-dev.476

package/consolidate-worker.mjs

@@ -16684,6 +16684,13 @@ init_src2();
 // ../../packages/local-graph/src/problem-package-link.ts
 init_src();
 
+// ../../packages/local-graph/src/problem-dedup.ts
+init_src();
+init_src();
+
+// ../../packages/local-graph/src/intent.ts
+init_src();
+
 // ../../packages/local-graph/src/anchor-backfill.ts
 init_src();
 init_src2();
@@ -17421,10 +17428,6 @@ function revisitContradictedPrinciples(l2, ts) {
 // ../../packages/local-graph/src/community.ts
 init_src2();
 
-// ../../packages/local-graph/src/problem-dedup.ts
-init_src();
-init_src();
-
 // ../../packages/local-graph/src/tools.ts
 init_src();
 

package/errata.mjs

@@ -18562,6 +18562,132 @@ var init_problem_package_link = __esm({
   }
 });
 
+// ../../packages/local-graph/src/problem-dedup.ts
+function corroborations(n) {
+  return Number(n.attrs["corroborations"] ?? 0);
+}
+function overlap(a, b) {
+  if (a.size === 0 || b.size === 0) return 0;
+  let inter = 0;
+  for (const x of a) if (b.has(x)) inter++;
+  return inter / Math.min(a.size, b.size);
+}
+function mergeDuplicateProblems(store, opts) {
+  const minOverlap = opts.minOverlap ?? 0.85;
+  const minTokens = opts.minTokens ?? 4;
+  const report = { clusters: 0, merged: 0 };
+  const open2 = store.findNodesByLabel("Problem").filter((p) => p.attrs["resolvedAt"] == null && p.attrs["mergedInto"] === void 0);
+  const tokens = /* @__PURE__ */ new Map();
+  for (const p of open2) tokens.set(p.id, new Set(conceptTokens(p.description)));
+  const consumed = /* @__PURE__ */ new Set();
+  store.transaction(() => {
+    for (let i2 = 0; i2 < open2.length; i2++) {
+      const a = open2[i2];
+      if (consumed.has(a.id)) continue;
+      const cluster = [a];
+      const ta = tokens.get(a.id);
+      for (let j = i2 + 1; j < open2.length; j++) {
+        const b = open2[j];
+        if (consumed.has(b.id)) continue;
+        const tb = tokens.get(b.id);
+        if (Math.min(ta.size, tb.size) < minTokens) continue;
+        if (isConstraintProblem(a) !== isConstraintProblem(b)) continue;
+        if (overlap(ta, tb) >= minOverlap) {
+          cluster.push(b);
+          consumed.add(b.id);
+        }
+      }
+      if (cluster.length < 2) continue;
+      report.clusters++;
+      cluster.sort((x, y) => corroborations(y) - corroborations(x) || x.createdAt - y.createdAt);
+      const survivor = cluster[0];
+      for (const dup of cluster.slice(1)) {
+        foldDuplicateProblem(store, dup, survivor, opts.ts);
+        report.merged++;
+      }
+    }
+  });
+  return report;
+}
+function foldDuplicateProblem(store, dup, survivor, ts) {
+  const surv = store.getNode(survivor.id);
+  if (!surv) return;
+  const sources = new Set(surv.attrs["sources"] ?? []);
+  for (const s of dup.attrs["sources"] ?? []) sources.add(s);
+  store.updateNode(survivor.id, {
+    attrs: {
+      ...surv.attrs,
+      sources: [...sources],
+      corroborations: corroborations(surv) + corroborations(dup) + 1
+    },
+    cumulativeHits: (surv.cumulativeHits ?? 0) + (dup.cumulativeHits ?? 0),
+    lastUpdatedAt: ts
+  });
+  for (const e of store.outEdges(dup.id, REDIRECT_EDGES)) {
+    if (e.to === survivor.id) continue;
+    const id = `edge_${digest({ from: survivor.id, type: e.type, to: e.to })}`.slice(0, 24);
+    if (store.getEdge(id)) continue;
+    const redirected = {
+      ...e,
+      id,
+      from: survivor.id,
+      createdAt: ts,
+      lastSeenAt: ts
+    };
+    store.mergeEdge(redirected);
+  }
+  store.updateNode(dup.id, {
+    attrs: { ...dup.attrs, mergedInto: survivor.id, resolvedAs: "duplicate", resolvedAt: ts },
+    lastUpdatedAt: ts
+  });
+  store.closeNode(dup.id, ts);
+}
+function statementIdentityKey(statement) {
+  return statement.toLowerCase().replace(/[`"'“”‘’*_]/g, "").replace(/[—–]/g, "-").replace(/\s+/g, " ").trim().replace(/[.,;:!?]+$/, "");
+}
+function findMintTimeDuplicate(store, statement, kind, opts) {
+  const minOverlap = opts?.minOverlap ?? 0.85;
+  const minTokens = opts?.minTokens ?? 4;
+  const incomingIsConstraint = kind === "constraint";
+  const open2 = store.findNodesByLabel("Problem").filter((p) => p.attrs["resolvedAt"] == null && p.attrs["mergedInto"] === void 0);
+  if (open2.length === 0) return null;
+  const key = statementIdentityKey(statement);
+  for (const p of open2) {
+    if (isConstraintProblem(p) !== incomingIsConstraint) continue;
+    if (statementIdentityKey(p.description) === key) return p.id;
+  }
+  const ta = new Set(conceptTokens(statement));
+  if (ta.size < minTokens) return null;
+  let best = null;
+  for (const p of open2) {
+    if (isConstraintProblem(p) !== incomingIsConstraint) continue;
+    const tb = new Set(conceptTokens(p.description));
+    if (Math.min(ta.size, tb.size) < minTokens) continue;
+    const score2 = overlap(ta, tb);
+    if (score2 >= minOverlap && (best === null || score2 > best.score)) {
+      best = { id: p.id, score: score2 };
+    }
+  }
+  return best?.id ?? null;
+}
+var REDIRECT_EDGES;
+var init_problem_dedup = __esm({
+  "../../packages/local-graph/src/problem-dedup.ts"() {
+    "use strict";
+    init_src();
+    init_src();
+    init_design_problem();
+    REDIRECT_EDGES = [
+      "CAUSED_BY",
+      "SOLVED_BY",
+      "FIXED_BY",
+      "ANCHORED_AT",
+      "MANIFESTED_IN",
+      "EVIDENCED_BY"
+    ];
+  }
+});
+
 // ../../packages/local-graph/src/design-problem.ts
 function isConstraintProblem(node2) {
   return node2.attrs["kind"] === "constraint";
@@ -18644,7 +18770,9 @@ function ingestDesignProblem(store, flag, opts) {
       rejected: true
     };
   }
-  const problemId = identityId({ kind: "DesignProblem", statement });
+  const rawId = identityId({ kind: "DesignProblem", statement });
+  const dupId = store.getNode(rawId) ? null : findMintTimeDuplicate(store, statement, flag.kind);
+  const problemId = dupId ?? rawId;
   const existing = store.getNode(problemId);
   let created = false;
   let corroborated = false;
@@ -18659,7 +18787,18 @@ function ingestDesignProblem(store, flag, opts) {
           ...existing.attrs,
           sources: [...sources, opts.source],
           corroborations: corroborations2,
-          ...promoted ? { provisional: false } : {}
+          ...promoted ? { provisional: false } : {},
+          // Keep the variant wording when a restatement resolved here rather
+          // than minting — audit trail, and input for a future judge tier.
+          ...dupId && statement !== existing.description ? {
+            statementAliases: [
+              ...(existing.attrs["statementAliases"] ?? []).slice(
+                0,
+                STATEMENT_ALIAS_CAP - 1
+              ),
+              statement
+            ]
+          } : {}
         },
         cumulativeHits: (existing.cumulativeHits ?? 0) + 1,
         ...promoted ? { extractionConfidence: 0.65 } : {},
@@ -19133,7 +19272,32 @@ function markFixCandidates(store, t) {
   }
   return resolved;
 }
-var DESIGN_PROMOTE_AT, PATTERN_DEDUP_COSINE, PATTERN_ALIAS_CAP, DEDUP_STOPWORDS, SAME_ANCHOR_DEDUP_JACCARD, CITABLE_PRIOR_LABELS, MAX_ANCHOR_FILES, AUTO_MINT_PREFIX;
+function recordRenderLedger(store, ledger, seq, ts) {
+  const bump = (ids, field) => {
+    let n = 0;
+    for (const id of new Set(ids.map((i2) => i2.id))) {
+      const node2 = store.getNode(id);
+      if (!node2) continue;
+      const attrs = { ...node2.attrs };
+      attrs[field] = (attrs[field] ?? 0) + 1;
+      if (field === "shownCount") {
+        attrs["lastShownAtSeq"] = seq;
+        if (attrs["firstShownAtSeq"] === void 0) attrs["firstShownAtSeq"] = seq;
+      }
+      store.updateNode(id, { attrs, lastUpdatedAt: node2.lastUpdatedAt });
+      n++;
+    }
+    return n;
+  };
+  let shown = 0;
+  let evicted = 0;
+  store.transaction(() => {
+    shown = bump(ledger.shown, "shownCount");
+    evicted = bump(ledger.evicted, "evictedCount");
+  });
+  return { shown, evicted };
+}
+var DESIGN_PROMOTE_AT, STATEMENT_ALIAS_CAP, PATTERN_DEDUP_COSINE, PATTERN_ALIAS_CAP, DEDUP_STOPWORDS, SAME_ANCHOR_DEDUP_JACCARD, CITABLE_PRIOR_LABELS, MAX_ANCHOR_FILES, AUTO_MINT_PREFIX;
 var init_design_problem = __esm({
   "../../packages/local-graph/src/design-problem.ts"() {
     "use strict";
@@ -19142,7 +19306,9 @@ var init_design_problem = __esm({
     init_src3();
     init_src2();
     init_problem_package_link();
+    init_problem_dedup();
     DESIGN_PROMOTE_AT = 1;
+    STATEMENT_ALIAS_CAP = 5;
     PATTERN_DEDUP_COSINE = 0.85;
     PATTERN_ALIAS_CAP = 5;
     DEDUP_STOPWORDS = /* @__PURE__ */ new Set([
@@ -19181,6 +19347,61 @@ var init_design_problem = __esm({
   }
 });
 
+// ../../packages/local-graph/src/intent.ts
+function parseIntentFences(text) {
+  const out2 = [];
+  const block = /```errata-intent[^\n]*\n([\s\S]*?)```/g;
+  let m;
+  while ((m = block.exec(text)) !== null) {
+    const lines = m[1].split(/\r?\n/);
+    const parts2 = [];
+    for (const line of lines) {
+      const kv = /^\s*intent\s*:\s*(.+?)\s*$/i.exec(line);
+      if (kv) parts2.push(kv[1].trim());
+      else if (parts2.length > 0 && line.trim()) parts2.push(line.trim());
+    }
+    const intent = parts2.join(" ").trim();
+    if (intent) out2.push({ intent });
+  }
+  return out2;
+}
+function searchByIntent(store, intent, opts) {
+  const limit = opts?.limit ?? 5;
+  const minCoverage = opts?.minCoverage ?? 0.25;
+  const want = new Set(conceptTokens(intent));
+  if (want.size < MIN_INTENT_TOKENS) return [];
+  const hits = [];
+  for (const label of RECALLABLE) {
+    for (const node2 of store.findNodesByLabel(label)) {
+      if (node2.attrs["mergedInto"] !== void 0) continue;
+      if (label === "Problem" && node2.attrs["resolvedAt"] != null && !isConstraintProblem(node2)) {
+        continue;
+      }
+      const bag = conceptTokens(node2.description ?? "");
+      if (bag.length === 0) continue;
+      const matched = bag.filter((t) => want.has(t));
+      if (matched.length === 0) continue;
+      const coverage = matched.length / want.size;
+      if (coverage < minCoverage) continue;
+      hits.push({ node: node2, coverage, matched });
+    }
+  }
+  hits.sort(
+    (a, b) => b.coverage - a.coverage || (a.node.description?.length ?? 0) - (b.node.description?.length ?? 0)
+  );
+  return hits.slice(0, limit);
+}
+var RECALLABLE, MIN_INTENT_TOKENS;
+var init_intent = __esm({
+  "../../packages/local-graph/src/intent.ts"() {
+    "use strict";
+    init_src();
+    init_design_problem();
+    RECALLABLE = ["Problem", "Solution", "RootCause", "Pattern"];
+    MIN_INTENT_TOKENS = 2;
+  }
+});
+
 // ../../packages/local-graph/src/anchor-backfill.ts
 function isLegacyAnchor(attrs) {
   return attrs?.["captureTime"] === true && attrs["anchorProvenance"] === void 0;
@@ -21222,104 +21443,6 @@ var init_community2 = __esm({
   }
 });
 
-// ../../packages/local-graph/src/problem-dedup.ts
-function corroborations(n) {
-  return Number(n.attrs["corroborations"] ?? 0);
-}
-function overlap(a, b) {
-  if (a.size === 0 || b.size === 0) return 0;
-  let inter = 0;
-  for (const x of a) if (b.has(x)) inter++;
-  return inter / Math.min(a.size, b.size);
-}
-function mergeDuplicateProblems(store, opts) {
-  const minOverlap = opts.minOverlap ?? 0.85;
-  const minTokens = opts.minTokens ?? 4;
-  const report = { clusters: 0, merged: 0 };
-  const open2 = store.findNodesByLabel("Problem").filter((p) => p.attrs["resolvedAt"] == null && p.attrs["mergedInto"] === void 0);
-  const tokens = /* @__PURE__ */ new Map();
-  for (const p of open2) tokens.set(p.id, new Set(conceptTokens(p.description)));
-  const consumed = /* @__PURE__ */ new Set();
-  store.transaction(() => {
-    for (let i2 = 0; i2 < open2.length; i2++) {
-      const a = open2[i2];
-      if (consumed.has(a.id)) continue;
-      const cluster = [a];
-      const ta = tokens.get(a.id);
-      for (let j = i2 + 1; j < open2.length; j++) {
-        const b = open2[j];
-        if (consumed.has(b.id)) continue;
-        const tb = tokens.get(b.id);
-        if (Math.min(ta.size, tb.size) < minTokens) continue;
-        if (isConstraintProblem(a) !== isConstraintProblem(b)) continue;
-        if (overlap(ta, tb) >= minOverlap) {
-          cluster.push(b);
-          consumed.add(b.id);
-        }
-      }
-      if (cluster.length < 2) continue;
-      report.clusters++;
-      cluster.sort((x, y) => corroborations(y) - corroborations(x) || x.createdAt - y.createdAt);
-      const survivor = cluster[0];
-      for (const dup of cluster.slice(1)) {
-        foldDuplicateProblem(store, dup, survivor, opts.ts);
-        report.merged++;
-      }
-    }
-  });
-  return report;
-}
-function foldDuplicateProblem(store, dup, survivor, ts) {
-  const surv = store.getNode(survivor.id);
-  if (!surv) return;
-  const sources = new Set(surv.attrs["sources"] ?? []);
-  for (const s of dup.attrs["sources"] ?? []) sources.add(s);
-  store.updateNode(survivor.id, {
-    attrs: {
-      ...surv.attrs,
-      sources: [...sources],
-      corroborations: corroborations(surv) + corroborations(dup) + 1
-    },
-    cumulativeHits: (surv.cumulativeHits ?? 0) + (dup.cumulativeHits ?? 0),
-    lastUpdatedAt: ts
-  });
-  for (const e of store.outEdges(dup.id, REDIRECT_EDGES)) {
-    if (e.to === survivor.id) continue;
-    const id = `edge_${digest({ from: survivor.id, type: e.type, to: e.to })}`.slice(0, 24);
-    if (store.getEdge(id)) continue;
-    const redirected = {
-      ...e,
-      id,
-      from: survivor.id,
-      createdAt: ts,
-      lastSeenAt: ts
-    };
-    store.mergeEdge(redirected);
-  }
-  store.updateNode(dup.id, {
-    attrs: { ...dup.attrs, mergedInto: survivor.id, resolvedAs: "duplicate", resolvedAt: ts },
-    lastUpdatedAt: ts
-  });
-  store.closeNode(dup.id, ts);
-}
-var REDIRECT_EDGES;
-var init_problem_dedup = __esm({
-  "../../packages/local-graph/src/problem-dedup.ts"() {
-    "use strict";
-    init_src();
-    init_src();
-    init_design_problem();
-    REDIRECT_EDGES = [
-      "CAUSED_BY",
-      "SOLVED_BY",
-      "FIXED_BY",
-      "ANCHORED_AT",
-      "MANIFESTED_IN",
-      "EVIDENCED_BY"
-    ];
-  }
-});
-
 // ../../packages/local-graph/src/tools.ts
 function toolNodeId(name2) {
   return `tool:${name2}`;
@@ -21523,6 +21646,7 @@ __export(src_exports2, {
   JOINT_COMMUNITY_EDGES: () => JOINT_COMMUNITY_EDGES,
   JOINT_COMMUNITY_LABELS: () => JOINT_COMMUNITY_LABELS,
   MAX_ANCHOR_FILES: () => MAX_ANCHOR_FILES,
+  MIN_INTENT_TOKENS: () => MIN_INTENT_TOKENS,
   PATTERN_DEDUP_COSINE: () => PATTERN_DEDUP_COSINE,
   PERCOLATING_DRIFT_EDGES: () => PERCOLATING_DRIFT_EDGES,
   PERCOLATING_EDGES: () => PERCOLATING_EDGES,
@@ -21559,6 +21683,7 @@ __export(src_exports2, {
   detectLocalCommunities: () => detectLocalCommunities,
   edgeConductance: () => edgeConductance,
   evaluateDependency: () => evaluateDependency,
+  findMintTimeDuplicate: () => findMintTimeDuplicate,
   findOrCreatePackage: () => findOrCreatePackage,
   findPath: () => findPath,
   flattenCloudCounts: () => flattenCloudCounts,
@@ -21594,6 +21719,7 @@ __export(src_exports2, {
   openGraphStore: () => openGraphStore,
   osNodeId: () => osNodeId,
   parseAbstractionFences: () => parseAbstractionFences,
+  parseIntentFences: () => parseIntentFences,
   parseSemver: () => parseSemver,
   parseTriageFences: () => parseTriageFences,
   pendingAbstractions: () => pendingAbstractions,
@@ -21608,6 +21734,7 @@ __export(src_exports2, {
   recordCauseChainLink: () => recordCauseChainLink,
   recordClaim: () => recordClaim,
   recordMisreadPrior: () => recordMisreadPrior,
+  recordRenderLedger: () => recordRenderLedger,
   recordTriageObservation: () => recordTriageObservation,
   reinforceSameAnchorProblem: () => reinforceSameAnchorProblem,
   relateClaims: () => relateClaims,
@@ -21620,9 +21747,11 @@ __export(src_exports2, {
   retractDesignProblemByStatement: () => retractDesignProblemByStatement,
   revisitContradictedPrinciples: () => revisitContradictedPrinciples,
   revisitStaleRoutes: () => revisitStaleRoutes,
+  searchByIntent: () => searchByIntent,
   solutionForProblem: () => solutionForProblem,
   splittingAxis: () => splittingAxis,
   stampObservedOs: () => stampObservedOs,
+  statementIdentityKey: () => statementIdentityKey,
   staticConductance: () => staticConductance,
   toolNodeId: () => toolNodeId,
   toolPriorsFor: () => toolPriorsFor,
@@ -21641,6 +21770,7 @@ var init_src5 = __esm({
     init_crystallize();
     init_aggregate();
     init_design_problem();
+    init_intent();
     init_anchor_backfill();
     init_percolate();
     init_abstraction();
@@ -22138,14 +22268,42 @@ function assembleAgentContext(opts) {
   }
   snapshot.skills = [...snapshot.skills].sort((a, b) => b.confidence - a.confidence);
   const maxChars = opts.maxChars ?? DEFAULT_AGENT_CONTEXT_BUDGET;
+  const candidates = snapshotImpressions(snapshot);
   const dropped = budgetSnapshot(snapshot, maxChars);
+  const ledger = diffRenderLedger(candidates, snapshotImpressions(snapshot));
   let body2 = renderSnapshot(snapshot);
   if (dropped > 0) {
     body2 += `
 
 _${dropped} lower-priority item${dropped === 1 ? "" : "s"} omitted to fit the passive-context budget \u2014 the full graph is in the errata dashboard._`;
   }
-  return { body: body2, snapshot, dropped };
+  return { body: body2, snapshot, dropped, ledger };
+}
+function snapshotImpressions(s) {
+  const out2 = [];
+  const push = (band, ids) => {
+    for (const id of ids) if (id) out2.push({ id, band });
+  };
+  push("recentProblems", s.recentProblems.map((p) => p.node.id));
+  push("recentResolved", s.recentResolved.map((r) => r.node.id));
+  push("recentConstraints", s.recentConstraints.map((c) => c.id));
+  push("motifs", s.motifs.map((m) => m.id));
+  push("remote", (s.remote ?? []).map((r) => r.id));
+  push("needsRevisit", s.needsRevisit.map((r) => r.id));
+  push(
+    "reviewItems",
+    (s.reviewItems ?? []).map((r) => r.kind === "abstraction" ? r.candidate : r.route)
+  );
+  push("workingFile", s.workingFile?.priors?.openProblems.map((p) => p.id) ?? []);
+  return out2;
+}
+function diffRenderLedger(before, after) {
+  const key = (i2) => `${i2.band}\0${i2.id}`;
+  const survived = new Set(after.map(key));
+  const shown = [];
+  const evicted = [];
+  for (const i2 of before) (survived.has(key(i2)) ? shown : evicted).push(i2);
+  return { shown, evicted };
 }
 var RECALL_FIRST_HEADER, RECALL_FIRST_BODY, RECALL_FIRST_BLOCK, SEARCH_IMPERATIVE_HEADER, SEARCH_IMPERATIVE_BODY, EVICTION_ORDER, MOTIF_FLOOR, REMOTE_FLOOR, PROBLEM_FLOOR, REVIEW_ITEM_FLOOR, DEFAULT_AGENT_CONTEXT_BUDGET;
 var init_render = __esm({
@@ -22159,7 +22317,7 @@ var init_render = __esm({
 
 ${RECALL_FIRST_BODY}`;
     SEARCH_IMPERATIVE_HEADER = "### \u{1F50E} PRIORS ARE SEEDS \u2014 a sample, not the whole graph";
-    SEARCH_IMPERATIVE_BODY = "Everything below is a budgeted, top-of-head slice of a much larger graph. Any prior id below is a live burst seed: `errata.burst` it (or read `.errata/g/burst/<id>`) to pull its wider neighborhood \u2014 causes, fixes, siblings. When a prior is adjacent-but-not-quite, or none fit, that gap is exactly when to search deeper before solving cold: a stuck search is itself a signal that routes help to you.";
+    SEARCH_IMPERATIVE_BODY = "Everything below is a budgeted slice of a much larger graph, not all errata knows. Starting a piece of work? Say what it is \u2014 we search on it between your tool calls and put what we find here:\n```errata-intent\nintent: <the work in hand, in your words>\n```\nNarration, not a detour: no tool call, no plan change. It is the one signal we cannot derive from your edits \u2014 everything else here is guessed from the files you touched.";
     EVICTION_ORDER = [
       "skills",
       // Review items beyond the floor drop immediately after skills — one naming
@@ -26177,7 +26335,7 @@ function buildAgentInstruction(opts = {}) {
   const ref = opts.referent ?? "its-handle";
   const token = (s) => s === "problem" ? TAG_EXAMPLE.problem() : s === "constraint" ? TAG_EXAMPLE.constraint() : s === "attempt" ? TAG_EXAMPLE.tried() : s === "domain" ? TAG_EXAMPLE.domain() : s === "link" ? TAG_EXAMPLE.pattern() : TAG_EXAMPLE[s](ref);
   const head2 = `We tag the priors we show you with a short handle like [${opts.handleExample ?? "chokidar-glob"}]. Tags are the ONLY signal recorded \u2014 anything you state but don't tag is silently lost. Weave each tag inline in your prose as you state it (no fences or backticks, no extra calls); tag everything, we filter downstream:`;
-  const tail = "Mid-turn text (between tool calls) can be dropped by the harness \u2014 RESTATE every tag in your turn-final message; the final message is what reliably survives.";
+  const tail = "Mid-turn text (between tool calls) can be dropped by the harness \u2014 RESTATE every tag in your turn-final message; the final message is what reliably survives \u2014 EXCEPT one already shown above with an id: that is captured, so cite `[its-handle]` rather than retyping it (drift mints a duplicate).";
   return [
     head2,
     ...signals.map(
@@ -53453,7 +53611,7 @@ function startLoopLagMonitor(thresholdMs = 1e3) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.2-dev.437" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.2-dev.476" : "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;
@@ -53824,7 +53982,7 @@ function createWorkspaceEngine(opts) {
     const doneRender = prebuilt ? null : markPass(`context-render-inline:${profile.name}`);
     const pendingUpdate = opts.pendingUpdate?.() ?? null;
     const reviewItems = pickReviewItems();
-    const { body: body2, snapshot } = assembleAgentContext({
+    const { body: body2, snapshot, ledger } = assembleAgentContext({
       store,
       ...snapOpts,
       remote: remotePriors,
@@ -53834,6 +53992,12 @@ function createWorkspaceEngine(opts) {
       ...reviewItems.length ? { reviewItems } : {}
     });
     doneRender?.();
+    try {
+      const seq = store.currentIngestSeq();
+      recordRenderLedger(store, ledger, seq, Date.now());
+    } catch (err2) {
+      console.warn("[errata] render ledger failed:", err2.message?.slice(0, 120));
+    }
     writeContextFile(opts.workspaceRoot, body2);
     const target = join26(opts.workspaceRoot, "AGENTS.md");
     writeManagedBlock(target, { body: AGENTS_POINTER_BODY, stable: true, force: true });

package/package.json

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

package/pass-worker.mjs

@@ -25316,6 +25316,97 @@ function backfillProblemContext(store2, ts) {
   return report;
 }
 
+// ../../packages/local-graph/src/problem-dedup.ts
+init_src();
+init_src();
+var REDIRECT_EDGES = [
+  "CAUSED_BY",
+  "SOLVED_BY",
+  "FIXED_BY",
+  "ANCHORED_AT",
+  "MANIFESTED_IN",
+  "EVIDENCED_BY"
+];
+function corroborations(n) {
+  return Number(n.attrs["corroborations"] ?? 0);
+}
+function overlap(a, b) {
+  if (a.size === 0 || b.size === 0) return 0;
+  let inter = 0;
+  for (const x of a) if (b.has(x)) inter++;
+  return inter / Math.min(a.size, b.size);
+}
+function mergeDuplicateProblems(store2, opts) {
+  const minOverlap = opts.minOverlap ?? 0.85;
+  const minTokens = opts.minTokens ?? 4;
+  const report = { clusters: 0, merged: 0 };
+  const open = store2.findNodesByLabel("Problem").filter((p) => p.attrs["resolvedAt"] == null && p.attrs["mergedInto"] === void 0);
+  const tokens = /* @__PURE__ */ new Map();
+  for (const p of open) tokens.set(p.id, new Set(conceptTokens(p.description)));
+  const consumed = /* @__PURE__ */ new Set();
+  store2.transaction(() => {
+    for (let i2 = 0; i2 < open.length; i2++) {
+      const a = open[i2];
+      if (consumed.has(a.id)) continue;
+      const cluster = [a];
+      const ta = tokens.get(a.id);
+      for (let j = i2 + 1; j < open.length; j++) {
+        const b = open[j];
+        if (consumed.has(b.id)) continue;
+        const tb = tokens.get(b.id);
+        if (Math.min(ta.size, tb.size) < minTokens) continue;
+        if (isConstraintProblem(a) !== isConstraintProblem(b)) continue;
+        if (overlap(ta, tb) >= minOverlap) {
+          cluster.push(b);
+          consumed.add(b.id);
+        }
+      }
+      if (cluster.length < 2) continue;
+      report.clusters++;
+      cluster.sort((x, y) => corroborations(y) - corroborations(x) || x.createdAt - y.createdAt);
+      const survivor = cluster[0];
+      for (const dup of cluster.slice(1)) {
+        foldDuplicateProblem(store2, dup, survivor, opts.ts);
+        report.merged++;
+      }
+    }
+  });
+  return report;
+}
+function foldDuplicateProblem(store2, dup, survivor, ts) {
+  const surv = store2.getNode(survivor.id);
+  if (!surv) return;
+  const sources = new Set(surv.attrs["sources"] ?? []);
+  for (const s of dup.attrs["sources"] ?? []) sources.add(s);
+  store2.updateNode(survivor.id, {
+    attrs: {
+      ...surv.attrs,
+      sources: [...sources],
+      corroborations: corroborations(surv) + corroborations(dup) + 1
+    },
+    cumulativeHits: (surv.cumulativeHits ?? 0) + (dup.cumulativeHits ?? 0),
+    lastUpdatedAt: ts
+  });
+  for (const e of store2.outEdges(dup.id, REDIRECT_EDGES)) {
+    if (e.to === survivor.id) continue;
+    const id = `edge_${digest({ from: survivor.id, type: e.type, to: e.to })}`.slice(0, 24);
+    if (store2.getEdge(id)) continue;
+    const redirected = {
+      ...e,
+      id,
+      from: survivor.id,
+      createdAt: ts,
+      lastSeenAt: ts
+    };
+    store2.mergeEdge(redirected);
+  }
+  store2.updateNode(dup.id, {
+    attrs: { ...dup.attrs, mergedInto: survivor.id, resolvedAs: "duplicate", resolvedAt: ts },
+    lastUpdatedAt: ts
+  });
+  store2.closeNode(dup.id, ts);
+}
+
 // ../../packages/local-graph/src/design-problem.ts
 function isConstraintProblem(node) {
   return node.attrs["kind"] === "constraint";
@@ -25464,6 +25555,9 @@ function markFixCandidates(store2, t) {
   return resolved;
 }
 
+// ../../packages/local-graph/src/intent.ts
+init_src();
+
 // ../../packages/local-graph/src/anchor-backfill.ts
 init_src();
 init_src2();
@@ -25952,97 +26046,6 @@ var DRIFT_VALUES = new Set(Object.values(DRIFT_KIND));
 // ../../packages/local-graph/src/community.ts
 init_src2();
 
-// ../../packages/local-graph/src/problem-dedup.ts
-init_src();
-init_src();
-var REDIRECT_EDGES = [
-  "CAUSED_BY",
-  "SOLVED_BY",
-  "FIXED_BY",
-  "ANCHORED_AT",
-  "MANIFESTED_IN",
-  "EVIDENCED_BY"
-];
-function corroborations(n) {
-  return Number(n.attrs["corroborations"] ?? 0);
-}
-function overlap(a, b) {
-  if (a.size === 0 || b.size === 0) return 0;
-  let inter = 0;
-  for (const x of a) if (b.has(x)) inter++;
-  return inter / Math.min(a.size, b.size);
-}
-function mergeDuplicateProblems(store2, opts) {
-  const minOverlap = opts.minOverlap ?? 0.85;
-  const minTokens = opts.minTokens ?? 4;
-  const report = { clusters: 0, merged: 0 };
-  const open = store2.findNodesByLabel("Problem").filter((p) => p.attrs["resolvedAt"] == null && p.attrs["mergedInto"] === void 0);
-  const tokens = /* @__PURE__ */ new Map();
-  for (const p of open) tokens.set(p.id, new Set(conceptTokens(p.description)));
-  const consumed = /* @__PURE__ */ new Set();
-  store2.transaction(() => {
-    for (let i2 = 0; i2 < open.length; i2++) {
-      const a = open[i2];
-      if (consumed.has(a.id)) continue;
-      const cluster = [a];
-      const ta = tokens.get(a.id);
-      for (let j = i2 + 1; j < open.length; j++) {
-        const b = open[j];
-        if (consumed.has(b.id)) continue;
-        const tb = tokens.get(b.id);
-        if (Math.min(ta.size, tb.size) < minTokens) continue;
-        if (isConstraintProblem(a) !== isConstraintProblem(b)) continue;
-        if (overlap(ta, tb) >= minOverlap) {
-          cluster.push(b);
-          consumed.add(b.id);
-        }
-      }
-      if (cluster.length < 2) continue;
-      report.clusters++;
-      cluster.sort((x, y) => corroborations(y) - corroborations(x) || x.createdAt - y.createdAt);
-      const survivor = cluster[0];
-      for (const dup of cluster.slice(1)) {
-        foldDuplicateProblem(store2, dup, survivor, opts.ts);
-        report.merged++;
-      }
-    }
-  });
-  return report;
-}
-function foldDuplicateProblem(store2, dup, survivor, ts) {
-  const surv = store2.getNode(survivor.id);
-  if (!surv) return;
-  const sources = new Set(surv.attrs["sources"] ?? []);
-  for (const s of dup.attrs["sources"] ?? []) sources.add(s);
-  store2.updateNode(survivor.id, {
-    attrs: {
-      ...surv.attrs,
-      sources: [...sources],
-      corroborations: corroborations(surv) + corroborations(dup) + 1
-    },
-    cumulativeHits: (surv.cumulativeHits ?? 0) + (dup.cumulativeHits ?? 0),
-    lastUpdatedAt: ts
-  });
-  for (const e of store2.outEdges(dup.id, REDIRECT_EDGES)) {
-    if (e.to === survivor.id) continue;
-    const id = `edge_${digest({ from: survivor.id, type: e.type, to: e.to })}`.slice(0, 24);
-    if (store2.getEdge(id)) continue;
-    const redirected = {
-      ...e,
-      id,
-      from: survivor.id,
-      createdAt: ts,
-      lastSeenAt: ts
-    };
-    store2.mergeEdge(redirected);
-  }
-  store2.updateNode(dup.id, {
-    attrs: { ...dup.attrs, mergedInto: survivor.id, resolvedAs: "duplicate", resolvedAt: ts },
-    lastUpdatedAt: ts
-  });
-  store2.closeNode(dup.id, ts);
-}
-
 // ../../packages/local-graph/src/tools.ts
 init_src();
 function rankToolsForHandles(store2, limit = 5) {