pi-mega-compact 0.20.7 → 0.20.8

package/extensions/dashboard-server/server.ts

@@ -26,51 +26,8 @@ import { createRequire } from "node:module";
 import { NEW_UI } from "../../src/config.js";
 import { log, setLogPath, setDashboardServerVersion } from "./state.js";
 import { detectTailscaleIP } from "./tailscale.js";
-import {
-	buildRouteContext,
-	handleIndex,
-	handleRepoIndex,
-	handleEvents,
-	handleGameState,
-	handleGameScores,
-	handlePerf,
-	handlePerfSamples,
-	handleAchievements,
-	handleSessions,
-	handleTopics,
-	handleTurns,
-	handleMaintenance,
-	handleProviderCache,
-	handleCacheStripes,
-	handleMemoryStatus,
-	handleSetupStatus,
-	handleSetupDetect,
-	handleSetupConfigure,
-	handleMemoryMap,
-	handleRaptorTree,
-	handleRaptorBuildHistory,
-	handleContextHealth,
-	handleCachePoison,
-	handleHealthSettings,
-	handleEmbedderHealth,
-	handleRagSettings,
-	handleRagMetrics,
-	handleModelThresholds,
-	handleWiki,
-	handleVectorCortexEvaluation,
-	handleVectorCortexHealth,
-	handleVectorCortexBreakersReset,
-	handleVectorCortexLedger,
-	handleVectorCortexTopology,
-	handleVectorCortexQuery,
-	handleVectorCortexShards,
-	handleVectorCortexResidual,
-	handleVectorCortexReconstruct,
-	handleVectorCortexPlans,
-	handleVectorCortexRender,
-	handleVectorCortexRollout,
-	handleStatic,
-} from "./routes.js";
+import { buildRouteContext, handleStatic } from "./routes.js";
+import { dispatchRoutes } from "./route-dispatch.js";
 
 export async function launchDashboardServer(
 	stateDir: string,
@@ -276,47 +233,7 @@ export async function launchDashboardServer(
 		}
 
 		// Dispatch — each handler returns true if it ended the response.
-		if (handleIndex(req, res, ctx)) return;
-		if (handleRepoIndex(req, res, ctx)) return;
-		if (handleEvents(req, res, ctx)) return;
-		if (handleGameState(req, res, ctx)) return;
-		if (handleGameScores(req, res, ctx)) return;
-		if (handlePerfSamples(req, res, ctx)) return;
-		if (handlePerf(req, res, ctx)) return;
-		if (handleAchievements(req, res, ctx)) return;
-		if (handleSessions(req, res, ctx)) return;
-		if (handleTopics(req, res, ctx)) return;
-		if (handleTurns(req, res, ctx)) return;
-		if (handleMaintenance(req, res, ctx)) return;
-		if (handleProviderCache(req, res, ctx)) return;
-		if (handleMemoryStatus(req, res, ctx)) return;
-		if (handleCacheStripes(req, res, ctx)) return;
-		if (handleSetupStatus(req, res, ctx)) return;
-		if (handleSetupDetect(req, res, ctx)) return;
-		if (handleSetupConfigure(req, res, ctx)) return;
-		if (handleMemoryMap(req, res, ctx)) return;
-		if (handleRaptorTree(req, res, ctx)) return;
-		if (handleRaptorBuildHistory(req, res, ctx)) return;
-		if (handleContextHealth(req, res, ctx)) return;
-		if (handleCachePoison(req, res, ctx)) return;
-		if (handleHealthSettings(req, res, ctx)) return;
-		if (handleEmbedderHealth(req, res, ctx)) return;
-		if (handleRagSettings(req, res, ctx)) return;
-		if (handleRagMetrics(req, res, ctx)) return;
-		if (handleModelThresholds(req, res, ctx)) return;
-		if (handleWiki(req, res, ctx)) return;
-		if (handleVectorCortexEvaluation(req, res, ctx)) return;
-		if (handleVectorCortexHealth(req, res, ctx)) return;
-		if (handleVectorCortexBreakersReset(req, res, ctx)) return;
-		if (handleVectorCortexLedger(req, res, ctx)) return;
-		if (handleVectorCortexTopology(req, res, ctx)) return;
-		if (handleVectorCortexQuery(req, res, ctx)) return;
-		if (handleVectorCortexShards(req, res, ctx)) return;
-		if (handleVectorCortexResidual(req, res, ctx)) return;
-		if (handleVectorCortexReconstruct(req, res, ctx)) return;
-		if (handleVectorCortexPlans(req, res, ctx)) return;
-		if (handleVectorCortexRender(req, res, ctx)) return;
-	if (handleVectorCortexRollout(req, res, ctx)) return;
+		if (dispatchRoutes(req, res, ctx)) return;
 		handleStatic(req, res, ctx);
 	});
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "pi-mega-compact",
-  "version": "0.20.7",
+  "version": "0.20.8",
   "description": "Layered, local, vector-backed context compressor for pi — supersede/collapse/cluster compaction with deduped inline recall.",
   "type": "module",
   "license": "BSD-3-Clause",

package/src/config/vector-cortex.ts

@@ -214,6 +214,19 @@ export const VC5B_ENABLED = (): boolean => sprintFlag("MEGACOMPACT_VC5B");
  */
 export const VC5C_ENABLED = (): boolean => sprintFlag("MEGACOMPACT_VC5C");
 
+/**
+ * VC6A — advanced closure optimization. Default ON. `MEGACOMPACT_VC6A=0`
+ * disables and is byte-identical to the predecessor (VC5C): the `optimizeClosure`
+ * transitive-reduction arithmetic STILL RUNS (it is PURE), but the
+ * `vector_cortex_closure_optimized` / `vector_cortex_closure_proof_rejected`
+ * events are never emitted and the dashboard closure diagnostics seam is
+ * suppressed. Flag OFF gates the reporter + dashboard seam, never the arithmetic,
+ * so flag-off outbound/predecessor golden bytes match exactly. This flag MUST
+ * also be a dashboard SETTINGS toggle (visible in config UI, never in
+ * EXCLUDED_SETTINGS), mirroring VC4A/VC4B/VC4C/VC5A/VC5B/VC5C.
+ */
+export const VC6A_ENABLED = (): boolean => sprintFlag("MEGACOMPACT_VC6A");
+
 // ---------------------------------------------------------------------------
 // Breaker state machine constants (TRIAD_RESILIENCE.md §breaker).
 // Rolled numbers for one 60s window; VC0C consumes these at its breaker seam.

package/src/config.ts

@@ -169,6 +169,7 @@ export {
   VC5A_ENABLED,
   VC5B_ENABLED,
   VC5C_ENABLED,
+  VC6A_ENABLED,
   BREAKER_WINDOW_MS,
   BREAKER_MIN_ATTEMPTS,
   BREAKER_PERF_FAILURES,

package/src/vector-cortex/heal/_acceptance-fixture.ts

@@ -0,0 +1,108 @@
+/**
+ * heal/_acceptance-fixture.ts — conformance fixture I/O for VC6A closure
+ * optimization acceptance rows.
+ *
+ * Reads the v2 conformance manifest + the per-sprint closure-optimization
+ * fixture files, and exposes the `HealFx` shape the acceptance aggregator
+ * drives. No mocks/stubs: the fixtures are the committed canonical corpus, fed
+ * verbatim into `closeSelection` → `optimizeClosure` → `verifyProof`.
+ */
+
+import { readFileSync, existsSync } from "node:fs";
+import { join, dirname } from "node:path";
+import { fileURLToPath } from "node:url";
+import assert from "node:assert/strict";
+
+const HERE = dirname(fileURLToPath(import.meta.url));
+
+function repoRoot(from: string): string {
+  let dir = from;
+  for (let i = 0; i < 8; i++) {
+    if (existsSync(join(dir, "conformance", "vector-cortex"))) return dir;
+    const next = dirname(dir);
+    if (next === dir) break;
+    dir = next;
+  }
+  throw new Error("conformance corpus not found above " + from);
+}
+export const REPO_ROOT = repoRoot(HERE);
+export const V2 = join(REPO_ROOT, "conformance", "vector-cortex", "v2");
+
+export interface ManifestRow {
+  id: string;
+  path: string;
+  algorithm: string;
+  expected: string;
+}
+
+export interface HealFxGraphNode {
+  id: string;
+  kind: string;
+  tokenEstimate: number;
+  anchor?: boolean;
+}
+export interface HealFxGraphEdge {
+  from: string;
+  to: string;
+  kind: "depends" | "tool-pair" | "contradicts";
+}
+export interface HealFxGraph {
+  sessionId: string;
+  nodes: HealFxGraphNode[];
+  edges: HealFxGraphEdge[];
+  resolutions?: Array<{ loserId: string; winnerId: string }>;
+}
+export interface HealFxInput {
+  graph: HealFxGraph;
+  scenario: string;
+  seeds: string[];
+}
+export interface HealFxExpected {
+  ok: boolean;
+  code?: string;
+  removedEdges: number;
+  retainedEdges: number;
+  selectedMatch: boolean;
+  protectedRetained: number;
+  deterministic?: boolean;
+}
+export interface HealFx {
+  id: string;
+  schema: string;
+  producer: string;
+  assertion: string;
+  kind: string;
+  input: HealFxInput;
+  expected: HealFxExpected;
+}
+
+export function readManifest(): { fixtures: ManifestRow[] } {
+  return JSON.parse(readFileSync(join(V2, "manifest.json"), "utf8")) as {
+    fixtures: ManifestRow[];
+  };
+}
+
+function readFixture(id: string, prefix: "closure-optimization"): HealFx {
+  const m = readManifest();
+  const row = m.fixtures.find((f) => f.id === id && f.path.startsWith(`${prefix}/`));
+  assert.ok(row, `fixture ${id} registered under ${prefix}/ in manifest`);
+  return JSON.parse(readFileSync(join(V2, row.path), "utf8")) as HealFx;
+}
+
+export function healFixture(id: string): HealFx {
+  return readFixture(id, "closure-optimization");
+}
+
+/** Flag-pinned wrapper: VC6A gated by MEGACOMPACT_VC6A (defaults ON). */
+export function withFlagsOn(fn: () => void): () => void {
+  return (): void => {
+    const saved = process.env.MEGACOMPACT_VC6A;
+    process.env.MEGACOMPACT_VC6A = "1";
+    try {
+      fn();
+    } finally {
+      if (saved === undefined) delete process.env.MEGACOMPACT_VC6A;
+      else process.env.MEGACOMPACT_VC6A = saved;
+    }
+  };
+}

package/src/vector-cortex/heal/closure-metrics.ts

@@ -0,0 +1,73 @@
+/**
+ * vector-cortex/heal/closure-metrics.ts — VC6A closure proof metrics + handoff.
+ *
+ * Pure read-only derivations over a `ClosureProofV2`: traversal savings (the
+ * sprint's >=20% median acceptance bar) and the `RestoreHintV1` list VC6B
+ * consumes. Extracted from `closure-opt.ts` (delegate-shell) to keep the core
+ * reduction algorithm under the 300-line soft limit.
+ *
+ * PURE / DETERMINISTIC / LOCAL: no storage, no clock, no network (PREVENT-PI-004
+ * / PREVENT-011). Identity only — never source bytes or prompt text
+ * (SECURITY_PRIVACY).
+ */
+
+import type { ClosureGraph } from "../reconstruct/types.js";
+import type { ClosureProofV2, RestoreHintV1, RetainReason } from "./types.js";
+
+/** Bytewise id comparator — matches `closure-opt.ts` / `reconstruct/closure.ts`. */
+function byBytes(a: string, b: string): number {
+  return a < b ? -1 : a > b ? 1 : 0;
+}
+
+/** Anchor id set from a graph (matches `closure-opt.ts`). */
+function anchorIds(graph: ClosureGraph): Set<string> {
+  return new Set(graph.nodes.filter((n) => n.anchor === true).map((n) => n.id));
+}
+
+/**
+ * Traversal savings as a fraction in [0,1]: how much of the conservative edge
+ * walk the optimized plan avoids. A plan with nothing to remove scores 0 (not a
+ * failure — a chain graph is already minimal). The sprint's acceptance bar is a
+ * >=20% MEDIAN over the corpus, never a per-graph floor.
+ */
+export function traversalSavings(proof: ClosureProofV2): number {
+  if (proof.conservativeTraversals === 0) return 0;
+  const saved = proof.conservativeTraversals - proof.optimizedTraversals;
+  return saved / proof.conservativeTraversals;
+}
+
+/**
+ * Derive the `RestoreHintV1` list VC6B consumes (the sprint's declared handoff:
+ * "VC6B receives missing-source hints and proof").
+ *
+ * One hint per selected node that a RETAINED edge reaches, naming the cheapest
+ * (bytewise-first) retained prerequisite and whether the node is protected.
+ * Identity only — never source bytes or prompt text (SECURITY_PRIVACY).
+ */
+export function restoreHints(proof: ClosureProofV2, graph: ClosureGraph): readonly RestoreHintV1[] {
+  const anchors = anchorIds(graph);
+  const best = new Map<string, { from: string; reason: RetainReason }>();
+  for (const row of proof.rows) {
+    if (row.decision !== "retained") continue;
+    const reason = row.reason as RetainReason;
+    const existing = best.get(row.to);
+    if (existing === undefined || byBytes(row.from, existing.from) < 0) {
+      best.set(row.to, { from: row.from, reason });
+    }
+  }
+  const hints: RestoreHintV1[] = [];
+  for (const nodeId of [...proof.selected].sort(byBytes)) {
+    const hit = best.get(nodeId);
+    const isToolPair = proof.retainedEdges.some(
+      (e) => e.kind === "tool-pair" && (e.from === nodeId || e.to === nodeId),
+    );
+    hints.push({
+      schema: "restore-hint-v1",
+      nodeId,
+      viaEdgeFrom: hit?.from,
+      protectedNode: anchors.has(nodeId) || isToolPair,
+      reason: hit?.reason ?? (anchors.has(nodeId) ? "anchor" : "no-alternate-path"),
+    });
+  }
+  return hints;
+}

package/src/vector-cortex/heal/closure-opt.ts

@@ -0,0 +1,266 @@
+/**
+ * vector-cortex/heal/closure-opt.ts — VC6A deterministic transitive reduction
+ * over the ALREADY-MANDATORY VC4C closure.
+ *
+ * WHAT THIS DOES NOT DO: it does not close anything and it does not change which
+ * nodes are selected. `closeSelection` (VC4C) has already run and produced the
+ * mandatory set; CONTRACTS §plan and closure is explicit that "VC6 only
+ * optimizes restoration/self-healing". This module takes that closed set and
+ * shrinks the EDGE PLAN used to justify/re-walk it.
+ *
+ * THE REDUCTION. Requirements flow prerequisite `from` → dependent `to`, and
+ * closure walks them BACKWARD (selecting `to` pulls in `from`). So the
+ * requirement relation is `to ⇒ from`. If `c ⇒ b` and `b ⇒ a` are both in the
+ * plan, then a third edge `c ⇒ a` adds nothing: walking `c` already reaches `a`
+ * through `b`. That third edge is transitively implied and is the only kind of
+ * edge this module removes.
+ *
+ * WHAT IS NEVER REMOVED (task 3):
+ *   - a `tool-pair` edge          — the pair is atomic (PREVENT-PI-002);
+ *   - any edge touching an anchor — the floor is preserved (PREVENT-PI-001);
+ *   - a `contradicts` edge        — the resolver reads it directly, so removing
+ *                                   it would change the resolved set;
+ *   - a SOLE dependency edge      — the only edge pulling its prerequisite in.
+ * Every considered edge — retained or removed — is recorded in the proof, so the
+ * verifier can replay the decision rather than trust it.
+ *
+ * DETERMINISM. Vertices and edges are sorted by ID BYTES (the same bytewise
+ * comparator `reconstruct/closure.ts` uses), the reachability search drains a
+ * sorted worklist, and every emitted array is sorted. Two graphs that differ
+ * only in input order produce byte-identical proofs.
+ *
+ * PURITY. No storage, no console, no clock, no network (PREVENT-PI-004 /
+ * PREVENT-011). The FLAG DOES NOT GATE THIS ARITHMETIC: `MEGACOMPACT_VC6A=0`
+ * gates the reporter + dashboard seam only (see `emit.ts`), exactly as
+ * VC5B/VC5C do, so flag-off is byte-identical to the predecessor.
+ */
+
+import type { ClosureEdge, ClosureGraph, ClosureResult } from "../reconstruct/types.js";
+import type { ClosureProofRow, ClosureProofV2, RetainReason } from "./types.js";
+
+/** Bytewise id comparator — identical to `reconstruct/closure.ts::sortedIds`. */
+function byBytes(a: string, b: string): number {
+  return a < b ? -1 : a > b ? 1 : 0;
+}
+
+/** Total order over edges: `from`, then `to`, then `kind` — all bytewise. */
+function compareEdges(x: ClosureEdge, y: ClosureEdge): number {
+  return byBytes(x.from, y.from) || byBytes(x.to, y.to) || byBytes(x.kind, y.kind);
+}
+
+/** Sorted copy of an edge list (never mutates the caller's array). */
+function sortedEdges(edges: readonly ClosureEdge[]): ClosureEdge[] {
+  return [...edges].sort(compareEdges);
+}
+
+/**
+ * The requirement adjacency of a plan: for a dependent node, which prerequisites
+ * it pulls in. Mirrors `reconstruct/closure.ts::buildRequirements` — `depends`
+ * walks backward to the prerequisite, `tool-pair` walks BOTH ways because a pair
+ * is atomic. `contradicts` never pulls a node in and is therefore absent here
+ * (it is still protected from removal; it simply is not a traversal edge).
+ */
+function requirementAdjacency(edges: readonly ClosureEdge[]): Map<string, string[]> {
+  const adj = new Map<string, string[]>();
+  const add = (key: string, value: string): void => {
+    const list = adj.get(key);
+    if (list === undefined) adj.set(key, [value]);
+    else list.push(value);
+  };
+  for (const e of edges) {
+    if (e.kind === "depends") add(e.to, e.from);
+    else if (e.kind === "tool-pair") {
+      add(e.to, e.from);
+      add(e.from, e.to);
+    }
+  }
+  for (const list of adj.values()) list.sort(byBytes);
+  return adj;
+}
+
+/**
+ * Is `target` reachable from `start` through the requirement adjacency WITHOUT
+ * using the direct `start ⇒ target` hop? Returns the witnessing intermediate
+ * vertex (the first hop of the detour, bytewise-smallest) or `null`.
+ *
+ * This is the "alternate path exists" test that licenses a removal. The direct
+ * hop is excluded so an edge can never justify its own removal; a cycle simply
+ * revisits `seen` and terminates.
+ */
+function alternatePathVia(
+  adj: ReadonlyMap<string, string[]>,
+  start: string,
+  target: string,
+): string | null {
+  // First hops other than the direct one, in bytewise order so the witness is
+  // deterministic when several detours exist.
+  const firstHops = (adj.get(start) ?? []).filter((n) => n !== target);
+  for (const hop of firstHops) {
+    // Breadth-first from this hop; `seen` excludes `start` so a detour that
+    // loops back through the origin cannot be counted as progress.
+    const seen = new Set<string>([start]);
+    const worklist: string[] = [hop];
+    while (worklist.length > 0) {
+      worklist.sort(byBytes);
+      const current = worklist.shift();
+      if (current === undefined) break;
+      if (current === target) return hop;
+      if (seen.has(current)) continue;
+      seen.add(current);
+      for (const next of adj.get(current) ?? []) {
+        if (!seen.has(next)) worklist.push(next);
+      }
+    }
+  }
+  return null;
+}
+
+/**
+ * Is `target` reachable from `start` using ONLY the edges in `others` (a path of
+ * length >= 2, never the direct hop)? Returns the bytewise-smallest first-hop
+ * vertex (the witness `via`) or `null`.
+ *
+ * The transitive-reduction correctness rule: an edge `start ⇒ target` is
+ * redundant only if a length>=2 path exists through the OTHER edges. Crucially
+ * we EXCLUDE the edge under consideration, so removing one edge never invalidates
+ * the witness used to justify removing ANOTHER — a plain single-pass check over
+ * the full adjacency over-removes (HEAL-PROTECT-002: a tool pair backs two
+ * depends edges that would each look implied by the full graph but only survive
+ * together).
+ */
+function alternatePathExcluding(
+  others: readonly ClosureEdge[],
+  start: string,
+  target: string,
+): string | null {
+  const adj = requirementAdjacency(others);
+  return alternatePathVia(adj, start, target);
+}
+
+/** The set of node ids marked as anchor-floor members in the graph. */
+function anchorIds(graph: ClosureGraph): Set<string> {
+  const out = new Set<string>();
+  for (const n of graph.nodes) if (n.anchor === true) out.add(n.id);
+  return out;
+}
+
+/**
+ * Count how many `depends` edges pull in each prerequisite. A prerequisite with
+ * exactly one such edge has a SOLE dependency edge: removing it would drop the
+ * prerequisite from the closure entirely, so it is protected regardless of any
+ * alternate path.
+ */
+function dependsFanIn(edges: readonly ClosureEdge[]): Map<string, number> {
+  const counts = new Map<string, number>();
+  for (const e of edges) {
+    if (e.kind !== "depends") continue;
+    counts.set(e.from, (counts.get(e.from) ?? 0) + 1);
+  }
+  return counts;
+}
+
+/**
+ * Classify a NON-removable edge, or return `null` when the edge is an ordinary
+ * `depends` edge that removal is at least allowed to consider.
+ *
+ * Order matters and is deliberate: the strongest structural guarantee is
+ * reported first, so a tool-pair edge that also touches an anchor is recorded as
+ * `tool-pair` and the proof reads as the reason a reviewer would give.
+ */
+function protectedReason(
+  edge: ClosureEdge,
+  anchors: ReadonlySet<string>,
+  fanIn: ReadonlyMap<string, number>,
+): RetainReason | null {
+  if (edge.kind === "tool-pair") return "tool-pair";
+  if (edge.kind === "contradicts") return "contradiction";
+  if (anchors.has(edge.from) || anchors.has(edge.to)) return "anchor";
+  if ((fanIn.get(edge.from) ?? 0) <= 1) return "sole-dependency";
+  return null;
+}
+
+/** Input to one optimization run: the graph plus the conservative VC4C result. */
+export interface ClosureOptInput {
+  readonly graph: ClosureGraph;
+  /** The ALREADY-COMPUTED conservative closure (VC4C `closeSelection`). */
+  readonly conservative: ClosureResult;
+}
+
+/**
+ * Optimize the already-mandatory closure by transitive reduction (task 2).
+ *
+ * Only edges INSIDE the closed selection are considered: an edge touching an
+ * unselected node is not part of the traversal plan for this closure at all, so
+ * it is neither retained nor removed — it is simply out of scope and produces no
+ * proof row.
+ *
+ * `selected` is copied through UNCHANGED. That is the whole safety property: the
+ * optimizer is allowed to make the plan cheaper, never to make it smaller.
+ */
+export function optimizeClosure(input: ClosureOptInput): ClosureProofV2 {
+  const { graph, conservative } = input;
+  const selected = new Set(conservative.selected);
+  const anchors = anchorIds(graph);
+
+  // Consider only in-selection edges, in deterministic bytewise order.
+  const considered = sortedEdges(
+    graph.edges.filter((e) => selected.has(e.from) && selected.has(e.to)),
+  );
+  const fanIn = dependsFanIn(considered);
+
+  const rows: ClosureProofRow[] = [];
+  const retained: ClosureEdge[] = [];
+  const removed: ClosureEdge[] = [];
+
+  for (const e of considered) {
+    const guard = protectedReason(e, anchors, fanIn);
+    if (guard !== null) {
+      // Protected: retained unconditionally, EVEN WHEN an alternate path exists
+      // (HEAL-PROTECT-002). The reason names the guarantee, not the topology.
+      rows.push({ from: e.from, to: e.to, kind: e.kind, decision: "retained", reason: guard });
+      retained.push(e);
+      continue;
+    }
+    // Ordinary `depends` edge: removable iff the requirement it carries is
+    // already carried by a longer path `to ⇒ via ⇒ ... ⇒ from` through the OTHER
+    // edges (the edge under test is excluded so removals stay mutually valid).
+    const others = considered.filter((o) => o !== e);
+    const via = alternatePathExcluding(others, e.to, e.from);
+    if (via === null) {
+      rows.push({
+        from: e.from,
+        to: e.to,
+        kind: e.kind,
+        decision: "retained",
+        reason: "no-alternate-path",
+      });
+      retained.push(e);
+      continue;
+    }
+    rows.push({
+      from: e.from,
+      to: e.to,
+      kind: e.kind,
+      decision: "removed",
+      reason: "transitively-implied",
+      via,
+    });
+    removed.push(e);
+  }
+
+  return {
+    schema: "closure-proof-v2",
+    sessionId: graph.sessionId,
+    selected: [...conservative.selected],
+    retainedEdges: sortedEdges(retained),
+    removedEdges: sortedEdges(removed),
+    rows,
+    conservativeTraversals: considered.length,
+    optimizedTraversals: retained.length,
+  };
+}
+
+// Metrics + VC6B handoff (traversal savings, RestoreHintV1) live in the
+// delegate-shell sibling `closure-metrics.ts` to keep this core reduction
+// algorithm under the 300-line soft limit.
+export { traversalSavings, restoreHints } from "./closure-metrics.js";

package/src/vector-cortex/heal/emit.ts

@@ -0,0 +1,93 @@
+/**
+ * vector-cortex/heal/emit.ts — VC6A event reporter seam (task 5).
+ *
+ * Mirrors `../rollout/emit.ts`: a thin `safe()` wrapper around an optional
+ * injected `emit` (so unit tests stay pure — they pass `undefined` and inspect
+ * nothing), and two event names required verbatim by the sprint spec:
+ *   - `vector_cortex_closure_optimized`   — emitted when a proof is produced.
+ *   - `vector_cortex_closure_proof_rejected` — emitted when verification fails.
+ *
+ * FLAG SEMANTICS (the invariant VC5B/VC5C established). The optimizer and
+ * verifier are PURE arithmetic and run REGARDLESS of the flag. The flag gates
+ * ONLY the reporting + dashboard seam: when `MEGACOMPACT_VC6A=0` we still compute
+ * the proof (needed for byte-identical parity with the predecessor), we just do
+ * not emit the VC6A-namespaced events. This is what makes flag-off byte-identical
+ * to VC5C — the arithmetic is never skipped, only the announcement.
+ *
+ * No console, no storage, no network (PREVENT-PI-004 / PREVENT-011). Every line
+ * is a structured JSON event with `ts` + `event`.
+ */
+
+import { VC6A_ENABLED } from "../../config/vector-cortex.js";
+import type { HealEventName } from "./types.js";
+
+/** Optional emit fn injected by the runtime; tests pass `undefined`. */
+export type HealEmit = (name: string, payload: unknown) => void;
+
+/**
+ * Run `fn` only when an emit is available, swallowing and logging nothing on
+ * failure (PRACTICES: non-fatal stores). `fn` receives the emit so callers need
+ * not null-check.
+ */
+function safe(emit: HealEmit | undefined, fn: (emit: HealEmit) => void): void {
+  if (emit === undefined) return;
+  try {
+    fn(emit);
+  } catch {
+    // Non-fatal: a reporting failure must never break the agent loop.
+  }
+}
+
+/** The event names VC6A emits, exported for the dashboard seam and tests. */
+export const HEAL_EVENT_NAMES: readonly HealEventName[] = [
+  "vector_cortex_closure_optimized",
+  "vector_cortex_closure_proof_rejected",
+] as const;
+
+/**
+ * Report a successful optimization. `MEGACOMPACT_VC6A=0` suppresses the VC6A
+ * event (flag-off parity) but does not affect the computation that produced
+ * `proof`.
+ */
+export function reportClosureOptimized(
+  emit: HealEmit | undefined,
+  payload: {
+    readonly sessionId: string;
+    readonly removed: number;
+    readonly retained: number;
+    readonly savings: number;
+  },
+): void {
+  if (!VC6A_ENABLED()) return;
+  safe(emit, (e) =>
+    e("vector_cortex_closure_optimized", {
+      ts: undefined,
+      event: "vector_cortex_closure_optimized",
+      sessionId: payload.sessionId,
+      removedEdges: payload.removed,
+      retainedEdges: payload.retained,
+      traversalSavings: payload.savings,
+    }),
+  );
+}
+
+/** Report a rejected proof. Suppressed under flag-off, like the above. */
+export function reportProofRejected(
+  emit: HealEmit | undefined,
+  payload: {
+    readonly sessionId: string;
+    readonly reason: string;
+    readonly mode: "B" | "C";
+  },
+): void {
+  if (!VC6A_ENABLED()) return;
+  safe(emit, (e) =>
+    e("vector_cortex_closure_proof_rejected", {
+      ts: undefined,
+      event: "vector_cortex_closure_proof_rejected",
+      sessionId: payload.sessionId,
+      reason: payload.reason,
+      fallbackMode: payload.mode,
+    }),
+  );
+}