@inerrata-corporation/errata 2.0.17-dev.3416 → 2.0.17-dev.3426

package/package.json

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

package/pass-worker.mjs

@@ -28833,11 +28833,13 @@ function buildSnapshot(opts) {
   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) => ({
+  const openPool = allProblems.slice(0, RECENT_OPEN * SCOPE_POOL_FACTOR).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 recent = openPool.slice(0, RECENT_OPEN);
+  const constraintPool = stillOpen.filter((p) => isConstraintProblem(p)).sort((a, b) => b.lastUpdatedAt - a.lastUpdatedAt).slice(0, RECENT_CONSTRAINTS * SCOPE_POOL_FACTOR);
+  const recentConstraints = constraintPool.slice(0, RECENT_CONSTRAINTS);
   const regressions = problems.filter((p) => p.attrs["resolvedAt"] == null && p.attrs["mergedInto"] === void 0).flatMap(
     (open) => opts.store.outEdges(open.id, ["REGRESSION_OF"]).flatMap((e) => {
       const closed = opts.store.getNode(e.to);
@@ -28850,11 +28852,12 @@ function buildSnapshot(opts) {
     })
   ).sort((a, b) => Number(b.closed.attrs["recurredAt"] ?? 0) - Number(a.closed.attrs["recurredAt"] ?? 0)).slice(0, 2);
   const regressionClosedIds = new Set(regressions.map((r) => r.closed.id));
-  const recentResolved = problems.filter((p) => p.attrs["resolvedAt"] != null && p.attrs["resolvedAs"] == null).filter((p) => !regressionClosedIds.has(p.id)).sort((a, b) => Number(b.attrs["resolvedAt"] ?? 0) - Number(a.attrs["resolvedAt"] ?? 0)).slice(0, 4).map((p) => {
+  const resolvedPool = problems.filter((p) => p.attrs["resolvedAt"] != null && p.attrs["resolvedAs"] == null).filter((p) => !regressionClosedIds.has(p.id)).sort((a, b) => Number(b.attrs["resolvedAt"] ?? 0) - Number(a.attrs["resolvedAt"] ?? 0)).slice(0, RECENT_RESOLVED * SCOPE_POOL_FACTOR).map((p) => {
     const solEdge = opts.store.outEdges(p.id, ["SOLVED_BY"])[0];
     const solution = solEdge ? opts.store.getNode(solEdge.to) ?? void 0 : void 0;
     return { node: p, ...solution ? { solution } : {} };
   });
+  const recentResolved = resolvedPool.slice(0, RECENT_RESOLVED);
   const motifs = [
     ...opts.store.findNodesByLabel("Pattern"),
     ...opts.store.findNodesByLabel("Technique"),
@@ -28932,9 +28935,14 @@ function buildSnapshot(opts) {
     pendingEnrichment,
     skills: opts.skills ?? [],
     needsRevisit,
+    scopePool: { open: openPool, resolved: resolvedPool, constraints: constraintPool },
     generatedAt: (opts.now ?? /* @__PURE__ */ new Date()).toISOString()
   };
 }
+var RECENT_OPEN = 8;
+var RECENT_RESOLVED = 4;
+var RECENT_CONSTRAINTS = 3;
+var SCOPE_POOL_FACTOR = 3;
 function sliceForFile(store2, relPath, atCommit) {
   const candidates = store2.findNodesByLabel("File");
   const file2 = candidates.find((n) => n.description === relPath);