@kernel.chat/kbot 2.13.1 → 2.14.1

package/dist/emergent-swarm.js

@@ -0,0 +1,246 @@
+// Emergent role discovery for multi-agent swarms — inspired by Project Sid
+// where 1,000+ AI agents autonomously developed specialized roles.
+// Instead of hardcoded roles, agents evolve roles dynamically per task.
+import { runAgent } from './agent.js';
+import { loadConfig } from './auth.js';
+const MAX_ADAPTATIONS = 3;
+const OVERLAP_THRESHOLD = 0.7;
+const MIN_QUALITY = 0.3;
+const ANALYZE_PROMPT = `You are a task decomposition engine. Analyze this task and determine what specialized capabilities are needed.
+
+TASK: {task}
+
+Respond in JSON only:
+{
+  "capabilities": ["list", "of", "required", "capabilities"],
+  "complexity": "simple|moderate|complex",
+  "estimatedAgents": 2-5
+}
+
+Examples of capabilities: "code_analysis", "security_review", "api_design", "data_modeling", "testing", "documentation", "performance_profiling", "ux_evaluation", "architecture", "debugging", "research", "writing", "critique"
+
+Respond ONLY with the JSON object.`;
+const ROLE_DISCOVERY_PROMPT = `You are a swarm role designer. Given a task and required capabilities, create specialized agent roles.
+
+TASK: {task}
+
+REQUIRED CAPABILITIES: {capabilities}
+
+NUMBER OF AGENTS: {count}
+
+Design {count} specialized roles. Each role should be focused, non-overlapping, and complementary. Do NOT use generic roles like "manager" or "assistant". Make them task-specific.
+
+Respond in JSON only:
+[
+  {
+    "id": "role-id",
+    "name": "Role Name",
+    "description": "What this role does for THIS specific task",
+    "strengths": ["strength1", "strength2"]
+  }
+]
+
+Respond ONLY with the JSON array.`;
+const SYNTHESIS_PROMPT = `You are a swarm synthesis engine. Combine the outputs from multiple specialized agents into a unified response.
+
+TASK: {task}
+
+CONTRIBUTIONS:
+{contributions}
+
+Synthesize these into a single coherent response. Resolve any contradictions by favoring the contribution from the most relevant role. Preserve important details from each contribution.`;
+export async function analyzeTaskRequirements(task) {
+    const config = loadConfig();
+    if (!config) {
+        return { capabilities: ['general'], complexity: 'simple', estimatedAgents: 2 };
+    }
+    try {
+        const result = await runAgent(ANALYZE_PROMPT.replace('{task}', task), { agent: 'kernel', stream: false, skipPlanner: true });
+        const match = result.content.match(/\{[\s\S]*\}/);
+        if (match) {
+            const parsed = JSON.parse(match[0]);
+            return {
+                capabilities: parsed.capabilities || ['general'],
+                complexity: parsed.complexity || 'moderate',
+                estimatedAgents: Math.min(5, Math.max(2, parsed.estimatedAgents || 3)),
+            };
+        }
+    }
+    catch { /* fall through */ }
+    return { capabilities: ['general'], complexity: 'moderate', estimatedAgents: 3 };
+}
+export function discoverRoles(task, requirements) {
+    // Deterministic fallback based on capabilities
+    return requirements.capabilities.slice(0, requirements.estimatedAgents).map((cap, i) => ({
+        id: `role-${i}`,
+        name: cap.replace(/_/g, ' ').replace(/\b\w/g, c => c.toUpperCase()),
+        description: `Specialist in ${cap.replace(/_/g, ' ')} for this task`,
+        strengths: [cap],
+        emergenceScore: 0,
+        taskHistory: [],
+    }));
+}
+async function discoverRolesWithAI(task, requirements) {
+    try {
+        const result = await runAgent(ROLE_DISCOVERY_PROMPT
+            .replace('{task}', task)
+            .replace('{capabilities}', requirements.capabilities.join(', '))
+            .replace(/\{count\}/g, String(requirements.estimatedAgents)), { agent: 'kernel', stream: false, skipPlanner: true });
+        const match = result.content.match(/\[[\s\S]*\]/);
+        if (match) {
+            const parsed = JSON.parse(match[0]);
+            return parsed.map(r => ({
+                ...r,
+                emergenceScore: 0,
+                taskHistory: [],
+            }));
+        }
+    }
+    catch { /* fall through */ }
+    return discoverRoles(task, requirements);
+}
+function wordSet(text) {
+    return new Set(text.toLowerCase().split(/\s+/).filter(w => w.length > 2));
+}
+function wordOverlap(a, b) {
+    const setA = wordSet(a);
+    const setB = wordSet(b);
+    if (setA.size === 0 || setB.size === 0)
+        return 0;
+    let intersection = 0;
+    for (const w of setA) {
+        if (setB.has(w))
+            intersection++;
+    }
+    const union = new Set([...setA, ...setB]).size;
+    return union === 0 ? 0 : intersection / union;
+}
+export class EmergentSwarm {
+    task;
+    maxAgents;
+    state;
+    contributions = [];
+    constructor(task, maxAgents = 5) {
+        this.task = task;
+        this.maxAgents = Math.min(maxAgents, 5);
+        this.state = {
+            roles: [],
+            iteration: 0,
+            consensusHistory: [],
+            adaptations: 0,
+        };
+    }
+    async initialize() {
+        const requirements = await analyzeTaskRequirements(this.task);
+        this.state.roles = await discoverRolesWithAI(this.task, requirements);
+    }
+    async execute() {
+        if (this.state.roles.length === 0)
+            await this.initialize();
+        // Execute each role
+        for (const role of this.state.roles) {
+            const rolePrompt = [
+                `You are a specialist with the role: ${role.name}`,
+                `Your focus: ${role.description}`,
+                `Your strengths: ${role.strengths.join(', ')}`,
+                '',
+                `TASK: ${this.task}`,
+                '',
+                'Provide your specialized contribution. Focus only on your area of expertise.',
+            ].join('\n');
+            try {
+                const result = await runAgent(rolePrompt, {
+                    agent: 'kernel',
+                    stream: false,
+                    skipPlanner: true,
+                });
+                const quality = result.content.length > 50 ? 0.8 : 0.3;
+                this.contributions.push({ role, output: result.content, quality });
+                role.taskHistory.push(this.task.slice(0, 100));
+            }
+            catch {
+                this.contributions.push({ role, output: '', quality: 0 });
+            }
+        }
+        this.state.iteration++;
+        // Adapt roles based on output analysis
+        await this.adaptRoles();
+        // Synthesize
+        const synthesis = await this.synthesize();
+        const roleContributions = new Map();
+        for (const c of this.contributions) {
+            roleContributions.set(c.role.name, c.output);
+        }
+        return {
+            synthesis,
+            roleContributions,
+            adaptations: this.state.adaptations,
+            iterations: this.state.iteration,
+        };
+    }
+    async adapt(feedback) {
+        if (this.state.adaptations >= MAX_ADAPTATIONS)
+            return;
+        this.state.consensusHistory.push(feedback);
+        await this.adaptRoles();
+    }
+    getState() {
+        return { ...this.state };
+    }
+    async adaptRoles() {
+        if (this.state.adaptations >= MAX_ADAPTATIONS)
+            return;
+        if (this.contributions.length < 2)
+            return;
+        // Check for overlapping roles (merge if >70% word overlap)
+        for (let i = 0; i < this.contributions.length; i++) {
+            for (let j = i + 1; j < this.contributions.length; j++) {
+                const overlap = wordOverlap(this.contributions[i].output, this.contributions[j].output);
+                if (overlap > OVERLAP_THRESHOLD) {
+                    // Merge: keep the higher-quality one
+                    const keep = this.contributions[i].quality >= this.contributions[j].quality ? i : j;
+                    const drop = keep === i ? j : i;
+                    this.contributions[keep].output += '\n\n' + this.contributions[drop].output;
+                    this.contributions[keep].role.strengths.push(...this.contributions[drop].role.strengths);
+                    this.contributions.splice(drop, 1);
+                    this.state.roles = this.state.roles.filter(r => r.id !== this.contributions[drop]?.role.id);
+                    this.state.adaptations++;
+                    if (this.state.adaptations >= MAX_ADAPTATIONS)
+                        return;
+                }
+            }
+        }
+        // Drop low-quality contributors
+        const weak = this.contributions.filter(c => c.quality < MIN_QUALITY);
+        for (const w of weak) {
+            if (this.state.adaptations >= MAX_ADAPTATIONS)
+                break;
+            const strongest = this.contributions.reduce((best, c) => c.quality > best.quality ? c : best);
+            if (strongest !== w) {
+                strongest.role.taskHistory.push(`absorbed: ${w.role.name}`);
+                this.contributions = this.contributions.filter(c => c !== w);
+                this.state.roles = this.state.roles.filter(r => r.id !== w.role.id);
+                this.state.adaptations++;
+            }
+        }
+    }
+    async synthesize() {
+        if (this.contributions.length === 0)
+            return 'No contributions generated.';
+        if (this.contributions.length === 1)
+            return this.contributions[0].output;
+        const contribText = this.contributions
+            .map(c => `## ${c.role.name}\n${c.output}`)
+            .join('\n\n---\n\n');
+        try {
+            const result = await runAgent(SYNTHESIS_PROMPT
+                .replace('{task}', this.task)
+                .replace('{contributions}', contribText), { agent: 'kernel', stream: false, skipPlanner: true });
+            return result.content;
+        }
+        catch {
+            return contribText;
+        }
+    }
+}
+//# sourceMappingURL=emergent-swarm.js.map

package/dist/emergent-swarm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"emergent-swarm.js","sourceRoot":"","sources":["../src/emergent-swarm.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,mEAAmE;AACnE,wEAAwE;AAExE,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAA;AACrC,OAAO,EAAE,UAAU,EAAE,MAAM,WAAW,CAAA;AAqCtC,MAAM,eAAe,GAAG,CAAC,CAAA;AACzB,MAAM,iBAAiB,GAAG,GAAG,CAAA;AAC7B,MAAM,WAAW,GAAG,GAAG,CAAA;AAEvB,MAAM,cAAc,GAAG;;;;;;;;;;;;;mCAaY,CAAA;AAEnC,MAAM,qBAAqB,GAAG;;;;;;;;;;;;;;;;;;;;kCAoBI,CAAA;AAElC,MAAM,gBAAgB,GAAG;;;;;;;0LAOiK,CAAA;AAE1L,MAAM,CAAC,KAAK,UAAU,uBAAuB,CAAC,IAAY;IACxD,MAAM,MAAM,GAAG,UAAU,EAAE,CAAA;IAC3B,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,EAAE,YAAY,EAAE,CAAC,SAAS,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,eAAe,EAAE,CAAC,EAAE,CAAA;IAChF,CAAC;IAED,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,QAAQ,CAC3B,cAAc,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,EACtC,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,CACtD,CAAA;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAA;QACjD,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YACnC,OAAO;gBACL,YAAY,EAAE,MAAM,CAAC,YAAY,IAAI,CAAC,SAAS,CAAC;gBAChD,UAAU,EAAE,MAAM,CAAC,UAAU,IAAI,UAAU;gBAC3C,eAAe,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,eAAe,IAAI,CAAC,CAAC,CAAC;aACvE,CAAA;QACH,CAAC;IACH,CAAC;IAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;IAE9B,OAAO,EAAE,YAAY,EAAE,CAAC,SAAS,CAAC,EAAE,UAAU,EAAE,UAAU,EAAE,eAAe,EAAE,CAAC,EAAE,CAAA;AAClF,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,IAAY,EAAE,YAA8B;IACxE,+CAA+C;IAC/C,OAAO,YAAY,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,eAAe,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QACvF,EAAE,EAAE,QAAQ,CAAC,EAAE;QACf,IAAI,EAAE,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QACnE,WAAW,EAAE,iBAAiB,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,gBAAgB;QACpE,SAAS,EAAE,CAAC,GAAG,CAAC;QAChB,cAAc,EAAE,CAAC;QACjB,WAAW,EAAE,EAAE;KAChB,CAAC,CAAC,CAAA;AACL,CAAC;AAED,KAAK,UAAU,mBAAmB,CAChC,IAAY,EACZ,YAA8B;IAE9B,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,QAAQ,CAC3B,qBAAqB;aAClB,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC;aACvB,OAAO,CAAC,gBAAgB,EAAE,YAAY,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAC/D,OAAO,CAAC,YAAY,EAAE,MAAM,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC,EAC9D,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,CACtD,CAAA;QAED,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,aAAa,CAAC,CAAA;QACjD,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAgB,CAAA;YAClD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACtB,GAAG,CAAC;gBACJ,cAAc,EAAE,CAAC;gBACjB,WAAW,EAAE,EAAE;aAChB,CAAC,CAAC,CAAA;QACL,CAAC;IACH,CAAC;IAAC,MAAM,CAAC,CAAC,kBAAkB,CAAC,CAAC;IAE9B,OAAO,aAAa,CAAC,IAAI,EAAE,YAAY,CAAC,CAAA;AAC1C,CAAC;AAED,SAAS,OAAO,CAAC,IAAY;IAC3B,OAAO,IAAI,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAA;AAC3E,CAAC;AAED,SAAS,WAAW,CAAC,CAAS,EAAE,CAAS;IACvC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;IACvB,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;IACvB,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAChD,IAAI,YAAY,GAAG,CAAC,CAAA;IACpB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,EAAE,CAAA;IAAC,CAAC;IACzD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;IAC9C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAA;AAC/C,CAAC;AAED,MAAM,OAAO,aAAa;IAChB,IAAI,CAAQ;IACZ,SAAS,CAAQ;IACjB,KAAK,CAAY;IACjB,aAAa,GAAuB,EAAE,CAAA;IAE9C,YAAY,IAAY,EAAE,SAAS,GAAG,CAAC;QACrC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;QACvC,IAAI,CAAC,KAAK,GAAG;YACX,KAAK,EAAE,EAAE;YACT,SAAS,EAAE,CAAC;YACZ,gBAAgB,EAAE,EAAE;YACpB,WAAW,EAAE,CAAC;SACf,CAAA;IACH,CAAC;IAED,KAAK,CAAC,UAAU;QACd,MAAM,YAAY,GAAG,MAAM,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC7D,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,MAAM,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAA;IACvE,CAAC;IAED,KAAK,CAAC,OAAO;QACX,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QAE1D,oBAAoB;QACpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;YACpC,MAAM,UAAU,GAAG;gBACjB,uCAAuC,IAAI,CAAC,IAAI,EAAE;gBAClD,eAAe,IAAI,CAAC,WAAW,EAAE;gBACjC,mBAAmB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAC9C,EAAE;gBACF,SAAS,IAAI,CAAC,IAAI,EAAE;gBACpB,EAAE;gBACF,8EAA8E;aAC/E,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAEZ,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,UAAU,EAAE;oBACxC,KAAK,EAAE,QAAQ;oBACf,MAAM,EAAE,KAAK;oBACb,WAAW,EAAE,IAAI;iBAClB,CAAC,CAAA;gBAEF,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAA;gBACtD,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;gBAClE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAA;YAChD,CAAC;YAAC,MAAM,CAAC;gBACP,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC,CAAA;YAC3D,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,SAAS,EAAE,CAAA;QAEtB,uCAAuC;QACvC,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QAEvB,aAAa;QACb,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;QACzC,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAA;QACnD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACnC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAA;QAC9C,CAAC;QAED,OAAO;YACL,SAAS;YACT,iBAAiB;YACjB,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW;YACnC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS;SACjC,CAAA;IACH,CAAC;IAED,KAAK,CAAC,KAAK,CAAC,QAAgB;QAC1B,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,eAAe;YAAE,OAAM;QACrD,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC1C,MAAM,IAAI,CAAC,UAAU,EAAE,CAAA;IACzB,CAAC;IAED,QAAQ;QACN,OAAO,EAAE,GAAG,IAAI,CAAC,KAAK,EAAE,CAAA;IAC1B,CAAC;IAEO,KAAK,CAAC,UAAU;QACtB,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,eAAe;YAAE,OAAM;QACrD,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC;YAAE,OAAM;QAEzC,2DAA2D;QAC3D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvD,MAAM,OAAO,GAAG,WAAW,CACzB,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,EAC5B,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,CAC7B,CAAA;gBACD,IAAI,OAAO,GAAG,iBAAiB,EAAE,CAAC;oBAChC,qCAAqC;oBACrC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,IAAI,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;oBACnF,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;oBAC/B,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,CAAA;oBAC3E,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAC1C,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAC3C,CAAA;oBACD,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;oBAClC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CACxC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,CAChD,CAAA;oBACD,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAA;oBACxB,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,eAAe;wBAAE,OAAM;gBACvD,CAAC;YACH,CAAC;QACH,CAAC;QAED,gCAAgC;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,GAAG,WAAW,CAAC,CAAA;QACpE,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,eAAe;gBAAE,MAAK;YACpD,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CACtD,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CACpC,CAAA;YACD,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;gBAC3D,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;gBAC5D,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACnE,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,CAAA;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,UAAU;QACtB,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,6BAA6B,CAAA;QACzE,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;QAExE,MAAM,WAAW,GAAG,IAAI,CAAC,aAAa;aACnC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;aAC1C,IAAI,CAAC,aAAa,CAAC,CAAA;QAEtB,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,MAAM,QAAQ,CAC3B,gBAAgB;iBACb,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC;iBAC5B,OAAO,CAAC,iBAAiB,EAAE,WAAW,CAAC,EAC1C,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,IAAI,EAAE,CACtD,CAAA;YACD,OAAO,MAAM,CAAC,OAAO,CAAA;QACvB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,WAAW,CAAA;QACpB,CAAC;IACH,CAAC;CACF"}

package/dist/entropy-context.d.ts

@@ -0,0 +1,40 @@
+import type { ConversationTurn } from './context-manager.js';
+export interface EntropyScore {
+    entropy: number;
+    novelty: number;
+    density: number;
+    composite: number;
+}
+export interface RankedTurn {
+    turn: ConversationTurn;
+    score: EntropyScore;
+    rank: number;
+}
+export declare const STOPWORDS: Set<string>;
+/** Shannon entropy — bits per character. Higher = more diverse/novel text. */
+export declare function calculateEntropy(text: string): number;
+/** How much new information a turn adds vs what's already in context. */
+export declare function calculateSemanticNovelty(turn: string, previousTurns: string[]): number;
+/** Ratio of unique meaningful tokens to total tokens. */
+export declare function informationDensity(text: string): number;
+export declare class EntropyScorer {
+    /**
+     * Composite score formula:
+     * 0.4 * novelty + 0.35 * density + 0.25 * normalizedEntropy
+     *
+     * Novelty weighted highest: redundant info is the biggest waste.
+     * Density second: filler text wastes tokens.
+     * Raw entropy lowest: can be high for random/noisy text too.
+     */
+    scoreTurn(turn: ConversationTurn, history: ConversationTurn[]): EntropyScore;
+    /** Rank all turns by information value (highest first). */
+    rankTurns(turns: ConversationTurn[]): RankedTurn[];
+    /**
+     * Keep highest-entropy turns within token budget.
+     * Low-entropy turns are summarized or dropped.
+     */
+    compress(turns: ConversationTurn[], tokenBudget: number, keepRecentCount?: number): ConversationTurn[];
+    /** Returns true if turn adds < 0.2 novelty — candidate for eviction. */
+    shouldEvict(turn: ConversationTurn, history: ConversationTurn[]): boolean;
+}
+//# sourceMappingURL=entropy-context.d.ts.map

package/dist/entropy-context.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entropy-context.d.ts","sourceRoot":"","sources":["../src/entropy-context.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAA;AAE5D,MAAM,WAAW,YAAY;IAC3B,OAAO,EAAE,MAAM,CAAA;IACf,OAAO,EAAE,MAAM,CAAA;IACf,OAAO,EAAE,MAAM,CAAA;IACf,SAAS,EAAE,MAAM,CAAA;CAClB;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,gBAAgB,CAAA;IACtB,KAAK,EAAE,YAAY,CAAA;IACnB,IAAI,EAAE,MAAM,CAAA;CACb;AAED,eAAO,MAAM,SAAS,aAQpB,CAAA;AAEF,8EAA8E;AAC9E,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAiBrD;AAED,yEAAyE;AACzE,wBAAgB,wBAAwB,CACtC,IAAI,EAAE,MAAM,EACZ,aAAa,EAAE,MAAM,EAAE,GACtB,MAAM,CAqBR;AAED,yDAAyD;AACzD,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAOvD;AAeD,qBAAa,aAAa;IACxB;;;;;;;OAOG;IACH,SAAS,CAAC,IAAI,EAAE,gBAAgB,EAAE,OAAO,EAAE,gBAAgB,EAAE,GAAG,YAAY;IAgB5E,2DAA2D;IAC3D,SAAS,CAAC,KAAK,EAAE,gBAAgB,EAAE,GAAG,UAAU,EAAE;IAWlD;;;OAGG;IACH,QAAQ,CACN,KAAK,EAAE,gBAAgB,EAAE,EACzB,WAAW,EAAE,MAAM,EACnB,eAAe,SAAI,GAClB,gBAAgB,EAAE;IA+BrB,wEAAwE;IACxE,WAAW,CAAC,IAAI,EAAE,gBAAgB,EAAE,OAAO,EAAE,gBAAgB,EAAE,GAAG,OAAO;CAK1E"}

package/dist/entropy-context.js

@@ -0,0 +1,144 @@
+// Information-theoretic context management — inspired by Melvin Vopson's
+// research that the universe minimizes informational load. Uses Shannon
+// entropy to measure actual information content of conversation turns.
+import { estimateTokens } from './context-manager.js';
+export const STOPWORDS = new Set([
+    'the', 'a', 'an', 'is', 'are', 'was', 'were', 'be', 'been', 'being',
+    'have', 'has', 'had', 'do', 'does', 'did', 'will', 'would', 'could',
+    'should', 'may', 'might', 'shall', 'can', 'to', 'of', 'in', 'for',
+    'on', 'with', 'at', 'by', 'from', 'as', 'into', 'through', 'during',
+    'before', 'after', 'and', 'but', 'or', 'nor', 'not', 'so', 'yet',
+    'it', 'its', 'this', 'that', 'these', 'those', 'i', 'you', 'he',
+    'she', 'we', 'they', 'me', 'him', 'her', 'us', 'them', 'my', 'your',
+]);
+/** Shannon entropy — bits per character. Higher = more diverse/novel text. */
+export function calculateEntropy(text) {
+    if (!text || text.length === 0)
+        return 0;
+    const freq = new Map();
+    const lower = text.toLowerCase();
+    for (let i = 0; i < lower.length; i++) {
+        const ch = lower[i];
+        freq.set(ch, (freq.get(ch) || 0) + 1);
+    }
+    let entropy = 0;
+    const len = lower.length;
+    for (const count of freq.values()) {
+        const p = count / len;
+        if (p > 0)
+            entropy -= p * Math.log2(p);
+    }
+    return entropy;
+}
+/** How much new information a turn adds vs what's already in context. */
+export function calculateSemanticNovelty(turn, previousTurns) {
+    if (previousTurns.length === 0)
+        return 1.0;
+    const turnBigrams = extractBigrams(turn);
+    if (turnBigrams.size === 0)
+        return 0.5;
+    const contextBigrams = new Set();
+    for (const prev of previousTurns) {
+        for (const bg of extractBigrams(prev)) {
+            contextBigrams.add(bg);
+        }
+    }
+    if (contextBigrams.size === 0)
+        return 1.0;
+    // Jaccard distance: 1 - (intersection / union)
+    let intersection = 0;
+    for (const bg of turnBigrams) {
+        if (contextBigrams.has(bg))
+            intersection++;
+    }
+    const union = new Set([...turnBigrams, ...contextBigrams]).size;
+    return union === 0 ? 0 : 1 - (intersection / union);
+}
+/** Ratio of unique meaningful tokens to total tokens. */
+export function informationDensity(text) {
+    const words = text.toLowerCase().split(/\s+/).filter(w => w.length > 0);
+    if (words.length === 0)
+        return 0;
+    const meaningful = words.filter(w => !STOPWORDS.has(w) && w.length > 2);
+    const unique = new Set(meaningful);
+    return unique.size / words.length;
+}
+function extractBigrams(text) {
+    const words = text.toLowerCase().split(/\s+/).filter(w => w.length > 1);
+    const bigrams = new Set();
+    for (let i = 0; i < words.length - 1; i++) {
+        bigrams.add(`${words[i]} ${words[i + 1]}`);
+    }
+    return bigrams;
+}
+function turnContent(turn) {
+    return typeof turn.content === 'string' ? turn.content : JSON.stringify(turn.content);
+}
+export class EntropyScorer {
+    /**
+     * Composite score formula:
+     * 0.4 * novelty + 0.35 * density + 0.25 * normalizedEntropy
+     *
+     * Novelty weighted highest: redundant info is the biggest waste.
+     * Density second: filler text wastes tokens.
+     * Raw entropy lowest: can be high for random/noisy text too.
+     */
+    scoreTurn(turn, history) {
+        const content = turnContent(turn);
+        const prevContents = history.map(turnContent);
+        const entropy = calculateEntropy(content);
+        const novelty = calculateSemanticNovelty(content, prevContents);
+        const density = informationDensity(content);
+        // Normalize entropy to 0-1 (English text typically 3.5-4.5 bits/char)
+        const normalizedEntropy = Math.min(1, entropy / 5);
+        const composite = 0.4 * novelty + 0.35 * density + 0.25 * normalizedEntropy;
+        return { entropy, novelty, density, composite };
+    }
+    /** Rank all turns by information value (highest first). */
+    rankTurns(turns) {
+        const scored = turns.map((turn, i) => {
+            const history = turns.slice(0, i);
+            return { turn, score: this.scoreTurn(turn, history), rank: 0 };
+        });
+        scored.sort((a, b) => b.score.composite - a.score.composite);
+        scored.forEach((item, i) => item.rank = i + 1);
+        return scored;
+    }
+    /**
+     * Keep highest-entropy turns within token budget.
+     * Low-entropy turns are summarized or dropped.
+     */
+    compress(turns, tokenBudget, keepRecentCount = 4) {
+        if (turns.length <= keepRecentCount)
+            return turns;
+        // Always keep recent turns
+        const recent = turns.slice(-keepRecentCount);
+        const older = turns.slice(0, -keepRecentCount);
+        const recentTokens = recent.reduce((sum, t) => sum + estimateTokens(turnContent(t)), 0);
+        const remaining = tokenBudget - recentTokens;
+        if (remaining <= 0)
+            return recent;
+        // Rank older turns by entropy, keep highest-value ones
+        const ranked = this.rankTurns(older);
+        const kept = [];
+        let used = 0;
+        for (const item of ranked) {
+            const tokens = estimateTokens(turnContent(item.turn));
+            if (used + tokens <= remaining) {
+                kept.push(item.turn);
+                used += tokens;
+            }
+        }
+        // Restore chronological order
+        const keptSet = new Set(kept);
+        const ordered = older.filter(t => keptSet.has(t));
+        return [...ordered, ...recent];
+    }
+    /** Returns true if turn adds < 0.2 novelty — candidate for eviction. */
+    shouldEvict(turn, history) {
+        const content = turnContent(turn);
+        const novelty = calculateSemanticNovelty(content, history.map(turnContent));
+        return novelty < 0.2;
+    }
+}
+//# sourceMappingURL=entropy-context.js.map

package/dist/entropy-context.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entropy-context.js","sourceRoot":"","sources":["../src/entropy-context.ts"],"names":[],"mappings":"AAAA,yEAAyE;AACzE,wEAAwE;AACxE,uEAAuE;AAEvE,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAA;AAgBrD,MAAM,CAAC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IAC/B,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;IACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;IACjE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ;IACnE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK;IAChE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI;IAC/D,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;CACpE,CAAC,CAAA;AAEF,8EAA8E;AAC9E,MAAM,UAAU,gBAAgB,CAAC,IAAY;IAC3C,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAExC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAA;IACtC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAA;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QACnB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IACvC,CAAC;IAED,IAAI,OAAO,GAAG,CAAC,CAAA;IACf,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAA;IACxB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QAClC,MAAM,CAAC,GAAG,KAAK,GAAG,GAAG,CAAA;QACrB,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACxC,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,wBAAwB,CACtC,IAAY,EACZ,aAAuB;IAEvB,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAA;IAE1C,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CAAC,CAAA;IACxC,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAA;IAEtC,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAA;IACxC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,KAAK,MAAM,EAAE,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;YACtC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACxB,CAAC;IACH,CAAC;IACD,IAAI,cAAc,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAA;IAEzC,+CAA+C;IAC/C,IAAI,YAAY,GAAG,CAAC,CAAA;IACpB,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;QAC7B,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,YAAY,EAAE,CAAA;IAC5C,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,WAAW,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,CAAA;IAC/D,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,YAAY,GAAG,KAAK,CAAC,CAAA;AACrD,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACvE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAEhC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACvE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAA;IAClC,OAAO,MAAM,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,CAAA;AACnC,CAAC;AAED,SAAS,cAAc,CAAC,IAAY;IAClC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IACvE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,OAAO,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAA;IAC5C,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,SAAS,WAAW,CAAC,IAAsB;IACzC,OAAO,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;AACvF,CAAC;AAED,MAAM,OAAO,aAAa;IACxB;;;;;;;OAOG;IACH,SAAS,CAAC,IAAsB,EAAE,OAA2B;QAC3D,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;QACjC,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;QAE7C,MAAM,OAAO,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAA;QACzC,MAAM,OAAO,GAAG,wBAAwB,CAAC,OAAO,EAAE,YAAY,CAAC,CAAA;QAC/D,MAAM,OAAO,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAAA;QAE3C,sEAAsE;QACtE,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAA;QAElD,MAAM,SAAS,GAAG,GAAG,GAAG,OAAO,GAAG,IAAI,GAAG,OAAO,GAAG,IAAI,GAAG,iBAAiB,CAAA;QAE3E,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAA;IACjD,CAAC;IAED,2DAA2D;IAC3D,SAAS,CAAC,KAAyB;QACjC,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACnC,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACjC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAA;QAChE,CAAC,CAAC,CAAA;QAEF,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,CAAA;QAC5D,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;QAC9C,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;OAGG;IACH,QAAQ,CACN,KAAyB,EACzB,WAAmB,EACnB,eAAe,GAAG,CAAC;QAEnB,IAAI,KAAK,CAAC,MAAM,IAAI,eAAe;YAAE,OAAO,KAAK,CAAA;QAEjD,2BAA2B;QAC3B,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,CAAA;QAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,eAAe,CAAC,CAAA;QAE9C,MAAM,YAAY,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACvF,MAAM,SAAS,GAAG,WAAW,GAAG,YAAY,CAAA;QAC5C,IAAI,SAAS,IAAI,CAAC;YAAE,OAAO,MAAM,CAAA;QAEjC,uDAAuD;QACvD,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;QACpC,MAAM,IAAI,GAAuB,EAAE,CAAA;QACnC,IAAI,IAAI,GAAG,CAAC,CAAA;QAEZ,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAG,cAAc,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;YACrD,IAAI,IAAI,GAAG,MAAM,IAAI,SAAS,EAAE,CAAC;gBAC/B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACpB,IAAI,IAAI,MAAM,CAAA;YAChB,CAAC;QACH,CAAC;QAED,8BAA8B;QAC9B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAA;QAC7B,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAEjD,OAAO,CAAC,GAAG,OAAO,EAAE,GAAG,MAAM,CAAC,CAAA;IAChC,CAAC;IAED,wEAAwE;IACxE,WAAW,CAAC,IAAsB,EAAE,OAA2B;QAC7D,MAAM,OAAO,GAAG,WAAW,CAAC,IAAI,CAAC,CAAA;QACjC,MAAM,OAAO,GAAG,wBAAwB,CAAC,OAAO,EAAE,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAA;QAC3E,OAAO,OAAO,GAAG,GAAG,CAAA;IACtB,CAAC;CACF"}

package/dist/error-correction.d.ts

@@ -0,0 +1,37 @@
+export declare enum ErrorType {
+    hallucination = "hallucination",
+    wrong_tool = "wrong_tool",
+    stale_context = "stale_context",
+    incomplete = "incomplete",
+    off_topic = "off_topic",
+    syntax_error = "syntax_error",
+    logic_error = "logic_error"
+}
+export interface CorrectionStrategy {
+    errorType: ErrorType;
+    description: string;
+    correctionPrompt: string;
+    severity: number;
+}
+export interface ClassificationResult {
+    errorType: ErrorType;
+    confidence: number;
+    evidence: string;
+}
+export interface CorrectionRecord {
+    errorType: ErrorType;
+    confidence: number;
+    evidence: string;
+    correctionApplied: string;
+    attempt: number;
+}
+export interface ErrorCorrectionResult {
+    response: string;
+    corrections: CorrectionRecord[];
+    retries: number;
+}
+export declare const CORRECTION_STRATEGIES: Record<ErrorType, CorrectionStrategy>;
+export declare function classifyError(query: string, response: string, context?: string): Promise<ClassificationResult | null>;
+export declare function applyCorrection(query: string, response: string, errorType: ErrorType, evidence: string): string;
+export declare function withErrorCorrection(generateFn: (injectedPrompt?: string) => Promise<string>, query: string, context?: string, maxRetries?: number): Promise<ErrorCorrectionResult>;
+//# sourceMappingURL=error-correction.d.ts.map

package/dist/error-correction.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"error-correction.d.ts","sourceRoot":"","sources":["../src/error-correction.ts"],"names":[],"mappings":"AAMA,oBAAY,SAAS;IACnB,aAAa,kBAAkB;IAC/B,UAAU,eAAe;IACzB,aAAa,kBAAkB;IAC/B,UAAU,eAAe;IACzB,SAAS,cAAc;IACvB,YAAY,iBAAiB;IAC7B,WAAW,gBAAgB;CAC5B;AAED,MAAM,WAAW,kBAAkB;IACjC,SAAS,EAAE,SAAS,CAAA;IACpB,WAAW,EAAE,MAAM,CAAA;IACnB,gBAAgB,EAAE,MAAM,CAAA;IACxB,QAAQ,EAAE,MAAM,CAAA;CACjB;AAED,MAAM,WAAW,oBAAoB;IACnC,SAAS,EAAE,SAAS,CAAA;IACpB,UAAU,EAAE,MAAM,CAAA;IAClB,QAAQ,EAAE,MAAM,CAAA;CACjB;AAED,MAAM,WAAW,gBAAgB;IAC/B,SAAS,EAAE,SAAS,CAAA;IACpB,UAAU,EAAE,MAAM,CAAA;IAClB,QAAQ,EAAE,MAAM,CAAA;IAChB,iBAAiB,EAAE,MAAM,CAAA;IACzB,OAAO,EAAE,MAAM,CAAA;CAChB;AAED,MAAM,WAAW,qBAAqB;IACpC,QAAQ,EAAE,MAAM,CAAA;IAChB,WAAW,EAAE,gBAAgB,EAAE,CAAA;IAC/B,OAAO,EAAE,MAAM,CAAA;CAChB;AAED,eAAO,MAAM,qBAAqB,EAAE,MAAM,CAAC,SAAS,EAAE,kBAAkB,CA2CvE,CAAA;AAkBD,wBAAsB,aAAa,CACjC,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,OAAO,CAAC,EAAE,MAAM,GACf,OAAO,CAAC,oBAAoB,GAAG,IAAI,CAAC,CAgCtC;AAED,wBAAgB,eAAe,CAC7B,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,SAAS,EACpB,QAAQ,EAAE,MAAM,GACf,MAAM,CASR;AAED,wBAAsB,mBAAmB,CACvC,UAAU,EAAE,CAAC,cAAc,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,MAAM,CAAC,EACxD,KAAK,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,MAAM,EAChB,UAAU,SAAI,GACb,OAAO,CAAC,qBAAqB,CAAC,CA0BhC"}