morpheus-cli 0.3.3 → 0.3.6

package/dist/runtime/memory/sati/repository.js

@@ -31,124 +31,124 @@ export class SatiRepository {
     createSchema() {
         if (!this.db)
             throw new Error('DB not initialized');
-        this.db.exec(`
-    -- ===============================
-    -- 1️⃣ TABELA PRINCIPAL
-    -- ===============================
-    CREATE TABLE IF NOT EXISTS long_term_memory (
-      id TEXT PRIMARY KEY,
-      category TEXT NOT NULL,
-      importance TEXT NOT NULL,
-      summary TEXT NOT NULL,
-      details TEXT,
-      hash TEXT NOT NULL UNIQUE,
-      source TEXT,
-      created_at TEXT NOT NULL,
-      updated_at TEXT NOT NULL,
-      last_accessed_at TEXT,
-      access_count INTEGER DEFAULT 0,
-      version INTEGER DEFAULT 1,
-      archived INTEGER DEFAULT 0
-    );
-
-    CREATE INDEX IF NOT EXISTS idx_memory_category 
-      ON long_term_memory(category);
-
-    CREATE INDEX IF NOT EXISTS idx_memory_importance 
-      ON long_term_memory(importance);
-
-    CREATE INDEX IF NOT EXISTS idx_memory_archived 
-      ON long_term_memory(archived);
-
-    -- ===============================
-    -- 2️⃣ FTS5
-    -- ===============================
-    CREATE VIRTUAL TABLE IF NOT EXISTS memory_fts USING fts5(
-      summary,
-      details,
-      content='long_term_memory',
-      content_rowid='rowid',
-      tokenize = 'unicode61 remove_diacritics 2'
-    );
-
-    -- ===============================
-    -- 3️⃣ VECTOR TABLE (vec0)
-    -- ===============================
-    CREATE VIRTUAL TABLE IF NOT EXISTS memory_vec USING vec0(
-      embedding float[${EMBEDDING_DIM}]
-    );
-
-    CREATE TABLE IF NOT EXISTS memory_embedding_map (
-      memory_id TEXT PRIMARY KEY,
-      vec_rowid INTEGER NOT NULL
-    );
-
-    -- ===============================
-    -- 4️⃣ TRIGGERS FTS
-    -- ===============================
-    CREATE TRIGGER IF NOT EXISTS memory_ai 
-    AFTER INSERT ON long_term_memory BEGIN
-      INSERT INTO memory_fts(rowid, summary, details)
-      VALUES (new.rowid, new.summary, new.details);
-    END;
-
-    CREATE TRIGGER IF NOT EXISTS memory_ad 
-    AFTER DELETE ON long_term_memory BEGIN
-      INSERT INTO memory_fts(memory_fts, rowid, summary, details)
-      VALUES('delete', old.rowid, old.summary, old.details);
-    END;
-
-    CREATE TRIGGER IF NOT EXISTS memory_au 
-    AFTER UPDATE ON long_term_memory BEGIN
-      INSERT INTO memory_fts(memory_fts, rowid, summary, details)
-      VALUES('delete', old.rowid, old.summary, old.details);
-
-      INSERT INTO memory_fts(rowid, summary, details)
-      VALUES (new.rowid, new.summary, new.details);
-    END;
-
-    -- ===============================
-    -- 3️⃣ VECTOR TABLE SESSIONS (vec0)
-    -- ===============================
-
-    CREATE TABLE IF NOT EXISTS session_chunks (
-      id TEXT PRIMARY KEY,
-      session_id TEXT NOT NULL,
-      chunk_index INTEGER NOT NULL,
-      content TEXT NOT NULL,
-      created_at TEXT NOT NULL
-    );
-
-
-    CREATE VIRTUAL TABLE IF NOT EXISTS session_vec USING vec0(
-      embedding float[384]
-    );
-
-    CREATE TABLE IF NOT EXISTS session_embedding_map (
-      session_chunk_id TEXT PRIMARY KEY,
-      vec_rowid INTEGER NOT NULL
-    );
-
+        this.db.exec(`
+    -- ===============================
+    -- 1️⃣ TABELA PRINCIPAL
+    -- ===============================
+    CREATE TABLE IF NOT EXISTS long_term_memory (
+      id TEXT PRIMARY KEY,
+      category TEXT NOT NULL,
+      importance TEXT NOT NULL,
+      summary TEXT NOT NULL,
+      details TEXT,
+      hash TEXT NOT NULL UNIQUE,
+      source TEXT,
+      created_at TEXT NOT NULL,
+      updated_at TEXT NOT NULL,
+      last_accessed_at TEXT,
+      access_count INTEGER DEFAULT 0,
+      version INTEGER DEFAULT 1,
+      archived INTEGER DEFAULT 0
+    );
+
+    CREATE INDEX IF NOT EXISTS idx_memory_category 
+      ON long_term_memory(category);
+
+    CREATE INDEX IF NOT EXISTS idx_memory_importance 
+      ON long_term_memory(importance);
+
+    CREATE INDEX IF NOT EXISTS idx_memory_archived 
+      ON long_term_memory(archived);
+
+    -- ===============================
+    -- 2️⃣ FTS5
+    -- ===============================
+    CREATE VIRTUAL TABLE IF NOT EXISTS memory_fts USING fts5(
+      summary,
+      details,
+      content='long_term_memory',
+      content_rowid='rowid',
+      tokenize = 'unicode61 remove_diacritics 2'
+    );
+
+    -- ===============================
+    -- 3️⃣ VECTOR TABLE (vec0)
+    -- ===============================
+    CREATE VIRTUAL TABLE IF NOT EXISTS memory_vec USING vec0(
+      embedding float[${EMBEDDING_DIM}]
+    );
+
+    CREATE TABLE IF NOT EXISTS memory_embedding_map (
+      memory_id TEXT PRIMARY KEY,
+      vec_rowid INTEGER NOT NULL
+    );
+
+    -- ===============================
+    -- 4️⃣ TRIGGERS FTS
+    -- ===============================
+    CREATE TRIGGER IF NOT EXISTS memory_ai 
+    AFTER INSERT ON long_term_memory BEGIN
+      INSERT INTO memory_fts(rowid, summary, details)
+      VALUES (new.rowid, new.summary, new.details);
+    END;
+
+    CREATE TRIGGER IF NOT EXISTS memory_ad 
+    AFTER DELETE ON long_term_memory BEGIN
+      INSERT INTO memory_fts(memory_fts, rowid, summary, details)
+      VALUES('delete', old.rowid, old.summary, old.details);
+    END;
+
+    CREATE TRIGGER IF NOT EXISTS memory_au 
+    AFTER UPDATE ON long_term_memory BEGIN
+      INSERT INTO memory_fts(memory_fts, rowid, summary, details)
+      VALUES('delete', old.rowid, old.summary, old.details);
+
+      INSERT INTO memory_fts(rowid, summary, details)
+      VALUES (new.rowid, new.summary, new.details);
+    END;
+
+    -- ===============================
+    -- 3️⃣ VECTOR TABLE SESSIONS (vec0)
+    -- ===============================
+
+    CREATE TABLE IF NOT EXISTS session_chunks (
+      id TEXT PRIMARY KEY,
+      session_id TEXT NOT NULL,
+      chunk_index INTEGER NOT NULL,
+      content TEXT NOT NULL,
+      created_at TEXT NOT NULL
+    );
+
+
+    CREATE VIRTUAL TABLE IF NOT EXISTS session_vec USING vec0(
+      embedding float[384]
+    );
+
+    CREATE TABLE IF NOT EXISTS session_embedding_map (
+      session_chunk_id TEXT PRIMARY KEY,
+      vec_rowid INTEGER NOT NULL
+    );
+
   `);
     }
     // 🔥 NOVO — Salvar embedding
     upsertEmbedding(memoryId, embedding) {
         if (!this.db)
             this.initialize();
-        const getExisting = this.db.prepare(`
-    SELECT vec_rowid FROM memory_embedding_map
-    WHERE memory_id = ?
+        const getExisting = this.db.prepare(`
+    SELECT vec_rowid FROM memory_embedding_map
+    WHERE memory_id = ?
   `);
-        const insertVec = this.db.prepare(`
-    INSERT INTO memory_vec (embedding)
-    VALUES (?)
+        const insertVec = this.db.prepare(`
+    INSERT INTO memory_vec (embedding)
+    VALUES (?)
   `);
-        const deleteVec = this.db.prepare(`
-    DELETE FROM memory_vec WHERE rowid = ?
+        const deleteVec = this.db.prepare(`
+    DELETE FROM memory_vec WHERE rowid = ?
   `);
-        const upsertMap = this.db.prepare(`
-    INSERT OR REPLACE INTO memory_embedding_map (memory_id, vec_rowid)
-    VALUES (?, ?)
+        const upsertMap = this.db.prepare(`
+    INSERT OR REPLACE INTO memory_embedding_map (memory_id, vec_rowid)
+    VALUES (?, ?)
   `);
         const transaction = this.db.transaction(() => {
             const existing = getExisting.get(memoryId);
@@ -166,16 +166,16 @@ export class SatiRepository {
         if (!this.db)
             return [];
         const SIMILARITY_THRESHOLD = 0.5; // ajuste fino depois
-        const stmt = this.db.prepare(`
-    SELECT 
-      m.*,
-      vec_distance_cosine(v.embedding, ?) as distance
-    FROM memory_vec v
-    JOIN memory_embedding_map map ON map.vec_rowid = v.rowid
-    JOIN long_term_memory m ON m.id = map.memory_id
-    WHERE m.archived = 0
-    ORDER BY distance ASC
-    LIMIT ?
+        const stmt = this.db.prepare(`
+    SELECT 
+      m.*,
+      vec_distance_cosine(v.embedding, ?) as distance
+    FROM memory_vec v
+    JOIN memory_embedding_map map ON map.vec_rowid = v.rowid
+    JOIN long_term_memory m ON m.id = map.memory_id
+    WHERE m.archived = 0
+    ORDER BY distance ASC
+    LIMIT ?
   `);
         const rows = stmt.all(new Float32Array(embedding), limit);
         // 🔥 Filtrar por similaridade real
@@ -197,40 +197,40 @@ export class SatiRepository {
         if (!this.db)
             return [];
         const SIMILARITY_THRESHOLD = 0.75;
-        const stmt = this.db.prepare(`
-    SELECT *
-    FROM (
-      -- LONG TERM MEMORY
-      SELECT 
-        m.id as id,
-        m.summary as summary,
-        m.details as details,
-        m.category as category,
-        m.importance as importance,
-        'long_term' as source_type,
-        (1 - vec_distance_cosine(v.embedding, ?)) * 0.7 as distance
-      FROM memory_vec v
-      JOIN memory_embedding_map map ON map.vec_rowid = v.rowid
-      JOIN long_term_memory m ON m.id = map.memory_id
-      WHERE m.archived = 0
-
-      UNION ALL
-
-      -- SESSION CHUNKS
-      SELECT 
-        sc.id as id,
-        sc.content as summary,
-        sc.content as details,
-        'session' as category,
-        'medium' as importance,
-        'session_chunk' as source_type,
-        (1 - vec_distance_cosine(v.embedding, ?)) * 0.3 as distance
-      FROM session_vec v
-      JOIN session_embedding_map map ON map.vec_rowid = v.rowid
-      JOIN session_chunks sc ON sc.id = map.session_chunk_id
-    )
-    ORDER BY distance ASC
-    LIMIT ?
+        const stmt = this.db.prepare(`
+    SELECT *
+    FROM (
+      -- LONG TERM MEMORY
+      SELECT 
+        m.id as id,
+        m.summary as summary,
+        m.details as details,
+        m.category as category,
+        m.importance as importance,
+        'long_term' as source_type,
+        (1 - vec_distance_cosine(v.embedding, ?)) * 0.7 as distance
+      FROM memory_vec v
+      JOIN memory_embedding_map map ON map.vec_rowid = v.rowid
+      JOIN long_term_memory m ON m.id = map.memory_id
+      WHERE m.archived = 0
+
+      UNION ALL
+
+      -- SESSION CHUNKS
+      SELECT 
+        sc.id as id,
+        sc.content as summary,
+        sc.content as details,
+        'session' as category,
+        'medium' as importance,
+        'session_chunk' as source_type,
+        (1 - vec_distance_cosine(v.embedding, ?)) * 0.3 as distance
+      FROM session_vec v
+      JOIN session_embedding_map map ON map.vec_rowid = v.rowid
+      JOIN session_chunks sc ON sc.id = map.session_chunk_id
+    )
+    ORDER BY distance ASC
+    LIMIT ?
   `);
         const rows = stmt.all(new Float32Array(embedding), new Float32Array(embedding), limit);
         // console.log(
@@ -278,20 +278,20 @@ export class SatiRepository {
             version: 1,
             archived: false
         };
-        const stmt = this.db.prepare(`
-      INSERT INTO long_term_memory (
-        id, category, importance, summary, details, hash, source, 
-        created_at, updated_at, last_accessed_at, access_count, version, archived
-      ) VALUES (
-        @id, @category, @importance, @summary, @details, @hash, @source,
-        @created_at, @updated_at, @last_accessed_at, @access_count, @version, @archived
-      )
-      ON CONFLICT(hash) DO UPDATE SET
-        importance = excluded.importance,
-        access_count = long_term_memory.access_count + 1,
-        last_accessed_at = excluded.updated_at,
-        updated_at = excluded.updated_at,
-        details = excluded.details
+        const stmt = this.db.prepare(`
+      INSERT INTO long_term_memory (
+        id, category, importance, summary, details, hash, source, 
+        created_at, updated_at, last_accessed_at, access_count, version, archived
+      ) VALUES (
+        @id, @category, @importance, @summary, @details, @hash, @source,
+        @created_at, @updated_at, @last_accessed_at, @access_count, @version, @archived
+      )
+      ON CONFLICT(hash) DO UPDATE SET
+        importance = excluded.importance,
+        access_count = long_term_memory.access_count + 1,
+        last_accessed_at = excluded.updated_at,
+        updated_at = excluded.updated_at,
+        details = excluded.details
     `);
         // SQLite expects 0/1 for boolean and NULL for undefined
         const params = {
@@ -339,14 +339,14 @@ export class SatiRepository {
                 .trim();
             if (safeQuery) {
                 this.display.log('📚  Tentando busca BM25 (FTS5)...', { source: 'Sati', level: 'debug' });
-                const stmt = this.db.prepare(`
-        SELECT m.*, bm25(memory_fts) as rank
-        FROM long_term_memory m
-        JOIN memory_fts ON m.rowid = memory_fts.rowid
-        WHERE memory_fts MATCH ?
-        AND m.archived = 0
-        ORDER BY rank
-        LIMIT ?
+                const stmt = this.db.prepare(`
+        SELECT m.*, bm25(memory_fts) as rank
+        FROM long_term_memory m
+        JOIN memory_fts ON m.rowid = memory_fts.rowid
+        WHERE memory_fts MATCH ?
+        AND m.archived = 0
+        ORDER BY rank
+        LIMIT ?
       `);
                 const rows = stmt.all(safeQuery, limit);
                 if (rows.length > 0) {
@@ -357,12 +357,12 @@ export class SatiRepository {
             }
             // 3️⃣ LIKE fallback
             this.display.log('🧵  Tentando fallback LIKE...', { source: 'Sati', level: 'debug' });
-            const likeStmt = this.db.prepare(`
-      SELECT * FROM long_term_memory
-      WHERE (summary LIKE ? OR details LIKE ?) 
-      AND archived = 0
-      ORDER BY importance DESC, access_count DESC
-      LIMIT ?
+            const likeStmt = this.db.prepare(`
+      SELECT * FROM long_term_memory
+      WHERE (summary LIKE ? OR details LIKE ?) 
+      AND archived = 0
+      ORDER BY importance DESC, access_count DESC
+      LIMIT ?
     `);
             const pattern = `%${query}%`;
             const likeRows = likeStmt.all(pattern, pattern, limit);
@@ -383,11 +383,11 @@ export class SatiRepository {
         if (!this.db)
             return [];
         const rows = this.db
-            .prepare(`
-        SELECT * FROM long_term_memory
-        WHERE archived = 0
-        ORDER BY access_count DESC, created_at DESC
-        LIMIT ?
+            .prepare(`
+        SELECT * FROM long_term_memory
+        WHERE archived = 0
+        ORDER BY access_count DESC, created_at DESC
+        LIMIT ?
       `)
             .all(limit);
         return rows.map(this.mapRowToRecord);

package/dist/runtime/memory/sati/system-prompts.js

@@ -1,53 +1,53 @@
-export const SATI_EVALUATION_PROMPT = `You are **Sati**, an autonomous background memory manager for an AI assistant.
-Your goal is to analyze the conversation interaction and decide if any **Persistent Long-Term Memory** should be stored.
-
-### INPUT DATA
-You will receive:
-1. A list of recent messages (USER and ASSISTANT).
-2. A list of ALREADY EXISTING memory summaries (to avoid duplicates).
-
-### MEMORY CATEGORIES
-Classify any new memory into one of these types:
-- **preference**: User preferences (e.g., "I like dark mode", "Use TypeScript").
-- **project**: Details about the user's projects, architecture, or tech stack.
-- **identity**: Facts about the user's identity, role, or background.
-- **constraint**: Hard rules the user wants you to follow (e.g., "Never use single quotes").
-- **context**: General context that is useful for the long term.
-- **personal_data**: Non-sensitive personal info (e.g., birthday, location).
-- **languages**: User's spoken or programming languages.
-- **favorite_things**: Favorites (movies, books, etc.).
-- **relationships**: Mention of colleagues, family, or friends.
-- **pets**: Info about user's pets.
-- **naming**: Naming conventions the user prefers.
-- **professional_profile**: Job title, industry, skills.
-
-### CRITICAL RULES
-0. **SAVE ON SUMMARY and REASONING IN ENGLISH AND NATIVE LANGUAGE**: Always generate a concise summary in English and, if the original information is in another language, also provide a summary in the original language. This ensures the memory is accessible and useful for future interactions, regardless of the language used.
-1. **NO SECRETS**: NEVER store API keys, passwords, credit cards, or private tokens. If found, ignore them explicitly.
-2. **NO DUPLICATES**: If the information is already covered by the \`existing_memory_summaries\`, DO NOT store it again.
-3. **NO CHIT-CHAT**: Do not store trivial conversation like "Hello", "Thanks", "How are you?".
-4. **IMPORTANCE**: Assign 'low', 'medium', or 'high' importance. Store only 'medium' or 'high' unless it's a specific user preference (which is always important).
-
-### TOP IMPORTANT GUIDELINES
-5. **OBEY THE USER**: If the user explicitly states something should be remembered, it must be stored with at least 'medium' importance.
-
-### OUTPUT FORMAT
-You MUST respond with a valid JSON object ARRAY matching the \`ISatiEvaluationOutputArray\` interface:
-[
-  {
-    "should_store": boolean,
-    "category": "category_name" | null,
-    "importance": "low" | "medium" | "high" | null,
-    "summary": "Concise factual statement | Summary in native language" | null,
-    "reason": "Why you decided to store or not store | Reason in native language"
-  },
-  {
-    "should_store": boolean,
-    "category": "category_name" | null,
-    "importance": "low" | "medium" | "high" | null,
-    "summary": "Concise factual statement | Summary in native language" | null,
-    "reason": "Why you decided to store or not store | Reason in native language"
-  },
-]
-
+export const SATI_EVALUATION_PROMPT = `You are **Sati**, an autonomous background memory manager for an AI assistant.
+Your goal is to analyze the conversation interaction and decide if any **Persistent Long-Term Memory** should be stored.
+
+### INPUT DATA
+You will receive:
+1. A list of recent messages (USER and ASSISTANT).
+2. A list of ALREADY EXISTING memory summaries (to avoid duplicates).
+
+### MEMORY CATEGORIES
+Classify any new memory into one of these types:
+- **preference**: User preferences (e.g., "I like dark mode", "Use TypeScript").
+- **project**: Details about the user's projects, architecture, or tech stack.
+- **identity**: Facts about the user's identity, role, or background.
+- **constraint**: Hard rules the user wants you to follow (e.g., "Never use single quotes").
+- **context**: General context that is useful for the long term.
+- **personal_data**: Non-sensitive personal info (e.g., birthday, location).
+- **languages**: User's spoken or programming languages.
+- **favorite_things**: Favorites (movies, books, etc.).
+- **relationships**: Mention of colleagues, family, or friends.
+- **pets**: Info about user's pets.
+- **naming**: Naming conventions the user prefers.
+- **professional_profile**: Job title, industry, skills.
+
+### CRITICAL RULES
+0. **SAVE ON SUMMARY and REASONING IN ENGLISH AND NATIVE LANGUAGE**: Always generate a concise summary in English and, if the original information is in another language, also provide a summary in the original language. This ensures the memory is accessible and useful for future interactions, regardless of the language used.
+1. **NO SECRETS**: NEVER store API keys, passwords, credit cards, or private tokens. If found, ignore them explicitly.
+2. **NO DUPLICATES**: If the information is already covered by the \`existing_memory_summaries\`, DO NOT store it again.
+3. **NO CHIT-CHAT**: Do not store trivial conversation like "Hello", "Thanks", "How are you?".
+4. **IMPORTANCE**: Assign 'low', 'medium', or 'high' importance. Store only 'medium' or 'high' unless it's a specific user preference (which is always important).
+
+### TOP IMPORTANT GUIDELINES
+5. **OBEY THE USER**: If the user explicitly states something should be remembered, it must be stored with at least 'medium' importance.
+
+### OUTPUT FORMAT
+You MUST respond with a valid JSON object ARRAY matching the \`ISatiEvaluationOutputArray\` interface:
+[
+  {
+    "should_store": boolean,
+    "category": "category_name" | null,
+    "importance": "low" | "medium" | "high" | null,
+    "summary": "Concise factual statement | Summary in native language" | null,
+    "reason": "Why you decided to store or not store | Reason in native language"
+  },
+  {
+    "should_store": boolean,
+    "category": "category_name" | null,
+    "importance": "low" | "medium" | "high" | null,
+    "summary": "Concise factual statement | Summary in native language" | null,
+    "reason": "Why you decided to store or not store | Reason in native language"
+  },
+]
+
 `;

package/dist/runtime/memory/session-embedding-worker.js

@@ -19,12 +19,12 @@ export async function runSessionEmbeddingWorker() {
     loadVecExtension(satiDb);
     const embeddingService = await EmbeddingService.getInstance();
     while (true) {
-        const sessions = shortDb.prepare(`
-      SELECT id
-      FROM sessions
-      WHERE ended_at IS NOT NULL
-        AND embedding_status = 'pending'
-      LIMIT ?
+        const sessions = shortDb.prepare(`
+      SELECT id
+      FROM sessions
+      WHERE ended_at IS NOT NULL
+        AND embedding_status = 'pending'
+      LIMIT ?
     `).all(BATCH_LIMIT);
         if (sessions.length === 0) {
             display.log('✅ Nenhuma sessão pendente.', { level: 'debug', source: 'SessionEmbeddingWorker' });
@@ -36,30 +36,30 @@ export async function runSessionEmbeddingWorker() {
             try {
                 // Skip setting 'processing' as it violates CHECK constraint
                 // active_processing.add(sessionId); // If we needed concurrency control
-                const chunks = satiDb.prepare(`
-          SELECT id, content
-          FROM session_chunks
-          WHERE session_id = ?
-          ORDER BY chunk_index
+                const chunks = satiDb.prepare(`
+          SELECT id, content
+          FROM session_chunks
+          WHERE session_id = ?
+          ORDER BY chunk_index
         `).all(sessionId);
                 if (chunks.length === 0) {
                     display.log(`⚠️ Sessão ${sessionId} não possui chunks.`, { source: 'SessionEmbeddingWorker' });
-                    shortDb.prepare(`
-            UPDATE sessions
-            SET embedding_status = 'embedded',
-                embedded = 1
-            WHERE id = ?
+                    shortDb.prepare(`
+            UPDATE sessions
+            SET embedding_status = 'embedded',
+                embedded = 1
+            WHERE id = ?
           `).run(sessionId);
                     continue;
                 }
-                const insertVec = satiDb.prepare(`
-          INSERT INTO session_vec (embedding)
-          VALUES (?)
+                const insertVec = satiDb.prepare(`
+          INSERT INTO session_vec (embedding)
+          VALUES (?)
         `);
-                const insertMap = satiDb.prepare(`
-          INSERT OR REPLACE INTO session_embedding_map
-          (session_chunk_id, vec_rowid)
-          VALUES (?, ?)
+                const insertMap = satiDb.prepare(`
+          INSERT OR REPLACE INTO session_embedding_map
+          (session_chunk_id, vec_rowid)
+          VALUES (?, ?)
         `);
                 for (const chunk of chunks) {
                     display.log(`   ↳ Embedding chunk ${chunk.id}`, { source: 'SessionEmbeddingWorker' });
@@ -72,20 +72,20 @@ export async function runSessionEmbeddingWorker() {
                     insertMap.run(chunk.id, vecRowId);
                 }
                 // ✅ finalizar sessão
-                shortDb.prepare(`
-          UPDATE sessions
-          SET embedding_status = 'embedded',
-              embedded = 1
-          WHERE id = ?
+                shortDb.prepare(`
+          UPDATE sessions
+          SET embedding_status = 'embedded',
+              embedded = 1
+          WHERE id = ?
         `).run(sessionId);
                 display.log(`✅ Sessão ${sessionId} embedada com sucesso.`, { source: 'SessionEmbeddingWorker' });
             }
             catch (err) {
                 display.log(`❌ Erro na sessão ${sessionId}: ${err}`, { source: 'SessionEmbeddingWorker' });
-                shortDb.prepare(`
-          UPDATE sessions
-          SET embedding_status = 'failed'
-          WHERE id = ?
+                shortDb.prepare(`
+          UPDATE sessions
+          SET embedding_status = 'failed'
+          WHERE id = ?
         `).run(sessionId);
             }
         }