@nxuss/lemma 0.9.2 → 1.0.0

package/dist/cjs/subconscious/TheBrainV2.d.ts

@@ -0,0 +1,102 @@
+/**
+ * TheBrainV2 — Zero-dependency semantic memory engine for Lemma.
+ *
+ * Replaces: Ollama (embeddings) + ChromaDB (vector store)
+ * Algorithm: BM25 (Okapi) + Inverted Index + Bloom Filter + Jaccard re-rank
+ * Storage:   ~/.lemma-cache/brain/ (NDJSON, no external DB)
+ * Latency:   <10ms per query (vs ~200ms with Ollama)
+ *
+ * Compatible with: Claude CLI, Codex, OpenCode, Cursor, Windsurf, Kiro,
+ *                  Cline, VS Code Copilot — any MCP client.
+ */
+export interface BrainEntry {
+    id: string;
+    query: string;
+    response: string;
+    terms: string[];
+    termFreq: Record<string, number>;
+    provider: string;
+    timestamp: string;
+    hits: number;
+    charCount: number;
+}
+export interface BrainSearchResult {
+    id: string;
+    query: string;
+    response: string;
+    similarity: number;
+    provider: string;
+    timestamp: string;
+}
+export interface BrainStats {
+    totalEntries: number;
+    totalTerms: number;
+    avgDocLength: number;
+    bloomFilterSize: number;
+    cacheHits: number;
+    cacheMisses: number;
+}
+/**
+ * Tokenize text into stemmed, filtered terms.
+ * Handles: camelCase splitting, snake_case, stop-word removal, n-grams.
+ */
+export declare function tokenize(text: string): string[];
+/**
+ * Compute term frequencies for a token list.
+ */
+export declare function termFrequencies(terms: string[]): Record<string, number>;
+export declare class BloomFilter {
+    private bits;
+    constructor(serialized?: string);
+    add(item: string): void;
+    has(item: string): boolean;
+    serialize(): string;
+}
+export declare function bm25Score(queryTerms: string[], docTermFreq: Record<string, number>, docLength: number, avgDocLength: number, idf: Record<string, number>): number;
+/**
+ * Jaccard similarity between two term sets.
+ */
+export declare function jaccardSimilarity(setA: Set<string>, setB: Set<string>): number;
+export declare class TheBrainV2 {
+    private entries;
+    private invertedIndex;
+    private bloom;
+    private avgDocLength;
+    private sessionHits;
+    private sessionMisses;
+    private dirty;
+    private flushTimer;
+    constructor();
+    private ensureDir;
+    private load;
+    private recalcAvgDocLength;
+    private scheduleSave;
+    private save;
+    /**
+     * Store a query+response pair in the brain.
+     * Returns false if detected as duplicate (>= dupThreshold similarity).
+     */
+    store(query: string, response: string, provider?: string, dupThreshold?: number): {
+        stored: boolean;
+        reason: string;
+        duplicate?: BrainSearchResult;
+    };
+    /**
+     * Search brain using BM25 + Jaccard re-ranking.
+     * Returns results with similarity scores normalized to 0-1.
+     */
+    search(query: string, limit?: number, minSimilarity?: number): BrainSearchResult[];
+    /**
+     * Check if a query is likely a duplicate before storing.
+     * Uses bloom filter for O(1) fast-path.
+     */
+    checkDuplicate(query: string, response: string, threshold?: number): {
+        isDuplicate: boolean;
+        similarity: number;
+        existing?: BrainSearchResult;
+    };
+    getStats(): BrainStats;
+    clear(): void;
+}
+export declare function getBrain(): TheBrainV2;
+//# sourceMappingURL=TheBrainV2.d.ts.map

package/dist/cjs/subconscious/TheBrainV2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"TheBrainV2.d.ts","sourceRoot":"","sources":["../../../src/subconscious/TheBrainV2.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AASH,MAAM,WAAW,UAAU;IACzB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,iBAAiB;IAChC,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,UAAU;IACzB,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;IACnB,YAAY,EAAE,MAAM,CAAC;IACrB,eAAe,EAAE,MAAM,CAAC;IACxB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAgBD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAgC/C;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAMvE;AAgBD,qBAAa,WAAW;IACtB,OAAO,CAAC,IAAI,CAAa;gBAEb,UAAU,CAAC,EAAE,MAAM;IAQ/B,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IAOvB,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAQ1B,SAAS,IAAI,MAAM;CAGpB;AAID,wBAAgB,SAAS,CACvB,UAAU,EAAE,MAAM,EAAE,EACpB,WAAW,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EACnC,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,MAAM,EACpB,GAAG,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,GAC1B,MAAM,CAWR;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,MAAM,CAO9E;AAID,qBAAa,UAAU;IACrB,OAAO,CAAC,OAAO,CAAsC;IACrD,OAAO,CAAC,aAAa,CAAuC;IAC5D,OAAO,CAAC,KAAK,CAAkC;IAC/C,OAAO,CAAC,YAAY,CAAK;IACzB,OAAO,CAAC,WAAW,CAAK;IACxB,OAAO,CAAC,aAAa,CAAK;IAC1B,OAAO,CAAC,KAAK,CAAS;IACtB,OAAO,CAAC,UAAU,CAA8C;;IAShE,OAAO,CAAC,SAAS;IAMjB,OAAO,CAAC,IAAI;IAuCZ,OAAO,CAAC,kBAAkB;IAM1B,OAAO,CAAC,YAAY;IASpB,OAAO,CAAC,IAAI;IA+BZ;;;OAGG;IACH,KAAK,CACH,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,QAAQ,SAAY,EACpB,YAAY,SAAO,GAClB;QAAE,MAAM,EAAE,OAAO,CAAC;QAAC,MAAM,EAAE,MAAM,CAAC;QAAC,SAAS,CAAC,EAAE,iBAAiB,CAAA;KAAE;IAwDrE;;;OAGG;IACH,MAAM,CACJ,KAAK,EAAE,MAAM,EACb,KAAK,SAAI,EACT,aAAa,SAAI,GAChB,iBAAiB,EAAE;IAqGtB;;;OAGG;IACH,cAAc,CACZ,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,SAAS,SAAO,GACf;QAAE,WAAW,EAAE,OAAO,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,iBAAiB,CAAA;KAAE;IA4B7E,QAAQ,IAAI,UAAU;IAWtB,KAAK,IAAI,IAAI;CAad;AAMD,wBAAgB,QAAQ,IAAI,UAAU,CAGrC"}

package/dist/cjs/subconscious/TheBrainV2.js

@@ -0,0 +1,444 @@
+"use strict";
+/**
+ * TheBrainV2 — Zero-dependency semantic memory engine for Lemma.
+ *
+ * Replaces: Ollama (embeddings) + ChromaDB (vector store)
+ * Algorithm: BM25 (Okapi) + Inverted Index + Bloom Filter + Jaccard re-rank
+ * Storage:   ~/.lemma-cache/brain/ (NDJSON, no external DB)
+ * Latency:   <10ms per query (vs ~200ms with Ollama)
+ *
+ * Compatible with: Claude CLI, Codex, OpenCode, Cursor, Windsurf, Kiro,
+ *                  Cline, VS Code Copilot — any MCP client.
+ */
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.TheBrainV2 = exports.BloomFilter = void 0;
+exports.tokenize = tokenize;
+exports.termFrequencies = termFrequencies;
+exports.bm25Score = bm25Score;
+exports.jaccardSimilarity = jaccardSimilarity;
+exports.getBrain = getBrain;
+const fs_1 = __importDefault(require("fs"));
+const path_1 = __importDefault(require("path"));
+const os_1 = __importDefault(require("os"));
+const crypto_1 = __importDefault(require("crypto"));
+// ─── BM25 Constants ───────────────────────────────────────────────────────────
+const BM25_K1 = 1.5; // Term saturation (1.2-2.0)
+const BM25_B = 0.75; // Length normalization (0-1)
+// ─── Storage Paths ────────────────────────────────────────────────────────────
+const BRAIN_DIR = path_1.default.join(os_1.default.homedir(), '.lemma-cache', 'brain');
+const ENTRIES_FILE = path_1.default.join(BRAIN_DIR, 'entries.ndjson');
+const INDEX_FILE = path_1.default.join(BRAIN_DIR, 'index.json');
+const META_FILE = path_1.default.join(BRAIN_DIR, 'meta.json');
+// ─── Tokenizer ────────────────────────────────────────────────────────────────
+/**
+ * Tokenize text into stemmed, filtered terms.
+ * Handles: camelCase splitting, snake_case, stop-word removal, n-grams.
+ */
+function tokenize(text) {
+    // 1. Split camelCase and PascalCase → "AuthService" → "auth service"
+    let normalized = text.replace(/([a-z])([A-Z])/g, '$1 $2');
+    // 2. Split snake_case and kebab-case
+    normalized = normalized.replace(/[_\-]/g, ' ');
+    // 3. Remove punctuation, keep alphanumerics
+    normalized = normalized.replace(/[^\w\s]/g, ' ');
+    // 4. Lowercase
+    normalized = normalized.toLowerCase();
+    const STOP_WORDS = new Set([
+        'the', 'a', 'an', 'is', 'in', 'it', 'of', 'to', 'and', 'or', 'for', 'with',
+        'this', 'that', 'these', 'those', 'are', 'was', 'were', 'be', 'been', 'being',
+        'have', 'has', 'had', 'do', 'does', 'did', 'will', 'would', 'could', 'should',
+        'may', 'might', 'shall', 'can', 'need', 'must', 'from', 'by', 'at', 'on', 'up',
+        'if', 'as', 'so', 'but', 'not', 'no', 'nor', 'yet', 'both', 'either', 'neither',
+        'than', 'then', 'when', 'where', 'which', 'who', 'how', 'what', 'why', 'all',
+        'any', 'each', 'few', 'more', 'most', 'other', 'some', 'such', 'into', 'onto',
+        'off', 'out', 'over', 'under', 'again', 'further', 'once', 'here', 'there',
+    ]);
+    const terms = normalized
+        .split(/\s+/)
+        .filter(t => t.length >= 2 && !STOP_WORDS.has(t));
+    // 5. Add bigrams for better phrase matching
+    const bigrams = [];
+    for (let i = 0; i < terms.length - 1; i++) {
+        bigrams.push(`${terms[i]}_${terms[i + 1]}`);
+    }
+    return [...new Set([...terms, ...bigrams])];
+}
+/**
+ * Compute term frequencies for a token list.
+ */
+function termFrequencies(terms) {
+    const freq = {};
+    for (const t of terms) {
+        freq[t] = (freq[t] || 0) + 1;
+    }
+    return freq;
+}
+// ─── Bloom Filter (pure bit-array, no deps) ──────────────────────────────────
+const BLOOM_SIZE = 1 << 18; // 256K bits = 32KB
+const BLOOM_HASHES = 5;
+function bloomHash(item, seed) {
+    let h = seed ^ 0xdeadbeef;
+    for (let i = 0; i < item.length; i++) {
+        h = Math.imul(h ^ item.charCodeAt(i), 0x9e3779b9);
+        h ^= h >>> 16;
+    }
+    return (h >>> 0) % BLOOM_SIZE;
+}
+class BloomFilter {
+    constructor(serialized) {
+        this.bits = new Uint8Array(BLOOM_SIZE >> 3);
+        if (serialized) {
+            const buf = Buffer.from(serialized, 'base64');
+            this.bits.set(buf);
+        }
+    }
+    add(item) {
+        for (let i = 0; i < BLOOM_HASHES; i++) {
+            const pos = bloomHash(item, i * 0x5f3759df);
+            this.bits[pos >> 3] |= (1 << (pos & 7));
+        }
+    }
+    has(item) {
+        for (let i = 0; i < BLOOM_HASHES; i++) {
+            const pos = bloomHash(item, i * 0x5f3759df);
+            if (!(this.bits[pos >> 3] & (1 << (pos & 7))))
+                return false;
+        }
+        return true;
+    }
+    serialize() {
+        return Buffer.from(this.bits).toString('base64');
+    }
+}
+exports.BloomFilter = BloomFilter;
+// ─── BM25 Scorer ─────────────────────────────────────────────────────────────
+function bm25Score(queryTerms, docTermFreq, docLength, avgDocLength, idf) {
+    let score = 0;
+    for (const term of queryTerms) {
+        if (!(term in docTermFreq))
+            continue;
+        const tf = docTermFreq[term];
+        const termIdf = idf[term] || 0;
+        const numerator = tf * (BM25_K1 + 1);
+        const denominator = tf + BM25_K1 * (1 - BM25_B + BM25_B * (docLength / avgDocLength));
+        score += termIdf * (numerator / denominator);
+    }
+    return score;
+}
+/**
+ * Jaccard similarity between two term sets.
+ */
+function jaccardSimilarity(setA, setB) {
+    if (setA.size === 0 && setB.size === 0)
+        return 1;
+    let intersection = 0;
+    for (const t of setA) {
+        if (setB.has(t))
+            intersection++;
+    }
+    return intersection / (setA.size + setB.size - intersection);
+}
+// ─── TheBrainV2 ──────────────────────────────────────────────────────────────
+class TheBrainV2 {
+    // ─── Initialization ───────────────────────────────────────────────────────
+    constructor() {
+        this.entries = new Map();
+        this.invertedIndex = new Map(); // term → entry IDs
+        this.bloom = new BloomFilter();
+        this.avgDocLength = 0;
+        this.sessionHits = 0;
+        this.sessionMisses = 0;
+        this.dirty = false;
+        this.flushTimer = null;
+        this.ensureDir();
+        this.load();
+    }
+    ensureDir() {
+        if (!fs_1.default.existsSync(BRAIN_DIR)) {
+            fs_1.default.mkdirSync(BRAIN_DIR, { recursive: true });
+        }
+    }
+    load() {
+        try {
+            // Load entries from NDJSON
+            if (fs_1.default.existsSync(ENTRIES_FILE)) {
+                const lines = fs_1.default.readFileSync(ENTRIES_FILE, 'utf8').split('\n').filter(Boolean);
+                for (const line of lines) {
+                    try {
+                        const entry = JSON.parse(line);
+                        this.entries.set(entry.id, entry);
+                    }
+                    catch { /* skip corrupt lines */ }
+                }
+            }
+            // Load inverted index
+            if (fs_1.default.existsSync(INDEX_FILE)) {
+                const raw = JSON.parse(fs_1.default.readFileSync(INDEX_FILE, 'utf8'));
+                for (const [term, ids] of Object.entries(raw)) {
+                    this.invertedIndex.set(term, new Set(ids));
+                }
+            }
+            // Load bloom filter and meta
+            if (fs_1.default.existsSync(META_FILE)) {
+                const meta = JSON.parse(fs_1.default.readFileSync(META_FILE, 'utf8'));
+                if (meta.bloom) {
+                    this.bloom = new BloomFilter(meta.bloom);
+                }
+                this.avgDocLength = meta.avgDocLength || 0;
+            }
+            this.recalcAvgDocLength();
+        }
+        catch (err) {
+            // Brain is empty or corrupt — start fresh
+            this.entries.clear();
+            this.invertedIndex.clear();
+            this.bloom = new BloomFilter();
+        }
+    }
+    recalcAvgDocLength() {
+        if (this.entries.size === 0) {
+            this.avgDocLength = 0;
+            return;
+        }
+        const total = Array.from(this.entries.values()).reduce((s, e) => s + e.terms.length, 0);
+        this.avgDocLength = total / this.entries.size;
+    }
+    scheduleSave() {
+        this.dirty = true;
+        if (this.flushTimer)
+            return;
+        this.flushTimer = setTimeout(() => {
+            this.flushTimer = null;
+            if (this.dirty)
+                this.save();
+        }, 500);
+    }
+    save() {
+        try {
+            this.ensureDir();
+            // Write NDJSON entries
+            const ndjson = Array.from(this.entries.values())
+                .map(e => JSON.stringify(e))
+                .join('\n');
+            fs_1.default.writeFileSync(ENTRIES_FILE, ndjson, 'utf8');
+            // Write inverted index
+            const indexObj = {};
+            for (const [term, ids] of this.invertedIndex) {
+                indexObj[term] = Array.from(ids);
+            }
+            fs_1.default.writeFileSync(INDEX_FILE, JSON.stringify(indexObj), 'utf8');
+            // Write meta
+            fs_1.default.writeFileSync(META_FILE, JSON.stringify({
+                bloom: this.bloom.serialize(),
+                avgDocLength: this.avgDocLength,
+                totalEntries: this.entries.size,
+                savedAt: new Date().toISOString(),
+            }), 'utf8');
+            this.dirty = false;
+        }
+        catch { /* fail silently */ }
+    }
+    // ─── Store ────────────────────────────────────────────────────────────────
+    /**
+     * Store a query+response pair in the brain.
+     * Returns false if detected as duplicate (>= dupThreshold similarity).
+     */
+    store(query, response, provider = 'generic', dupThreshold = 0.92) {
+        // Quick bloom check
+        const queryKey = query.trim().toLowerCase().substring(0, 200);
+        if (this.bloom.has(queryKey)) {
+            // Possible duplicate — run full search
+            const existing = this.search(query, 1, dupThreshold);
+            if (existing.length > 0 && existing[0].similarity >= dupThreshold) {
+                return {
+                    stored: false,
+                    reason: `Duplicate detected (${(existing[0].similarity * 100).toFixed(1)}% similar)`,
+                    duplicate: existing[0],
+                };
+            }
+        }
+        const terms = tokenize(query + ' ' + response);
+        const termFreq = termFrequencies(terms);
+        const id = crypto_1.default
+            .createHash('sha1')
+            .update(queryKey + Date.now())
+            .digest('hex')
+            .substring(0, 12);
+        const entry = {
+            id,
+            query: query.trim(),
+            response: response.trim(),
+            terms: [...new Set(terms)],
+            termFreq,
+            provider,
+            timestamp: new Date().toISOString(),
+            hits: 0,
+            charCount: query.length + response.length,
+        };
+        this.entries.set(id, entry);
+        // Update inverted index
+        for (const term of entry.terms) {
+            if (!this.invertedIndex.has(term)) {
+                this.invertedIndex.set(term, new Set());
+            }
+            this.invertedIndex.get(term).add(id);
+        }
+        // Update bloom
+        this.bloom.add(queryKey);
+        this.recalcAvgDocLength();
+        this.scheduleSave();
+        return { stored: true, reason: 'Stored successfully' };
+    }
+    // ─── Search ───────────────────────────────────────────────────────────────
+    /**
+     * Search brain using BM25 + Jaccard re-ranking.
+     * Returns results with similarity scores normalized to 0-1.
+     */
+    search(query, limit = 5, minSimilarity = 0) {
+        if (this.entries.size === 0) {
+            this.sessionMisses++;
+            return [];
+        }
+        const queryTerms = tokenize(query);
+        const queryTermSet = new Set(queryTerms);
+        if (queryTerms.length === 0) {
+            this.sessionMisses++;
+            return [];
+        }
+        // 1. Compute IDF for query terms
+        const N = this.entries.size;
+        const idf = {};
+        for (const term of queryTerms) {
+            const df = this.invertedIndex.get(term)?.size ?? 0;
+            idf[term] = df > 0 ? Math.log((N - df + 0.5) / (df + 0.5) + 1) : 0;
+        }
+        // 2. Candidate retrieval via inverted index (only docs containing at least 1 query term)
+        const candidateIds = new Set();
+        for (const term of queryTerms) {
+            const ids = this.invertedIndex.get(term);
+            if (ids) {
+                for (const id of ids)
+                    candidateIds.add(id);
+            }
+        }
+        if (candidateIds.size === 0) {
+            this.sessionMisses++;
+            return [];
+        }
+        // 3. Score candidates with BM25
+        const scored = [];
+        for (const id of candidateIds) {
+            const entry = this.entries.get(id);
+            if (!entry)
+                continue;
+            const bm25 = bm25Score(queryTerms, entry.termFreq, entry.terms.length, this.avgDocLength || 10, idf);
+            const docTermSet = new Set(entry.terms);
+            const jaccard = jaccardSimilarity(queryTermSet, docTermSet);
+            scored.push({ entry, bm25, jaccard });
+        }
+        if (scored.length === 0) {
+            this.sessionMisses++;
+            return [];
+        }
+        // 4. Normalize BM25 to 0-1 range
+        const maxBm25 = Math.max(...scored.map(s => s.bm25), 1);
+        // 5. Combined score: 70% BM25 + 30% Jaccard
+        const combined = scored.map(s => ({
+            entry: s.entry,
+            similarity: (s.bm25 / maxBm25) * 0.7 + s.jaccard * 0.3,
+        }));
+        // 6. Sort and filter
+        combined.sort((a, b) => b.similarity - a.similarity);
+        const results = combined
+            .filter(r => r.similarity >= minSimilarity)
+            .slice(0, limit)
+            .map(r => ({
+            id: r.entry.id,
+            query: r.entry.query,
+            response: r.entry.response,
+            similarity: Math.min(r.similarity, 1),
+            provider: r.entry.provider,
+            timestamp: r.entry.timestamp,
+        }));
+        // 7. Update hit counters
+        if (results.length > 0) {
+            this.sessionHits++;
+            // Increment hit counter on top result (LRU-style freshness)
+            const topEntry = this.entries.get(results[0].id);
+            if (topEntry) {
+                topEntry.hits++;
+                this.scheduleSave();
+            }
+        }
+        else {
+            this.sessionMisses++;
+        }
+        return results;
+    }
+    // ─── Dedup Check ─────────────────────────────────────────────────────────
+    /**
+     * Check if a query is likely a duplicate before storing.
+     * Uses bloom filter for O(1) fast-path.
+     */
+    checkDuplicate(query, response, threshold = 0.92) {
+        const queryKey = query.trim().toLowerCase().substring(0, 200);
+        // Fast path: bloom filter says no → definitely not a duplicate
+        if (!this.bloom.has(queryKey)) {
+            return { isDuplicate: false, similarity: 0 };
+        }
+        // Slow path: full BM25 search to confirm
+        const results = this.search(query, 1, 0);
+        if (results.length === 0) {
+            return { isDuplicate: false, similarity: 0 };
+        }
+        const top = results[0];
+        let sim = top.similarity;
+        if (top.query.trim().toLowerCase() === query.trim().toLowerCase()) {
+            sim = 1.0;
+        }
+        if (sim >= threshold) {
+            return { isDuplicate: true, similarity: sim, existing: top };
+        }
+        return { isDuplicate: false, similarity: sim };
+    }
+    // ─── Stats ────────────────────────────────────────────────────────────────
+    getStats() {
+        return {
+            totalEntries: this.entries.size,
+            totalTerms: this.invertedIndex.size,
+            avgDocLength: Math.round(this.avgDocLength),
+            bloomFilterSize: BLOOM_SIZE,
+            cacheHits: this.sessionHits,
+            cacheMisses: this.sessionMisses,
+        };
+    }
+    clear() {
+        this.entries.clear();
+        this.invertedIndex.clear();
+        this.bloom = new BloomFilter();
+        this.avgDocLength = 0;
+        this.sessionHits = 0;
+        this.sessionMisses = 0;
+        try {
+            if (fs_1.default.existsSync(ENTRIES_FILE))
+                fs_1.default.unlinkSync(ENTRIES_FILE);
+            if (fs_1.default.existsSync(INDEX_FILE))
+                fs_1.default.unlinkSync(INDEX_FILE);
+            if (fs_1.default.existsSync(META_FILE))
+                fs_1.default.unlinkSync(META_FILE);
+        }
+        catch { /* ignore */ }
+    }
+}
+exports.TheBrainV2 = TheBrainV2;
+// ─── Global singleton ────────────────────────────────────────────────────────
+let _brain = null;
+function getBrain() {
+    if (!_brain)
+        _brain = new TheBrainV2();
+    return _brain;
+}
+//# sourceMappingURL=TheBrainV2.js.map

package/dist/cjs/subconscious/TheBrainV2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TheBrainV2.js","sourceRoot":"","sources":["../../../src/subconscious/TheBrainV2.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;;;;AAyDH,4BAgCC;AAKD,0CAMC;AAiDD,8BAiBC;AAKD,8CAOC;AAgWD,4BAGC;AAnhBD,4CAAoB;AACpB,gDAAwB;AACxB,4CAAoB;AACpB,oDAA4B;AAkC5B,iFAAiF;AAEjF,MAAM,OAAO,GAAG,GAAG,CAAC,CAAE,4BAA4B;AAClD,MAAM,MAAM,GAAI,IAAI,CAAC,CAAC,6BAA6B;AAEnD,iFAAiF;AAEjF,MAAM,SAAS,GAAM,cAAI,CAAC,IAAI,CAAC,YAAE,CAAC,OAAO,EAAE,EAAE,cAAc,EAAE,OAAO,CAAC,CAAC;AACtE,MAAM,YAAY,GAAG,cAAI,CAAC,IAAI,CAAC,SAAS,EAAE,gBAAgB,CAAC,CAAC;AAC5D,MAAM,UAAU,GAAK,cAAI,CAAC,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;AACxD,MAAM,SAAS,GAAM,cAAI,CAAC,IAAI,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;AAEvD,iFAAiF;AAEjF;;;GAGG;AACH,SAAgB,QAAQ,CAAC,IAAY;IACnC,qEAAqE;IACrE,IAAI,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,OAAO,CAAC,CAAC;IAC1D,qCAAqC;IACrC,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAC/C,4CAA4C;IAC5C,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC;IACjD,eAAe;IACf,UAAU,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;IAEtC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;QACzB,KAAK,EAAC,GAAG,EAAC,IAAI,EAAC,IAAI,EAAC,IAAI,EAAC,IAAI,EAAC,IAAI,EAAC,IAAI,EAAC,KAAK,EAAC,IAAI,EAAC,KAAK,EAAC,MAAM;QAC/D,MAAM,EAAC,MAAM,EAAC,OAAO,EAAC,OAAO,EAAC,KAAK,EAAC,KAAK,EAAC,MAAM,EAAC,IAAI,EAAC,MAAM,EAAC,OAAO;QACpE,MAAM,EAAC,KAAK,EAAC,KAAK,EAAC,IAAI,EAAC,MAAM,EAAC,KAAK,EAAC,MAAM,EAAC,OAAO,EAAC,OAAO,EAAC,QAAQ;QACpE,KAAK,EAAC,OAAO,EAAC,OAAO,EAAC,KAAK,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,IAAI,EAAC,IAAI,EAAC,IAAI,EAAC,IAAI;QACpE,IAAI,EAAC,IAAI,EAAC,IAAI,EAAC,KAAK,EAAC,KAAK,EAAC,IAAI,EAAC,KAAK,EAAC,KAAK,EAAC,MAAM,EAAC,QAAQ,EAAC,SAAS;QACrE,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,OAAO,EAAC,OAAO,EAAC,KAAK,EAAC,KAAK,EAAC,MAAM,EAAC,KAAK,EAAC,KAAK;QACnE,KAAK,EAAC,MAAM,EAAC,KAAK,EAAC,MAAM,EAAC,MAAM,EAAC,OAAO,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM,EAAC,MAAM;QACpE,KAAK,EAAC,KAAK,EAAC,MAAM,EAAC,OAAO,EAAC,OAAO,EAAC,SAAS,EAAC,MAAM,EAAC,MAAM,EAAC,OAAO;KACnE,CAAC,CAAC;IAEH,MAAM,KAAK,GAAG,UAAU;SACrB,KAAK,CAAC,KAAK,CAAC;SACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEpD,4CAA4C;IAC5C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe,CAAC,KAAe;IAC7C,MAAM,IAAI,GAA2B,EAAE,CAAC;IACxC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,gFAAgF;AAEhF,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,mBAAmB;AAC/C,MAAM,YAAY,GAAG,CAAC,CAAC;AAEvB,SAAS,SAAS,CAAC,IAAY,EAAE,IAAY;IAC3C,IAAI,CAAC,GAAG,IAAI,GAAG,UAAU,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;QAClD,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IAChB,CAAC;IACD,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC;AAChC,CAAC;AAED,MAAa,WAAW;IAGtB,YAAY,UAAmB;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,UAAU,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC;QAC5C,IAAI,UAAU,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;YAC9C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IAED,GAAG,CAAC,IAAY;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;YAC5C,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,GAAG,CAAC,IAAY;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;YAC5C,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC9D,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS;QACP,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;IACnD,CAAC;CACF;AA7BD,kCA6BC;AAED,gFAAgF;AAEhF,SAAgB,SAAS,CACvB,UAAoB,EACpB,WAAmC,EACnC,SAAiB,EACjB,YAAoB,EACpB,GAA2B;IAE3B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,IAAI,CAAC,CAAC,IAAI,IAAI,WAAW,CAAC;YAAE,SAAS;QACrC,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,SAAS,GAAG,EAAE,GAAG,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,WAAW,GAAG,EAAE,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,MAAM,GAAG,MAAM,GAAG,CAAC,SAAS,GAAG,YAAY,CAAC,CAAC,CAAC;QACtF,KAAK,IAAI,OAAO,GAAG,CAAC,SAAS,GAAG,WAAW,CAAC,CAAC;IAC/C,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAgB,iBAAiB,CAAC,IAAiB,EAAE,IAAiB;IACpE,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,EAAE,CAAC;IAClC,CAAC;IACD,OAAO,YAAY,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC,CAAC;AAC/D,CAAC;AAED,gFAAgF;AAEhF,MAAa,UAAU;IAUrB,6EAA6E;IAE7E;QAXQ,YAAO,GAA4B,IAAI,GAAG,EAAE,CAAC;QAC7C,kBAAa,GAA6B,IAAI,GAAG,EAAE,CAAC,CAAC,mBAAmB;QACxE,UAAK,GAAgB,IAAI,WAAW,EAAE,CAAC;QACvC,iBAAY,GAAG,CAAC,CAAC;QACjB,gBAAW,GAAG,CAAC,CAAC;QAChB,kBAAa,GAAG,CAAC,CAAC;QAClB,UAAK,GAAG,KAAK,CAAC;QACd,eAAU,GAAyC,IAAI,CAAC;QAK9D,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAEO,SAAS;QACf,IAAI,CAAC,YAAE,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;YAC9B,YAAE,CAAC,SAAS,CAAC,SAAS,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC/C,CAAC;IACH,CAAC;IAEO,IAAI;QACV,IAAI,CAAC;YACH,2BAA2B;YAC3B,IAAI,YAAE,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;gBAChC,MAAM,KAAK,GAAG,YAAE,CAAC,YAAY,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBAChF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,IAAI,CAAC;wBACH,MAAM,KAAK,GAAe,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;wBAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;oBACpC,CAAC;oBAAC,MAAM,CAAC,CAAC,wBAAwB,CAAC,CAAC;gBACtC,CAAC;YACH,CAAC;YAED,sBAAsB;YACtB,IAAI,YAAE,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,YAAE,CAAC,YAAY,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC;gBAC5D,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC9C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,GAAe,CAAC,CAAC,CAAC;gBACzD,CAAC;YACH,CAAC;YAED,6BAA6B;YAC7B,IAAI,YAAE,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,YAAE,CAAC,YAAY,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC;gBAC5D,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBACf,IAAI,CAAC,KAAK,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3C,CAAC;gBACD,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC;YAC7C,CAAC;YAED,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC5B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,0CAA0C;YAC1C,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACrB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;YAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QACjC,CAAC;IACH,CAAC;IAEO,kBAAkB;QACxB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAAC,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;YAAC,OAAO;QAAC,CAAC;QAC/D,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACxF,IAAI,CAAC,YAAY,GAAG,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAChD,CAAC;IAEO,YAAY;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,IAAI,CAAC,UAAU;YAAE,OAAO;QAC5B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,GAAG,EAAE;YAChC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,IAAI,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,IAAI,EAAE,CAAC;QAC9B,CAAC,EAAE,GAAG,CAAC,CAAC;IACV,CAAC;IAEO,IAAI;QACV,IAAI,CAAC;YACH,IAAI,CAAC,SAAS,EAAE,CAAC;YAEjB,uBAAuB;YACvB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;iBAC7C,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;iBAC3B,IAAI,CAAC,IAAI,CAAC,CAAC;YACd,YAAE,CAAC,aAAa,CAAC,YAAY,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YAE/C,uBAAuB;YACvB,MAAM,QAAQ,GAA6B,EAAE,CAAC;YAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;gBAC7C,QAAQ,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnC,CAAC;YACD,YAAE,CAAC,aAAa,CAAC,UAAU,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,CAAC;YAE/D,aAAa;YACb,YAAE,CAAC,aAAa,CAAC,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC;gBACzC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE;gBAC7B,YAAY,EAAE,IAAI,CAAC,YAAY;gBAC/B,YAAY,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;gBAC/B,OAAO,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aAClC,CAAC,EAAE,MAAM,CAAC,CAAC;YAEZ,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;QAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC;IACjC,CAAC;IAED,6EAA6E;IAE7E;;;OAGG;IACH,KAAK,CACH,KAAa,EACb,QAAgB,EAChB,QAAQ,GAAG,SAAS,EACpB,YAAY,GAAG,IAAI;QAEnB,oBAAoB;QACpB,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC9D,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC7B,uCAAuC;YACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;YACrD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,IAAI,YAAY,EAAE,CAAC;gBAClE,OAAO;oBACL,MAAM,EAAE,KAAK;oBACb,MAAM,EAAE,uBAAuB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY;oBACpF,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAC;iBACvB,CAAC;YACJ,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,GAAG,GAAG,GAAG,QAAQ,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,EAAE,GAAG,gBAAM;aACd,UAAU,CAAC,MAAM,CAAC;aAClB,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;aAC7B,MAAM,CAAC,KAAK,CAAC;aACb,SAAS,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAEpB,MAAM,KAAK,GAAe;YACxB,EAAE;YACF,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE;YACnB,QAAQ,EAAE,QAAQ,CAAC,IAAI,EAAE;YACzB,KAAK,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;YAC1B,QAAQ;YACR,QAAQ;YACR,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACnC,IAAI,EAAE,CAAC;YACP,SAAS,EAAE,KAAK,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM;SAC1C,CAAC;QAEF,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAE5B,wBAAwB;QACxB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC1C,CAAC;YACD,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,eAAe;QACf,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEzB,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC1B,IAAI,CAAC,YAAY,EAAE,CAAC;QAEpB,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,qBAAqB,EAAE,CAAC;IACzD,CAAC;IAED,6EAA6E;IAE7E;;;OAGG;IACH,MAAM,CACJ,KAAa,EACb,KAAK,GAAG,CAAC,EACT,aAAa,GAAG,CAAC;QAEjB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,EAAE,CAAC;YACrB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;QAEzC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,EAAE,CAAC;YACrB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,iCAAiC;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;QAC5B,MAAM,GAAG,GAA2B,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,EAAE,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YACnD,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,CAAC;QAED,yFAAyF;QACzF,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;YAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,GAAG,EAAE,CAAC;gBACR,KAAK,MAAM,EAAE,IAAI,GAAG;oBAAE,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,EAAE,CAAC;YACrB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,gCAAgC;QAChC,MAAM,MAAM,GAAgE,EAAE,CAAC;QAC/E,KAAK,MAAM,EAAE,IAAI,YAAY,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,CAAC,KAAK;gBAAE,SAAS;YAErB,MAAM,IAAI,GAAG,SAAS,CACpB,UAAU,EACV,KAAK,CAAC,QAAQ,EACd,KAAK,CAAC,KAAK,CAAC,MAAM,EAClB,IAAI,CAAC,YAAY,IAAI,EAAE,EACvB,GAAG,CACJ,CAAC;YACF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACxC,MAAM,OAAO,GAAG,iBAAiB,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;YAC5D,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;QACxC,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,IAAI,CAAC,aAAa,EAAE,CAAC;YACrB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,iCAAiC;QACjC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAExD,4CAA4C;QAC5C,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAChC,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,UAAU,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,OAAO,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,OAAO,GAAG,GAAG;SACvD,CAAC,CAAC,CAAC;QAEJ,qBAAqB;QACrB,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;QAErD,MAAM,OAAO,GAAG,QAAQ;aACrB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,IAAI,aAAa,CAAC;aAC1C,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;aACf,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACT,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE;YACd,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK;YACpB,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ;YAC1B,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC;YACrC,QAAQ,EAAE,CAAC,CAAC,KAAK,CAAC,QAAQ;YAC1B,SAAS,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS;SAC7B,CAAC,CAAC,CAAC;QAEN,yBAAyB;QACzB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,4DAA4D;YAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjD,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,IAAI,EAAE,CAAC;gBAChB,IAAI,CAAC,YAAY,EAAE,CAAC;YACtB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,aAAa,EAAE,CAAC;QACvB,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,4EAA4E;IAE5E;;;OAGG;IACH,cAAc,CACZ,KAAa,EACb,QAAgB,EAChB,SAAS,GAAG,IAAI;QAEhB,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAE9D,+DAA+D;QAC/D,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9B,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QAC/C,CAAC;QAED,yCAAyC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QAC/C,CAAC;QAED,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,GAAG,GAAG,GAAG,CAAC,UAAU,CAAC;QACzB,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;YAClE,GAAG,GAAG,GAAG,CAAC;QACZ,CAAC;QACD,IAAI,GAAG,IAAI,SAAS,EAAE,CAAC;YACrB,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;QAC/D,CAAC;QAED,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;IACjD,CAAC;IAED,6EAA6E;IAE7E,QAAQ;QACN,OAAO;YACL,YAAY,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI;YAC/B,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC,IAAI;YACnC,YAAY,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC;YAC3C,eAAe,EAAE,UAAU;YAC3B,SAAS,EAAE,IAAI,CAAC,WAAW;YAC3B,WAAW,EAAE,IAAI,CAAC,aAAa;SAChC,CAAC;IACJ,CAAC;IAED,KAAK;QACH,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;QAC/B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC;YACH,IAAI,YAAE,CAAC,UAAU,CAAC,YAAY,CAAC;gBAAE,YAAE,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;YAC7D,IAAI,YAAE,CAAC,UAAU,CAAC,UAAU,CAAC;gBAAE,YAAE,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;YACzD,IAAI,YAAE,CAAC,UAAU,CAAC,SAAS,CAAC;gBAAE,YAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QACzD,CAAC;QAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;IAC1B,CAAC;CACF;AAtVD,gCAsVC;AAED,gFAAgF;AAEhF,IAAI,MAAM,GAAsB,IAAI,CAAC;AAErC,SAAgB,QAAQ;IACtB,IAAI,CAAC,MAAM;QAAE,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;IACvC,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/cjs/utils/ContextCollapser.d.ts

@@ -0,0 +1,21 @@
+/**
+ * ContextCollapser — Zero-dependency extraction summarizer for technical logs & history.
+ *
+ * Replaces: Ollama for summarize_long_text and compress_context.
+ * Algorithm: Query-Focused TF-IDF Centroid sentence extraction + Jaccard dedup.
+ * Latency:   <15ms for 100k characters.
+ */
+export interface CollapseOptions {
+    maxLength?: number;
+    query?: string;
+    ratio?: number;
+}
+/**
+ * Split text into logical blocks (sentences or log chunks).
+ */
+export declare function splitIntoSentences(text: string): string[];
+/**
+ * Summarize long text locally by selecting the most semantically dense sentences.
+ */
+export declare function collapseContext(text: string, options?: CollapseOptions): string;
+//# sourceMappingURL=ContextCollapser.d.ts.map

package/dist/cjs/utils/ContextCollapser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ContextCollapser.d.ts","sourceRoot":"","sources":["../../../src/utils/ContextCollapser.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,MAAM,WAAW,eAAe;IAC9B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAoBzD;AAcD;;GAEG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,GAAE,eAAoB,GAAG,MAAM,CAyFnF"}