opengauge 0.1.0

package/README.md

@@ -0,0 +1,64 @@
+# OpenGauge
+
+A local-first, token-efficient LLM chat interface that runs on your machine and helps reduce context bloat while preserving useful history.
+
+## What this repo does
+
+OpenGauge provides:
+- A local web chat UI on `http://localhost:3000`
+- Token optimization (compression + deduplication + checkpointing)
+- Context retrieval from past messages (RAG-style memory)
+- Provider support for Anthropic, OpenAI, Gemini, and Ollama
+- Local storage via SQLite in `~/.opengauge/opengauge.db`
+
+## Quick start
+
+### Run directly
+
+```bash
+npx opengauge
+```
+
+### Run from source
+
+```bash
+git clone https://github.com/applytorque/opengauge.git
+cd opengauge
+npm install
+npm run build
+npm start
+```
+
+Then open:
+
+```txt
+http://localhost:3000
+```
+
+## Provider setup
+
+On first launch, use the in-app setup wizard or create this file:
+
+`~/.opengauge/config.yml`
+
+```yaml
+providers:
+  anthropic:
+    api_key: YOUR_API_KEY
+    default_model: claude-opus-4-6
+
+defaults:
+  provider: anthropic
+```
+
+## Useful scripts
+
+```bash
+npm run build        # compile TypeScript + copy UI assets
+npm start            # start OpenGauge
+npm pack --dry-run   # preview npm package contents
+```
+
+## License
+
+MIT

package/bin/opengauge.js

@@ -0,0 +1,70 @@
+#!/usr/bin/env node
+
+/**
+ * OpenGauge CLI — starts the server and opens the browser
+ *
+ * Usage:
+ *   npx opengauge
+ *   npx opengauge --port 8080
+ *   npx opengauge --no-open
+ */
+
+const { createServer } = require('../dist/server/index');
+
+async function main() {
+  const args = process.argv.slice(2);
+
+  let port = 3000;
+  let shouldOpen = true;
+
+  for (let i = 0; i < args.length; i++) {
+    if (args[i] === '--port' && args[i + 1]) {
+      port = parseInt(args[i + 1], 10);
+      i++;
+    }
+    if (args[i] === '--no-open') {
+      shouldOpen = false;
+    }
+    if (args[i] === '--help' || args[i] === '-h') {
+      console.log(`
+  OpenGauge — Token-efficient LLM chat interface
+
+  Usage:
+    npx opengauge [options]
+
+  Options:
+    --port <number>   Port to run on (default: 3000)
+    --no-open         Don't open browser automatically
+    --help, -h        Show this help message
+
+  Config:
+    ~/.opengauge/config.yml    Provider configuration
+    ~/.opengauge/opengauge.db  SQLite database
+
+  Homepage: https://github.com/opengauge/opengauge
+      `);
+      process.exit(0);
+    }
+  }
+
+  console.log(`
+  ⚡ OpenGauge v0.1.0
+  Token-efficient LLM chat interface
+  `);
+
+  await createServer(port);
+
+  if (shouldOpen) {
+    try {
+      const open = (await import('open')).default;
+      await open(`http://localhost:${port}`);
+    } catch {
+      console.log(`  Open http://localhost:${port} in your browser\n`);
+    }
+  }
+}
+
+main().catch((err) => {
+  console.error('Failed to start OpenGauge:', err);
+  process.exit(1);
+});

package/dist/core/optimizer/checkpoint.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Conversation Checkpointing — Stage 3 of the Token Optimizer Pipeline
+ *
+ * At configurable intervals, older conversation history is summarized
+ * into a compressed checkpoint using the active LLM. Recent turns remain
+ * verbatim. The checkpoint replaces raw history in the context window.
+ * Original messages are preserved in the database.
+ */
+import { LLMProvider, ChatMessage } from '../providers/adapter';
+export interface CheckpointConfig {
+    /** Number of turns between checkpoints. Default: 20 */
+    interval: number;
+    /** Number of recent turns to keep verbatim. Default: 10 */
+    keepRecent: number;
+}
+export declare const DEFAULT_CHECKPOINT_CONFIG: CheckpointConfig;
+/**
+ * Determine if a checkpoint should be generated.
+ */
+export declare function shouldCheckpoint(messageCount: number, lastCheckpointMessageCount: number, config?: CheckpointConfig): boolean;
+/**
+ * Generate a checkpoint summary using the LLM.
+ *
+ * @param messages - The messages to summarize.
+ * @param provider - The LLM provider to use for summarization.
+ * @param model - The model to use.
+ * @returns Summary text.
+ */
+export declare function generateCheckpointSummary(messages: ChatMessage[], provider: LLMProvider, model: string): Promise<string>;
+/**
+ * Apply checkpointing to a message list for context assembly.
+ *
+ * Returns a modified message list where older messages are replaced
+ * with the checkpoint summary, and recent messages are kept verbatim.
+ */
+export declare function applyCheckpoint(allMessages: ChatMessage[], checkpointSummary: string | null, keepRecent?: number): ChatMessage[];
+//# sourceMappingURL=checkpoint.d.ts.map

package/dist/core/optimizer/checkpoint.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"checkpoint.d.ts","sourceRoot":"","sources":["../../../src/core/optimizer/checkpoint.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAEhE,MAAM,WAAW,gBAAgB;IAC/B,uDAAuD;IACvD,QAAQ,EAAE,MAAM,CAAC;IACjB,2DAA2D;IAC3D,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,eAAO,MAAM,yBAAyB,EAAE,gBAGvC,CAAC;AAEF;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,YAAY,EAAE,MAAM,EACpB,0BAA0B,EAAE,MAAM,EAClC,MAAM,GAAE,gBAA4C,GACnD,OAAO,CAET;AAED;;;;;;;GAOG;AACH,wBAAsB,yBAAyB,CAC7C,QAAQ,EAAE,WAAW,EAAE,EACvB,QAAQ,EAAE,WAAW,EACrB,KAAK,EAAE,MAAM,GACZ,OAAO,CAAC,MAAM,CAAC,CA+BjB;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,WAAW,EAAE,WAAW,EAAE,EAC1B,iBAAiB,EAAE,MAAM,GAAG,IAAI,EAChC,UAAU,GAAE,MAA6C,GACxD,WAAW,EAAE,CAgBf"}

package/dist/core/optimizer/checkpoint.js

@@ -0,0 +1,81 @@
+"use strict";
+/**
+ * Conversation Checkpointing — Stage 3 of the Token Optimizer Pipeline
+ *
+ * At configurable intervals, older conversation history is summarized
+ * into a compressed checkpoint using the active LLM. Recent turns remain
+ * verbatim. The checkpoint replaces raw history in the context window.
+ * Original messages are preserved in the database.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.DEFAULT_CHECKPOINT_CONFIG = void 0;
+exports.shouldCheckpoint = shouldCheckpoint;
+exports.generateCheckpointSummary = generateCheckpointSummary;
+exports.applyCheckpoint = applyCheckpoint;
+exports.DEFAULT_CHECKPOINT_CONFIG = {
+    interval: 20,
+    keepRecent: 10,
+};
+/**
+ * Determine if a checkpoint should be generated.
+ */
+function shouldCheckpoint(messageCount, lastCheckpointMessageCount, config = exports.DEFAULT_CHECKPOINT_CONFIG) {
+    return messageCount - lastCheckpointMessageCount >= config.interval;
+}
+/**
+ * Generate a checkpoint summary using the LLM.
+ *
+ * @param messages - The messages to summarize.
+ * @param provider - The LLM provider to use for summarization.
+ * @param model - The model to use.
+ * @returns Summary text.
+ */
+async function generateCheckpointSummary(messages, provider, model) {
+    const conversationText = messages
+        .map((m) => `[${m.role}]: ${m.content}`)
+        .join('\n\n');
+    const summaryRequest = [
+        {
+            role: 'system',
+            content: `You are a conversation summarizer. Create a concise but comprehensive summary of the following conversation. Preserve key facts, decisions, code snippets, and context that would be important for continuing the conversation. Focus on:
+1. Main topics discussed
+2. Key decisions made
+3. Important code or technical details
+4. Any unresolved questions or pending tasks
+5. The user's goals and preferences
+
+Keep the summary under 500 words. Use bullet points for clarity.`,
+        },
+        {
+            role: 'user',
+            content: `Summarize this conversation:\n\n${conversationText}`,
+        },
+    ];
+    const response = await provider.chat({
+        messages: summaryRequest,
+        model,
+        maxTokens: 1024,
+        temperature: 0.3,
+    });
+    return response.content;
+}
+/**
+ * Apply checkpointing to a message list for context assembly.
+ *
+ * Returns a modified message list where older messages are replaced
+ * with the checkpoint summary, and recent messages are kept verbatim.
+ */
+function applyCheckpoint(allMessages, checkpointSummary, keepRecent = exports.DEFAULT_CHECKPOINT_CONFIG.keepRecent) {
+    if (!checkpointSummary || allMessages.length <= keepRecent) {
+        return allMessages;
+    }
+    const systemMessages = allMessages.filter((m) => m.role === 'system');
+    const nonSystemMessages = allMessages.filter((m) => m.role !== 'system');
+    const recentMessages = nonSystemMessages.slice(-keepRecent);
+    const checkpointMessage = {
+        role: 'system',
+        content: `[Conversation Summary]\nThe following is a summary of the earlier part of this conversation:\n\n${checkpointSummary}\n\n[End of Summary — Recent messages follow]`,
+    };
+    return [...systemMessages, checkpointMessage, ...recentMessages];
+}
+//# sourceMappingURL=checkpoint.js.map

package/dist/core/optimizer/checkpoint.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"checkpoint.js","sourceRoot":"","sources":["../../../src/core/optimizer/checkpoint.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAmBH,4CAMC;AAUD,8DAmCC;AAQD,0CAoBC;AAvFY,QAAA,yBAAyB,GAAqB;IACzD,QAAQ,EAAE,EAAE;IACZ,UAAU,EAAE,EAAE;CACf,CAAC;AAEF;;GAEG;AACH,SAAgB,gBAAgB,CAC9B,YAAoB,EACpB,0BAAkC,EAClC,SAA2B,iCAAyB;IAEpD,OAAO,YAAY,GAAG,0BAA0B,IAAI,MAAM,CAAC,QAAQ,CAAC;AACtE,CAAC;AAED;;;;;;;GAOG;AACI,KAAK,UAAU,yBAAyB,CAC7C,QAAuB,EACvB,QAAqB,EACrB,KAAa;IAEb,MAAM,gBAAgB,GAAG,QAAQ;SAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;SACvC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEhB,MAAM,cAAc,GAAkB;QACpC;YACE,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE;;;;;;;iEAOkD;SAC5D;QACD;YACE,IAAI,EAAE,MAAM;YACZ,OAAO,EAAE,mCAAmC,gBAAgB,EAAE;SAC/D;KACF,CAAC;IAEF,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC;QACnC,QAAQ,EAAE,cAAc;QACxB,KAAK;QACL,SAAS,EAAE,IAAI;QACf,WAAW,EAAE,GAAG;KACjB,CAAC,CAAC;IAEH,OAAO,QAAQ,CAAC,OAAO,CAAC;AAC1B,CAAC;AAED;;;;;GAKG;AACH,SAAgB,eAAe,CAC7B,WAA0B,EAC1B,iBAAgC,EAChC,aAAqB,iCAAyB,CAAC,UAAU;IAEzD,IAAI,CAAC,iBAAiB,IAAI,WAAW,CAAC,MAAM,IAAI,UAAU,EAAE,CAAC;QAC3D,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IACtE,MAAM,iBAAiB,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;IAEzE,MAAM,cAAc,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;IAE5D,MAAM,iBAAiB,GAAgB;QACrC,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,mGAAmG,iBAAiB,+CAA+C;KAC7K,CAAC;IAEF,OAAO,CAAC,GAAG,cAAc,EAAE,iBAAiB,EAAE,GAAG,cAAc,CAAC,CAAC;AACnE,CAAC"}

package/dist/core/optimizer/compressor.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Prompt Compression — Stage 1 of the Token Optimizer Pipeline
+ *
+ * Uses entropy-based filtering to remove low-information tokens.
+ * Tokens with high predictability (low perplexity) contribute little
+ * semantic value and can be dropped.
+ *
+ * This is a JS-native implementation inspired by LLMLingua, using
+ * precomputed token-importance heuristics instead of a local model.
+ */
+export interface CompressionResult {
+    original: string;
+    compressed: string;
+    tokensRaw: number;
+    tokensSent: number;
+    savingsPercent: number;
+}
+/**
+ * Compress a prompt by removing low-information content.
+ *
+ * @param text - The prompt text to compress.
+ * @param aggressiveness - 0 (no compression) to 1 (maximum compression). Default 0.3.
+ */
+export declare function compressPrompt(text: string, aggressiveness?: number): CompressionResult;
+/**
+ * Compress an array of messages, preserving the most recent ones verbatim.
+ *
+ * @param messages - Array of message objects with role and content.
+ * @param preserveRecent - Number of recent messages to keep uncompressed. Default 4.
+ * @param aggressiveness - Compression level 0-1. Default 0.3.
+ */
+export declare function compressMessages(messages: Array<{
+    role: string;
+    content: string;
+}>, preserveRecent?: number, aggressiveness?: number): Array<{
+    role: string;
+    content: string;
+    compressed: boolean;
+    savings: number;
+}>;
+//# sourceMappingURL=compressor.d.ts.map

package/dist/core/optimizer/compressor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compressor.d.ts","sourceRoot":"","sources":["../../../src/core/optimizer/compressor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAyCH,MAAM,WAAW,iBAAiB;IAChC,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;CACxB;AASD;;;;;GAKG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,MAAM,EACZ,cAAc,GAAE,MAAY,GAC3B,iBAAiB,CA0DnB;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC9B,QAAQ,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,EAClD,cAAc,GAAE,MAAU,EAC1B,cAAc,GAAE,MAAY,GAC3B,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,CAkBhF"}

package/dist/core/optimizer/compressor.js

@@ -0,0 +1,134 @@
+"use strict";
+/**
+ * Prompt Compression — Stage 1 of the Token Optimizer Pipeline
+ *
+ * Uses entropy-based filtering to remove low-information tokens.
+ * Tokens with high predictability (low perplexity) contribute little
+ * semantic value and can be dropped.
+ *
+ * This is a JS-native implementation inspired by LLMLingua, using
+ * precomputed token-importance heuristics instead of a local model.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.compressPrompt = compressPrompt;
+exports.compressMessages = compressMessages;
+// Common low-information words/patterns that can often be removed
+// without significant semantic loss
+const LOW_IMPORTANCE_PATTERNS = [
+    /\b(the|a|an)\b/gi,
+    /\b(is|are|was|were|be|been|being)\b/gi,
+    /\b(that|which|who|whom)\b/gi,
+    /\b(very|really|quite|rather|somewhat|fairly)\b/gi,
+    /\b(just|simply|basically|essentially|actually|literally)\b/gi,
+    /\b(in order to)\b/gi,
+    /\b(it is|there is|there are)\b/gi,
+    /\b(please|kindly)\b/gi,
+];
+// Phrases that can be shortened
+const COMPRESSION_MAP = [
+    [/^hey there!?\s*/gi, 'hello '],
+    [/\bhow('?s| is) it going\??/gi, ''],
+    [/\bis there something i can help you with today\??/gi, 'How can I help?'],
+    [/\bis there anything specific you'd like help with\??/gi, 'What do you need help with?'],
+    [/\bi'?m an ai assistant!?\s*/gi, 'I can help with: '],
+    [/\bhere('?s| is) a quick (run ?down|overview) of what i can do:?/gi, 'Capabilities:'],
+    [/\bin order to\b/gi, 'to'],
+    [/\bas a result of\b/gi, 'because'],
+    [/\bdue to the fact that\b/gi, 'because'],
+    [/\bin the event that\b/gi, 'if'],
+    [/\bat this point in time\b/gi, 'now'],
+    [/\bin the near future\b/gi, 'soon'],
+    [/\bfor the purpose of\b/gi, 'to'],
+    [/\bin spite of the fact that\b/gi, 'although'],
+    [/\bwith regard to\b/gi, 'about'],
+    [/\bin reference to\b/gi, 'about'],
+    [/\bas a matter of fact\b/gi, 'actually'],
+    [/\bit should be noted that\b/gi, ''],
+    [/\bit is worth mentioning that\b/gi, ''],
+    [/\bit is important to note that\b/gi, ''],
+    [/\bas I mentioned (earlier|before|previously)\b/gi, ''],
+    [/\bas (we|I) discussed (earlier|before|previously)\b/gi, ''],
+];
+/**
+ * Rough token count estimation (~4 chars/token average).
+ */
+function estimateTokens(text) {
+    return Math.ceil(text.split(/\s+/).length * 1.3);
+}
+/**
+ * Compress a prompt by removing low-information content.
+ *
+ * @param text - The prompt text to compress.
+ * @param aggressiveness - 0 (no compression) to 1 (maximum compression). Default 0.3.
+ */
+function compressPrompt(text, aggressiveness = 0.3) {
+    const tokensRaw = estimateTokens(text);
+    let result = text;
+    // Always apply phrase compression (these are lossless transformations)
+    for (const [pattern, replacement] of COMPRESSION_MAP) {
+        result = result.replace(pattern, replacement);
+    }
+    if (aggressiveness > 0.4) {
+        // Strip markdown formatting from older context while preserving meaning
+        result = result
+            .replace(/^#{1,6}\s+/gm, '')
+            .replace(/^\s*[-*+]\s+/gm, '')
+            .replace(/\*\*(.*?)\*\*/g, '$1')
+            .replace(/\*(.*?)\*/g, '$1')
+            .replace(/`([^`]+)`/g, '$1');
+    }
+    // Apply word-level compression proportional to aggressiveness
+    if (aggressiveness > 0.2) {
+        // Remove filler words
+        const fillerPatterns = LOW_IMPORTANCE_PATTERNS.slice(3); // very, really, just, etc.
+        for (const pattern of fillerPatterns) {
+            result = result.replace(pattern, '');
+        }
+    }
+    if (aggressiveness > 0.5) {
+        // Remove articles (more aggressive)
+        result = result.replace(/\b(the|a|an)\s+/gi, '');
+        // Remove additional low-information discourse words
+        result = result.replace(/\b(i|you|we|they|it|this|that|these|those|here|there|today|now|then|also|well|okay|great|sure)\b/gi, '');
+    }
+    if (aggressiveness > 0.7) {
+        // Remove copulas where surrounding context is clear
+        result = result.replace(/\b(is|are|was|were)\s+/gi, ' ');
+    }
+    // Clean up extra whitespace
+    result = result.replace(/\s{2,}/g, ' ').trim();
+    const tokensSent = estimateTokens(result);
+    const savingsPercent = tokensRaw > 0 ? Math.round(((tokensRaw - tokensSent) / tokensRaw) * 100) : 0;
+    return {
+        original: text,
+        compressed: result,
+        tokensRaw,
+        tokensSent,
+        savingsPercent: Math.max(0, savingsPercent),
+    };
+}
+/**
+ * Compress an array of messages, preserving the most recent ones verbatim.
+ *
+ * @param messages - Array of message objects with role and content.
+ * @param preserveRecent - Number of recent messages to keep uncompressed. Default 4.
+ * @param aggressiveness - Compression level 0-1. Default 0.3.
+ */
+function compressMessages(messages, preserveRecent = 4, aggressiveness = 0.3) {
+    return messages.map((msg, i) => {
+        const isRecent = i >= messages.length - preserveRecent;
+        const isSystem = msg.role === 'system';
+        // Never compress system messages or recent messages
+        if (isSystem || isRecent) {
+            return { ...msg, compressed: false, savings: 0 };
+        }
+        const result = compressPrompt(msg.content, aggressiveness);
+        return {
+            role: msg.role,
+            content: result.compressed,
+            compressed: true,
+            savings: result.savingsPercent,
+        };
+    });
+}
+//# sourceMappingURL=compressor.js.map

package/dist/core/optimizer/compressor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compressor.js","sourceRoot":"","sources":["../../../src/core/optimizer/compressor.ts"],"names":[],"mappings":";AAAA;;;;;;;;;GASG;;AA8DH,wCA6DC;AASD,4CAsBC;AAxJD,kEAAkE;AAClE,oCAAoC;AACpC,MAAM,uBAAuB,GAAa;IACxC,kBAAkB;IAClB,uCAAuC;IACvC,6BAA6B;IAC7B,kDAAkD;IAClD,8DAA8D;IAC9D,qBAAqB;IACrB,kCAAkC;IAClC,uBAAuB;CACxB,CAAC;AAEF,gCAAgC;AAChC,MAAM,eAAe,GAAuB;IAC1C,CAAC,mBAAmB,EAAE,QAAQ,CAAC;IAC/B,CAAC,8BAA8B,EAAE,EAAE,CAAC;IACpC,CAAC,qDAAqD,EAAE,iBAAiB,CAAC;IAC1E,CAAC,wDAAwD,EAAE,6BAA6B,CAAC;IACzF,CAAC,+BAA+B,EAAE,mBAAmB,CAAC;IACtD,CAAC,mEAAmE,EAAE,eAAe,CAAC;IACtF,CAAC,mBAAmB,EAAE,IAAI,CAAC;IAC3B,CAAC,sBAAsB,EAAE,SAAS,CAAC;IACnC,CAAC,4BAA4B,EAAE,SAAS,CAAC;IACzC,CAAC,yBAAyB,EAAE,IAAI,CAAC;IACjC,CAAC,6BAA6B,EAAE,KAAK,CAAC;IACtC,CAAC,0BAA0B,EAAE,MAAM,CAAC;IACpC,CAAC,0BAA0B,EAAE,IAAI,CAAC;IAClC,CAAC,iCAAiC,EAAE,UAAU,CAAC;IAC/C,CAAC,sBAAsB,EAAE,OAAO,CAAC;IACjC,CAAC,uBAAuB,EAAE,OAAO,CAAC;IAClC,CAAC,2BAA2B,EAAE,UAAU,CAAC;IACzC,CAAC,+BAA+B,EAAE,EAAE,CAAC;IACrC,CAAC,mCAAmC,EAAE,EAAE,CAAC;IACzC,CAAC,oCAAoC,EAAE,EAAE,CAAC;IAC1C,CAAC,kDAAkD,EAAE,EAAE,CAAC;IACxD,CAAC,uDAAuD,EAAE,EAAE,CAAC;CAC9D,CAAC;AAUF;;GAEG;AACH,SAAS,cAAc,CAAC,IAAY;IAClC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,SAAgB,cAAc,CAC5B,IAAY,EACZ,iBAAyB,GAAG;IAE5B,MAAM,SAAS,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,MAAM,GAAG,IAAI,CAAC;IAElB,uEAAuE;IACvE,KAAK,MAAM,CAAC,OAAO,EAAE,WAAW,CAAC,IAAI,eAAe,EAAE,CAAC;QACrD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAChD,CAAC;IAED,IAAI,cAAc,GAAG,GAAG,EAAE,CAAC;QACzB,wEAAwE;QACxE,MAAM,GAAG,MAAM;aACZ,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC;aAC3B,OAAO,CAAC,gBAAgB,EAAE,EAAE,CAAC;aAC7B,OAAO,CAAC,gBAAgB,EAAE,IAAI,CAAC;aAC/B,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC;aAC3B,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,8DAA8D;IAC9D,IAAI,cAAc,GAAG,GAAG,EAAE,CAAC;QACzB,sBAAsB;QACtB,MAAM,cAAc,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,2BAA2B;QACpF,KAAK,MAAM,OAAO,IAAI,cAAc,EAAE,CAAC;YACrC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,IAAI,cAAc,GAAG,GAAG,EAAE,CAAC;QACzB,oCAAoC;QACpC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;QAEjD,oDAAoD;QACpD,MAAM,GAAG,MAAM,CAAC,OAAO,CACrB,oGAAoG,EACpG,EAAE,CACH,CAAC;IACJ,CAAC;IAED,IAAI,cAAc,GAAG,GAAG,EAAE,CAAC;QACzB,oDAAoD;QACpD,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,0BAA0B,EAAE,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED,4BAA4B;IAC5B,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;IAE/C,MAAM,UAAU,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,cAAc,GAClB,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,GAAG,UAAU,CAAC,GAAG,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE/E,OAAO;QACL,QAAQ,EAAE,IAAI;QACd,UAAU,EAAE,MAAM;QAClB,SAAS;QACT,UAAU;QACV,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC;KAC5C,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,gBAAgB,CAC9B,QAAkD,EAClD,iBAAyB,CAAC,EAC1B,iBAAyB,GAAG;IAE5B,OAAO,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAC7B,MAAM,QAAQ,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,GAAG,cAAc,CAAC;QACvD,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,KAAK,QAAQ,CAAC;QAEvC,oDAAoD;QACpD,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;YACzB,OAAO,EAAE,GAAG,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;QACnD,CAAC;QAED,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC;QAC3D,OAAO;YACL,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,OAAO,EAAE,MAAM,CAAC,UAAU;YAC1B,UAAU,EAAE,IAAI;YAChB,OAAO,EAAE,MAAM,CAAC,cAAc;SAC/B,CAAC;IACJ,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/core/optimizer/dedup.d.ts

@@ -0,0 +1,48 @@
+/**
+ * Semantic Deduplication — Stage 2 of the Token Optimizer Pipeline
+ *
+ * Detects near-duplicate messages via cosine similarity on embeddings.
+ * Redundant turns are merged or dropped, keeping only the most
+ * recent/complete version.
+ */
+/**
+ * Compute cosine similarity between two vectors.
+ */
+export declare function cosineSimilarity(a: Float32Array, b: Float32Array): number;
+export interface DedupMessage {
+    id: string;
+    role: string;
+    content: string;
+    embedding?: Float32Array;
+    created_at: number;
+}
+export interface DedupResult {
+    kept: DedupMessage[];
+    removed: DedupMessage[];
+    duplicateGroups: Array<{
+        kept: string;
+        removed: string[];
+    }>;
+}
+/**
+ * Deduplicate messages by semantic similarity.
+ *
+ * @param messages - Messages with optional embeddings.
+ * @param threshold - Cosine similarity threshold (0-1). Above this = duplicate. Default 0.85.
+ * @returns Deduplicated message list, preferring more recent/longer messages.
+ */
+export declare function deduplicateMessages(messages: DedupMessage[], threshold?: number): DedupResult;
+/**
+ * Text-only deduplication without embeddings.
+ * Uses normalized text comparison and Jaccard similarity.
+ */
+export declare function deduplicateByText(messages: Array<{
+    id: string;
+    role: string;
+    content: string;
+    created_at: number;
+}>, jaccardThreshold?: number): {
+    kept: typeof messages;
+    removed: typeof messages;
+};
+//# sourceMappingURL=dedup.d.ts.map

package/dist/core/optimizer/dedup.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dedup.d.ts","sourceRoot":"","sources":["../../../src/core/optimizer/dedup.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,MAAM,CAgBzE;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,CAAC,EAAE,YAAY,CAAC;IACzB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,YAAY,EAAE,CAAC;IACrB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,eAAe,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;CAC7D;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,YAAY,EAAE,EACxB,SAAS,GAAE,MAAa,GACvB,WAAW,CAgEb;AAaD;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,EAClF,gBAAgB,GAAE,MAAY,GAC7B;IAAE,IAAI,EAAE,OAAO,QAAQ,CAAC;IAAC,OAAO,EAAE,OAAO,QAAQ,CAAA;CAAE,CA4BrD"}

package/dist/core/optimizer/dedup.js

@@ -0,0 +1,147 @@
+"use strict";
+/**
+ * Semantic Deduplication — Stage 2 of the Token Optimizer Pipeline
+ *
+ * Detects near-duplicate messages via cosine similarity on embeddings.
+ * Redundant turns are merged or dropped, keeping only the most
+ * recent/complete version.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.cosineSimilarity = cosineSimilarity;
+exports.deduplicateMessages = deduplicateMessages;
+exports.deduplicateByText = deduplicateByText;
+/**
+ * Compute cosine similarity between two vectors.
+ */
+function cosineSimilarity(a, b) {
+    if (a.length !== b.length)
+        return 0;
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denominator = Math.sqrt(normA) * Math.sqrt(normB);
+    if (denominator === 0)
+        return 0;
+    return dotProduct / denominator;
+}
+/**
+ * Deduplicate messages by semantic similarity.
+ *
+ * @param messages - Messages with optional embeddings.
+ * @param threshold - Cosine similarity threshold (0-1). Above this = duplicate. Default 0.85.
+ * @returns Deduplicated message list, preferring more recent/longer messages.
+ */
+function deduplicateMessages(messages, threshold = 0.85) {
+    const kept = [];
+    const removed = [];
+    const duplicateGroups = [];
+    // Process messages in reverse chronological order (newest first)
+    const sorted = [...messages].sort((a, b) => b.created_at - a.created_at);
+    for (const msg of sorted) {
+        // System messages are never deduplicated
+        if (msg.role === 'system') {
+            kept.push(msg);
+            continue;
+        }
+        // Without embeddings, check exact/near-exact text match
+        if (!msg.embedding) {
+            const isDuplicate = kept.some((k) => k.role === msg.role &&
+                (k.content === msg.content ||
+                    normalizeText(k.content) === normalizeText(msg.content)));
+            if (isDuplicate) {
+                removed.push(msg);
+            }
+            else {
+                kept.push(msg);
+            }
+            continue;
+        }
+        // With embeddings, use cosine similarity
+        let bestMatch = null;
+        let bestSimilarity = 0;
+        for (const k of kept) {
+            if (k.role !== msg.role || !k.embedding)
+                continue;
+            const similarity = cosineSimilarity(msg.embedding, k.embedding);
+            if (similarity > bestSimilarity) {
+                bestSimilarity = similarity;
+                bestMatch = k;
+            }
+        }
+        if (bestMatch && bestSimilarity >= threshold) {
+            removed.push(msg);
+            // Track the group
+            const existingGroup = duplicateGroups.find((g) => g.kept === bestMatch.id);
+            if (existingGroup) {
+                existingGroup.removed.push(msg.id);
+            }
+            else {
+                duplicateGroups.push({ kept: bestMatch.id, removed: [msg.id] });
+            }
+        }
+        else {
+            kept.push(msg);
+        }
+    }
+    // Restore chronological order for kept messages
+    kept.sort((a, b) => a.created_at - b.created_at);
+    return { kept, removed, duplicateGroups };
+}
+/**
+ * Simple text normalization for near-exact matching.
+ */
+function normalizeText(text) {
+    return text
+        .toLowerCase()
+        .replace(/\s+/g, ' ')
+        .replace(/[^\w\s]/g, '')
+        .trim();
+}
+/**
+ * Text-only deduplication without embeddings.
+ * Uses normalized text comparison and Jaccard similarity.
+ */
+function deduplicateByText(messages, jaccardThreshold = 0.7) {
+    const kept = [];
+    const removed = [];
+    // Process newest first
+    const sorted = [...messages].sort((a, b) => b.created_at - a.created_at);
+    for (const msg of sorted) {
+        if (msg.role === 'system') {
+            kept.push(msg);
+            continue;
+        }
+        const isDuplicate = kept.some((k) => {
+            if (k.role !== msg.role)
+                return false;
+            const sim = jaccardSimilarity(msg.content, k.content);
+            return sim >= jaccardThreshold;
+        });
+        if (isDuplicate) {
+            removed.push(msg);
+        }
+        else {
+            kept.push(msg);
+        }
+    }
+    kept.sort((a, b) => a.created_at - b.created_at);
+    return { kept, removed };
+}
+/**
+ * Compute Jaccard similarity between two texts based on word sets.
+ */
+function jaccardSimilarity(a, b) {
+    const setA = new Set(normalizeText(a).split(' '));
+    const setB = new Set(normalizeText(b).split(' '));
+    const intersection = new Set([...setA].filter((x) => setB.has(x)));
+    const union = new Set([...setA, ...setB]);
+    if (union.size === 0)
+        return 0;
+    return intersection.size / union.size;
+}
+//# sourceMappingURL=dedup.js.map

package/dist/core/optimizer/dedup.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dedup.js","sourceRoot":"","sources":["../../../src/core/optimizer/dedup.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;AAKH,4CAgBC;AAuBD,kDAmEC;AAiBD,8CA+BC;AA7JD;;GAEG;AACH,SAAgB,gBAAgB,CAAC,CAAe,EAAE,CAAe;IAC/D,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC;IAEpC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,IAAI,WAAW,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAChC,OAAO,UAAU,GAAG,WAAW,CAAC;AAClC,CAAC;AAgBD;;;;;;GAMG;AACH,SAAgB,mBAAmB,CACjC,QAAwB,EACxB,YAAoB,IAAI;IAExB,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,MAAM,eAAe,GAA+C,EAAE,CAAC;IAEvE,iEAAiE;IACjE,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAEzE,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,yCAAyC;QACzC,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,SAAS;QACX,CAAC;QAED,wDAAwD;QACxD,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC;YACnB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAC3B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI;gBACnB,CAAC,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,OAAO;oBACxB,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAC7D,CAAC;YAEF,IAAI,WAAW,EAAE,CAAC;gBAChB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,CAAC;YACD,SAAS;QACX,CAAC;QAED,yCAAyC;QACzC,IAAI,SAAS,GAAwB,IAAI,CAAC;QAC1C,IAAI,cAAc,GAAG,CAAC,CAAC;QAEvB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,SAAS;gBAAE,SAAS;YAElD,MAAM,UAAU,GAAG,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,SAAS,CAAC,CAAC;YAChE,IAAI,UAAU,GAAG,cAAc,EAAE,CAAC;gBAChC,cAAc,GAAG,UAAU,CAAC;gBAC5B,SAAS,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,IAAI,SAAS,IAAI,cAAc,IAAI,SAAS,EAAE,CAAC;YAC7C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,kBAAkB;YAClB,MAAM,aAAa,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAU,CAAC,EAAE,CAAC,CAAC;YAC5E,IAAI,aAAa,EAAE,CAAC;gBAClB,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACN,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAEjD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;AAC5C,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,IAAI;SACR,WAAW,EAAE;SACb,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,IAAI,EAAE,CAAC;AACZ,CAAC;AAED;;;GAGG;AACH,SAAgB,iBAAiB,CAC/B,QAAkF,EAClF,mBAA2B,GAAG;IAE9B,MAAM,IAAI,GAAoB,EAAE,CAAC;IACjC,MAAM,OAAO,GAAoB,EAAE,CAAC;IAEpC,uBAAuB;IACvB,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAEzE,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,SAAS;QACX,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;YAClC,IAAI,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI;gBAAE,OAAO,KAAK,CAAC;YACtC,MAAM,GAAG,GAAG,iBAAiB,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;YACtD,OAAO,GAAG,IAAI,gBAAgB,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,IAAI,WAAW,EAAE,CAAC;YAChB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IACjD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,SAAS,iBAAiB,CAAC,CAAS,EAAE,CAAS;IAC7C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAClD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAElD,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;IAE1C,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC/B,OAAO,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;AACxC,CAAC"}