squish-memory 0.8.2 → 0.9.2

package/dist/core/memory/contradiction-resolver.js

@@ -0,0 +1,368 @@
+/**
+ * Contradiction Resolver
+ * Detects and auto-resolves contradictions when writing new memories
+ * Implements supersession logic for outdated information
+ */
+import { eq, and, inArray } from 'drizzle-orm';
+import { getDb } from '../../db/index.js';
+import { getSchema } from '../../db/schema.js';
+import { logger } from '../logger.js';
+import { createAssociation } from '../associations.js';
+/**
+ * Calculate temporal relationship between two time periods
+ * Returns: 'existing_is_newer', 'existing_is_older', 'overlapping', or 'unknown'
+ */
+function calculateTemporalRelationship(existingValidFrom, existingValidTo, newTime) {
+    if (!existingValidFrom && !existingValidTo) {
+        return 'unknown';
+    }
+    const existingFrom = existingValidFrom ? new Date(existingValidFrom) : null;
+    const existingTo = existingValidTo ? new Date(existingValidTo) : null;
+    // If existing fact is completely in the future compared to new time
+    if (existingFrom && existingFrom > newTime) {
+        return 'existing_is_newer';
+    }
+    // If existing fact is completely in the past compared to new time
+    if (existingTo && existingTo < newTime) {
+        return 'existing_is_older';
+    }
+    // If time periods overlap or we can't determine
+    return 'overlapping';
+}
+/**
+ * Check if two temporal periods conflict (don't overlap reasonably)
+ */
+function checkTemporalPeriodConflict(existingStart, existingEnd, newStart, newEnd) {
+    // If we don't have enough info, assume no conflict
+    if (!existingStart || !existingEnd) {
+        return false;
+    }
+    const existingStartDate = new Date(existingStart);
+    const existingEndDate = new Date(existingEnd);
+    // Normalize newEnd (use distant future if null)
+    const normalizedNewEnd = newEnd || new Date(8640000000000000); // Far future
+    // Check if periods overlap
+    const overlaps = !(existingStartDate > normalizedNewEnd ||
+        existingEndDate < newStart);
+    // Conflict if they don't overlap
+    return !overlaps;
+}
+// Patterns that indicate updated/corrected information
+const UPDATE_PATTERNS = [
+    /\b(now|currently|actually|in fact|correct(ed)?|update(d)?)\b/gi,
+    /\b(changed to|switched to|moved to)\b/gi,
+    /\b(formerly|previously|used to be)\b/gi,
+    /\binstead of\b/gi,
+    /\b(no longer|not anymore)\b/gi,
+    /\b(as of|starting|beginning|from now|effective)\s+(\d{4}|\w+\s+\d{1,2})/gi, // Temporal updates
+];
+// Negation patterns
+const NEGATION_PATTERNS = [
+    /\b(not|no|never|don't|doesn't|didn't|won't|wouldn't|shouldn't|can't|cannot)\b/gi,
+];
+// Temporal sensitivity patterns - content that is likely time-sensitive
+const TEMPORAL_SENSITIVITY_PATTERNS = [
+    /\b(date|time|version|release|deadline|schedule|timeline)\b/i,
+    /\b(\d{4}|january|february|march|april|may|june|july|august|september|october|november|december)\b/i,
+    /\b(today|tomorrow|yesterday|next\s+week|last\s+week|this\s+week)\b/i,
+];
+// Key entity extraction for contradiction detection
+function extractKeyEntities(content) {
+    // Simple extraction of capitalized phrases and key terms
+    const entities = [];
+    // Match capitalized multi-word phrases (likely proper nouns)
+    const properNouns = content.match(/\b[A-Z][a-z]+(?:\s+[A-Z][a-z]+)+\b/g) || [];
+    entities.push(...properNouns);
+    // Match quoted strings (often important values)
+    const quoted = content.match(/"([^"]+)"|'([^']+)'/g) || [];
+    entities.push(...quoted.map(q => q.replace(/['"]/g, '')));
+    // Match key-value patterns
+    const keyValues = content.match(/(\w+)\s*[=:]\s*(\S+)/g) || [];
+    entities.push(...keyValues);
+    return [...new Set(entities)];
+}
+// Calculate content similarity (Jaccard on words)
+function calculateSimilarity(a, b) {
+    const tokensA = new Set(a.toLowerCase().split(/\s+/).filter(t => t.length > 2));
+    const tokensB = new Set(b.toLowerCase().split(/\s+/).filter(t => t.length > 2));
+    const intersection = new Set([...tokensA].filter(x => tokensB.has(x)));
+    const union = new Set([...tokensA, ...tokensB]);
+    return union.size > 0 ? intersection.size / union.size : 0;
+}
+// Check if content has negation
+function hasNegation(content) {
+    return NEGATION_PATTERNS.some(pattern => pattern.test(content));
+}
+// Check if content indicates an update
+function hasUpdateIndicator(content) {
+    return UPDATE_PATTERNS.some(pattern => pattern.test(content));
+}
+// Extract the "subject" of a memory (what it's about)
+function extractSubject(content) {
+    // Take first significant clause
+    const sentences = content.split(/[.!?\n]/);
+    const firstSentence = sentences[0]?.trim() || content;
+    // Limit to first 100 chars for subject matching
+    return firstSentence.substring(0, 100).toLowerCase();
+}
+/**
+ * Detect contradictions between new memory and existing memories
+ */
+export async function detectContradictions(check) {
+    const result = {
+        hasContradiction: false,
+        supersededMemories: [],
+        confidence: 0,
+        reason: '',
+    };
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        // Get memories from same project with similar content
+        const whereClause = check.projectId
+            ? eq(schema.memories.projectId, check.projectId)
+            : undefined;
+        const existingMemories = await db
+            .select()
+            .from(schema.memories)
+            .where(whereClause)
+            .limit(100);
+        if (existingMemories.length === 0) {
+            return result;
+        }
+        const newSubject = extractSubject(check.newContent);
+        const newEntities = extractKeyEntities(check.newContent);
+        const newHasNegation = hasNegation(check.newContent);
+        const newHasUpdate = hasUpdateIndicator(check.newContent);
+        const toSupersede = [];
+        let maxConfidence = 0;
+        let reasons = [];
+        for (const existing of existingMemories) {
+            // Skip already superseded memories
+            if (existing.status === 'superseded' || existing.status === 'merged') {
+                continue;
+            }
+            // Skip protected memories
+            if (existing.isProtected) {
+                continue;
+            }
+            const existingSubject = extractSubject(existing.content);
+            const similarity = calculateSimilarity(check.newContent, existing.content);
+            const subjectSimilarity = calculateSimilarity(newSubject, existingSubject);
+            // Check for entity overlap
+            const existingEntities = extractKeyEntities(existing.content);
+            const entityOverlap = newEntities.filter(e => existingEntities.some(ee => ee.toLowerCase().includes(e.toLowerCase()) ||
+                e.toLowerCase().includes(ee.toLowerCase())));
+            // Calculate temporal relationship between memories
+            const temporalRelationship = calculateTemporalRelationship(existing.validFrom, existing.validTo, new Date() // current time for new memory
+            );
+            // Detect contradiction scenarios with temporal awareness
+            // Scenario 1: High similarity with negation in new content
+            if (similarity > 0.5 && newHasNegation && subjectSimilarity > 0.4) {
+                // Adjust confidence based on temporal relevance
+                let temporalFactor = 1.0;
+                if (temporalRelationship === 'existing_is_newer') {
+                    temporalFactor = 0.7; // Lower confidence if existing is newer
+                }
+                else if (temporalRelationship === 'existing_is_older') {
+                    temporalFactor = 1.2; // Higher confidence if existing is older
+                }
+                toSupersede.push(existing.id);
+                maxConfidence = Math.max(maxConfidence, similarity * 0.9 * temporalFactor);
+                reasons.push(`negation of similar content (${(similarity * 100).toFixed(0)}% similar)`);
+                continue;
+            }
+            // Scenario 2: Update indicator with overlapping subject
+            if (newHasUpdate && subjectSimilarity > 0.5) {
+                // Boost confidence for updates when existing is older
+                let temporalFactor = 1.0;
+                if (temporalRelationship === 'existing_is_older') {
+                    temporalFactor = 1.3; // Higher confidence for updating older info
+                }
+                toSupersede.push(existing.id);
+                maxConfidence = Math.max(maxConfidence, subjectSimilarity * 0.85 * temporalFactor);
+                reasons.push(`update to existing information`);
+                continue;
+            }
+            // Scenario 3: Same type, high subject similarity, different conclusion
+            if (existing.type === check.newType && subjectSimilarity > 0.6) {
+                // Check if conclusions differ
+                const existingHasNegation = hasNegation(existing.content);
+                // XOR: one has negation, other doesn't
+                if (newHasNegation !== existingHasNegation) {
+                    // Adjust confidence based on temporal relationship
+                    let temporalFactor = 1.0;
+                    if (temporalRelationship === 'existing_is_newer') {
+                        temporalFactor = 0.8; // Lower confidence if contradicting newer info
+                    }
+                    else if (temporalRelationship === 'existing_is_older') {
+                        temporalFactor = 1.1; // Higher confidence if contradicting older info
+                    }
+                    toSupersede.push(existing.id);
+                    maxConfidence = Math.max(maxConfidence, subjectSimilarity * 0.8 * temporalFactor);
+                    reasons.push(`contradicting statement about same topic`);
+                    continue;
+                }
+            }
+            // Scenario 4: Entity overlap with correction signals
+            if (entityOverlap.length >= 2 && similarity > 0.3) {
+                const correctionSignals = /\b(fixed|changed|updated|replaced|removed|added)\b/i.test(check.newContent);
+                if (correctionSignals) {
+                    // Consider temporal relevance for corrections
+                    let temporalFactor = 1.0;
+                    if (temporalRelationship === 'existing_is_older') {
+                        temporalFactor = 1.2; // Higher confidence for correcting older info
+                    }
+                    toSupersede.push(existing.id);
+                    maxConfidence = Math.max(maxConfidence, 0.75 * temporalFactor);
+                    reasons.push(`correction involving ${entityOverlap.slice(0, 2).join(', ')}`);
+                    continue;
+                }
+            }
+            // Scenario 5: Very high similarity (near-duplicate) - supersede older
+            if (similarity > 0.85) {
+                // Prefer to supersede older memories with newer ones
+                let temporalFactor = 1.0;
+                if (temporalRelationship === 'existing_is_older') {
+                    temporalFactor = 1.1; // Slight boost for superseding older
+                }
+                else if (temporalRelationship === 'existing_is_newer') {
+                    temporalFactor = 0.9; // Slight reduction for superseding newer
+                }
+                toSupersede.push(existing.id);
+                maxConfidence = Math.max(maxConfidence, similarity * temporalFactor);
+                reasons.push(`near-duplicate replacement`);
+                continue;
+            }
+            // Scenario 6: Temporal inconsistency - same subject but different time periods
+            if (subjectSimilarity > 0.7 && similarity > 0.4 &&
+                existing.validFrom && existing.validTo) {
+                // Check if temporal periods don't overlap reasonably
+                const newValidFrom = new Date(); // When we learned this
+                const newValidTo = null; // Open-ended by default
+                const hasTemporalConflict = checkTemporalPeriodConflict(existing.validFrom, existing.validTo, newValidFrom, newValidTo);
+                if (hasTemporalConflict) {
+                    toSupersede.push(existing.id);
+                    maxConfidence = Math.max(maxConfidence, 0.8);
+                    reasons.push(`temporal inconsistency with existing fact`);
+                    continue;
+                }
+            }
+        }
+        if (toSupersede.length > 0) {
+            result.hasContradiction = true;
+            result.supersededMemories = [...new Set(toSupersede)]; // Dedupe
+            result.confidence = maxConfidence;
+            result.reason = reasons[0] || 'contradiction detected';
+        }
+    }
+    catch (error) {
+        logger.error('Error detecting contradictions', error);
+    }
+    return result;
+}
+/**
+ * Apply supersession to memories - archive old ones and create associations
+ */
+export async function applySupersession(newMemoryId, supersededIds, confidence) {
+    if (supersededIds.length === 0)
+        return;
+    try {
+        const db = await getDb();
+        const schema = await getSchema();
+        const now = new Date();
+        // Update superseded memories
+        await db
+            .update(schema.memories)
+            .set({
+            status: 'superseded',
+            supersededBy: newMemoryId,
+            supersededAt: now,
+            updatedAt: now,
+        })
+            .where(inArray(schema.memories.id, supersededIds));
+        // Create associations for traceability
+        for (const oldId of supersededIds) {
+            await createAssociation(newMemoryId, oldId, 'supersedes', confidence);
+        }
+        logger.info('Applied supersession', {
+            newMemoryId,
+            supersededCount: supersededIds.length,
+            confidence,
+        });
+    }
+    catch (error) {
+        logger.error('Error applying supersession', error);
+    }
+}
+/**
+ * Check for temporal contradictions (facts that are no longer valid)
+ */
+export async function checkTemporalContradictions(content, projectId) {
+    const supersededIds = [];
+    try {
+        // Look for temporal update patterns
+        const temporalUpdates = content.match(/\b(as of|starting|beginning|from now|effective)\s+(\d{4}|\w+\s+\d{1,2})/gi);
+        if (!temporalUpdates || temporalUpdates.length === 0) {
+            return supersededIds;
+        }
+        const db = await getDb();
+        const schema = await getSchema();
+        // Find memories with overlapping subject but older validTo dates
+        const subject = extractSubject(content);
+        const whereClause = projectId
+            ? and(eq(schema.memories.projectId, projectId), eq(schema.memories.status, 'active'))
+            : eq(schema.memories.status, 'active');
+        const candidates = await db
+            .select()
+            .from(schema.memories)
+            .where(whereClause)
+            .limit(50);
+        for (const candidate of candidates) {
+            const candidateSubject = extractSubject(candidate.content);
+            const similarity = calculateSimilarity(subject, candidateSubject);
+            if (similarity > 0.5 && candidate.validTo) {
+                const validToDate = new Date(candidate.validTo);
+                const now = new Date();
+                // If the candidate's validity period has passed
+                if (validToDate < now) {
+                    supersededIds.push(candidate.id);
+                }
+            }
+        }
+    }
+    catch (error) {
+        logger.error('Error checking temporal contradictions', error);
+    }
+    return supersededIds;
+}
+/**
+ * Integrated contradiction resolution for the write path
+ * Call this before storing a new memory
+ */
+export async function resolveContradictions(content, type, projectId) {
+    // Detect standard contradictions
+    const contradictionResult = await detectContradictions({
+        newContent: content,
+        newType: type,
+        projectId,
+    });
+    // Also check temporal contradictions
+    const temporalSuperseded = await checkTemporalContradictions(content, projectId);
+    // Combine results
+    const allSuperseded = [
+        ...new Set([
+            ...contradictionResult.supersededMemories,
+            ...temporalSuperseded,
+        ]),
+    ];
+    const maxConfidence = Math.max(contradictionResult.confidence, temporalSuperseded.length > 0 ? 0.7 : 0);
+    return {
+        shouldProceed: true, // Always proceed, but track supersessions
+        supersededIds: allSuperseded,
+        confidence: maxConfidence,
+        reason: contradictionResult.reason ||
+            (temporalSuperseded.length > 0 ? 'temporal supersession' : ''),
+    };
+}
+//# sourceMappingURL=contradiction-resolver.js.map

package/dist/core/memory/contradiction-resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"contradiction-resolver.js","sourceRoot":"","sources":["../../../core/memory/contradiction-resolver.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAgBvD;;;GAGG;AACH,SAAS,6BAA6B,CACpC,iBAAgC,EAChC,eAA8B,EAC9B,OAAa;IAEb,IAAI,CAAC,iBAAiB,IAAI,CAAC,eAAe,EAAE,CAAC;QAC3C,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,YAAY,GAAG,iBAAiB,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC5E,MAAM,UAAU,GAAG,eAAe,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAEtE,oEAAoE;IACpE,IAAI,YAAY,IAAI,YAAY,GAAG,OAAO,EAAE,CAAC;QAC3C,OAAO,mBAAmB,CAAC;IAC7B,CAAC;IAED,kEAAkE;IAClE,IAAI,UAAU,IAAI,UAAU,GAAG,OAAO,EAAE,CAAC;QACvC,OAAO,mBAAmB,CAAC;IAC7B,CAAC;IAED,gDAAgD;IAChD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;GAEG;AACH,SAAS,2BAA2B,CAClC,aAA4B,EAC5B,WAA0B,EAC1B,QAAc,EACd,MAAmB;IAEnB,mDAAmD;IACnD,IAAI,CAAC,aAAa,IAAI,CAAC,WAAW,EAAE,CAAC;QACnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,iBAAiB,GAAG,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC;IAClD,MAAM,eAAe,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC;IAE9C,gDAAgD;IAChD,MAAM,gBAAgB,GAAG,MAAM,IAAI,IAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,aAAa;IAE5E,2BAA2B;IAC3B,MAAM,QAAQ,GAAG,CAAC,CAAC,iBAAiB,GAAG,gBAAgB;QACrC,eAAe,GAAG,QAAQ,CAAC,CAAC;IAE9C,iCAAiC;IACjC,OAAO,CAAC,QAAQ,CAAC;AACnB,CAAC;AAED,uDAAuD;AACvD,MAAM,eAAe,GAAG;IACtB,gEAAgE;IAChE,yCAAyC;IACzC,wCAAwC;IACxC,kBAAkB;IAClB,+BAA+B;IAC/B,2EAA2E,EAAE,mBAAmB;CACjG,CAAC;AAEF,oBAAoB;AACpB,MAAM,iBAAiB,GAAG;IACxB,iFAAiF;CAClF,CAAC;AAEF,wEAAwE;AACxE,MAAM,6BAA6B,GAAG;IACpC,6DAA6D;IAC7D,oGAAoG;IACpG,qEAAqE;CACtE,CAAC;AAEF,oDAAoD;AACpD,SAAS,kBAAkB,CAAC,OAAe;IACzC,yDAAyD;IACzD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,6DAA6D;IAC7D,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,qCAAqC,CAAC,IAAI,EAAE,CAAC;IAC/E,QAAQ,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;IAE9B,gDAAgD;IAChD,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,IAAI,EAAE,CAAC;IAC3D,QAAQ,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAE1D,2BAA2B;IAC3B,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,uBAAuB,CAAC,IAAI,EAAE,CAAC;IAC/D,QAAQ,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAE5B,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;AAChC,CAAC;AAED,kDAAkD;AAClD,SAAS,mBAAmB,CAAC,CAAS,EAAE,CAAS;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAChF,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAEhD,OAAO,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,gCAAgC;AAChC,SAAS,WAAW,CAAC,OAAe;IAClC,OAAO,iBAAiB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AAClE,CAAC;AAED,uCAAuC;AACvC,SAAS,kBAAkB,CAAC,OAAe;IACzC,OAAO,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;AAChE,CAAC;AAED,sDAAsD;AACtD,SAAS,cAAc,CAAC,OAAe;IACrC,gCAAgC;IAChC,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;IAC3C,MAAM,aAAa,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,OAAO,CAAC;IAEtD,gDAAgD;IAChD,OAAO,aAAa,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;AACvD,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,oBAAoB,CAAC,KAAyB;IAClE,MAAM,MAAM,GAAwB;QAClC,gBAAgB,EAAE,KAAK;QACvB,kBAAkB,EAAE,EAAE;QACtB,UAAU,EAAE,CAAC;QACb,MAAM,EAAE,EAAE;KACX,CAAC;IAEF,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,sDAAsD;QACtD,MAAM,WAAW,GAAG,KAAK,CAAC,SAAS;YACjC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC;YAChD,CAAC,CAAC,SAAS,CAAC;QAEd,MAAM,gBAAgB,GAAG,MAAO,EAAU;aACvC,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,WAAW,CAAC;aAClB,KAAK,CAAC,GAAG,CAAC,CAAC;QAEd,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACpD,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACzD,MAAM,cAAc,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QACrD,MAAM,YAAY,GAAG,kBAAkB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAE1D,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,OAAO,GAAa,EAAE,CAAC;QAE3B,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;YACxC,mCAAmC;YACnC,IAAI,QAAQ,CAAC,MAAM,KAAK,YAAY,IAAI,QAAQ,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACrE,SAAS;YACX,CAAC;YAED,0BAA0B;YAC1B,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC;gBACzB,SAAS;YACX,CAAC;YAED,MAAM,eAAe,GAAG,cAAc,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACzD,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC3E,MAAM,iBAAiB,GAAG,mBAAmB,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;YAE3E,2BAA2B;YAC3B,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YAC9D,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAC3C,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;gBAC1C,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,CACxE,CAAC;YAED,mDAAmD;YACnD,MAAM,oBAAoB,GAAG,6BAA6B,CACxD,QAAQ,CAAC,SAAS,EAClB,QAAQ,CAAC,OAAO,EAChB,IAAI,IAAI,EAAE,CAAC,8BAA8B;aAC1C,CAAC;YAEF,yDAAyD;YAEzD,2DAA2D;YAC3D,IAAI,UAAU,GAAG,GAAG,IAAI,cAAc,IAAI,iBAAiB,GAAG,GAAG,EAAE,CAAC;gBAClE,gDAAgD;gBAChD,IAAI,cAAc,GAAG,GAAG,CAAC;gBACzB,IAAI,oBAAoB,KAAK,mBAAmB,EAAE,CAAC;oBACjD,cAAc,GAAG,GAAG,CAAC,CAAC,wCAAwC;gBAChE,CAAC;qBAAM,IAAI,oBAAoB,KAAK,mBAAmB,EAAE,CAAC;oBACxD,cAAc,GAAG,GAAG,CAAC,CAAC,yCAAyC;gBACjE,CAAC;gBAED,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAC9B,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,UAAU,GAAG,GAAG,GAAG,cAAc,CAAC,CAAC;gBAC3E,OAAO,CAAC,IAAI,CAAC,gCAAgC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;gBACxF,SAAS;YACX,CAAC;YAED,wDAAwD;YACxD,IAAI,YAAY,IAAI,iBAAiB,GAAG,GAAG,EAAE,CAAC;gBAC5C,sDAAsD;gBACtD,IAAI,cAAc,GAAG,GAAG,CAAC;gBACzB,IAAI,oBAAoB,KAAK,mBAAmB,EAAE,CAAC;oBACjD,cAAc,GAAG,GAAG,CAAC,CAAC,4CAA4C;gBACpE,CAAC;gBAED,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAC9B,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,iBAAiB,GAAG,IAAI,GAAG,cAAc,CAAC,CAAC;gBACnF,OAAO,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;gBAC/C,SAAS;YACX,CAAC;YAED,uEAAuE;YACvE,IAAI,QAAQ,CAAC,IAAI,KAAK,KAAK,CAAC,OAAO,IAAI,iBAAiB,GAAG,GAAG,EAAE,CAAC;gBAC/D,8BAA8B;gBAC9B,MAAM,mBAAmB,GAAG,WAAW,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;gBAE1D,uCAAuC;gBACvC,IAAI,cAAc,KAAK,mBAAmB,EAAE,CAAC;oBAC3C,mDAAmD;oBACnD,IAAI,cAAc,GAAG,GAAG,CAAC;oBACzB,IAAI,oBAAoB,KAAK,mBAAmB,EAAE,CAAC;wBACjD,cAAc,GAAG,GAAG,CAAC,CAAC,+CAA+C;oBACvE,CAAC;yBAAM,IAAI,oBAAoB,KAAK,mBAAmB,EAAE,CAAC;wBACxD,cAAc,GAAG,GAAG,CAAC,CAAC,gDAAgD;oBACxE,CAAC;oBAED,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC9B,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,iBAAiB,GAAG,GAAG,GAAG,cAAc,CAAC,CAAC;oBAClF,OAAO,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;oBACzD,SAAS;gBACX,CAAC;YACH,CAAC;YAED,qDAAqD;YACrD,IAAI,aAAa,CAAC,MAAM,IAAI,CAAC,IAAI,UAAU,GAAG,GAAG,EAAE,CAAC;gBAClD,MAAM,iBAAiB,GAAG,qDAAqD,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBACvG,IAAI,iBAAiB,EAAE,CAAC;oBACtB,8CAA8C;oBAC9C,IAAI,cAAc,GAAG,GAAG,CAAC;oBACzB,IAAI,oBAAoB,KAAK,mBAAmB,EAAE,CAAC;wBACjD,cAAc,GAAG,GAAG,CAAC,CAAC,8CAA8C;oBACtE,CAAC;oBAED,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC9B,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,GAAG,cAAc,CAAC,CAAC;oBAC/D,OAAO,CAAC,IAAI,CAAC,wBAAwB,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBAC7E,SAAS;gBACX,CAAC;YACH,CAAC;YAED,sEAAsE;YACtE,IAAI,UAAU,GAAG,IAAI,EAAE,CAAC;gBACtB,qDAAqD;gBACrD,IAAI,cAAc,GAAG,GAAG,CAAC;gBACzB,IAAI,oBAAoB,KAAK,mBAAmB,EAAE,CAAC;oBACjD,cAAc,GAAG,GAAG,CAAC,CAAC,qCAAqC;gBAC7D,CAAC;qBAAM,IAAI,oBAAoB,KAAK,mBAAmB,EAAE,CAAC;oBACxD,cAAc,GAAG,GAAG,CAAC,CAAC,yCAAyC;gBACjE,CAAC;gBAED,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBAC9B,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,UAAU,GAAG,cAAc,CAAC,CAAC;gBACrE,OAAO,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;gBAC3C,SAAS;YACX,CAAC;YAED,+EAA+E;YAC/E,IAAI,iBAAiB,GAAG,GAAG,IAAI,UAAU,GAAG,GAAG;gBAC3C,QAAQ,CAAC,SAAS,IAAI,QAAQ,CAAC,OAAO,EAAE,CAAC;gBAC3C,qDAAqD;gBACrD,MAAM,YAAY,GAAG,IAAI,IAAI,EAAE,CAAC,CAAC,uBAAuB;gBACxD,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,wBAAwB;gBAEjD,MAAM,mBAAmB,GAAG,2BAA2B,CACrD,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,OAAO,EACpC,YAAY,EAAE,UAAU,CACzB,CAAC;gBAEF,IAAI,mBAAmB,EAAE,CAAC;oBACxB,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC9B,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;oBAC7C,OAAO,CAAC,IAAI,CAAC,2CAA2C,CAAC,CAAC;oBAC1D,SAAS;gBACX,CAAC;YACH,CAAC;QACJ,CAAC;QAED,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,CAAC,gBAAgB,GAAG,IAAI,CAAC;YAC/B,MAAM,CAAC,kBAAkB,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS;YAChE,MAAM,CAAC,UAAU,GAAG,aAAa,CAAC;YAClC,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,wBAAwB,CAAC;QACzD,CAAC;IAEH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,gCAAgC,EAAE,KAAK,CAAC,CAAC;IACxD,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CACrC,WAAmB,EACnB,aAAuB,EACvB,UAAkB;IAElB,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAEvC,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QACjC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QAEvB,6BAA6B;QAC7B,MAAO,EAAU;aACd,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;aACvB,GAAG,CAAC;YACH,MAAM,EAAE,YAAY;YACpB,YAAY,EAAE,WAAW;YACzB,YAAY,EAAE,GAAG;YACjB,SAAS,EAAE,GAAG;SACf,CAAC;aACD,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC,CAAC;QAErD,uCAAuC;QACvC,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;YAClC,MAAM,iBAAiB,CAAC,WAAW,EAAE,KAAK,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QACxE,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,sBAAsB,EAAE;YAClC,WAAW;YACX,eAAe,EAAE,aAAa,CAAC,MAAM;YACrC,UAAU;SACX,CAAC,CAAC;IAEL,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,6BAA6B,EAAE,KAAK,CAAC,CAAC;IACrD,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,2BAA2B,CAC/C,OAAe,EACf,SAAkB;IAElB,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,IAAI,CAAC;QACH,oCAAoC;QACpC,MAAM,eAAe,GAAG,OAAO,CAAC,KAAK,CACnC,2EAA2E,CAC5E,CAAC;QAEF,IAAI,CAAC,eAAe,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrD,OAAO,aAAa,CAAC;QACvB,CAAC;QAED,MAAM,EAAE,GAAG,MAAM,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;QAEjC,iEAAiE;QACjE,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;QAExC,MAAM,WAAW,GAAG,SAAS;YAC3B,CAAC,CAAC,GAAG,CACD,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC,EACxC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CACrC;YACH,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAEzC,MAAM,UAAU,GAAG,MAAO,EAAU;aACjC,MAAM,EAAE;aACR,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;aACrB,KAAK,CAAC,WAAW,CAAC;aAClB,KAAK,CAAC,EAAE,CAAC,CAAC;QAEb,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,gBAAgB,GAAG,cAAc,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAC3D,MAAM,UAAU,GAAG,mBAAmB,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;YAElE,IAAI,UAAU,GAAG,GAAG,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;gBAChD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;gBAEvB,gDAAgD;gBAChD,IAAI,WAAW,GAAG,GAAG,EAAE,CAAC;oBACtB,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACnC,CAAC;YACH,CAAC;QACH,CAAC;IAEH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,KAAK,CAAC,wCAAwC,EAAE,KAAK,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,qBAAqB,CACzC,OAAe,EACf,IAAY,EACZ,SAAkB;IAOlB,iCAAiC;IACjC,MAAM,mBAAmB,GAAG,MAAM,oBAAoB,CAAC;QACrD,UAAU,EAAE,OAAO;QACnB,OAAO,EAAE,IAAI;QACb,SAAS;KACV,CAAC,CAAC;IAEH,qCAAqC;IACrC,MAAM,kBAAkB,GAAG,MAAM,2BAA2B,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAEjF,kBAAkB;IAClB,MAAM,aAAa,GAAG;QACpB,GAAG,IAAI,GAAG,CAAC;YACT,GAAG,mBAAmB,CAAC,kBAAkB;YACzC,GAAG,kBAAkB;SACtB,CAAC;KACH,CAAC;IAEF,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAC5B,mBAAmB,CAAC,UAAU,EAC9B,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CACxC,CAAC;IAEF,OAAO;QACL,aAAa,EAAE,IAAI,EAAE,0CAA0C;QAC/D,aAAa,EAAE,aAAa;QAC5B,UAAU,EAAE,aAAa;QACzB,MAAM,EAAE,mBAAmB,CAAC,MAAM;YAC1B,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,EAAE,CAAC;KACvE,CAAC;AACJ,CAAC"}

package/dist/core/memory/edit-workflow.d.ts

@@ -0,0 +1,19 @@
+export interface EditProposal {
+    id: string;
+    memoryId: string;
+    currentContent: string;
+    proposedContent: string;
+    reason: string;
+    conflictWarnings: string[];
+    status: 'pending' | 'approved' | 'rejected' | 'expired';
+    version: number;
+    createdAt: Date;
+    reviewedAt?: Date;
+    reviewNotes?: string;
+}
+export declare function createEditProposal(memoryId: string, currentContent: string, proposedContent: string, reason: string, userId?: string): Promise<EditProposal>;
+export declare function approveEditProposal(proposalId: string): Promise<boolean>;
+export declare function rejectEditProposal(proposalId: string, reviewNotes: string): Promise<boolean>;
+export declare function detectConflicts(memoryId: string, proposedContent: string): Promise<string[]>;
+export declare function getEditProposals(memoryId?: string, status?: 'pending' | 'approved' | 'rejected'): Promise<EditProposal[]>;
+//# sourceMappingURL=edit-workflow.d.ts.map

package/dist/core/memory/edit-workflow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edit-workflow.d.ts","sourceRoot":"","sources":["../../../core/memory/edit-workflow.ts"],"names":[],"mappings":"AAQA,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,QAAQ,EAAE,MAAM,CAAC;IACjB,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,gBAAgB,EAAE,MAAM,EAAE,CAAC;IAC3B,MAAM,EAAE,SAAS,GAAG,UAAU,GAAG,UAAU,GAAG,SAAS,CAAC;IACxD,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,IAAI,CAAC;IAChB,UAAU,CAAC,EAAE,IAAI,CAAC;IAClB,WAAW,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,wBAAsB,kBAAkB,CACtC,QAAQ,EAAE,MAAM,EAChB,cAAc,EAAE,MAAM,EACtB,eAAe,EAAE,MAAM,EACvB,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,YAAY,CAAC,CAsCvB;AAED,wBAAsB,mBAAmB,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CA4B9E;AAED,wBAAsB,kBAAkB,CAAC,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAUlG;AAED,wBAAsB,eAAe,CAAC,QAAQ,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CA0ClG;AAED,wBAAsB,gBAAgB,CACpC,QAAQ,CAAC,EAAE,MAAM,EACjB,MAAM,CAAC,EAAE,SAAS,GAAG,UAAU,GAAG,UAAU,GAC3C,OAAO,CAAC,YAAY,EAAE,CAAC,CAgBzB"}

package/dist/core/memory/edit-workflow.js

@@ -0,0 +1,120 @@
+import { randomUUID } from 'crypto';
+import { eq, and, sql } from 'drizzle-orm';
+import { getDb } from '../../db/index.js';
+import { getSchema } from '../../db/schema.js';
+import { createDatabaseClient } from '../../core/database.js';
+export async function createEditProposal(memoryId, currentContent, proposedContent, reason, userId) {
+    const db = createDatabaseClient(await getDb());
+    const schema = await getSchema();
+    const { memoryEditProposals } = schema;
+    const proposalId = randomUUID();
+    const now = new Date();
+    await db.insert(memoryEditProposals).values({
+        id: proposalId,
+        memoryId,
+        currentContent,
+        proposedContent,
+        reason,
+        conflictWarnings: [],
+        status: 'pending',
+        version: 1,
+        createdAt: now,
+        userId,
+    });
+    // Run conflict detection
+    const conflicts = await detectConflicts(memoryId, proposedContent);
+    await db.update(memoryEditProposals)
+        .set({ conflictWarnings: conflicts })
+        .where(eq(memoryEditProposals.id, proposalId));
+    return {
+        id: proposalId,
+        memoryId,
+        currentContent,
+        proposedContent,
+        reason,
+        conflictWarnings: conflicts,
+        status: 'pending',
+        version: 1,
+        createdAt: now,
+    };
+}
+export async function approveEditProposal(proposalId) {
+    const db = createDatabaseClient(await getDb());
+    const schema = await getSchema();
+    const { memoryEditProposals, memories } = schema;
+    // Get proposal
+    const proposal = await db.select()
+        .from(memoryEditProposals)
+        .where(eq(memoryEditProposals.id, proposalId))
+        .limit(1);
+    if (proposal.length === 0)
+        return false;
+    // Update memory content
+    await db.update(memories)
+        .set({
+        content: proposal[0].proposedContent,
+        version: sql `${memories.version} + 1`,
+        updatedAt: new Date()
+    })
+        .where(eq(memories.id, proposal[0].memoryId));
+    // Mark proposal as approved
+    await db.update(memoryEditProposals)
+        .set({ status: 'approved', reviewedAt: new Date() })
+        .where(eq(memoryEditProposals.id, proposalId));
+    return true;
+}
+export async function rejectEditProposal(proposalId, reviewNotes) {
+    const db = createDatabaseClient(await getDb());
+    const schema = await getSchema();
+    const { memoryEditProposals } = schema;
+    await db.update(memoryEditProposals)
+        .set({ status: 'rejected', reviewNotes, reviewedAt: new Date() })
+        .where(eq(memoryEditProposals.id, proposalId));
+    return true;
+}
+export async function detectConflicts(memoryId, proposedContent) {
+    const db = createDatabaseClient(await getDb());
+    const schema = await getSchema();
+    const { memories } = schema;
+    // Get current memory
+    const currentMemory = await db.select()
+        .from(memories)
+        .where(eq(memories.id, memoryId))
+        .limit(1);
+    if (currentMemory.length === 0)
+        return [];
+    const conflicts = [];
+    // Check for temporal contradictions
+    if (currentMemory[0].validFrom && currentMemory[0].validTo) {
+        const now = new Date();
+        if (now < new Date(currentMemory[0].validFrom) || now > new Date(currentMemory[0].validTo)) {
+            conflicts.push('Current time is outside validity period');
+        }
+    }
+    // Check for semantic contradictions with other memories
+    const similarMemories = await db.select()
+        .from(memories)
+        .where(and(eq(memories.projectId, currentMemory[0].projectId), sql `memories.id != ${memoryId}`, sql `memories.content ILIKE ${proposedContent}`))
+        .limit(5);
+    for (const memory of similarMemories) {
+        if (memory.id !== memoryId) {
+            conflicts.push(`Potential contradiction with memory ${memory.id}`);
+        }
+    }
+    return conflicts;
+}
+export async function getEditProposals(memoryId, status) {
+    const db = createDatabaseClient(await getDb());
+    const schema = await getSchema();
+    const { memoryEditProposals } = schema;
+    let query = db.select().from(memoryEditProposals);
+    if (memoryId) {
+        query = query.where(eq(memoryEditProposals.memoryId, memoryId));
+    }
+    if (status) {
+        query = query.where(eq(memoryEditProposals.status, status));
+    }
+    const proposals = await query;
+    return proposals;
+}
+//# sourceMappingURL=edit-workflow.js.map

package/dist/core/memory/edit-workflow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edit-workflow.js","sourceRoot":"","sources":["../../../core/memory/edit-workflow.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AACpC,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAC;AAC1C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAkB9D,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,QAAgB,EAChB,cAAsB,EACtB,eAAuB,EACvB,MAAc,EACd,MAAe;IAEf,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;IACjC,MAAM,EAAE,mBAAmB,EAAE,GAAG,MAAM,CAAC;IAEvC,MAAM,UAAU,GAAG,UAAU,EAAE,CAAC;IAChC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;IAEvB,MAAM,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC,MAAM,CAAC;QAC1C,EAAE,EAAE,UAAU;QACd,QAAQ;QACR,cAAc;QACd,eAAe;QACf,MAAM;QACN,gBAAgB,EAAE,EAAE;QACpB,MAAM,EAAE,SAAS;QACjB,OAAO,EAAE,CAAC;QACV,SAAS,EAAE,GAAG;QACd,MAAM;KACP,CAAC,CAAC;IAEH,yBAAyB;IACzB,MAAM,SAAS,GAAG,MAAM,eAAe,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;IACnE,MAAM,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC;SACjC,GAAG,CAAC,EAAE,gBAAgB,EAAE,SAAS,EAAE,CAAC;SACpC,KAAK,CAAC,EAAE,CAAC,mBAAmB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;IAEjD,OAAO;QACL,EAAE,EAAE,UAAU;QACd,QAAQ;QACR,cAAc;QACd,eAAe;QACf,MAAM;QACN,gBAAgB,EAAE,SAAS;QAC3B,MAAM,EAAE,SAAS;QACjB,OAAO,EAAE,CAAC;QACV,SAAS,EAAE,GAAG;KACf,CAAC;AACJ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,mBAAmB,CAAC,UAAkB;IAC1D,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;IACjC,MAAM,EAAE,mBAAmB,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;IAEjD,eAAe;IACf,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,MAAM,EAAE;SAC/B,IAAI,CAAC,mBAAmB,CAAC;SACzB,KAAK,CAAC,EAAE,CAAC,mBAAmB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;SAC7C,KAAK,CAAC,CAAC,CAAC,CAAC;IAEZ,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAExC,wBAAwB;IACxB,MAAM,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC;SACtB,GAAG,CAAC;QACH,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,eAAe;QACpC,OAAO,EAAE,GAAG,CAAA,GAAG,QAAQ,CAAC,OAAO,MAAM;QACrC,SAAS,EAAE,IAAI,IAAI,EAAE;KACtB,CAAC;SACD,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAEhD,4BAA4B;IAC5B,MAAM,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC;SACjC,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,IAAI,IAAI,EAAE,EAAE,CAAC;SACnD,KAAK,CAAC,EAAE,CAAC,mBAAmB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;IAEjD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,kBAAkB,CAAC,UAAkB,EAAE,WAAmB;IAC9E,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;IACjC,MAAM,EAAE,mBAAmB,EAAE,GAAG,MAAM,CAAC;IAEvC,MAAM,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC;SACjC,GAAG,CAAC,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,EAAE,IAAI,IAAI,EAAE,EAAE,CAAC;SAChE,KAAK,CAAC,EAAE,CAAC,mBAAmB,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;IAEjD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,QAAgB,EAAE,eAAuB;IAC7E,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;IACjC,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;IAE5B,qBAAqB;IACrB,MAAM,aAAa,GAAG,MAAM,EAAE,CAAC,MAAM,EAAE;SACpC,IAAI,CAAC,QAAQ,CAAC;SACd,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;SAChC,KAAK,CAAC,CAAC,CAAC,CAAC;IAEZ,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE1C,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,oCAAoC;IACpC,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3D,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3F,SAAS,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,wDAAwD;IACxD,MAAM,eAAe,GAAG,MAAM,EAAE,CAAC,MAAM,EAAE;SACtC,IAAI,CAAC,QAAQ,CAAC;SACd,KAAK,CACJ,GAAG,CACD,EAAE,CAAC,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAClD,GAAG,CAAA,kBAAkB,QAAQ,EAAE,EAC/B,GAAG,CAAA,0BAA0B,eAAe,EAAE,CAC/C,CACF;SACA,KAAK,CAAC,CAAC,CAAC,CAAC;IAEZ,KAAK,MAAM,MAAM,IAAI,eAAe,EAAE,CAAC;QACrC,IAAI,MAAM,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;YAC3B,SAAS,CAAC,IAAI,CAAC,uCAAuC,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;QACrE,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,QAAiB,EACjB,MAA4C;IAE5C,MAAM,EAAE,GAAG,oBAAoB,CAAC,MAAM,KAAK,EAAE,CAAC,CAAC;IAC/C,MAAM,MAAM,GAAG,MAAM,SAAS,EAAE,CAAC;IACjC,MAAM,EAAE,mBAAmB,EAAE,GAAG,MAAM,CAAC;IAEvC,IAAI,KAAK,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IAElD,IAAI,QAAQ,EAAE,CAAC;QACb,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;IAClE,CAAC;IACD,IAAI,MAAM,EAAE,CAAC;QACX,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,MAAM,SAAS,GAAG,MAAM,KAAK,CAAC;IAC9B,OAAO,SAA2B,CAAC;AACrC,CAAC"}

package/dist/core/memory/feedback-tracker.d.ts

@@ -0,0 +1,12 @@
+/** Feedback Tracker - Track memory usage in responses for Echo/Fizzle loop */
+export declare function recordInjection(sessionId: string, memoryIds: string[], memoryContent: Map<string, string>): Promise<void>;
+export declare function analyzeAndRecordFeedback(sessionId: string, responseText: string): Promise<void>;
+export declare function updateRetrievalPriority(memoryId: string, delta: number): Promise<void>;
+export declare function getMemoryFeedbackStats(memoryId: string): Promise<{
+    totalInjections: number;
+    totalReferences: number;
+    echoRate: number;
+    averagePriorityDelta: number;
+}>;
+export declare function cleanupInjectionTracker(maxAgeMs?: number): void;
+//# sourceMappingURL=feedback-tracker.d.ts.map

package/dist/core/memory/feedback-tracker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"feedback-tracker.d.ts","sourceRoot":"","sources":["../../../core/memory/feedback-tracker.ts"],"names":[],"mappings":"AAAA,8EAA8E;AAiB9E,wBAAsB,eAAe,CACnC,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EAAE,EACnB,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GACjC,OAAO,CAAC,IAAI,CAAC,CA6Bf;AAED,wBAAsB,wBAAwB,CAC5C,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,MAAM,GACnB,OAAO,CAAC,IAAI,CAAC,CA+Df;AAaD,wBAAsB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAyB5F;AAED,wBAAsB,sBAAsB,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC;IACtE,eAAe,EAAE,MAAM,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,QAAQ,EAAE,MAAM,CAAC;IACjB,oBAAoB,EAAE,MAAM,CAAC;CAC9B,CAAC,CAuBD;AAED,wBAAgB,uBAAuB,CAAC,QAAQ,GAAE,MAAgB,GAAG,IAAI,CAOxE"}