agentic-qe 3.11.3 → 3.11.5

package/dist/integrations/ruvector/proof-gate.js

@@ -0,0 +1,135 @@
+/**
+ * Tamper-evident hash-chain audit gate — a faithful, dependency-free TypeScript
+ * port of RuVector's `ruvector-proof-gate` `HashChainGate` (upstream ADR-194;
+ * AQE-side integration decision: ADR-116).
+ *
+ * Why ported rather than bound: the Rust crate ships no NAPI/WASM binding, and
+ * the algorithm is small and exact. This uses only Node's `crypto` (no native
+ * dep) and opens NO database — the chain lives in memory and is serialized via
+ * {@link HashChainGate.toJSON}/{@link HashChainGate.fromJSON} so a caller can
+ * persist it through the existing unified `memory.db` (never a competing store).
+ *
+ * QE use-case: turn AQE's "verify row counts BEFORE and AFTER, never claim a
+ * sync/migration succeeded without proof" mandate into a cryptographic
+ * guarantee. Admit one payload per DB operation (table, op, row-count, content
+ * digest); a later `verifyIntegrity()` proves no admitted entry was mutated,
+ * reordered, or dropped.
+ *
+ * Commitment: commitment[n] = SHA256("ruvector:chain:" || commitment[n-1] ||
+ * payload_hash[n] || u64le(n)), seeded from a fixed genesis. Verification is
+ * O(n): replay from genesis. (Genesis differs from the Rust literal — we do not
+ * interoperate with Rust receipts, only self-verify.)
+ */
+import { createHash } from 'node:crypto';
+const CHAIN_TAG = Buffer.from('ruvector:chain:');
+/** Re-derivation anchor. Self-consistent; not byte-compatible with the Rust crate. */
+const GENESIS = createHash('sha256').update('ruvector-proof-gate-v1').digest();
+function u64le(n) {
+    const b = Buffer.alloc(8);
+    b.writeBigUInt64LE(BigInt(n));
+    return b;
+}
+/** Deterministic, key-sorted serialization so equal payloads hash equally. */
+function canonicalBytes(payload) {
+    if (typeof payload === 'string')
+        return Buffer.from(payload, 'utf8');
+    if (payload instanceof Uint8Array)
+        return Buffer.from(payload);
+    return Buffer.from(canonicalJson(payload), 'utf8');
+}
+function canonicalJson(value) {
+    if (value === null || typeof value !== 'object')
+        return JSON.stringify(value) ?? 'null';
+    if (Array.isArray(value))
+        return `[${value.map(canonicalJson).join(',')}]`;
+    const keys = Object.keys(value).sort();
+    return `{${keys.map((k) => `${JSON.stringify(k)}:${canonicalJson(value[k])}`).join(',')}}`;
+}
+function sha256(...parts) {
+    const h = createHash('sha256');
+    for (const p of parts)
+        h.update(p);
+    return h.digest();
+}
+function commitmentOf(prev, payloadHash, seq) {
+    return sha256(CHAIN_TAG, prev, payloadHash, u64le(seq));
+}
+/**
+ * Sequential SHA-256 hash chain. O(1) per `admit`, O(n) `verifyIntegrity`.
+ * In-memory; persist/restore via {@link toJSON}/{@link fromJSON}.
+ */
+export class HashChainGate {
+    seq = 0;
+    prev = GENESIS;
+    chain = [];
+    payloadHashes = [];
+    /** Admit a payload; returns a receipt committing the chain state. */
+    admit(payload) {
+        const payloadHash = sha256(canonicalBytes(payload));
+        const commitment = commitmentOf(this.prev, payloadHash, this.seq);
+        this.prev = commitment;
+        this.chain.push(commitment);
+        this.payloadHashes.push(payloadHash);
+        const receipt = {
+            sequence: this.seq,
+            payloadHash: payloadHash.toString('hex'),
+            chainCommitment: commitment.toString('hex'),
+        };
+        this.seq += 1;
+        return receipt;
+    }
+    /** True iff `receipt` matches the commitment recorded at its sequence. */
+    verifyReceipt(receipt) {
+        return (receipt.sequence >= 0 &&
+            receipt.sequence < this.chain.length &&
+            this.chain[receipt.sequence].toString('hex') === receipt.chainCommitment);
+    }
+    /** Current chain head (hex). Changes after every successful `admit`. */
+    chainRoot() {
+        return this.prev.toString('hex');
+    }
+    get length() {
+        return this.seq;
+    }
+    get isEmpty() {
+        return this.seq === 0;
+    }
+    /**
+     * Full cryptographic re-derivation from genesis. Returns false if ANY
+     * commitment fails to re-derive — catches a mutated commitment, a mutated
+     * payload hash, a reorder, or a length mismatch.
+     */
+    verifyIntegrity() {
+        if (this.chain.length !== this.payloadHashes.length)
+            return false;
+        let prev = GENESIS;
+        for (let i = 0; i < this.chain.length; i++) {
+            const expected = commitmentOf(prev, this.payloadHashes[i], i);
+            if (!expected.equals(this.chain[i]))
+                return false;
+            prev = this.chain[i];
+        }
+        return prev.equals(this.prev);
+    }
+    /** Snapshot for persistence through the unified store (no DB opened here). */
+    toJSON() {
+        return {
+            seq: this.seq,
+            head: this.prev.toString('hex'),
+            chain: this.chain.map((c) => c.toString('hex')),
+            payloadHashes: this.payloadHashes.map((p) => p.toString('hex')),
+        };
+    }
+    /** Restore a chain from a {@link toJSON} snapshot. */
+    static fromJSON(state) {
+        const g = new HashChainGate();
+        g.seq = state.seq;
+        g.prev = Buffer.from(state.head, 'hex');
+        for (const c of state.chain)
+            g.chain.push(Buffer.from(c, 'hex'));
+        for (const p of state.payloadHashes)
+            g.payloadHashes.push(Buffer.from(p, 'hex'));
+        return g;
+    }
+}
+//# sourceMappingURL=proof-gate.js.map

package/dist/integrations/ruvector/sona-persistence.d.ts

@@ -194,6 +194,11 @@ export declare class PersistentSONAEngine {
      * @returns Adaptation result, or null if three-loop engine not initialized
      */
     instantAdapt(requestFeatures: number[]): import('./sona-three-loop.js').AdaptationResult | null;
+    /**
+     * Get the three-loop engine's current request count (A10), or null if the
+     * three-loop engine is not active.
+     */
+    getRequestCount(): number | null;
     /**
      * Record the outcome of a request for REINFORCE-style gradient estimation (Loop 1b).
      *
@@ -356,6 +361,25 @@ export declare class PersistentSONAEngine {
      * @returns true if a row was deleted
      */
     deleteFisherMatrix(domain: string): boolean;
+    /**
+     * A10 fix: persist the three-loop engine's request counter independently
+     * of the Fisher row, in kv_store (namespace 'sona'). Consolidation (the
+     * thing that writes the FIRST Fisher row) requires requestCount to reach
+     * consolidationInterval — but requestCount previously only survived via
+     * restoreFisher(), which only runs once a Fisher row already exists.
+     * Fresh short-lived CLI/MCP processes doing ~1 instantAdapt() each could
+     * never accumulate past the threshold: cold-start deadlock. This lets the
+     * counter accumulate across process restarts before any consolidation
+     * has ever happened.
+     */
+    saveRequestCount(domain: string, requestCount: number): void;
+    /** Load the persisted request counter for a domain, or null if never saved. */
+    loadRequestCount(domain: string): number | null;
+    /**
+     * Internal variant of loadRequestCount that skips ensureInitialized() —
+     * used during _doInitialize(), mirroring _loadFisherMatrixUnsafe.
+     */
+    private _loadRequestCountUnsafe;
     /**
      * Set or update the server client for cross-process pattern sharing
      */

package/dist/integrations/ruvector/sona-persistence.js

@@ -187,6 +187,23 @@ export class PersistentSONAEngine {
                         });
                     }
                 }
+                else {
+                    // A10 fix: no Fisher row exists yet (the common case pre-first-
+                    // consolidation), but the request counter may still have
+                    // accumulated across prior short-lived processes — restore it
+                    // independently so it isn't reset to 0 every time.
+                    const savedCount = this._loadRequestCountUnsafe(this.config.domain);
+                    if (savedCount !== null) {
+                        const engine = this.baseEngine.getThreeLoopEngine();
+                        if (engine) {
+                            engine.restoreRequestCount(savedCount);
+                            logger.info('Three-loop engine restored request count independently of Fisher state', {
+                                domain: this.config.domain,
+                                requestCount: savedCount,
+                            });
+                        }
+                    }
+                }
                 logger.info('Three-loop engine initialized with Fisher persistence', {
                     domain: this.config.domain,
                 });
@@ -569,6 +586,14 @@ export class PersistentSONAEngine {
         this.ensureInitialized();
         return this.baseEngine.instantAdapt(requestFeatures);
     }
+    /**
+     * Get the three-loop engine's current request count (A10), or null if the
+     * three-loop engine is not active.
+     */
+    getRequestCount() {
+        this.ensureInitialized();
+        return this.baseEngine.getThreeLoopEngine()?.getRequestCount() ?? null;
+    }
     /**
      * Record the outcome of a request for REINFORCE-style gradient estimation (Loop 1b).
      *
@@ -771,6 +796,19 @@ export class PersistentSONAEngine {
             }
             this.pendingSaves.clear();
         }
+        // A10 fix: checkpoint the request counter once per process lifetime
+        // (cheap — not on the instantAdapt hot path) so short-lived CLI/MCP
+        // processes accumulate progress toward consolidationInterval instead of
+        // resetting to 0 every time.
+        try {
+            const engine = this.baseEngine.getThreeLoopEngine();
+            if (engine && this.db) {
+                this.saveRequestCount(this.config.domain, engine.getRequestCount());
+            }
+        }
+        catch (err) {
+            console.warn('[PersistentSONAEngine] Request count checkpoint failed:', err instanceof Error ? err.message : err);
+        }
         this.prepared.clear();
         this.db = null;
         this.persistence = null;
@@ -866,6 +904,44 @@ export class PersistentSONAEngine {
         const result = stmt.run(domain);
         return result.changes > 0;
     }
+    /**
+     * A10 fix: persist the three-loop engine's request counter independently
+     * of the Fisher row, in kv_store (namespace 'sona'). Consolidation (the
+     * thing that writes the FIRST Fisher row) requires requestCount to reach
+     * consolidationInterval — but requestCount previously only survived via
+     * restoreFisher(), which only runs once a Fisher row already exists.
+     * Fresh short-lived CLI/MCP processes doing ~1 instantAdapt() each could
+     * never accumulate past the threshold: cold-start deadlock. This lets the
+     * counter accumulate across process restarts before any consolidation
+     * has ever happened.
+     */
+    saveRequestCount(domain, requestCount) {
+        if (!this.db)
+            return;
+        this.db.prepare(`
+      INSERT INTO kv_store (namespace, key, value)
+      VALUES ('sona', ?, ?)
+      ON CONFLICT(namespace, key) DO UPDATE SET value = excluded.value
+    `).run(`request-count:${domain}`, String(requestCount));
+    }
+    /** Load the persisted request counter for a domain, or null if never saved. */
+    loadRequestCount(domain) {
+        this.ensureInitialized();
+        return this._loadRequestCountUnsafe(domain);
+    }
+    /**
+     * Internal variant of loadRequestCount that skips ensureInitialized() —
+     * used during _doInitialize(), mirroring _loadFisherMatrixUnsafe.
+     */
+    _loadRequestCountUnsafe(domain) {
+        if (!this.db)
+            return null;
+        const row = this.db.prepare(`SELECT value FROM kv_store WHERE namespace = 'sona' AND key = ?`).get(`request-count:${domain}`);
+        if (!row)
+            return null;
+        const parsed = Number(row.value);
+        return Number.isFinite(parsed) ? parsed : null;
+    }
     // ==========================================================================
     // Server Integration
     // ==========================================================================

package/dist/integrations/ruvector/sona-three-loop.d.ts

@@ -335,6 +335,21 @@ export declare class SONAThreeLoopEngine {
     getEffectiveWeights(): Float32Array;
     /** Get the total number of requests processed */
     getRequestCount(): number;
+    /**
+     * Restore the request counter independently of Fisher state (A10 fix).
+     *
+     * Previously requestCount only survived process restarts via
+     * restoreFisher(), which only runs `if (saved)` — i.e. only after a
+     * Fisher row already exists. Since consolidation (the thing that WRITES
+     * the first Fisher row) requires requestCount to reach
+     * consolidationInterval (default 100), and each CLI/MCP invocation is a
+     * fresh short-lived process doing ~1 instantAdapt() call, requestCount
+     * could never accumulate across processes: cold-start deadlock, 0 rows
+     * in sona_fisher_matrices forever. Call this at init (independently of
+     * whether a Fisher row exists) so the counter accumulates across process
+     * restarts even before the first consolidation ever happens.
+     */
+    restoreRequestCount(count: number): void;
     /** Get the engine configuration */
     getConfig(): ThreeLoopConfig;
     /** Get the connected peer states */

package/dist/integrations/ruvector/sona-three-loop.js

@@ -712,6 +712,23 @@ export class SONAThreeLoopEngine {
     getRequestCount() {
         return this.requestCount;
     }
+    /**
+     * Restore the request counter independently of Fisher state (A10 fix).
+     *
+     * Previously requestCount only survived process restarts via
+     * restoreFisher(), which only runs `if (saved)` — i.e. only after a
+     * Fisher row already exists. Since consolidation (the thing that WRITES
+     * the first Fisher row) requires requestCount to reach
+     * consolidationInterval (default 100), and each CLI/MCP invocation is a
+     * fresh short-lived process doing ~1 instantAdapt() call, requestCount
+     * could never accumulate across processes: cold-start deadlock, 0 rows
+     * in sona_fisher_matrices forever. Call this at init (independently of
+     * whether a Fisher row exists) so the counter accumulates across process
+     * restarts even before the first consolidation ever happens.
+     */
+    restoreRequestCount(count) {
+        this.requestCount = count;
+    }
     /** Get the engine configuration */
     getConfig() {
         return { ...this.config };

package/dist/kernel/unified-memory-schemas.d.ts

@@ -7,12 +7,12 @@
 import { HYPERGRAPH_SCHEMA } from '../migrations/20260120_add_hypergraph_tables.js';
 import { PATTERN_NULLS_SCHEMA } from '../migrations/20260611_add_pattern_nulls_table.js';
 export { HYPERGRAPH_SCHEMA, PATTERN_NULLS_SCHEMA };
-export declare const SCHEMA_VERSION = 10;
+export declare const SCHEMA_VERSION = 11;
 export declare const SCHEMA_VERSION_TABLE = "\n  CREATE TABLE IF NOT EXISTS schema_version (\n    id INTEGER PRIMARY KEY CHECK (id = 1),\n    version INTEGER NOT NULL,\n    migrated_at TEXT DEFAULT (datetime('now'))\n  );\n";
 export declare const KV_STORE_SCHEMA = "\n  -- Key-Value Store (v2 compatible - same schema as HybridBackend)\n  CREATE TABLE IF NOT EXISTS kv_store (\n    key TEXT NOT NULL,\n    namespace TEXT NOT NULL,\n    value TEXT NOT NULL,\n    expires_at INTEGER,\n    created_at INTEGER DEFAULT (strftime('%s', 'now') * 1000),\n    PRIMARY KEY (namespace, key)\n  );\n  CREATE INDEX IF NOT EXISTS idx_kv_namespace ON kv_store(namespace);\n  CREATE INDEX IF NOT EXISTS idx_kv_expires ON kv_store(expires_at) WHERE expires_at IS NOT NULL;\n";
 export declare const VECTORS_SCHEMA = "\n  -- Vector Embeddings (new in v3 - replaces in-memory AgentDB)\n  CREATE TABLE IF NOT EXISTS vectors (\n    id TEXT PRIMARY KEY,\n    namespace TEXT NOT NULL DEFAULT 'default',\n    embedding BLOB NOT NULL,\n    dimensions INTEGER NOT NULL,\n    metadata TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now'))\n  );\n  CREATE INDEX IF NOT EXISTS idx_vectors_namespace ON vectors(namespace);\n  CREATE INDEX IF NOT EXISTS idx_vectors_dimensions ON vectors(dimensions);\n";
 export declare const RL_QVALUES_SCHEMA = "\n  -- Q-Values for RL algorithms (ADR-046)\n  CREATE TABLE IF NOT EXISTS rl_q_values (\n    id TEXT PRIMARY KEY,\n    algorithm TEXT NOT NULL,\n    agent_id TEXT NOT NULL,\n    state_key TEXT NOT NULL,\n    action_key TEXT NOT NULL,\n    q_value REAL NOT NULL DEFAULT 0.0,\n    visits INTEGER NOT NULL DEFAULT 0,\n    last_reward REAL,\n    domain TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now')),\n    UNIQUE(algorithm, agent_id, state_key, action_key)\n  );\n  CREATE INDEX IF NOT EXISTS idx_qvalues_agent ON rl_q_values(agent_id);\n  CREATE INDEX IF NOT EXISTS idx_qvalues_algorithm ON rl_q_values(algorithm);\n  CREATE INDEX IF NOT EXISTS idx_qvalues_state ON rl_q_values(agent_id, state_key);\n  CREATE INDEX IF NOT EXISTS idx_qvalues_domain ON rl_q_values(domain);\n  CREATE INDEX IF NOT EXISTS idx_qvalues_updated ON rl_q_values(updated_at);\n";
-export declare const GOAP_SCHEMA = "\n  -- GOAP Goals\n  CREATE TABLE IF NOT EXISTS goap_goals (\n    id TEXT PRIMARY KEY,\n    name TEXT NOT NULL,\n    description TEXT,\n    conditions TEXT NOT NULL,\n    priority INTEGER DEFAULT 3,\n    qe_domain TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- GOAP Actions\n  CREATE TABLE IF NOT EXISTS goap_actions (\n    id TEXT PRIMARY KEY,\n    name TEXT NOT NULL,\n    description TEXT,\n    agent_type TEXT NOT NULL,\n    preconditions TEXT NOT NULL,\n    effects TEXT NOT NULL,\n    cost REAL DEFAULT 1.0,\n    estimated_duration_ms INTEGER,\n    success_rate REAL DEFAULT 1.0,\n    execution_count INTEGER DEFAULT 0,\n    category TEXT NOT NULL,\n    qe_domain TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- GOAP Plans\n  CREATE TABLE IF NOT EXISTS goap_plans (\n    id TEXT PRIMARY KEY,\n    goal_id TEXT,\n    initial_state TEXT NOT NULL,\n    goal_state TEXT NOT NULL,\n    action_sequence TEXT NOT NULL,\n    total_cost REAL,\n    estimated_duration_ms INTEGER,\n    status TEXT DEFAULT 'pending',\n    reused_from TEXT,\n    similarity_score REAL,\n    created_at TEXT DEFAULT (datetime('now')),\n    executed_at TEXT,\n    completed_at TEXT,\n    FOREIGN KEY (goal_id) REFERENCES goap_goals(id)\n  );\n\n  -- Plan Signatures (for similarity matching)\n  CREATE TABLE IF NOT EXISTS goap_plan_signatures (\n    id TEXT PRIMARY KEY,\n    plan_id TEXT NOT NULL UNIQUE,\n    goal_hash TEXT NOT NULL,\n    state_vector TEXT NOT NULL,\n    action_sequence TEXT NOT NULL,\n    total_cost REAL NOT NULL,\n    success_rate REAL DEFAULT 1.0,\n    usage_count INTEGER DEFAULT 0,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- GOAP Indexes\n  CREATE INDEX IF NOT EXISTS idx_goap_actions_category ON goap_actions(category);\n  CREATE INDEX IF NOT EXISTS idx_goap_actions_agent ON goap_actions(agent_type);\n  CREATE INDEX IF NOT EXISTS idx_goap_plans_status ON goap_plans(status);\n  CREATE INDEX IF NOT EXISTS idx_goap_sig_goal ON goap_plan_signatures(goal_hash);\n";
+export declare const GOAP_SCHEMA = "\n  -- GOAP Goals\n  CREATE TABLE IF NOT EXISTS goap_goals (\n    id TEXT PRIMARY KEY,\n    name TEXT NOT NULL,\n    description TEXT,\n    conditions TEXT NOT NULL,\n    priority INTEGER DEFAULT 3,\n    qe_domain TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- GOAP Actions\n  CREATE TABLE IF NOT EXISTS goap_actions (\n    id TEXT PRIMARY KEY,\n    name TEXT NOT NULL,\n    description TEXT,\n    agent_type TEXT NOT NULL,\n    preconditions TEXT NOT NULL,\n    effects TEXT NOT NULL,\n    cost REAL DEFAULT 1.0,\n    estimated_duration_ms INTEGER,\n    success_rate REAL DEFAULT 1.0,\n    execution_count INTEGER DEFAULT 0,\n    category TEXT NOT NULL,\n    qe_domain TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now')),\n    -- A14: real domain API method binding (kernel.getDomainAPI(qe_domain)[method](params)).\n    -- method/implemented are NULL/0 for actions with no real backing yet \u2014\n    -- GOAPExecutor must report those as \"not implemented\", never simulate them.\n    method TEXT,\n    params TEXT,\n    implemented INTEGER DEFAULT 0\n  );\n\n  -- GOAP Plans\n  CREATE TABLE IF NOT EXISTS goap_plans (\n    id TEXT PRIMARY KEY,\n    goal_id TEXT,\n    initial_state TEXT NOT NULL,\n    goal_state TEXT NOT NULL,\n    action_sequence TEXT NOT NULL,\n    total_cost REAL,\n    estimated_duration_ms INTEGER,\n    status TEXT DEFAULT 'pending',\n    reused_from TEXT,\n    similarity_score REAL,\n    created_at TEXT DEFAULT (datetime('now')),\n    executed_at TEXT,\n    completed_at TEXT,\n    FOREIGN KEY (goal_id) REFERENCES goap_goals(id)\n  );\n\n  -- Plan Signatures (for similarity matching)\n  CREATE TABLE IF NOT EXISTS goap_plan_signatures (\n    id TEXT PRIMARY KEY,\n    plan_id TEXT NOT NULL UNIQUE,\n    goal_hash TEXT NOT NULL,\n    state_vector TEXT NOT NULL,\n    action_sequence TEXT NOT NULL,\n    total_cost REAL NOT NULL,\n    success_rate REAL DEFAULT 1.0,\n    usage_count INTEGER DEFAULT 0,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- A14: canonical per-step execution history (was previously undefined in\n  -- this schema \u2014 plan-executor.ts invented its own parallel\n  -- execution_results/executed_steps tables instead). One row per action\n  -- step per execution attempt (execution_id groups steps from the same\n  -- plan.execute() call, since a plan can be executed/retried more than\n  -- once). Aggregate per-execution stats (steps completed/failed, total\n  -- duration, final world state) are derived by querying this table rather\n  -- than maintained in a separate denormalized summary table.\n  CREATE TABLE IF NOT EXISTS goap_execution_steps (\n    id TEXT PRIMARY KEY,\n    plan_id TEXT NOT NULL,\n    execution_id TEXT NOT NULL,\n    action_id TEXT NOT NULL,\n    step_order INTEGER NOT NULL,\n    world_state_before TEXT,\n    world_state_after TEXT,\n    status TEXT NOT NULL DEFAULT 'pending',\n    retries INTEGER DEFAULT 0,\n    started_at TEXT,\n    duration_ms INTEGER,\n    agent_id TEXT,\n    agent_output TEXT,\n    error_message TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n    -- Deliberately no FK to goap_plans/goap_actions: PlanExecutor.execute()\n    -- can legitimately run an ad-hoc GOAPPlan/GOAPAction that was never\n    -- saved via savePlan()/addAction() (e.g. programmatic orchestration\n    -- bypassing the A* planner). unified-memory.ts enables the\n    -- foreign_keys pragma, so an enforced FK here would reject that\n    -- entirely legitimate usage, not just catch real corruption.\n  );\n\n  -- GOAP Indexes\n  CREATE INDEX IF NOT EXISTS idx_goap_actions_category ON goap_actions(category);\n  CREATE INDEX IF NOT EXISTS idx_goap_actions_agent ON goap_actions(agent_type);\n  CREATE INDEX IF NOT EXISTS idx_goap_plans_status ON goap_plans(status);\n  CREATE INDEX IF NOT EXISTS idx_goap_sig_goal ON goap_plan_signatures(goal_hash);\n  CREATE INDEX IF NOT EXISTS idx_goap_exec_steps_plan ON goap_execution_steps(plan_id);\n  CREATE INDEX IF NOT EXISTS idx_goap_exec_steps_action ON goap_execution_steps(action_id);\n  -- idx_goap_exec_steps_execution is NOT created here: databases with a\n  -- pre-existing narrower goap_execution_steps table (missing execution_id)\n  -- would fail on \"no such column\" since CREATE TABLE IF NOT EXISTS above\n  -- silently no-ops against them. unified-memory.ts's v11 migration creates\n  -- this index only after confirming/backfilling the column.\n";
 export declare const DREAM_SCHEMA = "\n  -- Concept Graph Nodes (Dream Engine)\n  CREATE TABLE IF NOT EXISTS concept_nodes (\n    id TEXT PRIMARY KEY,\n    concept_type TEXT NOT NULL,\n    content TEXT NOT NULL,\n    embedding BLOB,\n    activation_level REAL DEFAULT 0.0,\n    last_activated TEXT,\n    pattern_id TEXT,\n    metadata TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- Concept Edges\n  CREATE TABLE IF NOT EXISTS concept_edges (\n    id TEXT PRIMARY KEY,\n    source TEXT NOT NULL,\n    target TEXT NOT NULL,\n    weight REAL NOT NULL DEFAULT 1.0,\n    edge_type TEXT NOT NULL,\n    evidence INTEGER DEFAULT 1,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (source) REFERENCES concept_nodes(id) ON DELETE CASCADE,\n    FOREIGN KEY (target) REFERENCES concept_nodes(id) ON DELETE CASCADE\n  );\n\n  -- Dream Cycles\n  CREATE TABLE IF NOT EXISTS dream_cycles (\n    id TEXT PRIMARY KEY,\n    start_time TEXT NOT NULL,\n    end_time TEXT,\n    duration_ms INTEGER,\n    concepts_processed INTEGER DEFAULT 0,\n    associations_found INTEGER DEFAULT 0,\n    insights_generated INTEGER DEFAULT 0,\n    status TEXT DEFAULT 'running',\n    error TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- Dream Insights\n  CREATE TABLE IF NOT EXISTS dream_insights (\n    id TEXT PRIMARY KEY,\n    cycle_id TEXT NOT NULL,\n    insight_type TEXT NOT NULL,\n    source_concepts TEXT NOT NULL,\n    description TEXT NOT NULL,\n    novelty_score REAL DEFAULT 0.5,\n    confidence_score REAL DEFAULT 0.5,\n    actionable INTEGER DEFAULT 0,\n    applied INTEGER DEFAULT 0,\n    suggested_action TEXT,\n    pattern_id TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (cycle_id) REFERENCES dream_cycles(id) ON DELETE CASCADE\n  );\n\n  -- Dream Indexes\n  CREATE INDEX IF NOT EXISTS idx_concept_type ON concept_nodes(concept_type);\n  CREATE INDEX IF NOT EXISTS idx_concept_activation ON concept_nodes(activation_level);\n  CREATE INDEX IF NOT EXISTS idx_concept_pattern ON concept_nodes(pattern_id);\n  CREATE INDEX IF NOT EXISTS idx_edge_source ON concept_edges(source);\n  CREATE INDEX IF NOT EXISTS idx_edge_target ON concept_edges(target);\n  CREATE INDEX IF NOT EXISTS idx_edge_type ON concept_edges(edge_type);\n  CREATE INDEX IF NOT EXISTS idx_edge_weight ON concept_edges(weight DESC);\n  CREATE INDEX IF NOT EXISTS idx_insight_cycle ON dream_insights(cycle_id);\n  CREATE INDEX IF NOT EXISTS idx_dream_status ON dream_cycles(status);\n";
 export declare const QE_PATTERNS_SCHEMA = "\n  -- QE Patterns table (unified from sqlite-persistence.ts)\n  CREATE TABLE IF NOT EXISTS qe_patterns (\n    id TEXT PRIMARY KEY,\n    pattern_type TEXT NOT NULL,\n    qe_domain TEXT NOT NULL,\n    domain TEXT NOT NULL,\n    name TEXT NOT NULL,\n    description TEXT,\n    confidence REAL DEFAULT 0.5,\n    usage_count INTEGER DEFAULT 0,\n    success_rate REAL DEFAULT 0.0,\n    quality_score REAL DEFAULT 0.0,\n    tier TEXT DEFAULT 'short-term',\n    template_json TEXT,\n    context_json TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now')),\n    last_used_at TEXT,\n    successful_uses INTEGER DEFAULT 0,\n    tokens_used INTEGER,\n    input_tokens INTEGER,\n    output_tokens INTEGER,\n    latency_ms REAL,\n    reusable INTEGER DEFAULT 0,\n    reuse_count INTEGER DEFAULT 0,\n    average_token_savings REAL DEFAULT 0,\n    total_tokens_saved INTEGER\n  );\n\n  -- Pattern embeddings table (BLOB storage for vectors)\n  CREATE TABLE IF NOT EXISTS qe_pattern_embeddings (\n    pattern_id TEXT PRIMARY KEY,\n    embedding BLOB NOT NULL,\n    dimension INTEGER NOT NULL,\n    model TEXT DEFAULT 'all-MiniLM-L6-v2',\n    created_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (pattern_id) REFERENCES qe_patterns(id) ON DELETE CASCADE\n  );\n\n  -- Pattern usage history (no FK -- used as analytics log by hooks with synthetic IDs)\n  CREATE TABLE IF NOT EXISTS qe_pattern_usage (\n    id INTEGER PRIMARY KEY AUTOINCREMENT,\n    pattern_id TEXT NOT NULL,\n    success INTEGER NOT NULL,\n    metrics_json TEXT,\n    feedback TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- Learning trajectories\n  CREATE TABLE IF NOT EXISTS qe_trajectories (\n    id TEXT PRIMARY KEY,\n    task TEXT NOT NULL,\n    agent TEXT,\n    domain TEXT,\n    started_at TEXT DEFAULT (datetime('now')),\n    ended_at TEXT,\n    success INTEGER,\n    steps_json TEXT,\n    metadata_json TEXT\n  );\n\n  -- Embeddings table (unified from EmbeddingCache.ts)\n  -- Renamed from 'embedding_cache' to 'embeddings' to match existing code\n  CREATE TABLE IF NOT EXISTS embeddings (\n    key TEXT NOT NULL,\n    namespace TEXT NOT NULL,\n    vector BLOB NOT NULL,\n    dimension INTEGER NOT NULL,\n    text TEXT NOT NULL,\n    timestamp INTEGER NOT NULL,\n    quantization TEXT NOT NULL,\n    metadata TEXT,\n    access_count INTEGER DEFAULT 1,\n    last_access INTEGER NOT NULL,\n    PRIMARY KEY (key, namespace)\n  );\n\n  -- Execution results table (unified from plan-executor.ts)\n  CREATE TABLE IF NOT EXISTS execution_results (\n    id TEXT PRIMARY KEY,\n    plan_id TEXT NOT NULL,\n    status TEXT NOT NULL,\n    steps_completed INTEGER DEFAULT 0,\n    steps_failed INTEGER DEFAULT 0,\n    total_duration_ms INTEGER DEFAULT 0,\n    final_world_state TEXT,\n    error_message TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- Executed steps table (unified from plan-executor.ts)\n  CREATE TABLE IF NOT EXISTS executed_steps (\n    id TEXT PRIMARY KEY,\n    execution_id TEXT NOT NULL,\n    plan_id TEXT NOT NULL,\n    action_id TEXT NOT NULL,\n    step_order INTEGER NOT NULL,\n    status TEXT NOT NULL,\n    retries INTEGER DEFAULT 0,\n    started_at TEXT NOT NULL,\n    completed_at TEXT,\n    duration_ms INTEGER,\n    agent_id TEXT,\n    agent_output TEXT,\n    world_state_before TEXT,\n    world_state_after TEXT,\n    error_message TEXT,\n    FOREIGN KEY (execution_id) REFERENCES execution_results(id)\n  );\n\n  -- FTS5 full-text search index for hybrid vector/text search\n  CREATE VIRTUAL TABLE IF NOT EXISTS qe_patterns_fts USING fts5(\n    name, description, pattern_type, qe_domain,\n    content='qe_patterns',\n    content_rowid='rowid'\n  );\n\n  -- FTS5 triggers to keep index in sync\n  CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_insert AFTER INSERT ON qe_patterns BEGIN\n    INSERT INTO qe_patterns_fts(rowid, name, description, pattern_type, qe_domain)\n    VALUES (new.rowid, new.name, new.description, new.pattern_type, new.qe_domain);\n  END;\n\n  CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_delete AFTER DELETE ON qe_patterns BEGIN\n    INSERT INTO qe_patterns_fts(qe_patterns_fts, rowid, name, description, pattern_type, qe_domain)\n    VALUES ('delete', old.rowid, old.name, old.description, old.pattern_type, old.qe_domain);\n  END;\n\n  CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_update AFTER UPDATE ON qe_patterns BEGIN\n    INSERT INTO qe_patterns_fts(qe_patterns_fts, rowid, name, description, pattern_type, qe_domain)\n    VALUES ('delete', old.rowid, old.name, old.description, old.pattern_type, old.qe_domain);\n    INSERT INTO qe_patterns_fts(rowid, name, description, pattern_type, qe_domain)\n    VALUES (new.rowid, new.name, new.description, new.pattern_type, new.qe_domain);\n  END;\n\n  -- QE Patterns indexes\n  CREATE INDEX IF NOT EXISTS idx_qe_patterns_domain ON qe_patterns(qe_domain);\n  CREATE INDEX IF NOT EXISTS idx_qe_patterns_type ON qe_patterns(pattern_type);\n  CREATE INDEX IF NOT EXISTS idx_qe_patterns_tier ON qe_patterns(tier);\n  CREATE INDEX IF NOT EXISTS idx_qe_patterns_quality ON qe_patterns(quality_score DESC);\n  CREATE INDEX IF NOT EXISTS idx_qe_usage_pattern ON qe_pattern_usage(pattern_id);\n  CREATE INDEX IF NOT EXISTS idx_qe_trajectories_domain ON qe_trajectories(domain);\n  CREATE INDEX IF NOT EXISTS idx_embeddings_namespace ON embeddings(namespace);\n  CREATE INDEX IF NOT EXISTS idx_embeddings_timestamp ON embeddings(timestamp);\n  CREATE INDEX IF NOT EXISTS idx_execution_results_plan ON execution_results(plan_id);\n  CREATE INDEX IF NOT EXISTS idx_execution_results_status ON execution_results(status);\n  CREATE INDEX IF NOT EXISTS idx_executed_steps_execution ON executed_steps(execution_id);\n  CREATE INDEX IF NOT EXISTS idx_executed_steps_action ON executed_steps(action_id);\n";
 export declare const MINCUT_SCHEMA = "\n  -- MinCut Graph Snapshots (ADR-047)\n  CREATE TABLE IF NOT EXISTS mincut_snapshots (\n    id TEXT PRIMARY KEY,\n    timestamp TEXT NOT NULL DEFAULT (datetime('now')),\n    vertex_count INTEGER NOT NULL,\n    edge_count INTEGER NOT NULL,\n    total_weight REAL NOT NULL DEFAULT 0.0,\n    is_connected INTEGER NOT NULL DEFAULT 1,\n    component_count INTEGER NOT NULL DEFAULT 1,\n    vertices_json TEXT NOT NULL,\n    edges_json TEXT NOT NULL,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- MinCut History (time-series MinCut values)\n  CREATE TABLE IF NOT EXISTS mincut_history (\n    id INTEGER PRIMARY KEY AUTOINCREMENT,\n    timestamp TEXT NOT NULL DEFAULT (datetime('now')),\n    mincut_value REAL NOT NULL,\n    vertex_count INTEGER NOT NULL,\n    edge_count INTEGER NOT NULL,\n    algorithm TEXT NOT NULL DEFAULT 'weighted-degree',\n    duration_ms INTEGER,\n    snapshot_id TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (snapshot_id) REFERENCES mincut_snapshots(id) ON DELETE SET NULL\n  );\n\n  -- MinCut Weak Vertices (detected bottlenecks)\n  CREATE TABLE IF NOT EXISTS mincut_weak_vertices (\n    id TEXT PRIMARY KEY,\n    vertex_id TEXT NOT NULL,\n    weighted_degree REAL NOT NULL,\n    risk_score REAL NOT NULL,\n    reason TEXT NOT NULL,\n    domain TEXT,\n    vertex_type TEXT NOT NULL,\n    suggestions_json TEXT,\n    detected_at TEXT NOT NULL DEFAULT (datetime('now')),\n    resolved_at TEXT,\n    snapshot_id TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (snapshot_id) REFERENCES mincut_snapshots(id) ON DELETE SET NULL\n  );\n\n  -- MinCut Alerts\n  CREATE TABLE IF NOT EXISTS mincut_alerts (\n    id TEXT PRIMARY KEY,\n    severity TEXT NOT NULL,\n    message TEXT NOT NULL,\n    mincut_value REAL NOT NULL,\n    threshold REAL NOT NULL,\n    affected_vertices_json TEXT,\n    remediations_json TEXT,\n    acknowledged INTEGER DEFAULT 0,\n    acknowledged_at TEXT,\n    acknowledged_by TEXT,\n    timestamp TEXT NOT NULL DEFAULT (datetime('now')),\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- MinCut Healing Actions (self-healing history)\n  CREATE TABLE IF NOT EXISTS mincut_healing_actions (\n    id TEXT PRIMARY KEY,\n    action_type TEXT NOT NULL,\n    action_params_json TEXT NOT NULL,\n    success INTEGER NOT NULL,\n    mincut_before REAL NOT NULL,\n    mincut_after REAL NOT NULL,\n    improvement REAL NOT NULL DEFAULT 0.0,\n    error_message TEXT,\n    duration_ms INTEGER NOT NULL,\n    triggered_by TEXT,\n    snapshot_before_id TEXT,\n    snapshot_after_id TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (snapshot_before_id) REFERENCES mincut_snapshots(id) ON DELETE SET NULL,\n    FOREIGN KEY (snapshot_after_id) REFERENCES mincut_snapshots(id) ON DELETE SET NULL\n  );\n\n  -- MinCut Strange Loop Observations (P1: self-organizing)\n  CREATE TABLE IF NOT EXISTS mincut_observations (\n    id TEXT PRIMARY KEY,\n    iteration INTEGER NOT NULL,\n    mincut_value REAL NOT NULL,\n    weak_vertex_count INTEGER NOT NULL DEFAULT 0,\n    weak_vertices_json TEXT,\n    snapshot_id TEXT,\n    prediction_json TEXT,\n    actual_vs_predicted_diff REAL,\n    timestamp TEXT NOT NULL DEFAULT (datetime('now')),\n    FOREIGN KEY (snapshot_id) REFERENCES mincut_snapshots(id) ON DELETE SET NULL\n  );\n\n  -- MinCut Indexes\n  CREATE INDEX IF NOT EXISTS idx_mincut_history_timestamp ON mincut_history(timestamp DESC);\n  CREATE INDEX IF NOT EXISTS idx_mincut_history_value ON mincut_history(mincut_value);\n  CREATE INDEX IF NOT EXISTS idx_mincut_weak_vertex ON mincut_weak_vertices(vertex_id);\n  CREATE INDEX IF NOT EXISTS idx_mincut_weak_risk ON mincut_weak_vertices(risk_score DESC);\n  CREATE INDEX IF NOT EXISTS idx_mincut_weak_resolved ON mincut_weak_vertices(resolved_at);\n  CREATE INDEX IF NOT EXISTS idx_mincut_alerts_severity ON mincut_alerts(severity);\n  CREATE INDEX IF NOT EXISTS idx_mincut_alerts_ack ON mincut_alerts(acknowledged);\n  CREATE INDEX IF NOT EXISTS idx_mincut_healing_type ON mincut_healing_actions(action_type);\n  CREATE INDEX IF NOT EXISTS idx_mincut_healing_success ON mincut_healing_actions(success);\n  CREATE INDEX IF NOT EXISTS idx_mincut_observations_iter ON mincut_observations(iteration);\n";

package/dist/kernel/unified-memory-schemas.js

@@ -11,7 +11,7 @@ export { HYPERGRAPH_SCHEMA, PATTERN_NULLS_SCHEMA };
 // ============================================================================
 // Schema Version for Migrations
 // ============================================================================
-export const SCHEMA_VERSION = 10; // v10: adds qe_pattern_nulls — kept negative pattern records (ADR-110)
+export const SCHEMA_VERSION = 11; // v11: adds goap_execution_steps — canonical GOAP execution history (A14)
 export const SCHEMA_VERSION_TABLE = `
   CREATE TABLE IF NOT EXISTS schema_version (
     id INTEGER PRIMARY KEY CHECK (id = 1),
@@ -98,7 +98,13 @@ export const GOAP_SCHEMA = `
     category TEXT NOT NULL,
     qe_domain TEXT,
     created_at TEXT DEFAULT (datetime('now')),
-    updated_at TEXT DEFAULT (datetime('now'))
+    updated_at TEXT DEFAULT (datetime('now')),
+    -- A14: real domain API method binding (kernel.getDomainAPI(qe_domain)[method](params)).
+    -- method/implemented are NULL/0 for actions with no real backing yet —
+    -- GOAPExecutor must report those as "not implemented", never simulate them.
+    method TEXT,
+    params TEXT,
+    implemented INTEGER DEFAULT 0
   );
 
   -- GOAP Plans
@@ -132,11 +138,50 @@ export const GOAP_SCHEMA = `
     created_at TEXT DEFAULT (datetime('now'))
   );
 
+  -- A14: canonical per-step execution history (was previously undefined in
+  -- this schema — plan-executor.ts invented its own parallel
+  -- execution_results/executed_steps tables instead). One row per action
+  -- step per execution attempt (execution_id groups steps from the same
+  -- plan.execute() call, since a plan can be executed/retried more than
+  -- once). Aggregate per-execution stats (steps completed/failed, total
+  -- duration, final world state) are derived by querying this table rather
+  -- than maintained in a separate denormalized summary table.
+  CREATE TABLE IF NOT EXISTS goap_execution_steps (
+    id TEXT PRIMARY KEY,
+    plan_id TEXT NOT NULL,
+    execution_id TEXT NOT NULL,
+    action_id TEXT NOT NULL,
+    step_order INTEGER NOT NULL,
+    world_state_before TEXT,
+    world_state_after TEXT,
+    status TEXT NOT NULL DEFAULT 'pending',
+    retries INTEGER DEFAULT 0,
+    started_at TEXT,
+    duration_ms INTEGER,
+    agent_id TEXT,
+    agent_output TEXT,
+    error_message TEXT,
+    created_at TEXT DEFAULT (datetime('now'))
+    -- Deliberately no FK to goap_plans/goap_actions: PlanExecutor.execute()
+    -- can legitimately run an ad-hoc GOAPPlan/GOAPAction that was never
+    -- saved via savePlan()/addAction() (e.g. programmatic orchestration
+    -- bypassing the A* planner). unified-memory.ts enables the
+    -- foreign_keys pragma, so an enforced FK here would reject that
+    -- entirely legitimate usage, not just catch real corruption.
+  );
+
   -- GOAP Indexes
   CREATE INDEX IF NOT EXISTS idx_goap_actions_category ON goap_actions(category);
   CREATE INDEX IF NOT EXISTS idx_goap_actions_agent ON goap_actions(agent_type);
   CREATE INDEX IF NOT EXISTS idx_goap_plans_status ON goap_plans(status);
   CREATE INDEX IF NOT EXISTS idx_goap_sig_goal ON goap_plan_signatures(goal_hash);
+  CREATE INDEX IF NOT EXISTS idx_goap_exec_steps_plan ON goap_execution_steps(plan_id);
+  CREATE INDEX IF NOT EXISTS idx_goap_exec_steps_action ON goap_execution_steps(action_id);
+  -- idx_goap_exec_steps_execution is NOT created here: databases with a
+  -- pre-existing narrower goap_execution_steps table (missing execution_id)
+  -- would fail on "no such column" since CREATE TABLE IF NOT EXISTS above
+  -- silently no-ops against them. unified-memory.ts's v11 migration creates
+  -- this index only after confirming/backfilling the column.
 `;
 export const DREAM_SCHEMA = `
   -- Concept Graph Nodes (Dream Engine)
@@ -602,6 +647,7 @@ export const STATS_TABLES = [
     'goap_goals',
     'goap_plans',
     'goap_plan_signatures',
+    'goap_execution_steps',
     'concept_nodes',
     'concept_edges',
     'dream_cycles',

package/dist/kernel/unified-memory.d.ts

@@ -71,6 +71,10 @@ export declare class UnifiedMemoryManager {
     private preparedStatements;
     private vectorIndex;
     private crdtStore;
+    private proofGate;
+    private proofGateEnvChecked;
+    private static readonly PROOF_NS;
+    private static readonly PROOF_KEY;
     private constructor();
     static getInstance(config?: Partial<UnifiedMemoryConfig>): UnifiedMemoryManager;
     static getInstanceAsync(config?: Partial<UnifiedMemoryConfig>): Promise<UnifiedMemoryManager>;
@@ -87,6 +91,28 @@ export declare class UnifiedMemoryManager {
     private columnExists;
     private handleV2SchemaIncompatibilities;
     private runMigrations;
+    /**
+     * A14: create/backfill goap_execution_steps and goap_actions' real-method
+     * binding columns (method/params/implemented).
+     *
+     * Re-running GOAP_SCHEMA's `CREATE TABLE IF NOT EXISTS` alone is
+     * insufficient here: some databases (this project's own dev DB included)
+     * already have a `goap_execution_steps` table left over from an older,
+     * narrower schema version that predates unified-memory-schemas.ts
+     * tracking this table at all — `IF NOT EXISTS` silently no-ops against it,
+     * permanently missing the columns plan-executor.ts now needs. Likewise
+     * `goap_actions` already exists in every migrated database (it's been
+     * part of the schema since v3), so the new method/params/implemented
+     * columns need an explicit ALTER, not just GOAP_SCHEMA's CREATE TABLE.
+     *
+     * Note: this only adds the columns — it does NOT backfill real method
+     * bindings onto already-seeded action rows (those exist with random,
+     * non-deterministic ids assigned at seed time, not stable across the
+     * qe-action-library.ts source). That backfill is a planning-layer
+     * concern, keyed by action `name` against the current library
+     * definitions — see GOAPPlanner.backfillActionMethodBindings().
+     */
+    private migrateToV11GoapExecutionSteps;
     private loadVectorIndex;
     kvSet(key: string, value: unknown, namespace?: string, ttl?: number): Promise<void>;
     kvGet<T>(key: string, namespace?: string): Promise<T | undefined>;
@@ -94,6 +120,37 @@ export declare class UnifiedMemoryManager {
     kvExists(key: string, namespace?: string): Promise<boolean>;
     kvSearch(pattern: string, namespace?: string, limit?: number): Promise<string[]>;
     kvCleanupExpired(): Promise<number>;
+    /**
+     * Enable the tamper-evident proof-gate audit. OFF by default — once enabled,
+     * every kv write/delete admits a receipt to a persisted SHA-256 hash chain so
+     * {@link verifyMemoryIntegrity} can later prove no admitted write was mutated,
+     * reordered, or dropped. Restores any chain persisted from a prior process.
+     *
+     * Intended for BOUNDED audit windows (a sync / migration / publish gate), not
+     * permanent always-on use: the chain grows O(n) with audited writes and its
+     * snapshot is rewritten per write. Idempotent.
+     */
+    enableProofGate(): void;
+    isProofGateEnabled(): boolean;
+    /**
+     * Re-derive the proof-gate chain from genesis. Returns true iff no admitted
+     * write was mutated, reordered, or dropped. Throws if the gate is not enabled.
+     */
+    verifyMemoryIntegrity(): boolean;
+    /** Current proof-gate chain head (hex), or null if the gate is not enabled. */
+    getProofChainRoot(): string | null;
+    /** Number of writes admitted to the proof-gate chain (0 if not enabled). */
+    getProofChainLength(): number;
+    /**
+     * Best-effort audit of a kv mutation. Admits a content-bound receipt and
+     * persists the chain. NEVER throws into the caller — the actual write has
+     * already committed; a failed audit must not break or alter it.
+     */
+    private auditWrite;
+    /** Persist the chain snapshot via a DIRECT write (bypasses kvSet → no recursion). */
+    private persistProofChain;
+    /** Restore a persisted chain from the reserved namespace, or null if none/corrupt. */
+    private loadProofChain;
     vectorStore(id: string, embedding: number[], namespace?: string, metadata?: unknown): Promise<void>;
     vectorGet(id: string): Promise<{
         embedding: number[];