@mnemonic-ai/core 0.1.0

package/dist/index.d.cts

@@ -0,0 +1,309 @@
+import { B as BaseStore, A as AsyncBaseStore, a as Memory, b as AgentFilterOptions, c as MemoryEdge, S as SimilarPair, d as BaseEmbedder, e as MnemonicConfig, f as SalienceConfig, M as Mnemonic } from './client-b2Xhkqdl.cjs';
+export { g as AddOptions, h as AssemblerConfig, i as BUILTIN_SALIENCE_SIGNALS, j as BUILTIN_TIERS, C as ClassifierConfig, k as ConsolidationConfig, F as ForgetOptions, L as LinkerConfig, l as MemoryInit, m as MemoryTier, P as PromotionConfig, R as RecallOptions, n as SalienceSignal, o as ScorerConfig, p as SortOrder, q as StatsResult, r as StoreFactory, T as TierDefinition, s as createEdge, t as registerStore } from './client-b2Xhkqdl.cjs';
+
+/**
+ * Adapter that wraps a synchronous BaseStore into an AsyncBaseStore.
+ * Uses async functions so thrown errors become rejected promises.
+ */
+
+/** Wrap a synchronous BaseStore so it can be used as AsyncBaseStore. */
+declare function syncToAsync(store: BaseStore): AsyncBaseStore;
+
+/**
+ * SQLite-backed memory store — the zero-config default.
+ */
+
+declare class SQLiteStore implements BaseStore {
+    private _db;
+    constructor(path?: string);
+    initialize(): void;
+    close(): void;
+    /** Add missing columns/tables for stores created before multi-agent support. */
+    private _migrate;
+    save(memory: Memory): void;
+    get(memoryId: string): Memory | null;
+    listAll(options?: AgentFilterOptions): Memory[];
+    delete(memoryId: string): void;
+    deleteOlderThan(ageMs: number, tier?: string, options?: AgentFilterOptions): number;
+    saveEdge(edge: MemoryEdge): void;
+    getEdges(memoryId: string): MemoryEdge[];
+    searchByEmbedding(embedding: number[], limit?: number, options?: AgentFilterOptions): Memory[];
+    findSimilarPairs(options?: {
+        threshold?: number;
+        agentId?: string;
+        tier?: string;
+        maxCandidates?: number;
+        maxNeighborsPerCandidate?: number;
+    }): SimilarPair[];
+    getMeta(key: string): string | null;
+    setMeta(key: string, value: string): void;
+}
+
+/**
+ * PostgreSQL + pgvector memory store — production-grade async backend.
+ */
+
+interface PostgresStoreOptions {
+    /** PostgreSQL connection string (e.g. postgresql://user:pass@host:5432/db). */
+    dsn: string;
+    /** Embedding vector dimension (default 1536). */
+    embeddingDim?: number;
+    /** Minimum pool connections (default 2). */
+    poolMin?: number;
+    /** Maximum pool connections (default 10). */
+    poolMax?: number;
+}
+declare class PostgresStore implements AsyncBaseStore {
+    private _dsn;
+    private _embeddingDim;
+    private _poolMin;
+    private _poolMax;
+    private _pool;
+    private _pgvectorRegistered;
+    constructor(options: PostgresStoreOptions);
+    private _getPool;
+    private _query;
+    /** Register pgvector on the pool's connect event so every connection gets it. */
+    private _setupPgvectorOnPool;
+    initialize(): Promise<void>;
+    private _migrateColumns;
+    close(): Promise<void>;
+    save(memory: Memory): Promise<void>;
+    get(memoryId: string): Promise<Memory | null>;
+    listAll(options?: AgentFilterOptions): Promise<Memory[]>;
+    delete(memoryId: string): Promise<void>;
+    deleteOlderThan(ageMs: number, tier?: string, options?: AgentFilterOptions): Promise<number>;
+    saveEdge(edge: MemoryEdge): Promise<void>;
+    getEdges(memoryId: string): Promise<MemoryEdge[]>;
+    searchByEmbedding(embedding: number[], limit?: number, options?: AgentFilterOptions): Promise<Memory[]>;
+    findSimilarPairs(options?: {
+        threshold?: number;
+        agentId?: string;
+        tier?: string;
+        maxCandidates?: number;
+        maxNeighborsPerCandidate?: number;
+    }): Promise<SimilarPair[]>;
+    getMeta(key: string): Promise<string | null>;
+    setMeta(key: string, value: string): Promise<void>;
+}
+
+/**
+ * OpenAI embedding provider.
+ *
+ * Requires the `openai` package as a peer dependency.
+ */
+
+declare class OpenAIEmbedder implements BaseEmbedder {
+    private _model;
+    private _apiKey;
+    private _client;
+    constructor(options?: {
+        model?: string;
+        apiKey?: string;
+    });
+    get dimension(): number;
+    private getClient;
+    embed(text: string): Promise<number[]>;
+    embedBatch(texts: string[]): Promise<number[][]>;
+}
+
+/**
+ * Local embedder using @huggingface/transformers (ONNX runtime).
+ * Default model: Xenova/all-MiniLM-L6-v2 (384 dimensions).
+ */
+
+interface LocalEmbedderOptions {
+    /** HuggingFace model name (default: "Xenova/all-MiniLM-L6-v2"). */
+    model?: string;
+}
+declare class LocalEmbedder implements BaseEmbedder {
+    private _modelName;
+    private _pipeline;
+    private _dimension;
+    constructor(options?: LocalEmbedderOptions);
+    get dimension(): number;
+    private _getPipeline;
+    embed(text: string): Promise<number[]>;
+    embedBatch(texts: string[]): Promise<number[][]>;
+}
+
+/**
+ * Embedder factory — resolves MNEMONIC_EMBEDDER env var to a concrete embedder.
+ */
+
+/**
+ * Build an embedder based on provider name (or MNEMONIC_EMBEDDER env var).
+ *
+ * - "none" → null (keyword-only mode)
+ * - "openai" → OpenAIEmbedder
+ * - "local" → LocalEmbedder (@huggingface/transformers)
+ *
+ * Returns null if provider is "none" or empty.
+ * Throws if provider is unrecognised.
+ */
+declare function buildEmbedder(provider?: string): Promise<BaseEmbedder | null>;
+
+/**
+ * Tier classifier with configurable patterns and pluggable custom logic.
+ */
+
+/** Return the most appropriate tier name for the given content. */
+declare function classify(content: string, options?: {
+    source?: string;
+    actor?: string;
+    config?: MnemonicConfig;
+}): string;
+
+/**
+ * Dynamic importance scoring engine.
+ */
+
+/** Compute the current importance score for a memory. */
+declare function score(memory: Memory, config?: MnemonicConfig): number;
+
+/**
+ * Relationship detection between memories.
+ */
+
+/** Identify edges from newMemory to the most related existing memories. */
+declare function findLinks(newMemory: Memory, existing: Memory[], options?: {
+    config?: MnemonicConfig;
+    similarityThreshold?: number;
+    maxLinks?: number;
+}): MemoryEdge[];
+
+/**
+ * Context window assembly — greedy budget-filling with diversity penalty.
+ *
+ * Uses pre-computed similarity matrices for O(1) diversity lookups.
+ */
+
+/** Select and order memories to fill a token budget. */
+declare function assemble(_query: string, candidates: Memory[], options?: {
+    queryEmbedding?: number[] | null;
+    maxTokens?: number;
+    diversityStrength?: number;
+    minRelevance?: number;
+    config?: MnemonicConfig;
+}): Memory[];
+/** Render assembled memories as a plain-text block. */
+declare function formatContext(memories: Memory[], header?: string, conflicts?: Array<[number, number, string]>): string;
+
+/**
+ * Tier promotion and demotion — the memory maturation pipeline.
+ *
+ * transient → episodic → structural → identity
+ *                              ↑
+ *                        procedural ──┘
+ */
+
+interface PromotionResult {
+    memoryId: string;
+    oldTier: string;
+    newTier: string;
+    reason: string;
+}
+/** Identify memories that qualify for tier promotion. */
+declare function checkPromotions(memories: Memory[], config?: MnemonicConfig): PromotionResult[];
+/** Identify memories that qualify for tier demotion. */
+declare function checkDemotions(memories: Memory[], config?: MnemonicConfig): PromotionResult[];
+/** Change a memory's tier in-place, recording history. */
+declare function applyTierChange(memory: Memory, newTier: string): void;
+
+/**
+ * Automatic salience detection — the amygdala of the memory system.
+ */
+
+interface SalienceResult {
+    boost: number;
+    signals: string[];
+}
+/** Scan content for salience signals. */
+declare function detectSalience(content: string, config?: SalienceConfig): SalienceResult;
+
+/**
+ * Memory consolidation — merging episodic memories into semantic summaries.
+ */
+
+/** Error names that indicate transient LLM failures — should propagate, not fall back. */
+declare const TRANSIENT_ERRORS: Set<string>;
+/**
+ * Group episodic memories that overlap enough to consolidate.
+ *
+ * When `pairs` is provided, union-find runs directly on the sparse pairs
+ * (no N×N matrix). When omitted, falls back to brute-force matrix.
+ */
+declare function findConsolidationCandidates(memories: Memory[], config?: MnemonicConfig, pairs?: SimilarPair[]): Memory[][];
+/** Create a single structural memory summarising a cluster. */
+declare function mergeCluster(cluster: Memory[], config?: MnemonicConfig): Promise<Memory>;
+
+/**
+ * Raw API adapter — simple helper for injecting memory context into prompts.
+ */
+
+interface RecallAsPromptOptions {
+    maxTokens?: number;
+    header?: string;
+}
+/**
+ * Retrieve memory context formatted for direct inclusion in a system prompt.
+ *
+ * ```ts
+ * const context = await recallAsPrompt(mem, userQuery);
+ * const systemPrompt = `You are helpful.\n\n${context}`;
+ * ```
+ */
+declare function recallAsPrompt(mnemonic: Mnemonic, query: string, options?: RecallAsPromptOptions): Promise<string>;
+
+/**
+ * LangChain.js adapter — wraps Mnemonic as a LangChain BaseMemory.
+ * Requires @langchain/core as a peer dependency.
+ */
+
+interface LangChainMemoryOptions {
+    /** The Mnemonic client instance. */
+    mnemonic: Mnemonic;
+    /** Key used in the memory variables dict (default "memory"). */
+    memoryKey?: string;
+    /** Max tokens for recall (default 3000). */
+    maxTokens?: number;
+    /** Input key for multi-key chains (auto-detected if single key). */
+    inputKey?: string;
+    /** Output key for multi-key chains (auto-detected if single key). */
+    outputKey?: string;
+}
+/**
+ * Create a LangChain-compatible memory wrapper.
+ * Must be called with await since it dynamically imports @langchain/core.
+ *
+ * ```ts
+ * const memory = await createLangChainMemory({ mnemonic: client });
+ * const chain = new ConversationChain({ memory });
+ * ```
+ */
+declare function createLangChainMemory(options: LangChainMemoryOptions): Promise<any>;
+
+/**
+ * Shared utility functions.
+ */
+
+/** Cosine similarity between two vectors. Returns 0 if either is zero-norm. */
+declare function cosineSimilarity(a: number[], b: number[]): number;
+/**
+ * Cosine similarity between a single query and a list of embeddings.
+ * Returns an array of similarities, one per embedding.
+ */
+declare function cosineSimilarityVector(query: number[], embeddings: number[][]): Float64Array;
+/**
+ * Pairwise cosine similarity matrix for a list of embeddings.
+ * Returns a flat Float64Array of size n*n (row-major).
+ */
+declare function cosineSimilarityMatrix(embeddings: number[][]): Float64Array;
+/** Parse human-friendly durations like '30d', '24h', '90m', '2w', '120s'. Returns milliseconds. */
+declare function parseDuration(s: string): number;
+/** Rough token count estimate. */
+declare function estimateTokens(text: string, charsPerToken?: number): number;
+/** Rank memories by cosine similarity to embedding, return top limit. */
+declare function bruteForceCosineSearch(memories: Memory[], embedding: number[], limit: number): Memory[];
+
+export { AgentFilterOptions, AsyncBaseStore, BaseEmbedder, BaseStore, type LangChainMemoryOptions, LocalEmbedder, type LocalEmbedderOptions, Memory, MemoryEdge, Mnemonic, MnemonicConfig, OpenAIEmbedder, PostgresStore, type PostgresStoreOptions, type PromotionResult, type RecallAsPromptOptions, SQLiteStore, SalienceConfig, type SalienceResult, SimilarPair, TRANSIENT_ERRORS, applyTierChange, assemble, bruteForceCosineSearch, buildEmbedder, checkDemotions, checkPromotions, classify, cosineSimilarity, cosineSimilarityMatrix, cosineSimilarityVector, createLangChainMemory, detectSalience, estimateTokens, findConsolidationCandidates, findLinks, formatContext, mergeCluster, parseDuration, recallAsPrompt, score, syncToAsync };

package/dist/index.d.ts

@@ -0,0 +1,309 @@
+import { B as BaseStore, A as AsyncBaseStore, a as Memory, b as AgentFilterOptions, c as MemoryEdge, S as SimilarPair, d as BaseEmbedder, e as MnemonicConfig, f as SalienceConfig, M as Mnemonic } from './client-b2Xhkqdl.js';
+export { g as AddOptions, h as AssemblerConfig, i as BUILTIN_SALIENCE_SIGNALS, j as BUILTIN_TIERS, C as ClassifierConfig, k as ConsolidationConfig, F as ForgetOptions, L as LinkerConfig, l as MemoryInit, m as MemoryTier, P as PromotionConfig, R as RecallOptions, n as SalienceSignal, o as ScorerConfig, p as SortOrder, q as StatsResult, r as StoreFactory, T as TierDefinition, s as createEdge, t as registerStore } from './client-b2Xhkqdl.js';
+
+/**
+ * Adapter that wraps a synchronous BaseStore into an AsyncBaseStore.
+ * Uses async functions so thrown errors become rejected promises.
+ */
+
+/** Wrap a synchronous BaseStore so it can be used as AsyncBaseStore. */
+declare function syncToAsync(store: BaseStore): AsyncBaseStore;
+
+/**
+ * SQLite-backed memory store — the zero-config default.
+ */
+
+declare class SQLiteStore implements BaseStore {
+    private _db;
+    constructor(path?: string);
+    initialize(): void;
+    close(): void;
+    /** Add missing columns/tables for stores created before multi-agent support. */
+    private _migrate;
+    save(memory: Memory): void;
+    get(memoryId: string): Memory | null;
+    listAll(options?: AgentFilterOptions): Memory[];
+    delete(memoryId: string): void;
+    deleteOlderThan(ageMs: number, tier?: string, options?: AgentFilterOptions): number;
+    saveEdge(edge: MemoryEdge): void;
+    getEdges(memoryId: string): MemoryEdge[];
+    searchByEmbedding(embedding: number[], limit?: number, options?: AgentFilterOptions): Memory[];
+    findSimilarPairs(options?: {
+        threshold?: number;
+        agentId?: string;
+        tier?: string;
+        maxCandidates?: number;
+        maxNeighborsPerCandidate?: number;
+    }): SimilarPair[];
+    getMeta(key: string): string | null;
+    setMeta(key: string, value: string): void;
+}
+
+/**
+ * PostgreSQL + pgvector memory store — production-grade async backend.
+ */
+
+interface PostgresStoreOptions {
+    /** PostgreSQL connection string (e.g. postgresql://user:pass@host:5432/db). */
+    dsn: string;
+    /** Embedding vector dimension (default 1536). */
+    embeddingDim?: number;
+    /** Minimum pool connections (default 2). */
+    poolMin?: number;
+    /** Maximum pool connections (default 10). */
+    poolMax?: number;
+}
+declare class PostgresStore implements AsyncBaseStore {
+    private _dsn;
+    private _embeddingDim;
+    private _poolMin;
+    private _poolMax;
+    private _pool;
+    private _pgvectorRegistered;
+    constructor(options: PostgresStoreOptions);
+    private _getPool;
+    private _query;
+    /** Register pgvector on the pool's connect event so every connection gets it. */
+    private _setupPgvectorOnPool;
+    initialize(): Promise<void>;
+    private _migrateColumns;
+    close(): Promise<void>;
+    save(memory: Memory): Promise<void>;
+    get(memoryId: string): Promise<Memory | null>;
+    listAll(options?: AgentFilterOptions): Promise<Memory[]>;
+    delete(memoryId: string): Promise<void>;
+    deleteOlderThan(ageMs: number, tier?: string, options?: AgentFilterOptions): Promise<number>;
+    saveEdge(edge: MemoryEdge): Promise<void>;
+    getEdges(memoryId: string): Promise<MemoryEdge[]>;
+    searchByEmbedding(embedding: number[], limit?: number, options?: AgentFilterOptions): Promise<Memory[]>;
+    findSimilarPairs(options?: {
+        threshold?: number;
+        agentId?: string;
+        tier?: string;
+        maxCandidates?: number;
+        maxNeighborsPerCandidate?: number;
+    }): Promise<SimilarPair[]>;
+    getMeta(key: string): Promise<string | null>;
+    setMeta(key: string, value: string): Promise<void>;
+}
+
+/**
+ * OpenAI embedding provider.
+ *
+ * Requires the `openai` package as a peer dependency.
+ */
+
+declare class OpenAIEmbedder implements BaseEmbedder {
+    private _model;
+    private _apiKey;
+    private _client;
+    constructor(options?: {
+        model?: string;
+        apiKey?: string;
+    });
+    get dimension(): number;
+    private getClient;
+    embed(text: string): Promise<number[]>;
+    embedBatch(texts: string[]): Promise<number[][]>;
+}
+
+/**
+ * Local embedder using @huggingface/transformers (ONNX runtime).
+ * Default model: Xenova/all-MiniLM-L6-v2 (384 dimensions).
+ */
+
+interface LocalEmbedderOptions {
+    /** HuggingFace model name (default: "Xenova/all-MiniLM-L6-v2"). */
+    model?: string;
+}
+declare class LocalEmbedder implements BaseEmbedder {
+    private _modelName;
+    private _pipeline;
+    private _dimension;
+    constructor(options?: LocalEmbedderOptions);
+    get dimension(): number;
+    private _getPipeline;
+    embed(text: string): Promise<number[]>;
+    embedBatch(texts: string[]): Promise<number[][]>;
+}
+
+/**
+ * Embedder factory — resolves MNEMONIC_EMBEDDER env var to a concrete embedder.
+ */
+
+/**
+ * Build an embedder based on provider name (or MNEMONIC_EMBEDDER env var).
+ *
+ * - "none" → null (keyword-only mode)
+ * - "openai" → OpenAIEmbedder
+ * - "local" → LocalEmbedder (@huggingface/transformers)
+ *
+ * Returns null if provider is "none" or empty.
+ * Throws if provider is unrecognised.
+ */
+declare function buildEmbedder(provider?: string): Promise<BaseEmbedder | null>;
+
+/**
+ * Tier classifier with configurable patterns and pluggable custom logic.
+ */
+
+/** Return the most appropriate tier name for the given content. */
+declare function classify(content: string, options?: {
+    source?: string;
+    actor?: string;
+    config?: MnemonicConfig;
+}): string;
+
+/**
+ * Dynamic importance scoring engine.
+ */
+
+/** Compute the current importance score for a memory. */
+declare function score(memory: Memory, config?: MnemonicConfig): number;
+
+/**
+ * Relationship detection between memories.
+ */
+
+/** Identify edges from newMemory to the most related existing memories. */
+declare function findLinks(newMemory: Memory, existing: Memory[], options?: {
+    config?: MnemonicConfig;
+    similarityThreshold?: number;
+    maxLinks?: number;
+}): MemoryEdge[];
+
+/**
+ * Context window assembly — greedy budget-filling with diversity penalty.
+ *
+ * Uses pre-computed similarity matrices for O(1) diversity lookups.
+ */
+
+/** Select and order memories to fill a token budget. */
+declare function assemble(_query: string, candidates: Memory[], options?: {
+    queryEmbedding?: number[] | null;
+    maxTokens?: number;
+    diversityStrength?: number;
+    minRelevance?: number;
+    config?: MnemonicConfig;
+}): Memory[];
+/** Render assembled memories as a plain-text block. */
+declare function formatContext(memories: Memory[], header?: string, conflicts?: Array<[number, number, string]>): string;
+
+/**
+ * Tier promotion and demotion — the memory maturation pipeline.
+ *
+ * transient → episodic → structural → identity
+ *                              ↑
+ *                        procedural ──┘
+ */
+
+interface PromotionResult {
+    memoryId: string;
+    oldTier: string;
+    newTier: string;
+    reason: string;
+}
+/** Identify memories that qualify for tier promotion. */
+declare function checkPromotions(memories: Memory[], config?: MnemonicConfig): PromotionResult[];
+/** Identify memories that qualify for tier demotion. */
+declare function checkDemotions(memories: Memory[], config?: MnemonicConfig): PromotionResult[];
+/** Change a memory's tier in-place, recording history. */
+declare function applyTierChange(memory: Memory, newTier: string): void;
+
+/**
+ * Automatic salience detection — the amygdala of the memory system.
+ */
+
+interface SalienceResult {
+    boost: number;
+    signals: string[];
+}
+/** Scan content for salience signals. */
+declare function detectSalience(content: string, config?: SalienceConfig): SalienceResult;
+
+/**
+ * Memory consolidation — merging episodic memories into semantic summaries.
+ */
+
+/** Error names that indicate transient LLM failures — should propagate, not fall back. */
+declare const TRANSIENT_ERRORS: Set<string>;
+/**
+ * Group episodic memories that overlap enough to consolidate.
+ *
+ * When `pairs` is provided, union-find runs directly on the sparse pairs
+ * (no N×N matrix). When omitted, falls back to brute-force matrix.
+ */
+declare function findConsolidationCandidates(memories: Memory[], config?: MnemonicConfig, pairs?: SimilarPair[]): Memory[][];
+/** Create a single structural memory summarising a cluster. */
+declare function mergeCluster(cluster: Memory[], config?: MnemonicConfig): Promise<Memory>;
+
+/**
+ * Raw API adapter — simple helper for injecting memory context into prompts.
+ */
+
+interface RecallAsPromptOptions {
+    maxTokens?: number;
+    header?: string;
+}
+/**
+ * Retrieve memory context formatted for direct inclusion in a system prompt.
+ *
+ * ```ts
+ * const context = await recallAsPrompt(mem, userQuery);
+ * const systemPrompt = `You are helpful.\n\n${context}`;
+ * ```
+ */
+declare function recallAsPrompt(mnemonic: Mnemonic, query: string, options?: RecallAsPromptOptions): Promise<string>;
+
+/**
+ * LangChain.js adapter — wraps Mnemonic as a LangChain BaseMemory.
+ * Requires @langchain/core as a peer dependency.
+ */
+
+interface LangChainMemoryOptions {
+    /** The Mnemonic client instance. */
+    mnemonic: Mnemonic;
+    /** Key used in the memory variables dict (default "memory"). */
+    memoryKey?: string;
+    /** Max tokens for recall (default 3000). */
+    maxTokens?: number;
+    /** Input key for multi-key chains (auto-detected if single key). */
+    inputKey?: string;
+    /** Output key for multi-key chains (auto-detected if single key). */
+    outputKey?: string;
+}
+/**
+ * Create a LangChain-compatible memory wrapper.
+ * Must be called with await since it dynamically imports @langchain/core.
+ *
+ * ```ts
+ * const memory = await createLangChainMemory({ mnemonic: client });
+ * const chain = new ConversationChain({ memory });
+ * ```
+ */
+declare function createLangChainMemory(options: LangChainMemoryOptions): Promise<any>;
+
+/**
+ * Shared utility functions.
+ */
+
+/** Cosine similarity between two vectors. Returns 0 if either is zero-norm. */
+declare function cosineSimilarity(a: number[], b: number[]): number;
+/**
+ * Cosine similarity between a single query and a list of embeddings.
+ * Returns an array of similarities, one per embedding.
+ */
+declare function cosineSimilarityVector(query: number[], embeddings: number[][]): Float64Array;
+/**
+ * Pairwise cosine similarity matrix for a list of embeddings.
+ * Returns a flat Float64Array of size n*n (row-major).
+ */
+declare function cosineSimilarityMatrix(embeddings: number[][]): Float64Array;
+/** Parse human-friendly durations like '30d', '24h', '90m', '2w', '120s'. Returns milliseconds. */
+declare function parseDuration(s: string): number;
+/** Rough token count estimate. */
+declare function estimateTokens(text: string, charsPerToken?: number): number;
+/** Rank memories by cosine similarity to embedding, return top limit. */
+declare function bruteForceCosineSearch(memories: Memory[], embedding: number[], limit: number): Memory[];
+
+export { AgentFilterOptions, AsyncBaseStore, BaseEmbedder, BaseStore, type LangChainMemoryOptions, LocalEmbedder, type LocalEmbedderOptions, Memory, MemoryEdge, Mnemonic, MnemonicConfig, OpenAIEmbedder, PostgresStore, type PostgresStoreOptions, type PromotionResult, type RecallAsPromptOptions, SQLiteStore, SalienceConfig, type SalienceResult, SimilarPair, TRANSIENT_ERRORS, applyTierChange, assemble, bruteForceCosineSearch, buildEmbedder, checkDemotions, checkPromotions, classify, cosineSimilarity, cosineSimilarityMatrix, cosineSimilarityVector, createLangChainMemory, detectSalience, estimateTokens, findConsolidationCandidates, findLinks, formatContext, mergeCluster, parseDuration, recallAsPrompt, score, syncToAsync };