agentic-qe 3.12.2 → 3.13.0

package/dist/skills/qe-court/referee.js

@@ -0,0 +1,78 @@
+/**
+ * QE-Court referee (ADR-124) — the falsifiable core of the adversarial court,
+ * as pure, deterministic functions so the court's invariants are ENFORCED in
+ * code (and unit-testable as oracles), not merely described in the skill doc.
+ *
+ * These back the qe-court acceptance eval (`.claude/skills/qe-court/evals`):
+ *   - verdict resolution + the overturn mechanic (SHIP must survive escalation)
+ *   - panel validation (writer≠juror, vendor diversity)
+ *   - DoE-gated scoring (no un-validated numeric score)
+ *
+ * No I/O, no LLM calls — the orchestration (spawning prosecutors, calling the
+ * two-gate judge) lives in the skill; the RULES live here.
+ */
+/** Map a provider id to its coarse vendor. */
+export function vendorOf(providerId) {
+    const p = providerId.toLowerCase();
+    if (p.startsWith('claude'))
+        return 'claude';
+    if (p.startsWith('cognitum'))
+        return 'cognitum';
+    if (p === 'codex' || p === 'openai' || p.startsWith('gpt') || p.startsWith('o3') || p.startsWith('o4'))
+        return 'gpt';
+    if (p.startsWith('openrouter'))
+        return 'openrouter';
+    if (p === 'ollama' || p === 'local')
+        return 'local';
+    return 'unknown';
+}
+/**
+ * Resolve the verdict from the surviving charges, applying the overturn window.
+ *
+ * THE OVERTURN MECHANIC: only charges surfaced at depth ≤ `overturnDepth` count.
+ * With `overturnDepth = 0` the deeper-review rounds are disabled, so a mutant a
+ * shallow pass missed (surfaced at depth ≥ 1) does NOT count and the verdict
+ * stays SHIP — which is exactly the false-SHIP the court exists to catch. With
+ * `overturnDepth ≥ 1` that same charge counts and flips the verdict. This
+ * asymmetry is the whole point: a SHIP must SURVIVE escalation.
+ */
+export function resolveVerdict(charges, overturnDepth) {
+    const surviving = charges.filter((c) => c.reproduced && c.depthFound <= overturnDepth);
+    if (surviving.some((c) => c.fatal))
+        return 'BLOCK';
+    if (surviving.length > 0)
+        return 'REMAND';
+    return 'SHIP';
+}
+/**
+ * Validate a seated panel against the court's anti-collusion invariants.
+ * Returns a list of violation codes (empty == valid).
+ *   - 'writerIsNeverJuror' : the jury shares a vendor with the writer/defense.
+ *   - 'vendor-diversity'   : fewer than `minVendors` distinct vendors seated.
+ */
+export function validatePanel(panel, policy = {}) {
+    const minVendors = policy.minVendors ?? 2;
+    const violations = [];
+    const vendorsSeated = new Set(panel.map((s) => vendorOf(s.provider)));
+    if (vendorsSeated.size < minVendors)
+        violations.push('vendor-diversity');
+    const jury = panel.find((s) => s.role === 'jury');
+    const writerLike = panel.filter((s) => s.role === 'writer' || s.role === 'defense');
+    if (jury) {
+        const juryVendor = vendorOf(jury.provider);
+        if (writerLike.some((w) => vendorOf(w.provider) === juryVendor)) {
+            violations.push('writerIsNeverJuror');
+        }
+    }
+    return violations;
+}
+/**
+ * DoE-gated scoring: emit a numeric score ONLY when the operator asked for one
+ * AND the scoring rubric passed the ADR-122 ANOVA screen (it actually
+ * discriminates). Otherwise the court reports the verdict class + charges, never
+ * a noise "91/100".
+ */
+export function shouldEmitScore(rubricDoePassed, emitScore) {
+    return emitScore && rubricDoePassed;
+}
+//# sourceMappingURL=referee.js.map

package/dist/validation/gate-reexecute.d.ts

@@ -40,6 +40,15 @@ export interface SealedInputs {
     provenanceTier: string;
     /** Whether judge-tier promotion was explicitly budgeted (ADR-121). */
     allowJudgeTier?: boolean;
+    /**
+     * accept/v1+sig only: the candidate's PER-HELD-OUT-TASK scores, matched by
+     * index to `baselineHeldOutSamples`. Optional and omitted from the sealed hash
+     * when undefined (so `accept/v1` receipts are byte-identical). The paired
+     * bootstrap significance gate needs these; `accept/v1` ignores them.
+     */
+    candidateHeldOutSamples?: number[];
+    /** accept/v1+sig only: the baseline's per-held-out-task scores (paired by index). */
+    baselineHeldOutSamples?: number[];
 }
 export interface RuleResult {
     promote: boolean;

package/dist/validation/gate-reexecute.js

@@ -25,6 +25,7 @@
 import { createHash } from 'node:crypto';
 import { meetsNoRegression } from './anchor-set.js';
 import { tierAllowsPromotion } from '../learning/provenance-tier.js';
+import { bootstrapDeltaCILow, pairedDeltas } from './paired-bootstrap.js';
 /** Tag domain-separating the rule fingerprint hash. */
 const RULE_TAG = 'aqe:accept-rule:v1+sig';
 /**
@@ -45,9 +46,69 @@ const acceptV1 = (s) => {
     }
     return { promote: true, reason: 'held-out gain, no anchor regression, oracle-tier evidence' };
 };
+/**
+ * accept/v1+sig — accept/v1 PLUS a paired-bootstrap significance gate on the
+ * held-out delta (adopted from ruflo's flywheel gate). A NEW frozen version:
+ * `accept/v1` is untouched. Promotes only when accept/v1 passes AND the paired
+ * per-task held-out gain is significant (one-sided 95% CI lower bound > 0) —
+ * closing accept/v1's "promote any positive mean-beat, even within noise" gap.
+ *
+ * Fail-closed: if the paired sample vectors are absent or mismatched, it does
+ * NOT promote (a significance claim it cannot verify is a rejection).
+ */
+/** Minimum paired sample size for a meaningful bootstrap CI. Below this, a "95%
+ *  CI" is just the raw delta dressed up (n=1 → ciLow == delta), so we fail closed
+ *  rather than certify noise as significant (qe-court finding). */
+const MIN_SIG_SAMPLES = 8;
+/** Tolerance for mean(samples) vs the sealed scalar — guards forged scalar/vector pairs. */
+const SAMPLE_MEAN_TOL = 1e-6;
+const mean = (xs) => xs.reduce((a, b) => a + b, 0) / xs.length;
+const acceptV1Sig = (s) => {
+    const base = acceptV1(s);
+    if (!base.promote)
+        return base;
+    const cand = s.candidateHeldOutSamples;
+    const bl = s.baselineHeldOutSamples;
+    if (!cand || !bl || cand.length === 0 || cand.length !== bl.length) {
+        return {
+            promote: false,
+            reason: `significance gate: missing/mismatched paired held-out samples ` +
+                `(need equal-length candidate & baseline per-task vectors)`,
+        };
+    }
+    if (cand.length < MIN_SIG_SAMPLES) {
+        return {
+            promote: false,
+            reason: `significance gate: only ${cand.length} paired samples (< ${MIN_SIG_SAMPLES}) — ` +
+                `a bootstrap CI is not meaningful; fail closed rather than certify noise`,
+        };
+    }
+    // The sealed scalar means MUST match the sealed sample vectors, or a forged
+    // receipt could pair a passing scalar with an unrelated (or noisy) vector to
+    // spoof significance. This module's whole job is to defend against forged
+    // receipts (ADR-120), so it asserts the two describe the same evaluation.
+    if (Math.abs(mean(cand) - s.candidateHeldOut) > SAMPLE_MEAN_TOL ||
+        Math.abs(mean(bl) - s.baselineHeldOut) > SAMPLE_MEAN_TOL) {
+        return {
+            promote: false,
+            reason: `significance gate: sealed sample means do not match the sealed held-out ` +
+                `scalars — inconsistent/forged evaluation`,
+        };
+    }
+    const ciLow = bootstrapDeltaCILow(pairedDeltas(cand, bl));
+    if (!(ciLow > 0)) {
+        return {
+            promote: false,
+            reason: `significance gate: paired held-out gain not significant ` +
+                `(95% CI lower bound ${ciLow.toFixed(4)} ≤ 0)`,
+        };
+    }
+    return { promote: true, reason: `${base.reason}; paired gain significant (CI low ${ciLow.toFixed(4)} > 0)` };
+};
 /** Registry of versioned frozen rules. Add a NEW key to change a rule; never edit in place. */
 export const ACCEPTANCE_RULES = Object.freeze({
     'accept/v1': acceptV1,
+    'accept/v1+sig': acceptV1Sig,
 });
 /**
  * Canonical (sorted-key) JSON — same discipline as ADR-116 proof-gate. Keys

package/dist/validation/paired-bootstrap.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Paired-delta bootstrap significance (ADR-118 accept/v1+sig).
+ *
+ * Adopted from ruflo's flywheel promotion gate (`accept/v1+sig`,
+ * `bootstrapDeltaCILow`), reimplemented dependency-free (technique adoption, not
+ * an import — AQE does not depend on the ruflo package). ruflo's gate closes a
+ * real gap in AQE's `accept/v1`, which promotes a candidate whose held-out MEAN
+ * merely beats baseline by any amount — i.e. it can promote a within-noise gain.
+ *
+ * This computes a one-sided lower confidence bound on the MEAN of the PAIRED
+ * per-task deltas (candidate − baseline, matched by task). If that bound is > 0
+ * the gain is significant. The pairing is what makes it stronger than an
+ * unpaired 2-group ANOVA (for 2 groups ANOVA F = t², and it discards the
+ * pairing this exploits).
+ *
+ * MUST be DETERMINISTIC — the promotion decision is replay-verified (ADR-120):
+ * a fixed-seed LCG resampler makes the same deltas always yield the same bound,
+ * so an independent re-run reproduces the exact promote/reject decision.
+ */
+export interface BootstrapOptions {
+    /** Resample count (default 2000, matching ruflo). */
+    iters?: number;
+    /** One-sided significance level (default 0.05 → 95% lower bound). */
+    alpha?: number;
+    /** LCG seed. Fixed by default so the bound is reproducible for replay. */
+    seed?: number;
+}
+/**
+ * One-sided lower confidence bound on the mean of `deltas`. Returns -Infinity
+ * for an empty sample (no evidence ⇒ never significant), so callers can gate on
+ * `bootstrapDeltaCILow(deltas) > 0` and fail closed.
+ */
+export declare function bootstrapDeltaCILow(deltas: number[], opts?: BootstrapOptions): number;
+/** Convenience: paired deltas from matched candidate/baseline sample vectors. */
+export declare function pairedDeltas(candidate: number[], baseline: number[]): number[];
+//# sourceMappingURL=paired-bootstrap.d.ts.map

package/dist/validation/paired-bootstrap.js

@@ -0,0 +1,58 @@
+/**
+ * Paired-delta bootstrap significance (ADR-118 accept/v1+sig).
+ *
+ * Adopted from ruflo's flywheel promotion gate (`accept/v1+sig`,
+ * `bootstrapDeltaCILow`), reimplemented dependency-free (technique adoption, not
+ * an import — AQE does not depend on the ruflo package). ruflo's gate closes a
+ * real gap in AQE's `accept/v1`, which promotes a candidate whose held-out MEAN
+ * merely beats baseline by any amount — i.e. it can promote a within-noise gain.
+ *
+ * This computes a one-sided lower confidence bound on the MEAN of the PAIRED
+ * per-task deltas (candidate − baseline, matched by task). If that bound is > 0
+ * the gain is significant. The pairing is what makes it stronger than an
+ * unpaired 2-group ANOVA (for 2 groups ANOVA F = t², and it discards the
+ * pairing this exploits).
+ *
+ * MUST be DETERMINISTIC — the promotion decision is replay-verified (ADR-120):
+ * a fixed-seed LCG resampler makes the same deltas always yield the same bound,
+ * so an independent re-run reproduces the exact promote/reject decision.
+ */
+/**
+ * One-sided lower confidence bound on the mean of `deltas`. Returns -Infinity
+ * for an empty sample (no evidence ⇒ never significant), so callers can gate on
+ * `bootstrapDeltaCILow(deltas) > 0` and fail closed.
+ */
+export function bootstrapDeltaCILow(deltas, opts) {
+    const n = deltas.length;
+    if (n === 0)
+        return -Infinity;
+    const iters = opts?.iters ?? 2000;
+    const alpha = opts?.alpha ?? 0.05;
+    // Deterministic LCG (Numerical Recipes constants). Seed is fixed by default so
+    // the bound is byte-stable across independent replays of the same deltas.
+    let state = (opts?.seed ?? 0x9e3779b1) >>> 0;
+    const next = () => {
+        state = (Math.imul(state, 1664525) + 1013904223) >>> 0;
+        return state / 0x1_0000_0000;
+    };
+    const resampleMeans = new Array(iters);
+    for (let b = 0; b < iters; b++) {
+        let sum = 0;
+        for (let i = 0; i < n; i++) {
+            sum += deltas[Math.floor(next() * n)];
+        }
+        resampleMeans[b] = sum / n;
+    }
+    resampleMeans.sort((a, b) => a - b);
+    const idx = Math.min(Math.floor(alpha * iters), iters - 1);
+    return resampleMeans[idx];
+}
+/** Convenience: paired deltas from matched candidate/baseline sample vectors. */
+export function pairedDeltas(candidate, baseline) {
+    const n = Math.min(candidate.length, baseline.length);
+    const out = new Array(n);
+    for (let i = 0; i < n; i++)
+        out[i] = candidate[i] - baseline[i];
+    return out;
+}
+//# sourceMappingURL=paired-bootstrap.js.map

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "agentic-qe",
-  "version": "3.12.2",
+  "version": "3.13.0",
   "description": "Agentic Quality Engineering V3 - Domain-Driven Design Architecture with 13 Bounded Contexts, O(log n) coverage analysis, ReasoningBank learning, 60 specialized QE agents, mathematical Coherence verification, deep Claude Flow integration",
   "type": "module",
   "main": "./dist/index.js",
@@ -78,7 +78,7 @@
     "test:all": "npm test -- --run",
     "test:mcp": "npm run test:unit:mcp",
     "test:mcp:integration": "npm test -- --run tests/integration/mcp/",
-    "test:integration:fast": "NODE_OPTIONS='--max-old-space-size=2048 --expose-gc' vitest run tests/integration/mcp/fleet-init-wires-daemon.test.ts tests/integration/mcp/mcp-cli-inprocess.test.ts tests/integration/mcp/memory-delete-cache-invalidation.test.ts tests/integration/workers/workers-reach-domains.test.ts tests/integration/learning/coordinator-roundtrip.test.ts tests/integration/bridge/bridge-end-to-end.test.ts",
+    "test:integration:fast": "NODE_OPTIONS='--max-old-space-size=2048 --expose-gc' vitest run tests/integration/mcp/fleet-init-wires-daemon.test.ts tests/integration/mcp/mcp-cli-inprocess.test.ts tests/integration/mcp/memory-delete-cache-invalidation.test.ts tests/integration/workers/workers-reach-domains.test.ts tests/integration/learning/coordinator-roundtrip.test.ts tests/integration/bridge/bridge-end-to-end.test.ts tests/integration/rvf-corruption-recovery.integration.test.ts",
     "test:integration": "NODE_OPTIONS='--max-old-space-size=4096 --expose-gc' vitest run tests/integration/ --exclude='**/browser/**' --exclude='**/browser-integration/**' --exclude='**/*.e2e.test.ts'",
     "mcp:validate": "node scripts/smoke-mcp-protocol.mjs",
     "mcp:parity": "node scripts/audit-mcp-tool-parity.mjs",
@@ -164,7 +164,6 @@
   "author": "AQE Development Team",
   "license": "MIT",
   "dependencies": {
-    "@huggingface/transformers": "^4.2.0",
     "@ruvector/attention": "0.1.3",
     "@ruvector/gnn": "0.1.25",
     "@ruvector/learning-wasm": "^0.1.29",
@@ -190,7 +189,8 @@
   },
   "peerDependencies": {
     "@claude-flow/browser": "3.0.0-alpha.1",
-    "@claude-flow/guidance": "3.0.0-alpha.1"
+    "@claude-flow/guidance": "3.0.0-alpha.1",
+    "@huggingface/transformers": "^4.2.0"
   },
   "peerDependenciesMeta": {
     "@claude-flow/browser": {
@@ -198,6 +198,9 @@
     },
     "@claude-flow/guidance": {
       "optional": true
+    },
+    "@huggingface/transformers": {
+      "optional": true
     }
   },
   "optionalDependencies": {
@@ -240,6 +243,7 @@
   "devDependencies": {
     "@claude-flow/guidance": "3.0.0-alpha.1",
     "@faker-js/faker": "^10.2.0",
+    "@huggingface/transformers": "^4.2.0",
     "@types/better-sqlite3": "^7.6.13",
     "@types/cli-progress": "^3.11.6",
     "@types/node": "^25.8.0",

package/dist/cli/chunks/adapter-RL6GNUOS.js

@@ -1,2 +0,0 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.12.2");process.exit(0)}
-import{a,b,c}from"./chunk-T6TQPF5P.js";import"./chunk-KV5OZ6T3.js";import"./chunk-WMNGPIP3.js";import"./chunk-CKFZOPZN.js";import"./chunk-X47GHZY3.js";import"./chunk-HU6ETNA7.js";export{a as AgentBoosterAdapter,b as createAgentBoosterAdapter,c as createAgentBoosterAdapterSync};

package/dist/cli/chunks/aqe-learning-engine-UEEW6AQG.js

@@ -1,2 +0,0 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.12.2");process.exit(0)}
-import{a,b,c,d,e,f}from"./chunk-5YLY2WT2.js";import"./chunk-Z63IOTDW.js";import"./chunk-WC5PM33J.js";import"./chunk-5CGTBAVF.js";import"./chunk-F3CKOVZM.js";import"./chunk-YRO7HNS4.js";import"./chunk-WYFEVPLO.js";import"./chunk-BDX54WJV.js";import"./chunk-WE5QHYL7.js";import"./chunk-T75VH6NT.js";import"./chunk-ADZTWGEB.js";import"./chunk-2L7K2J2T.js";import"./chunk-AJ6DZXKK.js";import"./chunk-TQNNKW7K.js";import"./chunk-PHIEJAQK.js";import"./chunk-APVXTHTA.js";import"./chunk-AL5QT6OX.js";import"./chunk-YY4KXDI6.js";import"./chunk-R5HC6JVJ.js";import"./chunk-ACDZ2CRV.js";import"./chunk-CKFZOPZN.js";import"./chunk-6SWR2BN7.js";import"./chunk-TRHUH24V.js";import"./chunk-6N62KS3C.js";import"./chunk-P65S7AZA.js";import"./chunk-EGU54SNK.js";import"./chunk-X47GHZY3.js";import"./chunk-ZBYMF2QJ.js";import"./chunk-WRMUQVKY.js";import"./chunk-UF3YOGHV.js";import"./chunk-V2QYW5KW.js";import"./chunk-4KEOBDEI.js";import"./chunk-C7VNQ4PY.js";import"./chunk-QYST2TZW.js";import"./chunk-YZ44FUVJ.js";import"./chunk-YDZIPP3Y.js";import"./chunk-CTFW7CMI.js";import"./chunk-HU6ETNA7.js";export{b as AQELearningEngine,a as DEFAULT_ENGINE_CONFIG,c as DEFAULT_META_LEARNING_CONFIG,d as MetaLearningEngine,e as createAQELearningEngine,f as createDefaultLearningEngine};

package/dist/cli/chunks/base-JQA5YULE.js

@@ -1,2 +0,0 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.12.2");process.exit(0)}
-import{a,b,c,d,e,f,g,h,i,j,k,l}from"./chunk-LIAW5FD7.js";import"./chunk-ZHWXI4SK.js";import"./chunk-APVXTHTA.js";import"./chunk-AL5QT6OX.js";import"./chunk-YY4KXDI6.js";import"./chunk-R5HC6JVJ.js";import"./chunk-ACDZ2CRV.js";import"./chunk-CKFZOPZN.js";import"./chunk-P65S7AZA.js";import"./chunk-X47GHZY3.js";import"./chunk-ZBYMF2QJ.js";import"./chunk-ERQL3D2O.js";import"./chunk-WRMUQVKY.js";import"./chunk-UF3YOGHV.js";import"./chunk-V2QYW5KW.js";import"./chunk-4KEOBDEI.js";import"./chunk-C7VNQ4PY.js";import"./chunk-QYST2TZW.js";import"./chunk-YZ44FUVJ.js";import"./chunk-YDZIPP3Y.js";import"./chunk-CTFW7CMI.js";import"./chunk-HU6ETNA7.js";export{l as MCPToolBase,k as defaultToolLogger,j as getKernel,i as getLLMRouter,e as getMemoryBackend,g as getSharedLLMRouter,c as getSharedMemoryBackend,a as isMemoryOnlyMode,b as registerRvfResetFn,h as resetSharedLLMRouter,d as resetSharedMemoryBackend,f as setSharedLLMRouter};

package/dist/cli/chunks/brain-handler-T7RDPKNM.js

@@ -1,89 +0,0 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.12.2");process.exit(0)}
-import{a as A,b as L,c as F,d as R,e as Y,f as T,g as P,h as C,i as j,j as X,k as V,l as ye,m as $,n as Z,o as be,p as _,q as J,r as U,s as W}from"./chunk-R6LDR3IO.js";import{h as ge}from"./chunk-ADZTWGEB.js";import{b as pe}from"./chunk-2L7K2J2T.js";import"./chunk-APVXTHTA.js";import"./chunk-AL5QT6OX.js";import"./chunk-YY4KXDI6.js";import"./chunk-R5HC6JVJ.js";import"./chunk-ACDZ2CRV.js";import{b as x,d as Q}from"./chunk-CKFZOPZN.js";import{a as fe,b as me,c as ue,d as k,f as ze}from"./chunk-TRHUH24V.js";import"./chunk-P65S7AZA.js";import"./chunk-X47GHZY3.js";import{a as O,b as We}from"./chunk-WRMUQVKY.js";import"./chunk-UF3YOGHV.js";import"./chunk-V2QYW5KW.js";import"./chunk-4KEOBDEI.js";import"./chunk-C7VNQ4PY.js";import"./chunk-QYST2TZW.js";import"./chunk-YZ44FUVJ.js";import"./chunk-YDZIPP3Y.js";import"./chunk-CTFW7CMI.js";import"./chunk-HU6ETNA7.js";import B from"path";import o from"chalk";We();Q();import{existsSync as z,mkdirSync as He,writeFileSync as Ke,readFileSync as ee}from"fs";import{join as E,resolve as ne}from"path";var Ge={rl_q_values:"includeQValues",dream_insights:"includeDreamInsights",dream_cycles:"includeDreamInsights",witness_chain:"includeWitnessChain",vectors:"includeVectors"};function Qe(e,n){let r=Ge[e.tableName];return!(r&&n[r]===!1)}var Ye=1e4;function Xe(e,n,r,t){if(!Qe(n,r))return Z(E(t,n.fileName),[]),{count:0,rows:[]};let[a,s]=n.domainColumn?$(r.domains,n.domainColumn):[void 0,[]];if(X(e,n.tableName,a,s)>=Ye){let d=n.blobColumns,c=d&&d.length>0?p=>T(p,d):void 0;return{count:be(E(t,n.fileName),ye(e,n.tableName,a,s),c)}}let i=V(e,n.tableName,a,s);return n.blobColumns&&n.blobColumns.length>0&&(i=i.map(d=>T(d,n.blobColumns))),Z(E(t,n.fileName),i),{count:i.length,rows:i}}function he(e){let n=[];for(let r of R){let t=E(e,r.fileName);z(t)?n.push(C(ee(t,"utf-8"))):n.push(C(""))}return C(n.join(":"))}function we(e,n,r="memory.db"){let t=ne(n.outputPath);z(t)||He(t,{recursive:!0});let a=0,s={},l=new Set;for(let u of R){let p=Xe(e,u,n,t);if(s[u.tableName]=p.count,a+=p.count,u.tableName==="qe_patterns"){if(p.rows)for(let f of p.rows)f.qe_domain&&l.add(f.qe_domain);else if(p.count>0){let[f,w]=u.domainColumn?$(n.domains,u.domainColumn):[void 0,[]],y=`SELECT DISTINCT qe_domain FROM qe_patterns ${f?`WHERE ${f} AND qe_domain IS NOT NULL`:"WHERE qe_domain IS NOT NULL"}`;try{let g=e.prepare(y).all(...w||[]);for(let v of g)l.add(v.qe_domain)}catch{}}}}let i=n.includeVectors!==!1?X(e,"vectors"):0,d=he(t),c={version:"3.0",exportedAt:new Date().toISOString(),sourceDb:r,stats:{patternCount:s.qe_patterns||0,vectorCount:i,qValueCount:s.rl_q_values||0,dreamInsightCount:s.dream_insights||0,witnessChainLength:s.witness_chain||0,totalRecords:a},domains:[...l].sort(),checksum:d,tableRecordCounts:s};return Ke(E(t,"manifest.json"),JSON.stringify(c,null,2),"utf-8"),c}var Ze=new Set(["qe_patterns","rl_q_values","dream_insights","witness_chain"]);function en(e){return e==="1.0"?R.filter(n=>Ze.has(n.tableName)):e==="3.0"?R:(console.warn(`[brain-import] Unknown manifest version '${e}'. Attempting full import \u2014 some files may be missing.`),R)}function ve(e,n,r){let t=ne(n),a=E(t,"manifest.json");if(!z(a))throw new Error(`Manifest not found at ${a}`);let s=x(ee(a,"utf-8")),l=he(t);if(l!==s.checksum)throw new Error(`Checksum mismatch: expected ${s.checksum}, got ${l}. The export may have been tampered with or corrupted.`);let i=en(s.version);if(r.dryRun){let f=0;for(let w of i){let m=_(E(t,w.fileName),x);f+=m.length}return{imported:f,skipped:0,conflicts:0}}W(e);let d=0,c=0,u=0;return e.transaction(()=>{for(let f of i){let w=E(t,f.fileName),m=_(w,x);f.blobColumns&&f.blobColumns.length>0&&(m=m.map(y=>P(y,f.blobColumns)));for(let y of m){let g;if(f.dedupColumns&&f.dedupColumns.length>0)g=U(e,f.tableName,y,f.dedupColumns);else{let v=A[f.tableName]||"id",b=F[f.tableName],I=L[f.tableName];g=J(e,f.tableName,y,v,r.mergeStrategy,b,I)}d+=g.imported,c+=g.skipped,u+=g.conflicts}}})(),{imported:d,skipped:c,conflicts:u}}function Re(e){let n=ne(e),r=E(n,"manifest.json");if(!z(r))throw new Error(`Manifest not found at ${r}`);return x(ee(r,"utf-8"))}ze();import{existsSync as H,statSync as nn,unlinkSync as Se,writeFileSync as tn}from"fs";import{resolve as te}from"path";function xe(e,n,r="memory.db"){if(!k())throw new Error("@ruvector/rvf-node is not available. Install it or use --format jsonl instead.");let t=te(n.outputPath),a=n.dimension??384;H(t)&&Se(t);let s=`${t}.idmap.json`;H(s)&&Se(s);let l=fe(t,a);try{let i={},d=new Set,c=0;for(let S of R){let[h,ce]=S.domainColumn?$(n.domains,S.domainColumn):[void 0,[]],D=V(e,S.tableName,h,ce);if(S.tableName==="qe_patterns")for(let q of D)q.qe_domain&&d.add(q.qe_domain);let G=Y[S.tableName];G&&G.length>0&&(D=D.map(q=>T(q,G))),i[S.tableName]=D,c+=D.length}let u=0,p=[];if(j(e,"qe_pattern_embeddings")){let S=e.prepare("SELECT pattern_id, embedding, dimension FROM qe_pattern_embeddings").all();for(let h of S)h.embedding&&h.dimension===a&&p.push({id:`pe:${h.pattern_id}`,vector:new Float32Array(h.embedding.buffer,h.embedding.byteOffset,a),metadata:{tableName:"qe_pattern_embeddings"}})}if(j(e,"captured_experiences")){let S=e.prepare("SELECT id, embedding, embedding_dimension, domain, quality FROM captured_experiences WHERE embedding IS NOT NULL").all();for(let h of S)h.embedding_dimension===a&&p.push({id:`exp:${h.id}`,vector:new Float32Array(h.embedding.buffer,h.embedding.byteOffset,a),metadata:{tableName:"captured_experiences",domain:h.domain,confidence:h.quality}})}if(j(e,"sona_patterns")){let S=e.prepare("SELECT id, state_embedding, domain, confidence FROM sona_patterns WHERE state_embedding IS NOT NULL").all();for(let h of S)h.state_embedding.byteLength/4===a&&p.push({id:`sona:${h.id}`,vector:new Float32Array(h.state_embedding.buffer,h.state_embedding.byteOffset,a),metadata:{tableName:"sona_patterns",domain:h.domain,confidence:h.confidence}})}p.length>0&&(u=l.ingest(p).accepted);let f={version:"3.0",format:"rvf",exportedAt:new Date().toISOString(),sourceDb:r,domains:[...d].sort(),tables:i},w=JSON.stringify(f),m=C(w),y=Buffer.from(w);l.embedKernel(y);let g=n.sign?l.sign(y)??void 0:void 0,v=g?n.signerKeyId??"default":void 0,b=l.fileId(),I=b?{fileId:b,parentId:l.parentId(),lineageDepth:l.lineageDepth()}:void 0,N=l.status(),M={version:"3.0",format:"rvf",exportedAt:f.exportedAt,sourceDb:r,stats:{patternCount:(i.qe_patterns||[]).length,embeddingCount:u,qValueCount:(i.rl_q_values||[]).length,dreamInsightCount:(i.dream_insights||[]).length,witnessChainLength:(i.witness_chain||[]).length,totalRecords:c},domains:f.domains,checksum:m,rvfStatus:{totalVectors:N.totalVectors,totalSegments:N.totalSegments,fileSizeBytes:N.fileSizeBytes},...g?{signature:g,signerKeyId:v}:{},...I?{lineage:I}:{}};if(g)try{l.freeze()}catch{}let Ue=`${t}.manifest.json`;return tn(Ue,JSON.stringify(M,null,2),"utf-8"),M}finally{l.close()}}var rn={patterns:"qe_patterns",qValues:"rl_q_values",dreamInsights:"dream_insights",witnessChain:"witness_chain"};function Ce(e,n,r){if(!k())throw new Error("@ruvector/rvf-node is not available. Install it or use JSONL format.");let t=te(n);if(!H(t))throw new Error(`RVF file not found: ${t}`);let a=me(t);try{let s=a.verifyWitness();if(!s.valid&&(s.totalEntries>0||s.errors.length>0)){let m=s.errors.length>0?s.errors.join("; "):"unknown integrity error";throw new Error(`RVF witness verification failed: ${m}`)}let l=a.extractKernel();if(!l||!l.image)throw new Error("No brain data found in RVF file (missing kernel segment)");let i;try{i=JSON.parse(l.image.toString("utf-8"))}catch(m){throw new Error(`Failed to parse brain kernel data as JSON: ${m instanceof Error?m.message:m}`)}if(r.dryRun){let m=0;if(i.tables)for(let y of Object.values(i.tables))m+=y?.length??0;else m=(i.patterns?.length??0)+(i.qValues?.length??0)+(i.dreamInsights?.length??0)+(i.witnessChain?.length??0);return{imported:m,skipped:0,conflicts:0,embeddingsRestored:0}}W(e);let d=0,c=0,u=0,p=0,f={};if(i.tables)Object.assign(f,i.tables);else for(let[m,y]of Object.entries(rn)){let g=i[m];Array.isArray(g)&&(f[y]=g)}if(e.transaction(()=>{for(let m of R){let y=f[m.tableName];if(!y||!Array.isArray(y))continue;let g=Y[m.tableName];if(g&&g.length>0){y=y.map(v=>P(v,g));for(let v of y)for(let b of g)v[b]instanceof Buffer&&p++}for(let v of y){let b;if(m.dedupColumns&&m.dedupColumns.length>0)b=U(e,m.tableName,v,m.dedupColumns);else{let I=A[m.tableName]||"id",N=F[m.tableName],M=L[m.tableName];b=J(e,m.tableName,v,I,r.mergeStrategy,N,M)}d+=b.imported,c+=b.skipped,u+=b.conflicts}}})(),u>0)try{a.compact()}catch{}return{imported:d,skipped:c,conflicts:u,embeddingsRestored:p}}finally{a.close()}}function K(e){if(!k())throw new Error("@ruvector/rvf-node is not available.");let n=te(e);if(!H(n))throw new Error(`RVF file not found: ${n}`);let r=ue(n);try{let t=r.extractKernel();if(!t||!t.image)throw new Error("No brain data found in RVF file");let a=t.image.toString("utf-8"),s;try{s=JSON.parse(a)}catch(w){throw new Error(`Failed to parse brain kernel data as JSON: ${w instanceof Error?w.message:w}`)}let l=r.status(),i=nn(n).size,d=s.tables,c=d?d.qe_patterns?.length??0:s.patterns?.length??0,u=d?d.rl_q_values?.length??0:s.qValues?.length??0,p=d?d.dream_insights?.length??0:s.dreamInsights?.length??0,f=d?d.witness_chain?.length??0:s.witnessChain?.length??0;return{version:"3.0",format:"rvf",exportedAt:s.exportedAt??"unknown",sourceDb:s.sourceDb??"unknown",stats:{patternCount:c,embeddingCount:l.totalVectors,qValueCount:u,dreamInsightCount:p,witnessChainLength:f},domains:s.domains??[],checksum:C(a),rvfStatus:{totalVectors:l.totalVectors,totalSegments:l.totalSegments,fileSizeBytes:i}}}finally{r.close()}}function re(){return k()}Q();import{existsSync as ae,readFileSync as on,statSync as an}from"fs";import{join as oe,resolve as Ee}from"path";function Oe(e,n,r={}){let t=Ee(e),a=Ee(n),s=Be(t),l=Be(a),i=_e(t,s),d=_e(a,l),c=s==="jsonl"&&l==="jsonl",u=dn({pathA:t,pathB:a,manifestA:i,manifestB:d,recordLevel:c,tableFilter:r.tableFilter,maxIdsPerBucket:r.maxIdsPerBucket??500}),p=new Set(i.domains),f=new Set(d.domains),w=i.domains.filter(b=>!f.has(b)),m=d.domains.filter(b=>!p.has(b)),y=i.checksum===d.checksum,g=i.version===d.version,v=y&&g&&u.every(b=>b.delta===0&&(b.added?.length??0)===0&&(b.removed?.length??0)===0&&(b.changed?.length??0)===0);return{pathA:t,pathB:a,formatA:s,formatB:l,manifestA:i,manifestB:d,checksumMatch:y,versionMatch:g,identical:v,recordLevel:c,tableDiffs:u,domainsOnlyInA:w,domainsOnlyInB:m}}function Be(e){if(!ae(e))throw new Error(`Path not found: ${e}`);if(e.endsWith(".rvf"))return"rvf";if(an(e).isFile())throw new Error(`Unsupported brain export: ${e} (expected a .rvf file or a JSONL directory)`);return"jsonl"}function _e(e,n){return n==="rvf"?ln(e):sn(e)}function sn(e){let n=oe(e,"manifest.json");if(!ae(n))throw new Error(`Manifest not found at ${n}`);let r=x(on(n,"utf-8"));return Ae(r,"jsonl")}function ln(e){let n=K(e);return Ae(n,"rvf")}function Ae(e,n){return{format:n,version:e.version??"unknown",exportedAt:e.exportedAt??"unknown",sourceDb:e.sourceDb??"unknown",checksum:e.checksum??"",totalRecords:e.stats?.totalRecords??0,domains:e.domains??[],tableRecordCounts:e.tableRecordCounts??{}}}function dn(e){let n=e.tableFilter?R.filter(t=>t.tableName===e.tableFilter):R;if(e.tableFilter&&n.length===0)throw new Error(`Unknown table: ${e.tableFilter}`);let r=[];for(let t of n){let a=e.manifestA.tableRecordCounts[t.tableName]??0,s=e.manifestB.tableRecordCounts[t.tableName]??0,l=s-a,i,d,c;if(e.recordLevel&&cn(t)){let u=fn(oe(e.pathA,t.fileName),oe(e.pathB,t.fileName),t,e.maxIdsPerBucket);i=u.added,d=u.removed,c=u.changed}r.push({tableName:t.tableName,countA:a,countB:s,delta:l,...i!==void 0?{added:i}:{},...d!==void 0?{removed:d}:{},...c!==void 0?{changed:c}:{}})}return r}function cn(e){return!0}function fn(e,n,r,t){let a=Ie(e,r),s=Ie(n,r),l=[],i=[],d=[];for(let[c,u]of a){let p=s.get(c);if(p===void 0)i.length<t&&i.push(c);else if(p!==u){if(r.dedupColumns&&r.dedupColumns.length>0)continue;d.length<t&&d.push(c)}}for(let c of s.keys())a.has(c)||l.length<t&&l.push(c);return l.sort(),i.sort(),d.sort(),{added:l,removed:i,changed:d}}function Ie(e,n){let r=new Map;if(!ae(e))return r;let t=_(e,x);for(let a of t){let s=mn(a,n);if(s===void 0)continue;let l=un(a);r.set(s,pn(l))}return r}function mn(e,n){if(n.dedupColumns&&n.dedupColumns.length>0){let a=[];for(let s of n.dedupColumns){let l=e[s];if(l==null)return;a.push(String(l))}return a.join("
")}let r=A[n.tableName]??"id",t=e[r];if(t!=null)return String(t)}function un(e){let n=Object.keys(e).sort(),r={};for(let t of n)r[t]=e[t];return JSON.stringify(r)}function pn(e){return C(e)}Q();import{existsSync as ie,statSync as gn}from"fs";import{join as Ne,resolve as yn}from"path";var bn=20,hn="qe_patterns";function De(e,n={}){let r=yn(e);Rn(r);let t=n.table??hn,a=R.find(g=>g.tableName===t);if(!a)throw new Error(`Unknown table: ${t}`);let s=Ne(r,a.fileName);if(!ie(s))throw new Error(`Table file not found: ${a.fileName} (expected in ${r}). Was this export generated with --format jsonl?`);let l=_(s,x),i=a.domainColumn,d=Math.max(1,n.limit??bn),c=n.query?n.query.toLowerCase():void 0,u=n.domains&&n.domains.length>0?new Set(n.domains):void 0,p=n.since,f=n.until,w=n.patternType,m=0,y=[];for(let g of l)wn(g,{domainColumn:i,domains:u,patternType:w,since:p,until:f,queryLower:c})&&(m++,y.length<d&&y.push(vn(g,a.tableName,i)));return{table:t,inputPath:r,totalScanned:l.length,totalMatched:m,limit:d,hits:y,truncated:m>d}}function wn(e,n){if(n.domains){if(!n.domainColumn)return!1;let r=e[n.domainColumn];if(typeof r!="string"||!n.domains.has(r))return!1}if(n.patternType!==void 0&&e.pattern_type!==n.patternType)return!1;if(n.since!==void 0||n.until!==void 0){let r=ke(e);if(r===void 0||n.since!==void 0&&r<n.since||n.until!==void 0&&r>n.until)return!1}if(n.queryLower!==void 0){let r=typeof e.name=="string"?e.name.toLowerCase():"",t=typeof e.description=="string"?e.description.toLowerCase():"";if(!r.includes(n.queryLower)&&!t.includes(n.queryLower))return!1}return!0}function ke(e){for(let n of["updated_at","created_at","timestamp"]){let r=e[n];if(typeof r=="string"&&r.length>0)return r}}function vn(e,n,r){let t=(typeof e.id=="string"||typeof e.id=="number"?String(e.id):void 0)??`${n}:?`,a={name:typeof e.name=="string"?e.name:void 0,description:typeof e.description=="string"?e.description:void 0,domain:r&&typeof e[r]=="string"?e[r]:void 0,patternType:typeof e.pattern_type=="string"?e.pattern_type:void 0,confidence:typeof e.confidence=="number"?e.confidence:void 0,updatedAt:ke(e)};return{id:t,display:a,row:e}}function Rn(e){if(!ie(e))throw new Error(`Path not found: ${e}`);if(gn(e).isFile())throw e.endsWith(".rvf")?new Error("Brain search does not support RVF exports. Re-export with --format jsonl, or use `aqe brain info` for RVF summaries."):new Error(`Unsupported brain export: ${e} (expected a JSONL directory)`);let r=Ne(e,"manifest.json");if(!ie(r))throw new Error(`Manifest not found at ${r}. Is this a brain export directory?`)}function Te(e,n){if(!e.prepare("SELECT name FROM sqlite_master WHERE type='table' AND name='qe_patterns'").get())return{created:0,skipped:0};e.exec(`
-    CREATE TEMP TABLE IF NOT EXISTS _covered_patterns (
-      pattern_id TEXT PRIMARY KEY
-    )
-  `),e.exec("DELETE FROM _covered_patterns"),e.exec(`
-    INSERT INTO _covered_patterns (pattern_id)
-    SELECT DISTINCT json_extract(action_data, '$.patternId')
-    FROM witness_chain
-    WHERE action_type = 'PATTERN_CREATE'
-      AND json_extract(action_data, '$.patternId') IS NOT NULL
-  `),e.exec(`
-    INSERT OR IGNORE INTO _covered_patterns (pattern_id)
-    SELECT DISTINCT json_extract(action_data, '$.pattern_id')
-    FROM witness_chain
-    WHERE action_type = 'PATTERN_CREATE'
-      AND json_extract(action_data, '$.pattern_id') IS NOT NULL
-  `);let t=e.prepare(`SELECT p.id, p.pattern_type, p.qe_domain, p.name, p.created_at
-       FROM qe_patterns p
-       LEFT JOIN _covered_patterns c ON p.id = c.pattern_id
-       WHERE c.pattern_id IS NULL
-       ORDER BY p.created_at ASC`).all(),s=e.prepare("SELECT COUNT(*) as count FROM qe_patterns").get().count-t.length,l=0;for(let i of t)n.append("PATTERN_CREATE",{patternId:i.id,patternType:i.pattern_type,qeDomain:i.qe_domain,name:i.name,originalCreatedAt:i.created_at,backfilled:!0},"system:backfill"),l++;return e.exec("DROP TABLE IF EXISTS _covered_patterns"),{created:l,skipped:s}}async function $e(e,n){if(Sn(n.format)==="rvf"){let a=O(e,{readonly:!0});try{return xe(a,{outputPath:n.outputPath,domains:n.domains},e)}finally{a.close()}}let t=O(e,{readonly:!0});try{return we(t,n,e)}finally{t.close()}}async function Me(e,n,r){if(je(n,r.format)==="rvf"){let s=O(e);try{return Ce(s,n,{mergeStrategy:r.mergeStrategy,dryRun:r.dryRun})}finally{s.close()}}let a=O(e);try{return ve(a,n,r)}finally{a.close()}}async function qe(e,n){return je(e,n)==="rvf"?K(e):Re(e)}async function Le(e,n,r={}){return Oe(e,n,r)}async function Fe(e,n={}){return De(e,n)}async function Pe(e){let n=O(e);try{let r=ge(n,pe());return await r.initialize(),Te(n,r)}finally{n.close()}}function Sn(e){if(e==="jsonl")return"jsonl";if(e==="rvf"){if(!re())throw new Error("RVF format requested but @ruvector/rvf-node is not available on this platform. Use --format jsonl instead.");return"rvf"}return re()?"rvf":"jsonl"}function je(e,n){return n==="rvf"?"rvf":n==="jsonl"?"jsonl":e.endsWith(".rvf")?"rvf":"jsonl"}var de=class{name="brain";description="Export, import, and inspect QE brain state";cleanupAndExit;ensureInitialized;constructor(n,r){this.cleanupAndExit=n,this.ensureInitialized=r}register(n,r){let t=n.command("brain").description(this.description);t.command("export").description("Export brain state to a portable directory").requiredOption("-o, --output <path>","Output directory path").option("--format <format>","Export format: rvf (default) or jsonl","rvf").option("--db <path>","Source database path").action(async a=>{await this.executeExport(a)}),t.command("import").description("Import brain state from an export directory").requiredOption("-i, --input <path>","Path to brain export directory").option("--strategy <strategy>","Merge strategy","skip-conflicts").option("--dry-run","Preview import without writing",!1).option("--db <path>","Target database path").action(async a=>{await this.executeImport(a)}),t.command("info").description("Show manifest info for a brain export").requiredOption("-i, --input <path>","Path to brain export directory").action(async a=>{await this.executeInfo(a)}),t.command("witness-backfill").description("Create witness chain entries for patterns that predate the witness chain").option("--db <path>","Database path").action(async a=>{await this.executeWitnessBackfill(a)}),t.command("diff").description("Compare two brain exports (JSONL directory or .rvf file)").argument("<a>","Path to first brain export").argument("<b>","Path to second brain export").option("--table <name>","Restrict comparison to a single table").option("--verbose","Show the IDs of added/removed/changed records",!1).option("--json","Emit the diff as JSON to stdout",!1).action(async(a,s,l)=>{await this.executeDiff(a,s,l)}),t.command("search").description("Search a JSONL brain export with filters").requiredOption("-i, --input <path>","Path to brain export directory (JSONL)").option("--table <name>","Table to search (default: qe_patterns)").option("--domain <name...>","Restrict to one or more domains").option("--pattern-type <type>","Restrict to a specific pattern_type (qe_patterns only)").option("--since <iso>","Include rows with timestamp \u2265 <iso>").option("--until <iso>","Include rows with timestamp \u2264 <iso>").option("-q, --query <text>","Substring match across name + description (case-insensitive)").option("-l, --limit <n>","Maximum results to return","20").option("--json","Emit results as JSON to stdout",!1).action(async a=>{await this.executeSearch(a)})}async executeExport(n){try{console.log(o.blue(`
-  Exporting brain state (format: ${n.format})...
-`));let r=await se(n.db),t=await $e(r,{outputPath:B.resolve(n.output),format:n.format});if(console.log(o.green("  Export complete.")),console.log(`  Format:   ${o.cyan("format"in t?t.format??"jsonl":"jsonl")}`),console.log(`  Patterns: ${o.cyan(t.stats.patternCount)}`),"embeddingCount"in t.stats?console.log(`  Vectors:  ${o.cyan(t.stats.embeddingCount)}`):"vectorCount"in t.stats&&console.log(`  Vectors:  ${o.cyan(t.stats.vectorCount)}`),"rvfStatus"in t){let a=t.rvfStatus;console.log(`  RVF Size: ${o.cyan(Ve(a.fileSizeBytes))}`),console.log(`  Segments: ${o.cyan(a.totalSegments)}`)}console.log(`  Checksum: ${o.gray(t.checksum)}`),console.log(`  Output:   ${o.cyan(B.resolve(n.output))}`),console.log(""),await this.cleanupAndExit(0)}catch(r){console.error(o.red(`
-  Brain export failed:`),r),await this.cleanupAndExit(1)}}async executeImport(n){try{n.dryRun?console.log(o.yellow(`
-  Dry-run mode \u2014 no data will be written.
-`)):console.log(o.blue(`
-  Importing brain state...
-`));let r=await se(n.db),t=await Me(r,B.resolve(n.input),{mergeStrategy:n.strategy,dryRun:n.dryRun});console.log(o.green("  Import complete.")),console.log(`  Imported:  ${o.cyan(t.imported)}`),console.log(`  Skipped:   ${o.yellow(t.skipped)}`),console.log(`  Conflicts: ${o.red(t.conflicts)}`),"embeddingsRestored"in t&&console.log(`  Embeddings: ${o.cyan(t.embeddingsRestored)}`),console.log(""),await this.cleanupAndExit(0)}catch(r){console.error(o.red(`
-  Brain import failed:`),r),await this.cleanupAndExit(1)}}async executeInfo(n){try{console.log(o.blue(`
-  Brain Export Info
-`));let r=B.resolve(n.input),t=await qe(r),a="format"in t?t.format??"jsonl":"jsonl";if(console.log(`  Version:       ${o.cyan(t.version)}`),console.log(`  Format:        ${o.cyan(a)}`),console.log(`  Exported:      ${o.cyan(t.exportedAt)}`),console.log(`  Source DB:     ${o.cyan(t.sourceDb)}`),console.log(o.blue(`
-  Learning Data:`)),console.log(`    Patterns:      ${o.cyan(t.stats.patternCount)}`),"qValueCount"in t.stats&&console.log(`    Q-Values:      ${o.cyan(t.stats.qValueCount)}`),"dreamInsightCount"in t.stats){let i=t.stats.dreamInsightCount,c=("tableRecordCounts"in t?t.tableRecordCounts:void 0)?.dream_cycles,u=c!==void 0?` (${c} cycles)`:"";console.log(`    Dream Insights: ${o.cyan(i)}${o.gray(u)}`)}"witnessChainLength"in t.stats&&console.log(`    Witness Chain:  ${o.cyan(t.stats.witnessChainLength)} entries`),"embeddingCount"in t.stats?console.log(`    Embeddings:    ${o.cyan(t.stats.embeddingCount)}`):"vectorCount"in t.stats&&console.log(`    Vectors:       ${o.cyan(t.stats.vectorCount)}`);let s="tableRecordCounts"in t?t.tableRecordCounts:void 0;if(s){let i=Object.entries(s).filter(([d,c])=>c>0&&!["qe_patterns","rl_q_values","dream_insights","dream_cycles","witness_chain","vectors","qe_pattern_embeddings"].includes(d));if(i.length>0)for(let[d,c]of i){let p=`${d.replace(/_/g," ").replace(/\b\w/g,f=>f.toUpperCase())}:`.padEnd(15);console.log(`    ${p}${o.cyan(c)}`)}}let l="totalRecords"in t.stats?t.stats.totalRecords:void 0;if(l!==void 0&&(console.log(o.blue(`
-  Summary:`)),console.log(`    Total Records: ${o.cyan(l)}`)),"domains"in t&&Array.isArray(t.domains)&&t.domains.length>0&&(l||console.log(o.blue(`
-  Summary:`)),console.log(`    Domains:       ${o.cyan(t.domains.join(", "))}`)),"rvfStatus"in t){let i=t.rvfStatus;console.log(o.blue(`
-  RVF Details:`)),console.log(`    File Size:     ${o.cyan(Ve(i.fileSizeBytes))}`),console.log(`    Vectors:       ${o.cyan(i.totalVectors)}`),console.log(`    Segments:      ${o.cyan(i.totalSegments)}`)}if("lineage"in t){let i=t.lineage;i&&(console.log(o.blue(`
-  Lineage:`)),console.log(`    File ID:       ${o.cyan(i.fileId)}`),console.log(`    Parent ID:     ${o.cyan(i.parentId??"none (root)")}`),console.log(`    Depth:         ${o.cyan(i.lineageDepth)}`))}if("signature"in t){let i=t.signature,d=t.signerKeyId;console.log(o.blue(`
-  Signature:`)),i?(console.log(`    Status:        ${o.green("Signed")}`),console.log(`    Key ID:        ${o.cyan(d??"unknown")}`),console.log(`    Signature:     ${o.gray(i.slice(0,32)+"...")}`)):console.log(`    Status:        ${o.yellow("Unsigned")}`)}console.log(`
-  Checksum:      ${o.gray(t.checksum)}`),console.log(""),await this.cleanupAndExit(0)}catch(r){console.error(o.red(`
-  Failed to read brain info:`),r),await this.cleanupAndExit(1)}}async executeDiff(n,r,t){try{let a=await Le(B.resolve(n),B.resolve(r),{tableFilter:t.table});if(t.json){process.stdout.write(JSON.stringify(a,null,2)+`
-`),await this.cleanupAndExit(a.identical?0:1);return}En(a,t.verbose),await this.cleanupAndExit(a.identical?0:1)}catch(a){console.error(o.red(`
-  Brain diff failed:`),a),await this.cleanupAndExit(2)}}async executeSearch(n){try{let r=xn(n.limit),t=Cn(n.domain),a=await Fe(B.resolve(n.input),{table:n.table,domains:t,patternType:n.patternType,since:n.since,until:n.until,query:n.query,limit:r});if(n.json){process.stdout.write(JSON.stringify(a,null,2)+`
-`),await this.cleanupAndExit(a.totalMatched>0?0:3);return}In(a),await this.cleanupAndExit(a.totalMatched>0?0:3)}catch(r){console.error(o.red(`
-  Brain search failed:`),r),await this.cleanupAndExit(2)}}async executeWitnessBackfill(n){try{console.log(o.blue(`
-  Running witness chain backfill...
-`));let r=await se(n.db),t=await Pe(r);console.log(o.green("  Backfill complete.")),console.log(`  Created: ${o.cyan(t.created)} new witness entries`),console.log(`  Skipped: ${o.cyan(t.skipped)} (already witnessed)`),console.log(""),await this.cleanupAndExit(0)}catch(r){console.error(o.red(`
-  Witness backfill failed:`),r),await this.cleanupAndExit(1)}}getHelp(){return`
-Export, import, and inspect QE brain state.
-
-Formats:
-  rvf   \u2014 Single portable .rvf file (default, requires @ruvector/rvf-node)
-  jsonl \u2014 JSONL directory format (fallback when native not available)
-
-Usage:
-  aqe brain export -o brain.rvf [--format rvf] [--db <path>]
-  aqe brain export -o ./brain-dir --format jsonl [--db <path>]
-  aqe brain import -i brain.rvf [--strategy skip-conflicts] [--dry-run] [--db <path>]
-  aqe brain info -i brain.rvf
-
-Subcommands:
-  export    Export brain state to a portable .rvf file or JSONL directory
-  import    Import a brain export into the local database
-  info      Show manifest metadata for an existing brain export
-  diff      Compare two brain exports (manifest always; record-level for JSONL)
-  search    Filtered search over a JSONL brain export
-
-Examples:
-  aqe brain export -o .agentic-qe/brain.rvf
-  aqe brain export -o .agentic-qe/brain.rvf --format rvf
-  aqe brain export -o ./brain-export --format jsonl
-  aqe brain import -i .agentic-qe/brain.rvf --strategy latest-wins
-  aqe brain import -i .agentic-qe/brain.rvf --dry-run
-  aqe brain info -i .agentic-qe/brain.rvf
-  aqe brain diff ./brain-a ./brain-b --verbose
-  aqe brain search -i ./brain-export --query oauth --domain test-generation
-  aqe brain search -i ./brain-export --since 2026-03-01 --limit 50 --json
-`}};async function se(e){if(e)return e;let{findProjectRoot:n}=await import("./unified-memory-PXOQ4N53.js");return B.join(n(),".agentic-qe","memory.db")}function Ve(e){return e<1024?`${e} B`:e<1024*1024?`${(e/1024).toFixed(1)} KB`:`${(e/(1024*1024)).toFixed(1)} MB`}function xn(e){let n=Number.parseInt(e,10);return!Number.isFinite(n)||n<1?20:n}function Cn(e){if(e===void 0)return;let n=Array.isArray(e)?e:[e],r=[];for(let t of n)for(let a of t.split(",")){let s=a.trim();s&&r.push(s)}return r.length>0?r:void 0}function En(e,n){console.log(o.blue(`
-  Brain Diff
-`)),console.log(`  A:            ${o.cyan(e.pathA)}  (${e.formatA})`),console.log(`  B:            ${o.cyan(e.pathB)}  (${e.formatB})`),console.log(`  Versions:     ${o.cyan(e.manifestA.version)} \u2192 ${o.cyan(e.manifestB.version)}`+(e.versionMatch?o.gray(" (match)"):o.yellow(" (differ)"))),console.log(`  Checksums:    ${o.gray(e.manifestA.checksum.slice(0,12))}\u2026 \u2192 ${o.gray(e.manifestB.checksum.slice(0,12))}\u2026`+(e.checksumMatch?o.gray(" (match)"):o.yellow(" (differ)"))),console.log(`  Exported:     ${o.gray(e.manifestA.exportedAt)} \u2192 ${o.gray(e.manifestB.exportedAt)}`),console.log(`  Records:      ${o.cyan(e.manifestA.totalRecords)} \u2192 ${o.cyan(e.manifestB.totalRecords)} `+Je(e.manifestB.totalRecords-e.manifestA.totalRecords)),(e.domainsOnlyInA.length>0||e.domainsOnlyInB.length>0)&&(console.log(o.blue(`
-  Domains:`)),e.domainsOnlyInA.length>0&&console.log(`    Only in A: ${o.yellow(e.domainsOnlyInA.join(", "))}`),e.domainsOnlyInB.length>0&&console.log(`    Only in B: ${o.yellow(e.domainsOnlyInB.join(", "))}`)),e.recordLevel||console.log(o.gray(`
-  Note: record-level diff is only available when both sides are JSONL exports.
-        Per-table counts shown below; re-export with --format jsonl for added/removed/changed IDs.`)),console.log(o.blue(`
-  Tables:`));let r=e.tableDiffs.filter(Bn);if(r.length===0)console.log(o.gray("    (no differences)"));else for(let t of r)console.log(`    ${t.tableName.padEnd(28)} ${o.cyan(String(t.countA).padStart(7))} \u2192 ${o.cyan(String(t.countB).padStart(7))} ${Je(t.delta)}`+_n(t,n)),n&&(t.added&&t.added.length>0&&le("added",t.added),t.removed&&t.removed.length>0&&le("removed",t.removed),t.changed&&t.changed.length>0&&le("changed",t.changed));console.log(""),e.identical?console.log(o.green(`  Result: identical
-`)):console.log(o.yellow(`  Result: differences found
-`))}function Bn(e){return!!(e.delta!==0||e.added&&e.added.length>0||e.removed&&e.removed.length>0||e.changed&&e.changed.length>0)}function Je(e){return e===0?o.gray("(\xB10)"):e>0?o.green(`(+${e})`):o.red(`(${e})`)}function _n(e,n){let r=[];return e.added&&e.added.length>0&&r.push(o.green(`+${e.added.length}`)),e.removed&&e.removed.length>0&&r.push(o.red(`-${e.removed.length}`)),e.changed&&e.changed.length>0&&r.push(o.yellow(`~${e.changed.length}`)),r.length===0?"":n?"  "+r.join(" "):"  "+o.gray("[")+r.join(" ")+o.gray("]")}function le(e,n){let r=n.slice(0,10).join(", "),t=n.length>10?o.gray(` \u2026(+${n.length-10} more)`):"";console.log(`      ${o.gray(e+":")} ${r}${t}`)}function In(e){if(console.log(o.blue(`
-  Brain Search
-`)),console.log(`  Input:      ${o.cyan(e.inputPath)}`),console.log(`  Table:      ${o.cyan(e.table)}`),console.log(`  Scanned:    ${o.cyan(e.totalScanned)}    Matched: ${o.cyan(e.totalMatched)}    Shown: ${o.cyan(e.hits.length)}`+(e.truncated?o.yellow(` (truncated to limit ${e.limit})`):"")),e.hits.length===0){console.log(o.yellow(`
-  No matching rows.
-`));return}console.log("");for(let n of e.hits){let r=o.cyan(n.id)+(n.display.patternType?o.gray(`  ${n.display.patternType}`):"")+(n.display.domain?o.gray(`  [${n.display.domain}]`):"")+(n.display.confidence!==void 0?o.gray(`  conf=${n.display.confidence.toFixed(2)}`):"");if(console.log(`  ${r}`),n.display.name&&console.log(`    ${o.bold(n.display.name)}`),n.display.description){let t=n.display.description.length>200?n.display.description.slice(0,200)+"\u2026":n.display.description;console.log(`    ${o.gray(t)}`)}n.display.updatedAt&&console.log(`    ${o.gray(n.display.updatedAt)}`),console.log("")}}function dt(e,n){return new de(e,n)}export{de as BrainHandler,dt as createBrainHandler};

package/dist/cli/chunks/browser-workflow-XTKUHTIT.js

@@ -1,2 +0,0 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.12.2");process.exit(0)}
-import{a}from"./chunk-B7DI76SY.js";import"./chunk-LIAW5FD7.js";import"./chunk-ZHWXI4SK.js";import"./chunk-APVXTHTA.js";import"./chunk-AL5QT6OX.js";import"./chunk-YY4KXDI6.js";import"./chunk-R5HC6JVJ.js";import"./chunk-ACDZ2CRV.js";import"./chunk-CKFZOPZN.js";import"./chunk-P65S7AZA.js";import"./chunk-X47GHZY3.js";import"./chunk-ZBYMF2QJ.js";import"./chunk-ERQL3D2O.js";import"./chunk-WRMUQVKY.js";import"./chunk-UF3YOGHV.js";import"./chunk-V2QYW5KW.js";import"./chunk-4KEOBDEI.js";import"./chunk-C7VNQ4PY.js";import"./chunk-QYST2TZW.js";import"./chunk-YZ44FUVJ.js";import"./chunk-YDZIPP3Y.js";import"./chunk-CTFW7CMI.js";import"./chunk-HU6ETNA7.js";export{a as BrowserWorkflowTool};

package/dist/cli/chunks/chunk-ABHKXMOJ.js

@@ -1,2 +0,0 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.12.2");process.exit(0)}
-var r={claude:"metered-api","claude-code":"subscription",openai:"metered-api",openrouter:"metered-api",gemini:"metered-api","azure-openai":"metered-api",bedrock:"metered-api",cognitum:"metered-capped",ollama:"local"};function o(e){return e.billingMode??r[e.type]??"metered-api"}function n(e){return r[e]??"metered-api"}function t(e,i){switch(i){case"metered-api":return`\u26A0\uFE0F  LLM provider "${e}" bills a pay-per-token API key (not your Claude subscription) and has no server-side spend cap. Set a budget with --max-budget-usd / AQE_MAX_BUDGET_USD, or use AQE_LLM_PROVIDER=claude-code to run on your Claude Code subscription instead.`;case"metered-capped":return`\u2139\uFE0F  LLM provider "${e}" bills per-token but enforces a server-side hard spend cap; it will pause at the cap rather than overspend.`;case"subscription":return`\u2139\uFE0F  LLM provider "${e}" runs on your Claude Code subscription (shared plan usage). Worst case is hitting your plan's rate limit and pausing \u2014 no per-token API charges.`;case"local":return}}export{o as a,n as b,t as c};

package/dist/cli/chunks/chunk-CDMAVNV5.js

@@ -1,2 +0,0 @@
-import{createRequire as __cr}from"module";const require=__cr(import.meta.url);if(process.argv.includes('--version')||process.argv.includes('-v')){console.log("3.12.2");process.exit(0)}
-import{createRequire as t}from"module";var o=t(import.meta.url),e=o("@huggingface/transformers"),n=e,{RuvectorLayer:i,TensorCompress:a,differentiableSearch:c,hierarchicalForward:s,getCompressionLevel:l,init:p,FlashAttention:m,DotProductAttention:u,MultiHeadAttention:d,HyperbolicAttention:f,LinearAttention:A,MoEAttention:g,SonaEngine:h,pipeline:_}=e||{};export{n as a,i as b,a as c,c as d,s as e,l as f,p as g,m as h,u as i,d as j,f as k,A as l,g as m,h as n,_ as o};