@inerrata-corporation/errata 2.0.2-dev.192 → 2.0.2-dev.196

package/errata.mjs

@@ -18183,6 +18183,9 @@ var init_problem_package_link = __esm({
 });
 
 // ../../packages/local-graph/src/design-problem.ts
+function isConstraintProblem(node2) {
+  return node2.attrs["kind"] === "constraint";
+}
 function isPlaceholderStatement(statement) {
   const s = statement.trim();
   if (s.length < 8) return true;
@@ -18432,7 +18435,7 @@ function tokenJaccard(a, b) {
   for (const t of sa) if (sb.has(t)) inter++;
   return inter / (sa.size + sb.size - inter);
 }
-function reinforceSameAnchorProblem(store, relPath, workspaceId2, statement, source, ts) {
+function reinforceSameAnchorProblem(store, relPath, workspaceId2, statement, source, ts, kind = "problem") {
   const stmt = statement.trim();
   if (!ANCHORABLE_CODE.test(relPath)) return null;
   const file2 = resolveFileNode(store, relPath, workspaceId2);
@@ -18443,6 +18446,8 @@ function reinforceSameAnchorProblem(store, relPath, workspaceId2, statement, sou
     const cand = store.getNode(e.from);
     if (!cand || cand.label !== "Problem" || cand.attrs["resolvedAt"]) continue;
     if (cand.id === selfId) continue;
+    const candKind = cand.attrs["kind"] === "constraint" ? "constraint" : "problem";
+    if (candKind !== (kind === "constraint" ? "constraint" : "problem")) continue;
     const score2 = tokenJaccard(stmt, cand.description);
     if (score2 >= SAME_ANCHOR_DEDUP_JACCARD && (!best || score2 > best.score)) best = { node: cand, score: score2 };
   }
@@ -18477,6 +18482,7 @@ function priorsForFile(store, relPath) {
   }
   if (!file2) return null;
   const openProblems = [];
+  const constraints = [];
   const seenProblem = /* @__PURE__ */ new Set();
   const related = /* @__PURE__ */ new Map();
   for (const e of store.inEdges(file2.id, ["ANCHORED_AT"])) {
@@ -18485,14 +18491,14 @@ function priorsForFile(store, 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 store.outEdges(p.id, ["SOLVED_BY", "CAUSED_BY", "INSTANCE_OF"])) {
       const n = store.getNode(e.to);
       if (n && CITABLE_PRIOR_LABELS.has(n.label)) related.set(n.id, n);
@@ -18503,9 +18509,11 @@ function priorsForFile(store, 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 anchorProblemToDiff(store, problemId, changedPaths, workspaceId2, t, opts = {}) {
   return anchorNodeToDiff(store, problemId, "Problem", changedPaths, workspaceId2, t, opts);
@@ -18626,6 +18634,7 @@ function resolveDesignProblems(store, t) {
   for (const p of store.findNodesByLabel("Problem")) {
     if (!p.id.startsWith("dprob_")) continue;
     if (p.attrs["resolvedAt"]) continue;
+    if (isConstraintProblem(p)) continue;
     let symName = "";
     let symRelPath;
     let edited = false;
@@ -20536,6 +20545,7 @@ function mergeDuplicateProblems(store, 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);
@@ -20592,6 +20602,7 @@ var init_problem_dedup = __esm({
     "use strict";
     init_src();
     init_src();
+    init_design_problem();
     REDIRECT_EDGES = [
       "CAUSED_BY",
       "SOLVED_BY",
@@ -20850,6 +20861,7 @@ __export(src_exports2, {
   induceAbstractions: () => induceAbstractions,
   induceTriage: () => induceTriage,
   ingestDesignProblem: () => ingestDesignProblem,
+  isConstraintProblem: () => isConstraintProblem,
   isPlaceholderStatement: () => isPlaceholderStatement,
   linkProblemToLanguages: () => linkProblemToLanguages,
   linkProblemToPackages: () => linkProblemToPackages,
@@ -20935,12 +20947,14 @@ function isPassiveInjectable(node2) {
 }
 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;
@@ -21007,6 +21021,7 @@ function buildSnapshot(opts) {
     profileContext,
     recentProblems: recent,
     recentResolved,
+    recentConstraints,
     ...causalNudge ? { causalNudge } : {},
     ...domainNudge ? { domainNudge } : {},
     motifs,
@@ -21059,6 +21074,7 @@ function sliceForFile(store, relPath) {
   const fp = priorsForFile(store, 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) => [
@@ -21153,7 +21169,7 @@ function renderSnapshot(s) {
   }
   const tagOf = (n) => s.edgeElicitation ? ` \`[${priorHandle(n)}]\`` : "";
   lines.push("### Recently observed problems in this workspace");
-  if (s.recentProblems.length === 0 && s.recentResolved.length === 0) {
+  if (s.recentProblems.length === 0 && s.recentResolved.length === 0 && s.recentConstraints.length === 0) {
     lines.push("- _none yet \u2014 errata is still building its model_");
   } else {
     if (s.recentProblems.length > 0) {
@@ -21175,6 +21191,12 @@ function renderSnapshot(s) {
         );
       }
     }
+    if (s.recentConstraints.length > 0) {
+      lines.push("_Design tensions \u2014 constraints this work is shaped around, not defects to fix:_");
+      for (const c of s.recentConstraints) {
+        lines.push(`- \u2696 **${c.description}** \u2014 \`${c.id}\`${tagOf(c)}`);
+      }
+    }
     if (s.recentResolved.length > 0) {
       lines.push("_Recently resolved \u2014 solved here; jumping-off points, not live defects:_");
       for (const r of s.recentResolved) {
@@ -21242,6 +21264,14 @@ function renderSnapshot(s) {
         }
       }
     }
+    if (w.priors?.constraints.length) {
+      lines.push(
+        "- **Design tensions here** \u2014 standing constraints this code is shaped around. They are NOT open work and a change does not resolve one, so there is no `(fix:)` token; cite one you worked within with `([id])`:"
+      );
+      for (const c of w.priors.constraints) {
+        lines.push(`  - ${c.description} \u2192 \`([${c.id}])\``);
+      }
+    }
     if (w.priors?.related.length) {
       lines.push("- **Related priors** (cite with `([id])` where you lean on one):");
       for (const n of w.priors.related) {
@@ -21279,6 +21309,9 @@ function dropLowestUnit(s) {
       case "pendingEnrichment":
         if (s.pendingEnrichment.length) return s.pendingEnrichment.pop(), true;
         break;
+      case "recentConstraints":
+        if (s.recentConstraints.length) return s.recentConstraints.pop(), true;
+        break;
       case "recentProblems":
         if (s.recentProblems.length) return s.recentProblems.pop(), true;
         break;
@@ -21350,6 +21383,9 @@ ${RECALL_FIRST_BODY}`;
       // budget they drop before anything open/actionable.
       "recentResolved",
       "pendingEnrichment",
+      // A standing design tension outranks an enrichment nudge (it prevents a wrong
+      // decision) but yields to a live defect (which is actionable now).
+      "recentConstraints",
       "recentProblems",
       "needsRevisit"
     ];
@@ -26475,6 +26511,7 @@ function mergeProblemsByEmbedding(store, opts) {
         if (b.id === a.id || consumed.has(b.id)) continue;
         if (b.embedding.length !== a.embedding.length) continue;
         if ((a.attrs["embeddingVersion"] ?? "") !== (b.attrs["embeddingVersion"] ?? "")) continue;
+        if (isConstraintProblem(a) !== isConstraintProblem(b)) continue;
         if (cosine(a.embedding, b.embedding) >= minCosine) {
           cluster.push(b);
           consumed.add(b.id);
@@ -37711,11 +37748,11 @@ var init_mcp = __esm({
       },
       {
         name: "errata.problems",
-        description: "List the workspace's Problem backlog \u2014 the triage view that search/why/impact can't give because they need a seed. status: 'open' (default) | 'resolved' (a real fix) | 'retracted' (false alarms \u2014 false_positive/dissolution) | 'all'. Also returns a `retracted` breakdown so the false-positive rate stays visible.",
+        description: "List the workspace's Problem backlog \u2014 the triage view that search/why/impact can't give because they need a seed. status: 'open' (default) | 'resolved' (a real fix) | 'retracted' (false alarms \u2014 false_positive/dissolution) | 'constraint' (design TENSIONS captured via `(constraint: \u2026)` \u2014 standing context, not open work, so they're excluded from 'open') | 'all'. Also returns a `retracted` breakdown so the false-positive rate stays visible.",
         inputSchema: {
           type: "object",
           properties: {
-            status: { type: "string", description: "open | resolved | retracted | all (default open)" },
+            status: { type: "string", description: "open | resolved | retracted | constraint | all (default open)" },
             limit: { type: "number" }
           }
         },
@@ -37725,7 +37762,7 @@ var init_mcp = __esm({
           const RETRACTIONS = /* @__PURE__ */ new Set(["false_positive", "invalid", "duplicate"]);
           const rows = store.findAllVersionsByLabel("Problem").map((p) => {
             const ra = p.attrs["resolvedAs"];
-            const status = ra && RETRACTIONS.has(ra) ? ra : p.attrs["resolvedAt"] != null ? "resolved" : "open";
+            const status = ra && RETRACTIONS.has(ra) ? ra : p.attrs["resolvedAt"] != null ? "resolved" : isConstraintProblem(p) ? "constraint" : "open";
             const anchorEdge = store.outEdges(p.id, ["ANCHORED_AT"])[0];
             const anchor = anchorEdge ? store.getNode(anchorEdge.to)?.description : void 0;
             return {
@@ -37733,17 +37770,21 @@ var init_mcp = __esm({
               problem: p.description,
               status,
               createdAt: p.createdAt,
+              // Surfaced even when `status` is resolved/retracted, so a caller can tell
+              // an explicitly-discharged TENSION from a fixed defect.
+              ...isConstraintProblem(p) ? { kind: "constraint" } : {},
               ...p.attrs["provisional"] ? { provisional: true } : {},
               ...p.attrs["resolvedReason"] ? { reason: String(p.attrs["resolvedReason"]) } : {},
               ...anchor ? { anchor } : {}
             };
           });
-          const inScope = (s) => want === "all" ? true : want === "resolved" ? s === "resolved" : want === "retracted" ? RETRACTIONS.has(s) : s === "open";
+          const inScope = (s) => want === "all" ? true : want === "resolved" ? s === "resolved" : want === "retracted" ? RETRACTIONS.has(s) : want === "constraint" ? s === "constraint" : s === "open";
           const items = rows.filter((r) => inScope(r.status)).sort((a, b) => b.createdAt - a.createdAt).slice(0, limit);
           const countBy = (s) => rows.filter((r) => r.status === s).length;
           return {
             open: countBy("open"),
             resolved: countBy("resolved"),
+            constraints: countBy("constraint"),
             retracted: {
               falsePositive: countBy("false_positive"),
               dissolution: countBy("invalid"),
@@ -37832,7 +37873,8 @@ var init_mcp = __esm({
         inputSchema: { type: "object", properties: {} },
         handler: (_args, store) => {
           const problems = store.findNodesByLabel("Problem");
-          const open2 = problems.filter((p) => p.attrs["resolvedAt"] == null);
+          const open2 = problems.filter((p) => p.attrs["resolvedAt"] == null && !isConstraintProblem(p));
+          const constraints = problems.filter((p) => p.attrs["resolvedAt"] == null && isConstraintProblem(p));
           const noFix = open2.filter((p) => store.outEdges(p.id, ["SOLVED_BY"]).length === 0);
           const allProblems = store.findAllVersionsByLabel("Problem");
           const ungroundedDerived = store.findNodesByLabel("Claim").filter((c) => c.attrs["crystallized"] === "derived" && Number(c.attrs["groundedSupport"] ?? 0) === 0);
@@ -37842,6 +37884,7 @@ var init_mcp = __esm({
             strandedSymbols: findStrandedSymbols(store).length,
             openProblems: open2.length,
             openProblemsWithoutFix: noFix.length,
+            designConstraints: constraints.length,
             retractedFalsePositive: allProblems.filter((p) => p.attrs["resolvedAs"] === "false_positive").length,
             retractedDissolution: allProblems.filter((p) => p.attrs["resolvedAs"] === "invalid").length,
             ungroundedDerivedClaims: ungroundedDerived.length,
@@ -38413,7 +38456,7 @@ function formatProblemsMd(r) {
   const lines = [head("problems")];
   const ret = r.retracted ?? { falsePositive: 0, dissolution: 0, duplicate: 0 };
   lines.push(
-    `open ${r.open} \xB7 resolved ${r.resolved} \xB7 retracted: ${ret.falsePositive} fp / ${ret.dissolution} dissolution / ${ret.duplicate} dup`
+    `open ${r.open} \xB7 resolved ${r.resolved}` + (r.constraints ? ` \xB7 constraints ${r.constraints}` : "") + ` \xB7 retracted: ${ret.falsePositive} fp / ${ret.dissolution} dissolution / ${ret.duplicate} dup`
   );
   lines.push(`showing ${r.count}`);
   lines.push("");
@@ -46151,10 +46194,13 @@ function recallForFile(store, relPath) {
       recallLine(p, `${TAG_EXAMPLE.fix(p.id)} if you resolved it \xB7 ${TAG_EXAMPLE.prior(p.id)} to cite${causeCue}`)
     );
   }
+  for (const c of priors.constraints.slice(0, 2)) {
+    lines.push(recallLine(c, `design tension \u2014 hold it, don't "fix" it \xB7 ${TAG_EXAMPLE.prior(c.id)} to cite`));
+  }
   for (const n of priors.related.slice(0, 4)) {
     lines.push(recallLine(n, `cite with ${TAG_EXAMPLE.prior(n.id)}`));
   }
-  const total = priors.openProblems.length + priors.related.length;
+  const total = priors.openProblems.length + priors.constraints.length + priors.related.length;
   return `errata \u2014 ${total} prior(s) recorded on this file (act only if relevant):
 ${lines.join("\n")}
 ` + buildFileRecallInstruction();
@@ -50204,7 +50250,7 @@ function harvestInlineTags(store, text, opts) {
   const touched = opts.sessionTouchedIds ?? /* @__PURE__ */ new Set();
   const plan = { priorEdges: 0, problems: [], fixes: [], triages: [], attempts: [], unresolvedFixes: [], transfers: [], solutionLinks: [], instances: [], patterns: [], domains: [], packages: [], components: [], refutes: [], corroborations: [] };
   const tags = parseInlineTags(text);
-  const symptomSeqs = tags.filter((t) => (t.kind === "problem" || t.kind === "todo" || t.kind === "constraint") && t.statement).map((t) => ({ seq: t.seq ?? -1, statement: t.statement, threadId: t.threadId })).sort((a, b) => a.seq - b.seq);
+  const symptomSeqs = tags.filter((t) => (t.kind === "problem" || t.kind === "todo") && t.statement).map((t) => ({ seq: t.seq ?? -1, statement: t.statement, threadId: t.threadId })).sort((a, b) => a.seq - b.seq);
   const bindSymptom = (seq, threadId) => {
     if (threadId) {
       const hit = symptomSeqs.find((s) => s.threadId === threadId);
@@ -50234,7 +50280,7 @@ function harvestInlineTags(store, text, opts) {
         ...tag.threadId ? { threadId: tag.threadId } : {}
       });
     } else if (tag.kind === "constraint") {
-      plan.problems.push({ statement: tag.statement, kind: "problem" });
+      plan.problems.push({ statement: tag.statement, kind: "constraint" });
     } else if (tag.kind === "fix") {
       if (tag.handle) {
         const problemId = resolveHandle(store, tag.handle, opts.handleMap);
@@ -50454,7 +50500,10 @@ function parseRollupJson(text) {
       ...str("cause") ? { cause: str("cause") } : {},
       ...str("fix") ? { fix: str("fix") } : {},
       ...str("anchor") ? { anchor: str("anchor") } : {},
-      kind: o["kind"] === "todo" ? "todo" : "problem"
+      // Preserve `constraint` (GH-constraint-kind) — collapsing it to `problem`
+      // here would re-arm the auto-close and the inferred fix-binding on a design
+      // tension that arrived through the rollup path instead of the inline tag.
+      kind: o["kind"] === "todo" ? "todo" : o["kind"] === "constraint" ? "constraint" : "problem"
     });
   }
   return flags2.slice(0, 12);
@@ -52057,7 +52106,7 @@ function startLoopLagMonitor(thresholdMs = 1e3) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.2-dev.192" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.2-dev.196" : "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;
@@ -52649,7 +52698,7 @@ function createWorkspaceEngine(opts) {
             ts: t
           });
           if (r.created || r.corroborated) minted++;
-          sessionLastProblem.set(sessionId, designProblemId(flag.problem));
+          if (flag.kind !== "constraint") sessionLastProblem.set(sessionId, designProblemId(flag.problem));
           if (r.created || r.corroborated) {
             try {
               if (editedTurnFile) {
@@ -52729,11 +52778,13 @@ function createWorkspaceEngine(opts) {
           const dedupPath = anchorPath ?? hintPath;
           if (dedupPath) {
             try {
-              const dupId = reinforceSameAnchorProblem(store, dedupPath, profile.id, p.statement, sessionId, t);
+              const dupId = reinforceSameAnchorProblem(store, dedupPath, profile.id, p.statement, sessionId, t, p.kind);
               if (dupId) {
                 minted++;
-                sessionLastProblem.set(sessionId, dupId);
-                inScopeProblemId = dupId;
+                if (p.kind !== "constraint") {
+                  sessionLastProblem.set(sessionId, dupId);
+                  inScopeProblemId = dupId;
+                }
                 if (p.threadId) threads.set(p.threadId, dupId);
                 continue;
               }
@@ -52747,8 +52798,10 @@ function createWorkspaceEngine(opts) {
           });
           if (r.created || r.corroborated) {
             minted++;
-            sessionLastProblem.set(sessionId, designProblemId(p.statement));
-            inScopeProblemId = designProblemId(p.statement);
+            if (p.kind !== "constraint") {
+              sessionLastProblem.set(sessionId, designProblemId(p.statement));
+              inScopeProblemId = designProblemId(p.statement);
+            }
             if (p.threadId) threads.set(p.threadId, designProblemId(p.statement));
             try {
               if (anchorPath) {

package/package.json

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

package/pass-worker.mjs

@@ -25145,6 +25145,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,
@@ -25200,6 +25203,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"])) {
@@ -25208,14 +25212,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);
@@ -25226,9 +25230,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);
@@ -25245,6 +25251,7 @@ function resolveDesignProblems(store2, t) {
   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;
@@ -25731,6 +25738,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);
@@ -26063,12 +26071,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;
@@ -26135,6 +26145,7 @@ function buildSnapshot(opts) {
     profileContext,
     recentProblems: recent,
     recentResolved,
+    recentConstraints,
     ...causalNudge ? { causalNudge } : {},
     ...domainNudge ? { domainNudge } : {},
     motifs,
@@ -26187,6 +26198,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) => [