@dungle-scrubs/hippo 0.1.0

package/dist/strength.d.ts

@@ -0,0 +1,59 @@
+/** Minimum effective strength — below this, chunks are excluded from results. */
+export declare const STRENGTH_FLOOR = 0.05;
+/** Scoring weights. */
+export declare const WEIGHTS: {
+    readonly recency: 0.1;
+    readonly similarity: 0.6;
+    readonly strength: 0.3;
+};
+/**
+ * Compute decay resistance from access count.
+ *
+ * Frequently recalled memories decay slower.
+ *
+ * @param accessCount - Number of times this chunk was accessed
+ * @returns Decay resistance multiplier (≥1.0)
+ */
+export declare function decayResistance(accessCount: number): number;
+/**
+ * Compute effective strength after time decay.
+ *
+ * @param runningIntensity - Current running intensity [0, 1]
+ * @param accessCount - Total access count
+ * @param hoursSinceLastAccess - Hours since last access
+ * @returns Effective strength [0, 1]
+ */
+export declare function effectiveStrength(runningIntensity: number, accessCount: number, hoursSinceLastAccess: number): number;
+/**
+ * Compute recency score based on days since creation.
+ *
+ * @param daysSinceCreation - Days since the chunk was created
+ * @returns Recency score [0, 1], exponentially decaying
+ */
+export declare function recencyScore(daysSinceCreation: number): number;
+/**
+ * Compute composite search score combining similarity, strength, and recency.
+ *
+ * @param similarity - Cosine similarity [0, 1]
+ * @param strength - Effective strength [0, 1]
+ * @param recency - Recency score [0, 1]
+ * @returns Weighted composite score
+ */
+export declare function searchScore(similarity: number, strength: number, recency: number): number;
+/**
+ * Update running intensity via moving average after reinforcement.
+ *
+ * @param oldIntensity - Current running intensity
+ * @param encounterCount - Current encounter count (before increment)
+ * @param newReading - Intensity of the new encounter
+ * @returns Updated running intensity
+ */
+export declare function updatedIntensity(oldIntensity: number, encounterCount: number, newReading: number): number;
+/**
+ * Apply retrieval boost to running intensity.
+ *
+ * @param runningIntensity - Current running intensity
+ * @returns Boosted intensity, clamped to 1.0
+ */
+export declare function retrievalBoost(runningIntensity: number): number;
+//# sourceMappingURL=strength.d.ts.map

package/dist/strength.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"strength.d.ts","sourceRoot":"","sources":["../src/strength.ts"],"names":[],"mappings":"AAMA,iFAAiF;AACjF,eAAO,MAAM,cAAc,OAAO,CAAC;AAEnC,uBAAuB;AACvB,eAAO,MAAM,OAAO;;;;CAIV,CAAC;AAEX;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,CAE3D;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAChC,gBAAgB,EAAE,MAAM,EACxB,WAAW,EAAE,MAAM,EACnB,oBAAoB,EAAE,MAAM,GAC1B,MAAM,CAGR;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,iBAAiB,EAAE,MAAM,GAAG,MAAM,CAE9D;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAEzF;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAC/B,YAAY,EAAE,MAAM,EACpB,cAAc,EAAE,MAAM,EACtB,UAAU,EAAE,MAAM,GAChB,MAAM,CAER;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,gBAAgB,EAAE,MAAM,GAAG,MAAM,CAE/D"}

package/dist/strength.js

@@ -0,0 +1,76 @@
+/** Default decay constant λ. */
+const LAMBDA = 0.001;
+/** Retrieval boost added to running_intensity on each access. */
+const RETRIEVAL_BOOST = 0.02;
+/** Minimum effective strength — below this, chunks are excluded from results. */
+export const STRENGTH_FLOOR = 0.05;
+/** Scoring weights. */
+export const WEIGHTS = {
+    recency: 0.1,
+    similarity: 0.6,
+    strength: 0.3,
+};
+/**
+ * Compute decay resistance from access count.
+ *
+ * Frequently recalled memories decay slower.
+ *
+ * @param accessCount - Number of times this chunk was accessed
+ * @returns Decay resistance multiplier (≥1.0)
+ */
+export function decayResistance(accessCount) {
+    return 1 + Math.log(1 + accessCount) * 0.3;
+}
+/**
+ * Compute effective strength after time decay.
+ *
+ * @param runningIntensity - Current running intensity [0, 1]
+ * @param accessCount - Total access count
+ * @param hoursSinceLastAccess - Hours since last access
+ * @returns Effective strength [0, 1]
+ */
+export function effectiveStrength(runningIntensity, accessCount, hoursSinceLastAccess) {
+    const resistance = decayResistance(accessCount);
+    return runningIntensity * Math.exp((-LAMBDA / resistance) * hoursSinceLastAccess);
+}
+/**
+ * Compute recency score based on days since creation.
+ *
+ * @param daysSinceCreation - Days since the chunk was created
+ * @returns Recency score [0, 1], exponentially decaying
+ */
+export function recencyScore(daysSinceCreation) {
+    return Math.exp(-0.01 * daysSinceCreation);
+}
+/**
+ * Compute composite search score combining similarity, strength, and recency.
+ *
+ * @param similarity - Cosine similarity [0, 1]
+ * @param strength - Effective strength [0, 1]
+ * @param recency - Recency score [0, 1]
+ * @returns Weighted composite score
+ */
+export function searchScore(similarity, strength, recency) {
+    return WEIGHTS.similarity * similarity + WEIGHTS.strength * strength + WEIGHTS.recency * recency;
+}
+/**
+ * Update running intensity via moving average after reinforcement.
+ *
+ * @param oldIntensity - Current running intensity
+ * @param encounterCount - Current encounter count (before increment)
+ * @param newReading - Intensity of the new encounter
+ * @returns Updated running intensity
+ */
+export function updatedIntensity(oldIntensity, encounterCount, newReading) {
+    return (oldIntensity * encounterCount + newReading) / (encounterCount + 1);
+}
+/**
+ * Apply retrieval boost to running intensity.
+ *
+ * @param runningIntensity - Current running intensity
+ * @returns Boosted intensity, clamped to 1.0
+ */
+export function retrievalBoost(runningIntensity) {
+    return Math.min(1.0, runningIntensity + RETRIEVAL_BOOST);
+}
+//# sourceMappingURL=strength.js.map

package/dist/strength.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"strength.js","sourceRoot":"","sources":["../src/strength.ts"],"names":[],"mappings":"AAAA,gCAAgC;AAChC,MAAM,MAAM,GAAG,KAAK,CAAC;AAErB,iEAAiE;AACjE,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,iFAAiF;AACjF,MAAM,CAAC,MAAM,cAAc,GAAG,IAAI,CAAC;AAEnC,uBAAuB;AACvB,MAAM,CAAC,MAAM,OAAO,GAAG;IACtB,OAAO,EAAE,GAAG;IACZ,UAAU,EAAE,GAAG;IACf,QAAQ,EAAE,GAAG;CACJ,CAAC;AAEX;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,WAAmB;IAClD,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,CAAC,GAAG,GAAG,CAAC;AAC5C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAChC,gBAAwB,EACxB,WAAmB,EACnB,oBAA4B;IAE5B,MAAM,UAAU,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IAChD,OAAO,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,UAAU,CAAC,GAAG,oBAAoB,CAAC,CAAC;AACnF,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,iBAAyB;IACrD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,iBAAiB,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,UAAkB,EAAE,QAAgB,EAAE,OAAe;IAChF,OAAO,OAAO,CAAC,UAAU,GAAG,UAAU,GAAG,OAAO,CAAC,QAAQ,GAAG,QAAQ,GAAG,OAAO,CAAC,OAAO,GAAG,OAAO,CAAC;AAClG,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC/B,YAAoB,EACpB,cAAsB,EACtB,UAAkB;IAElB,OAAO,CAAC,YAAY,GAAG,cAAc,GAAG,UAAU,CAAC,GAAG,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;AAC5E,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,gBAAwB;IACtD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,gBAAgB,GAAG,eAAe,CAAC,CAAC;AAC1D,CAAC"}

package/dist/tools/append-memory-block.d.ts

@@ -0,0 +1,22 @@
+import type { AgentTool } from "@mariozechner/pi-agent-core";
+import type { DbStatements } from "../db.js";
+declare const Params: import("@sinclair/typebox").TObject<{
+    content: import("@sinclair/typebox").TString;
+    key: import("@sinclair/typebox").TString;
+}>;
+/** Options for creating the append_memory_block tool. */
+export interface AppendMemoryBlockToolOptions {
+    readonly agentId: string;
+    readonly stmts: DbStatements;
+}
+/**
+ * Create the append_memory_block tool.
+ *
+ * Appends text to a named memory block. Creates the block if it doesn't exist.
+ *
+ * @param opts - Tool options
+ * @returns AgentTool instance
+ */
+export declare function createAppendMemoryBlockTool(opts: AppendMemoryBlockToolOptions): AgentTool<typeof Params>;
+export {};
+//# sourceMappingURL=append-memory-block.d.ts.map

package/dist/tools/append-memory-block.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"append-memory-block.d.ts","sourceRoot":"","sources":["../../src/tools/append-memory-block.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAmB,MAAM,6BAA6B,CAAC;AAE9E,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,UAAU,CAAC;AAM7C,QAAA,MAAM,MAAM;;;EAGV,CAAC;AAEH,yDAAyD;AACzD,MAAM,WAAW,4BAA4B;IAC5C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;CAC7B;AAED;;;;;;;GAOG;AACH,wBAAgB,2BAA2B,CAC1C,IAAI,EAAE,4BAA4B,GAChC,SAAS,CAAC,OAAO,MAAM,CAAC,CAmC1B"}

package/dist/tools/append-memory-block.js

@@ -0,0 +1,45 @@
+import { Type } from "@mariozechner/pi-ai";
+/** Threshold in bytes at which the tool warns about block size. */
+const BLOCK_SIZE_WARNING_BYTES = 100_000;
+const Params = Type.Object({
+    content: Type.String({ description: "Text to append to the block" }),
+    key: Type.String({ description: "Block name (e.g. 'persona', 'human', 'objectives')" }),
+});
+/**
+ * Create the append_memory_block tool.
+ *
+ * Appends text to a named memory block. Creates the block if it doesn't exist.
+ *
+ * @param opts - Tool options
+ * @returns AgentTool instance
+ */
+export function createAppendMemoryBlockTool(opts) {
+    return {
+        description: "Append text to a named memory block. Creates the block if it doesn't exist (upsert).",
+        execute: async (_toolCallId, params) => {
+            const now = new Date().toISOString();
+            const existing = opts.stmts.getBlockByKey.get(opts.agentId, params.key);
+            const newValue = existing ? `${existing.value}\n${params.content}` : params.content;
+            opts.stmts.upsertBlock.run({
+                agent_id: opts.agentId,
+                key: params.key,
+                updated_at: now,
+                value: newValue,
+            });
+            const action = existing ? "appended to" : "created";
+            const sizeBytes = new TextEncoder().encode(newValue).byteLength;
+            const warning = sizeBytes > BLOCK_SIZE_WARNING_BYTES
+                ? ` (warning: block is ${Math.round(sizeBytes / 1024)}KB — consider using replace_memory_block to trim)`
+                : "";
+            const result = {
+                content: [{ text: `${action} block "${params.key}"${warning}`, type: "text" }],
+                details: { action, sizeBytes },
+            };
+            return result;
+        },
+        label: "Append Memory Block",
+        name: "append_memory_block",
+        parameters: Params,
+    };
+}
+//# sourceMappingURL=append-memory-block.js.map

package/dist/tools/append-memory-block.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"append-memory-block.js","sourceRoot":"","sources":["../../src/tools/append-memory-block.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAI3C,mEAAmE;AACnE,MAAM,wBAAwB,GAAG,OAAO,CAAC;AAEzC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1B,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,6BAA6B,EAAE,CAAC;IACpE,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,oDAAoD,EAAE,CAAC;CACvF,CAAC,CAAC;AAQH;;;;;;;GAOG;AACH,MAAM,UAAU,2BAA2B,CAC1C,IAAkC;IAElC,OAAO;QACN,WAAW,EACV,sFAAsF;QACvF,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE;YACtC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAE1D,CAAC;YAEb,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,KAAK,KAAK,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC;YAEpF,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC;gBAC1B,QAAQ,EAAE,IAAI,CAAC,OAAO;gBACtB,GAAG,EAAE,MAAM,CAAC,GAAG;gBACf,UAAU,EAAE,GAAG;gBACf,KAAK,EAAE,QAAQ;aACf,CAAC,CAAC;YAEH,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC;YACpD,MAAM,SAAS,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC;YAChE,MAAM,OAAO,GACZ,SAAS,GAAG,wBAAwB;gBACnC,CAAC,CAAC,uBAAuB,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,mDAAmD;gBACxG,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,MAAM,GAA2D;gBACtE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,MAAM,WAAW,MAAM,CAAC,GAAG,IAAI,OAAO,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;gBAC9E,OAAO,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE;aAC9B,CAAC;YACF,OAAO,MAAM,CAAC;QACf,CAAC;QACD,KAAK,EAAE,qBAAqB;QAC5B,IAAI,EAAE,qBAAqB;QAC3B,UAAU,EAAE,MAAM;KAClB,CAAC;AACH,CAAC"}

package/dist/tools/forget-memory.d.ts

@@ -0,0 +1,31 @@
+import type { AgentTool } from "@mariozechner/pi-agent-core";
+import type { Database } from "better-sqlite3";
+import { type DbStatements } from "../db.js";
+import type { EmbedFn } from "../types.js";
+declare const Params: import("@sinclair/typebox").TObject<{
+    description: import("@sinclair/typebox").TString;
+}>;
+/** Options for creating the forget_memory tool. */
+export interface ForgetMemoryToolOptions {
+    readonly agentId: string;
+    readonly db: Database;
+    readonly embed: EmbedFn;
+    /** Minimum cosine similarity to consider a match for deletion (default: 0.7). */
+    readonly forgetThreshold?: number;
+    /** Max chunks to load for brute-force search (default: 10,000). */
+    readonly maxSearchChunks?: number;
+    readonly stmts: DbStatements;
+}
+/**
+ * Create the forget_memory tool.
+ *
+ * Hard deletes matching chunks from the database. No audit trail.
+ * Deletes are wrapped in a transaction so either all matched chunks
+ * are forgotten or none are.
+ *
+ * @param opts - Tool options
+ * @returns AgentTool instance
+ */
+export declare function createForgetMemoryTool(opts: ForgetMemoryToolOptions): AgentTool<typeof Params>;
+export {};
+//# sourceMappingURL=forget-memory.d.ts.map

package/dist/tools/forget-memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"forget-memory.d.ts","sourceRoot":"","sources":["../../src/tools/forget-memory.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAmB,MAAM,6BAA6B,CAAC;AAE9E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,EAAE,KAAK,YAAY,EAAsB,MAAM,UAAU,CAAC;AAEjE,OAAO,KAAK,EAAS,OAAO,EAAE,MAAM,aAAa,CAAC;AAQlD,QAAA,MAAM,MAAM;;EAIV,CAAC;AAEH,mDAAmD;AACnD,MAAM,WAAW,uBAAuB;IACvC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,iFAAiF;IACjF,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC;IAClC,mEAAmE;IACnE,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;CAC7B;AAED;;;;;;;;;GASG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,uBAAuB,GAAG,SAAS,CAAC,OAAO,MAAM,CAAC,CA4D9F"}

package/dist/tools/forget-memory.js

@@ -0,0 +1,77 @@
+import { Type } from "@mariozechner/pi-ai";
+import { getAllActiveChunks } from "../db.js";
+import { chunkEmbedding, cosineSimilarity } from "../similarity.js";
+/** Default minimum similarity threshold for a chunk to be considered a match for deletion. */
+const DEFAULT_FORGET_THRESHOLD = 0.7;
+/** Default maximum chunks to load for brute-force semantic search. */
+const DEFAULT_MAX_SEARCH_CHUNKS = 10_000;
+const Params = Type.Object({
+    description: Type.String({
+        description: "Description of what to forget (e.g. 'that I like Redux')",
+    }),
+});
+/**
+ * Create the forget_memory tool.
+ *
+ * Hard deletes matching chunks from the database. No audit trail.
+ * Deletes are wrapped in a transaction so either all matched chunks
+ * are forgotten or none are.
+ *
+ * @param opts - Tool options
+ * @returns AgentTool instance
+ */
+export function createForgetMemoryTool(opts) {
+    // Wrap deletes in a transaction for atomicity. clearSupersededBy resurrects
+    // any chunk whose superseded_by points at a deleted chunk. This handles
+    // single-hop chains correctly (A superseded by B → forget B → A active).
+    // Multi-hop chains (A→B→C) work because superseded_by is always single-hop:
+    // only the directly superseded chunk references the superseder.
+    const deleteMatches = opts.db.transaction((matches) => {
+        for (const { chunk } of matches) {
+            opts.stmts.clearSupersededBy.run(chunk.id, opts.agentId);
+            opts.stmts.deleteChunk.run(chunk.id);
+        }
+    });
+    return {
+        description: "Forget specific memories or facts. Performs semantic match and hard deletes matching entries. No record of the forget request is stored.",
+        execute: async (_toolCallId, params, signal) => {
+            const queryEmbedding = await opts.embed(params.description, signal);
+            const maxChunks = opts.maxSearchChunks ?? DEFAULT_MAX_SEARCH_CHUNKS;
+            const threshold = opts.forgetThreshold ?? DEFAULT_FORGET_THRESHOLD;
+            const allChunks = getAllActiveChunks(opts.stmts, opts.agentId, maxChunks);
+            // Find matching chunks above threshold
+            const matches = [];
+            for (const chunk of allChunks) {
+                const similarity = cosineSimilarity(queryEmbedding, chunkEmbedding(chunk));
+                if (similarity >= threshold) {
+                    matches.push({ chunk, similarity });
+                }
+            }
+            if (matches.length === 0) {
+                const result = {
+                    content: [{ text: "No matching memories found to forget.", type: "text" }],
+                    details: { deleted: 0 },
+                };
+                return result;
+            }
+            // Hard delete in a transaction — all-or-nothing.
+            // Also resurrects any chunks that were superseded by deleted ones.
+            deleteMatches(matches);
+            const deleted = matches.map((m) => m.chunk.content);
+            const result = {
+                content: [
+                    {
+                        text: `Forgot ${matches.length} memories:\n${deleted.map((d) => `- ${d}`).join("\n")}`,
+                        type: "text",
+                    },
+                ],
+                details: { deleted: matches.length, items: deleted },
+            };
+            return result;
+        },
+        label: "Forget Memory",
+        name: "forget_memory",
+        parameters: Params,
+    };
+}
+//# sourceMappingURL=forget-memory.js.map

package/dist/tools/forget-memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"forget-memory.js","sourceRoot":"","sources":["../../src/tools/forget-memory.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAE3C,OAAO,EAAqB,kBAAkB,EAAE,MAAM,UAAU,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAGpE,8FAA8F;AAC9F,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAErC,sEAAsE;AACtE,MAAM,yBAAyB,GAAG,MAAM,CAAC;AAEzC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1B,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC;QACxB,WAAW,EAAE,0DAA0D;KACvE,CAAC;CACF,CAAC,CAAC;AAcH;;;;;;;;;GASG;AACH,MAAM,UAAU,sBAAsB,CAAC,IAA6B;IACnE,4EAA4E;IAC5E,wEAAwE;IACxE,yEAAyE;IACzE,4EAA4E;IAC5E,gEAAgE;IAChE,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,OAAgC,EAAE,EAAE;QAC9E,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC;YACjC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;YACzD,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACtC,CAAC;IACF,CAAC,CAAC,CAAC;IAEH,OAAO;QACN,WAAW,EACV,0IAA0I;QAC3I,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;YAC9C,MAAM,cAAc,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;YAEpE,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,IAAI,yBAAyB,CAAC;YACpE,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,IAAI,wBAAwB,CAAC;YACnE,MAAM,SAAS,GAAG,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;YAE1E,uCAAuC;YACvC,MAAM,OAAO,GAAgD,EAAE,CAAC;YAChE,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;gBAC/B,MAAM,UAAU,GAAG,gBAAgB,CAAC,cAAc,EAAE,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;gBAC3E,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;oBAC7B,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;gBACrC,CAAC;YACF,CAAC;YAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAyC;oBACpD,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,uCAAuC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;oBAC1E,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE;iBACvB,CAAC;gBACF,OAAO,MAAM,CAAC;YACf,CAAC;YAED,iDAAiD;YACjD,mEAAmE;YACnE,aAAa,CAAC,OAAO,CAAC,CAAC;YAEvB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACpD,MAAM,MAAM,GAAmE;gBAC9E,OAAO,EAAE;oBACR;wBACC,IAAI,EAAE,UAAU,OAAO,CAAC,MAAM,eAAe,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;wBACtF,IAAI,EAAE,MAAM;qBACZ;iBACD;gBACD,OAAO,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE;aACpD,CAAC;YACF,OAAO,MAAM,CAAC;QACf,CAAC;QACD,KAAK,EAAE,eAAe;QACtB,IAAI,EAAE,eAAe;QACrB,UAAU,EAAE,MAAM;KAClB,CAAC;AACH,CAAC"}

package/dist/tools/index.d.ts

@@ -0,0 +1,9 @@
+export { createAppendMemoryBlockTool } from "./append-memory-block.js";
+export { createForgetMemoryTool } from "./forget-memory.js";
+export { createRecallConversationTool } from "./recall-conversation.js";
+export { createRecallMemoriesTool } from "./recall-memories.js";
+export { createRecallMemoryBlockTool } from "./recall-memory-block.js";
+export { createRememberFactsTool } from "./remember-facts.js";
+export { createReplaceMemoryBlockTool } from "./replace-memory-block.js";
+export { createStoreMemoryTool } from "./store-memory.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/tools/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/tools/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,2BAA2B,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AAC5D,OAAO,EAAE,4BAA4B,EAAE,MAAM,0BAA0B,CAAC;AACxE,OAAO,EAAE,wBAAwB,EAAE,MAAM,sBAAsB,CAAC;AAChE,OAAO,EAAE,2BAA2B,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,uBAAuB,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EAAE,4BAA4B,EAAE,MAAM,2BAA2B,CAAC;AACzE,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/tools/index.js

@@ -0,0 +1,9 @@
+export { createAppendMemoryBlockTool } from "./append-memory-block.js";
+export { createForgetMemoryTool } from "./forget-memory.js";
+export { createRecallConversationTool } from "./recall-conversation.js";
+export { createRecallMemoriesTool } from "./recall-memories.js";
+export { createRecallMemoryBlockTool } from "./recall-memory-block.js";
+export { createRememberFactsTool } from "./remember-facts.js";
+export { createReplaceMemoryBlockTool } from "./replace-memory-block.js";
+export { createStoreMemoryTool } from "./store-memory.js";
+//# sourceMappingURL=index.js.map

package/dist/tools/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/tools/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,2BAA2B,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,sBAAsB,EAAE,MAAM,oBAAoB,CAAC;AAC5D,OAAO,EAAE,4BAA4B,EAAE,MAAM,0BAA0B,CAAC;AACxE,OAAO,EAAE,wBAAwB,EAAE,MAAM,sBAAsB,CAAC;AAChE,OAAO,EAAE,2BAA2B,EAAE,MAAM,0BAA0B,CAAC;AACvE,OAAO,EAAE,uBAAuB,EAAE,MAAM,qBAAqB,CAAC;AAC9D,OAAO,EAAE,4BAA4B,EAAE,MAAM,2BAA2B,CAAC;AACzE,OAAO,EAAE,qBAAqB,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/tools/recall-conversation.d.ts

@@ -0,0 +1,21 @@
+import type { AgentTool } from "@mariozechner/pi-agent-core";
+import type { Database } from "better-sqlite3";
+declare const Params: import("@sinclair/typebox").TObject<{
+    limit: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TNumber>;
+    query: import("@sinclair/typebox").TString;
+}>;
+/**
+ * Options for creating the recall_conversation tool.
+ *
+ * The messages table must have columns: `id` (INTEGER PRIMARY KEY),
+ * `role` (TEXT), `content` (TEXT), `created_at` (TEXT).
+ * An FTS5 virtual table named `{messagesTable}_fts` must index the
+ * `content` column with `content_rowid=id`.
+ */
+export interface RecallConversationToolOptions {
+    readonly db: Database;
+    readonly messagesTable: string;
+}
+export declare function createRecallConversationTool(opts: RecallConversationToolOptions): AgentTool<typeof Params>;
+export {};
+//# sourceMappingURL=recall-conversation.d.ts.map

package/dist/tools/recall-conversation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recall-conversation.d.ts","sourceRoot":"","sources":["../../src/tools/recall-conversation.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAmB,MAAM,6BAA6B,CAAC;AAE9E,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE/C,QAAA,MAAM,MAAM;;;EAKV,CAAC;AASH;;;;;;;GAOG;AACH,MAAM,WAAW,6BAA6B;IAC7C,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAC/B;AAwBD,wBAAgB,4BAA4B,CAC3C,IAAI,EAAE,6BAA6B,GACjC,SAAS,CAAC,OAAO,MAAM,CAAC,CA2E1B"}

package/dist/tools/recall-conversation.js

@@ -0,0 +1,93 @@
+import { Type } from "@mariozechner/pi-ai";
+const Params = Type.Object({
+    limit: Type.Optional(Type.Number({ description: "Max results to return (default: 20)", minimum: 1 })),
+    query: Type.String({ description: "Search term for past messages" }),
+});
+/**
+ * Create the recall_conversation tool.
+ *
+ * Full-text search over past messages using FTS5.
+ * The consumer (marrow) is responsible for creating the messages table
+ * and FTS index.
+ *
+ * @param opts - Tool options
+ * @returns AgentTool instance
+ */
+/**
+ * Validate a SQL identifier to prevent injection via table name interpolation.
+ *
+ * @param name - Table name to validate
+ * @throws If the name contains unsafe characters
+ */
+function assertSafeIdentifier(name) {
+    if (!/^[a-zA-Z_]\w*$/.test(name)) {
+        throw new Error(`Unsafe SQL identifier: "${name}"`);
+    }
+}
+export function createRecallConversationTool(opts) {
+    assertSafeIdentifier(opts.messagesTable);
+    const ftsTable = `${opts.messagesTable}_fts`;
+    return {
+        description: "Full-text search over past conversation messages. Returns matching messages ranked by relevance.",
+        execute: async (_toolCallId, params) => {
+            const limit = params.limit ?? 20;
+            let rows;
+            try {
+                // Prepared per-call intentionally: the FTS table may not exist when the
+                // tool is created (marrow creates it). better-sqlite3 caches prepared
+                // statements internally by SQL text, so runtime overhead is negligible.
+                rows = opts.db
+                    .prepare(`SELECT m.role, m.content, m.created_at
+						FROM ${ftsTable} fts
+						JOIN ${opts.messagesTable} m ON fts.rowid = m.id
+						WHERE ${ftsTable} MATCH ?
+						ORDER BY rank
+						LIMIT ?`)
+                    .all(params.query, limit);
+            }
+            catch (err) {
+                // Only handle SQLite operational errors (missing table, bad FTS syntax).
+                // Re-throw unexpected errors (I/O, corruption, OOM).
+                const isSqliteError = err instanceof Error &&
+                    "code" in err &&
+                    err.code === "SQLITE_ERROR";
+                if (!isSqliteError) {
+                    throw err;
+                }
+                const msg = err.message?.toLowerCase() ?? "";
+                const isTableMissing = msg.includes("no such table") || msg.includes("no such module");
+                const result = {
+                    content: [
+                        {
+                            text: isTableMissing
+                                ? "Conversation search unavailable (FTS index may not exist)."
+                                : `Search query error: ${err.message}`,
+                            type: "text",
+                        },
+                    ],
+                    details: { error: isTableMissing ? "fts_unavailable" : "query_error" },
+                };
+                return result;
+            }
+            if (rows.length === 0) {
+                const result = {
+                    content: [{ text: "No matching messages found.", type: "text" }],
+                    details: { matches: 0 },
+                };
+                return result;
+            }
+            const lines = rows.map((r, i) => {
+                return `${i + 1}. [${r.role}] (${r.created_at}) ${r.content}`;
+            });
+            const result = {
+                content: [{ text: lines.join("\n"), type: "text" }],
+                details: { matches: rows.length },
+            };
+            return result;
+        },
+        label: "Recall Conversation",
+        name: "recall_conversation",
+        parameters: Params,
+    };
+}
+//# sourceMappingURL=recall-conversation.js.map

package/dist/tools/recall-conversation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recall-conversation.js","sourceRoot":"","sources":["../../src/tools/recall-conversation.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAG3C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IAC1B,KAAK,EAAE,IAAI,CAAC,QAAQ,CACnB,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,qCAAqC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAC/E;IACD,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,EAAE,+BAA+B,EAAE,CAAC;CACpE,CAAC,CAAC;AAsBH;;;;;;;;;GASG;AACH;;;;;GAKG;AACH,SAAS,oBAAoB,CAAC,IAAY;IACzC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,KAAK,CAAC,2BAA2B,IAAI,GAAG,CAAC,CAAC;IACrD,CAAC;AACF,CAAC;AAED,MAAM,UAAU,4BAA4B,CAC3C,IAAmC;IAEnC,oBAAoB,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IACzC,MAAM,QAAQ,GAAG,GAAG,IAAI,CAAC,aAAa,MAAM,CAAC;IAE7C,OAAO;QACN,WAAW,EACV,kGAAkG;QACnG,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,EAAE,EAAE;YACtC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,IAAI,EAAE,CAAC;YAEjC,IAAI,IAAwB,CAAC;YAC7B,IAAI,CAAC;gBACJ,wEAAwE;gBACxE,sEAAsE;gBACtE,wEAAwE;gBACxE,IAAI,GAAG,IAAI,CAAC,EAAE;qBACZ,OAAO,CACP;aACO,QAAQ;aACR,IAAI,CAAC,aAAa;cACjB,QAAQ;;cAER,CACR;qBACA,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAuB,CAAC;YAClD,CAAC;YAAC,OAAO,GAAY,EAAE,CAAC;gBACvB,yEAAyE;gBACzE,qDAAqD;gBACrD,MAAM,aAAa,GAClB,GAAG,YAAY,KAAK;oBACpB,MAAM,IAAI,GAAG;oBACZ,GAAgC,CAAC,IAAI,KAAK,cAAc,CAAC;gBAC3D,IAAI,CAAC,aAAa,EAAE,CAAC;oBACpB,MAAM,GAAG,CAAC;gBACX,CAAC;gBAED,MAAM,GAAG,GAAI,GAAa,CAAC,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;gBACxD,MAAM,cAAc,GAAG,GAAG,CAAC,QAAQ,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC;gBAEvF,MAAM,MAAM,GAAuC;oBAClD,OAAO,EAAE;wBACR;4BACC,IAAI,EAAE,cAAc;gCACnB,CAAC,CAAC,4DAA4D;gCAC9D,CAAC,CAAC,uBAAwB,GAAa,CAAC,OAAO,EAAE;4BAClD,IAAI,EAAE,MAAM;yBACZ;qBACD;oBACD,OAAO,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,aAAa,EAAE;iBACtE,CAAC;gBACF,OAAO,MAAM,CAAC;YACf,CAAC;YAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,MAAM,GAAyC;oBACpD,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,6BAA6B,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;oBAChE,OAAO,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE;iBACvB,CAAC;gBACF,OAAO,MAAM,CAAC;YACf,CAAC;YAED,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC/B,OAAO,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC;YAC/D,CAAC,CAAC,CAAC;YAEH,MAAM,MAAM,GAAyC;gBACpD,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;gBACnD,OAAO,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE;aACjC,CAAC;YACF,OAAO,MAAM,CAAC;QACf,CAAC;QACD,KAAK,EAAE,qBAAqB;QAC5B,IAAI,EAAE,qBAAqB;QAC3B,UAAU,EAAE,MAAM;KAClB,CAAC;AACH,CAAC"}

package/dist/tools/recall-memories.d.ts

@@ -0,0 +1,29 @@
+import type { AgentTool } from "@mariozechner/pi-agent-core";
+import { type DbStatements } from "../db.js";
+import type { EmbedFn } from "../types.js";
+declare const Params: import("@sinclair/typebox").TObject<{
+    limit: import("@sinclair/typebox").TOptional<import("@sinclair/typebox").TNumber>;
+    query: import("@sinclair/typebox").TString;
+}>;
+/** Options for creating the recall_memories tool. */
+export interface RecallMemoriesToolOptions {
+    readonly agentId: string;
+    readonly embed: EmbedFn;
+    /** Max chunks to load for brute-force search (default: 10,000). */
+    readonly maxSearchChunks?: number;
+    /** Minimum cosine similarity to include in results (default: 0.1). */
+    readonly minSimilarity?: number;
+    readonly stmts: DbStatements;
+}
+/**
+ * Create the recall_memories tool.
+ *
+ * Performs semantic search over facts and memories, weighted by
+ * cosine similarity, effective strength, and recency.
+ *
+ * @param opts - Tool options
+ * @returns AgentTool instance
+ */
+export declare function createRecallMemoriesTool(opts: RecallMemoriesToolOptions): AgentTool<typeof Params>;
+export {};
+//# sourceMappingURL=recall-memories.d.ts.map

package/dist/tools/recall-memories.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recall-memories.d.ts","sourceRoot":"","sources":["../../src/tools/recall-memories.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAmB,MAAM,6BAA6B,CAAC;AAE9E,OAAO,EAAE,KAAK,YAAY,EAAsB,MAAM,UAAU,CAAC;AASjE,OAAO,KAAK,EAAE,OAAO,EAAgB,MAAM,aAAa,CAAC;AAyBzD,QAAA,MAAM,MAAM;;;EAKV,CAAC;AAEH,qDAAqD;AACrD,MAAM,WAAW,yBAAyB;IACzC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,mEAAmE;IACnE,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC;IAClC,sEAAsE;IACtE,QAAQ,CAAC,aAAa,CAAC,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC;CAC7B;AAED;;;;;;;;GAQG;AACH,wBAAgB,wBAAwB,CACvC,IAAI,EAAE,yBAAyB,GAC7B,SAAS,CAAC,OAAO,MAAM,CAAC,CAsF1B"}

package/dist/tools/recall-memories.js

@@ -0,0 +1,106 @@
+import { Type } from "@mariozechner/pi-ai";
+import { getAllActiveChunks } from "../db.js";
+import { chunkEmbedding, cosineSimilarity } from "../similarity.js";
+import { effectiveStrength, recencyScore, retrievalBoost, STRENGTH_FLOOR, searchScore, } from "../strength.js";
+/** Default maximum chunks to load for brute-force semantic search. */
+const DEFAULT_MAX_SEARCH_CHUNKS = 10_000;
+/** Default minimum cosine similarity to include a result. */
+const DEFAULT_MIN_SIMILARITY = 0.1;
+/** SQLite error codes that are transient (busy/locked) and safe to swallow. */
+const TRANSIENT_SQLITE_CODES = new Set(["SQLITE_BUSY", "SQLITE_LOCKED"]);
+/**
+ * Check if an error is a transient SQLite error (busy/locked).
+ *
+ * @param err - Unknown error value
+ * @returns True if this is a transient SQLite error safe to ignore
+ */
+function isSqliteTransient(err) {
+    return (err instanceof Error &&
+        "code" in err &&
+        TRANSIENT_SQLITE_CODES.has(err.code));
+}
+const Params = Type.Object({
+    limit: Type.Optional(Type.Number({ description: "Max results to return (default: 10)", minimum: 1 })),
+    query: Type.String({ description: "What to search for in memory" }),
+});
+/**
+ * Create the recall_memories tool.
+ *
+ * Performs semantic search over facts and memories, weighted by
+ * cosine similarity, effective strength, and recency.
+ *
+ * @param opts - Tool options
+ * @returns AgentTool instance
+ */
+export function createRecallMemoriesTool(opts) {
+    return {
+        description: "Semantic search over stored facts and memories. Returns results ranked by relevance, strength, and recency.",
+        execute: async (_toolCallId, params, signal) => {
+            const limit = params.limit ?? 10;
+            const maxChunks = opts.maxSearchChunks ?? DEFAULT_MAX_SEARCH_CHUNKS;
+            const minSim = opts.minSimilarity ?? DEFAULT_MIN_SIMILARITY;
+            const now = new Date();
+            const queryEmbedding = await opts.embed(params.query, signal);
+            // Single query for all active chunks (facts + memories),
+            // capped to avoid loading unbounded data into memory.
+            const allChunks = getAllActiveChunks(opts.stmts, opts.agentId, maxChunks);
+            // Score and filter
+            const scored = [];
+            for (const chunk of allChunks) {
+                const similarity = cosineSimilarity(queryEmbedding, chunkEmbedding(chunk));
+                if (similarity < minSim) {
+                    continue;
+                }
+                const hoursSince = (now.getTime() - new Date(chunk.last_accessed_at).getTime()) / (1000 * 60 * 60);
+                const strength = effectiveStrength(chunk.running_intensity, chunk.access_count, hoursSince);
+                if (strength < STRENGTH_FLOOR) {
+                    continue;
+                }
+                const daysSince = (now.getTime() - new Date(chunk.created_at).getTime()) / (1000 * 60 * 60 * 24);
+                const recency = recencyScore(daysSince);
+                const score = searchScore(similarity, strength, recency);
+                scored.push({ chunk, score });
+            }
+            // Sort by score descending, take top N
+            scored.sort((a, b) => b.score - a.score);
+            const topResults = scored.slice(0, limit);
+            // Apply retrieval boost to accessed chunks.
+            // Boost failures are non-fatal — search results are still valid.
+            // Only swallow SQLite busy/locked errors; re-throw corruption/OOM.
+            for (const { chunk } of topResults) {
+                try {
+                    const boosted = retrievalBoost(chunk.running_intensity);
+                    opts.stmts.touchChunk.run({
+                        id: chunk.id,
+                        last_accessed_at: now.toISOString(),
+                        running_intensity: boosted,
+                    });
+                }
+                catch (err) {
+                    if (isSqliteTransient(err)) {
+                        continue;
+                    }
+                    throw err;
+                }
+            }
+            // Format response
+            if (topResults.length === 0) {
+                const result = {
+                    content: [{ text: "No memories found.", type: "text" }],
+                    details: { results: [] },
+                };
+                return result;
+            }
+            const lines = topResults.map((r, i) => `${i + 1}. [${r.chunk.kind}] (score: ${r.score.toFixed(3)}) ${r.chunk.content}`);
+            const result = {
+                content: [{ text: lines.join("\n"), type: "text" }],
+                details: { results: topResults },
+            };
+            return result;
+        },
+        label: "Recall Memories",
+        name: "recall_memories",
+        parameters: Params,
+    };
+}
+//# sourceMappingURL=recall-memories.js.map