pi-mega-compact 0.20.13 → 0.20.14

package/src/vector-cortex/provider/economics.ts

@@ -0,0 +1,289 @@
+/**
+ * vector-cortex/provider/economics.ts — VC7B cache economics (ProviderProfileV1
+ * extension).
+ *
+ * VC7A proved a render can be FROZEN and reused. VC7B answers the question that
+ * immediately follows: is reusing it actually WORTH IT? Provider prompt caching
+ * is not free — a cache WRITE typically costs MORE than an uncached token, and a
+ * cache READ costs less. So a cache is profitable only when a written prefix is
+ * read back enough times, before its TTL expires, to repay the write premium.
+ * This file is that arithmetic and nothing else.
+ *
+ * THE NET-SAVINGS MODEL. For a prefix of `cachedTokens` tokens:
+ *
+ *   baseline (no cache) = cachedTokens * basePrice * (writes + hits)
+ *   actual (cached)     = cachedTokens * (writePrice * writes + readPrice * hits)
+ *   netSavings          = baseline - actual
+ *
+ * A NEGATIVE `netSavings` is a real, expected, and important outcome: it means
+ * the cache LOST money (a prefix written once and never re-read always does, by
+ * exactly the write premium). We report it rather than clamping it at zero,
+ * because a floor at zero would make every rollout look free and would hide the
+ * single failure mode this sprint exists to detect.
+ *
+ * EXACT ARITHMETIC, NO FLOATS IN THE MONEY PATH. Prices are integer
+ * MICRO-UNITS per token (1e-6 of the provider's currency unit), never floating
+ * point. `0.1 + 0.2 !== 0.3` is not an acceptable property for a cost ledger, and
+ * accumulating float error across millions of tokens produces aggregates that
+ * silently disagree with the provider's own bill. All money is integer; only the
+ * derived RATIO is a float, and it is finite-guarded.
+ *
+ * EVERY EXCLUSION NEEDS A FIXTURE (the sprint's headline safety rule). A provider
+ * profile may declare that some request field does not affect cache identity —
+ * but an UNPROVEN exclusion is how you get silent cache poisoning: the renderer
+ * folds a field the provider actually keys on, two different requests collapse to
+ * one cache entry, and one conversation is served another's prefix. So an
+ * exclusion without a `fixtureId` (or with a blank one) is REJECTED here —
+ * `ECON_EXCLUSION_UNPROVEN` — rather than trusted. There is no override.
+ *
+ * ESTIMATE VS MEASURED. Every result is labeled. Only telemetry from a
+ * RANDOMIZED live assignment may be called `measured` and fed into a causal
+ * interval; shadow or non-randomized numbers are `estimate` and are excluded
+ * from causal aggregates (see `experiments.ts`). Mixing the two would let a
+ * self-selected population masquerade as a controlled experiment.
+ *
+ * PURE. No clock, no storage, no console, no network (PREVENT-PI-004 /
+ * PREVENT-011). Runs identically with `MEGACOMPACT_VC7B` on or off — the flag
+ * gates only the reporter/dashboard seam in `../cache/economics-emit.ts`.
+ */
+
+import type { ProviderProfileExclusion, ProviderProfileV1 } from "./types.js";
+
+/**
+ * Cache economics attached to a provider profile.
+ *
+ * Prices are integer MICRO-UNITS PER TOKEN (1e-6 currency units), so a provider
+ * charging $3.00 per million input tokens has `basePrice: 3`. Integers keep the
+ * money path exact; see the file header for why floats are refused.
+ */
+export interface ProviderEconomicsV1 {
+  readonly schema: "provider-economics-v1";
+  /** The `ProviderProfileV1.id` these economics belong to. */
+  readonly profileId: string;
+  /** Profile version — economics are versioned WITH the profile they price. */
+  readonly profileVersion: string;
+  /** Uncached price per token, integer micro-units. The savings baseline. */
+  readonly basePrice: number;
+  /** Cache-READ price per token, integer micro-units. Normally < basePrice. */
+  readonly readPrice: number;
+  /** Cache-WRITE price per token, integer micro-units. Normally > basePrice. */
+  readonly writePrice: number;
+  /** Cache entry lifetime in ms. A prefix older than this cannot be read back. */
+  readonly ttlMs: number;
+  /** Minimum cacheable prefix in tokens; a shorter prefix is never cached. */
+  readonly minPrefix: number;
+  /**
+   * Conformance fixture ID proving this profile's exclusion set is safe, or
+   * `null` when the profile declares NO exclusions (nothing to prove). A profile
+   * WITH exclusions and a null/blank id is rejected — see `validateEconomics`.
+   */
+  readonly exclusionFixtureId: string | null;
+}
+
+/** Observed (or shadow) cache traffic for one economics computation. */
+export interface CacheUsageV1 {
+  /** Tokens in the cached prefix. Must be a non-negative safe integer. */
+  readonly cachedTokens: number;
+  /** Number of cache WRITES (each pays the write premium). */
+  readonly writeCount: number;
+  /** Number of cache HITS (each pays the discounted read price). */
+  readonly hitCount: number;
+}
+
+/**
+ * Whether a figure may be used as causal evidence.
+ *
+ *   `measured` — from a RANDOMIZED live assignment; admissible in causal
+ *                intervals.
+ *   `estimate` — shadow, projected, or non-randomized; reportable but NEVER
+ *                admissible in a causal interval.
+ */
+export type EconomicsEvidence = "measured" | "estimate";
+
+/** VC7B economics failure codes. */
+export type EconomicsFailureCode =
+  /** A profile declares exclusions but names no proving fixture. */
+  | "ECON_EXCLUSION_UNPROVEN"
+  /** A price / TTL / prefix is negative, fractional, or not finite. */
+  | "ECON_PRICE_INVALID"
+  /** A usage count is negative, fractional, or not finite. */
+  | "ECON_USAGE_INVALID"
+  /** The computed result overflowed the exact-integer safe range. */
+  | "ECON_OVERFLOW";
+
+/** The computed economics of a cache decision. All money in micro-units. */
+export interface EconomicsResultV1 {
+  readonly profileId: string;
+  /** What the same traffic would have cost with no cache at all. */
+  readonly baselineCost: number;
+  /** What it actually cost: write premium on writes, discount on hits. */
+  readonly actualCost: number;
+  /** `baselineCost - actualCost`. NEGATIVE means the cache lost money. */
+  readonly netSavings: number;
+  /** Tokens billed at the discounted read price (the cache's token benefit). */
+  readonly tokenSavings: number;
+  /** `netSavings / baselineCost`, or 0 when the baseline is 0. Always finite. */
+  readonly savingsRatio: number;
+  /** Hits needed to break even on one write, or null when never profitable. */
+  readonly breakEvenHits: number | null;
+  /** Whether this figure may enter a causal interval. */
+  readonly evidence: EconomicsEvidence;
+}
+
+/** The verdict of an economics computation. */
+export type EconomicsResult =
+  | { readonly ok: true; readonly result: EconomicsResultV1 }
+  | { readonly ok: false; readonly codes: readonly EconomicsFailureCode[] };
+
+/** A non-negative safe integer — the only shape money and counts may take. */
+function isCount(n: number): boolean {
+  return Number.isSafeInteger(n) && n >= 0;
+}
+
+/**
+ * Validate a profile's economics, enforcing the exclusion-proof rule.
+ *
+ * An exclusion claims "this field cannot affect provider cache identity". That
+ * claim is only as good as the fixture that proves it, so a profile carrying
+ * exclusions MUST name a `exclusionFixtureId`, and every individual exclusion
+ * must carry its own `fixtureId` too (VC5B already models that field; VC7B makes
+ * a blank one fatal instead of decorative). Returns deduplicated codes in a
+ * deterministic order.
+ */
+export function validateEconomics(
+  econ: ProviderEconomicsV1,
+  exclusions: readonly ProviderProfileExclusion[],
+): readonly EconomicsFailureCode[] {
+  const codes = new Set<EconomicsFailureCode>();
+
+  for (const n of [econ.basePrice, econ.readPrice, econ.writePrice, econ.ttlMs, econ.minPrefix]) {
+    if (!isCount(n)) codes.add("ECON_PRICE_INVALID");
+  }
+
+  // The headline rule: exclusions without a proving fixture are never trusted.
+  if (exclusions.length > 0) {
+    const id = econ.exclusionFixtureId;
+    if (id === null || id.trim() === "") codes.add("ECON_EXCLUSION_UNPROVEN");
+    for (const ex of exclusions) {
+      if (ex.fixtureId.trim() === "") codes.add("ECON_EXCLUSION_UNPROVEN");
+    }
+  }
+
+  const order: EconomicsFailureCode[] = ["ECON_EXCLUSION_UNPROVEN", "ECON_PRICE_INVALID"];
+  return order.filter((c) => codes.has(c));
+}
+
+/**
+ * Validate a profile + its economics together. Convenience over
+ * `validateEconomics` for callers holding a whole `ProviderProfileV1`: the
+ * exclusion list is read from the profile itself, so the two can never disagree.
+ */
+export function validateProfileEconomics(
+  profile: ProviderProfileV1,
+  econ: ProviderEconomicsV1,
+): readonly EconomicsFailureCode[] {
+  return validateEconomics(econ, profile.excludedJsonPointers);
+}
+
+/**
+ * Hits required for ONE write to break even.
+ *
+ * One write costs `(writePrice - basePrice)` extra per token; each subsequent
+ * hit saves `(basePrice - readPrice)` per token. So break-even is the ceiling of
+ * premium/discount. Returns `null` when the cache can NEVER pay for itself
+ * (a read that costs at least as much as an uncached token) — reporting a huge
+ * number there would imply "just get more hits", which is false.
+ * Returns 0 when writing is already free or cheaper than not caching.
+ */
+export function breakEvenHits(econ: ProviderEconomicsV1): number | null {
+  const premium = econ.writePrice - econ.basePrice;
+  const discount = econ.basePrice - econ.readPrice;
+  if (premium <= 0) return 0;
+  if (discount <= 0) return null;
+  return Math.ceil(premium / discount);
+}
+
+/**
+ * Compute net cache savings for observed (or shadow) usage.
+ *
+ * Pure integer arithmetic in micro-units. The only float is `savingsRatio`, and
+ * it is zero-guarded so a zero baseline yields 0 rather than NaN/Infinity — the
+ * sprint invariant is that every reported aggregate is FINITE.
+ *
+ * `evidence` is supplied by the caller and simply carried through: this function
+ * cannot know whether its inputs came from a randomized arm, and guessing would
+ * be exactly the mislabeling the causal rules forbid.
+ */
+export function computeEconomics(
+  econ: ProviderEconomicsV1,
+  usage: CacheUsageV1,
+  evidence: EconomicsEvidence,
+): EconomicsResult {
+  const codes: EconomicsFailureCode[] = [];
+  for (const n of [econ.basePrice, econ.readPrice, econ.writePrice, econ.ttlMs, econ.minPrefix]) {
+    if (!isCount(n)) {
+      codes.push("ECON_PRICE_INVALID");
+      break;
+    }
+  }
+  for (const n of [usage.cachedTokens, usage.writeCount, usage.hitCount]) {
+    if (!isCount(n)) {
+      codes.push("ECON_USAGE_INVALID");
+      break;
+    }
+  }
+  if (codes.length > 0) return { ok: false, codes };
+
+  const { cachedTokens, writeCount, hitCount } = usage;
+  const baselineCost = cachedTokens * econ.basePrice * (writeCount + hitCount);
+  const actualCost = cachedTokens * (econ.writePrice * writeCount + econ.readPrice * hitCount);
+
+  // Exactness is the whole point of the integer model: if any product leaves the
+  // safe-integer range the result is silently wrong, so we fail instead.
+  if (!Number.isSafeInteger(baselineCost) || !Number.isSafeInteger(actualCost)) {
+    return { ok: false, codes: ["ECON_OVERFLOW"] };
+  }
+
+  const netSavings = baselineCost - actualCost;
+  // Tokens served at the discounted read price — the cache's token-level benefit,
+  // independent of price (a hit re-reads the whole prefix).
+  const tokenSavings = cachedTokens * hitCount;
+  const savingsRatio = baselineCost === 0 ? 0 : netSavings / baselineCost;
+
+  return {
+    ok: true,
+    result: {
+      profileId: econ.profileId,
+      baselineCost,
+      actualCost,
+      netSavings,
+      tokenSavings,
+      savingsRatio,
+      breakEvenHits: breakEvenHits(econ),
+      evidence,
+    },
+  };
+}
+
+/**
+ * Whether a prefix is eligible to be cached at all: it must meet the profile's
+ * minimum prefix, and it must still be within TTL. A prefix below `minPrefix` is
+ * not "a small win", it is not cacheable by the provider at all.
+ */
+export function isCacheEligible(
+  econ: ProviderEconomicsV1,
+  prefixTokens: number,
+  ageMs: number,
+): boolean {
+  if (!isCount(prefixTokens) || !isCount(ageMs)) return false;
+  return prefixTokens >= econ.minPrefix && ageMs < econ.ttlMs;
+}
+
+// Conformance ID ranges + named rows extracted to economics-ids.ts to keep this
+// file under the 300-line soft limit (soft-as-hard gate). Re-exported here so no
+// consumer import path changes.
+export {
+  CACHE_IDS,
+  ECONOMICS_PROVIDER_IDS,
+  ECONOMICS_NAMED_IDS,
+} from "./economics-ids.js";

package/src/vector-cortex/provider/experiments.ts

@@ -0,0 +1,248 @@
+/**
+ * vector-cortex/provider/experiments.ts — VC7B session-level cache experiments.
+ *
+ * To claim a cache strategy CAUSED a saving you need a randomized comparison,
+ * not a before/after. This file assigns each session to an experiment arm and
+ * guarantees the two properties that make the resulting telemetry admissible as
+ * causal evidence.
+ *
+ * 1. STABLE, JOURNAL-FREE ASSIGNMENT. The arm is a pure function of
+ *    `sha256(experimentId, sessionId)` — NOT a random draw recorded in a
+ *    journal. So the assignment survives anything: process restart, a lost or
+ *    corrupted journal, a different host, a replay months later. This is the
+ *    sprint's unique failure-injection case (lose the journal after the first
+ *    event, restart, and the same arm must come back), and a hash-derived arm
+ *    passes it by construction rather than by careful recovery code. A journal
+ *    can still be kept as an audit trail, but nothing DEPENDS on it.
+ *
+ *    The corollary matters just as much: every event in one session shares one
+ *    arm (CACHE-RANDOM-003). If a session could drift between arms mid-flight,
+ *    its rows would appear in both arms of the comparison and the contrast would
+ *    be measuring nothing.
+ *
+ * 2. RANDOMIZED ⇒ CAUSAL; EVERYTHING ELSE ⇒ ESTIMATE. Hashing a session id is
+ *    randomization only when the id itself is unpredictable and every session is
+ *    eligible. A FORCED arm (operator override), a SHADOW arm (computed but not
+ *    served), and a non-randomized rollout are all labeled `estimate` and are
+ *    excluded from causal intervals by `isCausallyAdmissible`. Shadow numbers are
+ *    genuinely useful — they are just not evidence of an effect.
+ *
+ * WHY 10_000 BUCKETS. Bucket granularity bounds how finely traffic can be split;
+ * 10k gives 0.01% resolution, matching VC5C's rollout bucketing so the two
+ * subsystems partition traffic on the same scale rather than on quietly
+ * different ones.
+ *
+ * PURE. No clock, no storage, no console, no network (PREVENT-PI-004 /
+ * PREVENT-011). `assignedAt` is an INJECTED timestamp, never `Date.now()` read
+ * here, so assignment is fully reproducible in tests and replays. Runs
+ * identically with `MEGACOMPACT_VC7B` on or off.
+ */
+
+import { createHash } from "node:crypto";
+
+/**
+ * Experiment arms.
+ *
+ *   A — control: the predecessor path, no VC7B crystal compiler.
+ *   B — treatment: provider-safe compiled crystal boundaries.
+ *   C — holdout: cache bypassed entirely, the uncached baseline that prices what
+ *       the cache is being compared AGAINST.
+ */
+export type ExperimentArm = "A" | "B" | "C";
+
+/** The registered arms, in canonical bucket order. */
+export const EXPERIMENT_ARMS: readonly ExperimentArm[] = ["A", "B", "C"] as const;
+
+/** Bucket space: 10k buckets = 0.01% resolution (matches VC5C rollout). */
+export const EXPERIMENT_BUCKETS = 10_000;
+
+/**
+ * How a session came to be in its arm. Only `randomized` is causal evidence.
+ *
+ *   `randomized` — derived from the stable hash over every eligible session.
+ *   `forced`     — an operator/test override; self-selected, never causal.
+ *   `shadow`     — computed for comparison but not served; never causal.
+ */
+export type AssignmentSource = "randomized" | "forced" | "shadow";
+
+/** A session's experiment assignment (VC7B contract type). */
+export interface CacheExperimentV1 {
+  readonly schema: "cache-experiment-v1";
+  /** Names the experiment; folded into the hash so arms differ per experiment. */
+  readonly experimentId: string;
+  /** The session this assignment belongs to. */
+  readonly sessionId: string;
+  /** The assigned arm. */
+  readonly arm: ExperimentArm;
+  /** The session's stable bucket in `[0, EXPERIMENT_BUCKETS)`. */
+  readonly bucket: number;
+  /** How the arm was chosen — gates causal admissibility. */
+  readonly source: AssignmentSource;
+  /** INJECTED assignment timestamp (epoch ms). Never read from a clock here. */
+  readonly assignedAt: number;
+}
+
+/** VC7B experiment failure codes. */
+export type ExperimentFailureCode =
+  /** A blank experiment id or session id — an unnamed experiment is unanalyzable. */
+  | "EXP_ID_INVALID"
+  /** An arm split that does not sum to the full bucket space. */
+  | "EXP_SPLIT_INVALID"
+  /** A forced arm that is not one of the registered arms. */
+  | "EXP_ARM_UNKNOWN";
+
+/** The verdict of an assignment. */
+export type ExperimentResult =
+  | { readonly ok: true; readonly assignment: CacheExperimentV1 }
+  | { readonly ok: false; readonly codes: readonly ExperimentFailureCode[] };
+
+/**
+ * Traffic split across arms, in buckets. Must sum to exactly
+ * `EXPERIMENT_BUCKETS`: a split that sums to less would leave sessions
+ * unassigned, and one that sums to more would make the last arm unreachable —
+ * both silently bias the comparison, so both are rejected.
+ */
+export interface ExperimentSplit {
+  readonly A: number;
+  readonly B: number;
+  readonly C: number;
+}
+
+/** Even three-way split (the default): 3334 / 3333 / 3333 = 10000. */
+export const EVEN_SPLIT: ExperimentSplit = { A: 3334, B: 3333, C: 3333 };
+
+/**
+ * Length-prefixed field framing, identical in spirit to the crystal key encoder:
+ * `<byteLength>:<value>` makes the concatenation injective, so experiment
+ * `"a"` + session `"b:c"` cannot collide with experiment `"a:b"` + session `"c"`.
+ * Without it, two different (experiment, session) pairs could share a bucket and
+ * a session could appear to switch arms when an experiment is renamed.
+ */
+function field(value: string): string {
+  return `${Buffer.byteLength(value, "utf8")}:${value}`;
+}
+
+/**
+ * The stable bucket for a session: the low 32 bits of
+ * `sha256(experimentId, sessionId)`, modulo the bucket space.
+ *
+ * Deterministic and storage-free — this is what makes a lost assignment journal
+ * a non-event. Reading 4 bytes (rather than the whole digest) keeps the value in
+ * exact integer range; SHA-256's avalanche means any 32 bits are equidistributed.
+ */
+export function experimentBucket(experimentId: string, sessionId: string): number {
+  const h = createHash("sha256")
+    .update(field(experimentId) + field(sessionId), "utf8")
+    .digest();
+  return h.readUInt32BE(0) % EXPERIMENT_BUCKETS;
+}
+
+/** Validate that a split covers the bucket space exactly once. */
+export function validateSplit(split: ExperimentSplit): boolean {
+  for (const n of [split.A, split.B, split.C]) {
+    if (!Number.isSafeInteger(n) || n < 0) return false;
+  }
+  return split.A + split.B + split.C === EXPERIMENT_BUCKETS;
+}
+
+/**
+ * Map a bucket to an arm under a split. Arms occupy contiguous bucket ranges in
+ * the fixed order A, B, C, so the mapping is stable: widening arm C's share can
+ * never reshuffle a session already sitting in arm A.
+ */
+export function armForBucket(bucket: number, split: ExperimentSplit): ExperimentArm {
+  if (bucket < split.A) return "A";
+  if (bucket < split.A + split.B) return "B";
+  return "C";
+}
+
+/**
+ * Assign a session to an experiment arm.
+ *
+ * The default path is `randomized`: bucket = stable hash, arm = bucket's range.
+ * Passing `forced` overrides the arm and downgrades the source (and therefore
+ * causal admissibility) — the bucket is still computed and reported so the
+ * override remains auditable against what the session WOULD have got.
+ *
+ * `assignedAt` is injected by the caller. Assignment is a pure function of its
+ * arguments, so the same session always yields the same arm no matter when, or
+ * how many times, it is asked.
+ */
+export function assignExperiment(input: {
+  readonly experimentId: string;
+  readonly sessionId: string;
+  readonly assignedAt: number;
+  readonly split?: ExperimentSplit;
+  readonly forced?: ExperimentArm;
+  readonly shadow?: boolean;
+}): ExperimentResult {
+  const codes: ExperimentFailureCode[] = [];
+  if (input.experimentId.trim() === "" || input.sessionId.trim() === "") {
+    codes.push("EXP_ID_INVALID");
+  }
+  const split = input.split ?? EVEN_SPLIT;
+  if (!validateSplit(split)) codes.push("EXP_SPLIT_INVALID");
+  if (input.forced !== undefined && !EXPERIMENT_ARMS.includes(input.forced)) {
+    codes.push("EXP_ARM_UNKNOWN");
+  }
+  if (codes.length > 0) return { ok: false, codes };
+
+  const bucket = experimentBucket(input.experimentId, input.sessionId);
+  const natural = armForBucket(bucket, split);
+  const arm = input.forced ?? natural;
+  // Precedence: a forced arm is self-selected, so it is never causal even when
+  // it happens to agree with the natural arm. Shadow is likewise non-causal.
+  const source: AssignmentSource =
+    input.forced !== undefined ? "forced" : input.shadow === true ? "shadow" : "randomized";
+
+  return {
+    ok: true,
+    assignment: {
+      schema: "cache-experiment-v1",
+      experimentId: input.experimentId,
+      sessionId: input.sessionId,
+      arm,
+      bucket,
+      source,
+      assignedAt: input.assignedAt,
+    },
+  };
+}
+
+/**
+ * Whether an assignment's telemetry may enter a causal interval.
+ *
+ * ONLY `randomized`. This single predicate is what keeps forced and shadow rows
+ * out of the causal aggregate; every consumer computing an interval must filter
+ * through it rather than re-deriving the rule.
+ */
+export function isCausallyAdmissible(a: CacheExperimentV1): boolean {
+  return a.source === "randomized";
+}
+
+/**
+ * Keep only causally admissible assignments. The complement is not discarded by
+ * the caller — it is reported as `estimate` — but it never reaches an interval.
+ */
+export function causalOnly(
+  assignments: readonly CacheExperimentV1[],
+): readonly CacheExperimentV1[] {
+  return assignments.filter(isCausallyAdmissible);
+}
+
+/**
+ * Whether every assignment for one session agrees on the arm (CACHE-RANDOM-003).
+ * A session that appears in two arms would contaminate both sides of the
+ * comparison, so this is asserted directly rather than assumed.
+ */
+export function sessionArmsConsistent(
+  assignments: readonly CacheExperimentV1[],
+): boolean {
+  const bySession = new Map<string, ExperimentArm>();
+  for (const a of assignments) {
+    const seen = bySession.get(a.sessionId);
+    if (seen !== undefined && seen !== a.arm) return false;
+    bySession.set(a.sessionId, a.arm);
+  }
+  return true;
+}

package/extensions/dashboard-client/dist/assets/VectorCortexTab-94fqVjat.js

@@ -1,2 +0,0 @@
-import{j as e,B as r,r as n}from"./index-Do749WlW.js";import{C as o,a as d,b as i,c as x}from"./card-BFLnQJEo.js";async function K(){const s=await fetch("/api/vector-cortex/evaluation");if(!s.ok)throw new Error(`vector-cortex evaluation: ${s.status}`);return s.json()}async function C(){const s=await fetch("/api/vector-cortex/health");if(!s.ok)throw new Error(`vector-cortex health: ${s.status}`);return s.json()}async function Z(){const s=await fetch("/api/vector-cortex/topology");if(!s.ok)throw new Error(`vector-cortex topology: ${s.status}`);return s.json()}async function J(){const s=await fetch("/api/vector-cortex/query");if(!s.ok)throw new Error(`vector-cortex query: ${s.status}`);return s.json()}async function X(){const s=await fetch("/api/vector-cortex/shards");if(!s.ok)throw new Error(`vector-cortex shards: ${s.status}`);return s.json()}async function ee(){const s=await fetch("/api/vector-cortex/reconstruct");if(!s.ok)throw new Error(`vector-cortex reconstruct: ${s.status}`);return s.json()}async function se(){const s=await fetch("/api/vector-cortex/plans");if(!s.ok)throw new Error(`vector-cortex plans: ${s.status}`);return s.json()}async function te(){const s=await fetch("/api/vector-cortex/render");if(!s.ok)throw new Error(`vector-cortex render: ${s.status}`);return s.json()}async function re(){const s=await fetch("/api/vector-cortex/rollout");if(!s.ok)throw new Error(`vector-cortex rollout: ${s.status}`);return s.json()}async function ae(){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 ne(){const s=await fetch("/api/vector-cortex/restore");if(!s.ok)throw new Error(`vector-cortex restore: ${s.status}`);return s.json()}async function le(){const s=await fetch("/api/vector-cortex/repair");if(!s.ok)throw new Error(`vector-cortex repair: ${s.status}`);return s.json()}async function ce(s="default"){const a=await fetch(`/api/vector-cortex/ledger?session=${encodeURIComponent(s)}`);if(!a.ok)throw new Error(`vector-cortex ledger: ${a.status}`);return a.json()}async function oe(s){const a=await fetch("/api/vector-cortex/breakers/reset",{method:"POST",headers:{"Content-Type":"application/json"},body:JSON.stringify({subsystem:s})});if(!a.ok)throw new Error(`vector-cortex reset: ${a.status}`);return a.json()}async function de(){const s=await fetch("/api/vector-cortex/cache-crystals");if(!s.ok)throw new Error(`vector-cortex cache-crystals: ${s.status}`);return s.json()}function t({label:s,value:a}){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:a})]})}function ie({view:s}){return e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Validated Prompt Renderer (VC5B)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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 xe({view:s}){return e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Live Graduated Rollout (VC5C)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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 ue({view:s}){return e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Closure Optimization (VC6A)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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 he({view:s}){return e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Exact Source Restoration (VC6B)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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:"Restore attempts",value:String(s.restoreAttempts)}),e.jsx(t,{label:"Restored",value:String(s.restoredCount)}),e.jsx(t,{label:"Missing source",value:String(s.missingCount)}),e.jsx(t,{label:"Digest rejections",value:String(s.digestRejections)}),e.jsx(t,{label:"Last rejection",value:s.lastRejection??"none"}),e.jsx(t,{label:"Updated",value:s.updatedAt})]}),e.jsx("div",{className:"mt-3 text-xs text-muted-foreground",children:"Reader-only restore diagnostics — counts and HEAL_RESTORE_* codes only. There is no payload endpoint: restored bytes, span ids, node ids, and ledger text are never exposed (SECURITY_PRIVACY)."})]}):e.jsx("div",{className:"vc-empty",children:"Exact source restoration disabled (VC6B off) — no exact source is restored; omitted context is disclosed as loss (mode C)."})})]})}function je({view:s}){return e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Self-Healing Derived State (VC6C)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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:"Repair attempts",value:String(s.repairAttempts)}),e.jsx(t,{label:"Repairs planned",value:String(s.repairsPlanned)}),e.jsx(t,{label:"Pointers switched",value:String(s.pointersSwitched)}),e.jsx(t,{label:"Backoffs",value:String(s.backoffs)}),e.jsx(t,{label:"Last backoff",value:s.lastBackoffMs===null?"none":`${s.lastBackoffMs}ms`}),e.jsx(t,{label:"Last failure",value:s.lastFailure??"none"}),e.jsx(t,{label:"Updated",value:s.updatedAt})]}),e.jsx("div",{className:"mt-3 text-xs text-muted-foreground",children:"Reader-only repair diagnostics — counts and HEAL_REPAIR_* codes only. There is no payload endpoint: subsystem source bytes, gap ranges, high-water marks, root digests, and ledger text are never exposed (SECURITY_PRIVACY)."})]}):e.jsx("div",{className:"vc-empty",children:"Self-healing derived state disabled (VC6C off) — no controller detects gaps or rebuilds derived state; derived state is reported disabled rather than healed (mode C)."})})]})}function me({view:s}){return e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Frozen Range Crystals (VC7A)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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:"Crystals",value:String(s.crystalCount)}),e.jsx(t,{label:"Frozen bytes",value:String(s.totalBytes)}),e.jsx(t,{label:"Hits",value:String(s.hits)}),e.jsx(t,{label:"Misses",value:String(s.misses)}),e.jsx(t,{label:"Hit bytes",value:String(s.hitBytes)}),e.jsx(t,{label:"Writes",value:String(s.writes)}),e.jsx(t,{label:"Duplicate writes",value:String(s.duplicateWrites)}),e.jsx(t,{label:"Collisions",value:String(s.collisions)}),e.jsx(t,{label:"Last failure",value:s.lastFailure??"none"}),e.jsx(t,{label:"Updated",value:s.updatedAt})]}),e.jsx("div",{className:"mt-3 text-xs text-muted-foreground",children:"Reader-only crystal diagnostics — counts, byte volumes, and CRY_* codes only. A crystal is a frozen rendered prompt, so frozen bytes, covered ranges, span/covered digests, request digests, and session ids are never exposed (SECURITY_PRIVACY). Keys exclude the global ledger frontier, so an unrelated append does not invalidate a crystal; a covered-byte, dependency, renderer, or profile change does. Collisions mean two renders of one identity disagreed — the stored crystal is never overwritten."})]}):e.jsx("div",{className:"vc-empty",children:"Frozen range crystals disabled (VC7A off) — nothing is served from the crystal cache and every render is produced fresh; the cache is reported bypassed rather than hit (mode C)."})})]})}function ge({view:s}){return e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Dual-Tier Shards (VC4A)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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:"Semantic shards",value:String(s.semanticCount)}),e.jsx(t,{label:"Exact shards",value:String(s.exactCount)}),e.jsx(t,{label:"Byte total",value:String(s.byteTotal)}),e.jsx(t,{label:"Protected bytes",value:String(s.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)."})})]})}function fe({view:s}){return e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Reconstruction Fidelity (VC4C)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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:"Closure attempts",value:String(s.closureAttempts)}),e.jsx(t,{label:"Closure rejections",value:String(s.closureRejections)}),e.jsx(t,{label:"Validated",value:String(s.validatedCount)}),e.jsx(t,{label:"Invalidated",value:String(s.invalidatedCount)}),e.jsx(t,{label:"Span total",value:String(s.spanTotal)}),e.jsx(t,{label:"Byte total",value:String(s.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)."})})]})}function ve({view:s}){return e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Plan Manifests (VC5A)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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 pe({topology:s,query:a}){return e.jsxs(e.Fragment,{children:[e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Derived Cortex Store (VC3A)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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,h)=>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}-${h}`))})]})]})]}):e.jsx("div",{className:"vc-empty",children:"Cortex store disabled (VC3A off)."})})]}),e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Topology Query Diagnostics (VC3C)"}),a?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{variant:"danger",children:"OFF"})]})}),e.jsx(x,{children:a?.enabled?e.jsx("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-3",children:e.jsx(t,{label:"Router version",value:String(a.routerVersion)})}):e.jsx("div",{className:"vc-empty",children:"Query diagnostics unavailable (VC3C off)."})})]})]})}function be({ledger:s}){return e.jsxs(o,{children:[e.jsx(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Occurrence Ledger (VC1B)"}),s?.enabled?e.jsx(r,{variant:"success",children:"ACTIVE"}):e.jsx(r,{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(a=>e.jsxs("tr",{className:"border-b border-border/30",children:[e.jsx("td",{className:"py-1 pr-2 font-mono",children:a.seq}),e.jsx("td",{className:"py-1 pr-2 font-mono",children:a.eventId}),e.jsx("td",{className:"py-1 pr-2",children:a.kind}),e.jsx("td",{className:"py-1 pr-2 font-mono",children:a.toolCallId??"—"}),e.jsx("td",{className:"max-w-[180px] truncate font-mono text-muted-foreground",children:a.digest})]},`${a.seq}-${a.eventId}`))})]})})]}):e.jsx("div",{className:"vc-empty",children:"Ledger disabled (VC1B off)."})})]})}function m({mode:s,count:a}){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:a})]})}function Ne(){const[s,a]=n.useState(null),[u,h]=n.useState(null),[y,N]=n.useState(!0),[c,g]=n.useState(null),[f,v]=n.useState(null),[S,V]=n.useState(null),[R,E]=n.useState(null),[F,A]=n.useState(null),[k,T]=n.useState(null),[I,$]=n.useState(null),[w,P]=n.useState(null),[O,M]=n.useState(null),[B,L]=n.useState(null),[D,H]=n.useState(null),[z,Y]=n.useState(null),[_,U]=n.useState(null),[G,W]=n.useState(null),j=n.useCallback(()=>{K().then(a).catch(l=>h(l instanceof Error?l.message:String(l))).finally(()=>N(!1)),C().then(g).catch(()=>{}),ce().then(V).catch(()=>{}),Z().then(E).catch(()=>{}),J().then(A).catch(()=>{}),X().then(T).catch(()=>{}),ee().then($).catch(()=>{}),se().then(P).catch(()=>{}),te().then(M).catch(()=>{}),re().then(L).catch(()=>{}),ae().then(H).catch(()=>{}),ne().then(Y).catch(()=>{}),le().then(U).catch(()=>{}),de().then(W).catch(()=>{})},[]);n.useEffect(()=>{j();const l=setInterval(j,5e3);return()=>clearInterval(l)},[j]);const q=()=>{oe("provider").then(l=>(v(`Breaker "${l.subsystem}" ${l.state}; evidence retained: ${l.failures} failures / ${l.attempts} attempts`),C())).then(g).catch(l=>v(l instanceof Error?l.message:String(l)))};if(y&&!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 p=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(r,{variant:"warning",children:"OBSERVER PENDING (A)"}):e.jsx(r,{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(d,{children:e.jsx(i,{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(m,{mode:"A",count:s.byMode.A}),e.jsx(m,{mode:"B",count:s.byMode.B}),e.jsx(m,{mode:"C",count:s.byMode.C})]})]})]}),e.jsxs(o,{className:"md:col-span-2",children:[e.jsx(d,{children:e.jsx(i,{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((l,b)=>{const Q=s.histogram.cells[b]/p*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[b]}),e.jsx("div",{className:"w-full rounded-t",style:{height:Math.max(2,Q),background:"#6366f1"}}),e.jsxs("span",{className:"text-[10px] text-muted-foreground",children:["≤",l]})]},l)}),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/p*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(d,{children:e.jsxs("div",{className:"flex items-center justify-between",children:[e.jsx(i,{children:"Live Safety Envelope (VC0C)"}),e.jsxs("div",{className:"flex items-center gap-2",children:[c?.stateSource==="ephemeral"&&e.jsx(r,{variant:"outline",children:"EPHEMERAL (non-live)"}),e.jsx("button",{onClick:q,disabled:!c?.enabled,className:"rounded border border-border px-2 py-1 text-xs disabled:opacity-50",children:"Reset Cooldown"})]})]})}),e.jsxs(x,{children:[f&&e.jsx("div",{className:"mb-2 text-xs text-muted-foreground",children:f}),c?e.jsxs("div",{className:"grid grid-cols-2 gap-4 md:grid-cols-4",children:[e.jsx(t,{label:"State",value:c.state}),e.jsx(t,{label:"Mode",value:c.mode}),e.jsx(t,{label:"Window",value:`${c.windowMs}ms`}),e.jsx(t,{label:"Probes",value:String(c.probeCount)}),e.jsx(t,{label:"Backoff",value:`${c.backoffDelayMs}ms`}),e.jsx(t,{label:"Failures",value:`${c.failures}/${c.attempts}`}),e.jsx(t,{label:"Frontier",value:c.stateSource==="ephemeral"?"non-live":c.frontierFrozen?"FROZEN":"LIVE"}),e.jsx(t,{label:"Spool lag",value:String(c.spoolLag)}),e.jsx(t,{label:"Encoder mode",value:c.encoderMode}),e.jsx(t,{label:"Encoder asset",value:c.encoderAssetDigest?c.encoderAssetDigest.slice(0,12):"none"})]}):e.jsx("div",{className:"vc-empty",children:"Health unavailable (VC0C off)."})]})]}),e.jsx(pe,{topology:R,query:F}),e.jsx(ge,{view:k}),e.jsx(fe,{view:I}),e.jsx(ve,{view:w}),e.jsx(ie,{view:O}),e.jsx(xe,{view:B}),e.jsx(ue,{view:D}),e.jsx(he,{view:z}),e.jsx(je,{view:_}),e.jsx(me,{view:G}),e.jsx(be,{ledger:S})]})}export{Ne as default};
-//# sourceMappingURL=VectorCortexTab-94fqVjat.js.map