audrey 0.15.0 → 0.16.1

package/package.json

@@ -1,77 +1,76 @@
-{
-  "name": "audrey",
-  "version": "0.15.0",
-  "description": "Biological memory architecture for AI agents — encode, consolidate, and recall memories with confidence decay, contradiction detection, and causal graphs",
-  "type": "module",
-  "main": "src/index.js",
-  "exports": {
-    ".": "./src/index.js",
-    "./mcp": "./mcp-server/index.js"
-  },
-  "bin": {
-    "audrey": "mcp-server/index.js",
-    "audrey-mcp": "mcp-server/index.js"
-  },
-  "files": [
-    "src/",
-    "mcp-server/",
-    "README.md",
-    "LICENSE"
-  ],
-  "scripts": {
-    "test": "vitest run",
-    "test:watch": "vitest"
-  },
-  "keywords": [
-    "ai",
-    "memory",
-    "agents",
-    "llm",
-    "cognitive",
-    "sqlite",
-    "embedding",
-    "mcp",
-    "biological-memory",
-    "episodic-memory",
-    "semantic-memory",
-    "forgetting-curve",
-    "vector-search",
-    "knowledge-graph",
-    "causal-graph",
-    "ai-agent",
-    "model-context-protocol",
-    "recall",
-    "consolidation",
-    "confidence",
-    "long-term-memory",
-    "persistent-memory",
-    "rag",
-    "claude",
-    "agent-framework"
-  ],
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/Evilander/Audrey.git"
-  },
-  "homepage": "https://github.com/Evilander/Audrey",
-  "bugs": {
-    "url": "https://github.com/Evilander/Audrey/issues"
-  },
-  "author": "Tyler Eveland <j.tyler.eveland@gmail.com>",
-  "engines": {
-    "node": ">=18"
-  },
-  "license": "MIT",
-  "dependencies": {
-    "@huggingface/transformers": "^3.8.1",
-    "@modelcontextprotocol/sdk": "^1.26.0",
-    "audrey": "^0.11.0",
-    "better-sqlite3": "^12.6.2",
-    "sqlite-vec": "^0.1.7-alpha.2",
-    "ulid": "^3.0.2",
-    "zod": "^4.3.6"
-  },
-  "devDependencies": {
-    "vitest": "^4.0.18"
-  }
-}
+{
+  "name": "audrey",
+  "version": "0.16.1",
+  "description": "Biological memory architecture for AI agents — encode, consolidate, and recall memories with confidence decay, contradiction detection, and causal graphs",
+  "type": "module",
+  "main": "src/index.js",
+  "exports": {
+    ".": "./src/index.js",
+    "./mcp": "./mcp-server/index.js"
+  },
+  "bin": {
+    "audrey": "mcp-server/index.js",
+    "audrey-mcp": "mcp-server/index.js"
+  },
+  "files": [
+    "src/",
+    "mcp-server/",
+    "README.md",
+    "LICENSE"
+  ],
+  "scripts": {
+    "test": "vitest run",
+    "test:watch": "vitest"
+  },
+  "keywords": [
+    "ai",
+    "memory",
+    "agents",
+    "llm",
+    "cognitive",
+    "sqlite",
+    "embedding",
+    "mcp",
+    "biological-memory",
+    "episodic-memory",
+    "semantic-memory",
+    "forgetting-curve",
+    "vector-search",
+    "knowledge-graph",
+    "causal-graph",
+    "ai-agent",
+    "model-context-protocol",
+    "recall",
+    "consolidation",
+    "confidence",
+    "long-term-memory",
+    "persistent-memory",
+    "rag",
+    "claude",
+    "agent-framework"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/Evilander/Audrey.git"
+  },
+  "homepage": "https://github.com/Evilander/Audrey",
+  "bugs": {
+    "url": "https://github.com/Evilander/Audrey/issues"
+  },
+  "author": "Tyler Eveland <j.tyler.eveland@gmail.com>",
+  "engines": {
+    "node": ">=18"
+  },
+  "license": "MIT",
+  "dependencies": {
+    "@huggingface/transformers": "^3.8.1",
+    "@modelcontextprotocol/sdk": "^1.26.0",
+    "better-sqlite3": "^12.6.2",
+    "sqlite-vec": "^0.1.7-alpha.2",
+    "ulid": "^3.0.2",
+    "zod": "^4.3.6"
+  },
+  "devDependencies": {
+    "vitest": "^4.0.18"
+  }
+}

package/src/adaptive.js

@@ -1,53 +1,53 @@
-export function suggestConsolidationParams(db) {
-  const runs = db.prepare(`
-    SELECT min_cluster_size, similarity_threshold, clusters_found, principles_extracted, episodes_evaluated
-    FROM consolidation_metrics
-    ORDER BY created_at DESC
-    LIMIT 20
-  `).all();
-
-  if (runs.length === 0) {
-    return {
-      minClusterSize: 3,
-      similarityThreshold: 0.85,
-      confidence: 'no_data',
-    };
-  }
-
-  const paramScores = new Map();
-  for (const run of runs) {
-    if (run.episodes_evaluated === 0) continue;
-    const key = `${run.min_cluster_size}:${run.similarity_threshold}`;
-    if (!paramScores.has(key)) {
-      paramScores.set(key, {
-        minClusterSize: run.min_cluster_size,
-        similarityThreshold: run.similarity_threshold,
-        yields: [],
-      });
-    }
-    paramScores.get(key).yields.push(run.principles_extracted / run.episodes_evaluated);
-  }
-
-  let bestKey = null;
-  let bestAvgYield = -1;
-  for (const [key, data] of paramScores) {
-    const avg = data.yields.reduce((a, b) => a + b, 0) / data.yields.length;
-    if (avg > bestAvgYield) {
-      bestAvgYield = avg;
-      bestKey = key;
-    }
-  }
-
-  if (!bestKey) {
-    return { minClusterSize: 3, similarityThreshold: 0.85, confidence: 'no_data' };
-  }
-
-  const best = paramScores.get(bestKey);
-  const confidence = runs.length >= 5 ? 'high' : runs.length >= 2 ? 'medium' : 'low';
-
-  return {
-    minClusterSize: best.minClusterSize,
-    similarityThreshold: best.similarityThreshold,
-    confidence,
-  };
-}
+export function suggestConsolidationParams(db) {
+  const runs = db.prepare(`
+    SELECT min_cluster_size, similarity_threshold, clusters_found, principles_extracted, episodes_evaluated
+    FROM consolidation_metrics
+    ORDER BY created_at DESC
+    LIMIT 20
+  `).all();
+
+  if (runs.length === 0) {
+    return {
+      minClusterSize: 3,
+      similarityThreshold: 0.85,
+      confidence: 'no_data',
+    };
+  }
+
+  const paramScores = new Map();
+  for (const run of runs) {
+    if (run.episodes_evaluated === 0) continue;
+    const key = `${run.min_cluster_size}:${run.similarity_threshold}`;
+    if (!paramScores.has(key)) {
+      paramScores.set(key, {
+        minClusterSize: run.min_cluster_size,
+        similarityThreshold: run.similarity_threshold,
+        yields: [],
+      });
+    }
+    paramScores.get(key).yields.push(run.principles_extracted / run.episodes_evaluated);
+  }
+
+  let bestKey = null;
+  let bestAvgYield = -1;
+  for (const [key, data] of paramScores) {
+    const avg = data.yields.reduce((a, b) => a + b, 0) / data.yields.length;
+    if (avg > bestAvgYield) {
+      bestAvgYield = avg;
+      bestKey = key;
+    }
+  }
+
+  if (!bestKey) {
+    return { minClusterSize: 3, similarityThreshold: 0.85, confidence: 'no_data' };
+  }
+
+  const best = paramScores.get(bestKey);
+  const confidence = runs.length >= 5 ? 'high' : runs.length >= 2 ? 'medium' : 'low';
+
+  return {
+    minClusterSize: best.minClusterSize,
+    similarityThreshold: best.similarityThreshold,
+    confidence,
+  };
+}

package/src/affect.js

@@ -1,64 +1,64 @@
-export function arousalSalienceBoost(arousal) {
-  if (arousal === undefined || arousal === null) return 0;
-  // Inverted-U (Yerkes-Dodson): peaks at 0.7, Gaussian sigma=0.3
-  return Math.exp(-Math.pow(arousal - 0.7, 2) / (2 * 0.3 * 0.3));
-}
-
-export function affectSimilarity(a, b) {
-  if (!a || !b) return 0;
-  if (a.valence === undefined || b.valence === undefined) return 0;
-  const valenceDist = Math.abs(a.valence - b.valence);
-  const valenceSim = 1.0 - (valenceDist / 2.0);
-  if (a.arousal === undefined || b.arousal === undefined) return valenceSim;
-  const arousalSim = 1.0 - Math.abs(a.arousal - b.arousal);
-  // Valence is primary (70%), arousal secondary (30%) per Bower 1981
-  return 0.7 * valenceSim + 0.3 * arousalSim;
-}
-
-export function moodCongruenceModifier(encodingAffect, retrievalMood, weight = 0.2) {
-  if (!encodingAffect || !retrievalMood) return 1.0;
-  const similarity = affectSimilarity(encodingAffect, retrievalMood);
-  if (similarity === 0) return 1.0;
-  return 1.0 + (weight * similarity);
-}
-
-export async function detectResonance(db, embeddingProvider, episodeId, { content, affect }, config = {}) {
-  const { enabled = true, k = 5, threshold = 0.5, affectThreshold = 0.6 } = config;
-  if (!enabled || !affect || affect.valence === undefined) return [];
-
-  const vector = await embeddingProvider.embed(content);
-  const buffer = embeddingProvider.vectorToBuffer(vector);
-
-  const matches = db.prepare(`
-    SELECT e.*, (1.0 - v.distance) AS similarity
-    FROM vec_episodes v
-    JOIN episodes e ON e.id = v.id
-    WHERE v.embedding MATCH ?
-      AND k = ?
-      AND e.id != ?
-      AND e.superseded_by IS NULL
-  `).all(buffer, k, episodeId);
-
-  const resonances = [];
-  for (const match of matches) {
-    if (match.similarity < threshold) continue;
-    let priorAffect;
-    try { priorAffect = JSON.parse(match.affect || '{}'); } catch { continue; }
-    if (priorAffect.valence === undefined) continue;
-
-    const emotionalSimilarity = affectSimilarity(affect, priorAffect);
-    if (emotionalSimilarity < affectThreshold) continue;
-
-    resonances.push({
-      priorEpisodeId: match.id,
-      priorContent: match.content,
-      priorAffect,
-      semanticSimilarity: match.similarity,
-      emotionalSimilarity,
-      timeDeltaDays: Math.floor((Date.now() - new Date(match.created_at).getTime()) / 86400000),
-      priorCreatedAt: match.created_at,
-    });
-  }
-
-  return resonances;
-}
+export function arousalSalienceBoost(arousal) {
+  if (arousal === undefined || arousal === null) return 0;
+  // Inverted-U (Yerkes-Dodson): peaks at 0.7, Gaussian sigma=0.3
+  return Math.exp(-Math.pow(arousal - 0.7, 2) / (2 * 0.3 * 0.3));
+}
+
+export function affectSimilarity(a, b) {
+  if (!a || !b) return 0;
+  if (a.valence === undefined || b.valence === undefined) return 0;
+  const valenceDist = Math.abs(a.valence - b.valence);
+  const valenceSim = 1.0 - (valenceDist / 2.0);
+  if (a.arousal === undefined || b.arousal === undefined) return valenceSim;
+  const arousalSim = 1.0 - Math.abs(a.arousal - b.arousal);
+  // Valence is primary (70%), arousal secondary (30%) per Bower 1981
+  return 0.7 * valenceSim + 0.3 * arousalSim;
+}
+
+export function moodCongruenceModifier(encodingAffect, retrievalMood, weight = 0.2) {
+  if (!encodingAffect || !retrievalMood) return 1.0;
+  const similarity = affectSimilarity(encodingAffect, retrievalMood);
+  if (similarity === 0) return 1.0;
+  return 1.0 + (weight * similarity);
+}
+
+export async function detectResonance(db, embeddingProvider, episodeId, { content, affect }, config = {}) {
+  const { enabled = true, k = 5, threshold = 0.5, affectThreshold = 0.6 } = config;
+  if (!enabled || !affect || affect.valence === undefined) return [];
+
+  const vector = await embeddingProvider.embed(content);
+  const buffer = embeddingProvider.vectorToBuffer(vector);
+
+  const matches = db.prepare(`
+    SELECT e.*, (1.0 - v.distance) AS similarity
+    FROM vec_episodes v
+    JOIN episodes e ON e.id = v.id
+    WHERE v.embedding MATCH ?
+      AND k = ?
+      AND e.id != ?
+      AND e.superseded_by IS NULL
+  `).all(buffer, k, episodeId);
+
+  const resonances = [];
+  for (const match of matches) {
+    if (match.similarity < threshold) continue;
+    let priorAffect;
+    try { priorAffect = JSON.parse(match.affect || '{}'); } catch { continue; }
+    if (priorAffect.valence === undefined) continue;
+
+    const emotionalSimilarity = affectSimilarity(affect, priorAffect);
+    if (emotionalSimilarity < affectThreshold) continue;
+
+    resonances.push({
+      priorEpisodeId: match.id,
+      priorContent: match.content,
+      priorAffect,
+      semanticSimilarity: match.similarity,
+      emotionalSimilarity,
+      timeDeltaDays: Math.floor((Date.now() - new Date(match.created_at).getTime()) / 86400000),
+      priorCreatedAt: match.created_at,
+    });
+  }
+
+  return resonances;
+}