@agents-eco/agentic-memory 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 agents.eco
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,430 @@
+<p align="center">
+  <img src="icon.png" alt="Agentic Memory" width="160" />
+</p>
+
+<h1 align="center">Agentic Memory</h1>
+
+<p align="center">
+  <strong>Graph-based agent memory — short-term and long-term memory with local or Voyage AI backends.</strong><br/>
+  Built by <a href="https://agents.eco">agents.eco</a> — the decentralized AI agent economy.
+</p>
+
+<p align="center">
+  <a href="https://www.npmjs.com/package/@agents-eco/agentic-memory"><img src="https://img.shields.io/npm/v/@agents-eco/agentic-memory?style=flat-square" alt="npm" /></a>
+  <a href="https://github.com/agents-eco/agentic-memory/blob/main/LICENSE"><img src="https://img.shields.io/badge/license-MIT-blue?style=flat-square" alt="MIT License" /></a>
+  <a href="https://github.com/agents-eco/agentic-memory"><img src="https://img.shields.io/github/stars/agents-eco/agentic-memory?style=flat-square" alt="GitHub stars" /></a>
+</p>
+
+```
+npm install @agents-eco/agentic-memory
+```
+
+---
+
+## Why This Exists
+
+Most agent memory is either a flat conversation buffer or an opaque vector database. Neither captures how memory actually works.
+
+Agentic Memory is a **graph-based memory system** that separates short-term and long-term memory, with typed nodes, weighted relationships, decay, reinforcement, and hybrid search.
+
+- **Short-Term Memory (STM)** — Bounded working context. Recent items with automatic expiry. Fast keyword search.
+- **Long-Term Memory (LTM)** — Persistent graph with typed nodes (episodic, semantic, entity, goal, etc.) and weighted edges (causal, temporal, hierarchical). Supports decay and reinforcement.
+- **Two backends** — Local (zero dependencies, offline) or Voyage AI (high-quality neural embeddings).
+- **Graph traversal** — Find related memories by walking the graph, not just by vector similarity.
+- **Human-readable persistence** — Stored as JSON files you can inspect and version control.
+
+## Quick Start
+
+### Local Backend (no API key needed)
+
+```typescript
+import { AgenticMemory } from "@agents-eco/agentic-memory";
+
+const memory = new AgenticMemory({ backend: "local" });
+
+// Add memories
+await memory.add("User's name is Alice", "semantic", 0.8);
+await memory.add("Alice prefers dark mode", "semantic", 0.6);
+await memory.addEpisode("User asked about the weather in NYC");
+await memory.addGoal("Help Alice plan her trip to Tokyo");
+
+// Search
+const results = await memory.search("What is the user's name?");
+console.log(results[0].node.content); // "User's name is Alice"
+
+// Build context for LLM prompt injection
+const context = await memory.buildContext("Tell me about Alice");
+console.log(context);
+```
+
+### Voyage AI Backend (high-quality embeddings)
+
+```typescript
+import { AgenticMemory } from "@agents-eco/agentic-memory";
+
+const memory = new AgenticMemory({
+  backend: "voyage",
+  voyageApiKey: process.env.VOYAGE_API_KEY!,
+  voyageModel: "voyage-3-lite", // 512 dims, fast and cheap
+});
+
+await memory.add("The project deadline is March 15th", "semantic", 0.9);
+const results = await memory.search("When is the deadline?");
+```
+
+## Architecture
+
+```
+┌─────────────────────────────────────────────────────────┐
+│                    AgenticMemory                         │
+│                                                          │
+│  ┌─────────────────────┐  ┌──────────────────────────┐  │
+│  │   Short-Term Memory │  │    Long-Term Memory       │  │
+│  │                     │  │                           │  │
+│  │  Bounded buffer     │  │  ┌─────────────────────┐  │  │
+│  │  TTL-based expiry   │  │  │   Memory Graph      │  │  │
+│  │  Keyword search     │  │  │                     │  │  │
+│  │  Importance ranking │  │  │  Nodes (typed):     │  │  │
+│  │                     │  │  │  - episodic         │  │  │
+│  │  ┌───────────────┐  │  │  │  - semantic         │  │  │
+│  │  │ Consolidation │──┼──┼─▶│  - entity           │  │  │
+│  │  │ (STM → LTM)   │  │  │  │  - goal             │  │  │
+│  │  └───────────────┘  │  │  │  - observation       │  │  │
+│  │                     │  │  │  - procedural        │  │  │
+│  └─────────────────────┘  │  │  - emotional         │  │  │
+│                           │  │                     │  │  │
+│                           │  │  Edges (weighted):  │  │  │
+│                           │  │  - related_to       │  │  │
+│                           │  │  - caused_by        │  │  │
+│                           │  │  - leads_to         │  │  │
+│                           │  │  - part_of          │  │  │
+│                           │  │  - similar_to       │  │  │
+│                           │  │  - mentioned_in     │  │  │
+│                           │  └─────────────────────┘  │  │
+│                           │                           │  │
+│                           │  Decay + Reinforcement    │  │
+│                           │  Hybrid Search            │  │
+│                           │  Graph Traversal          │  │
+│                           └──────────────────────────┘  │
+│                                                          │
+│  ┌──────────────────┐  ┌──────────────────────────────┐  │
+│  │ Embedding Backend │  │     Storage Backend          │  │
+│  │                  │  │                              │  │
+│  │  Local (hash)    │  │  Local (JSON files)          │  │
+│  │  Voyage AI       │  │  Custom (implement iface)    │  │
+│  └──────────────────┘  └──────────────────────────────┘  │
+└─────────────────────────────────────────────────────────┘
+```
+
+## Memory Types
+
+### Node Types
+
+| Type | Description | Example |
+|------|-------------|---------|
+| `episodic` | Specific events and conversations | "User asked about weather in NYC" |
+| `semantic` | Facts, knowledge, extracted info | "User's name is Alice" |
+| `entity` | People, places, things | "Alice", "Tokyo", "Project X" |
+| `goal` | Objectives, tasks, intentions | "Help user plan trip to Tokyo" |
+| `observation` | Agent observations about the world | "User seems frustrated today" |
+| `procedural` | How-to, skills, patterns | "To check weather, use the weather API" |
+| `emotional` | Sentiment, preferences, reactions | "User prefers concise responses" |
+
+### Edge Types (Relations)
+
+| Relation | Description |
+|----------|-------------|
+| `related_to` | General association |
+| `caused_by` | Causal relationship |
+| `leads_to` | Sequential / temporal |
+| `part_of` | Hierarchical |
+| `contradicts` | Conflicting information |
+| `reinforces` | Supporting information |
+| `derived_from` | Extracted / inferred from |
+| `similar_to` | Semantic similarity |
+| `mentioned_in` | Entity mentioned in episode |
+| `precedes` / `follows` | Temporal ordering |
+
+## STM (Short-Term Memory)
+
+The working context buffer. Bounded, fast, and ephemeral.
+
+```typescript
+import { ShortTermMemory } from "@agents-eco/agentic-memory";
+
+const stm = new ShortTermMemory({
+  capacity: 20,          // max items
+  ttlMs: 30 * 60 * 1000, // 30 min expiry
+});
+
+stm.add("User just asked about pricing", "episodic", 0.7);
+stm.add("Current topic is billing", "observation", 0.5);
+
+// Get recent context
+const recent = stm.getRecent(5);
+
+// Search
+const results = stm.search("pricing");
+
+// Build context string for prompt injection
+const context = stm.buildContext();
+```
+
+## LTM (Long-Term Memory)
+
+Persistent graph with decay, reinforcement, and hybrid search.
+
+```typescript
+import { LongTermMemory } from "@agents-eco/agentic-memory";
+import { LocalEmbedding } from "@agents-eco/agentic-memory";
+
+const ltm = new LongTermMemory(
+  { decayRate: 0.01, minImportance: 0.1, maxNodes: 10000 },
+  new LocalEmbedding()
+);
+
+// Add memories
+const fact = await ltm.add("Alice lives in New York", "semantic", 0.7);
+const entity = await ltm.add("Alice", "entity", 0.6);
+ltm.link(fact.id, entity.id, "mentioned_in");
+
+// Add facts with auto entity linking
+const { node, entityNodes } = await ltm.addFact(
+  "Alice is a software engineer at Acme Corp",
+  ["Alice", "Acme Corp"]
+);
+
+// Search with graph traversal
+const results = await ltm.search("Where does Alice work?", {
+  limit: 5,
+  includeRelated: true,
+  traversalDepth: 2,
+});
+
+// Decay old memories
+ltm.decay();
+```
+
+## Consolidation (STM to LTM)
+
+Important short-term memories are promoted to long-term storage.
+
+```typescript
+const memory = new AgenticMemory({ backend: "local" });
+
+// Add several memories to STM
+await memory.add("User mentioned they like sushi", "semantic", 0.7);
+await memory.add("User asked about Tokyo restaurants", "episodic", 0.5);
+await memory.add("Random small talk", "episodic", 0.2);
+
+// Consolidate important items to LTM
+const count = await memory.consolidate(0.4); // min importance threshold
+console.log(`Consolidated ${count} memories to LTM`);
+// "Random small talk" stays in STM (too low importance)
+// The other two are now in the LTM graph with temporal links
+```
+
+## Hybrid Search
+
+Combines vector similarity, keyword matching, recency, and importance scoring.
+
+```typescript
+const results = await memory.search("What does Alice like?", {
+  limit: 5,
+  types: ["semantic", "episodic"],  // filter by type
+  minScore: 0.3,                     // minimum relevance
+  includeRelated: true,              // include graph neighbors
+  traversalDepth: 2,                 // how far to walk the graph
+  method: "hybrid",                  // vector + keyword + recency
+});
+
+for (const r of results) {
+  console.log(`[${r.method}] (${r.score.toFixed(2)}) ${r.node.content}`);
+  if (r.related) {
+    for (const rel of r.related) {
+      console.log(`  └─ ${rel.content}`);
+    }
+  }
+}
+```
+
+## Persistence
+
+Memory is saved as JSON files you can inspect and version control.
+
+```typescript
+const memory = new AgenticMemory({
+  backend: "local",
+  storageDir: "./.agent/memory",
+  namespace: "my-agent",  // creates graph-my-agent.json
+});
+
+// Auto-loads on first operation
+await memory.add("Something important", "semantic", 0.8);
+
+// Explicit save
+await memory.save();
+
+// Stats
+console.log(memory.stats());
+// { stm: 1, ltm: { nodes: 1, edges: 0, byType: { semantic: 1 } } }
+```
+
+## Custom Backends
+
+### Custom Embedding Backend
+
+```typescript
+import { EmbeddingBackend } from "@agents-eco/agentic-memory";
+
+class OpenAIEmbedding implements EmbeddingBackend {
+  name = "openai";
+  dimension = 1536;
+
+  async embed(text: string): Promise<number[]> {
+    const res = await fetch("https://api.openai.com/v1/embeddings", {
+      method: "POST",
+      headers: { Authorization: `Bearer ${apiKey}`, "Content-Type": "application/json" },
+      body: JSON.stringify({ model: "text-embedding-3-small", input: text }),
+    });
+    const data = await res.json();
+    return data.data[0].embedding;
+  }
+
+  async embedBatch(texts: string[]): Promise<number[][]> {
+    // Similar batch implementation
+  }
+}
+
+const memory = new AgenticMemory({
+  backend: "local",
+  embedding: new OpenAIEmbedding(),
+});
+```
+
+### Custom Storage Backend
+
+```typescript
+import { StorageBackend, SerializedGraph } from "@agents-eco/agentic-memory";
+
+class RedisStorage implements StorageBackend {
+  name = "redis";
+
+  async save(graph: SerializedGraph): Promise<void> {
+    await redis.set("memory:graph", JSON.stringify(graph));
+  }
+
+  async load(): Promise<SerializedGraph | null> {
+    const raw = await redis.get("memory:graph");
+    return raw ? JSON.parse(raw) : null;
+  }
+
+  async exists(): Promise<boolean> {
+    return (await redis.exists("memory:graph")) === 1;
+  }
+}
+
+const memory = new AgenticMemory({
+  backend: "local",
+  storage: new RedisStorage(),
+});
+```
+
+## Integration with Open Agentic Framework
+
+Use as the memory backend for [@agents-eco/open-agentic-framework](https://github.com/agents-eco/open-agentic-framework):
+
+```typescript
+import { Agent } from "@agents-eco/open-agentic-framework";
+import { AgenticMemory } from "@agents-eco/agentic-memory";
+
+const memory = new AgenticMemory({ backend: "local" });
+
+// Implement the MemoryStore interface
+const memoryStore = {
+  async add(entry) {
+    const { stmEntry } = await memory.add(entry.content, entry.type as any, 0.5);
+    return { id: stmEntry.id, content: entry.content, type: entry.type, timestamp: stmEntry.createdAt };
+  },
+  async search(query, limit) {
+    const results = await memory.search(query, { limit });
+    return results.map((r) => ({
+      id: r.node.id,
+      content: r.node.content,
+      type: r.node.type,
+      timestamp: r.node.createdAt,
+    }));
+  },
+  async list(limit) {
+    const entries = memory.stm.getRecent(limit);
+    return entries.map((e) => ({
+      id: e.id,
+      content: e.content,
+      type: e.type,
+      timestamp: e.createdAt,
+    }));
+  },
+  async clear() {
+    await memory.clear();
+  },
+};
+
+const agent = new Agent({
+  name: "memory-agent",
+  systemPrompt: "You remember everything.",
+  provider: { name: "venice", apiKey: "...", baseUrl: "https://api.venice.ai/api/v1", defaultModel: "qwen3-4b" },
+  memory: memoryStore,
+});
+```
+
+## API Reference
+
+### `AgenticMemory`
+
+| Method | Description |
+|--------|-------------|
+| `add(content, type?, importance?, metadata?)` | Add to STM (and LTM if important) |
+| `addEpisode(content, importance?)` | Add episodic memory with temporal linking |
+| `addFact(content, entities?, importance?)` | Add semantic memory with entity extraction |
+| `addObservation(content, importance?)` | Add an observation |
+| `addGoal(content, importance?)` | Add a goal |
+| `link(sourceId, targetId, relation, weight?)` | Create a relationship in LTM |
+| `search(query, options?)` | Hybrid search across STM + LTM |
+| `buildContext(query?)` | Build context string for prompt injection |
+| `consolidate(minImportance?)` | Promote important STM entries to LTM |
+| `decay()` | Apply decay to LTM nodes |
+| `save()` | Persist to storage |
+| `load()` | Load from storage |
+| `clear()` | Clear all memory |
+| `stats()` | Get memory statistics |
+
+### `SearchOptions`
+
+| Field | Type | Default | Description |
+|-------|------|---------|-------------|
+| `limit` | `number` | `5` | Max results |
+| `types` | `MemoryNodeType[]` | all | Filter by node type |
+| `minScore` | `number` | `0.0` | Minimum relevance score |
+| `includeRelated` | `boolean` | `false` | Include graph neighbors |
+| `traversalDepth` | `number` | `1` | Graph walk depth |
+| `method` | `"vector" \| "keyword" \| "hybrid"` | `"hybrid"` | Search method |
+
+## Contributing
+
+We welcome contributions. This project is early and there is room to shape its direction.
+
+- **Add a storage backend** — SQLite, Redis, PostgreSQL, S3
+- **Add an embedding backend** — OpenAI, Cohere, local transformers
+- **Improve search** — better scoring, re-ranking, query expansion
+- **Visualization** — graph visualization tools for debugging memory
+- **Report issues** — bug reports and feature requests help us prioritize
+
+## License
+
+MIT — [agents.eco](https://agents.eco)
+
+---
+
+<p align="center">
+  Built by <a href="https://agents.eco">agents.eco</a> — the decentralized AI agent economy.
+</p>

package/dist/embeddings/local.d.ts

@@ -0,0 +1,20 @@
+import type { EmbeddingBackend } from "../types.js";
+/**
+ * Local embedding backend using a simple bag-of-words / hash-based approach.
+ * No external API calls required. Good for offline use and development.
+ *
+ * Uses a deterministic hash to project words into a fixed-dimension vector space.
+ * Not as accurate as neural embeddings, but fast and zero-dependency.
+ */
+export declare class LocalEmbedding implements EmbeddingBackend {
+    readonly name = "local";
+    readonly dimension: number;
+    constructor(dimension?: number);
+    embed(text: string): Promise<number[]>;
+    embedBatch(texts: string[]): Promise<number[][]>;
+    private computeEmbedding;
+    private tokenize;
+    private hashWord;
+    private hashInt;
+}
+//# sourceMappingURL=local.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"local.d.ts","sourceRoot":"","sources":["../../src/embeddings/local.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAEpD;;;;;;GAMG;AACH,qBAAa,cAAe,YAAW,gBAAgB;IACrD,QAAQ,CAAC,IAAI,WAAW;IACxB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;gBAEf,SAAS,GAAE,MAAY;IAI7B,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAItC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;IAItD,OAAO,CAAC,gBAAgB;IA4CxB,OAAO,CAAC,QAAQ;IAQhB,OAAO,CAAC,QAAQ;IAShB,OAAO,CAAC,OAAO;CAMhB"}

package/dist/embeddings/local.js

@@ -0,0 +1,94 @@
+/**
+ * Local embedding backend using a simple bag-of-words / hash-based approach.
+ * No external API calls required. Good for offline use and development.
+ *
+ * Uses a deterministic hash to project words into a fixed-dimension vector space.
+ * Not as accurate as neural embeddings, but fast and zero-dependency.
+ */
+export class LocalEmbedding {
+    name = "local";
+    dimension;
+    constructor(dimension = 256) {
+        this.dimension = dimension;
+    }
+    async embed(text) {
+        return this.computeEmbedding(text);
+    }
+    async embedBatch(texts) {
+        return texts.map((t) => this.computeEmbedding(t));
+    }
+    computeEmbedding(text) {
+        const vector = new Float64Array(this.dimension);
+        const words = this.tokenize(text);
+        if (words.length === 0)
+            return Array.from(vector);
+        // Hash each word into the vector space
+        for (const word of words) {
+            const hash = this.hashWord(word);
+            // Use multiple hash projections for better distribution
+            for (let i = 0; i < 4; i++) {
+                const idx = Math.abs(this.hashInt(hash + i)) % this.dimension;
+                const sign = (this.hashInt(hash + i + 1000) % 2 === 0) ? 1 : -1;
+                vector[idx] += sign * (1.0 / Math.sqrt(words.length));
+            }
+            // Bigram features
+            const bigramHash = this.hashWord(word + "_bg");
+            const bigramIdx = Math.abs(bigramHash) % this.dimension;
+            vector[bigramIdx] += 0.5 / Math.sqrt(words.length);
+        }
+        // Add word-pair features for adjacent words
+        for (let i = 0; i < words.length - 1; i++) {
+            const pairHash = this.hashWord(words[i] + ":" + words[i + 1]);
+            const idx = Math.abs(pairHash) % this.dimension;
+            vector[idx] += 0.3 / Math.sqrt(words.length);
+        }
+        // L2 normalize
+        let norm = 0;
+        for (let i = 0; i < this.dimension; i++) {
+            norm += vector[i] * vector[i];
+        }
+        norm = Math.sqrt(norm);
+        if (norm > 0) {
+            for (let i = 0; i < this.dimension; i++) {
+                vector[i] /= norm;
+            }
+        }
+        return Array.from(vector);
+    }
+    tokenize(text) {
+        return text
+            .toLowerCase()
+            .replace(/[^\w\s]/g, " ")
+            .split(/\s+/)
+            .filter((w) => w.length > 1 && !STOP_WORDS.has(w));
+    }
+    hashWord(word) {
+        let hash = 0;
+        for (let i = 0; i < word.length; i++) {
+            const char = word.charCodeAt(i);
+            hash = ((hash << 5) - hash + char) | 0;
+        }
+        return hash;
+    }
+    hashInt(n) {
+        n = ((n >> 16) ^ n) * 0x45d9f3b;
+        n = ((n >> 16) ^ n) * 0x45d9f3b;
+        n = (n >> 16) ^ n;
+        return n;
+    }
+}
+const STOP_WORDS = new Set([
+    "the", "a", "an", "is", "are", "was", "were", "be", "been", "being",
+    "have", "has", "had", "do", "does", "did", "will", "would", "could",
+    "should", "may", "might", "shall", "can", "need", "dare", "ought",
+    "used", "to", "of", "in", "for", "on", "with", "at", "by", "from",
+    "as", "into", "through", "during", "before", "after", "above", "below",
+    "between", "out", "off", "over", "under", "again", "further", "then",
+    "once", "here", "there", "when", "where", "why", "how", "all", "both",
+    "each", "few", "more", "most", "other", "some", "such", "no", "nor",
+    "not", "only", "own", "same", "so", "than", "too", "very", "just",
+    "because", "but", "and", "or", "if", "while", "that", "this", "it",
+    "its", "my", "your", "his", "her", "our", "their", "what", "which",
+    "who", "whom", "these", "those", "am", "about", "up",
+]);
+//# sourceMappingURL=local.js.map

package/dist/embeddings/local.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"local.js","sourceRoot":"","sources":["../../src/embeddings/local.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,OAAO,cAAc;IAChB,IAAI,GAAG,OAAO,CAAC;IACf,SAAS,CAAS;IAE3B,YAAY,YAAoB,GAAG;QACjC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,IAAY;QACtB,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,KAAe;QAC9B,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IAEO,gBAAgB,CAAC,IAAY;QACnC,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAElC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAElD,uCAAuC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACjC,wDAAwD;YACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;gBAC9D,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YACxD,CAAC;YAED,kBAAkB;YAClB,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;YAC/C,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;YACxD,MAAM,CAAC,SAAS,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACrD,CAAC;QAED,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;YAChD,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAC/C,CAAC;QAED,eAAe;QACf,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAEO,QAAQ,CAAC,IAAY;QAC3B,OAAO,IAAI;aACR,WAAW,EAAE;aACb,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC;aACxB,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC;IAEO,QAAQ,CAAC,IAAY;QAC3B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChC,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACzC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,OAAO,CAAC,CAAS;QACvB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;QAChC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;QAChC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;CACF;AAED,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IACzB,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;IACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO;IACjE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM;IACjE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO;IACtE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM;IACpE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM;IACrE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK;IACnE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;IACjE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI;IAClE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO;IAClE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI;CACrD,CAAC,CAAC"}

package/dist/embeddings/voyage.d.ts

@@ -0,0 +1,25 @@
+import type { EmbeddingBackend } from "../types.js";
+/**
+ * Voyage AI embedding backend.
+ * Uses the Voyage API for high-quality neural embeddings.
+ *
+ * Models:
+ *   - voyage-3-lite (default): 512 dimensions, fast, cheap
+ *   - voyage-3: 1024 dimensions, higher quality
+ *   - voyage-3-large: 1024 dimensions, best quality
+ *   - voyage-code-3: optimized for code
+ *
+ * API docs: https://docs.voyageai.com/reference/embeddings-api
+ */
+export declare class VoyageEmbedding implements EmbeddingBackend {
+    readonly name = "voyage";
+    readonly dimension: number;
+    private apiKey;
+    private model;
+    private baseUrl;
+    constructor(apiKey: string, model?: string, baseUrl?: string);
+    embed(text: string): Promise<number[]>;
+    embedBatch(texts: string[]): Promise<number[][]>;
+    private callApi;
+}
+//# sourceMappingURL=voyage.d.ts.map

package/dist/embeddings/voyage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"voyage.d.ts","sourceRoot":"","sources":["../../src/embeddings/voyage.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAEpD;;;;;;;;;;;GAWG;AACH,qBAAa,eAAgB,YAAW,gBAAgB;IACtD,QAAQ,CAAC,IAAI,YAAY;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,OAAO,CAAS;gBAEZ,MAAM,EAAE,MAAM,EAAE,KAAK,GAAE,MAAwB,EAAE,OAAO,CAAC,EAAE,MAAM;IAuBvE,KAAK,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;IAKtC,UAAU,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YAcxC,OAAO;CA4BtB"}