pi-mega-compact 0.20.8 → 0.20.9

package/src/vector-cortex/heal/restore-types.ts

@@ -0,0 +1,185 @@
+/**
+ * vector-cortex/heal/restore-types.ts — VC6B exact source restoration contract.
+ *
+ * VC6A optimized WHICH EDGES the closure plan walks. VC6B answers the next
+ * question: when the plan needs a node whose bytes are no longer in the live
+ * window, WHERE do those bytes come from? The answer is deliberately narrow —
+ * an EXACT source, or nothing.
+ *
+ * THE CARDINAL RULE. Restored bytes are ONLY ever read from an exact source:
+ *   1. an `ExactShardV1` whose range and digest both match the request, or
+ *   2. a scan of the `EventV2` occurrence ledger over the requested seq range.
+ * Bytes are NEVER inferred from an embedding, a semantic shard, a RAPTOR
+ * summary, or any other derived/lossy representation. A semantic tier can tell
+ * you what a span was ABOUT; it cannot tell you what the span WAS. Attempting to
+ * "restore" from a derived source would silently fabricate transcript history,
+ * so VC6B has no code path that can do it: `RestoreReader` exposes exactly the
+ * two exact sources and nothing else.
+ *
+ * THE VERIFICATION RULE. Every restored span must hash to the SHA-256 digest the
+ * REQUEST pinned, checked immediately before insertion. A source that matches by
+ * range but not by hash is rejected (`HEAL_RESTORE_DIGEST_MISMATCH`) — never
+ * "close enough". This is what makes a swapped shard file, a truncated read, or a
+ * corrupted ledger record fail loudly instead of poisoning the reconstruction.
+ *
+ * DIGEST PINNING (three fields exist; do not confuse them).
+ *   - `ReconstructionSpan.digest` and `ExactShardV1.digest` are SHA-256 in
+ *     LOWERCASE HEX with NO prefix.
+ *   - `EventV2.bytesDigest` is `sha256:<hex>`, WITH the prefix.
+ * `RestoreSpanRequest.digest` works at SPAN level and uses the FORMER: bare
+ * lowercase hex, matching `ExactShardV1.digest` / `ReconstructionSpan.digest`.
+ * The prefixed `EventV2.bytesDigest` is used ONLY for per-event verification
+ * inside the ledger-scan path and is never the request-level digest. Mixing the
+ * two would make every ledger restoration fail (or, worse, make a prefix-stripped
+ * comparison accidentally succeed against the wrong granularity).
+ *
+ * BOUNDS. A restore request is attacker-shaped input: it names spans and byte
+ * ranges. `RESTORE_LIMIT_SPANS` / `RESTORE_LIMIT_BYTES` bound it BEFORE any
+ * reader is consulted, so an oversized request cannot be used to make the
+ * restorer walk the whole ledger (HEAL-LIMIT-002).
+ *
+ * Pure types + registered conformance IDs: no storage, no console, no network
+ * (PREVENT-PI-004 / PREVENT-011).
+ */
+
+import type { ExactShardV1, ShardRange } from "../shards/types.js";
+import type { EventV2 } from "../ledger/types.js";
+
+/**
+ * One requested span: the node it restores, the byte/seq window that IDENTIFIES
+ * it, and the digest that AUTHENTICATES it.
+ *
+ * `range` is identity — it says which slice of the canonical stream to look for.
+ * `digest` is authentication — it says which bytes are acceptable. Both are
+ * required: identity alone would accept a shard file that was swapped in place,
+ * and a digest alone would require scanning every source.
+ */
+export interface RestoreSpanRequest {
+  /** The closure node these bytes belong to (echoed back in the result). */
+  readonly nodeId: string;
+  /** The span's identity: session + inclusive seq bounds + half-open bytes. */
+  readonly range: ShardRange;
+  /**
+   * SHA-256 of the span's original bytes, LOWERCASE HEX, NO `sha256:` prefix
+   * (matches `ExactShardV1.digest` / `ReconstructionSpan.digest`).
+   */
+  readonly digest: string;
+}
+
+/** A batch of span restorations for one session. */
+export interface RestoreRequestV1 {
+  readonly schema: "restore-request-v1";
+  readonly sessionId: string;
+  /** Requested spans, restored in this order (the result preserves it). */
+  readonly spans: readonly RestoreSpanRequest[];
+}
+
+/**
+ * One successfully restored span. `source` records WHICH exact tier answered so
+ * the triad mode can be derived and so an operator can see whether the shard
+ * index is doing its job or every read is falling through to a ledger scan.
+ */
+export interface RestoreSpanResult {
+  readonly nodeId: string;
+  /** Which exact source produced the bytes (never a derived/semantic tier). */
+  readonly source: "exact-shard" | "ledger-scan";
+  /** The EXACT original bytes, verbatim — invalid UTF-8 included, unnormalized. */
+  readonly bytes: Uint8Array;
+  /** The verified SHA-256 (bare lowercase hex) — equals the request's digest. */
+  readonly digest: string;
+}
+
+/**
+ * The restoration outcome for one request.
+ *
+ * `mode` mirrors TRIAD_RESILIENCE:
+ *   A — every span came from an indexed exact shard (the fast, normal path);
+ *   B — every span was restored, but at least one required a ledger range scan
+ *       (an INDEPENDENT code path: no shard index involved, bytes rebuilt by
+ *       concatenating verified occurrence records);
+ *   C — at least one span could not be restored from ANY exact source. Mode C
+ *       OMITS the span and DISCLOSES the loss (`semanticLossStated`) rather than
+ *       substituting derived text.
+ */
+export interface RestoreResultV1 {
+  readonly schema: "restore-result-v1";
+  readonly sessionId: string;
+  readonly mode: "A" | "B" | "C";
+  /** Restored spans in request order (only digest-verified spans appear here). */
+  readonly restored: readonly RestoreSpanResult[];
+  /** Node ids that could not be restored (identity only — never bytes). */
+  readonly missing: readonly string[];
+  /** Set in mode C: the caller MUST be told the old context is gone. */
+  readonly semanticLossStated: boolean;
+  /** Deduplicated failure codes in deterministic order. */
+  readonly codes: readonly RestoreFailureCode[];
+}
+
+/** VC6B failure codes (registered HEAL codes). */
+export type RestoreFailureCode =
+  /** The request exceeds the span-count or aggregate-byte bound. */
+  | "HEAL_RESTORE_LIMIT"
+  /** A source's bytes do not hash to the pinned digest — nothing is inserted. */
+  | "HEAL_RESTORE_DIGEST_MISMATCH"
+  /** Neither an exact shard nor the ledger covers the requested span. */
+  | "HEAL_RESTORE_SOURCE_MISSING"
+  /** A restored span does not correspond to a requested span/digest. */
+  | "HEAL_RESTORE_RANGE_MISMATCH";
+
+/**
+ * Post-restoration verdict. `verifyRestored` re-derives every digest from the
+ * bytes actually carried in the result, so a result object that was mutated
+ * after `restoreSources` returned still fails before insertion.
+ */
+export type RestoreVerification =
+  | { readonly ok: true }
+  | { readonly ok: false; readonly codes: readonly RestoreFailureCode[] };
+
+/**
+ * The ONLY sources a restoration may read. Deliberately exhaustive: there is no
+ * embedding, semantic shard, or summary field here, so "restore from a derived
+ * source" is not merely forbidden by policy — it is unrepresentable.
+ */
+export interface RestoreReader {
+  /** Indexed exact shards (mode A). */
+  readonly exactShards: readonly ExactShardV1[];
+  /** Raw occurrence records for the ledger range scan (mode B). */
+  readonly ledgerEvents: readonly EventV2[];
+}
+
+/**
+ * Maximum spans in one request. A request naming more spans than this is
+ * rejected outright — the bound exists so a single call cannot be turned into an
+ * unbounded traversal of the ledger.
+ */
+export const RESTORE_LIMIT_SPANS = 64;
+
+/**
+ * Maximum aggregate requested bytes (4 MiB), summed from the REQUEST's ranges
+ * (`byteEnd - byteStart`) so the bound is enforceable without reading anything.
+ */
+export const RESTORE_LIMIT_BYTES = 4 * 1024 * 1024;
+
+/**
+ * Registered VC6B conformance ID range (HEAL-016..030), continuing VC6A's
+ * HEAL-001..015. The acceptance test reads these rows from the v2 manifest and
+ * asserts each returns its manifest `ok`/`code`.
+ */
+export const RESTORE_IDS: readonly string[] = Array.from(
+  { length: 15 },
+  (_v, i) => `HEAL-${String(i + 16).padStart(3, "0")}`,
+);
+
+/** Named VC6B conformance assertions (the sprint's headline rows). */
+export const RESTORE_NAMED_IDS = [
+  "HEAL-SPAN-001",
+  "HEAL-LIMIT-002",
+  "HEAL-DIGEST-003",
+] as const;
+
+/** The two structured events the VC6B reporter emits. */
+export type RestoreEventName =
+  | "vector_cortex_source_restored"
+  | "vector_cortex_restore_digest_rejected";
+
+export type { EventV2, ExactShardV1, ShardRange };

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

@@ -0,0 +1,165 @@
+/**
+ * vector-cortex/heal/restore.ts — VC6B exact source restoration orchestrator.
+ *
+ * Turns a `RestoreRequestV1` into a `RestoreResultV1` by consulting, per span,
+ * the two EXACT sources in `restore-readers.ts` — an indexed exact shard first,
+ * then a ledger range scan — and inserting bytes only after they hash to the
+ * digest the request pinned.
+ *
+ * ORDER OF OPERATIONS IS THE CONTRACT.
+ *
+ *   1. BOUNDS, BEFORE ANY READER TOUCH. The span count and the aggregate
+ *      requested byte span are computed PURELY FROM THE REQUEST (`byteEnd -
+ *      byteStart`, which needs no source at all) and checked first. On breach we
+ *      return immediately, having never read `reader.exactShards` or
+ *      `reader.ledgerEvents`. This is HEAL-LIMIT-002: an oversized request must
+ *      not be able to make the restorer walk the ledger even once, so the check
+ *      cannot be "inside the loop, before the read" — it must be before the loop
+ *      exists. The acceptance corpus proves it by passing EMPTY readers with an
+ *      over-limit request: a reader-touching implementation would still return
+ *      "missing" rather than "limit".
+ *
+ *   2. EXACT SHARD, then LEDGER, then MISSING. Sources are tried strongest-first.
+ *      A digest mismatch anywhere is recorded and the span is NOT restored — the
+ *      restorer never downgrades to "closest available bytes".
+ *
+ *   3. MODE from what actually happened, not from what was attempted. A = every
+ *      span came from a shard; B = all restored, at least one via ledger scan;
+ *      C = something is missing, and mode C STATES its semantic loss rather than
+ *      hiding an incomplete restoration behind a successful-looking result.
+ *
+ * PURE. No storage, no console, no clock, no network — `node:crypto` (a Node
+ * built-in) is the only dependency beyond types (PREVENT-PI-004 / PREVENT-011).
+ * The reporter seam in `restore-emit.ts` is flag-gated; THIS arithmetic is not,
+ * so flag-off is byte-identical.
+ */
+
+import type {
+  RestoreFailureCode,
+  RestoreReader,
+  RestoreRequestV1,
+  RestoreResultV1,
+  RestoreSpanRequest,
+  RestoreSpanResult,
+} from "./restore-types.js";
+import { RESTORE_LIMIT_BYTES, RESTORE_LIMIT_SPANS } from "./restore-types.js";
+import { readExactShard, readLedgerSpan } from "./restore-readers.js";
+
+/**
+ * Fixed code ordering so a result's `codes` array is deterministic regardless of
+ * which span failed first. Deterministic output is what lets the conformance
+ * corpus pin an exact expected value.
+ */
+const CODE_ORDER: readonly RestoreFailureCode[] = [
+  "HEAL_RESTORE_LIMIT",
+  "HEAL_RESTORE_DIGEST_MISMATCH",
+  "HEAL_RESTORE_SOURCE_MISSING",
+  "HEAL_RESTORE_RANGE_MISMATCH",
+] as const;
+
+/** Deduplicate + sort codes into the fixed priority order. */
+export function orderCodes(
+  codes: readonly RestoreFailureCode[],
+): readonly RestoreFailureCode[] {
+  const seen = new Set(codes);
+  return CODE_ORDER.filter((c) => seen.has(c));
+}
+
+/**
+ * Total bytes the request ASKS for, derived from the ranges alone. Negative or
+ * inverted ranges contribute 0 rather than reducing the total — an inverted span
+ * must never be usable to smuggle a large request under the bound.
+ */
+function requestedBytes(spans: readonly RestoreSpanRequest[]): number {
+  let total = 0;
+  for (const s of spans) {
+    const len = s.range.byteEnd - s.range.byteStart;
+    total += len > 0 ? len : 0;
+  }
+  return total;
+}
+
+/** The immediate over-limit result: nothing read, everything missing. */
+function limitExceeded(request: RestoreRequestV1): RestoreResultV1 {
+  return {
+    schema: "restore-result-v1",
+    sessionId: request.sessionId,
+    mode: "C",
+    restored: [],
+    missing: request.spans.map((s) => s.nodeId),
+    semanticLossStated: true,
+    codes: ["HEAL_RESTORE_LIMIT"],
+  };
+}
+
+/**
+ * Restore the exact original bytes for every requested span.
+ *
+ * Never throws: a request naming spans no source covers yields a mode-C result
+ * that discloses the loss, not an exception (PRACTICES: non-fatal — a failed
+ * restoration must degrade the prompt, never break the agent loop).
+ */
+export function restoreSources(
+  request: RestoreRequestV1,
+  reader: RestoreReader,
+): RestoreResultV1 {
+  // (1) Bounds first — computed from the request only. `reader` is not touched
+  // on this path, which is exactly what HEAL-LIMIT-002 asserts.
+  if (
+    request.spans.length > RESTORE_LIMIT_SPANS ||
+    requestedBytes(request.spans) > RESTORE_LIMIT_BYTES
+  ) {
+    return limitExceeded(request);
+  }
+
+  const restored: RestoreSpanResult[] = [];
+  const missing: string[] = [];
+  const codes: RestoreFailureCode[] = [];
+  let usedLedger = false;
+
+  // (2) Per span, strongest source first, in request order.
+  for (const span of request.spans) {
+    const exact = readExactShard(reader.exactShards, span.range, span.digest);
+    if (exact.kind === "bytes") {
+      restored.push({
+        nodeId: span.nodeId,
+        source: "exact-shard",
+        bytes: exact.bytes,
+        digest: span.digest,
+      });
+      continue;
+    }
+    if (exact.kind === "digest-mismatch") codes.push("HEAL_RESTORE_DIGEST_MISMATCH");
+
+    const ledger = readLedgerSpan(reader.ledgerEvents, span.range, span.digest);
+    if (ledger.kind === "bytes") {
+      usedLedger = true;
+      restored.push({
+        nodeId: span.nodeId,
+        source: "ledger-scan",
+        bytes: ledger.bytes,
+        digest: span.digest,
+      });
+      continue;
+    }
+    if (ledger.kind === "digest-mismatch") codes.push("HEAL_RESTORE_DIGEST_MISMATCH");
+
+    // (3) Neither exact source answered. Identity only — never bytes.
+    missing.push(span.nodeId);
+    codes.push("HEAL_RESTORE_SOURCE_MISSING");
+  }
+
+  const complete = missing.length === 0 && restored.length === request.spans.length;
+  const mode: RestoreResultV1["mode"] = !complete ? "C" : usedLedger ? "B" : "A";
+
+  return {
+    schema: "restore-result-v1",
+    sessionId: request.sessionId,
+    mode,
+    restored,
+    missing,
+    // Mode C omits spans, so it MUST disclose that the old context is gone.
+    semanticLossStated: mode === "C",
+    codes: orderCodes(codes),
+  };
+}

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

@@ -224,3 +224,25 @@ export const HEAL_NAMED_IDS = [
 ] as const;
 
 export type { ClosureEdge, ClosureEdgeKind };
+
+// ---------------------------------------------------------------------------
+// VC6B exact source restoration (restore-types.ts). Re-exported here so the
+// heal contract has ONE entry point: `RestoreHintV1` above names the node VC6B
+// must fetch, and these types describe the fetch itself.
+// ---------------------------------------------------------------------------
+
+export type {
+  RestoreRequestV1,
+  RestoreSpanRequest,
+  RestoreResultV1,
+  RestoreSpanResult,
+  RestoreFailureCode,
+  RestoreReader,
+  RestoreVerification,
+} from "./restore-types.js";
+export {
+  RESTORE_IDS,
+  RESTORE_NAMED_IDS,
+  RESTORE_LIMIT_SPANS,
+  RESTORE_LIMIT_BYTES,
+} from "./restore-types.js";

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

@@ -0,0 +1,93 @@
+/**
+ * vector-cortex/heal/verify.ts — VC6B pre-insertion verification (task 3).
+ *
+ * `restoreSources` already hashes every span before it puts it in the result, so
+ * why hash again here?
+ *
+ * Because the result is a VALUE that travels. Between restoration and insertion
+ * it is passed across module boundaries, possibly cached, possibly assembled from
+ * more than one restore call, possibly reordered. `verifyRestored` is the gate
+ * immediately before bytes enter the reconstruction, and it re-derives its facts
+ * from scratch: it hashes the bytes the result ACTUALLY CARRIES and cross-checks
+ * them against the digest THE REQUEST asked for. A result object mutated after
+ * `restoreSources` returned — the classic "verified then swapped" injection —
+ * fails here.
+ *
+ * TWO DISTINCT INVARIANTS, TWO DISTINCT CODES.
+ *   - `HEAL_RESTORE_DIGEST_MISMATCH` — the bytes do not hash to their OWN stated
+ *     digest. The span is internally inconsistent (tampering or truncation).
+ *   - `HEAL_RESTORE_RANGE_MISMATCH` — the bytes are internally consistent but do
+ *     not answer the question that was asked: the nodeId was never requested, or
+ *     the digest disagrees with the digest the request pinned for that nodeId.
+ *     This is the "right bytes, wrong span" failure — substituting one real,
+ *     correctly-hashed span for another would otherwise pass a naive check.
+ *
+ * WHOLESALE, NOT PER-SPAN. `insertable` returns the restored spans only when the
+ * entire result verifies. Inserting the good half of a result whose other half
+ * failed verification would splice a partially-corrupt transcript into the
+ * reconstruction without the caller ever seeing a mode-C disclosure.
+ *
+ * Pure: `node:crypto` only, no storage/console/network (PREVENT-PI-004 /
+ * PREVENT-011).
+ */
+
+import type {
+  RestoreFailureCode,
+  RestoreRequestV1,
+  RestoreResultV1,
+  RestoreSpanResult,
+  RestoreVerification,
+} from "./restore-types.js";
+import { sha256Hex } from "./restore-readers.js";
+import { orderCodes } from "./restore.js";
+
+/**
+ * Re-verify every restored span against the request that asked for it.
+ *
+ * Returns `{ok:true}` only when EVERY restored span hashes to its own digest AND
+ * that digest is the one the request pinned for that node.
+ */
+export function verifyRestored(
+  result: RestoreResultV1,
+  request: RestoreRequestV1,
+): RestoreVerification {
+  const requestedDigests = new Map<string, string>();
+  for (const span of request.spans) requestedDigests.set(span.nodeId, span.digest);
+
+  const codes: RestoreFailureCode[] = [];
+
+  for (const span of result.restored) {
+    // (1) Internal consistency: do these bytes hash to the digest they claim?
+    if (sha256Hex(span.bytes) !== span.digest) {
+      codes.push("HEAL_RESTORE_DIGEST_MISMATCH");
+      // A span that fails its own digest cannot meaningfully be checked against
+      // the request's digest as well; one code per real defect keeps the verdict
+      // readable.
+      continue;
+    }
+
+    // (2) Provenance: was this node requested, and with THIS digest? An
+    // unrequested node or a digest swap is a range mismatch, not a hash failure.
+    const wanted = requestedDigests.get(span.nodeId);
+    if (wanted === undefined || wanted !== span.digest) {
+      codes.push("HEAL_RESTORE_RANGE_MISMATCH");
+    }
+  }
+
+  if (codes.length === 0) return { ok: true };
+  return { ok: false, codes: orderCodes(codes) };
+}
+
+/**
+ * The spans that may be inserted: all of them, or none.
+ *
+ * A caller should never need to decide which half of a partially-verified result
+ * is safe — that decision is the whole point of the digest contract, so it is
+ * made here, once, in the strict direction.
+ */
+export function insertable(
+  result: RestoreResultV1,
+  request: RestoreRequestV1,
+): readonly RestoreSpanResult[] {
+  return verifyRestored(result, request).ok ? result.restored : [];
+}

package/extensions/dashboard-client/dist/assets/VectorCortexTab-DTabQo6h.js

@@ -1,2 +0,0 @@
-import{j as e,B as a,r as c}from"./index-DeIky7xm.js";import{C as o,a as i,b as d,c as x}from"./card-BYbefUur.js";async function q(){const s=await fetch("/api/vector-cortex/evaluation");if(!s.ok)throw new Error(`vector-cortex evaluation: ${s.status}`);return s.json()}async function y(){const s=await fetch("/api/vector-cortex/health");if(!s.ok)throw new Error(`vector-cortex health: ${s.status}`);return s.json()}async function Q(){const s=await fetch("/api/vector-cortex/topology");if(!s.ok)throw new Error(`vector-cortex topology: ${s.status}`);return s.json()}async function W(){const s=await fetch("/api/vector-cortex/query");if(!s.ok)throw new Error(`vector-cortex query: ${s.status}`);return s.json()}async function U(){const s=await fetch("/api/vector-cortex/shards");if(!s.ok)throw new Error(`vector-cortex shards: ${s.status}`);return s.json()}async function Y(){const s=await fetch("/api/vector-cortex/reconstruct");if(!s.ok)throw new Error(`vector-cortex reconstruct: ${s.status}`);return s.json()}async function Z(){const s=await fetch("/api/vector-cortex/plans");if(!s.ok)throw new Error(`vector-cortex plans: ${s.status}`);return s.json()}async function J(){const s=await fetch("/api/vector-cortex/render");if(!s.ok)throw new Error(`vector-cortex render: ${s.status}`);return s.json()}async function K(){const s=await fetch("/api/vector-cortex/rollout");if(!s.ok)throw new Error(`vector-cortex rollout: ${s.status}`);return s.json()}async function _(){const s=await fetch("/api/vector-cortex/closure-proof");if(!s.ok)throw new Error(`vector-cortex closure-proof: ${s.status}`);return s.json()}async function X(s="default"){const r=await fetch(`/api/vector-cortex/ledger?session=${encodeURIComponent(s)}`);if(!r.ok)throw new Error(`vector-cortex ledger: ${r.status}`);return r.json()}async function ee(s){const r=await fetch("/api/vector-cortex/breakers/reset",{method:"POST",headers:{"Content-Type":"application/json"},body:JSON.stringify({subsystem:s})});if(!r.ok)throw new Error(`vector-cortex reset: ${r.status}`);return r.json()}function t({label:s,value:r}){return e.jsxs("div",{children:[e.jsx("div",{className:"text-xs text-muted-foreground",children:s}),e.jsx("div",{className:"font-mono text-sm",children:r})]})}function se({view:s}){return e.jsxs(o,{children:[e.jsx(i,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(d,{children:"Validated Prompt Renderer (VC5B)"}),s?.enabled?e.jsx(a,{variant:"success",children:"ACTIVE"}):e.jsx(a,{variant:"danger",children:"OFF"})]})}),e.jsx(x,{children:s?.enabled?e.jsxs(e.Fragment,{children:[e.jsxs("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-4",children:[e.jsx(t,{label:"Render fixtures",value:String(s.renderCount)}),e.jsx(t,{label:"Provider profiles",value:String(s.providerCount)}),e.jsx(t,{label:"Known profiles",value:String(s.knownProfiles.length)})]}),e.jsx("div",{className:"mt-3 text-xs text-muted-foreground",children:"Reader-only render conformance route — no prompt text or session payloads exposed."})]}):e.jsx("div",{className:"vc-empty",children:"Renderer disabled (VC5B off)."})})]})}function te({view:s}){return e.jsxs(o,{children:[e.jsx(i,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(d,{children:"Live Graduated Rollout (VC5C)"}),s?.enabled?e.jsx(a,{variant:"success",children:"ACTIVE"}):e.jsx(a,{variant:"danger",children:"OFF"})]})}),e.jsx(x,{children:s?.enabled?e.jsxs(e.Fragment,{children:[e.jsxs("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-4",children:[e.jsx(t,{label:"Gate",value:`${s.gatePct}%`}),e.jsx(t,{label:"Exposed buckets",value:String(s.bucketCount)}),e.jsx(t,{label:"Total buckets",value:String(s.buckets)}),e.jsx(t,{label:"Promotion",value:s.promotionBlocked?"FROZEN":"OPEN"}),e.jsx(t,{label:"Events",value:String(s.events)}),e.jsx(t,{label:"Sessions",value:String(s.sessions)})]}),e.jsx("div",{className:"mt-3 text-xs text-muted-foreground",children:"Reader-only rollout route — no session payloads or bucket→session mappings exposed."})]}):e.jsx("div",{className:"vc-empty",children:"Rollout disabled (VC5C off)."})})]})}function re({view:s}){return e.jsxs(o,{children:[e.jsx(i,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(d,{children:"Closure Optimization (VC6A)"}),s?.enabled?e.jsx(a,{variant:"success",children:"ACTIVE"}):e.jsx(a,{variant:"danger",children:"OFF"})]})}),e.jsx(x,{children:s?.enabled?e.jsxs(e.Fragment,{children:[e.jsxs("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-4",children:[e.jsx(t,{label:"Mode",value:s.mode}),e.jsx(t,{label:"Optimizations",value:String(s.optimizations)}),e.jsx(t,{label:"Proof rejections",value:String(s.proofRejections)}),e.jsx(t,{label:"Last rejection",value:s.lastRejection??"none"}),e.jsx(t,{label:"Retained edges",value:String(s.retainedEdgeTotal)}),e.jsx(t,{label:"Removed edges",value:String(s.removedEdgeTotal)}),e.jsx(t,{label:"Conservative walks",value:String(s.conservativeTraversalTotal)}),e.jsx(t,{label:"Optimized walks",value:String(s.optimizedTraversalTotal)})]}),e.jsx("div",{className:"mt-3 text-xs text-muted-foreground",children:"Reader-only closure diagnostics — aggregate counts only; per-edge proof rows, node ids, and source payloads are never exposed (SECURITY_PRIVACY)."})]}):e.jsx("div",{className:"vc-empty",children:"Closure optimization disabled (VC6A off) — conservative VC4C closure used directly (mode B)."})})]})}function ae({view:s}){return e.jsxs(o,{children:[e.jsx(i,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(d,{children:"Plan Manifests (VC5A)"}),s?.enabled?e.jsx(a,{variant:"success",children:"ACTIVE"}):e.jsx(a,{variant:"danger",children:"OFF"})]})}),e.jsx(x,{children:s?.enabled?e.jsxs(e.Fragment,{children:[e.jsxs("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-4",children:[e.jsx(t,{label:"DAG fixtures",value:String(s.dagCount)}),e.jsx(t,{label:"Plan fixtures",value:String(s.plannerCount)}),e.jsx(t,{label:"Plans exposed",value:String(s.plans.length)})]}),e.jsx("div",{className:"mt-3 text-xs text-muted-foreground",children:"Reader-only plan manifests only — no session payloads or prompt text. Per-run plan outputs are staged in-memory this sprint."})]}):e.jsx("div",{className:"vc-empty",children:"PromptDagV1 + budgeted planner disabled (VC5A off)."})})]})}function ne({topology:s,query:r}){return e.jsxs(e.Fragment,{children:[e.jsxs(o,{children:[e.jsx(i,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(d,{children:"Derived Cortex Store (VC3A)"}),s?.enabled?e.jsx(a,{variant:"success",children:"ACTIVE"}):e.jsx(a,{variant:"danger",children:"OFF"})]})}),e.jsx(x,{children:s?.enabled?e.jsxs(e.Fragment,{children:[e.jsxs("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-3",children:[e.jsx(t,{label:"Generation",value:s.generationId??"—"}),e.jsx(t,{label:"Ordinal",value:s.ordinal??"—"}),e.jsx(t,{label:"Records",value:String(s.recordCount)}),e.jsx(t,{label:"Frontier (HW)",value:s.sourceHighWater}),e.jsx(t,{label:"Root digest",value:s.rootDigest?s.rootDigest.slice(0,16):"—"}),s.nodes!==void 0&&e.jsxs(e.Fragment,{children:[e.jsx(t,{label:"Nodes",value:String(s.nodes?.length??0)}),e.jsx(t,{label:"Edges",value:String(s.edges?.length??0)}),e.jsx(t,{label:"Graph digest",value:s.generationDigest?s.generationDigest.slice(0,16):"—"})]})]}),s.nodes!==void 0&&(s.edges?.length??0)>0&&e.jsxs("div",{className:"mt-4 max-h-56 overflow-y-auto",children:[e.jsx("div",{className:"mb-1 text-xs font-medium text-muted-foreground",children:"Topology edges (VC3B)"}),e.jsxs("table",{className:"w-full text-left text-xs",children:[e.jsx("thead",{children:e.jsxs("tr",{className:"border-b border-border/50 text-muted-foreground",children:[e.jsx("th",{className:"py-1 pr-2",children:"source"}),e.jsx("th",{className:"py-1 pr-2",children:"target"}),e.jsx("th",{className:"py-1 pr-2",children:"head"}),e.jsx("th",{className:"py-1 pr-2",children:"dir"}),e.jsx("th",{className:"py-1",children:"score"})]})}),e.jsx("tbody",{children:s.edges?.map((u,m)=>e.jsxs("tr",{className:"border-b border-border/30",children:[e.jsx("td",{className:"py-1 pr-2 font-mono",children:u.source}),e.jsx("td",{className:"py-1 pr-2 font-mono",children:u.target}),e.jsx("td",{className:"py-1 pr-2 font-mono",children:u.head}),e.jsx("td",{className:"py-1 pr-2",children:u.direction}),e.jsx("td",{className:"py-1 font-mono",children:u.score})]},`${u.source}-${u.target}-${u.head}-${m}`))})]})]})]}):e.jsx("div",{className:"vc-empty",children:"Cortex store disabled (VC3A off)."})})]}),e.jsxs(o,{children:[e.jsx(i,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(d,{children:"Topology Query Diagnostics (VC3C)"}),r?.enabled?e.jsx(a,{variant:"success",children:"ACTIVE"}):e.jsx(a,{variant:"danger",children:"OFF"})]})}),e.jsx(x,{children:r?.enabled?e.jsx("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-3",children:e.jsx(t,{label:"Router version",value:String(r.routerVersion)})}):e.jsx("div",{className:"vc-empty",children:"Query diagnostics unavailable (VC3C off)."})})]})]})}function le({ledger:s}){return e.jsxs(o,{children:[e.jsx(i,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(d,{children:"Occurrence Ledger (VC1B)"}),s?.enabled?e.jsx(a,{variant:"success",children:"ACTIVE"}):e.jsx(a,{variant:"danger",children:"OFF"})]})}),e.jsx(x,{children:s?.enabled?e.jsxs(e.Fragment,{children:[e.jsxs("div",{className:"mb-3 grid grid-cols-2 gap-4 md:grid-cols-3",children:[e.jsx(t,{label:"Session",value:s.session}),e.jsx(t,{label:"High-water",value:s.highWater}),e.jsx(t,{label:"Occurrences",value:String(s.count)})]}),s.occurrences.length===0?e.jsx("div",{className:"vc-empty",children:"No occurrences recorded."}):e.jsx("div",{className:"max-h-64 overflow-y-auto",children:e.jsxs("table",{className:"w-full text-left text-xs",children:[e.jsx("thead",{children:e.jsxs("tr",{className:"border-b border-border/50 text-muted-foreground",children:[e.jsx("th",{className:"py-1 pr-2",children:"seq"}),e.jsx("th",{className:"py-1 pr-2",children:"eventId"}),e.jsx("th",{className:"py-1 pr-2",children:"kind"}),e.jsx("th",{className:"py-1 pr-2",children:"toolCall"}),e.jsx("th",{className:"py-1",children:"digest"})]})}),e.jsx("tbody",{children:s.occurrences.map(r=>e.jsxs("tr",{className:"border-b border-border/30",children:[e.jsx("td",{className:"py-1 pr-2 font-mono",children:r.seq}),e.jsx("td",{className:"py-1 pr-2 font-mono",children:r.eventId}),e.jsx("td",{className:"py-1 pr-2",children:r.kind}),e.jsx("td",{className:"py-1 pr-2 font-mono",children:r.toolCallId??"—"}),e.jsx("td",{className:"max-w-[180px] truncate font-mono text-muted-foreground",children:r.digest})]},`${r.seq}-${r.eventId}`))})]})})]}):e.jsx("div",{className:"vc-empty",children:"Ledger disabled (VC1B off)."})})]})}function v({mode:s,count:r}){return e.jsxs("div",{className:"flex items-center justify-between border-b border-border/50 py-1 text-sm",children:[e.jsxs("span",{className:"text-muted-foreground",children:["Mode ",s]}),e.jsx("span",{className:"font-mono",children:r})]})}function ie(){const[s,r]=c.useState(null),[u,m]=c.useState(null),[S,V]=c.useState(!0),[l,f]=c.useState(null),[p,b]=c.useState(null),[E,w]=c.useState(null),[R,F]=c.useState(null),[k,T]=c.useState(null),[j,$]=c.useState(null),[h,A]=c.useState(null),[P,O]=c.useState(null),[I,M]=c.useState(null),[B,D]=c.useState(null),[L,H]=c.useState(null),g=c.useCallback(()=>{q().then(r).catch(n=>m(n instanceof Error?n.message:String(n))).finally(()=>V(!1)),y().then(f).catch(()=>{}),X().then(w).catch(()=>{}),Q().then(F).catch(()=>{}),W().then(T).catch(()=>{}),U().then($).catch(()=>{}),Y().then(A).catch(()=>{}),Z().then(O).catch(()=>{}),J().then(M).catch(()=>{}),K().then(D).catch(()=>{}),_().then(H).catch(()=>{})},[]);c.useEffect(()=>{g();const n=setInterval(g,5e3);return()=>clearInterval(n)},[g]);const z=()=>{ee("provider").then(n=>(b(`Breaker "${n.subsystem}" ${n.state}; evidence retained: ${n.failures} failures / ${n.attempts} attempts`),y())).then(f).catch(n=>b(n instanceof Error?n.message:String(n)))};if(S&&!s)return e.jsx("div",{className:"vc-loading",children:"Loading vector-cortex evaluation…"});if(u&&!s)return e.jsxs("div",{className:"vc-error",children:["Error: ",u]});if(!s)return e.jsx("div",{className:"vc-empty",children:"No evaluation data available."});const C=Math.max(1,...s.histogram.cells,s.histogram.overflow);return e.jsxs("div",{className:"flex flex-col gap-4",children:[e.jsxs("div",{className:"flex items-center gap-2",children:[e.jsx("h2",{className:"text-lg font-semibold",children:"Vector Cortex Evaluation"}),s.enabled?e.jsx(a,{variant:"warning",children:"OBSERVER PENDING (A)"}):e.jsx(a,{variant:"danger",children:"MODE C (OFF)"})]}),e.jsxs("div",{className:"grid grid-cols-1 gap-4 md:grid-cols-3",children:[e.jsxs(o,{children:[e.jsx(i,{children:e.jsx(d,{children:"Samples"})}),e.jsxs(x,{children:[e.jsx("div",{className:"text-3xl font-bold",children:s.samples}),e.jsxs("div",{className:"mt-2 flex flex-col",children:[e.jsx(v,{mode:"A",count:s.byMode.A}),e.jsx(v,{mode:"B",count:s.byMode.B}),e.jsx(v,{mode:"C",count:s.byMode.C})]})]})]}),e.jsxs(o,{className:"md:col-span-2",children:[e.jsx(i,{children:e.jsx(d,{children:"Latency Histogram (ms, inclusive edges)"})}),e.jsxs(x,{children:[e.jsxs("div",{className:"flex items-end gap-2",style:{height:160},children:[s.histogram.edges.map((n,N)=>{const G=s.histogram.cells[N]/C*140;return e.jsxs("div",{className:"flex flex-1 flex-col items-center gap-1",children:[e.jsx("span",{className:"text-xs text-muted-foreground",children:s.histogram.cells[N]}),e.jsx("div",{className:"w-full rounded-t",style:{height:Math.max(2,G),background:"#6366f1"}}),e.jsxs("span",{className:"text-[10px] text-muted-foreground",children:["≤",n]})]},n)}),e.jsxs("div",{className:"flex flex-1 flex-col items-center gap-1",children:[e.jsx("span",{className:"text-xs text-muted-foreground",children:s.histogram.overflow}),e.jsx("div",{className:"w-full rounded-t",style:{height:Math.max(2,s.histogram.overflow/C*140),background:"#f87171"}}),e.jsx("span",{className:"text-[10px] text-muted-foreground",children:">250"})]})]}),e.jsxs("div",{className:"mt-1 text-xs text-muted-foreground",children:["Total: ",s.histogram.total," · Rejects: ",s.rejects.length]})]})]})]}),e.jsxs(o,{children:[e.jsx(i,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(d,{children:"Live Safety Envelope (VC0C)"}),e.jsxs("div",{className:"flex items-center gap-2",children:[l?.stateSource==="ephemeral"&&e.jsx(a,{variant:"outline",children:"EPHEMERAL (non-live)"}),e.jsx("button",{onClick:z,disabled:!l?.enabled,className:"rounded border border-border px-2 py-1 text-xs disabled:opacity-50",children:"Reset Cooldown"})]})]})}),e.jsxs(x,{children:[p&&e.jsx("div",{className:"mb-2 text-xs text-muted-foreground",children:p}),l?e.jsxs("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-4",children:[e.jsx(t,{label:"State",value:l.state}),e.jsx(t,{label:"Mode",value:l.mode}),e.jsx(t,{label:"Window",value:`${l.windowMs}ms`}),e.jsx(t,{label:"Probes",value:String(l.probeCount)}),e.jsx(t,{label:"Backoff",value:`${l.backoffDelayMs}ms`}),e.jsx(t,{label:"Failures",value:`${l.failures}/${l.attempts}`}),e.jsx(t,{label:"Frontier",value:l.stateSource==="ephemeral"?"non-live":l.frontierFrozen?"FROZEN":"LIVE"}),e.jsx(t,{label:"Spool lag",value:String(l.spoolLag)}),e.jsx(t,{label:"Encoder mode",value:l.encoderMode}),e.jsx(t,{label:"Encoder asset",value:l.encoderAssetDigest?l.encoderAssetDigest.slice(0,12):"none"})]}):e.jsx("div",{className:"vc-empty",children:"Health unavailable (VC0C off)."})]})]}),e.jsx(ne,{topology:R,query:k}),e.jsxs(o,{children:[e.jsx(i,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(d,{children:"Dual-Tier Shards (VC4A)"}),j?.enabled?e.jsx(a,{variant:"success",children:"ACTIVE"}):e.jsx(a,{variant:"danger",children:"OFF"})]})}),e.jsx(x,{children:j?.enabled?e.jsxs(e.Fragment,{children:[e.jsxs("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-4",children:[e.jsx(t,{label:"Semantic shards",value:String(j.semanticCount)}),e.jsx(t,{label:"Exact shards",value:String(j.exactCount)}),e.jsx(t,{label:"Byte total",value:String(j.byteTotal)}),e.jsx(t,{label:"Protected bytes",value:String(j.protectedByteTotal)})]}),e.jsx("div",{className:"mt-3 text-xs text-muted-foreground",children:"Reader-only count/byte aggregate; staged in-memory this sprint."})]}):e.jsx("div",{className:"vc-empty",children:"Dual-tier shards disabled (VC4A off)."})})]}),e.jsxs(o,{children:[e.jsx(i,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(d,{children:"Reconstruction Fidelity (VC4C)"}),h?.enabled?e.jsx(a,{variant:"success",children:"ACTIVE"}):e.jsx(a,{variant:"danger",children:"OFF"})]})}),e.jsx(x,{children:h?.enabled?e.jsxs(e.Fragment,{children:[e.jsxs("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-4",children:[e.jsx(t,{label:"Closure attempts",value:String(h.closureAttempts)}),e.jsx(t,{label:"Closure rejections",value:String(h.closureRejections)}),e.jsx(t,{label:"Validated",value:String(h.validatedCount)}),e.jsx(t,{label:"Invalidated",value:String(h.invalidatedCount)}),e.jsx(t,{label:"Span total",value:String(h.spanTotal)}),e.jsx(t,{label:"Byte total",value:String(h.byteTotal)})]}),e.jsx("div",{className:"mt-3 text-xs text-muted-foreground",children:"Reader-only closure/validation aggregate; staged in-memory this sprint."})]}):e.jsx("div",{className:"vc-empty",children:"Reconstruction fidelity disabled (VC4C off)."})})]}),e.jsx(ae,{view:P}),e.jsx(se,{view:I}),e.jsx(te,{view:B}),e.jsx(re,{view:L}),e.jsx(le,{ledger:E})]})}export{ie as default};
-//# sourceMappingURL=VectorCortexTab-DTabQo6h.js.map