squish-memory 0.7.0

package/dist/algorithms/merge/detection/hash-filters.js

@@ -0,0 +1,190 @@
+/**
+ * Hash-based duplicate detection filters (Stage 1).
+ * Uses SimHash and MinHash for fast approximate matching before semantic analysis.
+ */
+/**
+ * SimHash: Fast fingerprinting for near-duplicate detection.
+ * Tokenizes content, weights by frequency, and produces comparable hash fingerprints.
+ * Similar documents produce similar hashes with Hamming distance indicating edit distance.
+ */
+export class SimHashFilter {
+    dimensions = 64; // 64-bit hash
+    generateHash(content) {
+        if (!content || content.trim().length === 0) {
+            return '0'.repeat(16);
+        }
+        const tokens = content
+            .toLowerCase()
+            .split(/\W+/)
+            .filter((token) => token.length > 0);
+        if (tokens.length === 0) {
+            return '0'.repeat(16);
+        }
+        const tokenFreq = new Map();
+        for (const token of tokens) {
+            tokenFreq.set(token, (tokenFreq.get(token) || 0) + 1);
+        }
+        const hashBits = new Array(this.dimensions).fill(0);
+        for (const [token, freq] of tokenFreq.entries()) {
+            const tokenHash = this.hashToken(token);
+            for (let i = 0; i < this.dimensions; i++) {
+                const bitSet = (tokenHash >>> i) & 1;
+                hashBits[i] += bitSet === 1 ? freq : -freq;
+            }
+        }
+        let result = 0;
+        for (let i = 0; i < this.dimensions; i++) {
+            if (hashBits[i] > 0) {
+                result |= 1 << i;
+            }
+        }
+        return result.toString(16).padStart(16, '0');
+    }
+    hammingDistance(hash1, hash2) {
+        const num1 = BigInt('0x' + hash1);
+        const num2 = BigInt('0x' + hash2);
+        const xor = num1 ^ num2;
+        return this.popcount(xor);
+    }
+    findCandidates(targetHash, allHashes, threshold) {
+        const candidates = [];
+        for (const [memoryId, hash] of allHashes.entries()) {
+            const distance = this.hammingDistance(targetHash, hash);
+            if (distance <= threshold) {
+                candidates.push(memoryId);
+            }
+        }
+        return candidates;
+    }
+    hashToken(token) {
+        let hash = 2166136261;
+        for (let i = 0; i < token.length; i++) {
+            hash ^= token.charCodeAt(i);
+            hash = (hash * 16777619) & 0xffffffff;
+        }
+        const high = hash >>> 16;
+        const low = hash & 0xffff;
+        return (high * 65599 + low) >>> 0;
+    }
+    popcount(n) {
+        let count = 0;
+        while (n > 0n) {
+            count += Number(n & 1n);
+            n = n >> 1n;
+        }
+        return count;
+    }
+}
+/**
+ * MinHash: Estimates Jaccard similarity using character n-grams and multiple hash functions.
+ * Keeps minimum hash for each function, resulting in comparable signatures.
+ * More effective than SimHash for paraphrases. 128 functions give ~1% error margin.
+ */
+export class MinHashFilter {
+    numPermutations = 128; // Number of independent hash functions
+    ngramSize = 3; // Character n-gram size
+    generateSignature(content) {
+        if (!content || content.trim().length === 0) {
+            return new Array(this.numPermutations).fill(0);
+        }
+        const ngrams = this.generateNgrams(content.toLowerCase(), this.ngramSize);
+        if (ngrams.length === 0) {
+            return new Array(this.numPermutations).fill(0);
+        }
+        const signature = new Array(this.numPermutations).fill(Number.MAX_SAFE_INTEGER);
+        for (const ngram of ngrams) {
+            for (let i = 0; i < this.numPermutations; i++) {
+                const hashValue = this.hashNgramWithSeed(ngram, i);
+                signature[i] = Math.min(signature[i], hashValue);
+            }
+        }
+        return signature;
+    }
+    jaccardSimilarity(sig1, sig2) {
+        if (sig1.length !== sig2.length) {
+            return 0;
+        }
+        if (sig1.length === 0) {
+            return 1;
+        }
+        let matches = 0;
+        for (let i = 0; i < sig1.length; i++) {
+            if (sig1[i] === sig2[i]) {
+                matches++;
+            }
+        }
+        return matches / sig1.length;
+    }
+    findCandidates(targetSig, allSigs, threshold) {
+        const candidates = [];
+        for (const [memoryId, sig] of allSigs.entries()) {
+            const similarity = this.jaccardSimilarity(targetSig, sig);
+            if (similarity >= threshold) {
+                candidates.push(memoryId);
+            }
+        }
+        return candidates;
+    }
+    generateNgrams(content, size) {
+        const ngrams = [];
+        const padded = ' '.repeat(size - 1) + content + ' '.repeat(size - 1);
+        for (let i = 0; i <= padded.length - size; i++) {
+            ngrams.push(padded.substring(i, i + size));
+        }
+        return ngrams;
+    }
+    hashNgramWithSeed(ngram, seed) {
+        let hash = seed;
+        for (let i = 0; i < ngram.length; i++) {
+            hash = (hash << 5) - hash + ngram.charCodeAt(i);
+            hash = hash & hash;
+        }
+        return Math.abs(hash);
+    }
+}
+/**
+ * Combine SimHash and MinHash filters using union approach.
+ * Candidates pass if they match EITHER filter, casting wider net for stage 2 ranking.
+ */
+export function findCandidatePairs(memories, allSimhashes, allMinhashes, options) {
+    const simhashThreshold = options.simhashThreshold ?? 4;
+    const minhashThreshold = options.minhashThreshold ?? 0.7;
+    const simhashFilter = new SimHashFilter();
+    const minhashFilter = new MinHashFilter();
+    const candidatePairs = [];
+    const seen = new Set();
+    const memoryIds = Array.from(memories.keys());
+    for (let i = 0; i < memoryIds.length; i++) {
+        const id1 = memoryIds[i];
+        const simhash1 = allSimhashes.get(id1);
+        const minhash1 = allMinhashes.get(id1);
+        if (!simhash1 || !minhash1)
+            continue;
+        for (let j = i + 1; j < memoryIds.length; j++) {
+            const id2 = memoryIds[j];
+            const simhash2 = allSimhashes.get(id2);
+            const minhash2 = allMinhashes.get(id2);
+            if (!simhash2 || !minhash2)
+                continue;
+            const pairKey = id1 < id2 ? `${id1}:${id2}` : `${id2}:${id1}`;
+            if (seen.has(pairKey))
+                continue;
+            const simhashDist = simhashFilter.hammingDistance(simhash1, simhash2);
+            const simhashMatch = simhashDist <= simhashThreshold;
+            const minhashSim = minhashFilter.jaccardSimilarity(minhash1, minhash2);
+            const minhashMatch = minhashSim >= minhashThreshold;
+            if (simhashMatch || minhashMatch) {
+                seen.add(pairKey);
+                candidatePairs.push({
+                    memoryId1: id1,
+                    memoryId2: id2,
+                    simhashDistance: simhashDist,
+                    minhashSimilarity: minhashSim,
+                    matched: simhashMatch && minhashMatch ? 'both' : simhashMatch ? 'simhash' : 'minhash',
+                });
+            }
+        }
+    }
+    return candidatePairs;
+}
+//# sourceMappingURL=hash-filters.js.map

package/dist/algorithms/merge/detection/hash-filters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hash-filters.js","sourceRoot":"","sources":["../../../../algorithms/merge/detection/hash-filters.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;GAIG;AACH,MAAM,OAAO,aAAa;IACP,UAAU,GAAG,EAAE,CAAC,CAAC,cAAc;IAEhD,YAAY,CAAC,OAAe;QAC1B,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5C,OAAO,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;QAED,MAAM,MAAM,GAAG,OAAO;aACnB,WAAW,EAAE;aACb,KAAK,CAAC,KAAK,CAAC;aACZ,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEvC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC5C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEpD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,MAAM,MAAM,GAAG,CAAC,SAAS,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBACrC,QAAQ,CAAC,CAAC,CAAC,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC7C,CAAC;QACH,CAAC;QAED,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IAC/C,CAAC;IAED,eAAe,CAAC,KAAa,EAAE,KAAa;QAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,IAAI,GAAG,IAAI,CAAC;QACxB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,cAAc,CACZ,UAAkB,EAClB,SAA8B,EAC9B,SAAiB;QAEjB,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,KAAK,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YACxD,IAAI,QAAQ,IAAI,SAAS,EAAE,CAAC;gBAC1B,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,SAAS,CAAC,KAAa;QAC7B,IAAI,IAAI,GAAG,UAAU,CAAC;QAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,IAAI,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC5B,IAAI,GAAG,CAAC,IAAI,GAAG,QAAQ,CAAC,GAAG,UAAU,CAAC;QACxC,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC;QAC1B,OAAO,CAAC,IAAI,GAAG,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IAEO,QAAQ,CAAC,CAAS;QACxB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC;YACd,KAAK,IAAI,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YACxB,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,aAAa;IACP,eAAe,GAAG,GAAG,CAAC,CAAC,uCAAuC;IAC9D,SAAS,GAAG,CAAC,CAAC,CAAC,wBAAwB;IAExD,iBAAiB,CAAC,OAAe;QAC/B,IAAI,CAAC,OAAO,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5C,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAE1E,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;QAEhF,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9C,MAAM,SAAS,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;gBACnD,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,iBAAiB,CAAC,IAAc,EAAE,IAAc;QAC9C,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxB,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,OAAO,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;IAC/B,CAAC;IAED,cAAc,CACZ,SAAmB,EACnB,OAA8B,EAC9B,SAAiB;QAEjB,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,KAAK,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;YAChD,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;YAC1D,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;gBAC5B,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAEO,cAAc,CAAC,OAAe,EAAE,IAAY;QAClD,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAErE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAC7C,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,iBAAiB,CAAC,KAAa,EAAE,IAAY;QACnD,IAAI,IAAI,GAAG,IAAI,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAChD,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;CACF;AAUD;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAChC,QAA6B,EAC7B,YAAiC,EACjC,YAAmC,EACnC,OAGC;IAED,MAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,IAAI,CAAC,CAAC;IACvD,MAAM,gBAAgB,GAAG,OAAO,CAAC,gBAAgB,IAAI,GAAG,CAAC;IAEzD,MAAM,aAAa,GAAG,IAAI,aAAa,EAAE,CAAC;IAC1C,MAAM,aAAa,GAAG,IAAI,aAAa,EAAE,CAAC;IAE1C,MAAM,cAAc,GAA0B,EAAE,CAAC;IACjD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;IAE9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAEvC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ;YAAE,SAAS;QAErC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;YACzB,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,QAAQ,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAEvC,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAErC,MAAM,OAAO,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;YAC9D,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAEhC,MAAM,WAAW,GAAG,aAAa,CAAC,eAAe,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACtE,MAAM,YAAY,GAAG,WAAW,IAAI,gBAAgB,CAAC;YAErD,MAAM,UAAU,GAAG,aAAa,CAAC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;YACvE,MAAM,YAAY,GAAG,UAAU,IAAI,gBAAgB,CAAC;YAEpD,IAAI,YAAY,IAAI,YAAY,EAAE,CAAC;gBACjC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAClB,cAAc,CAAC,IAAI,CAAC;oBAClB,SAAS,EAAE,GAAG;oBACd,SAAS,EAAE,GAAG;oBACd,eAAe,EAAE,WAAW;oBAC5B,iBAAiB,EAAE,UAAU;oBAC7B,OAAO,EAAE,YAAY,IAAI,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS;iBACtF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,cAAc,CAAC;AACxB,CAAC"}

package/dist/algorithms/merge/detection/semantic-ranker.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Semantic ranking using embeddings (Stage 2 of two-stage detection).
+ * Ranks candidates from Stage 1 by semantic similarity using cosine distance.
+ */
+import type { Memory } from '../../../drizzle/schema.js';
+export interface RankedCandidate {
+    memoryId1: string;
+    memoryId2: string;
+    memory1: Memory;
+    memory2: Memory;
+    cosineSimilarity: number;
+    confidenceLevel: 'high' | 'medium' | 'low';
+    mergeReason: string;
+}
+export declare function rankCandidates(candidates: Array<{
+    memoryId1: string;
+    memoryId2: string;
+}>, memories: Map<string, Memory>, embeddings: Map<string, number[]>, options: {
+    semanticThreshold?: number;
+    topK?: number;
+}): Promise<RankedCandidate[]>;
+export declare function analyzePair(memory1: Memory, memory2: Memory, embedding1: number[], embedding2: number[]): {
+    cosineSimilarity: number;
+    confidenceLevel: 'high' | 'medium' | 'low';
+    mergeReason: string;
+    factors: {
+        sameType: boolean;
+        tagOverlap: number;
+        contentLengthSimilarity: number;
+    };
+};
+//# sourceMappingURL=semantic-ranker.d.ts.map

package/dist/algorithms/merge/detection/semantic-ranker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-ranker.d.ts","sourceRoot":"","sources":["../../../../algorithms/merge/detection/semantic-ranker.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AAGzD,MAAM,WAAW,eAAe;IAC9B,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,gBAAgB,EAAE,MAAM,CAAC;IACzB,eAAe,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;IAC3C,WAAW,EAAE,MAAM,CAAC;CACrB;AAwFD,wBAAsB,cAAc,CAClC,UAAU,EAAE,KAAK,CAAC;IAAE,SAAS,EAAE,MAAM,CAAC;IAAC,SAAS,EAAE,MAAM,CAAA;CAAE,CAAC,EAC3D,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAC7B,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EACjC,OAAO,EAAE;IACP,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,IAAI,CAAC,EAAE,MAAM,CAAC;CACf,GACA,OAAO,CAAC,eAAe,EAAE,CAAC,CAqD5B;AAED,wBAAgB,WAAW,CACzB,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,MAAM,EAAE,EACpB,UAAU,EAAE,MAAM,EAAE,GACnB;IACD,gBAAgB,EAAE,MAAM,CAAC;IACzB,eAAe,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;IAC3C,WAAW,EAAE,MAAM,CAAC;IACpB,OAAO,EAAE;QACP,QAAQ,EAAE,OAAO,CAAC;QAClB,UAAU,EAAE,MAAM,CAAC;QACnB,uBAAuB,EAAE,MAAM,CAAC;KACjC,CAAC;CACH,CAYA"}

package/dist/algorithms/merge/detection/semantic-ranker.js

@@ -0,0 +1,118 @@
+/**
+ * Semantic ranking using embeddings (Stage 2 of two-stage detection).
+ * Ranks candidates from Stage 1 by semantic similarity using cosine distance.
+ */
+import { cosineSimilarity } from '../../../core/local-embeddings.js';
+function calculateConfidence(memory1, memory2, cosineSim) {
+    if (cosineSim >= 0.90) {
+        const factors = calculateConfidenceFactors(memory1, memory2);
+        if (factors.sameType && factors.tagOverlap > 0.5) {
+            return 'high';
+        }
+        if (factors.sameType || factors.tagOverlap > 0.3) {
+            return 'high';
+        }
+        return 'medium';
+    }
+    if (cosineSim >= 0.80) {
+        const factors = calculateConfidenceFactors(memory1, memory2);
+        if (factors.sameType && factors.contentLengthSimilarity > 0.7) {
+            return 'medium';
+        }
+        return 'medium';
+    }
+    return 'low';
+}
+function calculateConfidenceFactors(memory1, memory2) {
+    const sameType = memory1.type === memory2.type;
+    const tags1 = new Set(memory1.tags || []);
+    const tags2 = new Set(memory2.tags || []);
+    const overlap = Array.from(tags1).filter((tag) => tags2.has(tag)).length;
+    const union = new Set([...tags1, ...tags2]).size;
+    const tagOverlap = union === 0 ? 0 : overlap / union;
+    const len1 = memory1.content.length;
+    const len2 = memory2.content.length;
+    const maxLen = Math.max(len1, len2);
+    const minLen = Math.min(len1, len2);
+    const contentLengthSimilarity = maxLen === 0 ? 1 : minLen / maxLen;
+    return {
+        sameType,
+        tagOverlap,
+        contentLengthSimilarity,
+    };
+}
+function generateMergeReason(memory1, memory2, cosineSim, confidenceLevel) {
+    const factors = calculateConfidenceFactors(memory1, memory2);
+    const parts = [];
+    parts.push(`Semantic similarity: ${(cosineSim * 100).toFixed(1)}%`);
+    if (factors.sameType) {
+        parts.push(`Same type (${memory1.type})`);
+    }
+    else {
+        parts.push(`Different types (${memory1.type} vs ${memory2.type})`);
+    }
+    if (factors.tagOverlap > 0) {
+        parts.push(`${(factors.tagOverlap * 100).toFixed(0)}% tag overlap`);
+    }
+    const len1 = memory1.content.length;
+    const len2 = memory2.content.length;
+    const diffPercent = Math.abs(len1 - len2) / Math.max(len1, len2);
+    parts.push(`Content length difference: ${(diffPercent * 100).toFixed(0)}%`);
+    parts.push(`Confidence: ${confidenceLevel}`);
+    return parts.join(' • ');
+}
+export async function rankCandidates(candidates, memories, embeddings, options) {
+    const semanticThreshold = options.semanticThreshold ?? 0.85;
+    const topK = options.topK ?? 10;
+    const rankedCandidates = [];
+    for (const { memoryId1, memoryId2 } of candidates) {
+        const memory1 = memories.get(memoryId1);
+        const memory2 = memories.get(memoryId2);
+        const embedding1 = embeddings.get(memoryId1);
+        const embedding2 = embeddings.get(memoryId2);
+        if (!memory1 || !memory2 || !embedding1 || !embedding2) {
+            continue;
+        }
+        const similarity = cosineSimilarity(embedding1, embedding2);
+        if (similarity < semanticThreshold) {
+            continue;
+        }
+        const confidence = calculateConfidence(memory1, memory2, similarity);
+        const mergeReason = generateMergeReason(memory1, memory2, similarity, confidence);
+        rankedCandidates.push({
+            memoryId1,
+            memoryId2,
+            memory1,
+            memory2,
+            cosineSimilarity: similarity,
+            confidenceLevel: confidence,
+            mergeReason,
+        });
+    }
+    rankedCandidates.sort((a, b) => b.cosineSimilarity - a.cosineSimilarity);
+    const selectedByMemory = new Map();
+    const filtered = [];
+    for (const candidate of rankedCandidates) {
+        const count1 = (selectedByMemory.get(candidate.memoryId1) || 0) + 1;
+        const count2 = (selectedByMemory.get(candidate.memoryId2) || 0) + 1;
+        if (count1 <= topK && count2 <= topK) {
+            filtered.push(candidate);
+            selectedByMemory.set(candidate.memoryId1, count1);
+            selectedByMemory.set(candidate.memoryId2, count2);
+        }
+    }
+    return filtered;
+}
+export function analyzePair(memory1, memory2, embedding1, embedding2) {
+    const similarity = cosineSimilarity(embedding1, embedding2);
+    const confidence = calculateConfidence(memory1, memory2, similarity);
+    const mergeReason = generateMergeReason(memory1, memory2, similarity, confidence);
+    const factors = calculateConfidenceFactors(memory1, memory2);
+    return {
+        cosineSimilarity: similarity,
+        confidenceLevel: confidence,
+        mergeReason,
+        factors,
+    };
+}
+//# sourceMappingURL=semantic-ranker.js.map

package/dist/algorithms/merge/detection/semantic-ranker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"semantic-ranker.js","sourceRoot":"","sources":["../../../../algorithms/merge/detection/semantic-ranker.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AAYrE,SAAS,mBAAmB,CAC1B,OAAe,EACf,OAAe,EACf,SAAiB;IAEjB,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,0BAA0B,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC7D,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;YACjD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;YACjD,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,IAAI,SAAS,IAAI,IAAI,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,0BAA0B,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC7D,IAAI,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,uBAAuB,GAAG,GAAG,EAAE,CAAC;YAC9D,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAQD,SAAS,0BAA0B,CAAC,OAAe,EAAE,OAAe;IAClE,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,KAAK,OAAO,CAAC,IAAI,CAAC;IAE/C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC;IAC1C,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;IACzE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IACjD,MAAM,UAAU,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,KAAK,CAAC;IAErD,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC;IACpC,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC;IACpC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACpC,MAAM,uBAAuB,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,CAAC;IAEnE,OAAO;QACL,QAAQ;QACR,UAAU;QACV,uBAAuB;KACxB,CAAC;AACJ,CAAC;AAED,SAAS,mBAAmB,CAC1B,OAAe,EACf,OAAe,EACf,SAAiB,EACjB,eAA0C;IAE1C,MAAM,OAAO,GAAG,0BAA0B,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC7D,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,wBAAwB,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAEpE,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACrB,KAAK,CAAC,IAAI,CAAC,cAAc,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;IAC5C,CAAC;SAAM,CAAC;QACN,KAAK,CAAC,IAAI,CAAC,oBAAoB,OAAO,CAAC,IAAI,OAAO,OAAO,CAAC,IAAI,GAAG,CAAC,CAAC;IACrE,CAAC;IAED,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;IACtE,CAAC;IAED,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC;IACpC,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC;IACpC,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACjE,KAAK,CAAC,IAAI,CAAC,8BAA8B,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAE5E,KAAK,CAAC,IAAI,CAAC,eAAe,eAAe,EAAE,CAAC,CAAC;IAE7C,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,cAAc,CAClC,UAA2D,EAC3D,QAA6B,EAC7B,UAAiC,EACjC,OAGC;IAED,MAAM,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,IAAI,IAAI,CAAC;IAC5D,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC;IAEhC,MAAM,gBAAgB,GAAsB,EAAE,CAAC;IAE/C,KAAK,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,UAAU,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC7C,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAE7C,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;YACvD,SAAS;QACX,CAAC;QAED,MAAM,UAAU,GAAG,gBAAgB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;QAE5D,IAAI,UAAU,GAAG,iBAAiB,EAAE,CAAC;YACnC,SAAS;QACX,CAAC;QAED,MAAM,UAAU,GAAG,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;QACrE,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAElF,gBAAgB,CAAC,IAAI,CAAC;YACpB,SAAS;YACT,SAAS;YACT,OAAO;YACP,OAAO;YACP,gBAAgB,EAAE,UAAU;YAC5B,eAAe,EAAE,UAAU;YAC3B,WAAW;SACZ,CAAC,CAAC;IACL,CAAC;IAED,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,gBAAgB,GAAG,CAAC,CAAC,gBAAgB,CAAC,CAAC;IAEzE,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,MAAM,QAAQ,GAAsB,EAAE,CAAC;IAEvC,KAAK,MAAM,SAAS,IAAI,gBAAgB,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAEpE,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACrC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACzB,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;YAClD,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,WAAW,CACzB,OAAe,EACf,OAAe,EACf,UAAoB,EACpB,UAAoB;IAWpB,MAAM,UAAU,GAAG,gBAAgB,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAC5D,MAAM,UAAU,GAAG,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;IACrE,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;IAClF,MAAM,OAAO,GAAG,0BAA0B,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAE7D,OAAO;QACL,gBAAgB,EAAE,UAAU;QAC5B,eAAe,EAAE,UAAU;QAC3B,WAAW;QACX,OAAO;KACR,CAAC;AACJ,CAAC"}

package/dist/algorithms/merge/detection/two-stage-detector.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Two-stage duplicate detection orchestrator.
+ * Stage 1: Hash-based prefiltering (SimHash + MinHash)
+ * Stage 2: Semantic ranking using embeddings
+ */
+import type { Memory, MemoryType } from '../../../drizzle/schema.js';
+import { analyzePair } from './semantic-ranker.js';
+export interface MemoryPair {
+    memory1: Memory;
+    memory2: Memory;
+    similarityScore: number;
+    detectionMethod: 'simhash' | 'minhash' | 'embedding';
+    confidenceLevel: 'high' | 'medium' | 'low';
+    mergeReason: string;
+}
+export interface DetectionResult {
+    candidates: MemoryPair[];
+    stage1Time: number;
+    stage2Time: number;
+    totalCandidates: number;
+    filteredCandidates: number;
+    statistics: {
+        totalMemories: number;
+        memoriesByType: Record<MemoryType, number>;
+    };
+}
+export interface DetectionOptions {
+    projectId?: string;
+    type?: MemoryType;
+    threshold?: number;
+    limit?: number;
+    simhashThreshold?: number;
+    minhashThreshold?: number;
+    stage1Only?: boolean;
+}
+export declare function detectDuplicates(options: DetectionOptions): Promise<DetectionResult>;
+export declare function analyzeMergePair(memoryId1: string, memoryId2: string): Promise<{
+    memory1: Memory;
+    memory2: Memory;
+    analysis: ReturnType<typeof analyzePair>;
+} | null>;
+export declare function getDetectionStats(projectId: string): Promise<{
+    totalMemories: number;
+    mergeableMemories: number;
+    mergedMemories: number;
+    canonicalMemories: number;
+    memoriesByType: Record<MemoryType, number>;
+}>;
+//# sourceMappingURL=two-stage-detector.d.ts.map

package/dist/algorithms/merge/detection/two-stage-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"two-stage-detector.d.ts","sourceRoot":"","sources":["../../../../algorithms/merge/detection/two-stage-detector.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAGrE,OAAO,EAAkB,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAMnE,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,SAAS,GAAG,SAAS,GAAG,WAAW,CAAC;IACrD,eAAe,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;IAC3C,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,eAAe;IAC9B,UAAU,EAAE,UAAU,EAAE,CAAC;IACzB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,CAAC;IACxB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,UAAU,EAAE;QACV,aAAa,EAAE,MAAM,CAAC;QACtB,cAAc,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;KAC5C,CAAC;CACH;AAED,MAAM,WAAW,gBAAgB;IAC/B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,wBAAsB,gBAAgB,CAAC,OAAO,EAAE,gBAAgB,GAAG,OAAO,CAAC,eAAe,CAAC,CAoJ1F;AAED,wBAAsB,gBAAgB,CACpC,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,GAChB,OAAO,CAAC;IACT,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,UAAU,CAAC,OAAO,WAAW,CAAC,CAAC;CAC1C,GAAG,IAAI,CAAC,CAqCR;AAqBD,wBAAsB,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC;IAClE,aAAa,EAAE,MAAM,CAAC;IACtB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,cAAc,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;CAC5C,CAAC,CAqBD"}

package/dist/algorithms/merge/detection/two-stage-detector.js

@@ -0,0 +1,185 @@
+/**
+ * Two-stage duplicate detection orchestrator.
+ * Stage 1: Hash-based prefiltering (SimHash + MinHash)
+ * Stage 2: Semantic ranking using embeddings
+ */
+import { getEmbedding, getBatchEmbeddings } from '../../../core/embeddings.js';
+import { SimHashFilter, MinHashFilter, findCandidatePairs } from './hash-filters.js';
+import { rankCandidates, analyzePair } from './semantic-ranker.js';
+import { getDb } from '../../../db/index.js';
+import { getSchema } from '../../../db/schema.js';
+import { createDatabaseClient } from '../../../core/database.js';
+import { eq, and } from 'drizzle-orm';
+export async function detectDuplicates(options) {
+    const startTime = Date.now();
+    const db = createDatabaseClient(await getDb());
+    const schema = await getSchema();
+    let query = db.select().from(schema.memories);
+    if (options.projectId) {
+        query = query.where(eq(schema.memories.projectId, options.projectId));
+    }
+    if (options.type) {
+        query = query.where(eq(schema.memories.type, options.type));
+    }
+    query = query.where(and(eq(schema.memories.isMerged, false), eq(schema.memories.isMergeable, true), eq(schema.memories.isActive, true)));
+    const memories = await query.execute();
+    if (memories.length < 2) {
+        return {
+            candidates: [],
+            stage1Time: 0,
+            stage2Time: 0,
+            totalCandidates: 0,
+            filteredCandidates: 0,
+            statistics: {
+                totalMemories: memories.length,
+                memoriesByType: countByType(memories),
+            },
+        };
+    }
+    const memoriesById = new Map(memories.map((m) => [m.id, m]));
+    const contentById = new Map(memories.map((m) => [m.id, m.content]));
+    const simhashFilter = new SimHashFilter();
+    const minhashFilter = new MinHashFilter();
+    const allSimhashes = new Map();
+    const allMinhashes = new Map();
+    for (const memory of memories) {
+        allSimhashes.set(memory.id, simhashFilter.generateHash(memory.content));
+        allMinhashes.set(memory.id, minhashFilter.generateSignature(memory.content));
+    }
+    const stage1Start = Date.now();
+    const stage1Candidates = findCandidatePairs(contentById, allSimhashes, allMinhashes, {
+        simhashThreshold: options.simhashThreshold ?? 4,
+        minhashThreshold: options.minhashThreshold ?? 0.7,
+    });
+    const stage1Time = Date.now() - stage1Start;
+    if (options.stage1Only) {
+        return {
+            candidates: stage1Candidates.map((pair) => ({
+                memory1: memoriesById.get(pair.memoryId1),
+                memory2: memoriesById.get(pair.memoryId2),
+                similarityScore: Math.max(1 - pair.simhashDistance / 64, pair.minhashSimilarity),
+                detectionMethod: pair.matched === 'both' ? 'simhash' : pair.matched,
+                confidenceLevel: 'low',
+                mergeReason: 'Stage 1 candidate (embedding analysis skipped)',
+            })),
+            stage1Time,
+            stage2Time: 0,
+            totalCandidates: stage1Candidates.length,
+            filteredCandidates: stage1Candidates.length,
+            statistics: {
+                totalMemories: memories.length,
+                memoriesByType: countByType(memories),
+            },
+        };
+    }
+    const stage2Start = Date.now();
+    const embeddings = new Map();
+    // Separate memories that already have embeddings from those that need generation
+    const memoriesWithoutEmbedding = memories.filter((m) => !m.embedding);
+    const memoriesWithEmbedding = memories.filter((m) => m.embedding);
+    // Add cached embeddings to map
+    for (const memory of memoriesWithEmbedding) {
+        embeddings.set(memory.id, memory.embedding);
+    }
+    // Generate embeddings for remaining memories in parallel batches
+    if (memoriesWithoutEmbedding.length > 0) {
+        const contents = memoriesWithoutEmbedding.map((m) => m.content);
+        const generatedEmbeddings = await getBatchEmbeddings(contents, 20);
+        for (let i = 0; i < memoriesWithoutEmbedding.length; i++) {
+            const embedding = generatedEmbeddings[i];
+            if (embedding) {
+                embeddings.set(memoriesWithoutEmbedding[i].id, embedding);
+            }
+        }
+    }
+    const rankedCandidates = await rankCandidates(stage1Candidates.map((pair) => ({
+        memoryId1: pair.memoryId1,
+        memoryId2: pair.memoryId2,
+    })), memoriesById, embeddings, {
+        semanticThreshold: options.threshold ?? 0.85,
+        topK: 10,
+    });
+    const stage2Time = Date.now() - stage2Start;
+    const candidates = rankedCandidates.map((ranked) => ({
+        memory1: ranked.memory1,
+        memory2: ranked.memory2,
+        similarityScore: ranked.cosineSimilarity,
+        detectionMethod: 'embedding',
+        confidenceLevel: ranked.confidenceLevel,
+        mergeReason: ranked.mergeReason,
+    }));
+    const limited = candidates.slice(0, options.limit ?? 50);
+    return {
+        candidates: limited,
+        stage1Time,
+        stage2Time,
+        totalCandidates: stage1Candidates.length,
+        filteredCandidates: rankedCandidates.length,
+        statistics: {
+            totalMemories: memories.length,
+            memoriesByType: countByType(memories),
+        },
+    };
+}
+export async function analyzeMergePair(memoryId1, memoryId2) {
+    const db = createDatabaseClient(await getDb());
+    const schema = await getSchema();
+    const [memory1] = await db
+        .select()
+        .from(schema.memories)
+        .where(eq(schema.memories.id, memoryId1));
+    const [memory2] = await db
+        .select()
+        .from(schema.memories)
+        .where(eq(schema.memories.id, memoryId2));
+    if (!memory1 || !memory2) {
+        return null;
+    }
+    const embedding1 = memory1.embedding || (await getEmbedding(memory1.content)) || [];
+    const embedding2 = memory2.embedding || (await getEmbedding(memory2.content)) || [];
+    if (!embedding1 || !embedding2 || embedding1.length === 0 || embedding2.length === 0) {
+        return null;
+    }
+    const analysis = analyzePair(memory1, memory2, embedding1, embedding2);
+    return {
+        memory1,
+        memory2,
+        analysis,
+    };
+}
+function countByType(memories) {
+    const counts = {
+        observation: 0,
+        fact: 0,
+        decision: 0,
+        context: 0,
+        preference: 0,
+    };
+    for (const memory of memories) {
+        const type = memory.type;
+        if (type in counts) {
+            counts[type]++;
+        }
+    }
+    return counts;
+}
+export async function getDetectionStats(projectId) {
+    const db = createDatabaseClient(await getDb());
+    const schema = await getSchema();
+    const memories = await db
+        .select()
+        .from(schema.memories)
+        .where(eq(schema.memories.projectId, projectId));
+    const totalMemories = memories.length;
+    const mergedMemories = memories.filter((m) => m.isMerged).length;
+    const canonicalMemories = memories.filter((m) => m.isCanonical).length;
+    const mergeableMemories = memories.filter((m) => m.isMergeable && !m.isMerged).length;
+    return {
+        totalMemories,
+        mergeableMemories,
+        mergedMemories,
+        canonicalMemories,
+        memoriesByType: countByType(memories),
+    };
+}
+//# sourceMappingURL=two-stage-detector.js.map

package/dist/algorithms/merge/detection/two-stage-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"two-stage-detector.js","sourceRoot":"","sources":["../../../../algorithms/merge/detection/two-stage-detector.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AAC/E,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AACrF,OAAO,EAAE,cAAc,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnE,OAAO,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AACjE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAiCtC,MAAM,CAAC,KAAK,UAAU,gBAAgB,CAAC,OAAyB;IAC9D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;IAEjC,IAAI,KAAK,GAAQ,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;IAEnD,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;QACtB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,IAAI,OAAO,CAAC,IAAI,EAAE,CAAC;QACjB,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,KAAK,GAAG,KAAK,CAAC,KAAK,CACjB,GAAG,CACD,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,EACnC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,EACrC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,CACnC,CACF,CAAC;IAEF,MAAM,QAAQ,GAAa,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;IAEjD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,OAAO;YACL,UAAU,EAAE,EAAE;YACd,UAAU,EAAE,CAAC;YACb,UAAU,EAAE,CAAC;YACb,eAAe,EAAE,CAAC;YAClB,kBAAkB,EAAE,CAAC;YACrB,UAAU,EAAE;gBACV,aAAa,EAAE,QAAQ,CAAC,MAAM;gBAC9B,cAAc,EAAE,WAAW,CAAC,QAAQ,CAAC;aACtC;SACF,CAAC;IACJ,CAAC;IAED,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAEpE,MAAM,aAAa,GAAG,IAAI,aAAa,EAAE,CAAC;IAC1C,MAAM,aAAa,GAAG,IAAI,aAAa,EAAE,CAAC;IAE1C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEjD,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,aAAa,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QACxE,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,aAAa,CAAC,iBAAiB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;IAC/E,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC/B,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,WAAW,EAAE,YAAY,EAAE,YAAY,EAAE;QACnF,gBAAgB,EAAE,OAAO,CAAC,gBAAgB,IAAI,CAAC;QAC/C,gBAAgB,EAAE,OAAO,CAAC,gBAAgB,IAAI,GAAG;KAClD,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,WAAW,CAAC;IAE5C,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACvB,OAAO;YACL,UAAU,EAAE,gBAAgB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAC1C,OAAO,EAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAE;gBAC1C,OAAO,EAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAE;gBAC1C,eAAe,EAAE,IAAI,CAAC,GAAG,CACvB,CAAC,GAAG,IAAI,CAAC,eAAe,GAAG,EAAE,EAC7B,IAAI,CAAC,iBAAiB,CACvB;gBACD,eAAe,EAAE,IAAI,CAAC,OAAO,KAAK,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO;gBACnE,eAAe,EAAE,KAAK;gBACtB,WAAW,EAAE,gDAAgD;aAC9D,CAAC,CAAC;YACH,UAAU;YACV,UAAU,EAAE,CAAC;YACb,eAAe,EAAE,gBAAgB,CAAC,MAAM;YACxC,kBAAkB,EAAE,gBAAgB,CAAC,MAAM;YAC3C,UAAU,EAAE;gBACV,aAAa,EAAE,QAAQ,CAAC,MAAM;gBAC9B,cAAc,EAAE,WAAW,CAAC,QAAQ,CAAC;aACtC;SACF,CAAC;IACJ,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAE/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE/C,iFAAiF;IACjF,MAAM,wBAAwB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACtE,MAAM,qBAAqB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAElE,+BAA+B;IAC/B,KAAK,MAAM,MAAM,IAAI,qBAAqB,EAAE,CAAC;QAC3C,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,SAAgC,CAAC,CAAC;IACrE,CAAC;IAED,iEAAiE;IACjE,IAAI,wBAAwB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,wBAAwB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;QAChE,MAAM,mBAAmB,GAAG,MAAM,kBAAkB,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAEnE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,wBAAwB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzD,MAAM,SAAS,GAAG,mBAAmB,CAAC,CAAC,CAAC,CAAC;YACzC,IAAI,SAAS,EAAE,CAAC;gBACd,UAAU,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;YAC5D,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,gBAAgB,GAAG,MAAM,cAAc,CAC3C,gBAAgB,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC9B,SAAS,EAAE,IAAI,CAAC,SAAS;QACzB,SAAS,EAAE,IAAI,CAAC,SAAS;KAC1B,CAAC,CAAC,EACH,YAAY,EACZ,UAAU,EACV;QACE,iBAAiB,EAAE,OAAO,CAAC,SAAS,IAAI,IAAI;QAC5C,IAAI,EAAE,EAAE;KACT,CACF,CAAC;IAEF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,WAAW,CAAC;IAE5C,MAAM,UAAU,GAAiB,gBAAgB,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACjE,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,OAAO,EAAE,MAAM,CAAC,OAAO;QACvB,eAAe,EAAE,MAAM,CAAC,gBAAgB;QACxC,eAAe,EAAE,WAAW;QAC5B,eAAe,EAAE,MAAM,CAAC,eAAe;QACvC,WAAW,EAAE,MAAM,CAAC,WAAW;KAChC,CAAC,CAAC,CAAC;IAEJ,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC;IAEzD,OAAO;QACL,UAAU,EAAE,OAAO;QACnB,UAAU;QACV,UAAU;QACV,eAAe,EAAE,gBAAgB,CAAC,MAAM;QACxC,kBAAkB,EAAE,gBAAgB,CAAC,MAAM;QAC3C,UAAU,EAAE;YACV,aAAa,EAAE,QAAQ,CAAC,MAAM;YAC9B,cAAc,EAAE,WAAW,CAAC,QAAQ,CAAC;SACtC;KACF,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,SAAiB,EACjB,SAAiB;IAMjB,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;IAEjC,MAAM,CAAC,OAAO,CAAC,GAAG,MAAM,EAAE;SACvB,MAAM,EAAE;SACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;SACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;IAE5C,MAAM,CAAC,OAAO,CAAC,GAAG,MAAM,EAAE;SACvB,MAAM,EAAE;SACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;SACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;IAE5C,IAAI,CAAC,OAAO,IAAI,CAAC,OAAO,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,MAAM,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;IACpF,MAAM,UAAU,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,MAAM,YAAY,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;IAEpF,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrF,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,QAAQ,GAAG,WAAW,CAC1B,OAAO,EACP,OAAO,EACP,UAAiC,EACjC,UAAiC,CAClC,CAAC;IAEF,OAAO;QACL,OAAO;QACP,OAAO;QACP,QAAQ;KACT,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAAC,QAAkB;IACrC,MAAM,MAAM,GAA+B;QACzC,WAAW,EAAE,CAAC;QACd,IAAI,EAAE,CAAC;QACP,QAAQ,EAAE,CAAC;QACX,OAAO,EAAE,CAAC;QACV,UAAU,EAAE,CAAC;KACd,CAAC;IAEF,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAkB,CAAC;QACvC,IAAI,IAAI,IAAI,MAAM,EAAE,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QACjB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,SAAiB;IAOvD,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;IAEjC,MAAM,QAAQ,GAAa,MAAM,EAAE;SAChC,MAAM,EAAE;SACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;SACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;IAEnD,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC;IACtC,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;IACjE,MAAM,iBAAiB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC;IACvE,MAAM,iBAAiB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;IAEtF,OAAO;QACL,aAAa;QACb,iBAAiB;QACjB,cAAc;QACd,iBAAiB;QACjB,cAAc,EAAE,WAAW,CAAC,QAAQ,CAAC;KACtC,CAAC;AACJ,CAAC"}

package/dist/algorithms/merge/handlers/approve-merge.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Executes the approved merge in a single atomic transaction.
+ */
+interface ApproveMergeInput {
+    proposalId: string;
+    reviewNotes?: string;
+}
+interface ApproveMergeResponse {
+    ok: boolean;
+    message: string;
+    data?: {
+        proposalId: string;
+        canonicalMemoryId: string;
+        mergedMemoryIds: string[];
+        tokensSaved: number;
+        mergedAt: string;
+    };
+    error?: string;
+}
+export declare function handleApproveMerge(input: ApproveMergeInput): Promise<ApproveMergeResponse>;
+export {};
+//# sourceMappingURL=approve-merge.d.ts.map

package/dist/algorithms/merge/handlers/approve-merge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"approve-merge.d.ts","sourceRoot":"","sources":["../../../../algorithms/merge/handlers/approve-merge.ts"],"names":[],"mappings":"AAAA;;GAEG;AAYH,UAAU,iBAAiB;IACzB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,UAAU,oBAAoB;IAC5B,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE;QACL,UAAU,EAAE,MAAM,CAAC;QACnB,iBAAiB,EAAE,MAAM,CAAC;QAC1B,eAAe,EAAE,MAAM,EAAE,CAAC;QAC1B,WAAW,EAAE,MAAM,CAAC;QACpB,QAAQ,EAAE,MAAM,CAAC;KAClB,CAAC;IACF,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,wBAAsB,kBAAkB,CAAC,KAAK,EAAE,iBAAiB,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAsLhG"}