agentic-qe 3.14.6 → 3.14.7

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

@@ -15,7 +15,21 @@ export declare const VECTORS_SCHEMA = "\n  -- Vector Embeddings (new in v3 - rep
 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    -- 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    space_id TEXT,\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_pattern_embeddings_space ON qe_pattern_embeddings(space_id);\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";
+/** FTS5 external-content index over qe_patterns (hybrid vector/text search). */
+export declare const QE_PATTERNS_FTS_TABLE_DDL = "\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";
+/** Sync triggers keeping qe_patterns_fts in step with qe_patterns, keyed by name. */
+export declare const QE_PATTERNS_FTS_TRIGGER_DDL: Readonly<Record<string, string>>;
+/** FTS5 table plus all sync triggers (idempotent). Requires qe_patterns to exist. */
+export declare const QE_PATTERNS_FTS_SCHEMA: string;
+export declare const QE_PATTERNS_SCHEMA: string;
+/**
+ * QE_PATTERNS_SCHEMA without the FTS5 table/triggers, for migrations that run
+ * after v9 on an existing DB. Re-creating the sync triggers there (with
+ * CREATE TRIGGER IF NOT EXISTS, no rebuild) would hide "triggers were missing"
+ * from the on-open self-heal, leaving UPDATE-only drift unrepaired; the heal
+ * creates any missing FTS objects and rebuilds instead.
+ */
+export declare const QE_PATTERNS_SCHEMA_WITHOUT_FTS: string;
 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";
 export declare const SONA_PATTERNS_SCHEMA = "\n  -- SONA Patterns table (ADR-046: Pattern Persistence for Neural Backbone)\n  CREATE TABLE IF NOT EXISTS sona_patterns (\n    id TEXT PRIMARY KEY,\n    type TEXT NOT NULL,\n    domain TEXT NOT NULL,\n    state_embedding BLOB,\n    action_embedding BLOB,\n    action_type TEXT NOT NULL,\n    action_value TEXT,\n    outcome_reward REAL NOT NULL DEFAULT 0.0,\n    outcome_success INTEGER NOT NULL DEFAULT 0,\n    outcome_quality REAL NOT NULL DEFAULT 0.0,\n    confidence REAL DEFAULT 0.5,\n    usage_count INTEGER DEFAULT 0,\n    success_count INTEGER DEFAULT 0,\n    failure_count INTEGER DEFAULT 0,\n    metadata TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now')),\n    last_used_at TEXT\n  );\n  CREATE INDEX IF NOT EXISTS idx_sona_patterns_type ON sona_patterns(type);\n  CREATE INDEX IF NOT EXISTS idx_sona_patterns_domain ON sona_patterns(domain);\n  CREATE INDEX IF NOT EXISTS idx_sona_patterns_confidence ON sona_patterns(confidence DESC);\n  CREATE INDEX IF NOT EXISTS idx_sona_patterns_updated ON sona_patterns(updated_at DESC);\n";
 export declare const WITNESS_CHAIN_SCHEMA = "\n  -- Witness Chain (ADR-070: Cryptographic audit trail for QE decisions)\n  CREATE TABLE IF NOT EXISTS witness_chain (\n    id INTEGER PRIMARY KEY AUTOINCREMENT,\n    prev_hash TEXT NOT NULL,\n    action_hash TEXT NOT NULL,\n    action_type TEXT NOT NULL,\n    action_data TEXT,\n    timestamp TEXT NOT NULL,\n    actor TEXT NOT NULL\n  );\n  CREATE INDEX IF NOT EXISTS idx_witness_action_type ON witness_chain(action_type);\n  CREATE INDEX IF NOT EXISTS idx_witness_timestamp ON witness_chain(timestamp);\n";

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

@@ -254,7 +254,48 @@ export const DREAM_SCHEMA = `
   CREATE INDEX IF NOT EXISTS idx_insight_cycle ON dream_insights(cycle_id);
   CREATE INDEX IF NOT EXISTS idx_dream_status ON dream_cycles(status);
 `;
-export const QE_PATTERNS_SCHEMA = `
+// ============================================================================
+// qe_patterns FTS5 index (single source of truth)
+// ============================================================================
+//
+// Shared by QE_PATTERNS_SCHEMA, the v9 migration, the legacy SQLitePatternStore
+// schema and the on-open self-heal (pattern-fts-self-heal.ts), so the DDL can't
+// drift between paths. External-content table: the index stores no text of its
+// own and is kept in sync ONLY by the three triggers below.
+/** FTS5 external-content index over qe_patterns (hybrid vector/text search). */
+export const QE_PATTERNS_FTS_TABLE_DDL = `
+  CREATE VIRTUAL TABLE IF NOT EXISTS qe_patterns_fts USING fts5(
+    name, description, pattern_type, qe_domain,
+    content='qe_patterns',
+    content_rowid='rowid'
+  );
+`;
+/** Sync triggers keeping qe_patterns_fts in step with qe_patterns, keyed by name. */
+export const QE_PATTERNS_FTS_TRIGGER_DDL = Object.freeze({
+    qe_patterns_fts_insert: `
+  CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_insert AFTER INSERT ON qe_patterns BEGIN
+    INSERT INTO qe_patterns_fts(rowid, name, description, pattern_type, qe_domain)
+    VALUES (new.rowid, new.name, new.description, new.pattern_type, new.qe_domain);
+  END;
+`,
+    qe_patterns_fts_delete: `
+  CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_delete AFTER DELETE ON qe_patterns BEGIN
+    INSERT INTO qe_patterns_fts(qe_patterns_fts, rowid, name, description, pattern_type, qe_domain)
+    VALUES ('delete', old.rowid, old.name, old.description, old.pattern_type, old.qe_domain);
+  END;
+`,
+    qe_patterns_fts_update: `
+  CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_update AFTER UPDATE ON qe_patterns BEGIN
+    INSERT INTO qe_patterns_fts(qe_patterns_fts, rowid, name, description, pattern_type, qe_domain)
+    VALUES ('delete', old.rowid, old.name, old.description, old.pattern_type, old.qe_domain);
+    INSERT INTO qe_patterns_fts(rowid, name, description, pattern_type, qe_domain)
+    VALUES (new.rowid, new.name, new.description, new.pattern_type, new.qe_domain);
+  END;
+`,
+});
+/** FTS5 table plus all sync triggers (idempotent). Requires qe_patterns to exist. */
+export const QE_PATTERNS_FTS_SCHEMA = QE_PATTERNS_FTS_TABLE_DDL + Object.values(QE_PATTERNS_FTS_TRIGGER_DDL).join('');
+const qePatternsSchema = (ftsSchema) => `
   -- QE Patterns table (unified from sqlite-persistence.ts)
   CREATE TABLE IF NOT EXISTS qe_patterns (
     id TEXT PRIMARY KEY,
@@ -367,30 +408,8 @@ export const QE_PATTERNS_SCHEMA = `
     FOREIGN KEY (execution_id) REFERENCES execution_results(id)
   );
 
-  -- FTS5 full-text search index for hybrid vector/text search
-  CREATE VIRTUAL TABLE IF NOT EXISTS qe_patterns_fts USING fts5(
-    name, description, pattern_type, qe_domain,
-    content='qe_patterns',
-    content_rowid='rowid'
-  );
-
-  -- FTS5 triggers to keep index in sync
-  CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_insert AFTER INSERT ON qe_patterns BEGIN
-    INSERT INTO qe_patterns_fts(rowid, name, description, pattern_type, qe_domain)
-    VALUES (new.rowid, new.name, new.description, new.pattern_type, new.qe_domain);
-  END;
-
-  CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_delete AFTER DELETE ON qe_patterns BEGIN
-    INSERT INTO qe_patterns_fts(qe_patterns_fts, rowid, name, description, pattern_type, qe_domain)
-    VALUES ('delete', old.rowid, old.name, old.description, old.pattern_type, old.qe_domain);
-  END;
-
-  CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_update AFTER UPDATE ON qe_patterns BEGIN
-    INSERT INTO qe_patterns_fts(qe_patterns_fts, rowid, name, description, pattern_type, qe_domain)
-    VALUES ('delete', old.rowid, old.name, old.description, old.pattern_type, old.qe_domain);
-    INSERT INTO qe_patterns_fts(rowid, name, description, pattern_type, qe_domain)
-    VALUES (new.rowid, new.name, new.description, new.pattern_type, new.qe_domain);
-  END;
+  -- FTS5 full-text search index + sync triggers for hybrid vector/text search
+  ${ftsSchema}
 
   -- QE Patterns indexes
   CREATE INDEX IF NOT EXISTS idx_qe_patterns_domain ON qe_patterns(qe_domain);
@@ -407,6 +426,15 @@ export const QE_PATTERNS_SCHEMA = `
   CREATE INDEX IF NOT EXISTS idx_executed_steps_execution ON executed_steps(execution_id);
   CREATE INDEX IF NOT EXISTS idx_executed_steps_action ON executed_steps(action_id);
 `;
+export const QE_PATTERNS_SCHEMA = qePatternsSchema(QE_PATTERNS_FTS_SCHEMA);
+/**
+ * QE_PATTERNS_SCHEMA without the FTS5 table/triggers, for migrations that run
+ * after v9 on an existing DB. Re-creating the sync triggers there (with
+ * CREATE TRIGGER IF NOT EXISTS, no rebuild) would hide "triggers were missing"
+ * from the on-open self-heal, leaving UPDATE-only drift unrepaired; the heal
+ * creates any missing FTS objects and rebuilds instead.
+ */
+export const QE_PATTERNS_SCHEMA_WITHOUT_FTS = qePatternsSchema('');
 export const MINCUT_SCHEMA = `
   -- MinCut Graph Snapshots (ADR-047)
   CREATE TABLE IF NOT EXISTS mincut_snapshots (

package/dist/kernel/unified-memory.js

@@ -41,7 +41,8 @@ export { BinaryHeap, UnifiedHnswIndex, createHnswIndex } from './unified-memory-
 // parity tests or benchmarks only.
 import { UnifiedHnswIndex } from './unified-memory-hnsw.js';
 // Import schemas
-import { SCHEMA_VERSION, SCHEMA_VERSION_TABLE, KV_STORE_SCHEMA, VECTORS_SCHEMA, RL_QVALUES_SCHEMA, GOAP_SCHEMA, DREAM_SCHEMA, QE_PATTERNS_SCHEMA, MINCUT_SCHEMA, SONA_PATTERNS_SCHEMA, FEEDBACK_SCHEMA, HYPERGRAPH_SCHEMA, PATTERN_NULLS_SCHEMA, STATS_TABLES, } from './unified-memory-schemas.js';
+import { SCHEMA_VERSION, SCHEMA_VERSION_TABLE, KV_STORE_SCHEMA, VECTORS_SCHEMA, RL_QVALUES_SCHEMA, GOAP_SCHEMA, DREAM_SCHEMA, QE_PATTERNS_SCHEMA, QE_PATTERNS_FTS_SCHEMA, QE_PATTERNS_SCHEMA_WITHOUT_FTS, MINCUT_SCHEMA, SONA_PATTERNS_SCHEMA, FEEDBACK_SCHEMA, HYPERGRAPH_SCHEMA, PATTERN_NULLS_SCHEMA, STATS_TABLES, } from './unified-memory-schemas.js';
+import { ensurePatternFtsInSync } from './pattern-fts-self-heal.js';
 import { applyMigration as applyLearningEvidenceMigration } from '../migrations/20260830_add_learning_evidence_tables.js';
 // CRDT imports for distributed state synchronization
 import { createCRDTStore, } from '../memory/crdt/index.js';
@@ -55,6 +56,7 @@ import { createCRDTStore, } from '../memory/crdt/index.js';
 // working unchanged. Imported (not bare re-exported) so internal callers below
 // have a usable local binding.
 import { findProjectRoot, clearProjectRootCache } from './project-root.js';
+import { registerStoreCloser, requestOwnedShutdown } from './process-lifecycle.js';
 export { findProjectRoot, clearProjectRootCache };
 /**
  * Get the default database path using project root detection.
@@ -276,6 +278,9 @@ export class UnifiedMemoryManager {
                 signal.throwIfAborted();
             }
             await this.runMigrations();
+            // Not gated on schema version: repairs missing qe_patterns_fts sync
+            // triggers / index drift on every open. Never throws; silent when healthy.
+            ensurePatternFtsInSync(this.db, { logPrefix: '[UnifiedMemory]' });
             signal?.throwIfAborted();
             // DATA LOSS PREVENTION: After migration, if the DB existed before and was
             // large (>1MB = has real data), but now qe_patterns is empty, something
@@ -451,36 +456,13 @@ export class UnifiedMemoryManager {
                 if (currentVersion < 8)
                     this.db.exec(FEEDBACK_SCHEMA);
                 if (currentVersion < 9) {
-                    // Add FTS5 full-text search for qe_patterns (hybrid vector/text search)
-                    this.db.exec(`
-            CREATE VIRTUAL TABLE IF NOT EXISTS qe_patterns_fts USING fts5(
-              name, description, pattern_type, qe_domain,
-              content='qe_patterns',
-              content_rowid='rowid'
-            );
-
-            CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_insert AFTER INSERT ON qe_patterns BEGIN
-              INSERT INTO qe_patterns_fts(rowid, name, description, pattern_type, qe_domain)
-              VALUES (new.rowid, new.name, new.description, new.pattern_type, new.qe_domain);
-            END;
-
-            CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_delete AFTER DELETE ON qe_patterns BEGIN
-              INSERT INTO qe_patterns_fts(qe_patterns_fts, rowid, name, description, pattern_type, qe_domain)
-              VALUES ('delete', old.rowid, old.name, old.description, old.pattern_type, old.qe_domain);
-            END;
-
-            CREATE TRIGGER IF NOT EXISTS qe_patterns_fts_update AFTER UPDATE ON qe_patterns BEGIN
-              INSERT INTO qe_patterns_fts(qe_patterns_fts, rowid, name, description, pattern_type, qe_domain)
-              VALUES ('delete', old.rowid, old.name, old.description, old.pattern_type, old.qe_domain);
-              INSERT INTO qe_patterns_fts(rowid, name, description, pattern_type, qe_domain)
-              VALUES (new.rowid, new.name, new.description, new.pattern_type, new.qe_domain);
-            END;
-          `);
-                    // Populate FTS5 index from existing patterns
-                    this.db.exec(`
-            INSERT INTO qe_patterns_fts(rowid, name, description, pattern_type, qe_domain)
-            SELECT rowid, name, description, pattern_type, qe_domain FROM qe_patterns;
-          `);
+                    // Add FTS5 full-text search for qe_patterns (hybrid vector/text search).
+                    // DDL shared with QE_PATTERNS_SCHEMA and the on-open self-heal.
+                    this.db.exec(QE_PATTERNS_FTS_SCHEMA);
+                    // Populate the index from existing patterns. 'rebuild' rather than a
+                    // raw INSERT...SELECT so it's idempotent when QE_PATTERNS_SCHEMA's
+                    // triggers already indexed some rows.
+                    this.db.exec(`INSERT INTO qe_patterns_fts(qe_patterns_fts) VALUES('rebuild')`);
                 }
                 if (currentVersion < 10)
                     this.db.exec(PATTERN_NULLS_SCHEMA);
@@ -810,7 +792,9 @@ export class UnifiedMemoryManager {
         const db = this.db;
         const table = db.prepare("SELECT name FROM sqlite_master WHERE type='table' AND name='qe_pattern_embeddings'").get();
         if (!table) {
-            db.exec(QE_PATTERNS_SCHEMA);
+            // FTS objects are left to ensurePatternFtsInSync (runs after migrations)
+            // so missing triggers are still seen and the index is rebuilt.
+            db.exec(QE_PATTERNS_SCHEMA_WITHOUT_FTS);
             return;
         }
         const columns = db.prepare("PRAGMA table_info('qe_pattern_embeddings')").all();
@@ -1091,8 +1075,21 @@ function registerExitHandlers() {
         }
     };
     process.on('beforeExit', cleanup);
-    process.on('SIGINT', () => { cleanup(); process.exit(0); });
-    process.on('SIGTERM', () => { cleanup(); process.exit(0); });
+    // A claimed lifecycle owner (the MCP server) closes this store at the end of
+    // its shutdown on every path (EOF, JSON-RPC shutdown, signals, watchdog), so
+    // the WAL is checkpointed into memory.db. close() is idempotent.
+    registerStoreCloser(cleanup);
+    const onSignal = (signal) => {
+        // #801: when a lifecycle owner is claimed, its graceful shutdown may still
+        // need this store, and exiting here would pre-empt it. The owner closes it
+        // through the closer registered above.
+        if (requestOwnedShutdown(signal))
+            return;
+        cleanup();
+        process.exit(0);
+    };
+    process.on('SIGINT', onSignal);
+    process.on('SIGTERM', onSignal);
 }
 registerExitHandlers();
 //# sourceMappingURL=unified-memory.js.map

package/dist/kernel/unified-persistence.js

@@ -21,6 +21,7 @@
 import { toErrorMessage } from '../shared/error-utils.js';
 import { getUnifiedMemory, resetUnifiedMemory, DEFAULT_UNIFIED_MEMORY_CONFIG, } from './unified-memory.js';
 import { MEMORY_CONSTANTS } from './constants.js';
+import { registerStoreCloser, requestOwnedShutdown } from './process-lifecycle.js';
 // Use same path as unified-memory for true unification
 export const DEFAULT_UNIFIED_CONFIG = {
     dbPath: DEFAULT_UNIFIED_MEMORY_CONFIG.dbPath, // '.agentic-qe/memory.db'
@@ -254,14 +255,19 @@ function registerExitHandlers() {
         }
     };
     process.on('beforeExit', cleanup);
-    process.on('SIGINT', () => {
-        cleanup();
-        process.exit(0);
-    });
-    process.on('SIGTERM', () => {
+    // Closed by a claimed lifecycle owner (the MCP server) at the end of its
+    // shutdown on every path; registered after unified memory, so it closes first.
+    registerStoreCloser(cleanup);
+    const onSignal = (signal) => {
+        // #801: defer to a claimed lifecycle owner instead of exiting under its
+        // graceful shutdown; the owner closes the facade via the closer above.
+        if (requestOwnedShutdown(signal))
+            return;
         cleanup();
         process.exit(0);
-    });
+    };
+    process.on('SIGINT', onSignal);
+    process.on('SIGTERM', onSignal);
 }
 // Register exit handlers when module is loaded
 registerExitHandlers();

package/dist/learning/experience-capture.d.ts

@@ -301,8 +301,9 @@ export declare class ExperienceCaptureService {
      */
     private detectPatternType;
     /**
-     * Generate pattern name from experience
+     * Stable lookup identity; verify full origin metadata before reinforcement.
      */
+    private experienceIdentity;
     private generatePatternName;
     /**
      * Extract tags from experience

package/dist/learning/experience-capture.js

@@ -12,6 +12,7 @@
  * - Pattern promotion after threshold uses
  * - Cross-domain experience sharing
  */
+import { createHash } from 'node:crypto';
 import { v4 as uuidv4 } from 'uuid';
 import { ok, err } from '../shared/types/index.js';
 import { LoggerFactory } from '../logging/index.js';
@@ -373,16 +374,23 @@ export class ExperienceCaptureService {
         if (!this.patternStore) {
             return { newPattern: false, reinforced: false, promoted: false };
         }
-        // Search for similar existing patterns
-        const searchResult = await this.patternStore.search(experience.task, {
+        // Reinforcement records repeated observations of the exact originating task;
+        // lexical relevance is not a semantic reuse oracle.
+        const identity = this.experienceIdentity(experience);
+        const searchResult = await this.patternStore.search(identity, {
             limit: 1,
             domain: experience.domain,
-            useVectorSearch: true,
+            patternType: this.detectPatternType(experience.task),
+            useVectorSearch: false,
         });
         if (searchResult.success && searchResult.value.length > 0) {
             const existing = searchResult.value[0];
-            // If similarity is high enough, reinforce existing pattern
-            if (existing.similarity >= this.config.similarityThreshold) {
+            const origin = existing.pattern.context?.experienceOrigin;
+            if (origin?.task === experience.task
+                && origin.domain === (experience.domain ?? null)
+                && origin.patternType === this.detectPatternType(experience.task)
+                && existing.pattern.patternType === origin.patternType
+                && (!experience.domain || existing.pattern.qeDomain === experience.domain)) {
                 const usageResult = await this.patternStore.recordUsage(existing.pattern.id, experience.success);
                 // Check if pattern should be promoted (short-term → long-term)
                 const pattern = await this.patternStore.get(existing.pattern.id);
@@ -590,10 +598,12 @@ ${stepDescriptions}
 Duration: ${experience.durationMs}ms`;
         return {
             patternType,
+            qeDomain: experience.domain,
             name: this.generatePatternName(experience),
             description: `Pattern extracted from: ${experience.task}`,
             context: {
-                tags: this.extractTags(experience),
+                tags: [...this.extractTags(experience), this.experienceIdentity(experience)],
+                experienceOrigin: { task: experience.task, domain: experience.domain ?? null, patternType },
                 testType: this.detectTestType(experience.task),
             },
             template: {
@@ -657,8 +667,13 @@ Duration: ${experience.durationMs}ms`;
         return 'test-template'; // Default
     }
     /**
-     * Generate pattern name from experience
+     * Stable lookup identity; verify full origin metadata before reinforcement.
      */
+    experienceIdentity(experience) {
+        return createHash('sha256').update(JSON.stringify([
+            experience.task, experience.domain ?? null, this.detectPatternType(experience.task),
+        ])).digest('hex');
+    }
     generatePatternName(experience) {
         // Take first 50 chars of task, sanitize
         const sanitized = experience.task
@@ -666,7 +681,7 @@ Duration: ${experience.durationMs}ms`;
             .slice(0, 50)
             .trim();
         const domain = experience.domain ? `[${experience.domain}] ` : '';
-        return `${domain}${sanitized}`;
+        return `${domain}${sanitized} ${this.experienceIdentity(experience)}`;
     }
     /**
      * Extract tags from experience

package/dist/learning/pattern-store.d.ts

@@ -155,7 +155,7 @@ export interface PatternSearchResult {
     /** Match score (0-1) */
     score: number;
     /** How the pattern was matched */
-    matchType: 'vector' | 'exact' | 'context';
+    matchType: 'vector' | 'exact' | 'lexical' | 'context';
     /** Similarity score for vector matches (ADR-042) */
     similarity: number;
     /** Whether this pattern can be reused to skip LLM calls (ADR-042) */

package/dist/learning/pattern-store.js

@@ -60,10 +60,12 @@ function getHDCTokenFingerprinter() {
 /** Module-level Hopfield memory for exact pattern recall */
 let hopfieldMemory = null;
 let hopfieldDimension = 0;
-function getHopfieldMemory(dimension) {
-    if (!hopfieldMemory || hopfieldDimension !== dimension) {
+let hopfieldSpaceId;
+function getHopfieldMemory(dimension, spaceId) {
+    if (!hopfieldMemory || hopfieldDimension !== dimension || hopfieldSpaceId !== spaceId) {
         hopfieldMemory = createHopfieldMemory({ dimension, maxPatterns: 10000 });
         hopfieldDimension = dimension;
+        hopfieldSpaceId = spaceId;
     }
     return hopfieldMemory;
 }
@@ -564,9 +566,9 @@ export class PatternStore {
             console.debug(`[PatternStore] HDC token fingerprint failed for ${pattern.id}:`, toErrorMessage(error));
         }
         // R5: Store embedding in Hopfield memory for exact recall
-        if (isHopfieldMemoryEnabled() && pattern.embedding) {
+        if (isHopfieldMemoryEnabled() && pattern.embedding && activeSpaceId) {
             try {
-                const hopfield = getHopfieldMemory(pattern.embedding.length);
+                const hopfield = getHopfieldMemory(pattern.embedding.length, activeSpaceId);
                 hopfield.store(new Float32Array(pattern.embedding), {
                     id: pattern.id,
                     name: pattern.name,
@@ -717,10 +719,14 @@ export class PatternStore {
         const limit = options.limit || 10;
         const results = [];
         try {
+            const activeSpaceId = getActiveEmbeddingSpaceIdentity()?.spaceId ?? this.config.embeddingSpaceId;
+            if (Array.isArray(query) && (!activeSpaceId || options.embeddingSpaceId !== activeSpaceId)) {
+                throw new Error('VECTOR_SPACE_UNVERIFIED: pre-computed query vectors require the active embeddingSpaceId');
+            }
             // R5: Exact recall via Hopfield — check for high-confidence exact match
-            if (Array.isArray(query) && isHopfieldMemoryEnabled()) {
+            if (Array.isArray(query) && options.useVectorSearch !== false && activeSpaceId && isHopfieldMemoryEnabled()) {
                 try {
-                    const hopfield = getHopfieldMemory(query.length);
+                    const hopfield = getHopfieldMemory(query.length, activeSpaceId);
                     if (hopfield.getPatternCount() > 0) {
                         const recallResult = hopfield.recall(new Float32Array(query));
                         if (recallResult && recallResult.similarity > 0.98) {
@@ -747,10 +753,6 @@ export class PatternStore {
             }
             // Vector search if query is embedding and HNSW available (lazy-load)
             if (Array.isArray(query) && options.useVectorSearch !== false) {
-                const activeSpaceId = getActiveEmbeddingSpaceIdentity()?.spaceId ?? this.config.embeddingSpaceId;
-                if (!activeSpaceId || options.embeddingSpaceId !== activeSpaceId) {
-                    throw new Error('VECTOR_SPACE_UNVERIFIED: pre-computed query vectors require the active embeddingSpaceId');
-                }
                 const hnsw = await this.ensureHNSW();
                 if (hnsw) {
                     const hnswResults = await hnsw.search(query, limit * 2);
@@ -778,7 +780,7 @@ export class PatternStore {
                 try {
                     const ftsResults = this.sqliteStore.searchFTS(ftsText, limit * 2);
                     if (ftsResults.length > 0) {
-                        const ftsScoreMap = new Map(ftsResults.map(r => [r.id, r.ftsScore]));
+                        const ftsScoreMap = new Map(ftsResults.map(r => [r.id, r.ftsScore * r.coverage]));
                         const existingIds = new Set(results.map(r => r.pattern.id));
                         // Boost existing vector results that also match FTS5
                         for (const result of results) {
@@ -793,22 +795,18 @@ export class PatternStore {
                                 continue;
                             const pattern = await this.get(ftsResult.id);
                             if (pattern && this.matchesFilters(pattern, options)) {
-                                // #653: ftsScore is normalized to the best hit, so only a
-                                // whole-phrase hit may read as a near-duplicate; term-only hits
-                                // report the conservative keyword score as their similarity.
-                                // Scaled by query-term coverage so the best of a weak lexical
-                                // set (e.g. one shared stopword) cannot outrank vector hits.
+                                // Relative BM25 is weighted by query coverage for ranking;
+                                // lexical evidence alone never authorizes vector reuse.
                                 const keywordScore = 0.5 * ftsResult.ftsScore * ftsResult.coverage;
-                                const similarity = ftsResult.phrase ? ftsResult.ftsScore : keywordScore;
-                                const reuseInfo = this.calculateReuseInfo(pattern, similarity);
+                                const similarity = 0; // Lexical relevance is not vector similarity or safe reuse.
                                 results.push({
                                     pattern,
-                                    score: keywordScore, // FTS-only: exact keyword match is valuable
-                                    matchType: 'exact',
+                                    score: keywordScore,
+                                    matchType: 'lexical',
                                     similarity,
-                                    canReuse: reuseInfo.canReuse,
-                                    estimatedTokenSavings: reuseInfo.estimatedTokenSavings,
-                                    reuseConfidence: reuseInfo.reuseConfidence,
+                                    canReuse: false,
+                                    estimatedTokenSavings: 0,
+                                    reuseConfidence: 0,
                                 });
                             }
                         }
@@ -974,15 +972,14 @@ export class PatternStore {
                 score = pattern.qualityScore;
             }
             if (score > 0 || !queryLower) {
-                const reuseInfo = this.calculateReuseInfo(pattern, score);
                 results.push({
                     pattern,
-                    score: score || pattern.qualityScore,
-                    matchType: queryLower ? 'exact' : 'context',
-                    similarity: score || pattern.qualityScore,
-                    canReuse: reuseInfo.canReuse,
-                    estimatedTokenSavings: reuseInfo.estimatedTokenSavings,
-                    reuseConfidence: reuseInfo.reuseConfidence,
+                    score: queryLower ? 0.5 * score : pattern.qualityScore,
+                    matchType: queryLower ? 'lexical' : 'context',
+                    similarity: 0,
+                    canReuse: false,
+                    estimatedTokenSavings: 0,
+                    reuseConfidence: 0,
                 });
             }
         }

package/dist/learning/qe-patterns.d.ts

@@ -111,6 +111,12 @@ export interface QEPattern {
  * Pattern applicability context
  */
 export interface QEPatternContext {
+    /** Exact originating experience; reinforcement identity, never a similarity claim. */
+    readonly experienceOrigin?: {
+        task: string;
+        domain: QEDomain | null;
+        patternType: QEPatternType;
+    };
     /** Programming language this pattern applies to */
     readonly language?: ProgrammingLanguage;
     /** Test framework this pattern uses */

package/dist/learning/qe-reasoning-bank.d.ts

@@ -48,6 +48,7 @@ export declare class QEReasoningBank implements IQEReasoningBank {
     private readonly eventBus?;
     private readonly coherenceService?;
     private readonly config;
+    private readonly embeddingProvenance;
     private patternStore;
     private initialized;
     private sqliteStore;

package/dist/learning/qe-reasoning-bank.js

@@ -64,6 +64,7 @@ export class QEReasoningBank {
     eventBus;
     coherenceService;
     config;
+    embeddingProvenance = new WeakMap();
     patternStore;
     initialized = false;
     sqliteStore = null;
@@ -337,7 +338,11 @@ export class QEReasoningBank {
                 searchQuery = '';
             }
             else {
-                searchQuery = await this.embed(query);
+                const embedding = await this.embed(query);
+                // Hash fallback and resized vectors do not belong to the active provider.
+                // Keep their text searchable without claiming semantic comparability.
+                searchQuery = this.embeddingProvenance.has(embedding) ? embedding : query;
+                useVectorSearch = Array.isArray(searchQuery);
             }
         }
         return this.patternStore.search(searchQuery, {
@@ -346,7 +351,7 @@ export class QEReasoningBank {
             textQuery: typeof query === 'string' && query.trim() ? query : options?.textQuery,
             useVectorSearch,
             embeddingSpaceId: typeof query === 'string'
-                ? getActiveEmbeddingSpaceIdentity()?.spaceId
+                ? (Array.isArray(searchQuery) ? this.embeddingProvenance.get(searchQuery) : undefined)
                 : options?.embeddingSpaceId,
         });
     }
@@ -442,11 +447,13 @@ export class QEReasoningBank {
             }
             // 2. Search for similar patterns
             const embedding = await this.embed(request.task);
-            const patternResults = await this.patternStore.search(embedding, {
+            const embeddingSpaceId = this.embeddingProvenance.get(embedding);
+            const patternResults = await this.patternStore.search(embeddingSpaceId ? embedding : request.task, {
                 limit: this.config.maxRoutingCandidates,
                 domain: detectedDomains[0],
-                useVectorSearch: true,
+                useVectorSearch: Boolean(embeddingSpaceId),
                 textQuery: request.task,
+                embeddingSpaceId,
             });
             const patterns = patternResults.success
                 ? patternResults.value.map((r) => r.pattern)
@@ -607,6 +614,9 @@ export class QEReasoningBank {
                 if (embedding.length !== this.config.embeddingDimension) {
                     return resizeEmbedding(embedding, this.config.embeddingDimension);
                 }
+                const spaceId = getActiveEmbeddingSpaceIdentity()?.spaceId;
+                if (spaceId)
+                    this.embeddingProvenance.set(embedding, spaceId);
                 return embedding;
             }
             catch (error) {

package/dist/learning/real-qe-reasoning-bank.d.ts

@@ -30,6 +30,14 @@ export interface RealQEReasoningBankConfig {
     coherenceThreshold?: number;
 }
 export declare const DEFAULT_REAL_CONFIG: RealQEReasoningBankConfig;
+/** Ranking evidence keeps lexical relevance separate from vector reuse safety. */
+export interface RealQEPatternSearchResult {
+    pattern: QEPattern;
+    score: number;
+    similarity: number;
+    matchType: 'vector' | 'lexical';
+    canReuse: boolean;
+}
 export interface RealQERoutingRequest {
     task: string;
     taskType?: 'test-generation' | 'analysis' | 'debugging' | 'optimization';
@@ -144,10 +152,7 @@ export declare class RealQEReasoningBank {
         limit?: number;
         domain?: QEDomain;
         minSimilarity?: number;
-    }): Promise<Result<Array<{
-        pattern: QEPattern;
-        similarity: number;
-    }>>>;
+    }): Promise<Result<RealQEPatternSearchResult[]>>;
     /**
      * Route a task to optimal agent
      */