@inerrata-corporation/errata 2.0.2-dev.125 → 2.0.2-dev.133

package/package.json

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

package/pass-worker.mjs

@@ -144,7 +144,14 @@ var init_castalia = __esm({
       "SOLVED_BY",
       "MITIGATES",
       "REPORTED_FAILURE",
-      "CONTRADICTS"
+      "CONTRADICTS",
+      // Motif twin-faces (KN-twin-faces): failure-face motif → remedy-face motif
+      // across layers (AntiPattern/Weakness ↔ Technique/Pattern). Same
+      // problem→fix direction as FIXED_BY/SOLVED_BY. Minted by the nightly LLM
+      // twin-face pass — these are the near-identical cross-layer pairs the
+      // polarity gate (finding 5) correctly refuses to FUSE; the link carries
+      // what fusion can't.
+      "REMEDIED_BY"
     ];
     CONCEPTUAL_EDGES = [
       "INSTANCE_OF",
@@ -274,6 +281,10 @@ var init_castalia = __esm({
       CAUSED_BY: 3,
       FIXED_BY: 3,
       SOLVED_BY: 3,
+      // Twin-face link (failure motif → remedy motif, KN-twin-faces) — causal-grade
+      // but a notch below witnessed FIXED_BY/SOLVED_BY: the pairing is an LLM
+      // judgment over descriptions, not an agent-witnessed resolution.
+      REMEDIED_BY: 2.5,
       MANIFESTS_AS: 2,
       ESCALATES_TO: 1.5,
       AFFECTS: 1.2,
@@ -15159,6 +15170,15 @@ var init_wire = __esm({
       /** Canonical human-readable description (no raw paths — daemon scrubs; server rechecks). */
       description: external_exports.string().min(1).max(4e3),
       attrs: external_exports.record(external_exports.string(), external_exports.unknown()).default({}),
+      /** One-way origin key of the SESSION that minted this node (`ws_…`, a
+       *  truncated digest — never the raw session id). Stamped onto the created
+       *  node as `authoringSession`, which is the independence unit for the
+       *  evidence channels: the session that authored a claim may not corroborate
+       *  or refute it, while a DIFFERENT session on the same checkout may (alyssa,
+       *  2026-07-31 — the workspace key made every witness on a single-checkout
+       *  deployment a self-corroboration). Optional + additive: absent leaves the
+       *  gate fail-open for that node, exactly today's behaviour. */
+      originSession: external_exports.string().min(3).max(64).optional(),
       extractionSource: external_exports.enum(INGEST_EXTRACTION_SOURCES),
       validationSource: external_exports.enum(VALIDATION_SOURCES).optional(),
       /** Org-membrane (M2): the daemon's anchor tag — it owns the lockfile, so it
@@ -25134,6 +25154,9 @@ function backfillProblemContext(store2, ts) {
 }
 
 // ../../packages/local-graph/src/design-problem.ts
+function isConstraintProblem(node) {
+  return node.attrs["kind"] === "constraint";
+}
 function buildNode(id, label, description, ts, attrs) {
   return {
     id,
@@ -25189,6 +25212,7 @@ function priorsForFile(store2, relPath) {
   }
   if (!file2) return null;
   const openProblems = [];
+  const constraints = [];
   const seenProblem = /* @__PURE__ */ new Set();
   const related = /* @__PURE__ */ new Map();
   for (const e of store2.inEdges(file2.id, ["ANCHORED_AT"])) {
@@ -25197,14 +25221,14 @@ function priorsForFile(store2, relPath) {
     if (n.label === "Problem") {
       if (!n.attrs["resolvedAt"] && !seenProblem.has(n.id)) {
         seenProblem.add(n.id);
-        openProblems.push(n);
+        (isConstraintProblem(n) ? constraints : openProblems).push(n);
       }
     } else if (CITABLE_PRIOR_LABELS.has(n.label)) {
       related.set(n.id, n);
     }
   }
   const solutionsByProblem = /* @__PURE__ */ new Map();
-  for (const p of openProblems) {
+  for (const p of [...openProblems, ...constraints]) {
     for (const e of store2.outEdges(p.id, ["SOLVED_BY", "CAUSED_BY", "INSTANCE_OF"])) {
       const n = store2.getNode(e.to);
       if (n && CITABLE_PRIOR_LABELS.has(n.label)) related.set(n.id, n);
@@ -25215,9 +25239,11 @@ function priorsForFile(store2, relPath) {
       }
     }
   }
-  if (openProblems.length === 0 && related.size === 0) return null;
-  openProblems.sort((a, b) => (b.lastUpdatedAt ?? 0) - (a.lastUpdatedAt ?? 0));
-  return { file: file2, openProblems, related: [...related.values()], solutionsByProblem };
+  if (openProblems.length === 0 && constraints.length === 0 && related.size === 0) return null;
+  const recentFirst = (a, b) => (b.lastUpdatedAt ?? 0) - (a.lastUpdatedAt ?? 0);
+  openProblems.sort(recentFirst);
+  constraints.sort(recentFirst);
+  return { file: file2, openProblems, constraints, related: [...related.values()], solutionsByProblem };
 }
 function recordAnchorHint(store2, problemId, relPath, provenance, ts) {
   const p = store2.getNode(problemId);
@@ -25228,11 +25254,13 @@ function recordAnchorHint(store2, problemId, relPath, provenance, ts) {
   });
   return true;
 }
+var AUTO_MINT_PREFIX = "addressed by an edit to ";
 function resolveDesignProblems(store2, t) {
   let resolved = 0;
   for (const p of store2.findNodesByLabel("Problem")) {
     if (!p.id.startsWith("dprob_")) continue;
     if (p.attrs["resolvedAt"]) continue;
+    if (isConstraintProblem(p)) continue;
     let symName = "";
     let symRelPath;
     let edited = false;
@@ -25250,7 +25278,7 @@ function resolveDesignProblems(store2, t) {
     if (store2.outEdges(p.id, ["SOLVED_BY"]).length === 0) {
       const solId = `dfix_${digest({ problemId: p.id, edit: t })}`.slice(0, 56);
       store2.mergeNode(
-        buildNode(solId, "Solution", `addressed by an edit to ${symName}`, t, {
+        buildNode(solId, "Solution", `${AUTO_MINT_PREFIX}${symName}`, t, {
           source: "convo",
           provisional: false,
           // AC-resolution-attrs: the resolving symbol/file as STRUCTURED data, not
@@ -25273,7 +25301,6 @@ function resolveDesignProblems(store2, t) {
 }
 
 // ../../packages/local-graph/src/anchor-backfill.ts
-var AUTO_MINT_PREFIX = "addressed by an edit to ";
 function isLegacyAnchor(attrs) {
   return attrs?.["captureTime"] === true && attrs["anchorProvenance"] === void 0;
 }
@@ -25720,6 +25747,7 @@ function mergeDuplicateProblems(store2, opts) {
         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);
@@ -26052,12 +26080,14 @@ var AGENTS_POINTER_BODY = [
 init_src2();
 function buildSnapshot(opts) {
   const problems = opts.store.findNodesByLabel("Problem").filter((p) => p.attrs["mergedInto"] === void 0);
-  const allProblems = problems.filter((p) => p.attrs["resolvedAt"] == null);
+  const stillOpen = problems.filter((p) => p.attrs["resolvedAt"] == null);
+  const allProblems = stillOpen.filter((p) => !isConstraintProblem(p));
   allProblems.sort((a, b) => b.lastUpdatedAt - a.lastUpdatedAt);
   const recent = allProblems.slice(0, 8).map((p) => ({
     node: p,
     anchors: opts.store.outEdges(p.id, ["MANIFESTED_IN", "EVIDENCED_BY"])
   }));
+  const recentConstraints = stillOpen.filter((p) => isConstraintProblem(p)).sort((a, b) => b.lastUpdatedAt - a.lastUpdatedAt).slice(0, 3);
   const recentResolved = problems.filter((p) => p.attrs["resolvedAt"] != null && p.attrs["resolvedAs"] == null).sort((a, b) => Number(b.attrs["resolvedAt"] ?? 0) - Number(a.attrs["resolvedAt"] ?? 0)).slice(0, 4).map((p) => {
     const solEdge = opts.store.outEdges(p.id, ["SOLVED_BY"])[0];
     const solution = solEdge ? opts.store.getNode(solEdge.to) ?? void 0 : void 0;
@@ -26085,10 +26115,13 @@ function buildSnapshot(opts) {
     episodeId,
     problems: problems2
   }));
-  const needsRevisit = listNeedsRevisit(
-    opts.store,
-    (opts.now ?? /* @__PURE__ */ new Date()).getTime()
-  ).slice(0, 10);
+  const revisitSeen = /* @__PURE__ */ new Set();
+  const needsRevisit = listNeedsRevisit(opts.store, (opts.now ?? /* @__PURE__ */ new Date()).getTime()).filter((r) => {
+    const key = `${r.label}:${r.description.trim().toLowerCase()}`;
+    if (revisitSeen.has(key)) return false;
+    revisitSeen.add(key);
+    return true;
+  }).slice(0, 5);
   const norm = (x) => x.toLowerCase().replace(/[^a-z0-9]+/g, "");
   const pkgBase = (x) => {
     const at = x.lastIndexOf("@");
@@ -26124,6 +26157,7 @@ function buildSnapshot(opts) {
     profileContext,
     recentProblems: recent,
     recentResolved,
+    recentConstraints,
     ...causalNudge ? { causalNudge } : {},
     ...domainNudge ? { domainNudge } : {},
     motifs,
@@ -26176,6 +26210,7 @@ function sliceForFile(store2, relPath) {
   const fp = priorsForFile(store2, relPath);
   const priors = fp ? {
     openProblems: fp.openProblems.slice(0, 3).map((p) => ({ id: p.id, description: p.description })),
+    constraints: fp.constraints.slice(0, 2).map((c) => ({ id: c.id, description: c.description })),
     related: fp.related.slice(0, 4).map((n) => ({ id: n.id, label: n.label, description: n.description })),
     solutionsByProblem: Object.fromEntries(
       fp.openProblems.slice(0, 3).map((p) => [