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

package/consolidate-worker.mjs

@@ -16684,6 +16684,10 @@ 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/anchor-backfill.ts
 init_src();
 init_src2();
@@ -17421,10 +17425,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,7 @@ 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;
+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 +19281,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([
@@ -21222,104 +21363,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}`;
@@ -21559,6 +21602,7 @@ __export(src_exports2, {
   detectLocalCommunities: () => detectLocalCommunities,
   edgeConductance: () => edgeConductance,
   evaluateDependency: () => evaluateDependency,
+  findMintTimeDuplicate: () => findMintTimeDuplicate,
   findOrCreatePackage: () => findOrCreatePackage,
   findPath: () => findPath,
   flattenCloudCounts: () => flattenCloudCounts,
@@ -21623,6 +21667,7 @@ __export(src_exports2, {
   solutionForProblem: () => solutionForProblem,
   splittingAxis: () => splittingAxis,
   stampObservedOs: () => stampObservedOs,
+  statementIdentityKey: () => statementIdentityKey,
   staticConductance: () => staticConductance,
   toolNodeId: () => toolNodeId,
   toolPriorsFor: () => toolPriorsFor,
@@ -26177,7 +26222,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 +53498,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.455" : "2.0.0-alpha.0";
 var IGNORED_PATH = /[\\/](?:\.git|node_modules|\.errata|\.claude|\.codex|\.cursor|\.turbo|\.next|dist|coverage|test-results|playwright-report|__pycache__)(?:[\\/]|$)/;
 var IGNORED_NOISE = /castalia\.db|eventlog\.sqlite|turn-cursors/;
 var GIT_OP_MUTE_MS = 4e3;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@inerrata-corporation/errata",
-  "version": "2.0.2-dev.437",
+  "version": "2.0.2-dev.455",
   "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";
@@ -25952,97 +26043,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) {