agentdb 1.0.0

package/dist/reasoning/pattern-matcher.d.ts

@@ -0,0 +1,59 @@
+/**
+ * PatternMatcher - Recognize similar reasoning patterns from past executions
+ *
+ * Learns from task execution history to identify patterns that work.
+ * Uses vector similarity to match current tasks to successful patterns.
+ */
+import { SQLiteVectorDB } from '../core/vector-db';
+import { Pattern } from '../types';
+export declare class PatternMatcher {
+    private db;
+    private patternTable;
+    constructor(db: SQLiteVectorDB);
+    private initializePatternStorage;
+    /**
+     * Store a new pattern from successful task execution
+     */
+    storePattern(pattern: Omit<Pattern, 'id' | 'timestamp'>): Promise<string>;
+    /**
+     * Find similar patterns based on task embedding
+     *
+     * @param taskEmbedding - Vector embedding of current task
+     * @param k - Number of similar patterns to return
+     * @param threshold - Minimum similarity score (0-1)
+     * @param filters - Optional filters (domain, taskType, etc.)
+     * @returns Array of similar patterns sorted by similarity
+     */
+    findSimilar(taskEmbedding: number[], k?: number, threshold?: number, filters?: {
+        domain?: string;
+        taskType?: string;
+        minSuccessRate?: number;
+    }): Promise<Array<Pattern & {
+        similarity: number;
+    }>>;
+    /**
+     * Update pattern with new execution data (incremental learning)
+     */
+    updatePattern(id: string, update: {
+        success: boolean;
+        duration: number;
+    }): Promise<void>;
+    /**
+     * Get pattern by ID
+     */
+    getPattern(id: string): Promise<Pattern | null>;
+    /**
+     * Get statistics about learned patterns
+     */
+    getStats(): {
+        totalPatterns: number;
+        avgSuccessRate: number;
+        domainDistribution: Map<string, number>;
+        topPatterns: Array<{
+            taskType: string;
+            successRate: number;
+        }>;
+    };
+    private generatePatternId;
+}
+//# sourceMappingURL=pattern-matcher.d.ts.map

package/dist/reasoning/pattern-matcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pattern-matcher.d.ts","sourceRoot":"","sources":["../../src/reasoning/pattern-matcher.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AACnD,OAAO,EAAE,OAAO,EAAmB,MAAM,UAAU,CAAC;AAEpD,qBAAa,cAAc;IACzB,OAAO,CAAC,EAAE,CAAiB;IAC3B,OAAO,CAAC,YAAY,CAAwB;gBAEhC,EAAE,EAAE,cAAc;IAK9B,OAAO,CAAC,wBAAwB;IAyBhC;;OAEG;IACG,YAAY,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,GAAG,WAAW,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IA2C/E;;;;;;;;OAQG;IACG,WAAW,CACf,aAAa,EAAE,MAAM,EAAE,EACvB,CAAC,GAAE,MAAU,EACb,SAAS,GAAE,MAAY,EACvB,OAAO,CAAC,EAAE;QACR,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,cAAc,CAAC,EAAE,MAAM,CAAC;KACzB,GACA,OAAO,CAAC,KAAK,CAAC,OAAO,GAAG;QAAE,UAAU,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAoEnD;;OAEG;IACG,aAAa,CACjB,EAAE,EAAE,MAAM,EACV,MAAM,EAAE;QACN,OAAO,EAAE,OAAO,CAAC;QACjB,QAAQ,EAAE,MAAM,CAAC;KAClB,GACA,OAAO,CAAC,IAAI,CAAC;IA4BhB;;OAEG;IACG,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC;IA6BrD;;OAEG;IACH,QAAQ,IAAI;QACV,aAAa,EAAE,MAAM,CAAC;QACtB,cAAc,EAAE,MAAM,CAAC;QACvB,kBAAkB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACxC,WAAW,EAAE,KAAK,CAAC;YAAE,QAAQ,EAAE,MAAM,CAAC;YAAC,WAAW,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;KAC/D;IA2CD,OAAO,CAAC,iBAAiB;CAG1B"}

package/dist/reasoning/pattern-matcher.js

@@ -0,0 +1,229 @@
+"use strict";
+/**
+ * PatternMatcher - Recognize similar reasoning patterns from past executions
+ *
+ * Learns from task execution history to identify patterns that work.
+ * Uses vector similarity to match current tasks to successful patterns.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.PatternMatcher = void 0;
+class PatternMatcher {
+    constructor(db) {
+        this.patternTable = 'reasoning_patterns';
+        this.db = db;
+        this.initializePatternStorage();
+    }
+    initializePatternStorage() {
+        const rawDb = this.db.getDatabase();
+        rawDb.exec(`
+      CREATE TABLE IF NOT EXISTS ${this.patternTable} (
+        id TEXT PRIMARY KEY,
+        task_type TEXT NOT NULL,
+        approach TEXT NOT NULL,
+        success_rate REAL NOT NULL,
+        avg_duration REAL NOT NULL,
+        iterations INTEGER DEFAULT 1,
+        domain TEXT NOT NULL,
+        complexity TEXT NOT NULL,
+        learning_source TEXT NOT NULL,
+        tags TEXT,
+        metadata TEXT,
+        timestamp INTEGER NOT NULL
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_patterns_task_type ON ${this.patternTable}(task_type);
+      CREATE INDEX IF NOT EXISTS idx_patterns_domain ON ${this.patternTable}(domain);
+      CREATE INDEX IF NOT EXISTS idx_patterns_success ON ${this.patternTable}(success_rate);
+    `);
+    }
+    /**
+     * Store a new pattern from successful task execution
+     */
+    async storePattern(pattern) {
+        const id = this.generatePatternId();
+        const timestamp = Date.now();
+        // Store vector embedding for similarity matching
+        this.db.insert({
+            id: `pattern_${id}`,
+            embedding: pattern.embedding,
+            metadata: {
+                type: 'pattern',
+                patternId: id,
+                taskType: pattern.taskType,
+                domain: pattern.metadata.domain
+            },
+            timestamp
+        });
+        // Store pattern metadata
+        const rawDb = this.db.getDatabase();
+        const stmt = rawDb.prepare(`
+      INSERT INTO ${this.patternTable}
+      (id, task_type, approach, success_rate, avg_duration, domain, complexity,
+       learning_source, tags, metadata, timestamp)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
+    `);
+        stmt.run(id, pattern.taskType, pattern.approach, pattern.successRate, pattern.avgDuration, pattern.metadata.domain, pattern.metadata.complexity, pattern.metadata.learningSource, JSON.stringify(pattern.metadata.tags || []), JSON.stringify(pattern.metadata), timestamp);
+        return id;
+    }
+    /**
+     * Find similar patterns based on task embedding
+     *
+     * @param taskEmbedding - Vector embedding of current task
+     * @param k - Number of similar patterns to return
+     * @param threshold - Minimum similarity score (0-1)
+     * @param filters - Optional filters (domain, taskType, etc.)
+     * @returns Array of similar patterns sorted by similarity
+     */
+    async findSimilar(taskEmbedding, k = 5, threshold = 0.7, filters) {
+        const startTime = Date.now();
+        // Search for similar pattern embeddings
+        const results = this.db.search(taskEmbedding, k * 2, 'cosine', threshold);
+        // Filter to pattern vectors only
+        const patternResults = results.filter(r => r.metadata?.type === 'pattern');
+        // Get full pattern metadata
+        const rawDb = this.db.getDatabase();
+        const patterns = [];
+        for (const result of patternResults) {
+            const metadata = result.metadata || {};
+            const patternId = metadata.patternId;
+            let sql = `SELECT * FROM ${this.patternTable} WHERE id = ?`;
+            const params = [patternId];
+            if (filters?.minSuccessRate) {
+                sql += ' AND success_rate >= ?';
+                params.push(filters.minSuccessRate);
+            }
+            if (filters?.domain) {
+                sql += ' AND domain = ?';
+                params.push(filters.domain);
+            }
+            if (filters?.taskType) {
+                sql += ' AND task_type = ?';
+                params.push(filters.taskType);
+            }
+            const stmt = rawDb.prepare(sql);
+            const row = stmt.get(...params);
+            if (row) {
+                patterns.push({
+                    id: row.id,
+                    embedding: result.embedding,
+                    taskType: row.task_type,
+                    approach: row.approach,
+                    successRate: row.success_rate,
+                    avgDuration: row.avg_duration,
+                    metadata: {
+                        ...JSON.parse(row.metadata),
+                        iterations: row.iterations,
+                        domain: row.domain,
+                        complexity: row.complexity,
+                        learningSource: row.learning_source,
+                        tags: JSON.parse(row.tags)
+                    },
+                    timestamp: row.timestamp,
+                    similarity: result.score
+                });
+            }
+            if (patterns.length >= k)
+                break;
+        }
+        const duration = Date.now() - startTime;
+        console.log(`[PatternMatcher] Found ${patterns.length} patterns in ${duration}ms`);
+        return patterns;
+    }
+    /**
+     * Update pattern with new execution data (incremental learning)
+     */
+    async updatePattern(id, update) {
+        const rawDb = this.db.getDatabase();
+        // Get current pattern data
+        const stmt = rawDb.prepare(`SELECT * FROM ${this.patternTable} WHERE id = ?`);
+        const row = stmt.get(id);
+        if (!row) {
+            throw new Error(`Pattern ${id} not found`);
+        }
+        // Calculate new averages (incremental update)
+        const iterations = row.iterations + 1;
+        const newSuccessRate = ((row.success_rate * row.iterations) + (update.success ? 1 : 0)) / iterations;
+        const newAvgDuration = ((row.avg_duration * row.iterations) + update.duration) / iterations;
+        // Update pattern
+        const updateStmt = rawDb.prepare(`
+      UPDATE ${this.patternTable}
+      SET success_rate = ?,
+          avg_duration = ?,
+          iterations = ?
+      WHERE id = ?
+    `);
+        updateStmt.run(newSuccessRate, newAvgDuration, iterations, id);
+    }
+    /**
+     * Get pattern by ID
+     */
+    async getPattern(id) {
+        const rawDb = this.db.getDatabase();
+        const stmt = rawDb.prepare(`SELECT * FROM ${this.patternTable} WHERE id = ?`);
+        const row = stmt.get(id);
+        if (!row)
+            return null;
+        // Get embedding from vector database
+        const vector = this.db.get(`pattern_${id}`);
+        return {
+            id: row.id,
+            embedding: vector?.embedding || [],
+            taskType: row.task_type,
+            approach: row.approach,
+            successRate: row.success_rate,
+            avgDuration: row.avg_duration,
+            metadata: {
+                ...JSON.parse(row.metadata),
+                iterations: row.iterations,
+                domain: row.domain,
+                complexity: row.complexity,
+                learningSource: row.learning_source,
+                tags: JSON.parse(row.tags)
+            },
+            timestamp: row.timestamp
+        };
+    }
+    /**
+     * Get statistics about learned patterns
+     */
+    getStats() {
+        const rawDb = this.db.getDatabase();
+        // Total patterns
+        const countStmt = rawDb.prepare(`SELECT COUNT(*) as count FROM ${this.patternTable}`);
+        const totalPatterns = countStmt.get().count;
+        // Average success rate
+        const avgStmt = rawDb.prepare(`SELECT AVG(success_rate) as avg FROM ${this.patternTable}`);
+        const avgSuccessRate = avgStmt.get().avg || 0;
+        // Domain distribution
+        const domainStmt = rawDb.prepare(`
+      SELECT domain, COUNT(*) as count
+      FROM ${this.patternTable}
+      GROUP BY domain
+    `);
+        const domainRows = domainStmt.all();
+        const domainDistribution = new Map(domainRows.map(row => [row.domain, row.count]));
+        // Top patterns by success rate
+        const topStmt = rawDb.prepare(`
+      SELECT task_type, success_rate
+      FROM ${this.patternTable}
+      WHERE iterations >= 3
+      ORDER BY success_rate DESC
+      LIMIT 10
+    `);
+        const topPatterns = topStmt.all().map(row => ({
+            taskType: row.task_type,
+            successRate: row.success_rate
+        }));
+        return {
+            totalPatterns,
+            avgSuccessRate,
+            domainDistribution,
+            topPatterns
+        };
+    }
+    generatePatternId() {
+        return `pat_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`;
+    }
+}
+exports.PatternMatcher = PatternMatcher;
+//# sourceMappingURL=pattern-matcher.js.map

package/dist/reasoning/pattern-matcher.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pattern-matcher.js","sourceRoot":"","sources":["../../src/reasoning/pattern-matcher.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAKH,MAAa,cAAc;IAIzB,YAAY,EAAkB;QAFtB,iBAAY,GAAG,oBAAoB,CAAC;QAG1C,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,wBAAwB,EAAE,CAAC;IAClC,CAAC;IAEO,wBAAwB;QAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QAEpC,KAAK,CAAC,IAAI,CAAC;mCACoB,IAAI,CAAC,YAAY;;;;;;;;;;;;;;;6DAeS,IAAI,CAAC,YAAY;0DACpB,IAAI,CAAC,YAAY;2DAChB,IAAI,CAAC,YAAY;KACvE,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAAC,OAA0C;QAC3D,MAAM,EAAE,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC;QACpC,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,iDAAiD;QACjD,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC;YACb,EAAE,EAAE,WAAW,EAAE,EAAE;YACnB,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,QAAQ,EAAE;gBACR,IAAI,EAAE,SAAS;gBACf,SAAS,EAAE,EAAE;gBACb,QAAQ,EAAE,OAAO,CAAC,QAAQ;gBAC1B,MAAM,EAAE,OAAO,CAAC,QAAQ,CAAC,MAAM;aAChC;YACD,SAAS;SACV,CAAC,CAAC;QAEH,yBAAyB;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC;oBACX,IAAI,CAAC,YAAY;;;;KAIhC,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CACN,EAAE,EACF,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,WAAW,EACnB,OAAO,CAAC,WAAW,EACnB,OAAO,CAAC,QAAQ,CAAC,MAAM,EACvB,OAAO,CAAC,QAAQ,CAAC,UAAU,EAC3B,OAAO,CAAC,QAAQ,CAAC,cAAc,EAC/B,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC,EAC3C,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,EAChC,SAAS,CACV,CAAC;QAEF,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,WAAW,CACf,aAAuB,EACvB,IAAY,CAAC,EACb,YAAoB,GAAG,EACvB,OAIC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAE7B,wCAAwC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QAE1E,iCAAiC;QACjC,MAAM,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,IAAI,KAAK,SAAS,CAAC,CAAC;QAE3E,4BAA4B;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,QAAQ,GAA4C,EAAE,CAAC;QAE7D,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;YACpC,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,EAAE,CAAC;YACvC,MAAM,SAAS,GAAG,QAAQ,CAAC,SAAS,CAAC;YAErC,IAAI,GAAG,GAAG,iBAAiB,IAAI,CAAC,YAAY,eAAe,CAAC;YAC5D,MAAM,MAAM,GAAU,CAAC,SAAS,CAAC,CAAC;YAElC,IAAI,OAAO,EAAE,cAAc,EAAE,CAAC;gBAC5B,GAAG,IAAI,wBAAwB,CAAC;gBAChC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YACtC,CAAC;YAED,IAAI,OAAO,EAAE,MAAM,EAAE,CAAC;gBACpB,GAAG,IAAI,iBAAiB,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAC9B,CAAC;YAED,IAAI,OAAO,EAAE,QAAQ,EAAE,CAAC;gBACtB,GAAG,IAAI,oBAAoB,CAAC;gBAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAChC,CAAC;YAED,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAChC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAQ,CAAC;YAEvC,IAAI,GAAG,EAAE,CAAC;gBACR,QAAQ,CAAC,IAAI,CAAC;oBACZ,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,SAAS,EAAE,MAAM,CAAC,SAAS;oBAC3B,QAAQ,EAAE,GAAG,CAAC,SAAS;oBACvB,QAAQ,EAAE,GAAG,CAAC,QAAQ;oBACtB,WAAW,EAAE,GAAG,CAAC,YAAY;oBAC7B,WAAW,EAAE,GAAG,CAAC,YAAY;oBAC7B,QAAQ,EAAE;wBACR,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;wBAC3B,UAAU,EAAE,GAAG,CAAC,UAAU;wBAC1B,MAAM,EAAE,GAAG,CAAC,MAAM;wBAClB,UAAU,EAAE,GAAG,CAAC,UAAU;wBAC1B,cAAc,EAAE,GAAG,CAAC,eAAe;wBACnC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;qBAC3B;oBACD,SAAS,EAAE,GAAG,CAAC,SAAS;oBACxB,UAAU,EAAE,MAAM,CAAC,KAAK;iBACzB,CAAC,CAAC;YACL,CAAC;YAED,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC;gBAAE,MAAM;QAClC,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QACxC,OAAO,CAAC,GAAG,CAAC,0BAA0B,QAAQ,CAAC,MAAM,gBAAgB,QAAQ,IAAI,CAAC,CAAC;QAEnF,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CACjB,EAAU,EACV,MAGC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QAEpC,2BAA2B;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,iBAAiB,IAAI,CAAC,YAAY,eAAe,CAAC,CAAC;QAC9E,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAQ,CAAC;QAEhC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,MAAM,IAAI,KAAK,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QAC7C,CAAC;QAED,8CAA8C;QAC9C,MAAM,UAAU,GAAG,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC;QACtC,MAAM,cAAc,GAAG,CAAC,CAAC,GAAG,CAAC,YAAY,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;QACrG,MAAM,cAAc,GAAG,CAAC,CAAC,GAAG,CAAC,YAAY,GAAG,GAAG,CAAC,UAAU,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,UAAU,CAAC;QAE5F,iBAAiB;QACjB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC;eACtB,IAAI,CAAC,YAAY;;;;;KAK3B,CAAC,CAAC;QAEH,UAAU,CAAC,GAAG,CAAC,cAAc,EAAE,cAAc,EAAE,UAAU,EAAE,EAAE,CAAC,CAAC;IACjE,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,EAAU;QACzB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,iBAAiB,IAAI,CAAC,YAAY,eAAe,CAAC,CAAC;QAC9E,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAQ,CAAC;QAEhC,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAEtB,qCAAqC;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;QAE5C,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,SAAS,EAAE,MAAM,EAAE,SAAS,IAAI,EAAE;YAClC,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,WAAW,EAAE,GAAG,CAAC,YAAY;YAC7B,WAAW,EAAE,GAAG,CAAC,YAAY;YAC7B,QAAQ,EAAE;gBACR,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC;gBAC3B,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,cAAc,EAAE,GAAG,CAAC,eAAe;gBACnC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;aAC3B;YACD,SAAS,EAAE,GAAG,CAAC,SAAS;SACzB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,QAAQ;QAMN,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC;QAEpC,iBAAiB;QACjB,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,iCAAiC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;QACtF,MAAM,aAAa,GAAI,SAAS,CAAC,GAAG,EAAU,CAAC,KAAK,CAAC;QAErD,uBAAuB;QACvB,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,wCAAwC,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;QAC3F,MAAM,cAAc,GAAI,OAAO,CAAC,GAAG,EAAU,CAAC,GAAG,IAAI,CAAC,CAAC;QAEvD,sBAAsB;QACtB,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC;;aAExB,IAAI,CAAC,YAAY;;KAEzB,CAAC,CAAC;QACH,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,EAAW,CAAC;QAC7C,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAChC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAC/C,CAAC;QAEF,+BAA+B;QAC/B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;;aAErB,IAAI,CAAC,YAAY;;;;KAIzB,CAAC,CAAC;QACH,MAAM,WAAW,GAAI,OAAO,CAAC,GAAG,EAAY,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACvD,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,WAAW,EAAE,GAAG,CAAC,YAAY;SAC9B,CAAC,CAAC,CAAC;QAEJ,OAAO;YACL,aAAa;YACb,cAAc;YACd,kBAAkB;YAClB,WAAW;SACZ,CAAC;IACJ,CAAC;IAEO,iBAAiB;QACvB,OAAO,OAAO,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;IACxE,CAAC;CACF;AAjSD,wCAiSC"}

package/dist/reasoning/pattern-matcher.mjs

@@ -0,0 +1,224 @@
+/**
+ * PatternMatcher - Recognize similar reasoning patterns from past executions
+ *
+ * Learns from task execution history to identify patterns that work.
+ * Uses vector similarity to match current tasks to successful patterns.
+ */
+export class PatternMatcher {
+    constructor(db) {
+        this.patternTable = 'reasoning_patterns';
+        this.db = db;
+        this.initializePatternStorage();
+    }
+    initializePatternStorage() {
+        const rawDb = this.db.getDatabase();
+        rawDb.exec(`
+      CREATE TABLE IF NOT EXISTS ${this.patternTable} (
+        id TEXT PRIMARY KEY,
+        task_type TEXT NOT NULL,
+        approach TEXT NOT NULL,
+        success_rate REAL NOT NULL,
+        avg_duration REAL NOT NULL,
+        iterations INTEGER DEFAULT 1,
+        domain TEXT NOT NULL,
+        complexity TEXT NOT NULL,
+        learning_source TEXT NOT NULL,
+        tags TEXT,
+        metadata TEXT,
+        timestamp INTEGER NOT NULL
+      );
+
+      CREATE INDEX IF NOT EXISTS idx_patterns_task_type ON ${this.patternTable}(task_type);
+      CREATE INDEX IF NOT EXISTS idx_patterns_domain ON ${this.patternTable}(domain);
+      CREATE INDEX IF NOT EXISTS idx_patterns_success ON ${this.patternTable}(success_rate);
+    `);
+    }
+    /**
+     * Store a new pattern from successful task execution
+     */
+    async storePattern(pattern) {
+        const id = this.generatePatternId();
+        const timestamp = Date.now();
+        // Store vector embedding for similarity matching
+        this.db.insert({
+            id: `pattern_${id}`,
+            embedding: pattern.embedding,
+            metadata: {
+                type: 'pattern',
+                patternId: id,
+                taskType: pattern.taskType,
+                domain: pattern.metadata.domain
+            },
+            timestamp
+        });
+        // Store pattern metadata
+        const rawDb = this.db.getDatabase();
+        const stmt = rawDb.prepare(`
+      INSERT INTO ${this.patternTable}
+      (id, task_type, approach, success_rate, avg_duration, domain, complexity,
+       learning_source, tags, metadata, timestamp)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?)
+    `);
+        stmt.run(id, pattern.taskType, pattern.approach, pattern.successRate, pattern.avgDuration, pattern.metadata.domain, pattern.metadata.complexity, pattern.metadata.learningSource, JSON.stringify(pattern.metadata.tags || []), JSON.stringify(pattern.metadata), timestamp);
+        return id;
+    }
+    /**
+     * Find similar patterns based on task embedding
+     *
+     * @param taskEmbedding - Vector embedding of current task
+     * @param k - Number of similar patterns to return
+     * @param threshold - Minimum similarity score (0-1)
+     * @param filters - Optional filters (domain, taskType, etc.)
+     * @returns Array of similar patterns sorted by similarity
+     */
+    async findSimilar(taskEmbedding, k = 5, threshold = 0.7, filters) {
+        const startTime = Date.now();
+        // Search for similar pattern embeddings
+        const results = this.db.search(taskEmbedding, k * 2, 'cosine', threshold);
+        // Filter to pattern vectors only
+        const patternResults = results.filter(r => r.metadata?.type === 'pattern');
+        // Get full pattern metadata
+        const rawDb = this.db.getDatabase();
+        const patterns = [];
+        for (const result of patternResults) {
+            const metadata = result.metadata || {};
+            const patternId = metadata.patternId;
+            let sql = `SELECT * FROM ${this.patternTable} WHERE id = ?`;
+            const params = [patternId];
+            if (filters?.minSuccessRate) {
+                sql += ' AND success_rate >= ?';
+                params.push(filters.minSuccessRate);
+            }
+            if (filters?.domain) {
+                sql += ' AND domain = ?';
+                params.push(filters.domain);
+            }
+            if (filters?.taskType) {
+                sql += ' AND task_type = ?';
+                params.push(filters.taskType);
+            }
+            const stmt = rawDb.prepare(sql);
+            const row = stmt.get(...params);
+            if (row) {
+                patterns.push({
+                    id: row.id,
+                    embedding: result.embedding,
+                    taskType: row.task_type,
+                    approach: row.approach,
+                    successRate: row.success_rate,
+                    avgDuration: row.avg_duration,
+                    metadata: {
+                        ...JSON.parse(row.metadata),
+                        iterations: row.iterations,
+                        domain: row.domain,
+                        complexity: row.complexity,
+                        learningSource: row.learning_source,
+                        tags: JSON.parse(row.tags)
+                    },
+                    timestamp: row.timestamp,
+                    similarity: result.score
+                });
+            }
+            if (patterns.length >= k)
+                break;
+        }
+        const duration = Date.now() - startTime;
+        console.log(`[PatternMatcher] Found ${patterns.length} patterns in ${duration}ms`);
+        return patterns;
+    }
+    /**
+     * Update pattern with new execution data (incremental learning)
+     */
+    async updatePattern(id, update) {
+        const rawDb = this.db.getDatabase();
+        // Get current pattern data
+        const stmt = rawDb.prepare(`SELECT * FROM ${this.patternTable} WHERE id = ?`);
+        const row = stmt.get(id);
+        if (!row) {
+            throw new Error(`Pattern ${id} not found`);
+        }
+        // Calculate new averages (incremental update)
+        const iterations = row.iterations + 1;
+        const newSuccessRate = ((row.success_rate * row.iterations) + (update.success ? 1 : 0)) / iterations;
+        const newAvgDuration = ((row.avg_duration * row.iterations) + update.duration) / iterations;
+        // Update pattern
+        const updateStmt = rawDb.prepare(`
+      UPDATE ${this.patternTable}
+      SET success_rate = ?,
+          avg_duration = ?,
+          iterations = ?
+      WHERE id = ?
+    `);
+        updateStmt.run(newSuccessRate, newAvgDuration, iterations, id);
+    }
+    /**
+     * Get pattern by ID
+     */
+    async getPattern(id) {
+        const rawDb = this.db.getDatabase();
+        const stmt = rawDb.prepare(`SELECT * FROM ${this.patternTable} WHERE id = ?`);
+        const row = stmt.get(id);
+        if (!row)
+            return null;
+        // Get embedding from vector database
+        const vector = this.db.get(`pattern_${id}`);
+        return {
+            id: row.id,
+            embedding: vector?.embedding || [],
+            taskType: row.task_type,
+            approach: row.approach,
+            successRate: row.success_rate,
+            avgDuration: row.avg_duration,
+            metadata: {
+                ...JSON.parse(row.metadata),
+                iterations: row.iterations,
+                domain: row.domain,
+                complexity: row.complexity,
+                learningSource: row.learning_source,
+                tags: JSON.parse(row.tags)
+            },
+            timestamp: row.timestamp
+        };
+    }
+    /**
+     * Get statistics about learned patterns
+     */
+    getStats() {
+        const rawDb = this.db.getDatabase();
+        // Total patterns
+        const countStmt = rawDb.prepare(`SELECT COUNT(*) as count FROM ${this.patternTable}`);
+        const totalPatterns = countStmt.get().count;
+        // Average success rate
+        const avgStmt = rawDb.prepare(`SELECT AVG(success_rate) as avg FROM ${this.patternTable}`);
+        const avgSuccessRate = avgStmt.get().avg || 0;
+        // Domain distribution
+        const domainStmt = rawDb.prepare(`
+      SELECT domain, COUNT(*) as count
+      FROM ${this.patternTable}
+      GROUP BY domain
+    `);
+        const domainRows = domainStmt.all();
+        const domainDistribution = new Map(domainRows.map(row => [row.domain, row.count]));
+        // Top patterns by success rate
+        const topStmt = rawDb.prepare(`
+      SELECT task_type, success_rate
+      FROM ${this.patternTable}
+      WHERE iterations >= 3
+      ORDER BY success_rate DESC
+      LIMIT 10
+    `);
+        const topPatterns = topStmt.all().map(row => ({
+            taskType: row.task_type,
+            successRate: row.success_rate
+        }));
+        return {
+            totalPatterns,
+            avgSuccessRate,
+            domainDistribution,
+            topPatterns
+        };
+    }
+    generatePatternId() {
+        return `pat_${Date.now()}_${Math.random().toString(36).substr(2, 9)}`;
+    }
+}

package/dist/reasoningbank/adapter/agentdb-adapter.d.ts

@@ -0,0 +1,118 @@
+/**
+ * AgentDB ReasoningBank Adapter
+ *
+ * Complete drop-in replacement for the legacy ReasoningBank with 100% backward compatibility.
+ * Provides all AgentDB capabilities: vector search, learning plugins, reasoning agents, QUIC sync.
+ *
+ * Performance: 150x-12,500x faster than legacy implementation
+ * Features: HNSW indexing, quantization, learning plugins, reasoning agents
+ */
+import type { ReasoningMemory, TrajectoryData, RetrievalOptions } from './types';
+/**
+ * Configuration for AgentDB adapter
+ */
+export interface AgentDBAdapterConfig {
+    dbPath?: string;
+    enableLearning?: boolean;
+    enableReasoning?: boolean;
+    enableQUICSync?: boolean;
+    quantizationType?: 'binary' | 'scalar' | 'product' | 'none';
+    cacheSize?: number;
+    syncPort?: number;
+    syncPeers?: string[];
+}
+/**
+ * Complete AgentDB ReasoningBank Adapter
+ */
+export declare class AgentDBReasoningBankAdapter {
+    private db;
+    private plugin?;
+    private patternMatcher?;
+    private contextSynthesizer?;
+    private memoryOptimizer?;
+    private experienceCurator?;
+    private quicSync?;
+    private config;
+    private initialized;
+    constructor(config?: AgentDBAdapterConfig);
+    /**
+     * Initialize the adapter and all components
+     */
+    initialize(): Promise<void>;
+    /**
+     * Insert a pattern into the reasoning bank (backward compatible)
+     */
+    insertPattern(memory: ReasoningMemory): Promise<string>;
+    /**
+     * Insert a trajectory (backward compatible)
+     */
+    insertTrajectory(trajectory: TrajectoryData): Promise<string>;
+    /**
+     * Retrieve memories (backward compatible with enhanced reasoning)
+     */
+    retrieveMemories(options?: RetrievalOptions): Promise<ReasoningMemory[]>;
+    /**
+     * Advanced retrieval with reasoning agents
+     */
+    retrieveWithReasoning(query: string | number[], options?: {
+        domain?: string;
+        agent?: string;
+        k?: number;
+        useMMR?: boolean;
+        synthesizeContext?: boolean;
+        optimizeMemory?: boolean;
+    }): Promise<{
+        memories: ReasoningMemory[];
+        context?: any;
+        patterns?: any[];
+        optimizations?: any;
+    }>;
+    /**
+     * Update pattern statistics (backward compatible)
+     */
+    updatePattern(id: string, updates: Partial<{
+        confidence: number;
+        usage_count: number;
+        success_count: number;
+        last_used: number;
+    }>): Promise<void>;
+    /**
+     * Delete pattern (backward compatible)
+     */
+    deletePattern(id: string): Promise<void>;
+    /**
+     * Train learning model on stored experiences
+     */
+    train(options?: {
+        epochs?: number;
+        batchSize?: number;
+    }): Promise<any>;
+    /**
+     * Get statistics about the reasoning bank
+     */
+    getStats(): Promise<{
+        totalPatterns: number;
+        totalTrajectories: number;
+        avgConfidence: number;
+        domains: string[];
+        dbSize: number;
+        learningStats?: any;
+        reasoningStats?: any;
+    }>;
+    /**
+     * Optimize database (consolidation, pruning, reindexing)
+     */
+    optimize(): Promise<void>;
+    /**
+     * Close adapter and cleanup
+     */
+    close(): Promise<void>;
+    private checkInitialized;
+    private embedText;
+    private mapToLegacyFormat;
+    private enhanceWithReasoning;
+    private retrieveWithMMR;
+    private cosineSimilarity;
+    private getDbSize;
+}
+//# sourceMappingURL=agentdb-adapter.d.ts.map

package/dist/reasoningbank/adapter/agentdb-adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"agentdb-adapter.d.ts","sourceRoot":"","sources":["../../../src/reasoningbank/adapter/agentdb-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AASH,OAAO,KAAK,EACV,eAAe,EAEf,cAAc,EACd,gBAAgB,EAEjB,MAAM,SAAS,CAAC;AAEjB;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,gBAAgB,CAAC,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,MAAM,CAAC;IAC5D,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;CACtB;AAED;;GAEG;AACH,qBAAa,2BAA2B;IACtC,OAAO,CAAC,EAAE,CAAiB;IAC3B,OAAO,CAAC,MAAM,CAAC,CAA4B;IAC3C,OAAO,CAAC,cAAc,CAAC,CAAiB;IACxC,OAAO,CAAC,kBAAkB,CAAC,CAAqB;IAChD,OAAO,CAAC,eAAe,CAAC,CAAkB;IAC1C,OAAO,CAAC,iBAAiB,CAAC,CAAoB;IAC9C,OAAO,CAAC,QAAQ,CAAC,CAAW;IAC5B,OAAO,CAAC,MAAM,CAAuB;IACrC,OAAO,CAAC,WAAW,CAAS;gBAEhB,MAAM,GAAE,oBAAyB;IAoB7C;;OAEG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAsCjC;;OAEG;IACG,aAAa,CAAC,MAAM,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC;IAuD7D;;OAEG;IACG,gBAAgB,CAAC,UAAU,EAAE,cAAc,GAAG,OAAO,CAAC,MAAM,CAAC;IAiCnE;;OAEG;IACG,gBAAgB,CAAC,OAAO,GAAE,gBAAqB,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAyClF;;OAEG;IACG,qBAAqB,CACzB,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,EACxB,OAAO,GAAE;QACP,MAAM,CAAC,EAAE,MAAM,CAAC;QAChB,KAAK,CAAC,EAAE,MAAM,CAAC;QACf,CAAC,CAAC,EAAE,MAAM,CAAC;QACX,MAAM,CAAC,EAAE,OAAO,CAAC;QACjB,iBAAiB,CAAC,EAAE,OAAO,CAAC;QAC5B,cAAc,CAAC,EAAE,OAAO,CAAC;KACrB,GACL,OAAO,CAAC;QACT,QAAQ,EAAE,eAAe,EAAE,CAAC;QAC5B,OAAO,CAAC,EAAE,GAAG,CAAC;QACd,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAC;QACjB,aAAa,CAAC,EAAE,GAAG,CAAC;KACrB,CAAC;IAwCF;;OAEG;IACG,aAAa,CACjB,EAAE,EAAE,MAAM,EACV,OAAO,EAAE,OAAO,CAAC;QACf,UAAU,EAAE,MAAM,CAAC;QACnB,WAAW,EAAE,MAAM,CAAC;QACpB,aAAa,EAAE,MAAM,CAAC;QACtB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC,GACD,OAAO,CAAC,IAAI,CAAC;IA0ChB;;OAEG;IACG,aAAa,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAc9C;;OAEG;IACG,KAAK,CAAC,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,MAAM,CAAA;KAAE,GAAG,OAAO,CAAC,GAAG,CAAC;IAU5E;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC;QACxB,aAAa,EAAE,MAAM,CAAC;QACtB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,aAAa,EAAE,MAAM,CAAC;QACtB,OAAO,EAAE,MAAM,EAAE,CAAC;QAClB,MAAM,EAAE,MAAM,CAAC;QACf,aAAa,CAAC,EAAE,GAAG,CAAC;QACpB,cAAc,CAAC,EAAE,GAAG,CAAC;KACtB,CAAC;IA6BF;;OAEG;IACG,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IAY/B;;OAEG;IACG,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAiB5B,OAAO,CAAC,gBAAgB;YAMV,SAAS;IAYvB,OAAO,CAAC,iBAAiB;YAkBX,oBAAoB;YA2BpB,eAAe;IAiD7B,OAAO,CAAC,gBAAgB;YAcV,SAAS;CAUxB"}