@inerrata-corporation/errata 2.0.0-dev.69 → 2.0.0-dev.70

package/consolidate-worker.mjs

@@ -14,7 +14,7 @@ var __export = (target, all) => {
 function isCausalProtected(type) {
   return CAUSAL_PROTECT_EDGES.includes(type);
 }
-var SEMANTIC_NODE_LABELS, CONTEXT_NODE_LABELS, CODE_NODE_LABELS, ALL_NODE_LABELS, STRUCTURAL_EDGES, CAUSAL_EDGES, RESOLUTION_EDGES, CONCEPTUAL_EDGES, EVIDENCE_EDGES, CODE_EDGES, BRIDGE_EDGES, IDENTITY_EDGES, JUSTIFICATION_EDGES, BELIEF_EDGES, ABSTRACTION_EDGES, DECOMPOSITION_EDGES, TRANSFER_EDGES, TAXONOMY_EDGES, TRIAGE_EDGES, GIT_EDGES, ALL_EDGE_TYPES, EDGE_WEIGHT, CAUSAL_PROTECT_EDGES, VALIDATION_SOURCES, ABSTRACTION_LEVEL, PROBLEM_RESOLUTION, DRIFT_KIND;
+var SEMANTIC_NODE_LABELS, CONTEXT_NODE_LABELS, CODE_NODE_LABELS, ALL_NODE_LABELS, STRUCTURAL_EDGES, CAUSAL_EDGES, RESOLUTION_EDGES, CONCEPTUAL_EDGES, EVIDENCE_EDGES, CODE_EDGES, BRIDGE_EDGES, IDENTITY_EDGES, JUSTIFICATION_EDGES, BELIEF_EDGES, ABSTRACTION_EDGES, DECOMPOSITION_EDGES, TRANSFER_EDGES, SOLUTION_STRUCTURE_EDGES, TAXONOMY_EDGES, TRIAGE_EDGES, GIT_EDGES, ALL_EDGE_TYPES, EDGE_WEIGHT, CAUSAL_PROTECT_EDGES, VALIDATION_SOURCES, ABSTRACTION_LEVEL, PROBLEM_RESOLUTION, DRIFT_KIND;
 var init_castalia = __esm({
   "../../packages/shared/src/castalia.ts"() {
     "use strict";
@@ -172,6 +172,7 @@ var init_castalia = __esm({
     ABSTRACTION_EDGES = ["GENERALIZES", "DERIVED_FROM"];
     DECOMPOSITION_EDGES = ["SPLIT_INTO"];
     TRANSFER_EDGES = ["MAY_RESOLVE"];
+    SOLUTION_STRUCTURE_EDGES = ["BUILDS_ON", "SUPERSEDES", "ALTERNATIVE_TO"];
     TAXONOMY_EDGES = ["IS_A"];
     TRIAGE_EDGES = ["TRIAGED_BY", "CONFIRMS", "INDICATES", "ROUTES_TO"];
     GIT_EDGES = ["POINTS_AT", "PARENT", "AUTHORED_BY"];
@@ -179,6 +180,7 @@ var init_castalia = __esm({
       ...STRUCTURAL_EDGES,
       ...CAUSAL_EDGES,
       ...RESOLUTION_EDGES,
+      ...SOLUTION_STRUCTURE_EDGES,
       ...CONCEPTUAL_EDGES,
       ...EVIDENCE_EDGES,
       ...CODE_EDGES,
@@ -288,6 +290,13 @@ var init_castalia = __esm({
       // INDICATES: real signal, but a candidate must not form a hub; promotion mints the
       // full-weight SOLVED_BY/MITIGATES instead of upgrading this edge.
       MAY_RESOLVE: 0.3,
+      // Solution-structure (SS-structure) — witnessed inter-solution relationships.
+      // BUILDS_ON flows (extension → base) so a foundational solution accrues centrality,
+      // discounted like MAY_RESOLVE so one witness isn't a hub; SUPERSEDES/ALTERNATIVE_TO
+      // are weightless gradients (PageRank-excluded below).
+      BUILDS_ON: 0.4,
+      SUPERSEDES: 0,
+      ALTERNATIVE_TO: 0,
       // Git — topology/authorship, weightless (not domain signal-flow)
       POINTS_AT: 0,
       PARENT: 0,

package/errata.mjs

@@ -64,7 +64,7 @@ function toCloudAttrs(attrs) {
   }
   return rest2;
 }
-var SEMANTIC_NODE_LABELS, CONTEXT_NODE_LABELS, CODE_NODE_LABELS, ALL_NODE_LABELS, STRUCTURAL_EDGES, CAUSAL_EDGES, RESOLUTION_EDGES, CONCEPTUAL_EDGES, EVIDENCE_EDGES, CODE_EDGES, BRIDGE_EDGES, IDENTITY_EDGES, JUSTIFICATION_EDGES, BELIEF_EDGES, ABSTRACTION_EDGES, DECOMPOSITION_EDGES, TRANSFER_EDGES, TAXONOMY_EDGES, TRIAGE_EDGES, GIT_EDGES, ALL_EDGE_TYPES, PAGERANK_EXCLUSIONS, EDGE_WEIGHT, EDGE_CONDUCTANCE_OVERRIDES, CAUSAL_PROTECT_EDGES, VALIDATION_SOURCES, TRUTH_KIND, ABSTRACTION_LEVEL, PROBLEM_RESOLUTION, DRIFT_KIND, TEST_PATH_RE, TEST_SCOPE_RE;
+var SEMANTIC_NODE_LABELS, CONTEXT_NODE_LABELS, CODE_NODE_LABELS, ALL_NODE_LABELS, STRUCTURAL_EDGES, CAUSAL_EDGES, RESOLUTION_EDGES, CONCEPTUAL_EDGES, EVIDENCE_EDGES, CODE_EDGES, BRIDGE_EDGES, IDENTITY_EDGES, JUSTIFICATION_EDGES, BELIEF_EDGES, ABSTRACTION_EDGES, DECOMPOSITION_EDGES, TRANSFER_EDGES, SOLUTION_STRUCTURE_EDGES, TAXONOMY_EDGES, TRIAGE_EDGES, GIT_EDGES, ALL_EDGE_TYPES, PAGERANK_EXCLUSIONS, EDGE_WEIGHT, EDGE_CONDUCTANCE_OVERRIDES, CAUSAL_PROTECT_EDGES, VALIDATION_SOURCES, TRUTH_KIND, ABSTRACTION_LEVEL, PROBLEM_RESOLUTION, DRIFT_KIND, TEST_PATH_RE, TEST_SCOPE_RE;
 var init_castalia = __esm({
   "../../packages/shared/src/castalia.ts"() {
     "use strict";
@@ -222,6 +222,7 @@ var init_castalia = __esm({
     ABSTRACTION_EDGES = ["GENERALIZES", "DERIVED_FROM"];
     DECOMPOSITION_EDGES = ["SPLIT_INTO"];
     TRANSFER_EDGES = ["MAY_RESOLVE"];
+    SOLUTION_STRUCTURE_EDGES = ["BUILDS_ON", "SUPERSEDES", "ALTERNATIVE_TO"];
     TAXONOMY_EDGES = ["IS_A"];
     TRIAGE_EDGES = ["TRIAGED_BY", "CONFIRMS", "INDICATES", "ROUTES_TO"];
     GIT_EDGES = ["POINTS_AT", "PARENT", "AUTHORED_BY"];
@@ -229,6 +230,7 @@ var init_castalia = __esm({
       ...STRUCTURAL_EDGES,
       ...CAUSAL_EDGES,
       ...RESOLUTION_EDGES,
+      ...SOLUTION_STRUCTURE_EDGES,
       ...CONCEPTUAL_EDGES,
       ...EVIDENCE_EDGES,
       ...CODE_EDGES,
@@ -273,8 +275,13 @@ var init_castalia = __esm({
       // git topology, not signal-flow
       "AUTHORED_BY",
       // git authorship, not signal-flow
-      "CONTRIBUTED"
+      "CONTRIBUTED",
       // agent attribution (Agent → knowledge), not signal-flow
+      "SUPERSEDES",
+      // "prefer newer" gradient between solutions, not signal-flow
+      "ALTERNATIVE_TO"
+      // symmetric peer marker — weight would let alternatives inflate each other
+      // NB: BUILDS_ON is NOT excluded — it flows extension→base so foundational solutions rank up.
     ]);
     EDGE_WEIGHT = {
       // Causal — high signal
@@ -371,6 +378,13 @@ var init_castalia = __esm({
       // INDICATES: real signal, but a candidate must not form a hub; promotion mints the
       // full-weight SOLVED_BY/MITIGATES instead of upgrading this edge.
       MAY_RESOLVE: 0.3,
+      // Solution-structure (SS-structure) — witnessed inter-solution relationships.
+      // BUILDS_ON flows (extension → base) so a foundational solution accrues centrality,
+      // discounted like MAY_RESOLVE so one witness isn't a hub; SUPERSEDES/ALTERNATIVE_TO
+      // are weightless gradients (PageRank-excluded below).
+      BUILDS_ON: 0.4,
+      SUPERSEDES: 0,
+      ALTERNATIVE_TO: 0,
       // Git — topology/authorship, weightless (not domain signal-flow)
       POINTS_AT: 0,
       PARENT: 0,
@@ -15628,6 +15642,7 @@ __export(src_exports, {
   RESOLUTION_EDGES: () => RESOLUTION_EDGES,
   RouteContextCountWireSchema: () => RouteContextCountWireSchema,
   SEMANTIC_NODE_LABELS: () => SEMANTIC_NODE_LABELS,
+  SOLUTION_STRUCTURE_EDGES: () => SOLUTION_STRUCTURE_EDGES,
   STRUCTURAL_EDGES: () => STRUCTURAL_EDGES,
   SYMBOL_SUMMARY_KINDS: () => SYMBOL_SUMMARY_KINDS,
   SymbolSummarySidecarSchema: () => SymbolSummarySidecarSchema,
@@ -17857,15 +17872,21 @@ function priorsForFile(store, relPath) {
       related.set(n.id, n);
     }
   }
+  const solutionsByProblem = /* @__PURE__ */ new Map();
   for (const p of openProblems) {
     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);
+      if (n && n.label === "Solution" && e.type === "SOLVED_BY") {
+        const list = solutionsByProblem.get(p.id) ?? [];
+        if (!list.some((s) => s.id === n.id)) list.push(n);
+        solutionsByProblem.set(p.id, list);
+      }
     }
   }
   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()] };
+  return { file: file2, openProblems, related: [...related.values()], solutionsByProblem };
 }
 function anchorProblemToDiff(store, problemId, changedPaths, workspaceId2, t, opts = {}) {
   return anchorNodeToDiff(store, problemId, "Problem", changedPaths, workspaceId2, t, opts);
@@ -20212,7 +20233,13 @@ 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 })),
-    related: fp.related.slice(0, 4).map((n) => ({ id: n.id, label: n.label, description: n.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) => [
+        p.id,
+        (fp.solutionsByProblem.get(p.id) ?? []).slice(0, 4).map((s) => ({ id: s.id, description: s.description }))
+      ])
+    )
   } : void 0;
   return {
     relPath,
@@ -20378,6 +20405,12 @@ function renderSnapshot(s) {
       );
       for (const p of w.priors.openProblems) {
         lines.push(`  - ${p.description} \u2192 \`(fix:[${p.id}])\` \xB7 \`([${p.id}])\``);
+        const sols = w.priors.solutionsByProblem[p.id] ?? [];
+        for (const s2 of sols) {
+          lines.push(
+            `    - already solved by: ${s2.description} \u2014 if your fix builds on / supersedes / is an alternative to this, say so: \`(builds-on:[${s2.id}])\` \xB7 \`(supersedes:[${s2.id}])\` \xB7 \`(alternative:[${s2.id}])\``
+          );
+        }
       }
     }
     if (w.priors?.related.length) {
@@ -24141,7 +24174,11 @@ function linkBullet(ref) {
     "      queue growth under backpressure)) \u2014 this works with NO code anchor, and two agents naming",
     "      the same pattern converge on one node. Cite a shown Pattern by handle: (pattern:[handle]).",
     `    \xB7 (aids:[${ref}],\u2026) \u2014 your FIX could also help these other, even unrelated, problems.`,
-    "      A hypothesis, not a claim \u2014 it's recorded as may-resolve and checked by whoever tries it."
+    "      A hypothesis, not a claim \u2014 it's recorded as may-resolve and checked by whoever tries it.",
+    `    \xB7 when your fix relates to a PRIOR solution you were primed with (a problem's`,
+    `      "already solved by" line): (builds-on:[${ref}]) if you layer on it \xB7 (supersedes:[${ref}])`,
+    "      if you replace it \xB7 (alternative:[h]) if it's a different approach \u2014 pick one. This is the",
+    "      only way N solutions on one problem stop being a flat bag."
   ].join("\n");
 }
 function attemptBullet() {
@@ -41136,6 +41173,9 @@ var CAUSE_PREFIX = /^\s*cause:(?:#([a-z][\w-]{0,63}))?\s*/i;
 var CAUSE_ARROW = /\s+(?:<-|←)\s+/;
 var ATTEMPT_RE = /\(\s*(tried|failed):(?:#([a-z][\w-]{0,63}))?\s*((?:[^()\n]|\([^()\n]*\)){8,}?)\s*\)/gi;
 var AIDS_PREFIX = /^\s*aids:(?:#([a-z][\w-]{0,63}))?\s*/i;
+var BUILDS_ON_PREFIX = /^\s*builds-on:(?:#([a-z][\w-]{0,63}))?\s*/i;
+var SUPERSEDES_PREFIX = /^\s*supersedes:(?:#([a-z][\w-]{0,63}))?\s*/i;
+var ALTERNATIVE_PREFIX = /^\s*alternative:(?:#([a-z][\w-]{0,63}))?\s*/i;
 var INSTANCE_PREFIX = /^\s*instance:\s*/i;
 var PATTERN_RE = /\(\s*pattern:\s*([^()\n]{3,}?)\s*\)/gi;
 var PATTERN_TEXT_MAX = 120;
@@ -41179,10 +41219,13 @@ function parseInlineTags(text) {
       const causeM = fixM ? null : CAUSE_PREFIX.exec(content);
       const aidsM = fixM || causeM ? null : AIDS_PREFIX.exec(content);
       const instM = fixM || causeM || aidsM ? null : INSTANCE_PREFIX.exec(content);
+      const ssM = fixM || causeM || aidsM || instM ? null : BUILDS_ON_PREFIX.exec(content) && { re: BUILDS_ON_PREFIX, kind: "builds-on" } || SUPERSEDES_PREFIX.exec(content) && { re: SUPERSEDES_PREFIX, kind: "supersedes" } || ALTERNATIVE_PREFIX.exec(content) && { re: ALTERNATIVE_PREFIX, kind: "alternative" };
       const isFix = fixM !== null;
       const isCause = causeM !== null;
-      if (aidsM || instM) {
-        const body2 = content.replace(aidsM ? AIDS_PREFIX : INSTANCE_PREFIX, "");
+      if (aidsM || instM || ssM) {
+        const re = aidsM ? AIDS_PREFIX : instM ? INSTANCE_PREFIX : ssM.re;
+        const threadMatch = ssM ? ssM.re.exec(content) : null;
+        const body2 = content.replace(re, "");
         const handles = [];
         HANDLE_RE.lastIndex = 0;
         let hh;
@@ -41191,11 +41234,13 @@ function parseInlineTags(text) {
           if (handle2 && !handles.includes(handle2)) handles.push(handle2);
         }
         if (handles.length > 0) {
+          const kind = aidsM ? "transfer" : instM ? "instance" : ssM.kind;
+          const threadId = aidsM?.[1] ?? threadMatch?.[1] ?? void 0;
           out2.push({
-            kind: aidsM ? "transfer" : "instance",
+            kind,
             handles,
             sentence: sfield,
-            ...aidsM?.[1] ? { threadId: aidsM[1] } : {}
+            ...threadId ? { threadId } : {}
           });
         }
         continue;
@@ -41445,7 +41490,7 @@ function harvestInlineTags(store, text, opts) {
   const source = opts.sourceId ? store.getNode(opts.sourceId) : null;
   const mintPriors = opts.mintPriors ?? true;
   const touched = opts.sessionTouchedIds ?? /* @__PURE__ */ new Set();
-  const plan = { priorEdges: 0, problems: [], fixes: [], triages: [], attempts: [], unresolvedFixes: [], transfers: [], instances: [], patterns: [], refutes: [], corroborations: [] };
+  const plan = { priorEdges: 0, problems: [], fixes: [], triages: [], attempts: [], unresolvedFixes: [], transfers: [], solutionLinks: [], instances: [], patterns: [], 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 bindSymptom = (seq, threadId) => {
@@ -41530,6 +41575,22 @@ function harvestInlineTags(store, text, opts) {
           ...b.statement ? { boundStatement: b.statement } : {}
         });
       }
+    } else if (tag.kind === "builds-on" || tag.kind === "supersedes" || tag.kind === "alternative") {
+      const targetIds = [];
+      for (const h of tag.handles ?? []) {
+        const id = resolveHandle(store, h, opts.handleMap);
+        if (id && !targetIds.includes(id)) targetIds.push(id);
+      }
+      if (targetIds.length > 0) {
+        const b = bindSymptom(tag.seq, tag.threadId);
+        const relation = tag.kind === "builds-on" ? "BUILDS_ON" : tag.kind === "supersedes" ? "SUPERSEDES" : "ALTERNATIVE_TO";
+        plan.solutionLinks.push({
+          relation,
+          targetIds,
+          ...tag.threadId ? { threadId: tag.threadId } : {},
+          ...b.statement ? { boundStatement: b.statement } : {}
+        });
+      }
     } else if (tag.kind === "instance") {
       const targetIds = [];
       for (const h of tag.handles ?? []) {
@@ -42976,7 +43037,7 @@ function startLoopLagMonitor(thresholdMs = 1e3) {
 }
 
 // src/engine.ts
-var DAEMON_VERSION = true ? "2.0.0-dev.69" : "2.0.0-alpha.0";
+var DAEMON_VERSION = true ? "2.0.0-dev.70" : "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;
@@ -43791,6 +43852,20 @@ function createWorkspaceEngine(opts) {
             mintCiteEdge(solId, targetId, "MAY_RESOLVE", 0.3, { transfer: true, hypothesis: true });
           }
         }
+        for (const sl of plan.solutionLinks) {
+          const pid = bindPid(sl);
+          const solId = pid ? solutionForProblem(store, pid) : void 0;
+          if (!solId) {
+            console.warn(`[errata] ${sl.relation} tag dropped: no solution in scope \u2014 state it beside its (fix:\u2026)`);
+            continue;
+          }
+          for (const targetId of sl.targetIds) {
+            if (targetId === solId) continue;
+            const target = store.getNode(targetId);
+            if (!target || target.label !== "Solution") continue;
+            mintCiteEdge(solId, targetId, sl.relation, 0.4, { solutionStructure: true, hypothesis: true });
+          }
+        }
         if (plan.refutes.length > 0 && typeof cloud.reportContradictions === "function") {
           void cloud.reportContradictions({ daemonVersion: DAEMON_VERSION, projectId: profile.id, items: plan.refutes }).then((r) => {
             if (r?.recorded) console.log(`[errata] refute: ${r.recorded} contradiction(s) recorded`);

package/package.json

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

package/pass-worker.mjs

@@ -25,7 +25,7 @@ function isTestRelPath(relPath) {
 function isTestScopeQname(qname) {
   return TEST_SCOPE_RE.test(qname);
 }
-var SEMANTIC_NODE_LABELS, CONTEXT_NODE_LABELS, CODE_NODE_LABELS, ALL_NODE_LABELS, STRUCTURAL_EDGES, CAUSAL_EDGES, RESOLUTION_EDGES, CONCEPTUAL_EDGES, EVIDENCE_EDGES, CODE_EDGES, BRIDGE_EDGES, IDENTITY_EDGES, JUSTIFICATION_EDGES, BELIEF_EDGES, ABSTRACTION_EDGES, DECOMPOSITION_EDGES, TRANSFER_EDGES, TAXONOMY_EDGES, TRIAGE_EDGES, GIT_EDGES, ALL_EDGE_TYPES, PAGERANK_EXCLUSIONS, EDGE_WEIGHT, CAUSAL_PROTECT_EDGES, VALIDATION_SOURCES, PROBLEM_RESOLUTION, DRIFT_KIND, TEST_PATH_RE, TEST_SCOPE_RE;
+var SEMANTIC_NODE_LABELS, CONTEXT_NODE_LABELS, CODE_NODE_LABELS, ALL_NODE_LABELS, STRUCTURAL_EDGES, CAUSAL_EDGES, RESOLUTION_EDGES, CONCEPTUAL_EDGES, EVIDENCE_EDGES, CODE_EDGES, BRIDGE_EDGES, IDENTITY_EDGES, JUSTIFICATION_EDGES, BELIEF_EDGES, ABSTRACTION_EDGES, DECOMPOSITION_EDGES, TRANSFER_EDGES, SOLUTION_STRUCTURE_EDGES, TAXONOMY_EDGES, TRIAGE_EDGES, GIT_EDGES, ALL_EDGE_TYPES, PAGERANK_EXCLUSIONS, EDGE_WEIGHT, CAUSAL_PROTECT_EDGES, VALIDATION_SOURCES, PROBLEM_RESOLUTION, DRIFT_KIND, TEST_PATH_RE, TEST_SCOPE_RE;
 var init_castalia = __esm({
   "../../packages/shared/src/castalia.ts"() {
     "use strict";
@@ -183,6 +183,7 @@ var init_castalia = __esm({
     ABSTRACTION_EDGES = ["GENERALIZES", "DERIVED_FROM"];
     DECOMPOSITION_EDGES = ["SPLIT_INTO"];
     TRANSFER_EDGES = ["MAY_RESOLVE"];
+    SOLUTION_STRUCTURE_EDGES = ["BUILDS_ON", "SUPERSEDES", "ALTERNATIVE_TO"];
     TAXONOMY_EDGES = ["IS_A"];
     TRIAGE_EDGES = ["TRIAGED_BY", "CONFIRMS", "INDICATES", "ROUTES_TO"];
     GIT_EDGES = ["POINTS_AT", "PARENT", "AUTHORED_BY"];
@@ -190,6 +191,7 @@ var init_castalia = __esm({
       ...STRUCTURAL_EDGES,
       ...CAUSAL_EDGES,
       ...RESOLUTION_EDGES,
+      ...SOLUTION_STRUCTURE_EDGES,
       ...CONCEPTUAL_EDGES,
       ...EVIDENCE_EDGES,
       ...CODE_EDGES,
@@ -234,8 +236,13 @@ var init_castalia = __esm({
       // git topology, not signal-flow
       "AUTHORED_BY",
       // git authorship, not signal-flow
-      "CONTRIBUTED"
+      "CONTRIBUTED",
       // agent attribution (Agent → knowledge), not signal-flow
+      "SUPERSEDES",
+      // "prefer newer" gradient between solutions, not signal-flow
+      "ALTERNATIVE_TO"
+      // symmetric peer marker — weight would let alternatives inflate each other
+      // NB: BUILDS_ON is NOT excluded — it flows extension→base so foundational solutions rank up.
     ]);
     EDGE_WEIGHT = {
       // Causal — high signal
@@ -332,6 +339,13 @@ var init_castalia = __esm({
       // INDICATES: real signal, but a candidate must not form a hub; promotion mints the
       // full-weight SOLVED_BY/MITIGATES instead of upgrading this edge.
       MAY_RESOLVE: 0.3,
+      // Solution-structure (SS-structure) — witnessed inter-solution relationships.
+      // BUILDS_ON flows (extension → base) so a foundational solution accrues centrality,
+      // discounted like MAY_RESOLVE so one witness isn't a hub; SUPERSEDES/ALTERNATIVE_TO
+      // are weightless gradients (PageRank-excluded below).
+      BUILDS_ON: 0.4,
+      SUPERSEDES: 0,
+      ALTERNATIVE_TO: 0,
       // Git — topology/authorship, weightless (not domain signal-flow)
       POINTS_AT: 0,
       PARENT: 0,
@@ -24960,15 +24974,21 @@ function priorsForFile(store2, relPath) {
       related.set(n.id, n);
     }
   }
+  const solutionsByProblem = /* @__PURE__ */ new Map();
   for (const p of openProblems) {
     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);
+      if (n && n.label === "Solution" && e.type === "SOLVED_BY") {
+        const list = solutionsByProblem.get(p.id) ?? [];
+        if (!list.some((s) => s.id === n.id)) list.push(n);
+        solutionsByProblem.set(p.id, list);
+      }
     }
   }
   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()] };
+  return { file: file2, openProblems, related: [...related.values()], solutionsByProblem };
 }
 function resolveDesignProblems(store2, t) {
   let resolved = 0;
@@ -25819,7 +25839,13 @@ 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 })),
-    related: fp.related.slice(0, 4).map((n) => ({ id: n.id, label: n.label, description: n.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) => [
+        p.id,
+        (fp.solutionsByProblem.get(p.id) ?? []).slice(0, 4).map((s) => ({ id: s.id, description: s.description }))
+      ])
+    )
   } : void 0;
   return {
     relPath,