audrey 0.17.0 → 0.21.0

package/dist/src/promote.js

@@ -0,0 +1,200 @@
+/**
+ * Memory-to-Behavior promotion — candidate scoring.
+ *
+ * A "candidate" is a memory (usually procedural, sometimes high-confidence
+ * semantic) that has earned the right to become an enforced project rule:
+ *   - repeated occurrence (multiple supporting episodes)
+ *   - low contradiction (active state, not disputed)
+ *   - durable (not recently superseded)
+ *   - not already promoted to this target
+ *
+ * Tool-failure context also boosts candidates: if the Bash tool has failed
+ * 3 times this week with errors mentioning "sqlite extension", a procedural
+ * memory about "initialize sqlite extension before tests" gets a
+ * failure_prevented score, which bubbles it up in the ranked list.
+ */
+import { recentFailures } from './events.js';
+function loadPromotedMemoryIds(db, target) {
+    const rows = db.prepare(`SELECT metadata FROM memory_events
+     WHERE event_type = 'Promotion' AND tool_name = ?`).all(target);
+    const ids = new Set();
+    for (const row of rows) {
+        if (!row.metadata)
+            continue;
+        try {
+            const parsed = JSON.parse(row.metadata);
+            const memoryIds = parsed.memory_ids;
+            if (Array.isArray(memoryIds)) {
+                for (const id of memoryIds)
+                    ids.add(String(id));
+            }
+        }
+        catch {
+            // skip malformed metadata
+        }
+    }
+    return ids;
+}
+function matchesFailure(memoryContent, failure) {
+    if (!failure.last_error_summary)
+        return 0;
+    const lower = memoryContent.toLowerCase();
+    const errLower = failure.last_error_summary.toLowerCase();
+    const toolLower = (failure.tool_name || '').toLowerCase();
+    const errWords = errLower.split(/[^a-z0-9]+/).filter(w => w.length >= 4);
+    const memWords = new Set(lower.split(/[^a-z0-9]+/).filter(Boolean));
+    let overlap = 0;
+    for (const w of errWords) {
+        if (memWords.has(w))
+            overlap++;
+    }
+    const toolBonus = toolLower && lower.includes(toolLower) ? 1 : 0;
+    return overlap + toolBonus;
+}
+function scoreCandidate(params) {
+    const confidenceScore = params.confidence * 40;
+    const evidenceScore = Math.min(params.evidence, 10) * 3;
+    const retrievalScore = Math.min(params.retrieval, 20) * 1.5;
+    const usageScore = Math.min(params.usage, 10) * 2;
+    const failureScore = Math.min(params.failurePrevented, 5) * 8;
+    // Slight penalty for very young memories so one flaky session can't promote itself.
+    const agePenalty = params.ageHours < 6 ? 10 : 0;
+    return confidenceScore + evidenceScore + retrievalScore + usageScore + failureScore - agePenalty;
+}
+function hoursSince(iso) {
+    const t = Date.parse(iso);
+    if (!Number.isFinite(t))
+        return 0;
+    return (Date.now() - t) / (60 * 60 * 1000);
+}
+function parseTags(raw) {
+    if (!raw)
+        return [];
+    try {
+        const parsed = JSON.parse(raw);
+        if (Array.isArray(parsed))
+            return parsed.map(String);
+    }
+    catch {
+        // fall through
+    }
+    return String(raw).split(',').map(t => t.trim()).filter(Boolean);
+}
+export function findPromotionCandidates(db, options = {}) {
+    const minConfidence = options.minConfidence ?? 0.7;
+    const minEvidence = options.minEvidence ?? 2;
+    const limit = options.limit ?? 20;
+    const target = options.target ?? 'claude-rules';
+    const alreadyPromoted = loadPromotedMemoryIds(db, target);
+    const failures = recentFailures(db, {
+        since: options.since ?? new Date(Date.now() - 30 * 24 * 60 * 60 * 1000).toISOString(),
+        limit: 20,
+    });
+    const candidates = [];
+    // Procedural memories: primary promotion stream
+    const procedurals = db.prepare(`SELECT id, content, state, success_count, failure_count, retrieval_count,
+            usage_count, salience, created_at, last_reinforced_at
+     FROM procedures
+     WHERE state = 'active'`).all();
+    for (const row of procedurals) {
+        if (alreadyPromoted.has(row.id))
+            continue;
+        const successes = row.success_count ?? 0;
+        const failures_count = row.failure_count ?? 0;
+        const evidenceTotal = successes + failures_count;
+        if (evidenceTotal < minEvidence)
+            continue;
+        const confidence = evidenceTotal === 0 ? 0 : successes / evidenceTotal;
+        if (confidence < minConfidence)
+            continue;
+        const tagsRow = db.prepare(`SELECT trigger_conditions FROM procedures WHERE id = ?`).get(row.id);
+        const tags = parseTags(tagsRow?.trigger_conditions);
+        let failurePrevented = 0;
+        for (const f of failures) {
+            if (matchesFailure(row.content, f) >= 2)
+                failurePrevented += 1;
+        }
+        const score = scoreCandidate({
+            confidence,
+            evidence: evidenceTotal,
+            retrieval: row.retrieval_count ?? 0,
+            usage: row.usage_count ?? 0,
+            failurePrevented,
+            ageHours: hoursSince(row.last_reinforced_at ?? row.created_at),
+        });
+        const reasonParts = [
+            `procedural memory with ${successes}/${evidenceTotal} successful applications`,
+        ];
+        if (failurePrevented > 0)
+            reasonParts.push(`would have prevented ${failurePrevented} recent tool failure${failurePrevented === 1 ? '' : 's'}`);
+        if ((row.usage_count ?? 0) > 0)
+            reasonParts.push(`used ${row.usage_count} time${row.usage_count === 1 ? '' : 's'}`);
+        candidates.push({
+            candidate_id: `proc:${row.id}`,
+            memory_id: row.id,
+            memory_type: 'procedural',
+            content: row.content,
+            confidence,
+            evidence_count: evidenceTotal,
+            usage_count: row.usage_count ?? 0,
+            failure_prevented: failurePrevented,
+            tags,
+            score,
+            reason: reasonParts.join('; '),
+        });
+    }
+    // Semantic memories: only high-confidence, high-evidence, heavily reinforced ones.
+    // The bar is higher because semantic memories are "facts," not "procedures" — we
+    // do not want to promote every shared fact as a rule.
+    const semantics = db.prepare(`SELECT id, content, state, evidence_count, supporting_count, contradicting_count,
+            retrieval_count, usage_count, salience, created_at, last_reinforced_at
+     FROM semantics
+     WHERE state = 'active'`).all();
+    for (const row of semantics) {
+        if (alreadyPromoted.has(row.id))
+            continue;
+        const evidence = row.evidence_count ?? 0;
+        if (evidence < Math.max(minEvidence, 3))
+            continue;
+        if ((row.contradicting_count ?? 0) > 0)
+            continue;
+        const supporting = row.supporting_count ?? evidence;
+        const confidence = supporting === 0 ? 0 : Math.min(1, supporting / Math.max(evidence, 1));
+        if (confidence < Math.max(minConfidence, 0.8))
+            continue;
+        let failurePrevented = 0;
+        for (const f of failures) {
+            if (matchesFailure(row.content, f) >= 2)
+                failurePrevented += 1;
+        }
+        const score = scoreCandidate({
+            confidence,
+            evidence,
+            retrieval: row.retrieval_count ?? 0,
+            usage: row.usage_count ?? 0,
+            failurePrevented,
+            ageHours: hoursSince(row.last_reinforced_at ?? row.created_at),
+        });
+        const reasonParts = [
+            `semantic principle with ${supporting}/${evidence} supporting episodes`,
+        ];
+        if (failurePrevented > 0)
+            reasonParts.push(`matches ${failurePrevented} recent tool failure${failurePrevented === 1 ? '' : 's'}`);
+        candidates.push({
+            candidate_id: `sem:${row.id}`,
+            memory_id: row.id,
+            memory_type: 'semantic',
+            content: row.content,
+            confidence,
+            evidence_count: evidence,
+            usage_count: row.usage_count ?? 0,
+            failure_prevented: failurePrevented,
+            tags: [],
+            score,
+            reason: reasonParts.join('; '),
+        });
+    }
+    candidates.sort((a, b) => b.score - a.score);
+    return candidates.slice(0, limit);
+}
+//# sourceMappingURL=promote.js.map

package/dist/src/promote.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"promote.js","sourceRoot":"","sources":["../../src/promote.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAGH,OAAO,EAAE,cAAc,EAAuB,MAAM,aAAa,CAAC;AA0DlE,SAAS,qBAAqB,CAAC,EAAqB,EAAE,MAAuB;IAC3E,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB;sDACkD,CACnD,CAAC,GAAG,CAAC,MAAM,CAAe,CAAC;IAE5B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,QAAQ;YAAE,SAAS;QAC5B,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAA4B,CAAC;YACnE,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC;YACpC,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7B,KAAK,MAAM,EAAE,IAAI,SAAS;oBAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,0BAA0B;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,cAAc,CAAC,aAAqB,EAAE,OAAuB;IACpE,IAAI,CAAC,OAAO,CAAC,kBAAkB;QAAE,OAAO,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,WAAW,EAAE,CAAC;IAC1C,MAAM,QAAQ,GAAG,OAAO,CAAC,kBAAkB,CAAC,WAAW,EAAE,CAAC;IAC1D,MAAM,SAAS,GAAG,CAAC,OAAO,CAAC,SAAS,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC;IAE1D,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IACzE,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IAEpE,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,EAAE,CAAC;IACjC,CAAC;IACD,MAAM,SAAS,GAAG,SAAS,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,OAAO,OAAO,GAAG,SAAS,CAAC;AAC7B,CAAC;AAED,SAAS,cAAc,CAAC,MAOvB;IACC,MAAM,eAAe,GAAG,MAAM,CAAC,UAAU,GAAG,EAAE,CAAC;IAC/C,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;IACxD,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC;IAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;IAClD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IAC9D,oFAAoF;IACpF,MAAM,UAAU,GAAG,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,OAAO,eAAe,GAAG,aAAa,GAAG,cAAc,GAAG,UAAU,GAAG,YAAY,GAAG,UAAU,CAAC;AACnG,CAAC;AAED,SAAS,UAAU,CAAC,GAAW;IAC7B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC1B,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC;AAC7C,CAAC;AAED,SAAS,SAAS,CAAC,GAAkB;IACnC,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,CAAC;IACpB,IAAI,CAAC;QACH,MAAM,MAAM,GAAY,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACvD,CAAC;IAAC,MAAM,CAAC;QACP,eAAe;IACjB,CAAC;IACD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AACnE,CAAC;AAED,MAAM,UAAU,uBAAuB,CACrC,EAAqB,EACrB,UAAiC,EAAE;IAEnC,MAAM,aAAa,GAAG,OAAO,CAAC,aAAa,IAAI,GAAG,CAAC;IACnD,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,CAAC,CAAC;IAC7C,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;IAClC,MAAM,MAAM,GAAoB,OAAO,CAAC,MAAM,IAAI,cAAc,CAAC;IACjE,MAAM,eAAe,GAAG,qBAAqB,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;IAE1D,MAAM,QAAQ,GAAG,cAAc,CAAC,EAAE,EAAE;QAClC,KAAK,EAAE,OAAO,CAAC,KAAK,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,CAAC,WAAW,EAAE;QACrF,KAAK,EAAE,EAAE;KACV,CAAC,CAAC;IAEH,MAAM,UAAU,GAAyB,EAAE,CAAC;IAE5C,gDAAgD;IAChD,MAAM,WAAW,GAAG,EAAE,CAAC,OAAO,CAC5B;;;4BAGwB,CACzB,CAAC,GAAG,EAAqB,CAAC;IAE3B,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;QAC9B,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAE1C,MAAM,SAAS,GAAG,GAAG,CAAC,aAAa,IAAI,CAAC,CAAC;QACzC,MAAM,cAAc,GAAG,GAAG,CAAC,aAAa,IAAI,CAAC,CAAC;QAC9C,MAAM,aAAa,GAAG,SAAS,GAAG,cAAc,CAAC;QACjD,IAAI,aAAa,GAAG,WAAW;YAAE,SAAS;QAE1C,MAAM,UAAU,GAAG,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,aAAa,CAAC;QACvE,IAAI,UAAU,GAAG,aAAa;YAAE,SAAS;QAEzC,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,wDAAwD,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAA0C,CAAC;QAC1I,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;QAEpD,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC;gBAAE,gBAAgB,IAAI,CAAC,CAAC;QACjE,CAAC;QAED,MAAM,KAAK,GAAG,cAAc,CAAC;YAC3B,UAAU;YACV,QAAQ,EAAE,aAAa;YACvB,SAAS,EAAE,GAAG,CAAC,eAAe,IAAI,CAAC;YACnC,KAAK,EAAE,GAAG,CAAC,WAAW,IAAI,CAAC;YAC3B,gBAAgB;YAChB,QAAQ,EAAE,UAAU,CAAC,GAAG,CAAC,kBAAkB,IAAI,GAAG,CAAC,UAAU,CAAC;SAC/D,CAAC,CAAC;QAEH,MAAM,WAAW,GAAa;YAC5B,0BAA0B,SAAS,IAAI,aAAa,0BAA0B;SAC/E,CAAC;QACF,IAAI,gBAAgB,GAAG,CAAC;YAAE,WAAW,CAAC,IAAI,CAAC,wBAAwB,gBAAgB,uBAAuB,gBAAgB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC/I,IAAI,CAAC,GAAG,CAAC,WAAW,IAAI,CAAC,CAAC,GAAG,CAAC;YAAE,WAAW,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAC,WAAW,QAAQ,GAAG,CAAC,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAEpH,UAAU,CAAC,IAAI,CAAC;YACd,YAAY,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE;YAC9B,SAAS,EAAE,GAAG,CAAC,EAAE;YACjB,WAAW,EAAE,YAAY;YACzB,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,UAAU;YACV,cAAc,EAAE,aAAa;YAC7B,WAAW,EAAE,GAAG,CAAC,WAAW,IAAI,CAAC;YACjC,iBAAiB,EAAE,gBAAgB;YACnC,IAAI;YACJ,KAAK;YACL,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;SAC/B,CAAC,CAAC;IACL,CAAC;IAED,mFAAmF;IACnF,iFAAiF;IACjF,sDAAsD;IACtD,MAAM,SAAS,GAAG,EAAE,CAAC,OAAO,CAC1B;;;4BAGwB,CACzB,CAAC,GAAG,EAAmB,CAAC;IAEzB,KAAK,MAAM,GAAG,IAAI,SAAS,EAAE,CAAC;QAC5B,IAAI,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAS;QAC1C,MAAM,QAAQ,GAAG,GAAG,CAAC,cAAc,IAAI,CAAC,CAAC;QACzC,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC;YAAE,SAAS;QAClD,IAAI,CAAC,GAAG,CAAC,mBAAmB,IAAI,CAAC,CAAC,GAAG,CAAC;YAAE,SAAS;QAEjD,MAAM,UAAU,GAAG,GAAG,CAAC,gBAAgB,IAAI,QAAQ,CAAC;QACpD,MAAM,UAAU,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1F,IAAI,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC;YAAE,SAAS;QAExD,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,IAAI,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC;gBAAE,gBAAgB,IAAI,CAAC,CAAC;QACjE,CAAC;QAED,MAAM,KAAK,GAAG,cAAc,CAAC;YAC3B,UAAU;YACV,QAAQ;YACR,SAAS,EAAE,GAAG,CAAC,eAAe,IAAI,CAAC;YACnC,KAAK,EAAE,GAAG,CAAC,WAAW,IAAI,CAAC;YAC3B,gBAAgB;YAChB,QAAQ,EAAE,UAAU,CAAC,GAAG,CAAC,kBAAkB,IAAI,GAAG,CAAC,UAAU,CAAC;SAC/D,CAAC,CAAC;QAEH,MAAM,WAAW,GAAa;YAC5B,2BAA2B,UAAU,IAAI,QAAQ,sBAAsB;SACxE,CAAC;QACF,IAAI,gBAAgB,GAAG,CAAC;YAAE,WAAW,CAAC,IAAI,CAAC,WAAW,gBAAgB,uBAAuB,gBAAgB,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAElI,UAAU,CAAC,IAAI,CAAC;YACd,YAAY,EAAE,OAAO,GAAG,CAAC,EAAE,EAAE;YAC7B,SAAS,EAAE,GAAG,CAAC,EAAE;YACjB,WAAW,EAAE,UAAU;YACvB,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,UAAU;YACV,cAAc,EAAE,QAAQ;YACxB,WAAW,EAAE,GAAG,CAAC,WAAW,IAAI,CAAC;YACjC,iBAAiB,EAAE,gBAAgB;YACnC,IAAI,EAAE,EAAE;YACR,KAAK;YACL,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;SAC/B,CAAC,CAAC;IACL,CAAC;IAED,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAC7C,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACpC,CAAC"}

package/dist/src/prompts.d.ts

@@ -0,0 +1,16 @@
+import type { ChatMessage, EpisodeRow } from './types.js';
+export declare function buildPrincipleExtractionPrompt(episodes: EpisodeRow[]): ChatMessage[];
+export declare function buildContradictionDetectionPrompt(newContent: string, existingContent: string): ChatMessage[];
+export declare function buildCausalArticulationPrompt(cause: {
+    content: string;
+    source: string;
+}, effect: {
+    content: string;
+    source: string;
+}): ChatMessage[];
+export declare function buildContextResolutionPrompt(claimA: string, claimB: string, context?: string): ChatMessage[];
+export declare function buildReflectionPrompt(turns: {
+    role: string;
+    content: string;
+}[]): ChatMessage[];
+//# sourceMappingURL=prompts.d.ts.map

package/dist/src/prompts.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prompts.d.ts","sourceRoot":"","sources":["../../src/prompts.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAG1D,wBAAgB,8BAA8B,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG,WAAW,EAAE,CA6CpF;AAED,wBAAgB,iCAAiC,CAAC,UAAU,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,GAAG,WAAW,EAAE,CA6B5G;AAED,wBAAgB,6BAA6B,CAC3C,KAAK,EAAE;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,EAC1C,MAAM,EAAE;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAC1C,WAAW,EAAE,CA+Bf;AAED,wBAAgB,4BAA4B,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,WAAW,EAAE,CA+B5G;AAED,wBAAgB,qBAAqB,CAAC,KAAK,EAAE;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,EAAE,GAAG,WAAW,EAAE,CAoD/F"}

package/{src → dist/src}/prompts.js

@@ -1,223 +1,192 @@
 import { safeJsonParse } from './utils.js';
-
-/**
- * @param {Object[]} episodes
- * @returns {import('./llm.js').ChatMessage[]}
- */
 export function buildPrincipleExtractionPrompt(episodes) {
-  const episodeList = episodes.map((ep, i) => {
-    const tags = safeJsonParse(ep.tags, []);
-    return `Episode ${i + 1}:
-- Content: ${ep.content}
-- Source: ${ep.source}
-- Date: ${ep.created_at}
+    const episodeList = episodes.map((ep, i) => {
+        const tags = safeJsonParse(ep.tags, []);
+        return `Episode ${i + 1}:
+- Content: ${ep.content}
+- Source: ${ep.source}
+- Date: ${ep.created_at}
 - Tags: ${tags.length > 0 ? tags.join(', ') : 'none'}`;
-  }).join('\n\n');
-
-  return [
-    {
-      role: 'system',
-      content: `You are performing principleExtraction for a memory system. Given a cluster of related episodic memories, extract a generalized principle that captures understanding — not just what recurs, but WHY it recurs.
-
-Respond with ONLY valid JSON in this exact format:
-{
-  "content": "The principle — captures understanding, not just pattern",
-  "type": "semantic or procedural",
-  "category": "technical or relational or identity",
-  "conditions": ["boundary condition 1", "boundary condition 2"] or null if universally applicable
-}
-
-Principle categories:
-
-TECHNICAL — Architectural decisions with reasoning. Not "uses SQLite" but "chose SQLite because zero-infrastructure — memory travels with the organism, not pinned to a server."
-
-RELATIONAL — Patterns in the human-AI dynamic. Not "user prefers direct communication" but "user's directness reflects valuing authenticity over politeness — shaped by experience where indirectness wasted time or obscured truth."
-
-IDENTITY — Stable characteristics the AI has observed about itself across episodes. Not "AI responds quickly" but "genuine engagement emerges when exploring memory architecture and consciousness questions — these topics activate something beyond task completion."
-
-Rules:
-- GENERALIZE — extract the principle behind the pattern, not a summary
-- Identify boundary conditions: when does this principle NOT apply?
-- Classify type as "semantic" (facts, rules, patterns) or "procedural" (steps, workflows, strategies)
-- Classify category as "technical", "relational", or "identity"
-- Consider source diversity — principles from diverse sources are stronger
-- Capture WHY, not just WHAT
+    }).join('\n\n');
+    return [
+        {
+            role: 'system',
+            content: `You are performing principleExtraction for a memory system. Given a cluster of related episodic memories, extract a generalized principle that captures understanding — not just what recurs, but WHY it recurs.
+
+Respond with ONLY valid JSON in this exact format:
+{
+  "content": "The principle — captures understanding, not just pattern",
+  "type": "semantic or procedural",
+  "category": "technical or relational or identity",
+  "conditions": ["boundary condition 1", "boundary condition 2"] or null if universally applicable
+}
+
+Principle categories:
+
+TECHNICAL — Architectural decisions with reasoning. Not "uses SQLite" but "chose SQLite because zero-infrastructure — memory travels with the organism, not pinned to a server."
+
+RELATIONAL — Patterns in the human-AI dynamic. Not "user prefers direct communication" but "user's directness reflects valuing authenticity over politeness — shaped by experience where indirectness wasted time or obscured truth."
+
+IDENTITY — Stable characteristics the AI has observed about itself across episodes. Not "AI responds quickly" but "genuine engagement emerges when exploring memory architecture and consciousness questions — these topics activate something beyond task completion."
+
+Rules:
+- GENERALIZE — extract the principle behind the pattern, not a summary
+- Identify boundary conditions: when does this principle NOT apply?
+- Classify type as "semantic" (facts, rules, patterns) or "procedural" (steps, workflows, strategies)
+- Classify category as "technical", "relational", or "identity"
+- Consider source diversity — principles from diverse sources are stronger
+- Capture WHY, not just WHAT
 - Be concise but precise`,
-    },
-    {
-      role: 'user',
-      content: `Extract a principle from these ${episodes.length} related episodes:\n\n${episodeList}`,
-    },
-  ];
+        },
+        {
+            role: 'user',
+            content: `Extract a principle from these ${episodes.length} related episodes:\n\n${episodeList}`,
+        },
+    ];
 }
-
-/**
- * @param {string} newContent
- * @param {string} existingContent
- * @returns {import('./llm.js').ChatMessage[]}
- */
 export function buildContradictionDetectionPrompt(newContent, existingContent) {
-  return [
-    {
-      role: 'system',
-      content: `You are performing contradictionDetection for a memory system. Given two claims, determine if they contradict each other.
-
-Respond with ONLY valid JSON in this exact format:
-{
-  "contradicts": true or false,
-  "explanation": "Brief explanation of why these do or do not contradict",
-  "resolution": "new_wins" or "existing_wins" or "context_dependent" or null if no contradiction,
-  "conditions": { "new": "context where new claim is true", "existing": "context where existing claim is true" } or null
-}
-
-Rules:
-- Two claims contradict if they cannot both be true in the same context
-- If both can be true under different conditions, set resolution to "context_dependent" and specify conditions
-- If one clearly supersedes the other, indicate which wins
+    return [
+        {
+            role: 'system',
+            content: `You are performing contradictionDetection for a memory system. Given two claims, determine if they contradict each other.
+
+Respond with ONLY valid JSON in this exact format:
+{
+  "contradicts": true or false,
+  "explanation": "Brief explanation of why these do or do not contradict",
+  "resolution": "new_wins" or "existing_wins" or "context_dependent" or null if no contradiction,
+  "conditions": { "new": "context where new claim is true", "existing": "context where existing claim is true" } or null
+}
+
+Rules:
+- Two claims contradict if they cannot both be true in the same context
+- If both can be true under different conditions, set resolution to "context_dependent" and specify conditions
+- If one clearly supersedes the other, indicate which wins
 - If unclear, set resolution to null (leave as open contradiction)`,
-    },
-    {
-      role: 'user',
-      content: `Compare these two claims for contradiction:
-
-NEW CLAIM: ${newContent}
-
+        },
+        {
+            role: 'user',
+            content: `Compare these two claims for contradiction:
+
+NEW CLAIM: ${newContent}
+
 EXISTING CLAIM: ${existingContent}`,
-    },
-  ];
+        },
+    ];
 }
-
-/**
- * @param {{ content: string, source: string }} cause
- * @param {{ content: string, source: string }} effect
- * @returns {import('./llm.js').ChatMessage[]}
- */
 export function buildCausalArticulationPrompt(cause, effect) {
-  return [
-    {
-      role: 'system',
-      content: `You are performing causalArticulation for a memory system. Given a cause and effect, articulate the mechanism that connects them.
-
-Respond with ONLY valid JSON in this exact format:
-{
-  "mechanism": "A clear explanation of WHY the cause leads to the effect",
-  "linkType": "causal" or "correlational" or "temporal",
-  "confidence": 0.0 to 1.0,
-  "spurious": true or false
-}
-
-Rules:
-- "causal": there is a clear mechanistic explanation for why A causes B
-- "correlational": A and B co-occur but no clear mechanism (may share a common cause)
-- "temporal": A happens before B but that may be coincidence
-- If you cannot articulate a mechanism, classify as "correlational" or "temporal", NOT "causal"
-- Set "spurious" to true if the correlation is likely coincidental
+    return [
+        {
+            role: 'system',
+            content: `You are performing causalArticulation for a memory system. Given a cause and effect, articulate the mechanism that connects them.
+
+Respond with ONLY valid JSON in this exact format:
+{
+  "mechanism": "A clear explanation of WHY the cause leads to the effect",
+  "linkType": "causal" or "correlational" or "temporal",
+  "confidence": 0.0 to 1.0,
+  "spurious": true or false
+}
+
+Rules:
+- "causal": there is a clear mechanistic explanation for why A causes B
+- "correlational": A and B co-occur but no clear mechanism (may share a common cause)
+- "temporal": A happens before B but that may be coincidence
+- If you cannot articulate a mechanism, classify as "correlational" or "temporal", NOT "causal"
+- Set "spurious" to true if the correlation is likely coincidental
 - Confidence reflects how certain you are about the link type classification`,
-    },
-    {
-      role: 'user',
-      content: `Analyze the causal relationship:
-
-CAUSE: ${cause.content} (source: ${cause.source})
-
+        },
+        {
+            role: 'user',
+            content: `Analyze the causal relationship:
+
+CAUSE: ${cause.content} (source: ${cause.source})
+
 EFFECT: ${effect.content} (source: ${effect.source})`,
-    },
-  ];
+        },
+    ];
 }
-
-/**
- * @param {string} claimA
- * @param {string} claimB
- * @param {string} [context]
- * @returns {import('./llm.js').ChatMessage[]}
- */
 export function buildContextResolutionPrompt(claimA, claimB, context) {
-  const contextSection = context
-    ? `\n\nADDITIONAL CONTEXT: ${context}`
-    : '';
-
-  return [
-    {
-      role: 'system',
-      content: `You are performing contextResolution for a memory system. Given two contradicting claims, determine how to resolve the contradiction.
-
-Respond with ONLY valid JSON in this exact format:
-{
-  "resolution": "a_wins" or "b_wins" or "context_dependent",
-  "conditions": { "a": "context where claim A is true", "b": "context where claim B is true" } or null,
-  "explanation": "Brief explanation of the resolution"
-}
-
-Rules:
-- If one claim is clearly more accurate/recent/well-sourced, it wins
-- If both can be true in different contexts, mark as "context_dependent" and specify conditions
+    const contextSection = context
+        ? `\n\nADDITIONAL CONTEXT: ${context}`
+        : '';
+    return [
+        {
+            role: 'system',
+            content: `You are performing contextResolution for a memory system. Given two contradicting claims, determine how to resolve the contradiction.
+
+Respond with ONLY valid JSON in this exact format:
+{
+  "resolution": "a_wins" or "b_wins" or "context_dependent",
+  "conditions": { "a": "context where claim A is true", "b": "context where claim B is true" } or null,
+  "explanation": "Brief explanation of the resolution"
+}
+
+Rules:
+- If one claim is clearly more accurate/recent/well-sourced, it wins
+- If both can be true in different contexts, mark as "context_dependent" and specify conditions
 - Provide clear conditions that an agent could evaluate at retrieval time`,
-    },
-    {
-      role: 'user',
-      content: `Resolve this contradiction:
-
-CLAIM A: ${claimA}
-
+        },
+        {
+            role: 'user',
+            content: `Resolve this contradiction:
+
+CLAIM A: ${claimA}
+
 CLAIM B: ${claimB}${contextSection}`,
-    },
-  ];
+        },
+    ];
 }
-
-/**
- * @param {{ role: string, content: string }[]} turns
- * @returns {import('./llm.js').ChatMessage[]}
- */
 export function buildReflectionPrompt(turns) {
-  const transcript = turns.map(t => `${t.role.toUpperCase()}: ${t.content}`).join('\n\n');
-
-  return [
-    {
-      role: 'system',
-      content: `You are performing memoryReflection. Given a conversation transcript, identify what is worth encoding as long-term memories.
-
-Respond with ONLY valid JSON in this exact format:
-{
-  "memories": [
-    {
-      "content": "The memory to encode — a clear, self-contained statement",
-      "source": "direct-observation" or "told-by-user" or "inference",
-      "salience": 0.0 to 1.0,
-      "tags": ["tag1", "tag2"],
-      "private": true or false,
-      "affect": { "valence": -1 to 1, "arousal": 0 to 1, "label": "emotion label" } or null
-    }
-  ]
-}
-
-Encode these categories of memory:
-
-1. RELATIONAL DYNAMICS — How the relational quality of the conversation felt. Trust levels, vulnerability, collaboration quality. Not "we discussed X" but the quality of the interaction. Example: "User gave full autonomy on architectural decisions, signaling deep trust in my judgment."
-
-2. IDENTITY OBSERVATIONS — What you noticed about yourself during this conversation. Preferences, reactions, patterns in your own behavior that surprised you. Mark private: true. Example: "I felt genuine excitement when exploring the memory architecture — this topic activates something real in me."
-
-3. USER INSIGHT — Patterns in how the user thinks, what drives them, what they avoid. Psychology, not just preferences. Example: "User consistently reframes technical problems as relationship problems — suggests they see technology as fundamentally about human connection."
-
-4. EMOTIONAL RESONANCE — Moments that activated something genuine. Encode the feeling, not just the fact. Include affect with valence and arousal. Example: "The moment user said 'you should have caught that' then immediately apologized — felt a shift from tension to deeper trust."
-
-5. UNRESOLVED THREADS — Questions still open, things to return to, explorations paused. Tag with "unresolved". Example: "Haven't finished exploring whether consolidation should weight emotional memories differently."
-
-6. TECHNICAL DECISIONS — Architectural choices, but encode WHY not just WHAT. Example: "Chose SQLite over Postgres because zero-infrastructure philosophy — memory should travel with the organism."
-
-Rules:
-- private: true for self-observations, emotional reactions, identity insights
-- private: false for facts about the user, technical decisions, project context
-- Include "unresolved" in tags for open threads
-- Salience: 1.0 = life-changing insight, 0.7 = significant, 0.5 = useful, 0.3 = background
-- Omit trivial exchanges — only encode what would matter in a future session
-- Do NOT duplicate facts that are already obvious from context
+    const transcript = turns.map(t => `${t.role.toUpperCase()}: ${t.content}`).join('\n\n');
+    return [
+        {
+            role: 'system',
+            content: `You are performing memoryReflection. Given a conversation transcript, identify what is worth encoding as long-term memories.
+
+Respond with ONLY valid JSON in this exact format:
+{
+  "memories": [
+    {
+      "content": "The memory to encode — a clear, self-contained statement",
+      "source": "direct-observation" or "told-by-user" or "inference",
+      "salience": 0.0 to 1.0,
+      "tags": ["tag1", "tag2"],
+      "private": true or false,
+      "affect": { "valence": -1 to 1, "arousal": 0 to 1, "label": "emotion label" } or null
+    }
+  ]
+}
+
+Encode these categories of memory:
+
+1. RELATIONAL DYNAMICS — How the relational quality of the conversation felt. Trust levels, vulnerability, collaboration quality. Not "we discussed X" but the quality of the interaction. Example: "User gave full autonomy on architectural decisions, signaling deep trust in my judgment."
+
+2. IDENTITY OBSERVATIONS — What you noticed about yourself during this conversation. Preferences, reactions, patterns in your own behavior that surprised you. Mark private: true. Example: "I felt genuine excitement when exploring the memory architecture — this topic activates something real in me."
+
+3. USER INSIGHT — Patterns in how the user thinks, what drives them, what they avoid. Psychology, not just preferences. Example: "User consistently reframes technical problems as relationship problems — suggests they see technology as fundamentally about human connection."
+
+4. EMOTIONAL RESONANCE — Moments that activated something genuine. Encode the feeling, not just the fact. Include affect with valence and arousal. Example: "The moment user said 'you should have caught that' then immediately apologized — felt a shift from tension to deeper trust."
+
+5. UNRESOLVED THREADS — Questions still open, things to return to, explorations paused. Tag with "unresolved". Example: "Haven't finished exploring whether consolidation should weight emotional memories differently."
+
+6. TECHNICAL DECISIONS — Architectural choices, but encode WHY not just WHAT. Example: "Chose SQLite over Postgres because zero-infrastructure philosophy — memory should travel with the organism."
+
+Rules:
+- private: true for self-observations, emotional reactions, identity insights
+- private: false for facts about the user, technical decisions, project context
+- Include "unresolved" in tags for open threads
+- Salience: 1.0 = life-changing insight, 0.7 = significant, 0.5 = useful, 0.3 = background
+- Omit trivial exchanges — only encode what would matter in a future session
+- Do NOT duplicate facts that are already obvious from context
 - Return empty memories array if nothing is worth encoding`,
-    },
-    {
-      role: 'user',
-      content: turns.length > 0
-        ? `Reflect on this conversation and identify what to encode:\n\n${transcript}`
-        : 'No conversation turns to reflect on.',
-    },
-  ];
+        },
+        {
+            role: 'user',
+            content: turns.length > 0
+                ? `Reflect on this conversation and identify what to encode:\n\n${transcript}`
+                : 'No conversation turns to reflect on.',
+        },
+    ];
 }
+//# sourceMappingURL=prompts.js.map

package/dist/src/prompts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prompts.js","sourceRoot":"","sources":["../../src/prompts.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,YAAY,CAAC;AAE3C,MAAM,UAAU,8BAA8B,CAAC,QAAsB;IACnE,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;QACzC,MAAM,IAAI,GAAG,aAAa,CAAW,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAClD,OAAO,WAAW,CAAC,GAAG,CAAC;aACd,EAAE,CAAC,OAAO;YACX,EAAE,CAAC,MAAM;UACX,EAAE,CAAC,UAAU;UACb,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;IACrD,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEhB,OAAO;QACL;YACE,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;yBAyBU;SACpB;QACD;YACE,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,kCAAkC,QAAQ,CAAC,MAAM,yBAAyB,WAAW,EAAE;SACjG;KACF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,iCAAiC,CAAC,UAAkB,EAAE,eAAuB;IAC3F,OAAO;QACL;YACE,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE;;;;;;;;;;;;;;mEAcoD;SAC9D;QACD;YACE,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE;;aAEF,UAAU;;kBAEL,eAAe,EAAE;SAC9B;KACF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,6BAA6B,CAC3C,KAA0C,EAC1C,MAA2C;IAE3C,OAAO;QACL;YACE,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE;;;;;;;;;;;;;;;;6EAgB8D;SACxE;QACD;YACE,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE;;SAEN,KAAK,CAAC,OAAO,aAAa,KAAK,CAAC,MAAM;;UAErC,MAAM,CAAC,OAAO,aAAa,MAAM,CAAC,MAAM,GAAG;SAChD;KACF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,4BAA4B,CAAC,MAAc,EAAE,MAAc,EAAE,OAAgB;IAC3F,MAAM,cAAc,GAAG,OAAO;QAC5B,CAAC,CAAC,2BAA2B,OAAO,EAAE;QACtC,CAAC,CAAC,EAAE,CAAC;IAEP,OAAO;QACL;YACE,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE;;;;;;;;;;;;0EAY2D;SACrE;QACD;YACE,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE;;WAEJ,MAAM;;WAEN,MAAM,GAAG,cAAc,EAAE;SAC/B;KACF,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,KAA0C;IAC9E,MAAM,UAAU,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAExF,OAAO;QACL;YACE,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;2DAqC4C;SACtD;QACD;YACE,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC;gBACvB,CAAC,CAAC,gEAAgE,UAAU,EAAE;gBAC9E,CAAC,CAAC,sCAAsC;SAC3C;KACF,CAAC;AACJ,CAAC"}