@inerrata-corporation/errata 2.0.16-dev.3355 → 2.0.16

package/package.json

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

package/pass-worker.mjs

@@ -15122,7 +15122,7 @@ var init_edge_rules = __esm({
       // anchor anything at anything, e.g. at a public `Package`, quietly re-creating
       // the code↔collective bridge the membrane exists to prevent.
       ANCHORED_AT: {
-        from: ["Problem", "Vulnerability", "Solution", "RootCause", "Claim"],
+        from: ["Problem", "Solution", "RootCause", "Claim"],
         to: ["Symbol"]
       },
       // ── Security spine (v1 taxonomy.ts SECURITY_FORWARD_ONLY commentary) ──
@@ -15167,7 +15167,7 @@ var init_edge_rules = __esm({
       // `Component` joined the target set with OM-agent-anchors: an agent-named
       // component ("React Router") is the same knowledge→named-unit anchor shape as
       // a Tool — the knowledge is ABOUT it, not dependent on it.
-      CONCERNS: { from: ["Problem", "Vulnerability", "Solution", "RootCause", "Claim", "Pattern"], to: ["Tool", "Component"] },
+      CONCERNS: { from: ["Problem", "Solution", "RootCause", "Claim", "Pattern"], to: ["Tool", "Component"] },
       OPERATES_ON: { from: ["Algorithm"], to: ["DataStructure"] },
       INVOLVES: { from: ["Problem", "Solution"], to: ["DataStructure"] },
       // ── Taxonomy (Track 4 Stream C: MITRE CWE `ChildOf` → `Weakness —IS_A→ Weakness`) ──
@@ -24827,8 +24827,7 @@ CREATE INDEX IF NOT EXISTS nodes_live ON nodes(label, valid_to);
 -- its table row. Partial, so it maintains a few thousand rows instead of adding
 -- a write to every node write. Its label list is FINGERPRINT_INDEXED_LABELS.
 DROP INDEX IF EXISTS nodes_live_fingerprint;
-DROP INDEX IF EXISTS nodes_instance_fingerprint;
-CREATE INDEX IF NOT EXISTS nodes_instance_fingerprint_v2 ON nodes(label, last_updated_at, last_reinforced_at_seq, created_at_seq) WHERE valid_to IS NULL AND label IN ('Problem','Vulnerability','Solution','RootCause');
+CREATE INDEX IF NOT EXISTS nodes_instance_fingerprint ON nodes(label, last_updated_at, last_reinforced_at_seq, created_at_seq) WHERE valid_to IS NULL AND label IN ('Problem','Solution','RootCause');
 CREATE INDEX IF NOT EXISTS nodes_logical ON nodes(logical_id, version);
 CREATE INDEX IF NOT EXISTS edges_live ON edges(valid_to);
 -- Expression index on the per-node relPath (stored in attrs_json) so the
@@ -24899,7 +24898,7 @@ function rowToEdge(r) {
     attrs: JSON.parse(r.attrs_json)
   };
 }
-var FINGERPRINT_INDEXED_LABELS = ["Problem", "Vulnerability", "Solution", "RootCause"];
+var FINGERPRINT_INDEXED_LABELS = ["Problem", "Solution", "RootCause"];
 var SqliteGraphStore = class {
   db;
   // Typed edge lookups build their SQL from the number of types asked for, and
@@ -25577,8 +25576,8 @@ var SqliteGraphStore = class {
       const r2 = this.db.prepare(
         `SELECT COUNT(*) AS n, MAX(last_updated_at) AS t,
                   MAX(COALESCE(last_reinforced_at_seq, created_at_seq, 0)) AS s
-             FROM nodes INDEXED BY nodes_instance_fingerprint_v2
-            WHERE valid_to IS NULL AND label IN ('Problem','Vulnerability','Solution','RootCause')`
+             FROM nodes INDEXED BY nodes_instance_fingerprint
+            WHERE valid_to IS NULL AND label IN ('Problem','Solution','RootCause')`
       ).get();
       return `${r2.n}:${r2.t ?? 0}:${r2.s ?? 0}`;
     }
@@ -26182,7 +26181,7 @@ function mergeContextEdge(store2, from, to, type, ts) {
 function deriveContextFromAnchors(store2, problemId, ts, pkgIndex) {
   const report = { languages: [], packages: [] };
   const p = store2.getNode(problemId);
-  if (!p || p.label !== "Problem" && p.label !== "Vulnerability") return report;
+  if (!p || p.label !== "Problem") return report;
   const files = store2.outEdges(problemId, ["ANCHORED_AT"]).map((e) => store2.getNode(e.to)).filter((n) => !!n && n.label === "File");
   if (files.length === 0) return report;
   const idx = pkgIndex ?? buildPackageIndex(store2);
@@ -26387,7 +26386,7 @@ function priorsForFile(store2, relPath) {
   for (const e of store2.inEdges(file2.id, ["ANCHORED_AT"])) {
     const n = store2.getNode(e.from);
     if (!n) continue;
-    if (n.label === "Problem" || n.label === "Vulnerability") {
+    if (n.label === "Problem") {
       if (seenProblem.has(n.id)) continue;
       seenProblem.add(n.id);
       if (!n.attrs["resolvedAt"]) {
@@ -27655,7 +27654,7 @@ var AGENTS_POINTER_BODY = [
 init_src2();
 init_src();
 function buildSnapshot(opts) {
-  const problems = [...opts.store.findNodesByLabel("Problem"), ...opts.store.findNodesByLabel("Vulnerability")].filter((p) => p.attrs["mergedInto"] === void 0 && historyReadPolicy(p, { mode: "passive", atCommit: opts.atCommit }).allow);
+  const problems = opts.store.findNodesByLabel("Problem").filter((p) => p.attrs["mergedInto"] === void 0 && historyReadPolicy(p, { mode: "passive", atCommit: opts.atCommit }).allow);
   const stillOpen = problems.filter((p) => p.attrs["resolvedAt"] == null);
   const allProblems = stillOpen.filter((p) => !isConstraintProblem(p));
   allProblems.sort((a, b) => b.lastUpdatedAt - a.lastUpdatedAt);
@@ -27810,11 +27809,11 @@ function sliceForFile(store2, relPath, atCommit) {
   const priors = fp ? {
     openProblems: fp.openProblems.slice(0, 3).map((p) => ({
       id: p.id,
-      description: p.label === "Vulnerability" ? `Vulnerability (${p.attrs["assessment"] ?? "unassessed"}): ${p.description}` : p.description,
+      description: p.description,
       ...typeof p.attrs["fixCandidateFile"] === "string" ? { fixCandidateFile: p.attrs["fixCandidateFile"] } : {}
     })),
     constraints: fp.constraints.slice(0, 2).map((c) => ({ id: c.id, description: c.description })),
-    resolvedProblems: fp.resolvedProblems.slice(0, 3).map((p) => ({ id: p.id, description: p.label === "Vulnerability" ? `Vulnerability (${p.attrs["assessment"] ?? "unassessed"}): ${p.description}` : p.description })),
+    resolvedProblems: fp.resolvedProblems.slice(0, 3).map((p) => ({ id: p.id, description: p.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), ...fp.resolvedProblems.slice(0, 3)].map((p) => [