universal-agent-protocol 0.5.0

package/dist/memory/correction-propagator.js

@@ -0,0 +1,156 @@
+/**
+ * Correction Propagation Protocol
+ *
+ * When a memory is corrected, updates propagate across all tiers:
+ * daily log, working memory, and session memory. Old claims are marked
+ * [superseded] with date and reason, preserving the audit trail.
+ *
+ * Inspired by Total Recall's correction gate.
+ */
+import Database from 'better-sqlite3';
+import { existsSync } from 'fs';
+import { ensureDailyLogSchema } from './daily-log.js';
+/**
+ * Ensure the superseded tracking table exists.
+ */
+export function ensureSupersededSchema(db) {
+    db.exec(`
+    CREATE TABLE IF NOT EXISTS superseded_entries (
+      id INTEGER PRIMARY KEY AUTOINCREMENT,
+      tier TEXT NOT NULL,
+      original_entry_id INTEGER,
+      original_content TEXT NOT NULL,
+      corrected_content TEXT NOT NULL,
+      superseded_date TEXT NOT NULL,
+      reason TEXT NOT NULL DEFAULT 'correction'
+    );
+    CREATE INDEX IF NOT EXISTS idx_superseded_date ON superseded_entries(superseded_date);
+  `);
+}
+/**
+ * Propagate a correction across all memory tiers.
+ *
+ * @param dbPath Path to the SQLite database
+ * @param searchContent Content to find and correct (fuzzy match)
+ * @param correctedContent The corrected version
+ * @param reason Why the correction was made
+ */
+export function propagateCorrection(dbPath, searchContent, correctedContent, reason = 'user correction') {
+    if (!existsSync(dbPath)) {
+        return { originalFound: false, tiersUpdated: [], supersededCount: 0 };
+    }
+    const db = new Database(dbPath);
+    ensureSupersededSchema(db);
+    ensureDailyLogSchema(db);
+    const result = {
+        originalFound: false,
+        tiersUpdated: [],
+        supersededCount: 0,
+    };
+    const now = new Date().toISOString();
+    const today = now.split('T')[0];
+    const searchLower = searchContent.toLowerCase();
+    try {
+        // 1. Search in memories (working memory / L1)
+        const memRows = db.prepare(`
+      SELECT id, content FROM memories
+      WHERE LOWER(content) LIKE ?
+      ORDER BY id DESC
+      LIMIT 5
+    `).all(`%${searchLower}%`);
+        for (const row of memRows) {
+            result.originalFound = true;
+            result.originalId = result.originalId || row.id;
+            result.originalContent = result.originalContent || row.content;
+            // Record superseded entry
+            db.prepare(`
+        INSERT INTO superseded_entries (tier, original_entry_id, original_content, corrected_content, superseded_date, reason)
+        VALUES ('memories', ?, ?, ?, ?, ?)
+      `).run(row.id, row.content, correctedContent, now, reason);
+            // Update the memory in-place (prepend [corrected] marker)
+            db.prepare(`
+        UPDATE memories SET content = ? WHERE id = ?
+      `).run(`[corrected ${today}] ${correctedContent}`, row.id);
+            result.supersededCount++;
+        }
+        if (memRows.length > 0) {
+            result.tiersUpdated.push('memories');
+        }
+        // 2. Search in session_memories (L2)
+        const sessRows = db.prepare(`
+      SELECT id, content FROM session_memories
+      WHERE LOWER(content) LIKE ?
+      ORDER BY id DESC
+      LIMIT 5
+    `).all(`%${searchLower}%`);
+        for (const row of sessRows) {
+            result.originalFound = true;
+            db.prepare(`
+        INSERT INTO superseded_entries (tier, original_entry_id, original_content, corrected_content, superseded_date, reason)
+        VALUES ('session_memories', ?, ?, ?, ?, ?)
+      `).run(row.id, row.content, correctedContent, now, reason);
+            db.prepare(`
+        UPDATE session_memories SET content = ? WHERE id = ?
+      `).run(`[corrected ${today}] ${correctedContent}`, row.id);
+            result.supersededCount++;
+        }
+        if (sessRows.length > 0) {
+            result.tiersUpdated.push('session_memories');
+        }
+        // 3. Always write the correction to the daily log
+        db.prepare(`
+      INSERT INTO daily_log (date, timestamp, content, type, gate_score)
+      VALUES (?, ?, ?, 'correction', 1.0)
+    `).run(today, now, `[CORRECTION] ${reason}: ${correctedContent}`);
+        result.tiersUpdated.push('daily_log');
+        // 4. Write corrected version as new working memory entry
+        const insertResult = db.prepare(`
+      INSERT INTO memories (timestamp, type, content, project_id, importance)
+      VALUES (?, 'observation', ?, 'default', 8)
+    `).run(now, correctedContent);
+        result.correctedEntryId = Number(insertResult.lastInsertRowid);
+        // Update FTS if available
+        try {
+            db.prepare(`
+        INSERT INTO memories_fts(rowid, content, type)
+        VALUES (?, ?, 'observation')
+      `).run(result.correctedEntryId, correctedContent);
+        }
+        catch {
+            // FTS not available
+        }
+    }
+    finally {
+        db.close();
+    }
+    return result;
+}
+/**
+ * Get the superseded history for audit trail.
+ */
+export function getSupersededHistory(dbPath, limit = 20) {
+    if (!existsSync(dbPath))
+        return [];
+    const db = new Database(dbPath);
+    ensureSupersededSchema(db);
+    try {
+        const rows = db.prepare(`
+      SELECT id, tier, original_entry_id, original_content, superseded_date, reason
+      FROM superseded_entries
+      ORDER BY id DESC
+      LIMIT ?
+    `).all(limit);
+        return rows.map(r => ({
+            id: r.id,
+            tier: r.tier,
+            originalContent: r.original_content,
+            supersededDate: r.superseded_date,
+            supersededBy: '', // Would need to join with corrected content
+            reason: r.reason,
+        }));
+    }
+    finally {
+        db.close();
+    }
+}
+//# sourceMappingURL=correction-propagator.js.map

package/dist/memory/correction-propagator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"correction-propagator.js","sourceRoot":"","sources":["../../src/memory/correction-propagator.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,UAAU,EAAE,MAAM,IAAI,CAAC;AAChC,OAAO,EAAE,oBAAoB,EAAE,MAAM,gBAAgB,CAAC;AAoBtD;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,EAAqB;IAC1D,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;GAWP,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,mBAAmB,CACjC,MAAc,EACd,aAAqB,EACrB,gBAAwB,EACxB,SAAiB,iBAAiB;IAElC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QACxB,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,YAAY,EAAE,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;IACxE,CAAC;IAED,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;IAChC,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAC3B,oBAAoB,CAAC,EAAE,CAAC,CAAC;IAEzB,MAAM,MAAM,GAAqB;QAC/B,aAAa,EAAE,KAAK;QACpB,YAAY,EAAE,EAAE;QAChB,eAAe,EAAE,CAAC;KACnB,CAAC;IAEF,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,MAAM,WAAW,GAAG,aAAa,CAAC,WAAW,EAAE,CAAC;IAEhD,IAAI,CAAC;QACH,8CAA8C;QAC9C,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAK1B,CAAC,CAAC,GAAG,CAAC,IAAI,WAAW,GAAG,CAA2C,CAAC;QAErE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC;YAC5B,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,IAAI,GAAG,CAAC,EAAE,CAAC;YAChD,MAAM,CAAC,eAAe,GAAG,MAAM,CAAC,eAAe,IAAI,GAAG,CAAC,OAAO,CAAC;YAE/D,0BAA0B;YAC1B,EAAE,CAAC,OAAO,CAAC;;;OAGV,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YAE3D,0DAA0D;YAC1D,EAAE,CAAC,OAAO,CAAC;;OAEV,CAAC,CAAC,GAAG,CAAC,cAAc,KAAK,KAAK,gBAAgB,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAE3D,MAAM,CAAC,eAAe,EAAE,CAAC;QAC3B,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvC,CAAC;QAED,qCAAqC;QACrC,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAK3B,CAAC,CAAC,GAAG,CAAC,IAAI,WAAW,GAAG,CAA2C,CAAC;QAErE,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,CAAC,aAAa,GAAG,IAAI,CAAC;YAE5B,EAAE,CAAC,OAAO,CAAC;;;OAGV,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,OAAO,EAAE,gBAAgB,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC;YAE3D,EAAE,CAAC,OAAO,CAAC;;OAEV,CAAC,CAAC,GAAG,CAAC,cAAc,KAAK,KAAK,gBAAgB,EAAE,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;YAE3D,MAAM,CAAC,eAAe,EAAE,CAAC;QAC3B,CAAC;QACD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAC/C,CAAC;QAED,kDAAkD;QAClD,EAAE,CAAC,OAAO,CAAC;;;KAGV,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,gBAAgB,MAAM,KAAK,gBAAgB,EAAE,CAAC,CAAC;QAClE,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QAEtC,yDAAyD;QACzD,MAAM,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAG/B,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,gBAAgB,CAAC,CAAC;QAC9B,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;QAE/D,0BAA0B;QAC1B,IAAI,CAAC;YACH,EAAE,CAAC,OAAO,CAAC;;;OAGV,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,CAAC;QACpD,CAAC;QAAC,MAAM,CAAC;YACP,oBAAoB;QACtB,CAAC;IACH,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,MAAc,EACd,QAAgB,EAAE;IAElB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,OAAO,EAAE,CAAC;IAEnC,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;IAChC,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAE3B,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;KAKvB,CAAC,CAAC,GAAG,CAAC,KAAK,CAOV,CAAC;QAEH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,eAAe,EAAE,CAAC,CAAC,gBAAgB;YACnC,cAAc,EAAE,CAAC,CAAC,eAAe;YACjC,YAAY,EAAE,EAAE,EAAE,4CAA4C;YAC9D,MAAM,EAAE,CAAC,CAAC,MAAM;SACjB,CAAC,CAAC,CAAC;IACN,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC"}

package/dist/memory/daily-log.d.ts

@@ -0,0 +1,67 @@
+/**
+ * Daily Log - Staging area for memory writes.
+ *
+ * All memories land here first. Promotion to working/semantic memory
+ * is a separate step controlled by the user via `uap memory promote`.
+ * Inspired by Total Recall's "daily log first, promote later" pattern.
+ */
+import Database from 'better-sqlite3';
+export interface DailyLogEntry {
+    id: number;
+    date: string;
+    timestamp: string;
+    content: string;
+    type: string;
+    promoted: boolean;
+    promotedTo?: string;
+    gateScore: number;
+}
+export interface PromotionCandidate {
+    entry: DailyLogEntry;
+    suggestedTier: 'working' | 'semantic';
+    reason: string;
+}
+export declare function ensureDailyLogSchema(db: Database.Database): void;
+export declare class DailyLog {
+    private db;
+    constructor(dbPath: string);
+    /**
+     * Write an entry to today's daily log.
+     */
+    write(content: string, type?: string, gateScore?: number): number;
+    /**
+     * Get entries for a specific date (default: today).
+     */
+    getByDate(date?: string): DailyLogEntry[];
+    /**
+     * Get unpromoted entries across all dates (candidates for promotion).
+     */
+    getUnpromoted(limit?: number): DailyLogEntry[];
+    /**
+     * Get promotion candidates - entries scored high enough to promote.
+     */
+    getPromotionCandidates(minScore?: number): PromotionCandidate[];
+    /**
+     * Mark an entry as promoted.
+     */
+    markPromoted(id: number, tier: string): void;
+    /**
+     * Archive old entries (>30 days) by marking them.
+     */
+    archiveOld(daysOld?: number): number;
+    /**
+     * Get log statistics.
+     */
+    getStats(): {
+        total: number;
+        unpromoted: number;
+        promoted: number;
+        todayCount: number;
+    };
+    /**
+     * Get recent entries across dates.
+     */
+    getRecent(limit?: number): DailyLogEntry[];
+    close(): void;
+}
+//# sourceMappingURL=daily-log.d.ts.map

package/dist/memory/daily-log.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"daily-log.d.ts","sourceRoot":"","sources":["../../src/memory/daily-log.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AAItC,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,OAAO,CAAC;IAClB,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,aAAa,CAAC;IACrB,aAAa,EAAE,SAAS,GAAG,UAAU,CAAC;IACtC,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,wBAAgB,oBAAoB,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAehE;AAED,qBAAa,QAAQ;IACnB,OAAO,CAAC,EAAE,CAAoB;gBAElB,MAAM,EAAE,MAAM;IAS1B;;OAEG;IACH,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,GAAE,MAAsB,EAAE,SAAS,GAAE,MAAU,GAAG,MAAM;IAanF;;OAEG;IACH,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,GAAG,aAAa,EAAE;IAYzC;;OAEG;IACH,aAAa,CAAC,KAAK,GAAE,MAAW,GAAG,aAAa,EAAE;IAYlD;;OAEG;IACH,sBAAsB,CAAC,QAAQ,GAAE,MAAY,GAAG,kBAAkB,EAAE;IAapE;;OAEG;IACH,YAAY,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAO5C;;OAEG;IACH,UAAU,CAAC,OAAO,GAAE,MAAW,GAAG,MAAM;IAYxC;;OAEG;IACH,QAAQ,IAAI;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAA;KAAE;IAQvF;;OAEG;IACH,SAAS,CAAC,KAAK,GAAE,MAAW,GAAG,aAAa,EAAE;IAW9C,KAAK,IAAI,IAAI;CAGd"}

package/dist/memory/daily-log.js

@@ -0,0 +1,143 @@
+/**
+ * Daily Log - Staging area for memory writes.
+ *
+ * All memories land here first. Promotion to working/semantic memory
+ * is a separate step controlled by the user via `uap memory promote`.
+ * Inspired by Total Recall's "daily log first, promote later" pattern.
+ */
+import Database from 'better-sqlite3';
+import { existsSync, mkdirSync } from 'fs';
+import { dirname } from 'path';
+export function ensureDailyLogSchema(db) {
+    db.exec(`
+    CREATE TABLE IF NOT EXISTS daily_log (
+      id INTEGER PRIMARY KEY AUTOINCREMENT,
+      date TEXT NOT NULL,
+      timestamp TEXT NOT NULL,
+      content TEXT NOT NULL,
+      type TEXT NOT NULL DEFAULT 'observation',
+      promoted INTEGER NOT NULL DEFAULT 0,
+      promoted_to TEXT,
+      gate_score REAL NOT NULL DEFAULT 0
+    );
+    CREATE INDEX IF NOT EXISTS idx_daily_log_date ON daily_log(date);
+    CREATE INDEX IF NOT EXISTS idx_daily_log_promoted ON daily_log(promoted);
+  `);
+}
+export class DailyLog {
+    db;
+    constructor(dbPath) {
+        const dir = dirname(dbPath);
+        if (!existsSync(dir)) {
+            mkdirSync(dir, { recursive: true });
+        }
+        this.db = new Database(dbPath);
+        ensureDailyLogSchema(this.db);
+    }
+    /**
+     * Write an entry to today's daily log.
+     */
+    write(content, type = 'observation', gateScore = 0) {
+        const now = new Date();
+        const date = now.toISOString().split('T')[0];
+        const timestamp = now.toISOString();
+        const stmt = this.db.prepare(`
+      INSERT INTO daily_log (date, timestamp, content, type, gate_score)
+      VALUES (?, ?, ?, ?, ?)
+    `);
+        const result = stmt.run(date, timestamp, content, type, gateScore);
+        return Number(result.lastInsertRowid);
+    }
+    /**
+     * Get entries for a specific date (default: today).
+     */
+    getByDate(date) {
+        const d = date || new Date().toISOString().split('T')[0];
+        const stmt = this.db.prepare(`
+      SELECT id, date, timestamp, content, type,
+             promoted, promoted_to as promotedTo, gate_score as gateScore
+      FROM daily_log
+      WHERE date = ?
+      ORDER BY id DESC
+    `);
+        return stmt.all(d);
+    }
+    /**
+     * Get unpromoted entries across all dates (candidates for promotion).
+     */
+    getUnpromoted(limit = 50) {
+        const stmt = this.db.prepare(`
+      SELECT id, date, timestamp, content, type,
+             promoted, promoted_to as promotedTo, gate_score as gateScore
+      FROM daily_log
+      WHERE promoted = 0
+      ORDER BY gate_score DESC, id DESC
+      LIMIT ?
+    `);
+        return stmt.all(limit);
+    }
+    /**
+     * Get promotion candidates - entries scored high enough to promote.
+     */
+    getPromotionCandidates(minScore = 0.3) {
+        const entries = this.getUnpromoted();
+        return entries
+            .filter(e => e.gateScore >= minScore)
+            .map(e => ({
+            entry: e,
+            suggestedTier: e.gateScore >= 0.6 ? 'working' : 'semantic',
+            reason: e.gateScore >= 0.6
+                ? 'High gate score - likely behavior-changing or commitment'
+                : 'Moderate gate score - durable fact or decision',
+        }));
+    }
+    /**
+     * Mark an entry as promoted.
+     */
+    markPromoted(id, tier) {
+        const stmt = this.db.prepare(`
+      UPDATE daily_log SET promoted = 1, promoted_to = ? WHERE id = ?
+    `);
+        stmt.run(tier, id);
+    }
+    /**
+     * Archive old entries (>30 days) by marking them.
+     */
+    archiveOld(daysOld = 30) {
+        const cutoff = new Date();
+        cutoff.setDate(cutoff.getDate() - daysOld);
+        const cutoffDate = cutoff.toISOString().split('T')[0];
+        const stmt = this.db.prepare(`
+      DELETE FROM daily_log WHERE date < ? AND promoted = 1
+    `);
+        const result = stmt.run(cutoffDate);
+        return result.changes;
+    }
+    /**
+     * Get log statistics.
+     */
+    getStats() {
+        const total = this.db.prepare('SELECT COUNT(*) as c FROM daily_log').get().c;
+        const unpromoted = this.db.prepare('SELECT COUNT(*) as c FROM daily_log WHERE promoted = 0').get().c;
+        const today = new Date().toISOString().split('T')[0];
+        const todayCount = this.db.prepare('SELECT COUNT(*) as c FROM daily_log WHERE date = ?').get(today).c;
+        return { total, unpromoted, promoted: total - unpromoted, todayCount };
+    }
+    /**
+     * Get recent entries across dates.
+     */
+    getRecent(limit = 20) {
+        const stmt = this.db.prepare(`
+      SELECT id, date, timestamp, content, type,
+             promoted, promoted_to as promotedTo, gate_score as gateScore
+      FROM daily_log
+      ORDER BY id DESC
+      LIMIT ?
+    `);
+        return stmt.all(limit);
+    }
+    close() {
+        this.db.close();
+    }
+}
+//# sourceMappingURL=daily-log.js.map

package/dist/memory/daily-log.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"daily-log.js","sourceRoot":"","sources":["../../src/memory/daily-log.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,IAAI,CAAC;AAC3C,OAAO,EAAE,OAAO,EAAE,MAAM,MAAM,CAAC;AAmB/B,MAAM,UAAU,oBAAoB,CAAC,EAAqB;IACxD,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;GAaP,CAAC,CAAC;AACL,CAAC;AAED,MAAM,OAAO,QAAQ;IACX,EAAE,CAAoB;IAE9B,YAAY,MAAc;QACxB,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,CAAC,EAAE,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/B,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAe,EAAE,OAAe,aAAa,EAAE,YAAoB,CAAC;QACxE,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,SAAS,GAAG,GAAG,CAAC,WAAW,EAAE,CAAC;QAEpC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAG5B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QACnE,OAAO,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,IAAa;QACrB,MAAM,CAAC,GAAG,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;KAM5B,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAoB,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,QAAgB,EAAE;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;;KAO5B,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAoB,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,sBAAsB,CAAC,WAAmB,GAAG;QAC3C,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;QACrC,OAAO,OAAO;aACX,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,QAAQ,CAAC;aACpC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACT,KAAK,EAAE,CAAC;YACR,aAAa,EAAE,CAAC,CAAC,SAAS,IAAI,GAAG,CAAC,CAAC,CAAC,SAAkB,CAAC,CAAC,CAAC,UAAmB;YAC5E,MAAM,EAAE,CAAC,CAAC,SAAS,IAAI,GAAG;gBACxB,CAAC,CAAC,0DAA0D;gBAC5D,CAAC,CAAC,gDAAgD;SACrD,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,EAAU,EAAE,IAAY;QACnC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;KAE5B,CAAC,CAAC;QACH,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,UAAkB,EAAE;QAC7B,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAEtD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;KAE5B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACpC,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,KAAK,GAAI,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qCAAqC,CAAC,CAAC,GAAG,EAAoB,CAAC,CAAC,CAAC;QAChG,MAAM,UAAU,GAAI,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,wDAAwD,CAAC,CAAC,GAAG,EAAoB,CAAC,CAAC,CAAC;QACxH,MAAM,KAAK,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,UAAU,GAAI,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,oDAAoD,CAAC,CAAC,GAAG,CAAC,KAAK,CAAmB,CAAC,CAAC,CAAC;QACzH,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,KAAK,GAAG,UAAU,EAAE,UAAU,EAAE,CAAC;IACzE,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,QAAgB,EAAE;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;KAM5B,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAoB,CAAC;IAC5C,CAAC;IAED,KAAK;QACH,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IAClB,CAAC;CACF"}

package/dist/memory/dynamic-retrieval.d.ts

@@ -0,0 +1,110 @@
+/**
+ * Dynamic Memory Retrieval System for UAP
+ *
+ * Retrieves relevant memories based on task content, not static context.
+ * Implements semantic search with fallback to keyword matching.
+ *
+ * Features:
+ * - Adaptive retrieval depth based on query complexity
+ * - Context budget management to prevent overflow
+ * - Speculative prefetch for common patterns
+ */
+import { type TaskClassification } from './task-classifier.js';
+import { type ContextDecision, type TaskMetadata } from './adaptive-context.js';
+/**
+ * Query complexity levels for adaptive retrieval
+ */
+export type QueryComplexity = 'simple' | 'moderate' | 'complex';
+/**
+ * Retrieval depth configuration
+ */
+export interface RetrievalDepthConfig {
+    simple: {
+        shortTerm: number;
+        sessionMem: number;
+        longTerm: number;
+        patterns: number;
+    };
+    moderate: {
+        shortTerm: number;
+        sessionMem: number;
+        longTerm: number;
+        patterns: number;
+    };
+    complex: {
+        shortTerm: number;
+        sessionMem: number;
+        longTerm: number;
+        patterns: number;
+    };
+}
+/**
+ * Measure query complexity to determine retrieval depth
+ * Based on SimpleMem's adaptive query-aware retrieval
+ */
+export declare function measureQueryComplexity(query: string): QueryComplexity;
+/**
+ * Get retrieval limits based on query complexity
+ */
+export declare function getRetrievalDepth(complexity: QueryComplexity, config?: RetrievalDepthConfig): {
+    shortTerm: number;
+    sessionMem: number;
+    longTerm: number;
+    patterns: number;
+};
+export interface RetrievedMemory {
+    content: string;
+    type: 'lesson' | 'gotcha' | 'pattern' | 'context' | 'example';
+    relevance: number;
+    source: string;
+}
+export interface DynamicMemoryContext {
+    classification: TaskClassification;
+    relevantMemories: RetrievedMemory[];
+    patterns: string[];
+    gotchas: string[];
+    projectContext: string;
+    formattedContext: string;
+    queryComplexity: QueryComplexity;
+    tokenBudget: {
+        used: number;
+        remaining: number;
+        total: number;
+    };
+    compressionStats?: {
+        ratio: number;
+        sourceTokens: number;
+        compressedTokens: number;
+    };
+    contextDecision?: ContextDecision;
+}
+/**
+ * Main function to retrieve task-specific memory context
+ * Now with adaptive retrieval depth and context budget management
+ */
+export declare function retrieveDynamicMemoryContext(taskInstruction: string, projectRoot?: string, options?: {
+    maxTokens?: number;
+    useSemanticCompression?: boolean;
+    taskMetadata?: TaskMetadata;
+}): Promise<DynamicMemoryContext>;
+/**
+ * OPTIMIZATION 10: Automatic knowledge bootstrapping feedback loop
+ *
+ * Call this after each task completes to:
+ * 1. Update adaptive context historical data
+ * 2. Update model router fingerprints
+ * 3. Record knowledge outcomes for domain knowledge improvement
+ * 4. Extract and persist new learnings from agent output
+ *
+ * This closes the feedback loop so each benchmark run improves future accuracy.
+ */
+export interface TaskOutcome {
+    instruction: string;
+    success: boolean;
+    durationMs: number;
+    modelId?: string;
+    agentOutput?: string;
+    projectRoot?: string;
+}
+export declare function recordTaskFeedback(outcome: TaskOutcome): void;
+//# sourceMappingURL=dynamic-retrieval.d.ts.map

package/dist/memory/dynamic-retrieval.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dynamic-retrieval.d.ts","sourceRoot":"","sources":["../../src/memory/dynamic-retrieval.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,OAAO,EAAgE,KAAK,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAG7H,OAAO,EAAqC,KAAK,eAAe,EAAE,KAAK,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAInH;;GAEG;AACH,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,UAAU,GAAG,SAAS,CAAC;AAEhE;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACnC,MAAM,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IACtF,QAAQ,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;IACxF,OAAO,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CACxF;AAQD;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,MAAM,GAAG,eAAe,CAiDrE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,UAAU,EAAE,eAAe,EAC3B,MAAM,GAAE,oBAA+C,GACtD;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAE/E;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS,GAAG,SAAS,GAAG,SAAS,CAAC;IAC9D,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,oBAAoB;IACnC,cAAc,EAAE,kBAAkB,CAAC;IACnC,gBAAgB,EAAE,eAAe,EAAE,CAAC;IACpC,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,cAAc,EAAE,MAAM,CAAC;IACvB,gBAAgB,EAAE,MAAM,CAAC;IACzB,eAAe,EAAE,eAAe,CAAC;IACjC,WAAW,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAChE,gBAAgB,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAA;KAAE,CAAC;IACrF,eAAe,CAAC,EAAE,eAAe,CAAC;CACnC;AAED;;;GAGG;AACH,wBAAsB,4BAA4B,CAChD,eAAe,EAAE,MAAM,EACvB,WAAW,GAAE,MAAsB,EACnC,OAAO,GAAE;IACP,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,sBAAsB,CAAC,EAAE,OAAO,CAAC;IACjC,YAAY,CAAC,EAAE,YAAY,CAAC;CACxB,GACL,OAAO,CAAC,oBAAoB,CAAC,CAgI/B;AAqgBD;;;;;;;;;;GAUG;AACH,MAAM,WAAW,WAAW;IAC1B,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE,OAAO,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,wBAAgB,kBAAkB,CAAC,OAAO,EAAE,WAAW,GAAG,IAAI,CAmC7D"}