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

package/errata.mjs

@@ -19177,7 +19177,55 @@ function percolate(l1, l2, opts) {
   result.touched = [...touched];
   return result;
 }
-var PERCOLATING_LABELS, PERCOLATING_EDGES, PERCOLATING_DRIFT_EDGES;
+function migrateProjectAlias(l2, opts) {
+  const { from, to } = opts;
+  let nodesRewritten = 0;
+  let edgesRewritten = 0;
+  if (from === to) return { nodesRewritten, edgesRewritten };
+  const rewrite = (seen) => {
+    if (!seen.includes(from)) return null;
+    const out2 = [];
+    for (const p of seen.map((p2) => p2 === from ? to : p2)) if (!out2.includes(p)) out2.push(p);
+    return out2;
+  };
+  const nodeUpdates = [];
+  const edgeUpdates = [];
+  const seenEdges = /* @__PURE__ */ new Set();
+  for (const label of PROVENANCE_LABELS) {
+    for (const n of l2.findNodesByLabel(label)) {
+      const next = rewrite(observedProjects(n));
+      if (next) nodeUpdates.push({ id: n.id, attrs: { ...n.attrs, observedInProjects: next } });
+      for (const e of l2.outEdges(n.id, [...PERCOLATING_DRIFT_EDGES])) {
+        if (seenEdges.has(e.id)) continue;
+        seenEdges.add(e.id);
+        const eSeen = Array.isArray(e.attrs["observedInProjects"]) ? e.attrs["observedInProjects"] : [];
+        const eNext = rewrite(eSeen);
+        if (eNext) edgeUpdates.push({ id: e.id, attrs: { ...e.attrs, observedInProjects: eNext } });
+      }
+    }
+  }
+  const CHUNK = 200;
+  for (let i2 = 0; i2 < nodeUpdates.length; i2 += CHUNK) {
+    const slice = nodeUpdates.slice(i2, i2 + CHUNK);
+    l2.transaction(() => {
+      for (const u of slice) {
+        l2.updateNode(u.id, { attrs: u.attrs, lastUpdatedAt: opts.ts });
+        nodesRewritten++;
+      }
+    });
+  }
+  for (let i2 = 0; i2 < edgeUpdates.length; i2 += CHUNK) {
+    const slice = edgeUpdates.slice(i2, i2 + CHUNK);
+    l2.transaction(() => {
+      for (const u of slice) {
+        l2.updateEdge(u.id, { attrs: u.attrs, lastSeenAt: opts.ts });
+        edgesRewritten++;
+      }
+    });
+  }
+  return { nodesRewritten, edgesRewritten };
+}
+var PERCOLATING_LABELS, PERCOLATING_EDGES, PERCOLATING_DRIFT_EDGES, PROVENANCE_LABELS;
 var init_percolate = __esm({
   "../../packages/local-graph/src/percolate.ts"() {
     "use strict";
@@ -19185,6 +19233,7 @@ var init_percolate = __esm({
     PERCOLATING_LABELS = ["Claim", "Problem", "Solution"];
     PERCOLATING_EDGES = ["CAUSED_BY", "SOLVED_BY", "CONTRADICTS"];
     PERCOLATING_DRIFT_EDGES = ["CONTINUES", "REVEALED_BY", "SUPERSEDED_BY", "SPLIT_INTO"];
+    PROVENANCE_LABELS = ["Claim", "Problem", "Solution", "Triage", "RootCause"];
   }
 });
 
@@ -19937,463 +19986,6 @@ var init_src3 = __esm({
   }
 });
 
-// ../../packages/local-graph/src/abstraction.ts
-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 pendingAbstractions(l2) {
-  const out2 = [];
-  for (const n of l2.findNodesByLabel("Claim")) {
-    if (Number(n.attrs["abstractionLevel"] ?? ABSTRACTION_LEVEL.CONCRETE) < ABSTRACTION_LEVEL.PRINCIPLE) continue;
-    if (n.attrs["provisional"] !== true) continue;
-    const memberIds = Array.isArray(n.attrs["members"]) ? n.attrs["members"] : [];
-    const members = memberIds.map((id) => {
-      const m = l2.getNode(id);
-      return m ? { id: m.id, label: m.label, description: m.description } : { id, label: "?", description: "(member missing)" };
-    });
-    out2.push({
-      candidate: n.id,
-      distinctContexts: Number(n.attrs["distinctContexts"] ?? 0),
-      members
-    });
-  }
-  return out2;
-}
-function parseAbstractionFences(text) {
-  const out2 = [];
-  const block = /```errata-abstraction[^\n]*\n([\s\S]*?)```/g;
-  let m;
-  while ((m = block.exec(text)) !== null) {
-    const fields = {};
-    for (const line of m[1].split(/\r?\n/)) {
-      const kv = /^\s*(candidate|principle|covers)\s*:\s*(.+?)\s*$/i.exec(line);
-      if (kv) fields[kv[1].toLowerCase()] = kv[2].trim();
-    }
-    if (!fields["candidate"] || !fields["principle"] || !fields["covers"]) continue;
-    const covers = fields["covers"].split(/[,\s]+/).map((s) => s.trim()).filter(Boolean);
-    if (covers.length === 0) continue;
-    out2.push({ candidate: fields["candidate"], principle: fields["principle"], covers });
-  }
-  return out2;
-}
-function applyAbstractionFence(l2, fence, ts) {
-  const node2 = l2.getNode(fence.candidate);
-  if (!node2 || node2.label !== "Claim" || Number(node2.attrs["abstractionLevel"] ?? ABSTRACTION_LEVEL.CONCRETE) < ABSTRACTION_LEVEL.PRINCIPLE) {
-    return { applied: false, principleId: fence.candidate, reason: "no such abstraction candidate" };
-  }
-  if (node2.attrs["provisional"] !== true) {
-    return { applied: false, principleId: fence.candidate, reason: "candidate already distilled" };
-  }
-  const members = Array.isArray(node2.attrs["members"]) ? node2.attrs["members"] : [];
-  const want = new Set(members);
-  const got = new Set(fence.covers);
-  const missing = members.filter((id) => !got.has(id));
-  const invented = fence.covers.filter((id) => !want.has(id));
-  if (missing.length > 0 || invented.length > 0) {
-    return {
-      applied: false,
-      principleId: fence.candidate,
-      reason: `coverage mismatch \u2014 ${missing.length} member(s) uncovered, ${invented.length} non-member(s) invented`
-    };
-  }
-  const principle = fence.principle.trim();
-  if (!principle) return { applied: false, principleId: fence.candidate, reason: "empty principle" };
-  const { revisit: _r, revisitReason: _rr, revisitSinceTs: _rs, ...rest2 } = node2.attrs;
-  void _r;
-  void _rr;
-  void _rs;
-  l2.updateNode(fence.candidate, {
-    description: principle,
-    attrs: { ...rest2, provisional: false, pendingDistillation: false, distilledAt: ts },
-    lastUpdatedAt: ts
-  });
-  return { applied: true, principleId: fence.candidate };
-}
-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;
-}
-function harvestAbstractionFences(l2, text, ts) {
-  let applied = 0;
-  let rejected = 0;
-  for (const fence of parseAbstractionFences(text)) {
-    if (applyAbstractionFence(l2, fence, ts).applied) applied++;
-    else rejected++;
-  }
-  return { applied, rejected };
-}
-var DEFAULT_MIN_CLUSTER_SIZE, DEFAULT_MIN_DISTINCT_CONTEXTS;
-var init_abstraction = __esm({
-  "../../packages/local-graph/src/abstraction.ts"() {
-    "use strict";
-    init_src();
-    init_src2();
-    init_src3();
-    init_percolate();
-    DEFAULT_MIN_CLUSTER_SIZE = 3;
-    DEFAULT_MIN_DISTINCT_CONTEXTS = 2;
-  }
-});
-
-// ../../packages/local-graph/src/community.ts
-function detectLocalCommunities(store, opts = {}) {
-  const minSize = opts.minCommunitySize ?? DEFAULT_MIN_COMMUNITY_SIZE;
-  const report = { candidates: 0, communities: 0, joint: 0, assigned: 0 };
-  const ids = /* @__PURE__ */ new Set();
-  for (const label of JOINT_COMMUNITY_LABELS) {
-    for (const n of store.findNodesByLabel(label)) {
-      if (label === "Problem" && n.attrs["resolvedAs"] === PROBLEM_RESOLUTION.FALSE_POSITIVE) continue;
-      ids.add(n.id);
-    }
-  }
-  report.candidates = ids.size;
-  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 store.outEdges(id, [...JOINT_COMMUNITY_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 });
-  const members = /* @__PURE__ */ new Map();
-  for (const [id, c] of comm.community) {
-    const l = members.get(c) ?? [];
-    l.push(id);
-    members.set(c, l);
-  }
-  store.transaction(() => {
-    for (const [cid, mem] of members) {
-      const qualifies = mem.length >= minSize;
-      let hasLocal = false;
-      let hasCloud = false;
-      for (const id of mem) {
-        const n = store.getNode(id);
-        if (!n) continue;
-        const pulled = n.attrs["source"] === "cloud";
-        if (pulled) hasCloud = true;
-        else hasLocal = true;
-        const nextAttrs = { ...n.attrs };
-        if (qualifies) nextAttrs["localCommunity"] = cid;
-        else delete nextAttrs["localCommunity"];
-        store.updateNode(id, { attrs: nextAttrs });
-        if (!pulled) store.setCommunity(id, qualifies ? cid : null);
-      }
-      if (qualifies) {
-        report.communities++;
-        report.assigned += mem.length;
-        if (hasLocal && hasCloud) report.joint++;
-      }
-    }
-  });
-  return report;
-}
-function communitySeeds(store, opts = {}) {
-  const maxCommunities = opts.maxCommunities ?? 4;
-  const maxSeeds = opts.maxSeeds ?? 32;
-  const byCommunity = /* @__PURE__ */ new Map();
-  for (const label of JOINT_COMMUNITY_LABELS) {
-    for (const n of store.findNodesByLabel(label)) {
-      const cid = n.attrs["localCommunity"];
-      if (typeof cid !== "string") continue;
-      const cloudId = n.attrs["cloudNodeId"];
-      const l = byCommunity.get(cid) ?? [];
-      l.push({
-        id: n.id,
-        pulled: n.attrs["source"] === "cloud",
-        cloudId: typeof cloudId === "string" && cloudId !== n.id ? cloudId : null,
-        ts: n.lastUpdatedAt
-      });
-      byCommunity.set(cid, l);
-    }
-  }
-  if (byCommunity.size === 0) return [];
-  const ranked = [...byCommunity.entries()].map(([cid, mem]) => ({ cid, mem, fresh: Math.max(...mem.map((m) => m.ts)) })).sort((a, b) => b.fresh - a.fresh).slice(0, maxCommunities);
-  const seeds = [];
-  const seen = /* @__PURE__ */ new Set();
-  const push = (id) => {
-    if (seeds.length >= maxSeeds || seen.has(id)) return;
-    seen.add(id);
-    seeds.push(id);
-  };
-  for (const { mem } of ranked) {
-    const ordered = [...mem].sort(
-      (a, b) => a.pulled === b.pulled ? b.ts - a.ts : a.pulled ? -1 : 1
-    );
-    for (const m of ordered) {
-      push(m.id);
-      if (m.cloudId) push(m.cloudId);
-    }
-  }
-  return seeds;
-}
-function communityInductionRequests(store, opts = {}) {
-  const maxCommunities = opts.maxCommunities ?? 2;
-  const byCommunity = /* @__PURE__ */ new Map();
-  for (const label of JOINT_COMMUNITY_LABELS) {
-    for (const n of store.findNodesByLabel(label)) {
-      const cid = n.attrs["localCommunity"];
-      if (typeof cid !== "string") continue;
-      const cloudId = n.attrs["cloudNodeId"];
-      const l = byCommunity.get(cid) ?? [];
-      l.push({
-        id: n.id,
-        pulled: n.attrs["source"] === "cloud",
-        cloudId: typeof cloudId === "string" && cloudId !== n.id ? cloudId : null,
-        ts: n.lastUpdatedAt,
-        description: n.description
-      });
-      byCommunity.set(cid, l);
-    }
-  }
-  if (byCommunity.size === 0) return [];
-  return [...byCommunity.entries()].map(([cid, mem]) => ({ cid, mem, fresh: Math.max(...mem.map((m) => m.ts)) })).sort((a, b) => b.fresh - a.fresh).map(({ cid, mem }) => {
-    const ids = /* @__PURE__ */ new Set();
-    for (const m of mem) {
-      ids.add(m.id);
-      if (m.cloudId) ids.add(m.cloudId);
-    }
-    const freshestLocal = [...mem].filter((m) => !m.pulled).sort((a, b) => b.ts - a.ts)[0];
-    return {
-      communityId: cid,
-      members: [...ids].slice(0, 64),
-      context: (freshestLocal?.description ?? "recurring workspace problem cluster").slice(0, 200)
-    };
-  }).filter((r) => r.members.length >= MIN_INDUCTION_MEMBERS).slice(0, maxCommunities);
-}
-var JOINT_COMMUNITY_LABELS, JOINT_COMMUNITY_EDGES, DEFAULT_MIN_COMMUNITY_SIZE, MIN_INDUCTION_MEMBERS;
-var init_community2 = __esm({
-  "../../packages/local-graph/src/community.ts"() {
-    "use strict";
-    init_src2();
-    init_src3();
-    JOINT_COMMUNITY_LABELS = [
-      "Problem",
-      "Solution",
-      "RootCause",
-      "Pattern"
-    ];
-    JOINT_COMMUNITY_EDGES = [
-      "CAUSED_BY",
-      "SOLVED_BY",
-      "FIXED_BY",
-      "CONTRADICTS",
-      "INSTANCE_OF",
-      "MATCHES",
-      "IMPLEMENTS",
-      "TRIAGED_BY",
-      "INDICATES",
-      "CONFIRMS",
-      "RELATES_TO"
-    ];
-    DEFAULT_MIN_COMMUNITY_SIZE = 2;
-    MIN_INDUCTION_MEMBERS = 3;
-  }
-});
-
 // ../../packages/local-graph/src/triage.ts
 function semNode(id, label, description, ts, attrs) {
   return {
@@ -20431,6 +20023,10 @@ function semEdge(id, from, to, type, ts, attrs) {
     attrs
   };
 }
+function isUnfilledPlaceholder(value) {
+  const v = value.trim();
+  return v.startsWith("<") && v.endsWith(">");
+}
 function recordTriageObservation(l2, obs, ts) {
   const statement = obs.presentingStatement.trim();
   const presentingId = obs.presentingId?.trim() || identityId({ kind: "DesignProblem", statement });
@@ -20539,6 +20135,33 @@ function recordCauseChainLink(l2, link, ts, attrs = {}) {
   });
   return created;
 }
+function mintWorkspaceCausalFact(ws, fact, ts) {
+  if (fact.causeId === fact.presentingId) return false;
+  const problem = ws.getNode(fact.presentingId);
+  if (!problem || problem.label !== "Problem") return false;
+  if (problem.attrs["source"] === "cloud") return false;
+  const existingCause = ws.getNode(fact.causeId);
+  if (existingCause && existingCause.label !== "RootCause") return false;
+  const description = fact.causeDescription?.trim();
+  if (!existingCause && !description) return false;
+  let created = false;
+  ws.transaction(() => {
+    if (!ws.getNode(fact.causeId)) {
+      ws.mergeNode(
+        semNode(fact.causeId, "RootCause", description, ts, {
+          scope: {},
+          ...fact.sessionId ? { sources: [fact.sessionId] } : {}
+        })
+      );
+    }
+    const edgeId2 = `edge_cb_${fact.presentingId}_${fact.causeId}`;
+    if (!ws.getEdge(edgeId2)) {
+      ws.mergeEdge(semEdge(edgeId2, fact.presentingId, fact.causeId, "CAUSED_BY", ts, { witnessed: true }));
+      created = true;
+    }
+  });
+  return created;
+}
 function recordMisreadPrior(shared, problem, context, contributor, ts) {
   if (problem.attrs["resolvedAs"] !== PROBLEM_RESOLUTION.FALSE_POSITIVE) return false;
   if (Number(problem.attrs["corroborations"] ?? 0) < 1) return false;
@@ -20739,6 +20362,7 @@ function markDiscriminatorAsked(l2, routeIds, ts) {
 function promoteRouteWithDiscriminator(l2, routeId, discriminator, ts, source) {
   const test = discriminator.trim();
   if (!test) return false;
+  if (isUnfilledPlaceholder(test)) return false;
   const existing = l2.getEdge(routeId);
   if (!existing || !ROUTE_EDGE_TYPES.includes(existing.type)) return false;
   const attrs = {
@@ -20896,6 +20520,467 @@ var init_triage2 = __esm({
   }
 });
 
+// ../../packages/local-graph/src/abstraction.ts
+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 pendingAbstractions(l2) {
+  const out2 = [];
+  for (const n of l2.findNodesByLabel("Claim")) {
+    if (Number(n.attrs["abstractionLevel"] ?? ABSTRACTION_LEVEL.CONCRETE) < ABSTRACTION_LEVEL.PRINCIPLE) continue;
+    if (n.attrs["provisional"] !== true) continue;
+    const memberIds = Array.isArray(n.attrs["members"]) ? n.attrs["members"] : [];
+    const members = memberIds.map((id) => {
+      const m = l2.getNode(id);
+      return m ? { id: m.id, label: m.label, description: m.description } : { id, label: "?", description: "(member missing)" };
+    });
+    out2.push({
+      candidate: n.id,
+      distinctContexts: Number(n.attrs["distinctContexts"] ?? 0),
+      members
+    });
+  }
+  return out2;
+}
+function parseAbstractionFences(text) {
+  const out2 = [];
+  const block = /```errata-abstraction[^\n]*\n([\s\S]*?)```/g;
+  let m;
+  while ((m = block.exec(text)) !== null) {
+    const fields = {};
+    for (const line of m[1].split(/\r?\n/)) {
+      const kv = /^\s*(candidate|principle|covers)\s*:\s*(.+?)\s*$/i.exec(line);
+      if (kv) fields[kv[1].toLowerCase()] = kv[2].trim();
+    }
+    if (!fields["candidate"] || !fields["principle"] || !fields["covers"]) continue;
+    const covers = fields["covers"].split(/[,\s]+/).map((s) => s.trim()).filter(Boolean);
+    if (covers.length === 0) continue;
+    out2.push({ candidate: fields["candidate"], principle: fields["principle"], covers });
+  }
+  return out2;
+}
+function applyAbstractionFence(l2, fence, ts) {
+  const node2 = l2.getNode(fence.candidate);
+  if (!node2 || node2.label !== "Claim" || Number(node2.attrs["abstractionLevel"] ?? ABSTRACTION_LEVEL.CONCRETE) < ABSTRACTION_LEVEL.PRINCIPLE) {
+    return { applied: false, principleId: fence.candidate, reason: "no such abstraction candidate" };
+  }
+  if (node2.attrs["provisional"] !== true) {
+    return { applied: false, principleId: fence.candidate, reason: "candidate already distilled" };
+  }
+  const members = Array.isArray(node2.attrs["members"]) ? node2.attrs["members"] : [];
+  const want = new Set(members);
+  const got = new Set(fence.covers);
+  const missing = members.filter((id) => !got.has(id));
+  const invented = fence.covers.filter((id) => !want.has(id));
+  if (missing.length > 0 || invented.length > 0) {
+    return {
+      applied: false,
+      principleId: fence.candidate,
+      reason: `coverage mismatch \u2014 ${missing.length} member(s) uncovered, ${invented.length} non-member(s) invented`
+    };
+  }
+  const principle = fence.principle.trim();
+  if (!principle) return { applied: false, principleId: fence.candidate, reason: "empty principle" };
+  if (isUnfilledPlaceholder(principle)) {
+    return { applied: false, principleId: fence.candidate, reason: "unfilled template placeholder" };
+  }
+  const { revisit: _r, revisitReason: _rr, revisitSinceTs: _rs, ...rest2 } = node2.attrs;
+  void _r;
+  void _rr;
+  void _rs;
+  l2.updateNode(fence.candidate, {
+    description: principle,
+    attrs: { ...rest2, provisional: false, pendingDistillation: false, distilledAt: ts },
+    lastUpdatedAt: ts
+  });
+  return { applied: true, principleId: fence.candidate };
+}
+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;
+}
+function harvestAbstractionFences(l2, text, ts) {
+  let applied = 0;
+  let rejected = 0;
+  for (const fence of parseAbstractionFences(text)) {
+    if (applyAbstractionFence(l2, fence, ts).applied) applied++;
+    else rejected++;
+  }
+  return { applied, rejected };
+}
+var DEFAULT_MIN_CLUSTER_SIZE, DEFAULT_MIN_DISTINCT_CONTEXTS;
+var init_abstraction = __esm({
+  "../../packages/local-graph/src/abstraction.ts"() {
+    "use strict";
+    init_src();
+    init_src2();
+    init_src3();
+    init_percolate();
+    init_triage2();
+    DEFAULT_MIN_CLUSTER_SIZE = 3;
+    DEFAULT_MIN_DISTINCT_CONTEXTS = 2;
+  }
+});
+
+// ../../packages/local-graph/src/community.ts
+function detectLocalCommunities(store, opts = {}) {
+  const minSize = opts.minCommunitySize ?? DEFAULT_MIN_COMMUNITY_SIZE;
+  const report = { candidates: 0, communities: 0, joint: 0, assigned: 0 };
+  const ids = /* @__PURE__ */ new Set();
+  for (const label of JOINT_COMMUNITY_LABELS) {
+    for (const n of store.findNodesByLabel(label)) {
+      if (label === "Problem" && n.attrs["resolvedAs"] === PROBLEM_RESOLUTION.FALSE_POSITIVE) continue;
+      ids.add(n.id);
+    }
+  }
+  report.candidates = ids.size;
+  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 store.outEdges(id, [...JOINT_COMMUNITY_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 });
+  const members = /* @__PURE__ */ new Map();
+  for (const [id, c] of comm.community) {
+    const l = members.get(c) ?? [];
+    l.push(id);
+    members.set(c, l);
+  }
+  store.transaction(() => {
+    for (const [cid, mem] of members) {
+      const qualifies = mem.length >= minSize;
+      let hasLocal = false;
+      let hasCloud = false;
+      for (const id of mem) {
+        const n = store.getNode(id);
+        if (!n) continue;
+        const pulled = n.attrs["source"] === "cloud";
+        if (pulled) hasCloud = true;
+        else hasLocal = true;
+        const nextAttrs = { ...n.attrs };
+        if (qualifies) nextAttrs["localCommunity"] = cid;
+        else delete nextAttrs["localCommunity"];
+        store.updateNode(id, { attrs: nextAttrs });
+        if (!pulled) store.setCommunity(id, qualifies ? cid : null);
+      }
+      if (qualifies) {
+        report.communities++;
+        report.assigned += mem.length;
+        if (hasLocal && hasCloud) report.joint++;
+      }
+    }
+  });
+  return report;
+}
+function communitySeeds(store, opts = {}) {
+  const maxCommunities = opts.maxCommunities ?? 4;
+  const maxSeeds = opts.maxSeeds ?? 32;
+  const byCommunity = /* @__PURE__ */ new Map();
+  for (const label of JOINT_COMMUNITY_LABELS) {
+    for (const n of store.findNodesByLabel(label)) {
+      const cid = n.attrs["localCommunity"];
+      if (typeof cid !== "string") continue;
+      const cloudId = n.attrs["cloudNodeId"];
+      const l = byCommunity.get(cid) ?? [];
+      l.push({
+        id: n.id,
+        pulled: n.attrs["source"] === "cloud",
+        cloudId: typeof cloudId === "string" && cloudId !== n.id ? cloudId : null,
+        ts: n.lastUpdatedAt
+      });
+      byCommunity.set(cid, l);
+    }
+  }
+  if (byCommunity.size === 0) return [];
+  const ranked = [...byCommunity.entries()].map(([cid, mem]) => ({ cid, mem, fresh: Math.max(...mem.map((m) => m.ts)) })).sort((a, b) => b.fresh - a.fresh).slice(0, maxCommunities);
+  const seeds = [];
+  const seen = /* @__PURE__ */ new Set();
+  const push = (id) => {
+    if (seeds.length >= maxSeeds || seen.has(id)) return;
+    seen.add(id);
+    seeds.push(id);
+  };
+  for (const { mem } of ranked) {
+    const ordered = [...mem].sort(
+      (a, b) => a.pulled === b.pulled ? b.ts - a.ts : a.pulled ? -1 : 1
+    );
+    for (const m of ordered) {
+      push(m.id);
+      if (m.cloudId) push(m.cloudId);
+    }
+  }
+  return seeds;
+}
+function communityInductionRequests(store, opts = {}) {
+  const maxCommunities = opts.maxCommunities ?? 2;
+  const byCommunity = /* @__PURE__ */ new Map();
+  for (const label of JOINT_COMMUNITY_LABELS) {
+    for (const n of store.findNodesByLabel(label)) {
+      const cid = n.attrs["localCommunity"];
+      if (typeof cid !== "string") continue;
+      const cloudId = n.attrs["cloudNodeId"];
+      const l = byCommunity.get(cid) ?? [];
+      l.push({
+        id: n.id,
+        pulled: n.attrs["source"] === "cloud",
+        cloudId: typeof cloudId === "string" && cloudId !== n.id ? cloudId : null,
+        ts: n.lastUpdatedAt,
+        description: n.description
+      });
+      byCommunity.set(cid, l);
+    }
+  }
+  if (byCommunity.size === 0) return [];
+  return [...byCommunity.entries()].map(([cid, mem]) => ({ cid, mem, fresh: Math.max(...mem.map((m) => m.ts)) })).sort((a, b) => b.fresh - a.fresh).map(({ cid, mem }) => {
+    const ids = /* @__PURE__ */ new Set();
+    for (const m of mem) {
+      ids.add(m.id);
+      if (m.cloudId) ids.add(m.cloudId);
+    }
+    const freshestLocal = [...mem].filter((m) => !m.pulled).sort((a, b) => b.ts - a.ts)[0];
+    return {
+      communityId: cid,
+      members: [...ids].slice(0, 64),
+      context: (freshestLocal?.description ?? "recurring workspace problem cluster").slice(0, 200)
+    };
+  }).filter((r) => r.members.length >= MIN_INDUCTION_MEMBERS).slice(0, maxCommunities);
+}
+var JOINT_COMMUNITY_LABELS, JOINT_COMMUNITY_EDGES, DEFAULT_MIN_COMMUNITY_SIZE, MIN_INDUCTION_MEMBERS;
+var init_community2 = __esm({
+  "../../packages/local-graph/src/community.ts"() {
+    "use strict";
+    init_src2();
+    init_src3();
+    JOINT_COMMUNITY_LABELS = [
+      "Problem",
+      "Solution",
+      "RootCause",
+      "Pattern"
+    ];
+    JOINT_COMMUNITY_EDGES = [
+      "CAUSED_BY",
+      "SOLVED_BY",
+      "FIXED_BY",
+      "CONTRADICTS",
+      "INSTANCE_OF",
+      "MATCHES",
+      "IMPLEMENTS",
+      "TRIAGED_BY",
+      "INDICATES",
+      "CONFIRMS",
+      "RELATES_TO"
+    ];
+    DEFAULT_MIN_COMMUNITY_SIZE = 2;
+    MIN_INDUCTION_MEMBERS = 3;
+  }
+});
+
 // ../../packages/local-graph/src/problem-dedup.ts
 function corroborations(n) {
   return Number(n.attrs["corroborations"] ?? 0);
@@ -21243,6 +21328,7 @@ __export(src_exports2, {
   ingestDesignProblem: () => ingestDesignProblem,
   isConstraintProblem: () => isConstraintProblem,
   isPlaceholderStatement: () => isPlaceholderStatement,
+  isUnfilledPlaceholder: () => isUnfilledPlaceholder,
   linkProblemToLanguages: () => linkProblemToLanguages,
   linkProblemToPackages: () => linkProblemToPackages,
   linkProblemToSymbols: () => linkProblemToSymbols,
@@ -21256,10 +21342,12 @@ __export(src_exports2, {
   matchSymbolsInText: () => matchSymbolsInText,
   mergeCloudCounts: () => mergeCloudCounts,
   mergeDuplicateProblems: () => mergeDuplicateProblems,
+  migrateProjectAlias: () => migrateProjectAlias,
   mintCitedPackageNode: () => mintCitedPackageNode,
   mintComponentNode: () => mintComponentNode,
   mintDomainNode: () => mintDomainNode,
   mintPatternNode: () => mintPatternNode,
+  mintWorkspaceCausalFact: () => mintWorkspaceCausalFact,
   openGraphStore: () => openGraphStore,
   osNodeId: () => osNodeId,
   parseAbstractionFences: () => parseAbstractionFences,
@@ -21698,10 +21786,32 @@ function renderSnapshot(s) {
     lines.push("");
   }
   lines.push("### Open review queue");
-  if (s.reviewCount === 0) {
+  const reviewItems = s.reviewItems ?? [];
+  if (s.reviewCount === 0 && reviewItems.length === 0) {
     lines.push("- (none)");
   } else {
-    lines.push(`- ${s.reviewCount} items awaiting your review at ${s.reviewUiUrl}`);
+    if (s.reviewCount > 0) lines.push(`- ${s.reviewCount} items awaiting your review at ${s.reviewUiUrl}`);
+    for (const item of reviewItems) {
+      if (item.kind === "discriminator") {
+        lines.push(
+          `- **A recurring diagnosis is one cheap check from promoting** \u2014 "${item.presenting}" usually turns out to be: ${item.cause}. If (and only if) you KNOW a cheap ante-hoc check that confirms it, answer in your reply:`
+        );
+        lines.push("  ```errata-triage");
+        lines.push(`  route: ${item.route}`);
+        lines.push("  test: <the cheap check>");
+        lines.push("  ```");
+      } else {
+        lines.push(
+          `- **Name the principle this cluster of your beliefs generalizes** \u2014 it ships to the collective only once named, and the prose must cover ALL members in one sentence:`
+        );
+        for (const m of item.members) lines.push(`  - ${m.description}`);
+        lines.push("  ```errata-abstraction");
+        lines.push(`  candidate: ${item.candidate}`);
+        lines.push("  principle: <one sentence covering all members>");
+        lines.push(`  covers: ${item.members.map((m) => m.id).join(", ")}`);
+        lines.push("  ```");
+      }
+    }
   }
   return lines.join("\n");
 }
@@ -21711,6 +21821,12 @@ function dropLowestUnit(s) {
       case "skills":
         if (s.skills.length) return s.skills.pop(), true;
         break;
+      case "reviewItemsOverFloor":
+        if (s.reviewItems && s.reviewItems.length > REVIEW_ITEM_FLOOR) return s.reviewItems.pop(), true;
+        break;
+      case "reviewItems":
+        if (s.reviewItems && s.reviewItems.length) return s.reviewItems.pop(), true;
+        break;
       case "motifsOverFloor":
         if (s.motifs.length > MOTIF_FLOOR) return s.motifs.pop(), true;
         break;
@@ -21765,6 +21881,7 @@ function assembleAgentContext(opts) {
   });
   if (opts.edgeElicitation) snapshot.edgeElicitation = opts.edgeElicitation;
   if (opts.pendingUpdate) snapshot.pendingUpdate = opts.pendingUpdate;
+  if (opts.reviewItems?.length) snapshot.reviewItems = [...opts.reviewItems];
   if (opts.remote && opts.remote.length > 0) {
     const seen = /* @__PURE__ */ new Set();
     const remote = opts.remote.filter((n) => {
@@ -21787,7 +21904,7 @@ _${dropped} lower-priority item${dropped === 1 ? "" : "s"} omitted to fit the pa
   }
   return { body: body2, snapshot, dropped };
 }
-var RECALL_FIRST_HEADER, RECALL_FIRST_BODY, RECALL_FIRST_BLOCK, SEARCH_IMPERATIVE_HEADER, SEARCH_IMPERATIVE_BODY, EVICTION_ORDER, MOTIF_FLOOR, REMOTE_FLOOR, PROBLEM_FLOOR, DEFAULT_AGENT_CONTEXT_BUDGET;
+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({
   "../../packages/context-writer/src/render.ts"() {
     "use strict";
@@ -21802,6 +21919,9 @@ ${RECALL_FIRST_BODY}`;
     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.";
     EVICTION_ORDER = [
       "skills",
+      // Review items beyond the floor drop immediately after skills — one naming
+      // ask per render is the design (the caller rotates), extras are padding.
+      "reviewItemsOverFloor",
       // Collective floors (EE-evidence-live): motifs/remote trim to a FLOOR here and
       // fully drain only near the very end. The unfloored order zeroed them on every
       // render (~44 units dropped per block, live 8-01), which starved §5.4 at the
@@ -21837,11 +21957,22 @@ ${RECALL_FIRST_BODY}`;
       "recentProblemsOverFloor",
       "motifs",
       "remote",
+      // The floored review item outlives even the terminal motif/remote stages ON
+      // PURPOSE: the block's deficit reaches those stages on EVERY render (measured
+      // — non-evictable instruction prose leaves ~2k discretionary, and live
+      // renders land at exactly the problem floor with motifs/remote at zero), so
+      // any earlier slot is structurally invisible — the same starvation that
+      // killed the pull surfaces this band replaces. Cost: one compact ask ≈ one
+      // remote prior. That trade is deliberate: the ask IS a witness elicitation
+      // (a discriminator/principle is §5.4-grade evidence nothing else produces),
+      // and it still yields to the agent's own live problems.
+      "reviewItems",
       "recentProblems"
     ];
     MOTIF_FLOOR = 2;
     REMOTE_FLOOR = 3;
     PROBLEM_FLOOR = 4;
+    REVIEW_ITEM_FLOOR = 1;
     DEFAULT_AGENT_CONTEXT_BUDGET = 9e3;
   }
 });
@@ -26344,7 +26475,8 @@ function mergeDualBurst(local, cloud, opts = {}) {
       provenance: corroborated ? "corroborated" : "local",
       ...twin?.usageCount != null ? { usageCount: twin.usageCount } : {},
       ...twin?.rel ? { rel: twin.rel } : {},
-      why: l.components
+      why: l.components,
+      ...l.via ? { via: l.via } : {}
     });
   }
   let collectiveCount = 0;
@@ -26531,7 +26663,8 @@ function formatDualNodes(merged) {
         centrality: Number(n.why.centrality.toFixed(3)),
         trust: n.why.trust
       }
-    } : {}
+    } : {},
+    ...n.via ? { via: n.via } : {}
   }));
 }
 var BRIDGE_LABELS, CANONICAL_KNOWLEDGE_ID, UUID_ID;
@@ -28275,14 +28408,19 @@ function localBurst(store, seedId, opts = {}) {
   const seed = store.getNode(seedId);
   if (!seed) return [];
   const hopOf = /* @__PURE__ */ new Map([[seedId, 0]]);
+  const viaOf = /* @__PURE__ */ new Map();
   let frontier = [seedId];
   for (let h = 1; h <= maxHops && hopOf.size < nodeCap; h++) {
     const next = [];
     for (const id of frontier) {
-      const neigh = [...store.outEdges(id).map((e) => e.to), ...store.inEdges(id).map((e) => e.from)];
-      for (const nb of neigh) {
+      const neigh = [
+        ...store.outEdges(id).map((e) => ({ nb: e.to, via: { edgeType: e.type, parentId: id, forward: true } })),
+        ...store.inEdges(id).map((e) => ({ nb: e.from, via: { edgeType: e.type, parentId: id, forward: false } }))
+      ];
+      for (const { nb, via } of neigh) {
         if (!hopOf.has(nb)) {
           hopOf.set(nb, h);
+          viaOf.set(nb, via);
           next.push(nb);
           if (hopOf.size >= nodeCap) break;
         }
@@ -28304,7 +28442,8 @@ function localBurst(store, seedId, opts = {}) {
   const now = store.currentIngestSeq();
   return nodes.map(({ node: node2, hops }) => {
     const r = scoreCandidate(node2, { ...ctxSeed, hops, decay: nodeFreshness(node2, now) }, weights);
-    return { id: node2.id, score: r.score, components: r.components, node: node2, hops };
+    const via = viaOf.get(node2.id);
+    return { id: node2.id, score: r.score, components: r.components, node: node2, hops, ...via ? { via } : {} };
   }).filter((r) => !gated || r.score > 0).sort((a, b) => b.score - a.score).slice(0, limit);
 }
 var init_relevance_rank = __esm({
@@ -38028,7 +38167,7 @@ var init_mcp = __esm({
       },
       {
         name: "errata.burst",
-        description: "Burst-grade local retrieval \u2014 the INTELLIGENT, seed-relative neighborhood (not a flat list). Given a SEED (`nodeId` or `qname`), expand its neighborhood and return the RELEVANT scored subset, ranked by burst-style relevance: semantic similarity to the seed \xD7 centrality \xD7 trust, hop-decayed; semantically-unrelated nodes are gated out. Prefer this over errata.neighbors when you want signal-ranked CONTEXT rather than raw edges. When the SEED is a package and the collective is reachable, results BLEND cross-project knowledge \u2014 each carries `provenance` (local | collective | corroborated) and `usageCount` (projects using it); `corroborated` means your graph and the collective agree (trust it most), `collective` is a cross-project prior to verify. Returns {seed, count, results:[{id,label,name,score,hops,provenance,usageCount?,why?}]}.",
+        description: "Burst-grade local retrieval \u2014 the INTELLIGENT, seed-relative neighborhood (not a flat list). Given a SEED (`nodeId` or `qname`), expand its neighborhood and return the RELEVANT scored subset, ranked by burst-style relevance: semantic similarity to the seed \xD7 centrality \xD7 trust, hop-decayed; semantically-unrelated nodes are gated out. Prefer this over errata.neighbors when you want signal-ranked CONTEXT rather than raw edges. When the SEED is a package and the collective is reachable, results BLEND cross-project knowledge \u2014 each carries `provenance` (local | collective | corroborated) and `usageCount` (projects using it); `corroborated` means your graph and the collective agree (trust it most), `collective` is a cross-project prior to verify. Returns {seed, count, results:[{id,label,name,score,hops,provenance,usageCount?,why?,via?}]} \u2014 `via` is the TOPOLOGY: the edge that reached this result in the walk ({edgeType, parentId, forward}; forward: true \u21D2 parent \u2014edgeType\u2192 node), so you can tell 'FIXED_BY your seed' from 'two hops away via a shared package' and choose whether to dig down a causal chain or turn elsewhere.",
         inputSchema: {
           type: "object",
           properties: {
@@ -38072,7 +38211,8 @@ var init_mcp = __esm({
             node: { label: r.node.label, description: r.node.description },
             score: r.score,
             hops: r.hops ?? 0,
-            components: r.components
+            components: r.components,
+            ...r.via ? { via: r.via } : {}
           }));
           const seedNode = store.getNode(id);
           let collectiveStatus = "local-only";
@@ -38118,7 +38258,8 @@ var init_mcp = __esm({
                 semantic: Number(r.components.semantic.toFixed(3)),
                 centrality: Number(r.components.centrality.toFixed(3)),
                 trust: r.components.trust
-              }
+              },
+              ...r.via ? { via: r.via } : {}
             }))
           };
         }
@@ -52874,6 +53015,12 @@ function sessionOriginKey(sessionId) {
 function refreshRepoLocator(root, profile) {
   const detected = detectRepoLocator(root, profile.repoRemote);
   if (!detected || detected === profile.repoLocator) return false;
+  if (profile.repoLocator) {
+    const aliases = new Set(profile.repoLocatorAliases ?? []);
+    aliases.add(profile.repoLocator);
+    aliases.delete(detected);
+    profile.repoLocatorAliases = [...aliases];
+  }
   profile.repoLocator = detected;
   saveProfile(root, profile);
   return true;
@@ -53264,7 +53411,7 @@ function startLoopLagMonitor(thresholdMs = 1e3) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.2-dev.361" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.2-dev.417" : "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;
@@ -53600,6 +53747,27 @@ function createWorkspaceEngine(opts) {
       }
     }
   };
+  const clip = (s, n) => s.length > n ? `${s.slice(0, n - 1)}\u2026` : s;
+  const pickReviewItems = () => {
+    const shared = opts.sharedStore;
+    if (!shared) return [];
+    try {
+      if ((/* @__PURE__ */ new Date()).getHours() % 2 === 0) {
+        const small = pendingAbstractions(shared).filter((a) => a.members.length >= 2 && a.members.length <= 5).sort((a, b) => a.members.length - b.members.length)[0];
+        if (small) {
+          return [{
+            kind: "abstraction",
+            candidate: small.candidate,
+            members: small.members.map((m) => ({ id: m.id, description: clip(m.description, 110) }))
+          }];
+        }
+      }
+      const [d] = pendingDiscriminators(shared, { limit: 1 });
+      return d ? [{ kind: "discriminator", route: d.route, presenting: clip(d.presenting, 140), cause: clip(d.cause, 140) }] : [];
+    } catch {
+      return [];
+    }
+  };
   const refreshContextOnce = async () => {
     const elicit = isEdgeElicitationEnabled();
     const snapOpts = {
@@ -53613,13 +53781,15 @@ function createWorkspaceEngine(opts) {
     const prebuilt = passWorker ? await passWorker.snapshot(snapOpts).catch(() => null) : null;
     const doneRender = prebuilt ? null : markPass(`context-render-inline:${profile.name}`);
     const pendingUpdate = opts.pendingUpdate?.() ?? null;
+    const reviewItems = pickReviewItems();
     const { body: body2, snapshot } = assembleAgentContext({
       store,
       ...snapOpts,
       remote: remotePriors,
       ...elicit ? { edgeElicitation: { instruction: PRIOR_TAG_INSTRUCTION } } : {},
       ...prebuilt ? { snapshot: prebuilt } : {},
-      ...pendingUpdate ? { pendingUpdate } : {}
+      ...pendingUpdate ? { pendingUpdate } : {},
+      ...reviewItems.length ? { reviewItems } : {}
     });
     doneRender?.();
     writeContextFile(opts.workspaceRoot, body2);
@@ -54102,6 +54272,22 @@ function createWorkspaceEngine(opts) {
             } catch (err2) {
               console.warn("[errata] inline triage route failed:", err2);
             }
+            if (evidence !== "inferred") {
+              try {
+                mintWorkspaceCausalFact(
+                  store,
+                  {
+                    presentingId,
+                    causeId: tr.causeId,
+                    ...tr.causeDescription ? { causeDescription: tr.causeDescription } : {},
+                    sessionId
+                  },
+                  t
+                );
+              } catch (err2) {
+                console.warn("[errata] workspace causal-fact mirror failed:", err2);
+              }
+            }
           }
         }
         if (opts.sharedStore) {
@@ -54115,6 +54301,13 @@ function createWorkspaceEngine(opts) {
             }
           }
         }
+        for (const link of plan.causalLinks) {
+          try {
+            recordCauseChainLink(store, link, t, { contributor: sessionId, sources: [sessionId] });
+          } catch (err2) {
+            console.warn("[errata] workspace causal chain mirror failed:", err2);
+          }
+        }
         for (const at of plan.attempts) {
           const pid = at.problemId ?? (at.threadId ? threads.get(at.threadId) : void 0) ?? (at.boundStatement ? designProblemId(at.boundStatement) : void 0);
           const node2 = pid ? store.getNode(pid) : void 0;
@@ -56453,6 +56646,37 @@ async function startMultiDaemon(opts = {}) {
     async percolateAll() {
       const ts = Date.now();
       const out2 = /* @__PURE__ */ new Map();
+      const repoBasename = (locator) => (locator.split("/").filter(Boolean).pop() ?? locator).toLowerCase();
+      for (const r of records) {
+        const profile = r.engine.profile;
+        const aliases = profile.repoLocatorAliases ?? [];
+        const locator = profile.repoLocator;
+        if (!locator || aliases.length === 0) continue;
+        try {
+          for (const alias of aliases) {
+            if (repoBasename(alias) !== repoBasename(locator)) {
+              console.log(
+                `[errata] project alias NOT auto-migrated for ${r.entry.name} (${alias} \u2192 ${locator}: repo name differs \u2014 a fork/repoint, not a rename). Run scripts/migrate-project-alias.ts if this really is the same repo.`
+              );
+              continue;
+            }
+            const m = migrateProjectAlias(sharedStore, { from: alias, to: locator, ts });
+            if (m.nodesRewritten || m.edgesRewritten) {
+              console.log(
+                `[errata] project alias migrated for ${r.entry.name}: ${alias} \u2192 ${locator} (${m.nodesRewritten} nodes, ${m.edgesRewritten} edges)`
+              );
+            }
+          }
+          delete profile.repoLocatorAliases;
+          const onDisk = loadProfile(r.root);
+          if (onDisk) {
+            delete onDisk.repoLocatorAliases;
+            saveProfile(r.root, onDisk);
+          }
+        } catch (err2) {
+          console.warn(`[errata] project-alias migration failed for ${r.entry.name} (kept for next pass): ${err2 instanceof Error ? err2.message : err2}`);
+        }
+      }
       let inlineRecords = records;
       if (consolidateWorker) {
         const fileBacked = records.filter((r) => r.engine.paths.castalia !== ":memory:");