@vinaes/succ 1.3.19

package/dist/lib/working-memory-pipeline.d.ts

@@ -0,0 +1,118 @@
+/**
+ * Working Memory Pipeline
+ *
+ * Filters and scores memories for session startup context loading.
+ * Implements two-phase fetch: pinned memories first, then scored recent.
+ *
+ * 1. Validity filtering (via isValidAt from temporal.ts)
+ * 2. Pinned memories always included (correction_count >= 2 OR is_invariant)
+ * 3. Remaining slots filled by priority_score (or effectiveScore fallback)
+ * 4. Diversity filter removes near-duplicate embeddings (cosine > 0.85)
+ * 5. Fallback to recency if scoring data is missing
+ * 6. Telemetry for anomalies
+ */
+/** Pinning threshold: memories with correction_count >= this are Tier 1 pins */
+export declare const PIN_THRESHOLD = 2;
+/** Max similarity allowed between two memories in working set */
+export declare const DIVERSITY_THRESHOLD = 0.85;
+/** Minimum fields needed from a raw memory row */
+export interface WorkingMemoryCandidate {
+    id: number;
+    content: string;
+    quality_score: number | null;
+    access_count: number;
+    created_at: string;
+    last_accessed: string | null;
+    valid_from: string | null;
+    valid_until: string | null;
+    correction_count: number;
+    is_invariant: boolean;
+    type?: string | null;
+    tags?: string[] | string | null;
+    priority_score?: number | null;
+}
+/** Thrown when attempting to delete or invalidate a pinned (Tier 1) memory */
+export declare class PinnedMemoryError extends Error {
+    readonly memoryId: number;
+    constructor(memoryId: number);
+}
+/**
+ * Detect if memory content contains invariant language (rules, constraints).
+ * Used to auto-set is_invariant on new memories.
+ * This is the fast sync path — regex only, covers 8 languages.
+ */
+export declare function detectInvariant(content: string): boolean;
+/**
+ * Canonical invariant phrases for reference embedding similarity.
+ * English only — the multilingual embedding model maps semantically similar
+ * content in ANY language to nearby vectors.
+ */
+export declare const INVARIANT_REFERENCE_PHRASES: string[];
+/**
+ * Detect invariant content using embedding similarity (language-agnostic).
+ * Fallback for when regex detectInvariant() misses non-covered languages.
+ * Uses the content embedding that's already computed at save time — zero extra API cost.
+ */
+export declare function detectInvariantWithEmbedding(content: string, embedding: number[]): Promise<boolean>;
+/**
+ * Clear cached invariant reference embeddings (for tests).
+ */
+export declare function clearInvariantEmbeddingCache(): void;
+/**
+ * Check if a memory is pinned (Tier 1 working memory).
+ */
+export declare function isPinned(memory: {
+    is_invariant: boolean;
+    correction_count: number;
+}): boolean;
+/**
+ * Get the weight for a memory type. Higher = more important.
+ * Tags like "critical", "architecture", "security" add a +0.1 boost.
+ */
+export declare function getTagWeight(type: string | null, tags: string[]): number;
+/**
+ * Compute confidence-decayed quality score.
+ * Quality decays exponentially based on time since last access (half-life 7 days).
+ * Floor at 10% of quality_score to prevent total decay.
+ */
+export declare function computeConfidenceDecay(qualityScore: number | null, lastAccessed: string | null, createdAt: string, now: Date): number;
+/**
+ * Compute the priority_score for a memory.
+ * Formula: 0.30*is_invariant + 0.25*confidence_decayed + 0.20*correction_capped
+ *        + 0.15*tag_weight + 0.10*access_capped
+ */
+export declare function computePriorityScore(m: {
+    is_invariant: boolean;
+    quality_score: number | null;
+    correction_count: number;
+    type?: string | null;
+    tags?: string[] | string | null;
+    access_count: number;
+    last_accessed: string | null;
+    created_at: string;
+}, now: Date): number;
+/**
+ * Apply the working memory pipeline with two-phase fetch:
+ * Phase 1: Include all pinned memories (correction_count >= 2 OR is_invariant)
+ * Phase 2: Fill remaining slots with scored recent memories
+ *
+ * @param memories - Raw memories from backend (pre-sorted by created_at DESC)
+ * @param limit - Max total memories to return
+ * @param now - Current time (injectable for testing)
+ * @param pinned - Pinned memories from getPinnedMemories() — may overlap with memories
+ * @returns Pinned + scored memories, up to `limit`
+ */
+export declare function applyWorkingMemoryPipeline<T extends WorkingMemoryCandidate>(memories: T[], limit: number, now?: Date, pinned?: T[]): T[];
+/**
+ * Remove near-duplicate memories based on embedding cosine similarity.
+ * Greedy: iterate in order, skip if too similar to any already-selected.
+ *
+ * @param memories - Scored memories (order matters — higher priority first)
+ * @param getEmbeddings - Async function to fetch embeddings by IDs
+ * @param maxSimilarity - Threshold above which items are considered duplicates
+ * @returns Deduplicated list preserving original order
+ */
+export declare function applyDiversityFilter<T extends {
+    id: number;
+}>(memories: T[], getEmbeddings: (ids: number[]) => Promise<Map<number, number[]>>, maxSimilarity?: number): Promise<T[]>;
+//# sourceMappingURL=working-memory-pipeline.d.ts.map

package/dist/lib/working-memory-pipeline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"working-memory-pipeline.d.ts","sourceRoot":"","sources":["../../src/lib/working-memory-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AASH,gFAAgF;AAChF,eAAO,MAAM,aAAa,IAAI,CAAC;AAE/B,iEAAiE;AACjE,eAAO,MAAM,mBAAmB,OAAO,CAAC;AAqBxC,kDAAkD;AAClD,MAAM,WAAW,sBAAsB;IACrC,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,gBAAgB,EAAE,MAAM,CAAC;IACzB,YAAY,EAAE,OAAO,CAAC;IACtB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,IAAI,CAAC;IAChC,cAAc,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAMD,8EAA8E;AAC9E,qBAAa,iBAAkB,SAAQ,KAAK;IAC1C,SAAgB,QAAQ,EAAE,MAAM,CAAC;gBACrB,QAAQ,EAAE,MAAM;CAK7B;AAMD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAiCxD;AAMD;;;;GAIG;AACH,eAAO,MAAM,2BAA2B,UAQvC,CAAC;AAMF;;;;GAIG;AACH,wBAAsB,4BAA4B,CAChD,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EAAE,GAClB,OAAO,CAAC,OAAO,CAAC,CAiBlB;AAED;;GAEG;AACH,wBAAgB,4BAA4B,IAAI,IAAI,CAGnD;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,MAAM,EAAE;IAAE,YAAY,EAAE,OAAO,CAAC;IAAC,gBAAgB,EAAE,MAAM,CAAA;CAAE,GAAG,OAAO,CAE7F;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAMxE;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CACpC,YAAY,EAAE,MAAM,GAAG,IAAI,EAC3B,YAAY,EAAE,MAAM,GAAG,IAAI,EAC3B,SAAS,EAAE,MAAM,EACjB,GAAG,EAAE,IAAI,GACR,MAAM,CAOR;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAClC,CAAC,EAAE;IACD,YAAY,EAAE,OAAO,CAAC;IACtB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,gBAAgB,EAAE,MAAM,CAAC;IACzB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,IAAI,CAAC;IAChC,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,UAAU,EAAE,MAAM,CAAC;CACpB,EACD,GAAG,EAAE,IAAI,GACR,MAAM,CAQR;AAmCD;;;;;;;;;;GAUG;AACH,wBAAgB,0BAA0B,CAAC,CAAC,SAAS,sBAAsB,EACzE,QAAQ,EAAE,CAAC,EAAE,EACb,KAAK,EAAE,MAAM,EACb,GAAG,GAAE,IAAiB,EACtB,MAAM,CAAC,EAAE,CAAC,EAAE,GACX,CAAC,EAAE,CAsGL;AAMD;;;;;;;;GAQG;AACH,wBAAsB,oBAAoB,CAAC,CAAC,SAAS;IAAE,EAAE,EAAE,MAAM,CAAA;CAAE,EACjE,QAAQ,EAAE,CAAC,EAAE,EACb,aAAa,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,EAChE,aAAa,GAAE,MAA4B,GAC1C,OAAO,CAAC,CAAC,EAAE,CAAC,CA4Bd"}

package/dist/lib/working-memory-pipeline.js

@@ -0,0 +1,344 @@
+/**
+ * Working Memory Pipeline
+ *
+ * Filters and scores memories for session startup context loading.
+ * Implements two-phase fetch: pinned memories first, then scored recent.
+ *
+ * 1. Validity filtering (via isValidAt from temporal.ts)
+ * 2. Pinned memories always included (correction_count >= 2 OR is_invariant)
+ * 3. Remaining slots filled by priority_score (or effectiveScore fallback)
+ * 4. Diversity filter removes near-duplicate embeddings (cosine > 0.85)
+ * 5. Fallback to recency if scoring data is missing
+ * 6. Telemetry for anomalies
+ */
+import { isValidAt } from './temporal.js';
+import { calculateEffectiveScore } from './retention.js';
+import { logWarn, logInfo } from './fault-logger.js';
+const COMPONENT = 'working-memory';
+/** Pinning threshold: memories with correction_count >= this are Tier 1 pins */
+export const PIN_THRESHOLD = 2;
+/** Max similarity allowed between two memories in working set */
+export const DIVERSITY_THRESHOLD = 0.85;
+// ============================================================================
+// Type weights for priority_score formula
+// ============================================================================
+const TYPE_WEIGHTS = {
+    decision: 1.0,
+    error: 0.9,
+    dead_end: 0.85,
+    pattern: 0.8,
+    learning: 0.7,
+    observation: 0.5,
+};
+const BOOST_TAGS = /^(critical|architecture|security)$/i;
+// ============================================================================
+// Error class
+// ============================================================================
+/** Thrown when attempting to delete or invalidate a pinned (Tier 1) memory */
+export class PinnedMemoryError extends Error {
+    memoryId;
+    constructor(memoryId) {
+        super(`Memory ${memoryId} is pinned (Tier 1) and cannot be deleted or invalidated`);
+        this.name = 'PinnedMemoryError';
+        this.memoryId = memoryId;
+    }
+}
+// ============================================================================
+// Pure functions
+// ============================================================================
+/**
+ * Detect if memory content contains invariant language (rules, constraints).
+ * Used to auto-set is_invariant on new memories.
+ * This is the fast sync path — regex only, covers 8 languages.
+ */
+export function detectInvariant(content) {
+    const text = content.toLowerCase().replace(/\s+/g, ' ');
+    const patterns = [
+        // English
+        /\b(?:always|never|must|shall)\s+\w/,
+        /\b(?:must not|shall not|do not|don't)\s+\w/,
+        /\b(?:required|mandatory|forbidden|prohibited)\b/,
+        /\b(?:critical|important)\s*:/,
+        /\bnever\b.*\bwithout\b/,
+        /\balways\b.*\bbefore\b/,
+        // Russian
+        /(?:всегда|никогда|обязательно|запрещено|нельзя|недопустимо)\s+\S/,
+        /(?:нельзя|запрещено|недопустимо)(?:\s|$)/,
+        /(?:должен|должна|должно|должны)\s+\S/,
+        /(?:ни в коем случае|ни при каких|строго запрещ)/,
+        /(?:критично|важно)\s*:/,
+        // German
+        /\b(?:immer|niemals|nie)\s+\w/,
+        /\b(?:muss|müssen|verboten|pflicht)\b/,
+        // French
+        /\b(?:toujours|jamais)\s+\w/,
+        /\b(?:obligatoire|interdit|défendu)\b/,
+        // Spanish
+        /\b(?:siempre|nunca|jamás)\s+\w/,
+        /\b(?:obligatorio|prohibido|requerido)\b/,
+        // Chinese
+        /(?:必须|绝不|永远不|禁止|始终|一定要|不得|不允许|不可以)/,
+        // Japanese
+        /(?:必ず|絶対に|禁止|してはいけない|しなければならない|常に)/,
+        // Korean
+        /(?:반드시|절대로|금지|항상|해서는 안)/,
+    ];
+    return patterns.some((p) => p.test(text));
+}
+// ============================================================================
+// Embedding-based invariant detection (language-agnostic fallback)
+// ============================================================================
+/**
+ * Canonical invariant phrases for reference embedding similarity.
+ * English only — the multilingual embedding model maps semantically similar
+ * content in ANY language to nearby vectors.
+ */
+export const INVARIANT_REFERENCE_PHRASES = [
+    'You must always do this without exception',
+    'This is strictly forbidden and must never be done',
+    'This is a mandatory requirement that cannot be skipped',
+    'Critical rule: never violate this under any circumstances',
+    'This is permanently required and shall not be changed',
+    'Under no circumstances should this be modified or removed',
+    'This policy is non-negotiable and applies at all times',
+];
+const INVARIANT_REF_SET = 'invariant-detection';
+const INVARIANT_SIMILARITY_THRESHOLD = 0.55;
+let _invariantRefsRegistered = false;
+/**
+ * Detect invariant content using embedding similarity (language-agnostic).
+ * Fallback for when regex detectInvariant() misses non-covered languages.
+ * Uses the content embedding that's already computed at save time — zero extra API cost.
+ */
+export async function detectInvariantWithEmbedding(content, embedding) {
+    if (embedding.length === 0)
+        return false;
+    try {
+        const { registerReferenceSet, maxSimilarityToReference } = await import('./reference-embeddings.js');
+        if (!_invariantRefsRegistered) {
+            registerReferenceSet(INVARIANT_REF_SET, INVARIANT_REFERENCE_PHRASES);
+            _invariantRefsRegistered = true;
+        }
+        const maxSim = await maxSimilarityToReference(embedding, INVARIANT_REF_SET);
+        return maxSim >= INVARIANT_SIMILARITY_THRESHOLD;
+    }
+    catch {
+        return false;
+    }
+}
+/**
+ * Clear cached invariant reference embeddings (for tests).
+ */
+export function clearInvariantEmbeddingCache() {
+    _invariantRefsRegistered = false;
+    // The actual embeddings are cleared via clearReferenceCache() from reference-embeddings.ts
+}
+/**
+ * Check if a memory is pinned (Tier 1 working memory).
+ */
+export function isPinned(memory) {
+    return memory.is_invariant || memory.correction_count >= PIN_THRESHOLD;
+}
+/**
+ * Get the weight for a memory type. Higher = more important.
+ * Tags like "critical", "architecture", "security" add a +0.1 boost.
+ */
+export function getTagWeight(type, tags) {
+    let weight = TYPE_WEIGHTS[type ?? 'observation'] ?? 0.5;
+    if (tags.some((t) => BOOST_TAGS.test(t))) {
+        weight = Math.min(weight + 0.1, 1.0);
+    }
+    return weight;
+}
+/**
+ * Compute confidence-decayed quality score.
+ * Quality decays exponentially based on time since last access (half-life 7 days).
+ * Floor at 10% of quality_score to prevent total decay.
+ */
+export function computeConfidenceDecay(qualityScore, lastAccessed, createdAt, now) {
+    const qs = qualityScore ?? 0.5;
+    const ref = lastAccessed ?? createdAt;
+    const hoursSince = (now.getTime() - new Date(ref).getTime()) / 3_600_000;
+    const halfLife = 168; // 7 days in hours
+    const decay = Math.exp((-Math.LN2 / halfLife) * Math.max(hoursSince, 0));
+    return qs * Math.max(decay, 0.1);
+}
+/**
+ * Compute the priority_score for a memory.
+ * Formula: 0.30*is_invariant + 0.25*confidence_decayed + 0.20*correction_capped
+ *        + 0.15*tag_weight + 0.10*access_capped
+ */
+export function computePriorityScore(m, now) {
+    const tags = parseTags(m.tags);
+    const isInv = m.is_invariant ? 1 : 0;
+    const confidence = computeConfidenceDecay(m.quality_score, m.last_accessed, m.created_at, now);
+    const corrCapped = Math.min(m.correction_count, 5) / 5;
+    const tagW = getTagWeight(m.type ?? null, tags);
+    const accessCapped = Math.min(m.access_count, 20) / 20;
+    return 0.3 * isInv + 0.25 * confidence + 0.2 * corrCapped + 0.15 * tagW + 0.1 * accessCapped;
+}
+/** Parse tags from various formats (string[], JSON string, null) */
+function parseTags(tags) {
+    if (!tags)
+        return [];
+    if (Array.isArray(tags))
+        return tags;
+    try {
+        return JSON.parse(tags);
+    }
+    catch {
+        return [];
+    }
+}
+// ============================================================================
+// Cosine similarity (local copy — avoids importing embeddings.ts with heavy deps)
+// ============================================================================
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length || a.length === 0)
+        return 0;
+    let dot = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dot += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    return denom === 0 ? 0 : dot / denom;
+}
+// ============================================================================
+// Main pipeline
+// ============================================================================
+/**
+ * Apply the working memory pipeline with two-phase fetch:
+ * Phase 1: Include all pinned memories (correction_count >= 2 OR is_invariant)
+ * Phase 2: Fill remaining slots with scored recent memories
+ *
+ * @param memories - Raw memories from backend (pre-sorted by created_at DESC)
+ * @param limit - Max total memories to return
+ * @param now - Current time (injectable for testing)
+ * @param pinned - Pinned memories from getPinnedMemories() — may overlap with memories
+ * @returns Pinned + scored memories, up to `limit`
+ */
+export function applyWorkingMemoryPipeline(memories, limit, now = new Date(), pinned) {
+    const totalBefore = memories.length + (pinned?.length ?? 0);
+    // Step 1: Collect and deduplicate pinned memories
+    const pinnedIds = new Set();
+    const pinnedValid = [];
+    if (pinned && pinned.length > 0) {
+        for (const m of pinned) {
+            if (isValidAt(m.valid_from, m.valid_until, now) && !pinnedIds.has(m.id)) {
+                pinnedIds.add(m.id);
+                pinnedValid.push(m);
+            }
+        }
+    }
+    // Also check memories array for any that are pinned (in case no separate fetch)
+    for (const m of memories) {
+        if (isPinned(m) && isValidAt(m.valid_from, m.valid_until, now) && !pinnedIds.has(m.id)) {
+            pinnedIds.add(m.id);
+            pinnedValid.push(m);
+        }
+    }
+    if (pinnedValid.length > 0) {
+        logInfo(COMPONENT, `${pinnedValid.length} pinned memories included (Tier 1)`, {
+            pinned: pinnedValid.length,
+            invariant: pinnedValid.filter((m) => m.is_invariant).length,
+            corrected: pinnedValid.filter((m) => m.correction_count >= PIN_THRESHOLD).length,
+        });
+    }
+    // If pinned already fills limit, just return them
+    if (pinnedValid.length >= limit) {
+        return pinnedValid.slice(0, limit);
+    }
+    // Step 2: Filter remaining memories by validity, excluding already-pinned
+    const remainingSlots = limit - pinnedValid.length;
+    const candidates = memories.filter((m) => !pinnedIds.has(m.id) && isValidAt(m.valid_from, m.valid_until, now));
+    const pinnedFromMemories = memories.filter((m) => pinnedIds.has(m.id)).length;
+    const filteredOut = memories.length - candidates.length - pinnedFromMemories;
+    const filteredPercent = memories.length > 0 ? (filteredOut / memories.length) * 100 : 0;
+    if (filteredPercent > 10) {
+        logInfo(COMPONENT, `Validity filter removed ${filteredOut}/${memories.length} candidates (${filteredPercent.toFixed(1)}%)`, { total: memories.length, filtered: filteredOut });
+    }
+    if (candidates.length === 0) {
+        if (pinnedValid.length > 0)
+            return pinnedValid;
+        if (totalBefore > 0) {
+            logWarn(COMPONENT, 'Pipeline returned 0 memories from non-empty input', {
+                totalBefore,
+                afterValidity: 0,
+            });
+        }
+        return [];
+    }
+    // Step 3: Score and rank remaining candidates
+    // Use priority_score if available, otherwise fall back to effectiveScore
+    const hasAnyScore = candidates.some((m) => m.priority_score != null || m.quality_score !== null);
+    if (!hasAnyScore) {
+        logWarn(COMPONENT, 'All candidates lack quality_score — falling back to recency order', {
+            count: candidates.length,
+        });
+        return [...pinnedValid, ...candidates.slice(0, remainingSlots)];
+    }
+    const scored = candidates.map((m) => {
+        // Prefer precomputed priority_score
+        if (m.priority_score != null) {
+            return { memory: m, score: m.priority_score };
+        }
+        // Fallback to calculateEffectiveScore
+        const retentionInput = {
+            id: m.id,
+            content: m.content,
+            quality_score: m.quality_score,
+            access_count: m.access_count,
+            created_at: m.created_at,
+            last_accessed: m.last_accessed,
+        };
+        try {
+            const result = calculateEffectiveScore(retentionInput);
+            return { memory: m, score: result.effectiveScore };
+        }
+        catch {
+            return { memory: m, score: 0 };
+        }
+    });
+    scored.sort((a, b) => b.score - a.score);
+    return [...pinnedValid, ...scored.slice(0, remainingSlots).map((s) => s.memory)];
+}
+// ============================================================================
+// Diversity filter (async — uses embeddings)
+// ============================================================================
+/**
+ * Remove near-duplicate memories based on embedding cosine similarity.
+ * Greedy: iterate in order, skip if too similar to any already-selected.
+ *
+ * @param memories - Scored memories (order matters — higher priority first)
+ * @param getEmbeddings - Async function to fetch embeddings by IDs
+ * @param maxSimilarity - Threshold above which items are considered duplicates
+ * @returns Deduplicated list preserving original order
+ */
+export async function applyDiversityFilter(memories, getEmbeddings, maxSimilarity = DIVERSITY_THRESHOLD) {
+    if (memories.length <= 1)
+        return memories;
+    const embeddings = await getEmbeddings(memories.map((m) => m.id));
+    if (embeddings.size === 0)
+        return memories;
+    const selected = [];
+    const selectedEmbeddings = [];
+    for (const m of memories) {
+        const emb = embeddings.get(m.id);
+        if (!emb) {
+            // Keep items without embeddings (can't compare)
+            selected.push(m);
+            continue;
+        }
+        const tooSimilar = selectedEmbeddings.some((sEmb) => cosineSimilarity(emb, sEmb) > maxSimilarity);
+        if (!tooSimilar) {
+            selected.push(m);
+            selectedEmbeddings.push(emb);
+        }
+    }
+    return selected;
+}
+//# sourceMappingURL=working-memory-pipeline.js.map

package/dist/lib/working-memory-pipeline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"working-memory-pipeline.js","sourceRoot":"","sources":["../../src/lib/working-memory-pipeline.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,eAAe,CAAC;AAC1C,OAAO,EAAE,uBAAuB,EAAE,MAAM,gBAAgB,CAAC;AAEzD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAErD,MAAM,SAAS,GAAG,gBAAgB,CAAC;AAEnC,gFAAgF;AAChF,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAC;AAE/B,iEAAiE;AACjE,MAAM,CAAC,MAAM,mBAAmB,GAAG,IAAI,CAAC;AAExC,+EAA+E;AAC/E,0CAA0C;AAC1C,+EAA+E;AAE/E,MAAM,YAAY,GAA2B;IAC3C,QAAQ,EAAE,GAAG;IACb,KAAK,EAAE,GAAG;IACV,QAAQ,EAAE,IAAI;IACd,OAAO,EAAE,GAAG;IACZ,QAAQ,EAAE,GAAG;IACb,WAAW,EAAE,GAAG;CACjB,CAAC;AAEF,MAAM,UAAU,GAAG,qCAAqC,CAAC;AAuBzD,+EAA+E;AAC/E,cAAc;AACd,+EAA+E;AAE/E,8EAA8E;AAC9E,MAAM,OAAO,iBAAkB,SAAQ,KAAK;IAC1B,QAAQ,CAAS;IACjC,YAAY,QAAgB;QAC1B,KAAK,CAAC,UAAU,QAAQ,0DAA0D,CAAC,CAAC;QACpF,IAAI,CAAC,IAAI,GAAG,mBAAmB,CAAC;QAChC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;CACF;AAED,+EAA+E;AAC/E,iBAAiB;AACjB,+EAA+E;AAE/E;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,OAAe;IAC7C,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAG;QACf,UAAU;QACV,oCAAoC;QACpC,4CAA4C;QAC5C,iDAAiD;QACjD,8BAA8B;QAC9B,wBAAwB;QACxB,wBAAwB;QACxB,UAAU;QACV,kEAAkE;QAClE,0CAA0C;QAC1C,sCAAsC;QACtC,iDAAiD;QACjD,wBAAwB;QACxB,SAAS;QACT,8BAA8B;QAC9B,sCAAsC;QACtC,SAAS;QACT,4BAA4B;QAC5B,sCAAsC;QACtC,UAAU;QACV,gCAAgC;QAChC,yCAAyC;QACzC,UAAU;QACV,oCAAoC;QACpC,WAAW;QACX,oCAAoC;QACpC,SAAS;QACT,yBAAyB;KAC1B,CAAC;IACF,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;AAC5C,CAAC;AAED,+EAA+E;AAC/E,mEAAmE;AACnE,+EAA+E;AAE/E;;;;GAIG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG;IACzC,2CAA2C;IAC3C,mDAAmD;IACnD,wDAAwD;IACxD,2DAA2D;IAC3D,uDAAuD;IACvD,2DAA2D;IAC3D,wDAAwD;CACzD,CAAC;AAEF,MAAM,iBAAiB,GAAG,qBAAqB,CAAC;AAChD,MAAM,8BAA8B,GAAG,IAAI,CAAC;AAC5C,IAAI,wBAAwB,GAAG,KAAK,CAAC;AAErC;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,4BAA4B,CAChD,OAAe,EACf,SAAmB;IAEnB,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAEzC,IAAI,CAAC;QACH,MAAM,EAAE,oBAAoB,EAAE,wBAAwB,EAAE,GACtD,MAAM,MAAM,CAAC,2BAA2B,CAAC,CAAC;QAE5C,IAAI,CAAC,wBAAwB,EAAE,CAAC;YAC9B,oBAAoB,CAAC,iBAAiB,EAAE,2BAA2B,CAAC,CAAC;YACrE,wBAAwB,GAAG,IAAI,CAAC;QAClC,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,wBAAwB,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;QAC5E,OAAO,MAAM,IAAI,8BAA8B,CAAC;IAClD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC;IACf,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,4BAA4B;IAC1C,wBAAwB,GAAG,KAAK,CAAC;IACjC,2FAA2F;AAC7F,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,MAA2D;IAClF,OAAO,MAAM,CAAC,YAAY,IAAI,MAAM,CAAC,gBAAgB,IAAI,aAAa,CAAC;AACzE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,IAAmB,EAAE,IAAc;IAC9D,IAAI,MAAM,GAAG,YAAY,CAAC,IAAI,IAAI,aAAa,CAAC,IAAI,GAAG,CAAC;IACxD,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACzC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CACpC,YAA2B,EAC3B,YAA2B,EAC3B,SAAiB,EACjB,GAAS;IAET,MAAM,EAAE,GAAG,YAAY,IAAI,GAAG,CAAC;IAC/B,MAAM,GAAG,GAAG,YAAY,IAAI,SAAS,CAAC;IACtC,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,SAAS,CAAC;IACzE,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,kBAAkB;IACxC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;IACzE,OAAO,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAClC,CASC,EACD,GAAS;IAET,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,UAAU,GAAG,sBAAsB,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;IAC/F,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,IAAI,IAAI,EAAE,IAAI,CAAC,CAAC;IAChD,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC;IACvD,OAAO,GAAG,GAAG,KAAK,GAAG,IAAI,GAAG,UAAU,GAAG,GAAG,GAAG,UAAU,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,YAAY,CAAC;AAC/F,CAAC;AAED,oEAAoE;AACpE,SAAS,SAAS,CAAC,IAA0C;IAC3D,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,kFAAkF;AAClF,+EAA+E;AAE/E,SAAS,gBAAgB,CAAC,CAAW,EAAE,CAAW;IAChD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC;AACvC,CAAC;AAED,+EAA+E;AAC/E,gBAAgB;AAChB,+EAA+E;AAE/E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,0BAA0B,CACxC,QAAa,EACb,KAAa,EACb,MAAY,IAAI,IAAI,EAAE,EACtB,MAAY;IAEZ,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC;IAE5D,kDAAkD;IAClD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,WAAW,GAAQ,EAAE,CAAC;IAE5B,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,SAAS,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;gBACxE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACpB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED,gFAAgF;IAChF,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACvF,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC3B,OAAO,CAAC,SAAS,EAAE,GAAG,WAAW,CAAC,MAAM,oCAAoC,EAAE;YAC5E,MAAM,EAAE,WAAW,CAAC,MAAM;YAC1B,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,MAAM;YAC3D,SAAS,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,IAAI,aAAa,CAAC,CAAC,MAAM;SACjF,CAAC,CAAC;IACL,CAAC;IAED,kDAAkD;IAClD,IAAI,WAAW,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;QAChC,OAAO,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,0EAA0E;IAC1E,MAAM,cAAc,GAAG,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC;IAClD,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAC3E,CAAC;IAEF,MAAM,kBAAkB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;IAC9E,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,GAAG,kBAAkB,CAAC;IAC7E,MAAM,eAAe,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAExF,IAAI,eAAe,GAAG,EAAE,EAAE,CAAC;QACzB,OAAO,CACL,SAAS,EACT,2BAA2B,WAAW,IAAI,QAAQ,CAAC,MAAM,gBAAgB,eAAe,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EACvG,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,CAClD,CAAC;IACJ,CAAC;IAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,WAAW,CAAC;QAC/C,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YACpB,OAAO,CAAC,SAAS,EAAE,mDAAmD,EAAE;gBACtE,WAAW;gBACX,aAAa,EAAE,CAAC;aACjB,CAAC,CAAC;QACL,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,8CAA8C;IAC9C,yEAAyE;IACzE,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,IAAI,IAAI,IAAI,CAAC,CAAC,aAAa,KAAK,IAAI,CAAC,CAAC;IAEjG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,OAAO,CAAC,SAAS,EAAE,mEAAmE,EAAE;YACtF,KAAK,EAAE,UAAU,CAAC,MAAM;SACzB,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,WAAW,EAAE,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAClC,oCAAoC;QACpC,IAAI,CAAC,CAAC,cAAc,IAAI,IAAI,EAAE,CAAC;YAC7B,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,cAAc,EAAE,CAAC;QAChD,CAAC;QACD,sCAAsC;QACtC,MAAM,cAAc,GAAuB;YACzC,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,aAAa,EAAE,CAAC,CAAC,aAAa;YAC9B,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,aAAa,EAAE,CAAC,CAAC,aAAa;SAC/B,CAAC;QACF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,uBAAuB,CAAC,cAAc,CAAC,CAAC;YACvD,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,cAAc,EAAE,CAAC;QACrD,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACjC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAEzC,OAAO,CAAC,GAAG,WAAW,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;AACnF,CAAC;AAED,+EAA+E;AAC/E,6CAA6C;AAC7C,+EAA+E;AAE/E;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,QAAa,EACb,aAAgE,EAChE,gBAAwB,mBAAmB;IAE3C,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,QAAQ,CAAC;IAE1C,MAAM,UAAU,GAAG,MAAM,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClE,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC;IAE3C,MAAM,QAAQ,GAAQ,EAAE,CAAC;IACzB,MAAM,kBAAkB,GAAe,EAAE,CAAC;IAE1C,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,gDAAgD;YAChD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,SAAS;QACX,CAAC;QAED,MAAM,UAAU,GAAG,kBAAkB,CAAC,IAAI,CACxC,CAAC,IAAI,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,aAAa,CACtD,CAAC;QAEF,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,kBAAkB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

package/dist/mcp/helpers.d.ts

@@ -0,0 +1,44 @@
+/**
+ * MCP Server helper utilities
+ *
+ * Shared helpers used across MCP tool and resource handlers:
+ * - setupGracefulShutdown: Process signal handlers
+ * - trackTokenSavings: Track RAG query token savings
+ * - trackMemoryAccess: Track memory access for retention decay
+ * - getBrainPath: Get brain vault directory path
+ * - parseRelativeDate: Parse relative date strings
+ * - createToolResponse / createErrorResponse: DRY response helpers
+ */
+import { z } from 'zod';
+import { type TokenEventType } from '../lib/storage/index.js';
+import type { SearchResult, ToolResponse } from './types.js';
+export declare const projectPathParam: z.ZodOptional<z.ZodString>;
+/**
+ * Set the current project (called once after initStorageDispatcher at startup)
+ */
+export declare function setCurrentProject(projectPath: string): void;
+/**
+ * Apply project_path from tool call params.
+ * If provided and different from current project, sets SUCC_PROJECT_ROOT
+ * and reinitializes storage dispatcher to use the correct database.
+ */
+export declare function applyProjectPath(projectPath?: string): Promise<void>;
+export declare function setupGracefulShutdown(): void;
+export declare function trackTokenSavings(eventType: TokenEventType, query: string, results: SearchResult[]): Promise<void>;
+/**
+ * Track memory access for retention decay.
+ * Memories that are frequently accessed will have higher effective scores.
+ *
+ * @param memoryIds - Array of memory IDs that were returned
+ * @param limit - The search limit (top N results)
+ * @param totalResults - Total number of results before limit
+ */
+export declare function trackMemoryAccess(memoryIds: number[], limit: number, _totalResults: number): Promise<void>;
+export declare function getBrainPath(): string;
+/**
+ * Parse relative date strings like "30d", "1w", "3m"
+ */
+export declare function parseRelativeDate(input: string): Date | null;
+export declare function createToolResponse(text: string): ToolResponse;
+export declare function createErrorResponse(text: string, component?: string, error?: Error): ToolResponse;
+//# sourceMappingURL=helpers.d.ts.map

package/dist/mcp/helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../src/mcp/helpers.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,EASL,KAAK,cAAc,EACpB,MAAM,yBAAyB,CAAC;AAOjC,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAG7D,eAAO,MAAM,gBAAgB,4BAK1B,CAAC;AAKJ;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,MAAM,QAEpD;AAED;;;;GAIG;AACH,wBAAsB,gBAAgB,CAAC,WAAW,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CA+B1E;AAGD,wBAAgB,qBAAqB,SAsBpC;AAGD,wBAAsB,iBAAiB,CACrC,SAAS,EAAE,cAAc,EACzB,KAAK,EAAE,MAAM,EACb,OAAO,EAAE,YAAY,EAAE,GACtB,OAAO,CAAC,IAAI,CAAC,CAiFf;AAED;;;;;;;GAOG;AACH,wBAAsB,iBAAiB,CACrC,SAAS,EAAE,MAAM,EAAE,EACnB,KAAK,EAAE,MAAM,EACb,aAAa,EAAE,MAAM,GACpB,OAAO,CAAC,IAAI,CAAC,CAoBf;AAGD,wBAAgB,YAAY,IAAI,MAAM,CAErC;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CA0B5D;AAGD,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY,CAI7D;AAED,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,KAAK,GAAG,YAAY,CAQjG"}