@agents-eco/agentic-memory 0.1.0

package/dist/stm.js

@@ -0,0 +1,124 @@
+import { randomUUID } from "node:crypto";
+const DEFAULT_STM_CONFIG = {
+    capacity: 20,
+    ttlMs: 30 * 60 * 1000, // 30 minutes
+};
+/**
+ * Short-Term Memory (STM) — the agent's working context.
+ *
+ * Holds recent, high-relevance items in a bounded buffer.
+ * Items decay and get evicted based on TTL and capacity.
+ * Important items are promoted to LTM during consolidation.
+ */
+export class ShortTermMemory {
+    entries = [];
+    config;
+    constructor(config) {
+        this.config = { ...DEFAULT_STM_CONFIG, ...config };
+    }
+    /** Add an entry to STM */
+    add(content, type = "episodic", importance = 0.5, metadata = {}) {
+        const entry = {
+            id: randomUUID(),
+            content,
+            type,
+            importance: Math.max(0, Math.min(1, importance)),
+            createdAt: new Date().toISOString(),
+            metadata,
+        };
+        this.entries.push(entry);
+        // Evict oldest low-importance items if over capacity
+        if (this.entries.length > this.config.capacity) {
+            this.evict();
+        }
+        return entry;
+    }
+    /** Get all current STM entries */
+    getAll() {
+        this.pruneExpired();
+        return [...this.entries];
+    }
+    /** Get entries above an importance threshold */
+    getImportant(minImportance = 0.6) {
+        this.pruneExpired();
+        return this.entries.filter((e) => e.importance >= minImportance);
+    }
+    /** Get the most recent N entries */
+    getRecent(n = 5) {
+        this.pruneExpired();
+        return this.entries.slice(-n);
+    }
+    /** Search STM by keyword */
+    search(query, limit = 5) {
+        this.pruneExpired();
+        const words = query.toLowerCase().split(/\s+/).filter((w) => w.length > 2);
+        if (words.length === 0)
+            return this.entries.slice(-limit);
+        return this.entries
+            .map((entry) => {
+            const text = entry.content.toLowerCase();
+            let score = 0;
+            for (const word of words) {
+                if (text.includes(word))
+                    score++;
+            }
+            return { entry, score };
+        })
+            .filter((r) => r.score > 0)
+            .sort((a, b) => b.score - a.score)
+            .slice(0, limit)
+            .map((r) => r.entry);
+    }
+    /** Get entries ready for consolidation to LTM (important + accessed enough) */
+    getConsolidationCandidates(minImportance = 0.4) {
+        return this.entries.filter((e) => e.importance >= minImportance);
+    }
+    /** Remove specific entries (after consolidation to LTM) */
+    remove(ids) {
+        this.entries = this.entries.filter((e) => !ids.has(e.id));
+    }
+    /** Clear all STM entries */
+    clear() {
+        this.entries = [];
+    }
+    /** Get current size */
+    size() {
+        this.pruneExpired();
+        return this.entries.length;
+    }
+    /** Build a context string from STM for injection into prompts */
+    buildContext() {
+        this.pruneExpired();
+        if (this.entries.length === 0)
+            return "";
+        const lines = this.entries.map((e) => `- [${e.type}] ${e.content}`);
+        return `Recent context:\n${lines.join("\n")}`;
+    }
+    /** Serialize STM for persistence */
+    serialize() {
+        return [...this.entries];
+    }
+    /** Load STM from serialized data */
+    load(entries) {
+        this.entries = [...entries];
+        this.pruneExpired();
+    }
+    // ── Private ─────────────────────────────────────────
+    pruneExpired() {
+        const cutoff = Date.now() - this.config.ttlMs;
+        this.entries = this.entries.filter((e) => new Date(e.createdAt).getTime() > cutoff);
+    }
+    evict() {
+        // Sort by importance (ascending) then by age (oldest first)
+        const sorted = [...this.entries].sort((a, b) => {
+            if (a.importance !== b.importance)
+                return a.importance - b.importance;
+            return new Date(a.createdAt).getTime() - new Date(b.createdAt).getTime();
+        });
+        // Remove lowest importance items until at capacity
+        const toRemove = sorted.slice(0, this.entries.length - this.config.capacity);
+        const removeIds = new Set(toRemove.map((e) => e.id));
+        this.entries = this.entries.filter((e) => !removeIds.has(e.id));
+    }
+}
+//# sourceMappingURL=stm.js.map

package/dist/stm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stm.js","sourceRoot":"","sources":["../src/stm.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAGzC,MAAM,kBAAkB,GAAc;IACpC,QAAQ,EAAE,EAAE;IACZ,KAAK,EAAE,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,aAAa;CACrC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,OAAO,eAAe;IAClB,OAAO,GAAe,EAAE,CAAC;IACzB,MAAM,CAAY;IAE1B,YAAY,MAA2B;QACrC,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,kBAAkB,EAAE,GAAG,MAAM,EAAE,CAAC;IACrD,CAAC;IAED,0BAA0B;IAC1B,GAAG,CACD,OAAe,EACf,OAAuB,UAAU,EACjC,aAAqB,GAAG,EACxB,WAAoC,EAAE;QAEtC,MAAM,KAAK,GAAa;YACtB,EAAE,EAAE,UAAU,EAAE;YAChB,OAAO;YACP,IAAI;YACJ,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;YAChD,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,QAAQ;SACT,CAAC;QAEF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEzB,qDAAqD;QACrD,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC/C,IAAI,CAAC,KAAK,EAAE,CAAC;QACf,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,kCAAkC;IAClC,MAAM;QACJ,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED,gDAAgD;IAChD,YAAY,CAAC,gBAAwB,GAAG;QACtC,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,aAAa,CAAC,CAAC;IACnE,CAAC;IAED,oCAAoC;IACpC,SAAS,CAAC,IAAY,CAAC;QACrB,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,4BAA4B;IAC5B,MAAM,CAAC,KAAa,EAAE,QAAgB,CAAC;QACrC,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC3E,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;QAE1D,OAAO,IAAI,CAAC,OAAO;aAChB,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;YACb,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;YACzC,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;oBAAE,KAAK,EAAE,CAAC;YACnC,CAAC;YACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;QAC1B,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;aAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;aACf,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,+EAA+E;IAC/E,0BAA0B,CAAC,gBAAwB,GAAG;QACpD,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,aAAa,CAAC,CAAC;IACnE,CAAC;IAED,2DAA2D;IAC3D,MAAM,CAAC,GAAgB;QACrB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,4BAA4B;IAC5B,KAAK;QACH,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;IACpB,CAAC;IAED,uBAAuB;IACvB,IAAI;QACF,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,iEAAiE;IACjE,YAAY;QACV,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEzC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;QACpE,OAAO,oBAAoB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;IAChD,CAAC;IAED,oCAAoC;IACpC,SAAS;QACP,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED,oCAAoC;IACpC,IAAI,CAAC,OAAmB;QACtB,IAAI,CAAC,OAAO,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;QAC5B,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED,uDAAuD;IAE/C,YAAY;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QAC9C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,GAAG,MAAM,CAChD,CAAC;IACJ,CAAC;IAEO,KAAK;QACX,4DAA4D;QAC5D,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC7C,IAAI,CAAC,CAAC,UAAU,KAAK,CAAC,CAAC,UAAU;gBAAE,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;YACtE,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3E,CAAC,CAAC,CAAC;QAEH,mDAAmD;QACnD,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC7E,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClE,CAAC;CACF"}

package/dist/storage/local.d.ts

@@ -0,0 +1,16 @@
+import type { StorageBackend, SerializedGraph } from "../types.js";
+/**
+ * Local file-based storage backend.
+ * Stores the memory graph as a JSON file on disk.
+ * Human-readable and version-controllable.
+ */
+export declare class LocalStorage implements StorageBackend {
+    readonly name = "local";
+    private dir;
+    private filePath;
+    constructor(dir?: string, namespace?: string);
+    save(graph: SerializedGraph): Promise<void>;
+    load(): Promise<SerializedGraph | null>;
+    exists(): Promise<boolean>;
+}
+//# sourceMappingURL=local.d.ts.map

package/dist/storage/local.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"local.d.ts","sourceRoot":"","sources":["../../src/storage/local.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAEnE;;;;GAIG;AACH,qBAAa,YAAa,YAAW,cAAc;IACjD,QAAQ,CAAC,IAAI,WAAW;IACxB,OAAO,CAAC,GAAG,CAAS;IACpB,OAAO,CAAC,QAAQ,CAAS;gBAEb,GAAG,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM;IAMtC,IAAI,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC;IAQ3C,IAAI,IAAI,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC;IAWvC,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC;CAGjC"}

package/dist/storage/local.js

@@ -0,0 +1,39 @@
+import { readFileSync, writeFileSync, existsSync, mkdirSync } from "node:fs";
+import { join, resolve } from "node:path";
+/**
+ * Local file-based storage backend.
+ * Stores the memory graph as a JSON file on disk.
+ * Human-readable and version-controllable.
+ */
+export class LocalStorage {
+    name = "local";
+    dir;
+    filePath;
+    constructor(dir, namespace) {
+        this.dir = resolve(dir ?? "./.agent/memory");
+        const filename = namespace ? `graph-${namespace}.json` : "graph.json";
+        this.filePath = join(this.dir, filename);
+    }
+    async save(graph) {
+        if (!existsSync(this.dir)) {
+            mkdirSync(this.dir, { recursive: true });
+        }
+        const json = JSON.stringify(graph, null, 2);
+        writeFileSync(this.filePath, json, "utf-8");
+    }
+    async load() {
+        if (!existsSync(this.filePath))
+            return null;
+        try {
+            const raw = readFileSync(this.filePath, "utf-8");
+            return JSON.parse(raw);
+        }
+        catch {
+            return null;
+        }
+    }
+    async exists() {
+        return existsSync(this.filePath);
+    }
+}
+//# sourceMappingURL=local.js.map

package/dist/storage/local.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local.js","sourceRoot":"","sources":["../../src/storage/local.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAG1C;;;;GAIG;AACH,MAAM,OAAO,YAAY;IACd,IAAI,GAAG,OAAO,CAAC;IAChB,GAAG,CAAS;IACZ,QAAQ,CAAS;IAEzB,YAAY,GAAY,EAAE,SAAkB;QAC1C,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,iBAAiB,CAAC,CAAC;QAC7C,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,SAAS,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC;QACtE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,KAAsB;QAC/B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC3C,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5C,aAAa,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED,KAAK,CAAC,IAAI;QACR,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAC;QAE5C,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YACjD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAoB,CAAC;QAC5C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,KAAK,CAAC,MAAM;QACV,OAAO,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACnC,CAAC;CACF"}

package/dist/types.d.ts

@@ -0,0 +1,140 @@
+export interface MemoryNode {
+    id: string;
+    /** Content of the memory */
+    content: string;
+    /** Node type */
+    type: MemoryNodeType;
+    /** Embedding vector (populated by Voyage or local) */
+    embedding?: number[];
+    /** Importance score (0-1), affects decay and retrieval priority */
+    importance: number;
+    /** Access count — reinforced on each retrieval */
+    accessCount: number;
+    /** Last accessed timestamp */
+    lastAccessed: string;
+    /** Created timestamp */
+    createdAt: string;
+    /** Arbitrary metadata */
+    metadata: Record<string, unknown>;
+}
+export type MemoryNodeType = "episodic" | "semantic" | "procedural" | "emotional" | "entity" | "goal" | "observation";
+export interface MemoryEdge {
+    id: string;
+    /** Source node ID */
+    source: string;
+    /** Target node ID */
+    target: string;
+    /** Relationship type */
+    relation: MemoryRelation;
+    /** Edge weight (0-1), affects traversal priority */
+    weight: number;
+    /** Created timestamp */
+    createdAt: string;
+    /** Arbitrary metadata */
+    metadata: Record<string, unknown>;
+}
+export type MemoryRelation = "related_to" | "caused_by" | "leads_to" | "part_of" | "contradicts" | "reinforces" | "derived_from" | "similar_to" | "mentioned_in" | "precedes" | "follows";
+export interface MemoryGraph {
+    nodes: Map<string, MemoryNode>;
+    edges: Map<string, MemoryEdge>;
+}
+export interface STMConfig {
+    /** Max number of items in STM (default: 20) */
+    capacity: number;
+    /** TTL in milliseconds before items decay from STM (default: 30 min) */
+    ttlMs: number;
+}
+export interface STMEntry {
+    id: string;
+    content: string;
+    type: MemoryNodeType;
+    importance: number;
+    createdAt: string;
+    metadata: Record<string, unknown>;
+}
+export interface LTMConfig {
+    /** Decay rate per hour for unreinforced memories (default: 0.01) */
+    decayRate: number;
+    /** Minimum importance to keep in LTM (default: 0.1) */
+    minImportance: number;
+    /** Max nodes in the graph (default: 10000) */
+    maxNodes: number;
+}
+export interface EmbeddingBackend {
+    /** Backend name */
+    name: string;
+    /** Generate embedding for a single text */
+    embed(text: string): Promise<number[]>;
+    /** Generate embeddings for multiple texts (batch) */
+    embedBatch(texts: string[]): Promise<number[][]>;
+    /** Embedding dimension */
+    dimension: number;
+}
+export interface StorageBackend {
+    /** Backend name */
+    name: string;
+    /** Save the full graph state */
+    save(graph: SerializedGraph): Promise<void>;
+    /** Load the full graph state */
+    load(): Promise<SerializedGraph | null>;
+    /** Check if storage has existing data */
+    exists(): Promise<boolean>;
+}
+export interface SerializedGraph {
+    nodes: SerializedNode[];
+    edges: SerializedEdge[];
+    stm: STMEntry[];
+    metadata: {
+        version: string;
+        savedAt: string;
+        nodeCount: number;
+        edgeCount: number;
+    };
+}
+export interface SerializedNode extends MemoryNode {
+}
+export interface SerializedEdge extends MemoryEdge {
+}
+export interface SearchResult {
+    node: MemoryNode;
+    score: number;
+    /** How the result was found */
+    method: "vector" | "keyword" | "graph" | "recency" | "hybrid";
+    /** Related nodes found via graph traversal */
+    related?: MemoryNode[];
+}
+export interface SearchOptions {
+    /** Max results to return (default: 5) */
+    limit?: number;
+    /** Filter by node type */
+    types?: MemoryNodeType[];
+    /** Minimum score threshold (0-1) */
+    minScore?: number;
+    /** Include graph neighbors in results */
+    includeRelated?: boolean;
+    /** Max graph traversal depth for related nodes */
+    traversalDepth?: number;
+    /** Search method preference */
+    method?: "vector" | "keyword" | "hybrid";
+}
+export interface AgenticMemoryConfig {
+    /** Embedding backend: "local" or "voyage" */
+    backend: "local" | "voyage";
+    /** Voyage API key (required if backend is "voyage") */
+    voyageApiKey?: string;
+    /** Voyage model (default: "voyage-3-lite") */
+    voyageModel?: string;
+    /** Storage directory for local persistence */
+    storageDir?: string;
+    /** Custom storage backend */
+    storage?: StorageBackend;
+    /** Custom embedding backend */
+    embedding?: EmbeddingBackend;
+    /** STM configuration */
+    stm?: Partial<STMConfig>;
+    /** LTM configuration */
+    ltm?: Partial<LTMConfig>;
+    /** Namespace for isolating memory graphs */
+    namespace?: string;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAEA,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,4BAA4B;IAC5B,OAAO,EAAE,MAAM,CAAC;IAChB,gBAAgB;IAChB,IAAI,EAAE,cAAc,CAAC;IACrB,sDAAsD;IACtD,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IACrB,mEAAmE;IACnE,UAAU,EAAE,MAAM,CAAC;IACnB,kDAAkD;IAClD,WAAW,EAAE,MAAM,CAAC;IACpB,8BAA8B;IAC9B,YAAY,EAAE,MAAM,CAAC;IACrB,wBAAwB;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,yBAAyB;IACzB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC;AAED,MAAM,MAAM,cAAc,GACtB,UAAU,GACV,UAAU,GACV,YAAY,GACZ,WAAW,GACX,QAAQ,GACR,MAAM,GACN,aAAa,CAAC;AAElB,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,qBAAqB;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,wBAAwB;IACxB,QAAQ,EAAE,cAAc,CAAC;IACzB,oDAAoD;IACpD,MAAM,EAAE,MAAM,CAAC;IACf,wBAAwB;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,yBAAyB;IACzB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC;AAED,MAAM,MAAM,cAAc,GACtB,YAAY,GACZ,WAAW,GACX,UAAU,GACV,SAAS,GACT,aAAa,GACb,YAAY,GACZ,cAAc,GACd,YAAY,GACZ,cAAc,GACd,UAAU,GACV,SAAS,CAAC;AAId,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAC/B,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;CAChC;AAID,MAAM,WAAW,SAAS;IACxB,+CAA+C;IAC/C,QAAQ,EAAE,MAAM,CAAC;IACjB,wEAAwE;IACxE,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,cAAc,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACnC;AAID,MAAM,WAAW,SAAS;IACxB,oEAAoE;IACpE,SAAS,EAAE,MAAM,CAAC;IAClB,uDAAuD;IACvD,aAAa,EAAE,MAAM,CAAC;IACtB,8CAA8C;IAC9C,QAAQ,EAAE,MAAM,CAAC;CAClB;AAID,MAAM,WAAW,gBAAgB;IAC/B,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,2CAA2C;IAC3C,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;IACvC,qDAAqD;IACrD,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IACjD,0BAA0B;IAC1B,SAAS,EAAE,MAAM,CAAC;CACnB;AAID,MAAM,WAAW,cAAc;IAC7B,mBAAmB;IACnB,IAAI,EAAE,MAAM,CAAC;IACb,gCAAgC;IAChC,IAAI,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC5C,gCAAgC;IAChC,IAAI,IAAI,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC,CAAC;IACxC,yCAAyC;IACzC,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;CAC5B;AAED,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,cAAc,EAAE,CAAC;IACxB,KAAK,EAAE,cAAc,EAAE,CAAC;IACxB,GAAG,EAAE,QAAQ,EAAE,CAAC;IAChB,QAAQ,EAAE;QACR,OAAO,EAAE,MAAM,CAAC;QAChB,OAAO,EAAE,MAAM,CAAC;QAChB,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;KACnB,CAAC;CACH;AAED,MAAM,WAAW,cAAe,SAAQ,UAAU;CAAG;AACrD,MAAM,WAAW,cAAe,SAAQ,UAAU;CAAG;AAIrD,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,UAAU,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,+BAA+B;IAC/B,MAAM,EAAE,QAAQ,GAAG,SAAS,GAAG,OAAO,GAAG,SAAS,GAAG,QAAQ,CAAC;IAC9D,8CAA8C;IAC9C,OAAO,CAAC,EAAE,UAAU,EAAE,CAAC;CACxB;AAED,MAAM,WAAW,aAAa;IAC5B,yCAAyC;IACzC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,0BAA0B;IAC1B,KAAK,CAAC,EAAE,cAAc,EAAE,CAAC;IACzB,oCAAoC;IACpC,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,yCAAyC;IACzC,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,kDAAkD;IAClD,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,+BAA+B;IAC/B,MAAM,CAAC,EAAE,QAAQ,GAAG,SAAS,GAAG,QAAQ,CAAC;CAC1C;AAID,MAAM,WAAW,mBAAmB;IAClC,6CAA6C;IAC7C,OAAO,EAAE,OAAO,GAAG,QAAQ,CAAC;IAC5B,uDAAuD;IACvD,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,8CAA8C;IAC9C,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,8CAA8C;IAC9C,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,6BAA6B;IAC7B,OAAO,CAAC,EAAE,cAAc,CAAC;IACzB,+BAA+B;IAC/B,SAAS,CAAC,EAAE,gBAAgB,CAAC;IAC7B,wBAAwB;IACxB,GAAG,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;IACzB,wBAAwB;IACxB,GAAG,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;IACzB,4CAA4C;IAC5C,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB"}

package/dist/types.js

@@ -0,0 +1,3 @@
+// ── Graph Primitives ────────────────────────────────────
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA,2DAA2D"}

package/package.json

@@ -0,0 +1,54 @@
+{
+  "name": "@agents-eco/agentic-memory",
+  "version": "0.1.0",
+  "description": "Graph-based agent memory — short-term and long-term memory with local or Voyage AI backends. Built for agents.eco.",
+  "type": "module",
+  "main": "./dist/index.js",
+  "module": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "types": "./dist/index.d.ts"
+    }
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE"
+  ],
+  "scripts": {
+    "build": "tsc",
+    "clean": "rm -rf dist",
+    "dev": "tsc --watch"
+  },
+  "keywords": [
+    "agents",
+    "ai",
+    "memory",
+    "graph",
+    "stm",
+    "ltm",
+    "short-term-memory",
+    "long-term-memory",
+    "voyage",
+    "embeddings",
+    "agents-eco",
+    "agentic"
+  ],
+  "license": "MIT",
+  "author": "agents.eco",
+  "homepage": "https://agents.eco",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/agents-eco/agentic-memory"
+  },
+  "publishConfig": {
+    "access": "public"
+  },
+  "dependencies": {},
+  "devDependencies": {
+    "@types/node": "^20.11.0",
+    "typescript": "^5.3.3"
+  }
+}