@inerrata-corporation/errata 2.0.2-dev.361 → 2.0.2-dev.417

package/consolidate-worker.mjs

@@ -16962,213 +16962,6 @@ function detectCommunitiesLeiden(input, opts = {}) {
   return normalize(assignment);
 }
 
-// ../../packages/local-graph/src/abstraction.ts
-var DEFAULT_MIN_CLUSTER_SIZE = 3;
-var DEFAULT_MIN_DISTINCT_CONTEXTS = 2;
-function sharedScope(l2, memberIds) {
-  const shared = (field) => {
-    const vals = /* @__PURE__ */ new Set();
-    for (const id of memberIds) {
-      const s = l2.getNode(id)?.attrs["scope"] ?? {};
-      if (typeof s[field] === "string") vals.add(s[field]);
-    }
-    return vals.size === 1 ? [...vals][0] : void 0;
-  };
-  const lang = shared("lang");
-  const versionRange = shared("versionRange");
-  return { ...lang ? { lang } : {}, ...versionRange ? { versionRange } : {} };
-}
-function buildCandidate(id, ts, members, contexts, originMachine, scope) {
-  return {
-    id,
-    label: "Claim",
-    description: "",
-    // empty — the harness distills the prose in P3
-    extractionConfidence: 0.4,
-    extractionSource: "agent-observed",
-    embedding: [],
-    cumulativeSurprise: 0,
-    peakSurprise: 0,
-    cumulativeHits: 1,
-    lastUpdatedAt: ts,
-    createdAt: ts,
-    memoryTier: "short-term",
-    pageRank: 0,
-    isLandmark: false,
-    community: null,
-    stability: "unstable",
-    attrs: {
-      abstractionLevel: ABSTRACTION_LEVEL.PRINCIPLE,
-      kind: "abstraction-candidate",
-      provisional: true,
-      pendingDistillation: true,
-      // membership is the unit of truth — the harness validates its fence against
-      // this set (P3 / C3) and may only phrase, never alter, it.
-      members,
-      memberContexts: contexts,
-      distinctContexts: contexts.length,
-      // standard Claim envelope so it crystallizes/syncs unchanged once distilled
-      truthKind: "contextual",
-      // Derived from members (P1): a single-language cluster becomes a lang-scoped
-      // principle; a cross-language one stays universal (`{}`).
-      scope,
-      groundedSupport: 0,
-      sources: [],
-      crystallized: "hypothesis",
-      confidence: 0.4,
-      ...originMachine ? { originMachine } : {}
-    }
-  };
-}
-function mergeGeneralizes(store, principleId, memberId, ts) {
-  store.mergeEdge({
-    id: `edge_${digest({ from: principleId, type: "GENERALIZES", to: memberId })}`.slice(0, 24),
-    from: principleId,
-    to: memberId,
-    type: "GENERALIZES",
-    confidence: 0.4,
-    extractionSource: "agent-observed",
-    createdAt: ts,
-    lastSeenAt: ts,
-    navSuccesses: 0,
-    navFailures: 0,
-    attrs: { provisional: true }
-  });
-}
-function induceAbstractions(l2, opts) {
-  const K = opts.minClusterSize ?? DEFAULT_MIN_CLUSTER_SIZE;
-  const minCtx = opts.minDistinctContexts ?? DEFAULT_MIN_DISTINCT_CONTEXTS;
-  const report = {
-    communities: 0,
-    candidatesMinted: 0,
-    candidatesExisting: 0,
-    skippedSmall: 0,
-    skippedSingleContext: 0,
-    generalizesEdges: 0
-  };
-  const ids = /* @__PURE__ */ new Set();
-  for (const label of PERCOLATING_LABELS) {
-    for (const n of l2.findNodesByLabel(label)) {
-      if (Number(n.attrs["abstractionLevel"] ?? ABSTRACTION_LEVEL.CONCRETE) >= ABSTRACTION_LEVEL.PRINCIPLE) {
-        continue;
-      }
-      if (n.attrs["resolvedAs"] === PROBLEM_RESOLUTION.FALSE_POSITIVE) continue;
-      ids.add(n.id);
-    }
-  }
-  if (ids.size === 0) return report;
-  const adj = /* @__PURE__ */ new Map();
-  const protect = [];
-  const add = (a, b, w) => {
-    const l = adj.get(a) ?? [];
-    l.push({ to: b, weight: w });
-    adj.set(a, l);
-  };
-  for (const id of ids) {
-    for (const e of l2.outEdges(id, [...PERCOLATING_EDGES])) {
-      if (!ids.has(e.to)) continue;
-      const conf = e.confidence > 0 ? e.confidence : 0.5;
-      const w = Math.max(EDGE_WEIGHT[e.type] ?? 1, 0.1) * conf;
-      add(id, e.to, w);
-      add(e.to, id, w);
-      if (isCausalProtected(e.type)) protect.push([id, e.to]);
-    }
-  }
-  const comm = detectCommunitiesLeiden({ nodeIds: [...ids], adj }, { protect });
-  report.communities = comm.count;
-  const members = /* @__PURE__ */ new Map();
-  for (const [id, c] of comm.community) {
-    const l = members.get(c) ?? [];
-    l.push(id);
-    members.set(c, l);
-  }
-  l2.transaction(() => {
-    for (const mem of members.values()) {
-      if (opts.touched && !mem.some((id) => opts.touched.has(id))) continue;
-      if (mem.length < K) {
-        report.skippedSmall++;
-        continue;
-      }
-      if (mem.some((id) => l2.inEdges(id, ["GENERALIZES"]).length > 0)) {
-        report.candidatesExisting++;
-        continue;
-      }
-      const contexts = /* @__PURE__ */ new Set();
-      for (const id of mem) {
-        const n = l2.getNode(id);
-        const obs = n?.attrs["observedInProjects"];
-        if (Array.isArray(obs)) {
-          for (const ws of obs) contexts.add(opts.contextOf(ws) ?? `project:${ws}`);
-        }
-      }
-      if (contexts.size < minCtx) {
-        report.skippedSingleContext++;
-        continue;
-      }
-      const sorted = [...mem].sort();
-      const principleId = `princ_${digest({ members: sorted })}`.slice(0, 56);
-      l2.mergeNode(
-        buildCandidate(principleId, opts.ts, sorted, [...contexts].sort(), opts.originMachine, sharedScope(l2, sorted))
-      );
-      for (const id of sorted) {
-        mergeGeneralizes(l2, principleId, id, opts.ts);
-        report.generalizesEdges++;
-      }
-      report.candidatesMinted++;
-    }
-  });
-  return report;
-}
-function revisitContradictedPrinciples(l2, ts) {
-  const report = { flagged: 0 };
-  l2.transaction(() => {
-    for (const n of l2.findNodesByLabel("Claim")) {
-      if (Number(n.attrs["abstractionLevel"] ?? ABSTRACTION_LEVEL.CONCRETE) < ABSTRACTION_LEVEL.PRINCIPLE) continue;
-      if (n.attrs["revisit"] === true) continue;
-      const members = Array.isArray(n.attrs["members"]) ? n.attrs["members"] : [];
-      const memberSet = new Set(members);
-      let reason = "";
-      for (const id of members) {
-        const m = l2.getNode(id);
-        if (!m) {
-          reason = `member ${id} was removed`;
-          break;
-        }
-        if (m.attrs["revisit"] === true) {
-          reason = `member "${m.description}" needs revisit`;
-          break;
-        }
-        const contradictors = [
-          ...l2.outEdges(id, ["CONTRADICTS"]).map((e) => e.to),
-          ...l2.inEdges(id, ["CONTRADICTS"]).map((e) => e.from)
-        ];
-        if (contradictors.some((other) => !memberSet.has(other))) {
-          reason = `member "${m.description}" is now contradicted by external evidence`;
-          break;
-        }
-      }
-      if (!reason) continue;
-      l2.updateNode(n.id, {
-        attrs: {
-          ...n.attrs,
-          revisit: true,
-          revisitReason: reason,
-          revisitSinceTs: ts,
-          provisional: true,
-          // re-queue for re-distillation (P3 re-name)
-          pendingDistillation: true
-        },
-        lastUpdatedAt: ts
-      });
-      report.flagged++;
-    }
-  });
-  return report;
-}
-
-// ../../packages/local-graph/src/community.ts
-init_src2();
-
 // ../../packages/local-graph/src/triage.ts
 init_src();
 init_src();
@@ -17421,6 +17214,213 @@ function revisitStaleRoutes(l2, ts, opts = {}) {
 }
 var DRIFT_VALUES = new Set(Object.values(DRIFT_KIND));
 
+// ../../packages/local-graph/src/abstraction.ts
+var DEFAULT_MIN_CLUSTER_SIZE = 3;
+var DEFAULT_MIN_DISTINCT_CONTEXTS = 2;
+function sharedScope(l2, memberIds) {
+  const shared = (field) => {
+    const vals = /* @__PURE__ */ new Set();
+    for (const id of memberIds) {
+      const s = l2.getNode(id)?.attrs["scope"] ?? {};
+      if (typeof s[field] === "string") vals.add(s[field]);
+    }
+    return vals.size === 1 ? [...vals][0] : void 0;
+  };
+  const lang = shared("lang");
+  const versionRange = shared("versionRange");
+  return { ...lang ? { lang } : {}, ...versionRange ? { versionRange } : {} };
+}
+function buildCandidate(id, ts, members, contexts, originMachine, scope) {
+  return {
+    id,
+    label: "Claim",
+    description: "",
+    // empty — the harness distills the prose in P3
+    extractionConfidence: 0.4,
+    extractionSource: "agent-observed",
+    embedding: [],
+    cumulativeSurprise: 0,
+    peakSurprise: 0,
+    cumulativeHits: 1,
+    lastUpdatedAt: ts,
+    createdAt: ts,
+    memoryTier: "short-term",
+    pageRank: 0,
+    isLandmark: false,
+    community: null,
+    stability: "unstable",
+    attrs: {
+      abstractionLevel: ABSTRACTION_LEVEL.PRINCIPLE,
+      kind: "abstraction-candidate",
+      provisional: true,
+      pendingDistillation: true,
+      // membership is the unit of truth — the harness validates its fence against
+      // this set (P3 / C3) and may only phrase, never alter, it.
+      members,
+      memberContexts: contexts,
+      distinctContexts: contexts.length,
+      // standard Claim envelope so it crystallizes/syncs unchanged once distilled
+      truthKind: "contextual",
+      // Derived from members (P1): a single-language cluster becomes a lang-scoped
+      // principle; a cross-language one stays universal (`{}`).
+      scope,
+      groundedSupport: 0,
+      sources: [],
+      crystallized: "hypothesis",
+      confidence: 0.4,
+      ...originMachine ? { originMachine } : {}
+    }
+  };
+}
+function mergeGeneralizes(store, principleId, memberId, ts) {
+  store.mergeEdge({
+    id: `edge_${digest({ from: principleId, type: "GENERALIZES", to: memberId })}`.slice(0, 24),
+    from: principleId,
+    to: memberId,
+    type: "GENERALIZES",
+    confidence: 0.4,
+    extractionSource: "agent-observed",
+    createdAt: ts,
+    lastSeenAt: ts,
+    navSuccesses: 0,
+    navFailures: 0,
+    attrs: { provisional: true }
+  });
+}
+function induceAbstractions(l2, opts) {
+  const K = opts.minClusterSize ?? DEFAULT_MIN_CLUSTER_SIZE;
+  const minCtx = opts.minDistinctContexts ?? DEFAULT_MIN_DISTINCT_CONTEXTS;
+  const report = {
+    communities: 0,
+    candidatesMinted: 0,
+    candidatesExisting: 0,
+    skippedSmall: 0,
+    skippedSingleContext: 0,
+    generalizesEdges: 0
+  };
+  const ids = /* @__PURE__ */ new Set();
+  for (const label of PERCOLATING_LABELS) {
+    for (const n of l2.findNodesByLabel(label)) {
+      if (Number(n.attrs["abstractionLevel"] ?? ABSTRACTION_LEVEL.CONCRETE) >= ABSTRACTION_LEVEL.PRINCIPLE) {
+        continue;
+      }
+      if (n.attrs["resolvedAs"] === PROBLEM_RESOLUTION.FALSE_POSITIVE) continue;
+      ids.add(n.id);
+    }
+  }
+  if (ids.size === 0) return report;
+  const adj = /* @__PURE__ */ new Map();
+  const protect = [];
+  const add = (a, b, w) => {
+    const l = adj.get(a) ?? [];
+    l.push({ to: b, weight: w });
+    adj.set(a, l);
+  };
+  for (const id of ids) {
+    for (const e of l2.outEdges(id, [...PERCOLATING_EDGES])) {
+      if (!ids.has(e.to)) continue;
+      const conf = e.confidence > 0 ? e.confidence : 0.5;
+      const w = Math.max(EDGE_WEIGHT[e.type] ?? 1, 0.1) * conf;
+      add(id, e.to, w);
+      add(e.to, id, w);
+      if (isCausalProtected(e.type)) protect.push([id, e.to]);
+    }
+  }
+  const comm = detectCommunitiesLeiden({ nodeIds: [...ids], adj }, { protect });
+  report.communities = comm.count;
+  const members = /* @__PURE__ */ new Map();
+  for (const [id, c] of comm.community) {
+    const l = members.get(c) ?? [];
+    l.push(id);
+    members.set(c, l);
+  }
+  l2.transaction(() => {
+    for (const mem of members.values()) {
+      if (opts.touched && !mem.some((id) => opts.touched.has(id))) continue;
+      if (mem.length < K) {
+        report.skippedSmall++;
+        continue;
+      }
+      if (mem.some((id) => l2.inEdges(id, ["GENERALIZES"]).length > 0)) {
+        report.candidatesExisting++;
+        continue;
+      }
+      const contexts = /* @__PURE__ */ new Set();
+      for (const id of mem) {
+        const n = l2.getNode(id);
+        const obs = n?.attrs["observedInProjects"];
+        if (Array.isArray(obs)) {
+          for (const ws of obs) contexts.add(opts.contextOf(ws) ?? `project:${ws}`);
+        }
+      }
+      if (contexts.size < minCtx) {
+        report.skippedSingleContext++;
+        continue;
+      }
+      const sorted = [...mem].sort();
+      const principleId = `princ_${digest({ members: sorted })}`.slice(0, 56);
+      l2.mergeNode(
+        buildCandidate(principleId, opts.ts, sorted, [...contexts].sort(), opts.originMachine, sharedScope(l2, sorted))
+      );
+      for (const id of sorted) {
+        mergeGeneralizes(l2, principleId, id, opts.ts);
+        report.generalizesEdges++;
+      }
+      report.candidatesMinted++;
+    }
+  });
+  return report;
+}
+function revisitContradictedPrinciples(l2, ts) {
+  const report = { flagged: 0 };
+  l2.transaction(() => {
+    for (const n of l2.findNodesByLabel("Claim")) {
+      if (Number(n.attrs["abstractionLevel"] ?? ABSTRACTION_LEVEL.CONCRETE) < ABSTRACTION_LEVEL.PRINCIPLE) continue;
+      if (n.attrs["revisit"] === true) continue;
+      const members = Array.isArray(n.attrs["members"]) ? n.attrs["members"] : [];
+      const memberSet = new Set(members);
+      let reason = "";
+      for (const id of members) {
+        const m = l2.getNode(id);
+        if (!m) {
+          reason = `member ${id} was removed`;
+          break;
+        }
+        if (m.attrs["revisit"] === true) {
+          reason = `member "${m.description}" needs revisit`;
+          break;
+        }
+        const contradictors = [
+          ...l2.outEdges(id, ["CONTRADICTS"]).map((e) => e.to),
+          ...l2.inEdges(id, ["CONTRADICTS"]).map((e) => e.from)
+        ];
+        if (contradictors.some((other) => !memberSet.has(other))) {
+          reason = `member "${m.description}" is now contradicted by external evidence`;
+          break;
+        }
+      }
+      if (!reason) continue;
+      l2.updateNode(n.id, {
+        attrs: {
+          ...n.attrs,
+          revisit: true,
+          revisitReason: reason,
+          revisitSinceTs: ts,
+          provisional: true,
+          // re-queue for re-distillation (P3 re-name)
+          pendingDistillation: true
+        },
+        lastUpdatedAt: ts
+      });
+      report.flagged++;
+    }
+  });
+  return report;
+}
+
+// ../../packages/local-graph/src/community.ts
+init_src2();
+
 // ../../packages/local-graph/src/problem-dedup.ts
 init_src();
 init_src();