squish-memory 0.7.0

package/dist/algorithms/merge/handlers/approve-merge.js

@@ -0,0 +1,179 @@
+/**
+ * Executes the approved merge in a single atomic transaction.
+ */
+import { randomUUID } from 'crypto';
+import { getDb } from '../../../db/index.js';
+import { getSchema } from '../../../db/schema.js';
+import { createDatabaseClient } from '../../../core/database.js';
+import { eq, inArray } from 'drizzle-orm';
+import { mergeMemories } from '../strategies/merge-strategies.js';
+import { estimateTokensSaved } from '../analytics/token-estimator.js';
+import { getEmbedding } from '../../../core/embeddings.js';
+export async function handleApproveMerge(input) {
+    try {
+        const { proposalId, reviewNotes } = input;
+        if (!proposalId) {
+            return {
+                ok: false,
+                message: 'proposalId is required',
+                error: 'proposalId is required',
+            };
+        }
+        const db = createDatabaseClient(await getDb());
+        const schema = await getSchema();
+        const [proposal] = await db
+            .select()
+            .from(schema.memoryMergeProposals)
+            .where(eq(schema.memoryMergeProposals.id, proposalId));
+        if (!proposal) {
+            return {
+                ok: false,
+                message: 'Proposal not found',
+                error: `Proposal ${proposalId} not found`,
+            };
+        }
+        if (proposal.status !== 'pending') {
+            return {
+                ok: false,
+                message: `Proposal is not pending (status: ${proposal.status})`,
+                error: `Cannot approve non-pending proposal`,
+            };
+        }
+        // Step 2: Load source memories
+        const sourceIds = proposal.sourceMemoryIds || [];
+        if (sourceIds.length === 0) {
+            return {
+                ok: false,
+                message: 'No source memories found in proposal',
+                error: 'Proposal has no source memory IDs',
+            };
+        }
+        const sourceMemories = await db
+            .select()
+            .from(schema.memories)
+            .where(inArray(schema.memories.id, sourceIds));
+        if (sourceMemories.length !== sourceIds.length) {
+            return {
+                ok: false,
+                message: 'Not all source memories could be found',
+                error: 'Missing source memories',
+            };
+        }
+        // Step 3: Merge memories
+        let merged;
+        try {
+            merged = mergeMemories(sourceMemories);
+        }
+        catch (error) {
+            return {
+                ok: false,
+                message: 'Merge strategy failed',
+                error: error instanceof Error ? error.message : 'Unknown merge error',
+            };
+        }
+        // Step 4: Calculate token savings
+        const tokensSaved = estimateTokensSaved(sourceMemories, merged);
+        // Step 5: Generate embedding for merged memory
+        let embedding = null;
+        try {
+            embedding = (await getEmbedding(merged.content));
+        }
+        catch (err) {
+            // Continue without embedding if generation fails
+        }
+        // Step 6: Create canonical memory
+        const canonicalId = randomUUID();
+        const now = new Date();
+        await db.insert(schema.memories).values({
+            id: canonicalId,
+            projectId: sourceMemories[0].projectId,
+            userId: sourceMemories[0].userId,
+            type: sourceMemories[0].type,
+            content: merged.content,
+            summary: merged.summary,
+            embedding: embedding || undefined,
+            tags: merged.tags,
+            metadata: merged.metadata,
+            source: 'merge',
+            confidence: 85, // Merged confidence slightly lower than source
+            isActive: true,
+            isCanonical: true,
+            mergeSourceIds: sourceIds,
+            isMergeable: true,
+            mergeVersion: 1,
+            createdAt: now,
+            updatedAt: now,
+            isPrivate: sourceMemories[0].isPrivate,
+            hasSecrets: sourceMemories.some((m) => m.hasSecrets),
+            relevanceScore: Math.round(sourceMemories.reduce((sum, m) => sum + (m.relevanceScore || 50), 0) / sourceMemories.length),
+            accessCount: 0,
+            lastAccessedAt: null,
+            expiresAt: null,
+        });
+        // Step 7: Mark source memories as merged (soft archive)
+        for (const sourceMemory of sourceMemories) {
+            await db
+                .update(schema.memories)
+                .set({
+                isMerged: true,
+                mergedIntoId: canonicalId,
+                mergedAt: now,
+                isActive: false,
+                updatedAt: now,
+            })
+                .where(eq(schema.memories.id, sourceMemory.id));
+        }
+        // Step 8: Create merge history record (audit trail)
+        const historyId = randomUUID();
+        await db.insert(schema.memoryMergeHistory).values({
+            id: historyId,
+            projectId: sourceMemories[0].projectId,
+            userId: sourceMemories[0].userId,
+            proposalId,
+            sourceMemoryIds: sourceIds,
+            canonicalMemoryId: canonicalId,
+            sourceMemoriesSnapshot: sourceMemories.map((m) => ({
+                id: m.id,
+                type: m.type,
+                content: m.content,
+                summary: m.summary,
+                tags: m.tags,
+                metadata: m.metadata,
+                createdAt: m.createdAt,
+            })),
+            mergeStrategy: sourceMemories[0].type === 'preference' ? 'latest' : 'union',
+            tokensSaved,
+            isReversed: false,
+            mergedAt: now,
+        });
+        // Step 9: Update proposal status
+        await db
+            .update(schema.memoryMergeProposals)
+            .set({
+            status: 'approved',
+            reviewedAt: now,
+            reviewNotes: reviewNotes || undefined,
+        })
+            .where(eq(schema.memoryMergeProposals.id, proposalId));
+        // Step 10: Return success
+        return {
+            ok: true,
+            message: `Merge approved and executed. Created canonical memory ${canonicalId}`,
+            data: {
+                proposalId,
+                canonicalMemoryId: canonicalId,
+                mergedMemoryIds: sourceIds,
+                tokensSaved,
+                mergedAt: now.toISOString(),
+            },
+        };
+    }
+    catch (error) {
+        return {
+            ok: false,
+            message: 'Failed to approve merge',
+            error: error instanceof Error ? error.message : 'Unknown error',
+        };
+    }
+}
+//# sourceMappingURL=approve-merge.js.map

package/dist/algorithms/merge/handlers/approve-merge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"approve-merge.js","sourceRoot":"","sources":["../../../../algorithms/merge/handlers/approve-merge.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AACpC,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,OAAO,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAClE,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAoB3D,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,KAAwB;IAC/D,IAAI,CAAC;QACH,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC;QAE1C,IAAI,CAAC,UAAU,EAAE,CAAC;YAChB,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,OAAO,EAAE,wBAAwB;gBACjC,KAAK,EAAE,wBAAwB;aAChC,CAAC;QACJ,CAAC;QAED,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,MAAM,CAAC,QAAQ,CAAC,GAAG,MAAM,EAAE;aACxB,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC;aACjC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;QAEzD,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,OAAO,EAAE,oBAAoB;gBAC7B,KAAK,EAAE,YAAY,UAAU,YAAY;aAC1C,CAAC;QACJ,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAClC,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,OAAO,EAAE,oCAAoC,QAAQ,CAAC,MAAM,GAAG;gBAC/D,KAAK,EAAE,qCAAqC;aAC7C,CAAC;QACJ,CAAC;QAED,+BAA+B;QAC/B,MAAM,SAAS,GAAI,QAAQ,CAAC,eAAuC,IAAI,EAAE,CAAC;QAC1E,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3B,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,OAAO,EAAE,sCAAsC;gBAC/C,KAAK,EAAE,mCAAmC;aAC3C,CAAC;QACJ,CAAC;QAED,MAAM,cAAc,GAAa,MAAM,EAAE;aACtC,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC,CAAC;QAEjD,IAAI,cAAc,CAAC,MAAM,KAAK,SAAS,CAAC,MAAM,EAAE,CAAC;YAC/C,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,OAAO,EAAE,wCAAwC;gBACjD,KAAK,EAAE,yBAAyB;aACjC,CAAC;QACJ,CAAC;QAED,yBAAyB;QACzB,IAAI,MAAM,CAAC;QACX,IAAI,CAAC;YACH,MAAM,GAAG,aAAa,CAAC,cAAc,CAAC,CAAC;QACzC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,OAAO,EAAE,uBAAuB;gBAChC,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,qBAAqB;aACtE,CAAC;QACJ,CAAC;QAED,kCAAkC;QAClC,MAAM,WAAW,GAAG,mBAAmB,CAAC,cAAc,EAAE,MAAM,CAAC,CAAC;QAEhE,+CAA+C;QAC/C,IAAI,SAAS,GAAoB,IAAI,CAAC;QACtC,IAAI,CAAC;YACH,SAAS,GAAG,CAAC,MAAM,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,CAAa,CAAC;QAC/D,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,iDAAiD;QACnD,CAAC;QAED,kCAAkC;QAClC,MAAM,WAAW,GAAG,UAAU,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,MAAM,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;YACtC,EAAE,EAAE,WAAW;YACf,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,SAAS;YACtC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM;YAChC,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI;YAC5B,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,SAAS,EAAE,SAAS,IAAI,SAAS;YACjC,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,QAAQ,EAAE,MAAM,CAAC,QAAQ;YACzB,MAAM,EAAE,OAAO;YACf,UAAU,EAAE,EAAE,EAAE,+CAA+C;YAC/D,QAAQ,EAAE,IAAI;YACd,WAAW,EAAE,IAAI;YACjB,cAAc,EAAE,SAAS;YACzB,WAAW,EAAE,IAAI;YACjB,YAAY,EAAE,CAAC;YACf,SAAS,EAAE,GAAG;YACd,SAAS,EAAE,GAAG;YACd,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,SAAS;YACtC,UAAU,EAAE,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC;YACpD,cAAc,EAAE,IAAI,CAAC,KAAK,CACxB,cAAc,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,cAAc,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,cAAc,CAAC,MAAM,CAC7F;YACD,WAAW,EAAE,CAAC;YACd,cAAc,EAAE,IAAI;YACpB,SAAS,EAAE,IAAI;SACT,CAAC,CAAC;QAEV,wDAAwD;QACxD,KAAK,MAAM,YAAY,IAAI,cAAc,EAAE,CAAC;YAC1C,MAAM,EAAE;iBACL,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;iBACvB,GAAG,CAAC;gBACH,QAAQ,EAAE,IAAI;gBACd,YAAY,EAAE,WAAW;gBACzB,QAAQ,EAAE,GAAG;gBACb,QAAQ,EAAE,KAAK;gBACf,SAAS,EAAE,GAAG;aACf,CAAC;iBACD,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,YAAY,CAAC,EAAE,CAAC,CAAC,CAAC;QACpD,CAAC;QAED,oDAAoD;QACpD,MAAM,SAAS,GAAG,UAAU,EAAE,CAAC;QAC/B,MAAM,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAC,MAAM,CAAC;YAChD,EAAE,EAAE,SAAS;YACb,SAAS,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,SAAS;YACtC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM;YAChC,UAAU;YACV,eAAe,EAAE,SAAS;YAC1B,iBAAiB,EAAE,WAAW;YAC9B,sBAAsB,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACjD,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,QAAQ,EAAE,CAAC,CAAC,QAAQ;gBACpB,SAAS,EAAE,CAAC,CAAC,SAAS;aACvB,CAAC,CAAC;YACH,aAAa,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO;YAC3E,WAAW;YACX,UAAU,EAAE,KAAK;YACjB,QAAQ,EAAE,GAAG;SACP,CAAC,CAAC;QAEV,iCAAiC;QACjC,MAAM,EAAE;aACL,MAAM,CAAC,MAAM,CAAC,oBAAoB,CAAC;aACnC,GAAG,CAAC;YACH,MAAM,EAAE,UAAU;YAClB,UAAU,EAAE,GAAG;YACf,WAAW,EAAE,WAAW,IAAI,SAAS;SACtC,CAAC;aACD,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;QAEzD,0BAA0B;QAC1B,OAAO;YACL,EAAE,EAAE,IAAI;YACR,OAAO,EAAE,yDAAyD,WAAW,EAAE;YAC/E,IAAI,EAAE;gBACJ,UAAU;gBACV,iBAAiB,EAAE,WAAW;gBAC9B,eAAe,EAAE,SAAS;gBAC1B,WAAW;gBACX,QAAQ,EAAE,GAAG,CAAC,WAAW,EAAE;aAC5B;SACF,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,EAAE,EAAE,KAAK;YACT,OAAO,EAAE,yBAAyB;YAClC,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe;SAChE,CAAC;IACJ,CAAC;AACH,CAAC"}

package/dist/algorithms/merge/handlers/detect-duplicates.d.ts

@@ -0,0 +1,47 @@
+/**
+ * MCP Tool: detect_duplicate_memories
+ *
+ * Scans for duplicate or similar memories and creates merge proposals
+ * Entry point for the memory merging workflow
+ */
+interface DetectDuplicatesInput {
+    projectId?: string;
+    threshold?: number;
+    memoryType?: 'fact' | 'preference' | 'decision' | 'observation' | 'context';
+    limit?: number;
+    autoCreateProposals?: boolean;
+}
+interface DetectDuplicatesResponse {
+    ok: boolean;
+    message: string;
+    data?: {
+        projectId: string;
+        duplicateCount: number;
+        proposalsCreated: number;
+        proposalIds: string[];
+        statistics: {
+            totalMemories: number;
+            scannedMemories: number;
+            candidatesFound: number;
+            estimatedTokensSaved: number;
+        };
+        timing: {
+            stage1Ms: number;
+            stage2Ms: number;
+            totalMs: number;
+        };
+    };
+    error?: string;
+}
+/**
+ * Handle detect_duplicate_memories tool call
+ *
+ * Algorithm:
+ * 1. Run two-stage detection (SimHash → embedding similarity)
+ * 2. Filter by safety checks
+ * 3. Create merge proposals in database
+ * 4. Return summary
+ */
+export declare function handleDetectDuplicates(input: DetectDuplicatesInput): Promise<DetectDuplicatesResponse>;
+export {};
+//# sourceMappingURL=detect-duplicates.d.ts.map

package/dist/algorithms/merge/handlers/detect-duplicates.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect-duplicates.d.ts","sourceRoot":"","sources":["../../../../algorithms/merge/handlers/detect-duplicates.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAaH,UAAU,qBAAqB;IAC7B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,GAAG,YAAY,GAAG,UAAU,GAAG,aAAa,GAAG,SAAS,CAAC;IAC5E,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,mBAAmB,CAAC,EAAE,OAAO,CAAC;CAC/B;AAED,UAAU,wBAAwB;IAChC,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE;QACL,SAAS,EAAE,MAAM,CAAC;QAClB,cAAc,EAAE,MAAM,CAAC;QACvB,gBAAgB,EAAE,MAAM,CAAC;QACzB,WAAW,EAAE,MAAM,EAAE,CAAC;QACtB,UAAU,EAAE;YACV,aAAa,EAAE,MAAM,CAAC;YACtB,eAAe,EAAE,MAAM,CAAC;YACxB,eAAe,EAAE,MAAM,CAAC;YACxB,oBAAoB,EAAE,MAAM,CAAC;SAC9B,CAAC;QACF,MAAM,EAAE;YACN,QAAQ,EAAE,MAAM,CAAC;YACjB,QAAQ,EAAE,MAAM,CAAC;YACjB,OAAO,EAAE,MAAM,CAAC;SACjB,CAAC;KACH,CAAC;IACF,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;;;;;GAQG;AACH,wBAAsB,sBAAsB,CAAC,KAAK,EAAE,qBAAqB,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAyJ5G"}

package/dist/algorithms/merge/handlers/detect-duplicates.js

@@ -0,0 +1,165 @@
+/**
+ * MCP Tool: detect_duplicate_memories
+ *
+ * Scans for duplicate or similar memories and creates merge proposals
+ * Entry point for the memory merging workflow
+ */
+import { randomUUID } from 'crypto';
+import { detectDuplicates } from '../detection/two-stage-detector.js';
+import { runSafetyChecks } from '../safety/safety-checks.js';
+import { mergeMemories } from '../strategies/merge-strategies.js';
+import { estimateTokensSaved } from '../analytics/token-estimator.js';
+import { getDb } from '../../../db/index.js';
+import { getSchema } from '../../../db/schema.js';
+import { createDatabaseClient } from '../../../core/database.js';
+/**
+ * Handle detect_duplicate_memories tool call
+ *
+ * Algorithm:
+ * 1. Run two-stage detection (SimHash → embedding similarity)
+ * 2. Filter by safety checks
+ * 3. Create merge proposals in database
+ * 4. Return summary
+ */
+export async function handleDetectDuplicates(input) {
+    try {
+        const projectId = input.projectId;
+        const threshold = input.threshold ?? 0.85;
+        const memoryType = input.memoryType;
+        const limit = input.limit ?? 50;
+        const autoCreateProposals = input.autoCreateProposals !== false;
+        if (!projectId) {
+            return {
+                ok: false,
+                message: 'projectId is required',
+                error: 'projectId is required',
+            };
+        }
+        // Run detection
+        const startTime = Date.now();
+        const detectionResult = await detectDuplicates({
+            projectId,
+            threshold,
+            type: memoryType,
+            limit,
+        });
+        const detectionTime = Date.now() - startTime;
+        if (detectionResult.candidates.length === 0) {
+            return {
+                ok: true,
+                message: 'No duplicates found',
+                data: {
+                    projectId,
+                    duplicateCount: 0,
+                    proposalsCreated: 0,
+                    proposalIds: [],
+                    statistics: {
+                        totalMemories: detectionResult.statistics.totalMemories,
+                        scannedMemories: detectionResult.statistics.totalMemories,
+                        candidatesFound: 0,
+                        estimatedTokensSaved: 0,
+                    },
+                    timing: {
+                        stage1Ms: detectionResult.stage1Time,
+                        stage2Ms: detectionResult.stage2Time,
+                        totalMs: detectionTime,
+                    },
+                },
+            };
+        }
+        if (!autoCreateProposals) {
+            // Return detection results without creating proposals
+            return {
+                ok: true,
+                message: `Found ${detectionResult.candidates.length} potential duplicates`,
+                data: {
+                    projectId,
+                    duplicateCount: detectionResult.candidates.length,
+                    proposalsCreated: 0,
+                    proposalIds: [],
+                    statistics: {
+                        totalMemories: detectionResult.statistics.totalMemories,
+                        scannedMemories: detectionResult.statistics.totalMemories,
+                        candidatesFound: detectionResult.candidates.length,
+                        estimatedTokensSaved: 0,
+                    },
+                    timing: {
+                        stage1Ms: detectionResult.stage1Time,
+                        stage2Ms: detectionResult.stage2Time,
+                        totalMs: detectionTime,
+                    },
+                },
+            };
+        }
+        // Create proposals for detected duplicates
+        const db = createDatabaseClient(await getDb());
+        const schema = await getSchema();
+        const proposalIds = [];
+        let estimatedTokensSaved = 0;
+        for (const candidate of detectionResult.candidates) {
+            const sources = [candidate.memory1, candidate.memory2];
+            // Run safety checks
+            const safetyResult = runSafetyChecks(sources, {
+                similarityScore: candidate.similarityScore,
+            });
+            if (!safetyResult.passed) {
+                // Skip this candidate if safety checks fail
+                continue;
+            }
+            // Merge memories
+            const merged = mergeMemories(sources);
+            // Estimate tokens saved
+            const tokensSaved = estimateTokensSaved(sources, merged);
+            estimatedTokensSaved += tokensSaved;
+            // Create proposal
+            const proposalId = randomUUID();
+            await db.insert(schema.memoryMergeProposals).values({
+                id: proposalId,
+                projectId: projectId,
+                userId: candidate.memory1.userId,
+                sourceMemoryIds: [candidate.memory1.id, candidate.memory2.id],
+                proposedContent: merged.content,
+                proposedSummary: merged.summary,
+                proposedTags: merged.tags,
+                proposedMetadata: merged.metadata,
+                detectionMethod: candidate.detectionMethod,
+                similarityScore: candidate.similarityScore,
+                confidenceLevel: candidate.confidenceLevel,
+                mergeReason: candidate.mergeReason,
+                conflictWarnings: merged.conflictWarnings,
+                status: 'pending',
+                createdAt: new Date(),
+            });
+            proposalIds.push(proposalId);
+        }
+        return {
+            ok: true,
+            message: `Created ${proposalIds.length} merge proposals from ${detectionResult.candidates.length} duplicates`,
+            data: {
+                projectId,
+                duplicateCount: detectionResult.candidates.length,
+                proposalsCreated: proposalIds.length,
+                proposalIds,
+                statistics: {
+                    totalMemories: detectionResult.statistics.totalMemories,
+                    scannedMemories: detectionResult.statistics.totalMemories,
+                    candidatesFound: detectionResult.candidates.length,
+                    estimatedTokensSaved,
+                },
+                timing: {
+                    stage1Ms: detectionResult.stage1Time,
+                    stage2Ms: detectionResult.stage2Time,
+                    totalMs: detectionTime,
+                },
+            },
+        };
+    }
+    catch (error) {
+        return {
+            ok: false,
+            message: 'Failed to detect duplicates',
+            error: error instanceof Error ? error.message : 'Unknown error',
+        };
+    }
+}
+//# sourceMappingURL=detect-duplicates.js.map

package/dist/algorithms/merge/handlers/detect-duplicates.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detect-duplicates.js","sourceRoot":"","sources":["../../../../algorithms/merge/handlers/detect-duplicates.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AACpC,OAAO,EAAE,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACtE,OAAO,EAAE,eAAe,EAAiB,MAAM,4BAA4B,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAClE,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AACtE,OAAO,EAAE,KAAK,EAAE,MAAM,sBAAsB,CAAC;AAC7C,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAClD,OAAO,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAkCjE;;;;;;;;GAQG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAAC,KAA4B;IACvE,IAAI,CAAC;QACH,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAC;QAClC,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,IAAI,IAAI,CAAC;QAC1C,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;QAChC,MAAM,mBAAmB,GAAG,KAAK,CAAC,mBAAmB,KAAK,KAAK,CAAC;QAEhE,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,OAAO,EAAE,uBAAuB;gBAChC,KAAK,EAAE,uBAAuB;aAC/B,CAAC;QACJ,CAAC;QAED,gBAAgB;QAChB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,MAAM,eAAe,GAAG,MAAM,gBAAgB,CAAC;YAC7C,SAAS;YACT,SAAS;YACT,IAAI,EAAE,UAAU;YAChB,KAAK;SACN,CAAC,CAAC;QACH,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC;QAE7C,IAAI,eAAe,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5C,OAAO;gBACL,EAAE,EAAE,IAAI;gBACR,OAAO,EAAE,qBAAqB;gBAC9B,IAAI,EAAE;oBACJ,SAAS;oBACT,cAAc,EAAE,CAAC;oBACjB,gBAAgB,EAAE,CAAC;oBACnB,WAAW,EAAE,EAAE;oBACf,UAAU,EAAE;wBACV,aAAa,EAAE,eAAe,CAAC,UAAU,CAAC,aAAa;wBACvD,eAAe,EAAE,eAAe,CAAC,UAAU,CAAC,aAAa;wBACzD,eAAe,EAAE,CAAC;wBAClB,oBAAoB,EAAE,CAAC;qBACxB;oBACD,MAAM,EAAE;wBACN,QAAQ,EAAE,eAAe,CAAC,UAAU;wBACpC,QAAQ,EAAE,eAAe,CAAC,UAAU;wBACpC,OAAO,EAAE,aAAa;qBACvB;iBACF;aACF,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,mBAAmB,EAAE,CAAC;YACzB,sDAAsD;YACtD,OAAO;gBACL,EAAE,EAAE,IAAI;gBACR,OAAO,EAAE,SAAS,eAAe,CAAC,UAAU,CAAC,MAAM,uBAAuB;gBAC1E,IAAI,EAAE;oBACJ,SAAS;oBACT,cAAc,EAAE,eAAe,CAAC,UAAU,CAAC,MAAM;oBACjD,gBAAgB,EAAE,CAAC;oBACnB,WAAW,EAAE,EAAE;oBACf,UAAU,EAAE;wBACV,aAAa,EAAE,eAAe,CAAC,UAAU,CAAC,aAAa;wBACvD,eAAe,EAAE,eAAe,CAAC,UAAU,CAAC,aAAa;wBACzD,eAAe,EAAE,eAAe,CAAC,UAAU,CAAC,MAAM;wBAClD,oBAAoB,EAAE,CAAC;qBACxB;oBACD,MAAM,EAAE;wBACN,QAAQ,EAAE,eAAe,CAAC,UAAU;wBACpC,QAAQ,EAAE,eAAe,CAAC,UAAU;wBACpC,OAAO,EAAE,aAAa;qBACvB;iBACF;aACF,CAAC;QACJ,CAAC;QAED,2CAA2C;QAC3C,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAE7B,KAAK,MAAM,SAAS,IAAI,eAAe,CAAC,UAAU,EAAE,CAAC;YACnD,MAAM,OAAO,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC;YAEvD,oBAAoB;YACpB,MAAM,YAAY,GAAG,eAAe,CAAC,OAAO,EAAE;gBAC5C,eAAe,EAAE,SAAS,CAAC,eAAe;aAC3C,CAAC,CAAC;YAEH,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC;gBACzB,4CAA4C;gBAC5C,SAAS;YACX,CAAC;YAED,iBAAiB;YACjB,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;YAEtC,wBAAwB;YACxB,MAAM,WAAW,GAAG,mBAAmB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YACzD,oBAAoB,IAAI,WAAW,CAAC;YAEpC,kBAAkB;YAClB,MAAM,UAAU,GAAG,UAAU,EAAE,CAAC;YAChC,MAAM,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC,MAAM,CAAC;gBAClD,EAAE,EAAE,UAA6B;gBACjC,SAAS,EAAE,SAA4B;gBACvC,MAAM,EAAE,SAAS,CAAC,OAAO,CAAC,MAAM;gBAChC,eAAe,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC7D,eAAe,EAAE,MAAM,CAAC,OAAO;gBAC/B,eAAe,EAAE,MAAM,CAAC,OAAO;gBAC/B,YAAY,EAAE,MAAM,CAAC,IAAI;gBACzB,gBAAgB,EAAE,MAAM,CAAC,QAAQ;gBACjC,eAAe,EAAE,SAAS,CAAC,eAAe;gBAC1C,eAAe,EAAE,SAAS,CAAC,eAAe;gBAC1C,eAAe,EAAE,SAAS,CAAC,eAAe;gBAC1C,WAAW,EAAE,SAAS,CAAC,WAAW;gBAClC,gBAAgB,EAAE,MAAM,CAAC,gBAAgB;gBACzC,MAAM,EAAE,SAAS;gBACjB,SAAS,EAAE,IAAI,IAAI,EAAE;aACf,CAAC,CAAC;YAEV,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC/B,CAAC;QAED,OAAO;YACL,EAAE,EAAE,IAAI;YACR,OAAO,EAAE,WAAW,WAAW,CAAC,MAAM,yBAAyB,eAAe,CAAC,UAAU,CAAC,MAAM,aAAa;YAC7G,IAAI,EAAE;gBACJ,SAAS;gBACT,cAAc,EAAE,eAAe,CAAC,UAAU,CAAC,MAAM;gBACjD,gBAAgB,EAAE,WAAW,CAAC,MAAM;gBACpC,WAAW;gBACX,UAAU,EAAE;oBACV,aAAa,EAAE,eAAe,CAAC,UAAU,CAAC,aAAa;oBACvD,eAAe,EAAE,eAAe,CAAC,UAAU,CAAC,aAAa;oBACzD,eAAe,EAAE,eAAe,CAAC,UAAU,CAAC,MAAM;oBAClD,oBAAoB;iBACrB;gBACD,MAAM,EAAE;oBACN,QAAQ,EAAE,eAAe,CAAC,UAAU;oBACpC,QAAQ,EAAE,eAAe,CAAC,UAAU;oBACpC,OAAO,EAAE,aAAa;iBACvB;aACF;SACF,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,EAAE,EAAE,KAAK;YACT,OAAO,EAAE,6BAA6B;YACtC,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe;SAChE,CAAC;IACJ,CAAC;AACH,CAAC"}

package/dist/algorithms/merge/handlers/get-stats.d.ts

@@ -0,0 +1,39 @@
+/**
+ * MCP Tool: get_merge_stats
+ *
+ * Returns statistics about memory merges for a project
+ */
+interface GetMergeStatsInput {
+    projectId: string;
+}
+interface MergeStats {
+    projectId: string;
+    totalMemories: number;
+    mergeableMemories: number;
+    mergedMemories: number;
+    canonicalMemories: number;
+    pendingProposals: number;
+    approvedMerges: number;
+    rejectedProposals: number;
+    tokensSaved: {
+        total: number;
+        formatted: string;
+        percentage: number;
+    };
+    averageMergeSize: number;
+    reversedMerges: number;
+}
+interface GetMergeStatsResponse {
+    ok: boolean;
+    message: string;
+    data?: MergeStats;
+    error?: string;
+}
+/**
+ * Handle get_merge_stats tool call
+ *
+ * Gathers merge statistics for a project
+ */
+export declare function handleGetMergeStats(input: GetMergeStatsInput): Promise<GetMergeStatsResponse>;
+export {};
+//# sourceMappingURL=get-stats.d.ts.map

package/dist/algorithms/merge/handlers/get-stats.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-stats.d.ts","sourceRoot":"","sources":["../../../../algorithms/merge/handlers/get-stats.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AASH,UAAU,kBAAkB;IAC1B,SAAS,EAAE,MAAM,CAAC;CACnB;AAED,UAAU,UAAU;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,MAAM,CAAC;IACtB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IACzB,cAAc,EAAE,MAAM,CAAC;IACvB,iBAAiB,EAAE,MAAM,CAAC;IAC1B,WAAW,EAAE;QACX,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,MAAM,CAAC;QAClB,UAAU,EAAE,MAAM,CAAC;KACpB,CAAC;IACF,gBAAgB,EAAE,MAAM,CAAC;IACzB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED,UAAU,qBAAqB;IAC7B,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,wBAAsB,mBAAmB,CAAC,KAAK,EAAE,kBAAkB,GAAG,OAAO,CAAC,qBAAqB,CAAC,CAoFnG"}

package/dist/algorithms/merge/handlers/get-stats.js

@@ -0,0 +1,88 @@
+/**
+ * MCP Tool: get_merge_stats
+ *
+ * Returns statistics about memory merges for a project
+ */
+import { getDb } from '../../../db/index.js';
+import { getSchema } from '../../../db/schema.js';
+import { createDatabaseClient } from '../../../core/database.js';
+import { eq } from 'drizzle-orm';
+import { calculateProjectTokenSavings, formatTokenCount } from '../analytics/token-estimator.js';
+/**
+ * Handle get_merge_stats tool call
+ *
+ * Gathers merge statistics for a project
+ */
+export async function handleGetMergeStats(input) {
+    try {
+        const { projectId } = input;
+        if (!projectId) {
+            return {
+                ok: false,
+                message: 'projectId is required',
+                error: 'projectId is required',
+            };
+        }
+        const db = createDatabaseClient(await getDb());
+        const schema = await getSchema();
+        // Get all memories in project
+        const memories = await db
+            .select()
+            .from(schema.memories)
+            .where(eq(schema.memories.projectId, projectId));
+        // Get merge history
+        const mergeHistory = await db
+            .select()
+            .from(schema.memoryMergeHistory)
+            .where(eq(schema.memoryMergeHistory.projectId, projectId));
+        // Get proposals
+        const allProposals = await db
+            .select()
+            .from(schema.memoryMergeProposals)
+            .where(eq(schema.memoryMergeProposals.projectId, projectId));
+        // Calculate statistics
+        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 && m.isActive).length;
+        const pendingProposals = allProposals.filter((p) => p.status === 'pending').length;
+        const approvedMerges = allProposals.filter((p) => p.status === 'approved').length;
+        const rejectedProposals = allProposals.filter((p) => p.status === 'rejected').length;
+        const reversedMerges = mergeHistory.filter((m) => m.isReversed).length;
+        // Calculate token savings
+        const tokenStats = await calculateProjectTokenSavings(projectId);
+        // Calculate average merge size (memories per canonical)
+        const averageMergeSize = canonicalMemories > 0
+            ? Math.round((mergedMemories + canonicalMemories) / canonicalMemories)
+            : 1;
+        return {
+            ok: true,
+            message: 'Merge statistics retrieved',
+            data: {
+                projectId,
+                totalMemories,
+                mergeableMemories,
+                mergedMemories,
+                canonicalMemories,
+                pendingProposals,
+                approvedMerges,
+                rejectedProposals,
+                tokensSaved: {
+                    total: tokenStats.totalSaved,
+                    formatted: formatTokenCount(tokenStats.totalSaved),
+                    percentage: tokenStats.tokenSavingPercentage,
+                },
+                averageMergeSize,
+                reversedMerges,
+            },
+        };
+    }
+    catch (error) {
+        return {
+            ok: false,
+            message: 'Failed to get merge statistics',
+            error: error instanceof Error ? error.message : 'Unknown error',
+        };
+    }
+}
+//# sourceMappingURL=get-stats.js.map

package/dist/algorithms/merge/handlers/get-stats.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"get-stats.js","sourceRoot":"","sources":["../../../../algorithms/merge/handlers/get-stats.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,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,MAAM,aAAa,CAAC;AACjC,OAAO,EAAE,4BAA4B,EAAE,gBAAgB,EAAE,MAAM,iCAAiC,CAAC;AAgCjG;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,KAAyB;IACjE,IAAI,CAAC;QACH,MAAM,EAAE,SAAS,EAAE,GAAG,KAAK,CAAC;QAE5B,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO;gBACL,EAAE,EAAE,KAAK;gBACT,OAAO,EAAE,uBAAuB;gBAChC,KAAK,EAAE,uBAAuB;aAC/B,CAAC;QACJ,CAAC;QAED,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,8BAA8B;QAC9B,MAAM,QAAQ,GAAa,MAAM,EAAE;aAChC,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;QAEnD,oBAAoB;QACpB,MAAM,YAAY,GAAyB,MAAM,EAAE;aAChD,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC;aAC/B,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,kBAAkB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;QAE7D,gBAAgB;QAChB,MAAM,YAAY,GAAU,MAAM,EAAE;aACjC,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAAC;aACjC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;QAE/D,uBAAuB;QACvB,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC;QACtC,MAAM,cAAc,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;QACjE,MAAM,iBAAiB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC;QACvE,MAAM,iBAAiB,GAAG,QAAQ,CAAC,MAAM,CACvC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,QAAQ,CAClD,CAAC,MAAM,CAAC;QAET,MAAM,gBAAgB,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,MAAM,CAAC;QACnF,MAAM,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,MAAM,CAAC;QAClF,MAAM,iBAAiB,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,CAAC,MAAM,CAAC;QAErF,MAAM,cAAc,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC;QAEvE,0BAA0B;QAC1B,MAAM,UAAU,GAAG,MAAM,4BAA4B,CAAC,SAAS,CAAC,CAAC;QAEjE,wDAAwD;QACxD,MAAM,gBAAgB,GACpB,iBAAiB,GAAG,CAAC;YACnB,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,cAAc,GAAG,iBAAiB,CAAC,GAAG,iBAAiB,CAAC;YACtE,CAAC,CAAC,CAAC,CAAC;QAER,OAAO;YACL,EAAE,EAAE,IAAI;YACR,OAAO,EAAE,4BAA4B;YACrC,IAAI,EAAE;gBACJ,SAAS;gBACT,aAAa;gBACb,iBAAiB;gBACjB,cAAc;gBACd,iBAAiB;gBACjB,gBAAgB;gBAChB,cAAc;gBACd,iBAAiB;gBACjB,WAAW,EAAE;oBACX,KAAK,EAAE,UAAU,CAAC,UAAU;oBAC5B,SAAS,EAAE,gBAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAClD,UAAU,EAAE,UAAU,CAAC,qBAAqB;iBAC7C;gBACD,gBAAgB;gBAChB,cAAc;aACf;SACF,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,EAAE,EAAE,KAAK;YACT,OAAO,EAAE,gCAAgC;YACzC,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe;SAChE,CAAC;IACJ,CAAC;AACH,CAAC"}

package/dist/algorithms/merge/handlers/list-proposals.d.ts

@@ -0,0 +1,45 @@
+/**
+ * MCP Tool: list_merge_proposals
+ *
+ * Lists pending merge proposals for user review
+ */
+interface ListProposalsInput {
+    projectId: string;
+    status?: 'pending' | 'approved' | 'rejected' | 'expired';
+    limit?: number;
+}
+interface ProposalSummary {
+    id: string;
+    projectId: string;
+    sourceMemoryIds: string[];
+    status: 'pending' | 'approved' | 'rejected' | 'expired';
+    confidenceLevel: 'high' | 'medium' | 'low';
+    similarityScore: number;
+    mergeReason: string;
+    createdAt: string;
+    conflictWarnings: string[];
+}
+interface ListProposalsResponse {
+    ok: boolean;
+    message: string;
+    data?: {
+        projectId: string;
+        count: number;
+        proposals: ProposalSummary[];
+        byStatus: {
+            pending: number;
+            approved: number;
+            rejected: number;
+            expired: number;
+        };
+    };
+    error?: string;
+}
+/**
+ * Handle list_merge_proposals tool call
+ *
+ * Lists merge proposals that are waiting for user review
+ */
+export declare function handleListProposals(input: ListProposalsInput): Promise<ListProposalsResponse>;
+export {};
+//# sourceMappingURL=list-proposals.d.ts.map

package/dist/algorithms/merge/handlers/list-proposals.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"list-proposals.d.ts","sourceRoot":"","sources":["../../../../algorithms/merge/handlers/list-proposals.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAQH,UAAU,kBAAkB;IAC1B,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,CAAC,EAAE,SAAS,GAAG,UAAU,GAAG,UAAU,GAAG,SAAS,CAAC;IACzD,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,UAAU,eAAe;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,UAAU,GAAG,SAAS,CAAC;IACxD,eAAe,EAAE,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;IAC3C,eAAe,EAAE,MAAM,CAAC;IACxB,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED,UAAU,qBAAqB;IAC7B,EAAE,EAAE,OAAO,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE;QACL,SAAS,EAAE,MAAM,CAAC;QAClB,KAAK,EAAE,MAAM,CAAC;QACd,SAAS,EAAE,eAAe,EAAE,CAAC;QAC7B,QAAQ,EAAE;YACR,OAAO,EAAE,MAAM,CAAC;YAChB,QAAQ,EAAE,MAAM,CAAC;YACjB,QAAQ,EAAE,MAAM,CAAC;YACjB,OAAO,EAAE,MAAM,CAAC;SACjB,CAAC;KACH,CAAC;IACF,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;;GAIG;AACH,wBAAsB,mBAAmB,CAAC,KAAK,EAAE,kBAAkB,GAAG,OAAO,CAAC,qBAAqB,CAAC,CA6EnG"}