@inerrata-corporation/errata 2.0.2-dev.982 → 2.0.2

package/package.json

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

package/pass-worker.mjs

@@ -212,7 +212,7 @@ var init_castalia = __esm({
     DECOMPOSITION_EDGES = ["SPLIT_INTO"];
     TRANSFER_EDGES = ["MAY_RESOLVE"];
     SOLUTION_STRUCTURE_EDGES = ["BUILDS_ON", "SUPERSEDES", "ALTERNATIVE_TO"];
-    SUSPICION_EDGES = ["SUSPECTED_LINK"];
+    SUSPICION_EDGES = ["SUSPECTED_LINK", "REGRESSION_OF"];
     TAXONOMY_EDGES = ["IS_A"];
     TRIAGE_EDGES = ["TRIAGED_BY", "CONFIRMS", "INDICATES", "ROUTES_TO"];
     GIT_EDGES = ["POINTS_AT", "PARENT", "AUTHORED_BY"];
@@ -277,8 +277,10 @@ var init_castalia = __esm({
       "ALTERNATIVE_TO",
       // symmetric peer marker — weight would let alternatives inflate each other
       // NB: BUILDS_ON is NOT excluded — it flows extension→base so foundational solutions rank up.
-      "SUSPECTED_LINK"
+      "SUSPECTED_LINK",
       // Somnus hypothesis (PLAN_SOMNUS_V2 §4) — never flows rank; navigation-invisible.
+      "REGRESSION_OF"
+      // recurrence marker (RG-recognize) — a question about a close, not signal-flow.
     ]);
     EDGE_WEIGHT = {
       // Causal — high signal
@@ -391,6 +393,7 @@ var init_castalia = __esm({
       ALTERNATIVE_TO: 0,
       // Suspicion — a hypothesis, weightless + PageRank-excluded (never flows rank / EIG).
       SUSPECTED_LINK: 0,
+      REGRESSION_OF: 0,
       // Git — topology/authorship, weightless (not domain signal-flow)
       POINTS_AT: 0,
       PARENT: 0,
@@ -421,6 +424,13 @@ var init_castalia = __esm({
   }
 });
 
+// ../../packages/shared/src/graph-events.ts
+var init_graph_events = __esm({
+  "../../packages/shared/src/graph-events.ts"() {
+    "use strict";
+  }
+});
+
 // ../../packages/shared/src/canonical/hash.ts
 import { createHash } from "node:crypto";
 function sha256(input) {
@@ -15322,6 +15332,7 @@ var init_src = __esm({
   "../../packages/shared/src/index.ts"() {
     "use strict";
     init_castalia();
+    init_graph_events();
     init_identity();
     init_wire();
     init_edge_rules();
@@ -24288,7 +24299,13 @@ var LOCAL_RULE_OVERRIDES = {
   // the cloud door's `to: [Solution]` rule is untouched. The `from` constraint
   // stays: the reversed (Solution)-FIXED_BY->(...) splash bug is the reason
   // this rule exists at all.
-  FIXED_BY: { from: EDGE_RULES["FIXED_BY"]?.from, to: ["Solution", "Episode"] }
+  FIXED_BY: { from: EDGE_RULES["FIXED_BY"]?.from, to: ["Solution", "Episode"] },
+  // RG-recognize: a NEW open Problem re-observing a RESOLVED one ("this is
+  // back — the fix didn't hold"). Local-only for now: the instance drain's
+  // INSTANCE_EDGES allowlist doesn't ship it, and the cloud door's matrix
+  // doesn't know it — crossing the membrane is a deliberate later step, never
+  // a side effect (the half-shipped-edge-type lesson).
+  REGRESSION_OF: { from: ["Problem"], to: ["Problem"] }
 };
 function localEdgeViolation(fromLabel, type, toLabel) {
   if (type in LOCAL_RULE_OVERRIDES) {
@@ -25717,11 +25734,16 @@ function foldDuplicateProblem(store2, dup, survivor, ts) {
   if (!surv) return;
   const sources = new Set(surv.attrs["sources"] ?? []);
   for (const s of dup.attrs["sources"] ?? []) sources.add(s);
+  const dupSeq = dup.attrs["createdAtSeq"] ?? store2.currentIngestSeq();
+  const exposure = priorExposure(store2, survivor.id, dupSeq);
+  const expField = `reinforce${exposure[0].toUpperCase()}${exposure.slice(1)}Count`;
   store2.updateNode(survivor.id, {
     attrs: {
       ...surv.attrs,
       sources: [...sources],
-      corroborations: corroborations(surv) + corroborations(dup) + 1
+      corroborations: corroborations(surv) + corroborations(dup) + 1,
+      [expField]: (surv.attrs[expField] ?? 0) + 1,
+      lastReinforceExposure: exposure
     },
     cumulativeHits: (surv.cumulativeHits ?? 0) + (dup.cumulativeHits ?? 0),
     lastUpdatedAt: ts
@@ -25750,6 +25772,7 @@ function foldDuplicateProblem(store2, dup, survivor, ts) {
 function isConstraintProblem(node) {
   return node.attrs["kind"] === "constraint";
 }
+var RECURRENCE_DEBOUNCE_MS = 60 * 60 * 1e3;
 var CITABLE_PRIOR_LABELS = /* @__PURE__ */ new Set([
   "Solution",
   "RootCause",
@@ -25936,6 +25959,16 @@ function clearSettledFixCandidates(store2, t) {
   }
   return report;
 }
+function priorExposure(store2, nodeId, atSeq) {
+  const n = store2.getNode(nodeId);
+  if (!n || !n.attrs) return "unshown";
+  const shownSeq = n.attrs["lastShownAtSeq"];
+  if (shownSeq !== void 0 && shownSeq <= atSeq) return "shown";
+  const evictedSeq = n.attrs["lastEvictedAtSeq"];
+  if (evictedSeq !== void 0 && evictedSeq <= atSeq) return "evicted";
+  if ((n.attrs["evictedCount"] ?? 0) > 0) return "evicted";
+  return "unshown";
+}
 
 // ../../packages/local-graph/src/intent.ts
 init_src();
@@ -27034,7 +27067,19 @@ function buildSnapshot(opts) {
     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 regressions = problems.filter((p) => p.attrs["resolvedAt"] == null && p.attrs["mergedInto"] === void 0).flatMap(
+    (open) => opts.store.outEdges(open.id, ["REGRESSION_OF"]).flatMap((e) => {
+      const closed = opts.store.getNode(e.to);
+      if (!closed || closed.attrs["resolutionSuspect"] !== true || closed.attrs["resolvedAt"] == null) {
+        return [];
+      }
+      const solEdge = opts.store.outEdges(closed.id, ["SOLVED_BY"])[0];
+      const solution = solEdge ? opts.store.getNode(solEdge.to) ?? void 0 : void 0;
+      return [{ open, closed, ...solution ? { solution } : {} }];
+    })
+  ).sort((a, b) => Number(b.closed.attrs["recurredAt"] ?? 0) - Number(a.closed.attrs["recurredAt"] ?? 0)).slice(0, 2);
+  const regressionClosedIds = new Set(regressions.map((r) => r.closed.id));
+  const recentResolved = problems.filter((p) => p.attrs["resolvedAt"] != null && p.attrs["resolvedAs"] == null).filter((p) => !regressionClosedIds.has(p.id)).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;
     return { node: p, ...solution ? { solution } : {} };
@@ -27104,6 +27149,7 @@ function buildSnapshot(opts) {
     recentProblems: recent,
     recentResolved,
     recentConstraints,
+    regressions,
     ...causalNudge ? { causalNudge } : {},
     ...opts.selfCiteSkips && opts.selfCiteSkips > 0 ? { selfCiteSkips: opts.selfCiteSkips } : {},
     ...domainNudge ? { domainNudge } : {},