beercan 0.1.0

package/dist/memory/embeddings.js

@@ -0,0 +1,90 @@
+/**
+ * Embedding providers for vector memory.
+ * Default: TF-IDF based local embeddings (no API calls needed).
+ * Pluggable: swap in Voyage AI or OpenAI for neural embeddings.
+ */
+// ── Local TF-IDF Embedder (default, no API needed) ─────────
+const VOCAB_SIZE = 512; // Fixed-dimension output
+/**
+ * Simple but effective local embedder using hashed TF-IDF.
+ * No external API calls. Deterministic. Fast.
+ * Good enough for finding similar goals/results in a personal system.
+ */
+export class LocalEmbedder {
+    dimensions = VOCAB_SIZE;
+    async embed(text) {
+        return hashTfIdf(text, VOCAB_SIZE);
+    }
+}
+/** Hash-based TF-IDF: maps tokens to fixed-size vector via hashing trick */
+function hashTfIdf(text, dims) {
+    const vector = new Float64Array(dims);
+    const tokens = tokenize(text);
+    const tf = new Map();
+    for (const token of tokens) {
+        tf.set(token, (tf.get(token) || 0) + 1);
+    }
+    for (const [token, count] of tf) {
+        // Hashing trick: map token to bucket
+        const hash = fnv1a(token);
+        const bucket = ((hash % dims) + dims) % dims;
+        // Sign from second hash for variance reduction
+        const sign = fnv1a(token + "_sign") % 2 === 0 ? 1 : -1;
+        // TF weight with sublinear scaling
+        vector[bucket] += sign * (1 + Math.log(count));
+    }
+    // L2 normalize
+    let norm = 0;
+    for (let i = 0; i < dims; i++)
+        norm += vector[i] * vector[i];
+    norm = Math.sqrt(norm);
+    if (norm > 0) {
+        for (let i = 0; i < dims; i++)
+            vector[i] /= norm;
+    }
+    return Array.from(vector);
+}
+/** Simple tokenizer: lowercase, split on non-alphanumeric, filter short */
+function tokenize(text) {
+    return text
+        .toLowerCase()
+        .replace(/[^a-z0-9\s]/g, " ")
+        .split(/\s+/)
+        .filter((t) => t.length > 2);
+}
+/** FNV-1a hash (32-bit) */
+function fnv1a(str) {
+    let hash = 0x811c9dc5;
+    for (let i = 0; i < str.length; i++) {
+        hash ^= str.charCodeAt(i);
+        hash = (hash * 0x01000193) >>> 0;
+    }
+    return hash;
+}
+// ── LRU Cache for embeddings ────────────────────────────────
+export class EmbeddingCache {
+    cache = new Map();
+    maxSize;
+    constructor(maxSize = 1000) {
+        this.maxSize = maxSize;
+    }
+    get(key) {
+        const val = this.cache.get(key);
+        if (val) {
+            // Move to end (most recently used)
+            this.cache.delete(key);
+            this.cache.set(key, val);
+        }
+        return val;
+    }
+    set(key, value) {
+        if (this.cache.size >= this.maxSize) {
+            // Evict oldest
+            const oldest = this.cache.keys().next().value;
+            if (oldest !== undefined)
+                this.cache.delete(oldest);
+        }
+        this.cache.set(key, value);
+    }
+}
+//# sourceMappingURL=embeddings.js.map

package/dist/memory/embeddings.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"embeddings.js","sourceRoot":"","sources":["../../src/memory/embeddings.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAWH,8DAA8D;AAE9D,MAAM,UAAU,GAAG,GAAG,CAAC,CAAC,yBAAyB;AAEjD;;;;GAIG;AACH,MAAM,OAAO,aAAa;IACxB,UAAU,GAAG,UAAU,CAAC;IAExB,KAAK,CAAC,KAAK,CAAC,IAAY;QACtB,OAAO,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACrC,CAAC;CACF;AAED,4EAA4E;AAC5E,SAAS,SAAS,CAAC,IAAY,EAAE,IAAY;IAC3C,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;IACtC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC9B,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IAErC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAChC,qCAAqC;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC1B,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;QAC7C,+CAA+C;QAC/C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,mCAAmC;QACnC,MAAM,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,eAAe;IACf,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;QAAE,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7D,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvB,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;YAAE,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;IACnD,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;AAC5B,CAAC;AAED,2EAA2E;AAC3E,SAAS,QAAQ,CAAC,IAAY;IAC5B,OAAO,IAAI;SACR,WAAW,EAAE;SACb,OAAO,CAAC,cAAc,EAAE,GAAG,CAAC;SAC5B,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACjC,CAAC;AAED,2BAA2B;AAC3B,SAAS,KAAK,CAAC,GAAW;IACxB,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACpC,IAAI,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,GAAG,CAAC,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+DAA+D;AAE/D,MAAM,OAAO,cAAc;IACjB,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IACpC,OAAO,CAAS;IAExB,YAAY,OAAO,GAAG,IAAI;QACxB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,GAAW;QACb,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,GAAG,EAAE,CAAC;YACR,mCAAmC;YACnC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC3B,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,GAAG,CAAC,GAAW,EAAE,KAAe;QAC9B,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACpC,eAAe;YACf,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC;YAC9C,IAAI,MAAM,KAAK,SAAS;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC7B,CAAC;CACF"}

package/dist/memory/hybrid-search.d.ts

@@ -0,0 +1,31 @@
+import type { BeerCanDB } from "../storage/database.js";
+import type { SqliteVecStore } from "./sqlite-vec-store.js";
+import type { KnowledgeGraph } from "./knowledge-graph.js";
+import type { MemoryEntry, MemoryType } from "./schemas.js";
+export interface HybridSearchOptions {
+    query: string;
+    projectId: string;
+    projectSlug: string;
+    memoryType?: MemoryType;
+    limit?: number;
+}
+export interface HybridSearchResult {
+    entry: MemoryEntry;
+    score: number;
+    sources: Array<{
+        type: "fts" | "vector" | "graph";
+        rank: number;
+    }>;
+}
+export declare class HybridSearch {
+    private db;
+    private vecStore;
+    private kg;
+    constructor(db: BeerCanDB, vecStore: SqliteVecStore, kg: KnowledgeGraph);
+    search(options: HybridSearchOptions): Promise<HybridSearchResult[]>;
+    private searchFTS;
+    private searchVector;
+    private graphExpand;
+    private addScore;
+}
+//# sourceMappingURL=hybrid-search.d.ts.map

package/dist/memory/hybrid-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"hybrid-search.d.ts","sourceRoot":"","sources":["../../src/memory/hybrid-search.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,KAAK,EAAE,cAAc,EAAmB,MAAM,uBAAuB,CAAC;AAC7E,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAC3D,OAAO,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAM5D,MAAM,WAAW,mBAAmB;IAClC,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,UAAU,CAAC,EAAE,UAAU,CAAC;IACxB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,kBAAkB;IACjC,KAAK,EAAE,WAAW,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,KAAK,GAAG,QAAQ,GAAG,OAAO,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACpE;AAID,qBAAa,YAAY;IAErB,OAAO,CAAC,EAAE;IACV,OAAO,CAAC,QAAQ;IAChB,OAAO,CAAC,EAAE;gBAFF,EAAE,EAAE,SAAS,EACb,QAAQ,EAAE,cAAc,EACxB,EAAE,EAAE,cAAc;IAGtB,MAAM,CAAC,OAAO,EAAE,mBAAmB,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;IA8CzE,OAAO,CAAC,SAAS;YASH,YAAY;IAQ1B,OAAO,CAAC,WAAW;IA2BnB,OAAO,CAAC,QAAQ;CAoBjB"}

package/dist/memory/hybrid-search.js

@@ -0,0 +1,114 @@
+const RRF_K = 60; // Standard RRF constant
+export class HybridSearch {
+    db;
+    vecStore;
+    kg;
+    constructor(db, vecStore, kg) {
+        this.db = db;
+        this.vecStore = vecStore;
+        this.kg = kg;
+    }
+    async search(options) {
+        const { query, projectId, memoryType, limit = 10 } = options;
+        const fetchLimit = limit * 2; // Over-fetch for better RRF merging
+        // Run FTS5 and vector search in parallel
+        const [ftsResults, vectorResults] = await Promise.all([
+            this.searchFTS(projectId, query, fetchLimit),
+            this.searchVector(query, fetchLimit),
+        ]);
+        // Graph expansion: find entities matching query, get their linked memory IDs
+        const graphMemoryIds = this.graphExpand(projectId, query);
+        // Build RRF score map
+        const scoreMap = new Map();
+        // FTS contributions
+        for (let rank = 0; rank < ftsResults.length; rank++) {
+            const entry = ftsResults[rank];
+            if (memoryType && entry.memoryType !== memoryType)
+                continue;
+            this.addScore(scoreMap, entry, rank, "fts");
+        }
+        // Vector contributions (look up the MemoryEntry for each vector result)
+        for (let rank = 0; rank < vectorResults.length; rank++) {
+            const result = vectorResults[rank];
+            const entry = this.db.getMemoryEntry(result.memoryId);
+            if (!entry)
+                continue;
+            if (memoryType && entry.memoryType !== memoryType)
+                continue;
+            this.addScore(scoreMap, entry, rank, "vector");
+        }
+        // Graph contributions (boost)
+        for (let rank = 0; rank < graphMemoryIds.length; rank++) {
+            const entry = this.db.getMemoryEntry(graphMemoryIds[rank]);
+            if (!entry)
+                continue;
+            if (memoryType && entry.memoryType !== memoryType)
+                continue;
+            this.addScore(scoreMap, entry, rank, "graph");
+        }
+        // Sort by combined RRF score, return top results
+        return Array.from(scoreMap.values())
+            .sort((a, b) => b.score - a.score)
+            .slice(0, limit);
+    }
+    searchFTS(projectId, query, limit) {
+        try {
+            return this.db.searchMemoryFTS(projectId, query, limit);
+        }
+        catch {
+            // FTS query might fail on syntax errors (e.g., special characters)
+            return [];
+        }
+    }
+    async searchVector(query, limit) {
+        try {
+            return this.vecStore.query(query, limit);
+        }
+        catch {
+            return [];
+        }
+    }
+    graphExpand(projectId, query) {
+        try {
+            // Find entities whose names match the query terms
+            const entities = this.kg.searchEntities(projectId, query);
+            if (entities.length === 0)
+                return [];
+            // Collect memory IDs linked to matching entities and their neighbors
+            const memoryIds = new Set();
+            for (const entity of entities.slice(0, 5)) {
+                // Direct entity memories
+                const directIds = this.db.getKGEntityMemoryIds(entity.id);
+                for (const id of directIds)
+                    memoryIds.add(id);
+                // Neighbor entity memories (1 hop)
+                const neighbors = this.kg.getNeighbors(entity.id, 1);
+                for (const neighbor of neighbors.slice(0, 10)) {
+                    const neighborIds = this.db.getKGEntityMemoryIds(neighbor.id);
+                    for (const id of neighborIds)
+                        memoryIds.add(id);
+                }
+            }
+            return Array.from(memoryIds);
+        }
+        catch {
+            return [];
+        }
+    }
+    addScore(scoreMap, entry, rank, source) {
+        const rrfScore = 1 / (RRF_K + rank + 1);
+        const existing = scoreMap.get(entry.id);
+        if (existing) {
+            existing.score += rrfScore;
+            existing.sources.push({ type: source, rank });
+        }
+        else {
+            scoreMap.set(entry.id, {
+                entry,
+                score: rrfScore,
+                sources: [{ type: source, rank }],
+            });
+        }
+    }
+}
+//# sourceMappingURL=hybrid-search.js.map

package/dist/memory/hybrid-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hybrid-search.js","sourceRoot":"","sources":["../../src/memory/hybrid-search.ts"],"names":[],"mappings":"AAuBA,MAAM,KAAK,GAAG,EAAE,CAAC,CAAC,wBAAwB;AAE1C,MAAM,OAAO,YAAY;IAEb;IACA;IACA;IAHV,YACU,EAAa,EACb,QAAwB,EACxB,EAAkB;QAFlB,OAAE,GAAF,EAAE,CAAW;QACb,aAAQ,GAAR,QAAQ,CAAgB;QACxB,OAAE,GAAF,EAAE,CAAgB;IACzB,CAAC;IAEJ,KAAK,CAAC,MAAM,CAAC,OAA4B;QACvC,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,EAAE,KAAK,GAAG,EAAE,EAAE,GAAG,OAAO,CAAC;QAC7D,MAAM,UAAU,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,oCAAoC;QAElE,yCAAyC;QACzC,MAAM,CAAC,UAAU,EAAE,aAAa,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;YACpD,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,KAAK,EAAE,UAAU,CAAC;YAC5C,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC;SACrC,CAAC,CAAC;QAEH,6EAA6E;QAC7E,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAE1D,sBAAsB;QACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA8B,CAAC;QAEvD,oBAAoB;QACpB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YACpD,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,UAAU,IAAI,KAAK,CAAC,UAAU,KAAK,UAAU;gBAAE,SAAS;YAC5D,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC9C,CAAC;QAED,wEAAwE;QACxE,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YACvD,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACtD,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,IAAI,UAAU,IAAI,KAAK,CAAC,UAAU,KAAK,UAAU;gBAAE,SAAS;YAC5D,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC;QACjD,CAAC;QAED,8BAA8B;QAC9B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;YACxD,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC;YAC3D,IAAI,CAAC,KAAK;gBAAE,SAAS;YACrB,IAAI,UAAU,IAAI,KAAK,CAAC,UAAU,KAAK,UAAU;gBAAE,SAAS;YAC5D,IAAI,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAChD,CAAC;QAED,iDAAiD;QACjD,OAAO,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;aACjC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrB,CAAC;IAEO,SAAS,CAAC,SAAiB,EAAE,KAAa,EAAE,KAAa;QAC/D,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC1D,CAAC;QAAC,MAAM,CAAC;YACP,mEAAmE;YACnE,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,YAAY,CAAC,KAAa,EAAE,KAAa;QACrD,IAAI,CAAC;YACH,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC3C,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAEO,WAAW,CAAC,SAAiB,EAAE,KAAa;QAClD,IAAI,CAAC;YACH,kDAAkD;YAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC1D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC;YAErC,qEAAqE;YACrE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;YACpC,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC1C,yBAAyB;gBACzB,MAAM,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBAC1D,KAAK,MAAM,EAAE,IAAI,SAAS;oBAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAE9C,mCAAmC;gBACnC,MAAM,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;gBACrD,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;oBAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE,CAAC,oBAAoB,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC9D,KAAK,MAAM,EAAE,IAAI,WAAW;wBAAE,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAClD,CAAC;YACH,CAAC;YAED,OAAO,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAEO,QAAQ,CACd,QAAyC,EACzC,KAAkB,EAClB,IAAY,EACZ,MAAkC;QAElC,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;QAExC,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACxC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,KAAK,IAAI,QAAQ,CAAC;YAC3B,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;QAChD,CAAC;aAAM,CAAC;YACN,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE;gBACrB,KAAK;gBACL,KAAK,EAAE,QAAQ;gBACf,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;aAClC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;CACF"}

package/dist/memory/index.d.ts

@@ -0,0 +1,55 @@
+import { type EmbeddingProvider } from "./embeddings.js";
+import { SqliteVecStore } from "./sqlite-vec-store.js";
+import { KnowledgeGraph } from "./knowledge-graph.js";
+import { WorkingMemory } from "./working-memory.js";
+import { type HybridSearchResult } from "./hybrid-search.js";
+import type { BeerCanDB } from "../storage/database.js";
+import type { MemoryEntry, MemoryType } from "./schemas.js";
+import type { Bloop } from "../schemas.js";
+export declare class MemoryManager {
+    private embedder;
+    private cache;
+    private db;
+    private vecStore;
+    private kg;
+    private wm;
+    private hybridSearch;
+    constructor(db: BeerCanDB, embedder?: EmbeddingProvider);
+    getKnowledgeGraph(): KnowledgeGraph;
+    getWorkingMemory(): WorkingMemory;
+    getVectorStore(): SqliteVecStore;
+    /** Store a completed bloop's result in both FTS5 and sqlite-vec */
+    storeBloopResult(bloop: Bloop, projectSlug: string): Promise<void>;
+    /** Store a new memory (fact, insight, decision, note) */
+    storeMemory(projectSlug: string, opts: {
+        projectId: string;
+        title: string;
+        content: string;
+        memoryType: MemoryType;
+        tags?: string[];
+        confidence?: number;
+        sourceBloopId?: string;
+    }): Promise<MemoryEntry>;
+    /** Update a memory by creating a new version that supersedes it */
+    updateMemory(projectSlug: string, memoryId: string, updates: {
+        title?: string;
+        content: string;
+        confidence?: number;
+    }): Promise<MemoryEntry | null>;
+    /** Search across all memory layers using RRF-fused hybrid search */
+    search(projectSlug: string, query: string, opts?: {
+        projectId?: string;
+        memoryType?: MemoryType;
+        limit?: number;
+    }): Promise<HybridSearchResult[]>;
+    /** Retrieve relevant past context for a new goal */
+    retrieveContext(projectSlug: string, goal: string, count?: number): Promise<string>;
+}
+export { SqliteVecStore } from "./sqlite-vec-store.js";
+export { LocalEmbedder, type EmbeddingProvider } from "./embeddings.js";
+export { KnowledgeGraph } from "./knowledge-graph.js";
+export { WorkingMemory } from "./working-memory.js";
+export { HybridSearch } from "./hybrid-search.js";
+export type { HybridSearchResult, HybridSearchOptions } from "./hybrid-search.js";
+export type { MemoryEntry, MemoryType, KGEntity, KGEdge, EntityType, EdgeType } from "./schemas.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/memory/index.ts"],"names":[],"mappings":"AACA,OAAO,EAAiC,KAAK,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACxF,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAgB,KAAK,kBAAkB,EAA4B,MAAM,oBAAoB,CAAC;AACrG,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAC5D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AAU3C,qBAAa,aAAa;IACxB,OAAO,CAAC,QAAQ,CAAoB;IACpC,OAAO,CAAC,KAAK,CAAiB;IAC9B,OAAO,CAAC,EAAE,CAAY;IACtB,OAAO,CAAC,QAAQ,CAAiB;IACjC,OAAO,CAAC,EAAE,CAAiB;IAC3B,OAAO,CAAC,EAAE,CAAgB;IAC1B,OAAO,CAAC,YAAY,CAAe;gBAEvB,EAAE,EAAE,SAAS,EAAE,QAAQ,CAAC,EAAE,iBAAiB;IAgBvD,iBAAiB,IAAI,cAAc;IAInC,gBAAgB,IAAI,aAAa;IAIjC,cAAc,IAAI,cAAc;IAMhC,mEAAmE;IAC7D,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAqCxE,yDAAyD;IACnD,WAAW,CACf,WAAW,EAAE,MAAM,EACnB,IAAI,EAAE;QACJ,SAAS,EAAE,MAAM,CAAC;QAClB,KAAK,EAAE,MAAM,CAAC;QACd,OAAO,EAAE,MAAM,CAAC;QAChB,UAAU,EAAE,UAAU,CAAC;QACvB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;QAChB,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB,aAAa,CAAC,EAAE,MAAM,CAAC;KACxB,GACA,OAAO,CAAC,WAAW,CAAC;IAiCvB,mEAAmE;IAC7D,YAAY,CAChB,WAAW,EAAE,MAAM,EACnB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE;QAAE,KAAK,CAAC,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,MAAM,CAAA;KAAE,GAChE,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAkC9B,oEAAoE;IAC9D,MAAM,CACV,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,MAAM,EACb,IAAI,CAAC,EAAE;QAAE,SAAS,CAAC,EAAE,MAAM,CAAC;QAAC,UAAU,CAAC,EAAE,UAAU,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,CAAA;KAAE,GACrE,OAAO,CAAC,kBAAkB,EAAE,CAAC;IAmBhC,oDAAoD;IAC9C,eAAe,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,SAAI,GAAG,OAAO,CAAC,MAAM,CAAC;CAiBrF;AAED,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,KAAK,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AACxE,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,YAAY,EAAE,kBAAkB,EAAE,mBAAmB,EAAE,MAAM,oBAAoB,CAAC;AAClF,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC"}

package/dist/memory/index.js

@@ -0,0 +1,175 @@
+import { v4 as uuid } from "uuid";
+import { LocalEmbedder, EmbeddingCache } from "./embeddings.js";
+import { SqliteVecStore } from "./sqlite-vec-store.js";
+import { KnowledgeGraph } from "./knowledge-graph.js";
+import { WorkingMemory } from "./working-memory.js";
+import { HybridSearch } from "./hybrid-search.js";
+// ── Memory Manager ──────────────────────────────────────────
+// Central facade over all memory subsystems:
+// - FTS5 full-text search (BM25 keyword matching)
+// - sqlite-vec vector store (semantic similarity)
+// - Knowledge graph (entity relationships, multi-hop)
+// - Working memory (per-bloop scratchpad)
+// - Hybrid search (RRF-fused results)
+export class MemoryManager {
+    embedder;
+    cache;
+    db;
+    vecStore;
+    kg;
+    wm;
+    hybridSearch;
+    constructor(db, embedder) {
+        this.db = db;
+        this.embedder = embedder ?? new LocalEmbedder();
+        this.cache = new EmbeddingCache(500);
+        this.vecStore = new SqliteVecStore(db, this.embedder);
+        this.kg = new KnowledgeGraph(db);
+        this.wm = new WorkingMemory(db);
+        this.hybridSearch = new HybridSearch(db, this.vecStore, this.kg);
+    }
+    // ── Subsystem Access ──────────────────────────────────
+    getKnowledgeGraph() {
+        return this.kg;
+    }
+    getWorkingMemory() {
+        return this.wm;
+    }
+    getVectorStore() {
+        return this.vecStore;
+    }
+    // ── Store Bloop Result ─────────────────────────────────
+    /** Store a completed bloop's result in both FTS5 and sqlite-vec */
+    async storeBloopResult(bloop, projectSlug) {
+        if (bloop.status !== "completed" || !bloop.result)
+            return;
+        try {
+            const summary = typeof bloop.result === "string"
+                ? bloop.result
+                : JSON.stringify(bloop.result).slice(0, 2000);
+            const now = new Date().toISOString();
+            const memoryId = uuid();
+            // Create structured memory entry (FTS5-indexed)
+            const entry = {
+                id: memoryId,
+                projectId: bloop.projectId,
+                memoryType: "loop_result",
+                title: bloop.goal,
+                content: summary,
+                sourceBloopId: bloop.id,
+                supersededBy: null,
+                confidence: 1.0,
+                tags: [],
+                createdAt: now,
+                updatedAt: now,
+            };
+            this.db.createMemoryEntry(entry);
+            // Store vector embedding in sqlite-vec
+            const text = `${bloop.goal}\n${summary}`;
+            await this.vecStore.store(memoryId, text);
+        }
+        catch (err) {
+            console.warn(`[memory] Failed to store bloop result: ${err.message}`);
+        }
+    }
+    // ── Store Arbitrary Memory ────────────────────────────
+    /** Store a new memory (fact, insight, decision, note) */
+    async storeMemory(projectSlug, opts) {
+        const now = new Date().toISOString();
+        const memoryId = uuid();
+        const entry = {
+            id: memoryId,
+            projectId: opts.projectId,
+            memoryType: opts.memoryType,
+            title: opts.title,
+            content: opts.content,
+            sourceBloopId: opts.sourceBloopId ?? null,
+            supersededBy: null,
+            confidence: opts.confidence ?? 1.0,
+            tags: opts.tags ?? [],
+            createdAt: now,
+            updatedAt: now,
+        };
+        this.db.createMemoryEntry(entry);
+        // Store vector embedding
+        try {
+            const text = `${opts.title}\n${opts.content}`;
+            await this.vecStore.store(memoryId, text);
+        }
+        catch (err) {
+            console.warn(`[memory] Failed to store vector: ${err.message}`);
+        }
+        return entry;
+    }
+    // ── Update Memory (supersede model) ───────────────────
+    /** Update a memory by creating a new version that supersedes it */
+    async updateMemory(projectSlug, memoryId, updates) {
+        const old = this.db.getMemoryEntry(memoryId);
+        if (!old)
+            return null;
+        const now = new Date().toISOString();
+        const newEntry = {
+            id: uuid(),
+            projectId: old.projectId,
+            memoryType: old.memoryType,
+            title: updates.title ?? old.title,
+            content: updates.content,
+            sourceBloopId: old.sourceBloopId,
+            supersededBy: null,
+            confidence: updates.confidence ?? old.confidence,
+            tags: old.tags,
+            createdAt: now,
+            updatedAt: now,
+        };
+        this.db.supersedeMemoryEntry(memoryId, newEntry);
+        // Store new vector
+        try {
+            const text = `${newEntry.title}\n${newEntry.content}`;
+            await this.vecStore.store(newEntry.id, text);
+        }
+        catch (err) {
+            console.warn(`[memory] Failed to store updated vector: ${err.message}`);
+        }
+        return newEntry;
+    }
+    // ── Hybrid Search ─────────────────────────────────────
+    /** Search across all memory layers using RRF-fused hybrid search */
+    async search(projectSlug, query, opts) {
+        let projectId = opts?.projectId;
+        if (!projectId) {
+            const project = this.db.getProjectBySlug(projectSlug);
+            if (!project)
+                return [];
+            projectId = project.id;
+        }
+        return this.hybridSearch.search({
+            query,
+            projectId,
+            projectSlug,
+            memoryType: opts?.memoryType,
+            limit: opts?.limit,
+        });
+    }
+    // ── Retrieve Context ──────────────────────────────────
+    /** Retrieve relevant past context for a new goal */
+    async retrieveContext(projectSlug, goal, count = 5) {
+        try {
+            const results = await this.search(projectSlug, goal, { limit: count });
+            if (results.length > 0) {
+                const lines = results.map((r, i) => `${i + 1}. [${r.entry.memoryType}] ${r.entry.title}\n   ${r.entry.content.slice(0, 300)}`);
+                return `\n--- Relevant Memories ---\n${lines.join("\n\n")}`;
+            }
+            return "";
+        }
+        catch (err) {
+            console.warn(`[memory] Failed to retrieve context: ${err.message}`);
+            return "";
+        }
+    }
+}
+export { SqliteVecStore } from "./sqlite-vec-store.js";
+export { LocalEmbedder } from "./embeddings.js";
+export { KnowledgeGraph } from "./knowledge-graph.js";
+export { WorkingMemory } from "./working-memory.js";
+export { HybridSearch } from "./hybrid-search.js";
+//# sourceMappingURL=index.js.map

package/dist/memory/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/memory/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,EAAE,IAAI,IAAI,EAAE,MAAM,MAAM,CAAC;AAClC,OAAO,EAAE,aAAa,EAAE,cAAc,EAA0B,MAAM,iBAAiB,CAAC;AACxF,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAqD,MAAM,oBAAoB,CAAC;AAKrG,+DAA+D;AAC/D,6CAA6C;AAC7C,kDAAkD;AAClD,kDAAkD;AAClD,sDAAsD;AACtD,0CAA0C;AAC1C,sCAAsC;AAEtC,MAAM,OAAO,aAAa;IAChB,QAAQ,CAAoB;IAC5B,KAAK,CAAiB;IACtB,EAAE,CAAY;IACd,QAAQ,CAAiB;IACzB,EAAE,CAAiB;IACnB,EAAE,CAAgB;IAClB,YAAY,CAAe;IAEnC,YAAY,EAAa,EAAE,QAA4B;QACrD,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,QAAQ,GAAG,QAAQ,IAAI,IAAI,aAAa,EAAE,CAAC;QAChD,IAAI,CAAC,KAAK,GAAG,IAAI,cAAc,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ,GAAG,IAAI,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtD,IAAI,CAAC,EAAE,GAAG,IAAI,cAAc,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,EAAE,GAAG,IAAI,aAAa,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,YAAY,GAAG,IAAI,YAAY,CAClC,EAAE,EACF,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,EAAE,CACR,CAAC;IACJ,CAAC;IAED,yDAAyD;IAEzD,iBAAiB;QACf,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED,gBAAgB;QACd,OAAO,IAAI,CAAC,EAAE,CAAC;IACjB,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IAED,0DAA0D;IAE1D,mEAAmE;IACnE,KAAK,CAAC,gBAAgB,CAAC,KAAY,EAAE,WAAmB;QACtD,IAAI,KAAK,CAAC,MAAM,KAAK,WAAW,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO;QAE1D,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,OAAO,KAAK,CAAC,MAAM,KAAK,QAAQ;gBAC9C,CAAC,CAAC,KAAK,CAAC,MAAM;gBACd,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAEhD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,IAAI,EAAE,CAAC;YAExB,gDAAgD;YAChD,MAAM,KAAK,GAAgB;gBACzB,EAAE,EAAE,QAAQ;gBACZ,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,UAAU,EAAE,aAAa;gBACzB,KAAK,EAAE,KAAK,CAAC,IAAI;gBACjB,OAAO,EAAE,OAAO;gBAChB,aAAa,EAAE,KAAK,CAAC,EAAE;gBACvB,YAAY,EAAE,IAAI;gBAClB,UAAU,EAAE,GAAG;gBACf,IAAI,EAAE,EAAE;gBACR,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf,CAAC;YACF,IAAI,CAAC,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAEjC,uCAAuC;YACvC,MAAM,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YACzC,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC5C,CAAC;QAAC,OAAO,GAAQ,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,0CAA0C,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED,yDAAyD;IAEzD,yDAAyD;IACzD,KAAK,CAAC,WAAW,CACf,WAAmB,EACnB,IAQC;QAED,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,EAAE,CAAC;QAExB,MAAM,KAAK,GAAgB;YACzB,EAAE,EAAE,QAAQ;YACZ,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,aAAa,EAAE,IAAI,CAAC,aAAa,IAAI,IAAI;YACzC,YAAY,EAAE,IAAI;YAClB,UAAU,EAAE,IAAI,CAAC,UAAU,IAAI,GAAG;YAClC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,EAAE;YACrB,SAAS,EAAE,GAAG;YACd,SAAS,EAAE,GAAG;SACf,CAAC;QAEF,IAAI,CAAC,EAAE,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAEjC,yBAAyB;QACzB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;YAC9C,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC5C,CAAC;QAAC,OAAO,GAAQ,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,oCAAoC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QAClE,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,yDAAyD;IAEzD,mEAAmE;IACnE,KAAK,CAAC,YAAY,CAChB,WAAmB,EACnB,QAAgB,EAChB,OAAiE;QAEjE,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC;QAC7C,IAAI,CAAC,GAAG;YAAE,OAAO,IAAI,CAAC;QAEtB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAgB;YAC5B,EAAE,EAAE,IAAI,EAAE;YACV,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,KAAK,EAAE,OAAO,CAAC,KAAK,IAAI,GAAG,CAAC,KAAK;YACjC,OAAO,EAAE,OAAO,CAAC,OAAO;YACxB,aAAa,EAAE,GAAG,CAAC,aAAa;YAChC,YAAY,EAAE,IAAI;YAClB,UAAU,EAAE,OAAO,CAAC,UAAU,IAAI,GAAG,CAAC,UAAU;YAChD,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,SAAS,EAAE,GAAG;YACd,SAAS,EAAE,GAAG;SACf,CAAC;QAEF,IAAI,CAAC,EAAE,CAAC,oBAAoB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEjD,mBAAmB;QACnB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,GAAG,QAAQ,CAAC,KAAK,KAAK,QAAQ,CAAC,OAAO,EAAE,CAAC;YACtD,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC/C,CAAC;QAAC,OAAO,GAAQ,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,4CAA4C,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;QAC1E,CAAC;QAED,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,yDAAyD;IAEzD,oEAAoE;IACpE,KAAK,CAAC,MAAM,CACV,WAAmB,EACnB,KAAa,EACb,IAAsE;QAEtE,IAAI,SAAS,GAAG,IAAI,EAAE,SAAS,CAAC;QAChC,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;YACtD,IAAI,CAAC,OAAO;gBAAE,OAAO,EAAE,CAAC;YACxB,SAAS,GAAG,OAAO,CAAC,EAAE,CAAC;QACzB,CAAC;QAED,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;YAC9B,KAAK;YACL,SAAS;YACT,WAAW;YACX,UAAU,EAAE,IAAI,EAAE,UAAU;YAC5B,KAAK,EAAE,IAAI,EAAE,KAAK;SACnB,CAAC,CAAC;IACL,CAAC;IAED,yDAAyD;IAEzD,oDAAoD;IACpD,KAAK,CAAC,eAAe,CAAC,WAAmB,EAAE,IAAY,EAAE,KAAK,GAAG,CAAC;QAChE,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YAEvE,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACjC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,UAAU,KAAK,CAAC,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAC1F,CAAC;gBACF,OAAO,gCAAgC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9D,CAAC;YAED,OAAO,EAAE,CAAC;QACZ,CAAC;QAAC,OAAO,GAAQ,EAAE,CAAC;YAClB,OAAO,CAAC,IAAI,CAAC,wCAAwC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;YACpE,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;CACF;AAED,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,aAAa,EAA0B,MAAM,iBAAiB,CAAC;AACxE,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC"}

package/dist/memory/knowledge-graph.d.ts

@@ -0,0 +1,21 @@
+import type { BeerCanDB } from "../storage/database.js";
+import type { KGEntity, KGEdge, EntityType, EdgeType, MemoryEntry } from "./schemas.js";
+export declare class KnowledgeGraph {
+    private db;
+    constructor(db: BeerCanDB);
+    /** Find or create an entity by name within a project (idempotent) */
+    getOrCreateEntity(projectId: string, name: string, entityType: EntityType, description?: string, bloopId?: string): KGEntity;
+    getEntity(id: string): KGEntity | null;
+    findByName(projectId: string, name: string): KGEntity | null;
+    listEntities(projectId: string, type?: EntityType): KGEntity[];
+    searchEntities(projectId: string, query: string): KGEntity[];
+    createEdge(projectId: string, sourceId: string, targetId: string, edgeType: EdgeType, weight?: number, bloopId?: string, properties?: Record<string, unknown>): KGEdge;
+    getEdgesFrom(entityId: string): KGEdge[];
+    getEdgesTo(entityId: string): KGEdge[];
+    /** BFS traversal to find neighbors up to a given depth */
+    getNeighbors(entityId: string, depth?: number, edgeTypes?: EdgeType[]): KGEntity[];
+    linkEntityToMemory(entityId: string, memoryId: string): void;
+    getMemoriesForEntity(entityId: string): MemoryEntry[];
+    getEntitiesForMemory(memoryId: string): KGEntity[];
+}
+//# sourceMappingURL=knowledge-graph.d.ts.map

package/dist/memory/knowledge-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"knowledge-graph.d.ts","sourceRoot":"","sources":["../../src/memory/knowledge-graph.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,UAAU,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAOxF,qBAAa,cAAc;IACb,OAAO,CAAC,EAAE;gBAAF,EAAE,EAAE,SAAS;IAIjC,qEAAqE;IACrE,iBAAiB,CACf,SAAS,EAAE,MAAM,EACjB,IAAI,EAAE,MAAM,EACZ,UAAU,EAAE,UAAU,EACtB,WAAW,CAAC,EAAE,MAAM,EACpB,OAAO,CAAC,EAAE,MAAM,GACf,QAAQ;IA6BX,SAAS,CAAC,EAAE,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI;IAItC,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,QAAQ,GAAG,IAAI;IAI5D,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,UAAU,GAAG,QAAQ,EAAE;IAI9D,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,QAAQ,EAAE;IAM5D,UAAU,CACR,SAAS,EAAE,MAAM,EACjB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,QAAQ,EAClB,MAAM,SAAM,EACZ,OAAO,CAAC,EAAE,MAAM,EAChB,UAAU,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAM,GACvC,MAAM;IAiBT,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAIxC,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE;IAMtC,0DAA0D;IAC1D,YAAY,CACV,QAAQ,EAAE,MAAM,EAChB,KAAK,SAAI,EACT,SAAS,CAAC,EAAE,QAAQ,EAAE,GACrB,QAAQ,EAAE;IAkCb,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IAI5D,oBAAoB,CAAC,QAAQ,EAAE,MAAM,GAAG,WAAW,EAAE;IAOrD,oBAAoB,CAAC,QAAQ,EAAE,MAAM,GAAG,QAAQ,EAAE;CAMnD"}

package/dist/memory/knowledge-graph.js

@@ -0,0 +1,118 @@
+import { v4 as uuid } from "uuid";
+// ── Knowledge Graph ─────────────────────────────────────────
+// Entity-relationship graph for multi-hop reasoning.
+// Entities are unique per (name, project_id).
+// Agents create entities and edges via memory tools.
+export class KnowledgeGraph {
+    db;
+    constructor(db) {
+        this.db = db;
+    }
+    // ── Entity Operations ──────────────────────────────────
+    /** Find or create an entity by name within a project (idempotent) */
+    getOrCreateEntity(projectId, name, entityType, description, bloopId) {
+        const existing = this.db.findKGEntityByName(projectId, name);
+        if (existing) {
+            // Update description if provided and entity had none
+            if (description && !existing.description) {
+                this.db.updateKGEntity(existing.id, { description });
+                return { ...existing, description };
+            }
+            return existing;
+        }
+        const now = new Date().toISOString();
+        const entity = {
+            id: uuid(),
+            projectId,
+            name,
+            entityType,
+            description: description ?? null,
+            properties: {},
+            sourceBloopId: bloopId ?? null,
+            sourceMemoryId: null,
+            createdAt: now,
+            updatedAt: now,
+        };
+        this.db.createKGEntity(entity);
+        return entity;
+    }
+    getEntity(id) {
+        return this.db.getKGEntity(id);
+    }
+    findByName(projectId, name) {
+        return this.db.findKGEntityByName(projectId, name);
+    }
+    listEntities(projectId, type) {
+        return this.db.listKGEntities(projectId, type);
+    }
+    searchEntities(projectId, query) {
+        return this.db.searchKGEntities(projectId, query);
+    }
+    // ── Edge Operations ────────────────────────────────────
+    createEdge(projectId, sourceId, targetId, edgeType, weight = 1.0, bloopId, properties = {}) {
+        const edge = {
+            id: uuid(),
+            projectId,
+            sourceId,
+            targetId,
+            edgeType,
+            weight,
+            properties,
+            sourceBloopId: bloopId ?? null,
+            createdAt: new Date().toISOString(),
+        };
+        this.db.createKGEdge(edge);
+        return edge;
+    }
+    getEdgesFrom(entityId) {
+        return this.db.getKGEdgesFrom(entityId);
+    }
+    getEdgesTo(entityId) {
+        return this.db.getKGEdgesTo(entityId);
+    }
+    // ── Graph Traversal ────────────────────────────────────
+    /** BFS traversal to find neighbors up to a given depth */
+    getNeighbors(entityId, depth = 2, edgeTypes) {
+        const maxDepth = Math.min(depth, 4); // Cap to prevent runaway queries
+        const visited = new Set([entityId]);
+        let frontier = [entityId];
+        for (let d = 0; d < maxDepth && frontier.length > 0; d++) {
+            const nextFrontier = [];
+            for (const nodeId of frontier) {
+                const edges = this.db.getKGEdgesBoth(nodeId);
+                for (const edge of edges) {
+                    if (edgeTypes && !edgeTypes.includes(edge.edgeType))
+                        continue;
+                    const neighborId = edge.sourceId === nodeId ? edge.targetId : edge.sourceId;
+                    if (!visited.has(neighborId)) {
+                        visited.add(neighborId);
+                        nextFrontier.push(neighborId);
+                    }
+                }
+            }
+            frontier = nextFrontier;
+        }
+        // Remove the starting entity from results
+        visited.delete(entityId);
+        return Array.from(visited)
+            .map((id) => this.db.getKGEntity(id))
+            .filter((e) => e !== null);
+    }
+    // ── Entity-Memory Linking ──────────────────────────────
+    linkEntityToMemory(entityId, memoryId) {
+        this.db.createKGEntityMemoryLink(entityId, memoryId);
+    }
+    getMemoriesForEntity(entityId) {
+        const memoryIds = this.db.getKGEntityMemoryIds(entityId);
+        return memoryIds
+            .map((id) => this.db.getMemoryEntry(id))
+            .filter((m) => m !== null);
+    }
+    getEntitiesForMemory(memoryId) {
+        const entityIds = this.db.getKGMemoryEntityIds(memoryId);
+        return entityIds
+            .map((id) => this.db.getKGEntity(id))
+            .filter((e) => e !== null);
+    }
+}
+//# sourceMappingURL=knowledge-graph.js.map