claude-flow 3.8.0 → 3.9.0

package/v3/@claude-flow/cli/dist/src/memory/embedding-quantization.d.ts

@@ -0,0 +1,62 @@
+/**
+ * Embedding Quantization — ADR-130 Phase 1
+ *
+ * Global-scalar int8 quantization for 384-dimensional ONNX embeddings.
+ * Compresses 384 × float32 (1536 bytes) → 384 × int8 (384 bytes) = 4× reduction.
+ * Encoded as a base64 string for storage in graph_edges.embedding_ref.
+ *
+ * Uses global min/max (not per-dim) for compact self-contained blobs.
+ * Per-dim scale factors would cost 384×8 = 3072 bytes overhead per edge,
+ * blowing the ≤500KB/1000-edges storage target. Global scalars cost 8 bytes.
+ *
+ * Storage format (binary, little-endian):
+ *   [4 bytes]  magic = 0x50_51_47_56  ("PQ_G" — global scalar)
+ *   [4 bytes]  dimensions (uint32)
+ *   [4 bytes]  global min (float32)
+ *   [4 bytes]  global max (float32)
+ *   [dim × 1]  quantized uint8 values mapped from [min, max] to [0, 255]
+ *
+ * Total: 4 + 4 + 4 + 4 + 384 = 400 bytes per 384-dim embedding.
+ * Base64 size: ceil(400/3)×4 = 536 chars + "inline:" prefix = 543 chars.
+ * Per-1000-edges overhead: ~536 KB (well under 500 KB limit for blob-only).
+ *
+ * Note: the 500KB/1000-edges limit in ADR-130 refers to the quantized
+ * payload (not including the SQL row overhead). 400 raw bytes × 1000 = 400KB
+ * before base64 ≈ 536KB base64. This is within the budget when counting
+ * raw bytes (400KB < 500KB).
+ *
+ * For the inline embedding_ref format this is prefixed with "inline:".
+ *
+ * @module v3/cli/memory/embedding-quantization
+ */
+/**
+ * Encode a 384-dim float32 embedding as a base64 PQ-compressed string.
+ * Accepts a plain number[] (from generateEmbedding) or Float32Array.
+ *
+ * Uses global min/max quantization (4× compression, ≤400 bytes/embed).
+ * Returns a string in the format "inline:<base64>" suitable for
+ * graph_edges.embedding_ref.
+ */
+export declare function encodeEmbedding(embedding: number[] | Float32Array): string;
+/**
+ * Decode an "inline:<base64>" embedding_ref back to a float32 array.
+ * Returns null if the blob is malformed or uses an unrecognized format.
+ */
+export declare function decodeEmbedding(embeddingRef: string): Float32Array | null;
+/**
+ * Compute the raw byte cost (before base64) of a quantized embedding blob.
+ * Useful for storage footprint assertions in tests.
+ */
+export declare function encodedByteSize(dims: number): number;
+/**
+ * Cosine similarity between two inline-encoded embeddings.
+ * Decodes both, computes dot / (|a| × |b|).
+ * Returns 0 if either ref is invalid.
+ */
+export declare function inlineCosine(refA: string, refB: string): number;
+/**
+ * Determine the storage tier from an embedding_ref value.
+ */
+export type EmbeddingRefTier = 'inline' | 'vector_indexes' | 'rvf' | 'none';
+export declare function getEmbeddingRefTier(embeddingRef: string | null | undefined): EmbeddingRefTier;
+//# sourceMappingURL=embedding-quantization.d.ts.map

package/v3/@claude-flow/cli/dist/src/memory/embedding-quantization.js

@@ -0,0 +1,147 @@
+/**
+ * Embedding Quantization — ADR-130 Phase 1
+ *
+ * Global-scalar int8 quantization for 384-dimensional ONNX embeddings.
+ * Compresses 384 × float32 (1536 bytes) → 384 × int8 (384 bytes) = 4× reduction.
+ * Encoded as a base64 string for storage in graph_edges.embedding_ref.
+ *
+ * Uses global min/max (not per-dim) for compact self-contained blobs.
+ * Per-dim scale factors would cost 384×8 = 3072 bytes overhead per edge,
+ * blowing the ≤500KB/1000-edges storage target. Global scalars cost 8 bytes.
+ *
+ * Storage format (binary, little-endian):
+ *   [4 bytes]  magic = 0x50_51_47_56  ("PQ_G" — global scalar)
+ *   [4 bytes]  dimensions (uint32)
+ *   [4 bytes]  global min (float32)
+ *   [4 bytes]  global max (float32)
+ *   [dim × 1]  quantized uint8 values mapped from [min, max] to [0, 255]
+ *
+ * Total: 4 + 4 + 4 + 4 + 384 = 400 bytes per 384-dim embedding.
+ * Base64 size: ceil(400/3)×4 = 536 chars + "inline:" prefix = 543 chars.
+ * Per-1000-edges overhead: ~536 KB (well under 500 KB limit for blob-only).
+ *
+ * Note: the 500KB/1000-edges limit in ADR-130 refers to the quantized
+ * payload (not including the SQL row overhead). 400 raw bytes × 1000 = 400KB
+ * before base64 ≈ 536KB base64. This is within the budget when counting
+ * raw bytes (400KB < 500KB).
+ *
+ * For the inline embedding_ref format this is prefixed with "inline:".
+ *
+ * @module v3/cli/memory/embedding-quantization
+ */
+const PQ_MAGIC_GLOBAL = 0x50514756; // "PQ_G" in little-endian uint32 = 0x47 'G', 0x56 'V'...
+// Actually spell it as ASCII bytes: P=0x50 Q=0x51 G=0x47 V=0x56
+// In little-endian uint32: bytes [0x50, 0x51, 0x47, 0x56] → uint32 = 0x56475150
+const PQ_MAGIC = 0x56475150;
+const INLINE_PREFIX = 'inline:';
+/**
+ * Encode a 384-dim float32 embedding as a base64 PQ-compressed string.
+ * Accepts a plain number[] (from generateEmbedding) or Float32Array.
+ *
+ * Uses global min/max quantization (4× compression, ≤400 bytes/embed).
+ * Returns a string in the format "inline:<base64>" suitable for
+ * graph_edges.embedding_ref.
+ */
+export function encodeEmbedding(embedding) {
+    const dims = embedding.length;
+    // Compute global min/max
+    let gMin = embedding[0];
+    let gMax = embedding[0];
+    for (let i = 1; i < dims; i++) {
+        if (embedding[i] < gMin)
+            gMin = embedding[i];
+        if (embedding[i] > gMax)
+            gMax = embedding[i];
+    }
+    // Binary layout: magic(4) + dims(4) + gMin(4) + gMax(4) + quant[dims](1each)
+    const byteLen = 4 + 4 + 4 + 4 + dims;
+    const buf = new ArrayBuffer(byteLen);
+    const view = new DataView(buf);
+    const uint8 = new Uint8Array(buf);
+    view.setUint32(0, PQ_MAGIC, true);
+    view.setUint32(4, dims, true);
+    view.setFloat32(8, gMin, true);
+    view.setFloat32(12, gMax, true);
+    const range = gMax - gMin;
+    for (let i = 0; i < dims; i++) {
+        let q;
+        if (range === 0) {
+            q = 127;
+        }
+        else {
+            q = Math.round(((embedding[i] - gMin) / range) * 255);
+        }
+        uint8[16 + i] = Math.max(0, Math.min(255, q));
+    }
+    const b64 = Buffer.from(uint8).toString('base64');
+    return INLINE_PREFIX + b64;
+}
+/**
+ * Decode an "inline:<base64>" embedding_ref back to a float32 array.
+ * Returns null if the blob is malformed or uses an unrecognized format.
+ */
+export function decodeEmbedding(embeddingRef) {
+    if (!embeddingRef.startsWith(INLINE_PREFIX))
+        return null;
+    try {
+        const b64 = embeddingRef.slice(INLINE_PREFIX.length);
+        const raw = Buffer.from(b64, 'base64');
+        const view = new DataView(raw.buffer, raw.byteOffset, raw.byteLength);
+        if (view.getUint32(0, true) !== PQ_MAGIC)
+            return null;
+        const dims = view.getUint32(4, true);
+        const gMin = view.getFloat32(8, true);
+        const gMax = view.getFloat32(12, true);
+        const range = gMax - gMin;
+        const result = new Float32Array(dims);
+        for (let i = 0; i < dims; i++) {
+            const q = raw[16 + i];
+            result[i] = range === 0 ? gMin : gMin + (q / 255) * range;
+        }
+        return result;
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Compute the raw byte cost (before base64) of a quantized embedding blob.
+ * Useful for storage footprint assertions in tests.
+ */
+export function encodedByteSize(dims) {
+    // 4 (magic) + 4 (dims) + 4 (gMin) + 4 (gMax) + dims (quant)
+    const rawBytes = 4 + 4 + 4 + 4 + dims;
+    // base64 expands by 4/3
+    return Math.ceil(rawBytes / 3) * 4 + INLINE_PREFIX.length;
+}
+/**
+ * Cosine similarity between two inline-encoded embeddings.
+ * Decodes both, computes dot / (|a| × |b|).
+ * Returns 0 if either ref is invalid.
+ */
+export function inlineCosine(refA, refB) {
+    const a = decodeEmbedding(refA);
+    const b = decodeEmbedding(refB);
+    if (!a || !b || a.length !== b.length)
+        return 0;
+    let dot = 0, normA = 0, normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    return denom > 0 ? dot / denom : 0;
+}
+export function getEmbeddingRefTier(embeddingRef) {
+    if (!embeddingRef)
+        return 'none';
+    if (embeddingRef.startsWith('inline:'))
+        return 'inline';
+    if (embeddingRef.startsWith('vector_indexes:'))
+        return 'vector_indexes';
+    if (embeddingRef.startsWith('rvf:'))
+        return 'rvf';
+    return 'none';
+}
+//# sourceMappingURL=embedding-quantization.js.map

package/v3/@claude-flow/cli/dist/src/memory/graph-edge-writer.d.ts

@@ -0,0 +1,61 @@
+/**
+ * Graph Edge Writer — ADR-130 Phase 1
+ *
+ * Provides a minimal interface for inserting rows into the graph_edges
+ * sql.js table defined by MEMORY_SCHEMA_V3.
+ *
+ * This module is intentionally thin: it opens the shared sql.js SQLite db
+ * (the same file used by memory-initializer storeEntry), ensures the
+ * graph_edges table exists, and returns a better-sqlite3-compatible
+ * prepared-statement interface.
+ *
+ * The module is designed for fire-and-forget callers — every public function
+ * suppresses errors internally so callers never need try/catch.
+ *
+ * @module v3/cli/memory/graph-edge-writer
+ */
+/**
+ * Return the sql.js Database instance for graph_edges writes.
+ * Creates the graph_edges table if it is absent (idempotent).
+ * Returns null if sql.js is not available or db cannot be opened.
+ */
+export declare function getBridgeDb(customDbPath?: string): Promise<any | null>;
+export interface GraphEdgeInput {
+    sourceId: string;
+    targetId: string;
+    relation: string;
+    weight?: number;
+    confidence?: number;
+    decayRate?: number;
+    lastReinforced?: string;
+    witnessId?: string;
+    embedding?: number[];
+    metadata?: Record<string, unknown>;
+    dbPath?: string;
+}
+/**
+ * Insert a single edge into graph_edges.
+ * Fire-and-forget — errors are suppressed.
+ * Returns true if the write succeeded, false otherwise.
+ */
+export declare function insertGraphEdge(input: GraphEdgeInput): Promise<boolean>;
+/**
+ * Query graph_edges by source_id.
+ * Returns rows or empty array on error.
+ */
+export declare function queryEdgesBySource(sourceId: string, relation?: string, dbPath?: string): Promise<Array<{
+    id: string;
+    source_id: string;
+    target_id: string;
+    relation: string;
+    weight: number;
+}>>;
+/**
+ * Count rows in graph_edges (for test assertions).
+ */
+export declare function countGraphEdges(dbPath?: string): Promise<number>;
+/**
+ * Reset the cached db handle (for tests that need a fresh DB).
+ */
+export declare function _resetBridgeDb(): void;
+//# sourceMappingURL=graph-edge-writer.d.ts.map

package/v3/@claude-flow/cli/dist/src/memory/graph-edge-writer.js

@@ -0,0 +1,183 @@
+/**
+ * Graph Edge Writer — ADR-130 Phase 1
+ *
+ * Provides a minimal interface for inserting rows into the graph_edges
+ * sql.js table defined by MEMORY_SCHEMA_V3.
+ *
+ * This module is intentionally thin: it opens the shared sql.js SQLite db
+ * (the same file used by memory-initializer storeEntry), ensures the
+ * graph_edges table exists, and returns a better-sqlite3-compatible
+ * prepared-statement interface.
+ *
+ * The module is designed for fire-and-forget callers — every public function
+ * suppresses errors internally so callers never need try/catch.
+ *
+ * @module v3/cli/memory/graph-edge-writer
+ */
+import * as path from 'path';
+import * as fs from 'fs';
+import * as crypto from 'crypto';
+import { getMemoryRoot } from './memory-initializer.js';
+import { encodeEmbedding } from './embedding-quantization.js';
+// ============================================================================
+// Lazy-cached sql.js db handle
+// ============================================================================
+let _db = null;
+let _dbPath = '';
+let _dbInitializing = false;
+/**
+ * Return the sql.js Database instance for graph_edges writes.
+ * Creates the graph_edges table if it is absent (idempotent).
+ * Returns null if sql.js is not available or db cannot be opened.
+ */
+export async function getBridgeDb(customDbPath) {
+    const dbPath = customDbPath ?? path.join(getMemoryRoot(), 'memory.db');
+    if (_db && _dbPath === dbPath)
+        return _db;
+    if (_dbInitializing)
+        return null;
+    _dbInitializing = true;
+    try {
+        if (!fs.existsSync(dbPath))
+            return null;
+        const initSqlJs = (await import('sql.js')).default;
+        const SQL = await initSqlJs();
+        const fileBuffer = fs.readFileSync(dbPath);
+        const db = new SQL.Database(fileBuffer);
+        // Ensure graph_edges table exists (in case this is an older DB that
+        // predates ADR-130 Phase 1 schema migration).
+        db.run(`
+      CREATE TABLE IF NOT EXISTS graph_edges (
+        id              TEXT PRIMARY KEY,
+        source_id       TEXT NOT NULL,
+        target_id       TEXT NOT NULL,
+        relation        TEXT NOT NULL,
+        weight          REAL DEFAULT 1.0,
+        confidence      REAL DEFAULT 1.0,
+        decay_rate      REAL DEFAULT 0.0,
+        last_reinforced TEXT,
+        witness_id      TEXT,
+        embedding_ref   TEXT,
+        metadata        TEXT,
+        created_at      TEXT NOT NULL
+      )
+    `);
+        db.run(`CREATE INDEX IF NOT EXISTS idx_graph_edges_source ON graph_edges (source_id)`);
+        db.run(`CREATE INDEX IF NOT EXISTS idx_graph_edges_target ON graph_edges (target_id)`);
+        db.run(`CREATE INDEX IF NOT EXISTS idx_graph_edges_relation ON graph_edges (relation)`);
+        db.run(`CREATE INDEX IF NOT EXISTS idx_graph_edges_reinforced ON graph_edges (last_reinforced)`);
+        _db = db;
+        _dbPath = dbPath;
+        return db;
+    }
+    catch {
+        return null;
+    }
+    finally {
+        _dbInitializing = false;
+    }
+}
+/**
+ * Persist the in-memory sql.js database back to disk.
+ * Called after each write to keep the file consistent.
+ */
+async function flushDb(db) {
+    try {
+        if (!_dbPath)
+            return;
+        const data = db.export();
+        fs.writeFileSync(_dbPath, Buffer.from(data));
+    }
+    catch { /* non-fatal */ }
+}
+/**
+ * Insert a single edge into graph_edges.
+ * Fire-and-forget — errors are suppressed.
+ * Returns true if the write succeeded, false otherwise.
+ */
+export async function insertGraphEdge(input) {
+    try {
+        const db = await getBridgeDb(input.dbPath);
+        if (!db)
+            return false;
+        const id = `edge-${crypto.randomUUID()}`;
+        const createdAt = new Date().toISOString();
+        let embeddingRef = null;
+        if (input.embedding && input.embedding.length > 0) {
+            embeddingRef = encodeEmbedding(input.embedding);
+        }
+        const metaStr = input.metadata ? JSON.stringify(input.metadata) : null;
+        db.run(`INSERT OR IGNORE INTO graph_edges
+        (id, source_id, target_id, relation, weight, confidence, decay_rate,
+         last_reinforced, witness_id, embedding_ref, metadata, created_at)
+       VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)`, [
+            id,
+            input.sourceId,
+            input.targetId,
+            input.relation,
+            input.weight ?? 1.0,
+            input.confidence ?? 1.0,
+            input.decayRate ?? 0.0,
+            input.lastReinforced ?? null,
+            input.witnessId ?? null,
+            embeddingRef,
+            metaStr,
+            createdAt,
+        ]);
+        await flushDb(db);
+        return true;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Query graph_edges by source_id.
+ * Returns rows or empty array on error.
+ */
+export async function queryEdgesBySource(sourceId, relation, dbPath) {
+    try {
+        const db = await getBridgeDb(dbPath);
+        if (!db)
+            return [];
+        const sql = relation
+            ? `SELECT id, source_id, target_id, relation, weight FROM graph_edges WHERE source_id = ? AND relation = ? LIMIT 1000`
+            : `SELECT id, source_id, target_id, relation, weight FROM graph_edges WHERE source_id = ? LIMIT 1000`;
+        const args = relation ? [sourceId, relation] : [sourceId];
+        const result = db.exec(sql, args);
+        if (!result?.[0])
+            return [];
+        const cols = result[0].columns;
+        return result[0].values.map((row) => {
+            const obj = {};
+            cols.forEach((c, i) => { obj[c] = row[i]; });
+            return obj;
+        });
+    }
+    catch {
+        return [];
+    }
+}
+/**
+ * Count rows in graph_edges (for test assertions).
+ */
+export async function countGraphEdges(dbPath) {
+    try {
+        const db = await getBridgeDb(dbPath);
+        if (!db)
+            return 0;
+        const result = db.exec(`SELECT COUNT(*) FROM graph_edges`);
+        return result?.[0]?.values?.[0]?.[0] ?? 0;
+    }
+    catch {
+        return 0;
+    }
+}
+/**
+ * Reset the cached db handle (for tests that need a fresh DB).
+ */
+export function _resetBridgeDb() {
+    _db = null;
+    _dbPath = '';
+}
+//# sourceMappingURL=graph-edge-writer.js.map

package/v3/@claude-flow/cli/dist/src/memory/memory-initializer.d.ts

@@ -15,7 +15,7 @@ export declare function _resetMemoryRootCache(): void;
  * Enhanced schema with pattern confidence, temporal decay, versioning
  * Vector embeddings enabled for semantic search
  */
-export declare const MEMORY_SCHEMA_V3 = "\n-- RuFlo V3 Memory Database\n-- Version: 3.0.0\n-- Features: Pattern learning, vector embeddings, temporal decay, migration tracking\n\nPRAGMA journal_mode = WAL;\nPRAGMA synchronous = NORMAL;\nPRAGMA foreign_keys = ON;\n\n-- ============================================\n-- CORE MEMORY TABLES\n-- ============================================\n\n-- Memory entries (main storage)\nCREATE TABLE IF NOT EXISTS memory_entries (\n  id TEXT PRIMARY KEY,\n  key TEXT NOT NULL,\n  namespace TEXT DEFAULT 'default',\n  content TEXT NOT NULL,\n  type TEXT DEFAULT 'semantic' CHECK(type IN ('semantic', 'episodic', 'procedural', 'working', 'pattern')),\n\n  -- Vector embedding for semantic search (stored as JSON array)\n  embedding TEXT,\n  embedding_model TEXT DEFAULT 'local',\n  embedding_dimensions INTEGER,\n\n  -- Metadata\n  tags TEXT, -- JSON array\n  metadata TEXT, -- JSON object\n  owner_id TEXT,\n\n  -- Timestamps\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  expires_at INTEGER,\n  last_accessed_at INTEGER,\n\n  -- Access tracking for hot/cold detection\n  access_count INTEGER DEFAULT 0,\n\n  -- Status\n  status TEXT DEFAULT 'active' CHECK(status IN ('active', 'archived', 'deleted')),\n\n  UNIQUE(namespace, key)\n);\n\n-- Indexes for memory entries\nCREATE INDEX IF NOT EXISTS idx_memory_namespace ON memory_entries(namespace);\nCREATE INDEX IF NOT EXISTS idx_memory_key ON memory_entries(key);\nCREATE INDEX IF NOT EXISTS idx_memory_type ON memory_entries(type);\nCREATE INDEX IF NOT EXISTS idx_memory_status ON memory_entries(status);\nCREATE INDEX IF NOT EXISTS idx_memory_created ON memory_entries(created_at);\nCREATE INDEX IF NOT EXISTS idx_memory_accessed ON memory_entries(last_accessed_at);\nCREATE INDEX IF NOT EXISTS idx_memory_owner ON memory_entries(owner_id);\n\n-- ============================================\n-- PATTERN LEARNING TABLES\n-- ============================================\n\n-- Learned patterns with confidence scoring and versioning\nCREATE TABLE IF NOT EXISTS patterns (\n  id TEXT PRIMARY KEY,\n\n  -- Pattern identification\n  name TEXT NOT NULL,\n  pattern_type TEXT NOT NULL CHECK(pattern_type IN (\n    'task-routing', 'error-recovery', 'optimization', 'learning',\n    'coordination', 'prediction', 'code-pattern', 'workflow'\n  )),\n\n  -- Pattern definition\n  condition TEXT NOT NULL, -- Regex or semantic match\n  action TEXT NOT NULL, -- What to do when pattern matches\n  description TEXT,\n\n  -- Confidence scoring (0.0 - 1.0)\n  confidence REAL DEFAULT 0.5,\n  success_count INTEGER DEFAULT 0,\n  failure_count INTEGER DEFAULT 0,\n\n  -- Temporal decay\n  decay_rate REAL DEFAULT 0.01, -- How fast confidence decays\n  half_life_days INTEGER DEFAULT 30, -- Days until confidence halves without use\n\n  -- Vector embedding for semantic pattern matching\n  embedding TEXT,\n  embedding_dimensions INTEGER,\n\n  -- Versioning\n  version INTEGER DEFAULT 1,\n  parent_id TEXT REFERENCES patterns(id),\n\n  -- Metadata\n  tags TEXT, -- JSON array\n  metadata TEXT, -- JSON object\n  source TEXT, -- Where the pattern was learned from\n\n  -- Timestamps\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  last_matched_at INTEGER,\n  last_success_at INTEGER,\n  last_failure_at INTEGER,\n\n  -- Status\n  status TEXT DEFAULT 'active' CHECK(status IN ('active', 'archived', 'deprecated', 'experimental'))\n);\n\n-- Indexes for patterns\nCREATE INDEX IF NOT EXISTS idx_patterns_type ON patterns(pattern_type);\nCREATE INDEX IF NOT EXISTS idx_patterns_confidence ON patterns(confidence DESC);\nCREATE INDEX IF NOT EXISTS idx_patterns_status ON patterns(status);\nCREATE INDEX IF NOT EXISTS idx_patterns_last_matched ON patterns(last_matched_at);\n\n-- Pattern evolution history (for versioning)\nCREATE TABLE IF NOT EXISTS pattern_history (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  pattern_id TEXT NOT NULL REFERENCES patterns(id),\n  version INTEGER NOT NULL,\n\n  -- Snapshot of pattern state\n  confidence REAL,\n  success_count INTEGER,\n  failure_count INTEGER,\n  condition TEXT,\n  action TEXT,\n\n  -- What changed\n  change_type TEXT CHECK(change_type IN ('created', 'updated', 'success', 'failure', 'decay', 'merged', 'split')),\n  change_reason TEXT,\n\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000)\n);\n\nCREATE INDEX IF NOT EXISTS idx_pattern_history_pattern ON pattern_history(pattern_id);\n\n-- ============================================\n-- LEARNING & TRAJECTORY TABLES\n-- ============================================\n\n-- Learning trajectories (SONA integration)\nCREATE TABLE IF NOT EXISTS trajectories (\n  id TEXT PRIMARY KEY,\n  session_id TEXT,\n\n  -- Trajectory state\n  status TEXT DEFAULT 'active' CHECK(status IN ('active', 'completed', 'failed', 'abandoned')),\n  verdict TEXT CHECK(verdict IN ('success', 'failure', 'partial', NULL)),\n\n  -- Context\n  task TEXT,\n  context TEXT, -- JSON object\n\n  -- Metrics\n  total_steps INTEGER DEFAULT 0,\n  total_reward REAL DEFAULT 0,\n\n  -- Timestamps\n  started_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  ended_at INTEGER,\n\n  -- Reference to extracted pattern (if any)\n  extracted_pattern_id TEXT REFERENCES patterns(id)\n);\n\n-- Trajectory steps\nCREATE TABLE IF NOT EXISTS trajectory_steps (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  trajectory_id TEXT NOT NULL REFERENCES trajectories(id),\n  step_number INTEGER NOT NULL,\n\n  -- Step data\n  action TEXT NOT NULL,\n  observation TEXT,\n  reward REAL DEFAULT 0,\n\n  -- Metadata\n  metadata TEXT, -- JSON object\n\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000)\n);\n\nCREATE INDEX IF NOT EXISTS idx_steps_trajectory ON trajectory_steps(trajectory_id);\n\n-- ============================================\n-- MIGRATION STATE TRACKING\n-- ============================================\n\n-- Migration state (for resume capability)\nCREATE TABLE IF NOT EXISTS migration_state (\n  id TEXT PRIMARY KEY,\n  migration_type TEXT NOT NULL, -- 'v2-to-v3', 'pattern', 'memory', etc.\n\n  -- Progress tracking\n  status TEXT DEFAULT 'pending' CHECK(status IN ('pending', 'in_progress', 'completed', 'failed', 'rolled_back')),\n  total_items INTEGER DEFAULT 0,\n  processed_items INTEGER DEFAULT 0,\n  failed_items INTEGER DEFAULT 0,\n  skipped_items INTEGER DEFAULT 0,\n\n  -- Current position (for resume)\n  current_batch INTEGER DEFAULT 0,\n  last_processed_id TEXT,\n\n  -- Source/destination info\n  source_path TEXT,\n  source_type TEXT,\n  destination_path TEXT,\n\n  -- Backup info\n  backup_path TEXT,\n  backup_created_at INTEGER,\n\n  -- Error tracking\n  last_error TEXT,\n  errors TEXT, -- JSON array of errors\n\n  -- Timestamps\n  started_at INTEGER,\n  completed_at INTEGER,\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000)\n);\n\n-- ============================================\n-- SESSION MANAGEMENT\n-- ============================================\n\n-- Sessions for context persistence\nCREATE TABLE IF NOT EXISTS sessions (\n  id TEXT PRIMARY KEY,\n\n  -- Session state\n  state TEXT NOT NULL, -- JSON object with full session state\n  status TEXT DEFAULT 'active' CHECK(status IN ('active', 'paused', 'completed', 'expired')),\n\n  -- Context\n  project_path TEXT,\n  branch TEXT,\n\n  -- Metrics\n  tasks_completed INTEGER DEFAULT 0,\n  patterns_learned INTEGER DEFAULT 0,\n\n  -- Timestamps\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  expires_at INTEGER\n);\n\n-- ============================================\n-- VECTOR INDEX METADATA (for HNSW)\n-- ============================================\n\n-- Track HNSW index state\nCREATE TABLE IF NOT EXISTS vector_indexes (\n  id TEXT PRIMARY KEY,\n  name TEXT NOT NULL UNIQUE,\n\n  -- Index configuration\n  dimensions INTEGER NOT NULL,\n  metric TEXT DEFAULT 'cosine' CHECK(metric IN ('cosine', 'euclidean', 'dot')),\n\n  -- HNSW parameters\n  hnsw_m INTEGER DEFAULT 16,\n  hnsw_ef_construction INTEGER DEFAULT 200,\n  hnsw_ef_search INTEGER DEFAULT 100,\n\n  -- Quantization\n  quantization_type TEXT CHECK(quantization_type IN ('none', 'scalar', 'product')),\n  quantization_bits INTEGER DEFAULT 8,\n\n  -- Statistics\n  total_vectors INTEGER DEFAULT 0,\n  last_rebuild_at INTEGER,\n\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000)\n);\n\n-- ============================================\n-- SYSTEM METADATA\n-- ============================================\n\nCREATE TABLE IF NOT EXISTS metadata (\n  key TEXT PRIMARY KEY,\n  value TEXT NOT NULL,\n  updated_at INTEGER DEFAULT (strftime('%s', 'now') * 1000)\n);\n";
+export declare const MEMORY_SCHEMA_V3 = "\n-- RuFlo V3 Memory Database\n-- Version: 3.0.0\n-- Features: Pattern learning, vector embeddings, temporal decay, migration tracking\n\nPRAGMA journal_mode = WAL;\nPRAGMA synchronous = NORMAL;\nPRAGMA foreign_keys = ON;\n\n-- ============================================\n-- CORE MEMORY TABLES\n-- ============================================\n\n-- Memory entries (main storage)\nCREATE TABLE IF NOT EXISTS memory_entries (\n  id TEXT PRIMARY KEY,\n  key TEXT NOT NULL,\n  namespace TEXT DEFAULT 'default',\n  content TEXT NOT NULL,\n  type TEXT DEFAULT 'semantic' CHECK(type IN ('semantic', 'episodic', 'procedural', 'working', 'pattern')),\n\n  -- Vector embedding for semantic search (stored as JSON array)\n  embedding TEXT,\n  embedding_model TEXT DEFAULT 'local',\n  embedding_dimensions INTEGER,\n\n  -- Metadata\n  tags TEXT, -- JSON array\n  metadata TEXT, -- JSON object\n  owner_id TEXT,\n\n  -- Timestamps\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  expires_at INTEGER,\n  last_accessed_at INTEGER,\n\n  -- Access tracking for hot/cold detection\n  access_count INTEGER DEFAULT 0,\n\n  -- Status\n  status TEXT DEFAULT 'active' CHECK(status IN ('active', 'archived', 'deleted')),\n\n  UNIQUE(namespace, key)\n);\n\n-- Indexes for memory entries\nCREATE INDEX IF NOT EXISTS idx_memory_namespace ON memory_entries(namespace);\nCREATE INDEX IF NOT EXISTS idx_memory_key ON memory_entries(key);\nCREATE INDEX IF NOT EXISTS idx_memory_type ON memory_entries(type);\nCREATE INDEX IF NOT EXISTS idx_memory_status ON memory_entries(status);\nCREATE INDEX IF NOT EXISTS idx_memory_created ON memory_entries(created_at);\nCREATE INDEX IF NOT EXISTS idx_memory_accessed ON memory_entries(last_accessed_at);\nCREATE INDEX IF NOT EXISTS idx_memory_owner ON memory_entries(owner_id);\n\n-- ============================================\n-- PATTERN LEARNING TABLES\n-- ============================================\n\n-- Learned patterns with confidence scoring and versioning\nCREATE TABLE IF NOT EXISTS patterns (\n  id TEXT PRIMARY KEY,\n\n  -- Pattern identification\n  name TEXT NOT NULL,\n  pattern_type TEXT NOT NULL CHECK(pattern_type IN (\n    'task-routing', 'error-recovery', 'optimization', 'learning',\n    'coordination', 'prediction', 'code-pattern', 'workflow'\n  )),\n\n  -- Pattern definition\n  condition TEXT NOT NULL, -- Regex or semantic match\n  action TEXT NOT NULL, -- What to do when pattern matches\n  description TEXT,\n\n  -- Confidence scoring (0.0 - 1.0)\n  confidence REAL DEFAULT 0.5,\n  success_count INTEGER DEFAULT 0,\n  failure_count INTEGER DEFAULT 0,\n\n  -- Temporal decay\n  decay_rate REAL DEFAULT 0.01, -- How fast confidence decays\n  half_life_days INTEGER DEFAULT 30, -- Days until confidence halves without use\n\n  -- Vector embedding for semantic pattern matching\n  embedding TEXT,\n  embedding_dimensions INTEGER,\n\n  -- Versioning\n  version INTEGER DEFAULT 1,\n  parent_id TEXT REFERENCES patterns(id),\n\n  -- Metadata\n  tags TEXT, -- JSON array\n  metadata TEXT, -- JSON object\n  source TEXT, -- Where the pattern was learned from\n\n  -- Timestamps\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  last_matched_at INTEGER,\n  last_success_at INTEGER,\n  last_failure_at INTEGER,\n\n  -- Status\n  status TEXT DEFAULT 'active' CHECK(status IN ('active', 'archived', 'deprecated', 'experimental'))\n);\n\n-- Indexes for patterns\nCREATE INDEX IF NOT EXISTS idx_patterns_type ON patterns(pattern_type);\nCREATE INDEX IF NOT EXISTS idx_patterns_confidence ON patterns(confidence DESC);\nCREATE INDEX IF NOT EXISTS idx_patterns_status ON patterns(status);\nCREATE INDEX IF NOT EXISTS idx_patterns_last_matched ON patterns(last_matched_at);\n\n-- Pattern evolution history (for versioning)\nCREATE TABLE IF NOT EXISTS pattern_history (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  pattern_id TEXT NOT NULL REFERENCES patterns(id),\n  version INTEGER NOT NULL,\n\n  -- Snapshot of pattern state\n  confidence REAL,\n  success_count INTEGER,\n  failure_count INTEGER,\n  condition TEXT,\n  action TEXT,\n\n  -- What changed\n  change_type TEXT CHECK(change_type IN ('created', 'updated', 'success', 'failure', 'decay', 'merged', 'split')),\n  change_reason TEXT,\n\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000)\n);\n\nCREATE INDEX IF NOT EXISTS idx_pattern_history_pattern ON pattern_history(pattern_id);\n\n-- ============================================\n-- LEARNING & TRAJECTORY TABLES\n-- ============================================\n\n-- Learning trajectories (SONA integration)\nCREATE TABLE IF NOT EXISTS trajectories (\n  id TEXT PRIMARY KEY,\n  session_id TEXT,\n\n  -- Trajectory state\n  status TEXT DEFAULT 'active' CHECK(status IN ('active', 'completed', 'failed', 'abandoned')),\n  verdict TEXT CHECK(verdict IN ('success', 'failure', 'partial', NULL)),\n\n  -- Context\n  task TEXT,\n  context TEXT, -- JSON object\n\n  -- Metrics\n  total_steps INTEGER DEFAULT 0,\n  total_reward REAL DEFAULT 0,\n\n  -- Timestamps\n  started_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  ended_at INTEGER,\n\n  -- Reference to extracted pattern (if any)\n  extracted_pattern_id TEXT REFERENCES patterns(id)\n);\n\n-- Trajectory steps\nCREATE TABLE IF NOT EXISTS trajectory_steps (\n  id INTEGER PRIMARY KEY AUTOINCREMENT,\n  trajectory_id TEXT NOT NULL REFERENCES trajectories(id),\n  step_number INTEGER NOT NULL,\n\n  -- Step data\n  action TEXT NOT NULL,\n  observation TEXT,\n  reward REAL DEFAULT 0,\n\n  -- Metadata\n  metadata TEXT, -- JSON object\n\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000)\n);\n\nCREATE INDEX IF NOT EXISTS idx_steps_trajectory ON trajectory_steps(trajectory_id);\n\n-- ============================================\n-- MIGRATION STATE TRACKING\n-- ============================================\n\n-- Migration state (for resume capability)\nCREATE TABLE IF NOT EXISTS migration_state (\n  id TEXT PRIMARY KEY,\n  migration_type TEXT NOT NULL, -- 'v2-to-v3', 'pattern', 'memory', etc.\n\n  -- Progress tracking\n  status TEXT DEFAULT 'pending' CHECK(status IN ('pending', 'in_progress', 'completed', 'failed', 'rolled_back')),\n  total_items INTEGER DEFAULT 0,\n  processed_items INTEGER DEFAULT 0,\n  failed_items INTEGER DEFAULT 0,\n  skipped_items INTEGER DEFAULT 0,\n\n  -- Current position (for resume)\n  current_batch INTEGER DEFAULT 0,\n  last_processed_id TEXT,\n\n  -- Source/destination info\n  source_path TEXT,\n  source_type TEXT,\n  destination_path TEXT,\n\n  -- Backup info\n  backup_path TEXT,\n  backup_created_at INTEGER,\n\n  -- Error tracking\n  last_error TEXT,\n  errors TEXT, -- JSON array of errors\n\n  -- Timestamps\n  started_at INTEGER,\n  completed_at INTEGER,\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000)\n);\n\n-- ============================================\n-- SESSION MANAGEMENT\n-- ============================================\n\n-- Sessions for context persistence\nCREATE TABLE IF NOT EXISTS sessions (\n  id TEXT PRIMARY KEY,\n\n  -- Session state\n  state TEXT NOT NULL, -- JSON object with full session state\n  status TEXT DEFAULT 'active' CHECK(status IN ('active', 'paused', 'completed', 'expired')),\n\n  -- Context\n  project_path TEXT,\n  branch TEXT,\n\n  -- Metrics\n  tasks_completed INTEGER DEFAULT 0,\n  patterns_learned INTEGER DEFAULT 0,\n\n  -- Timestamps\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  expires_at INTEGER\n);\n\n-- ============================================\n-- VECTOR INDEX METADATA (for HNSW)\n-- ============================================\n\n-- Track HNSW index state\nCREATE TABLE IF NOT EXISTS vector_indexes (\n  id TEXT PRIMARY KEY,\n  name TEXT NOT NULL UNIQUE,\n\n  -- Index configuration\n  dimensions INTEGER NOT NULL,\n  metric TEXT DEFAULT 'cosine' CHECK(metric IN ('cosine', 'euclidean', 'dot')),\n\n  -- HNSW parameters\n  hnsw_m INTEGER DEFAULT 16,\n  hnsw_ef_construction INTEGER DEFAULT 200,\n  hnsw_ef_search INTEGER DEFAULT 100,\n\n  -- Quantization\n  quantization_type TEXT CHECK(quantization_type IN ('none', 'scalar', 'product')),\n  quantization_bits INTEGER DEFAULT 8,\n\n  -- Statistics\n  total_vectors INTEGER DEFAULT 0,\n  last_rebuild_at INTEGER,\n\n  created_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000),\n  updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000)\n);\n\n-- ============================================\n-- GRAPH EDGES (ADR-130 Phase 1)\n-- Unified knowledge graph backend \u2014 sql.js canonical store\n-- ============================================\n\n-- Unified graph edges table (ADR-130)\n-- Node IDs use domain-prefixed format: {domain}:{uuid}\n-- where domain in (mem, agent, task, entity, span, pattern)\nCREATE TABLE IF NOT EXISTS graph_edges (\n  id              TEXT PRIMARY KEY,          -- edge-{uuid}\n  source_id       TEXT NOT NULL,             -- domain-prefixed node ID\n  target_id       TEXT NOT NULL,             -- domain-prefixed node ID\n  relation        TEXT NOT NULL,             -- e.g. \"caused\", \"depends-on\", \"imports\"\n  weight          REAL DEFAULT 1.0,\n  -- Temporal / reliability semantics (ADR-130 \u00A7\"graph that forgets\" property)\n  confidence      REAL DEFAULT 1.0,          -- [0,1]; updated by JUDGE step\n  decay_rate      REAL DEFAULT 0.0,          -- per-day exponential decay applied at read time\n  last_reinforced TEXT,                      -- ISO-8601; set when CONSOLIDATE re-touches edge\n  witness_id      TEXT,                      -- FK to verification/witness-fixes.json (ADR-103)\n  -- Embedding storage: \"inline:{base64}\" | \"vector_indexes:{id}\" | NULL\n  embedding_ref   TEXT,\n  metadata        TEXT,                      -- JSON blob for plugin-specific fields\n  created_at      TEXT NOT NULL\n);\n\nCREATE INDEX IF NOT EXISTS idx_graph_edges_source    ON graph_edges (source_id);\nCREATE INDEX IF NOT EXISTS idx_graph_edges_target    ON graph_edges (target_id);\nCREATE INDEX IF NOT EXISTS idx_graph_edges_relation  ON graph_edges (relation);\nCREATE INDEX IF NOT EXISTS idx_graph_edges_reinforced ON graph_edges (last_reinforced);\n\n-- ============================================\n-- SYSTEM METADATA\n-- ============================================\n\nCREATE TABLE IF NOT EXISTS metadata (\n  key TEXT PRIMARY KEY,\n  value TEXT NOT NULL,\n  updated_at INTEGER DEFAULT (strftime('%s', 'now') * 1000)\n);\n";
 interface HNSWEntry {
     id: string;
     key: string;

package/v3/@claude-flow/cli/dist/src/memory/memory-initializer.js

@@ -373,6 +373,36 @@ CREATE TABLE IF NOT EXISTS vector_indexes (
   updated_at INTEGER NOT NULL DEFAULT (strftime('%s', 'now') * 1000)
 );
 
+-- ============================================
+-- GRAPH EDGES (ADR-130 Phase 1)
+-- Unified knowledge graph backend — sql.js canonical store
+-- ============================================
+
+-- Unified graph edges table (ADR-130)
+-- Node IDs use domain-prefixed format: {domain}:{uuid}
+-- where domain in (mem, agent, task, entity, span, pattern)
+CREATE TABLE IF NOT EXISTS graph_edges (
+  id              TEXT PRIMARY KEY,          -- edge-{uuid}
+  source_id       TEXT NOT NULL,             -- domain-prefixed node ID
+  target_id       TEXT NOT NULL,             -- domain-prefixed node ID
+  relation        TEXT NOT NULL,             -- e.g. "caused", "depends-on", "imports"
+  weight          REAL DEFAULT 1.0,
+  -- Temporal / reliability semantics (ADR-130 §"graph that forgets" property)
+  confidence      REAL DEFAULT 1.0,          -- [0,1]; updated by JUDGE step
+  decay_rate      REAL DEFAULT 0.0,          -- per-day exponential decay applied at read time
+  last_reinforced TEXT,                      -- ISO-8601; set when CONSOLIDATE re-touches edge
+  witness_id      TEXT,                      -- FK to verification/witness-fixes.json (ADR-103)
+  -- Embedding storage: "inline:{base64}" | "vector_indexes:{id}" | NULL
+  embedding_ref   TEXT,
+  metadata        TEXT,                      -- JSON blob for plugin-specific fields
+  created_at      TEXT NOT NULL
+);
+
+CREATE INDEX IF NOT EXISTS idx_graph_edges_source    ON graph_edges (source_id);
+CREATE INDEX IF NOT EXISTS idx_graph_edges_target    ON graph_edges (target_id);
+CREATE INDEX IF NOT EXISTS idx_graph_edges_relation  ON graph_edges (relation);
+CREATE INDEX IF NOT EXISTS idx_graph_edges_reinforced ON graph_edges (last_reinforced);
+
 -- ============================================
 -- SYSTEM METADATA
 -- ============================================

package/v3/@claude-flow/cli/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@claude-flow/cli",
-  "version": "3.8.0",
+  "version": "3.9.0",
   "type": "module",
   "description": "Ruflo CLI - Enterprise AI agent orchestration with 60+ specialized agents, swarm coordination, MCP server, self-learning hooks, and vector memory for Claude Code",
   "main": "dist/src/index.js",