agent-nuvira 1.14.0

package/dist/learning/pattern-extractor.d.ts

@@ -0,0 +1,99 @@
+/**
+ * PatternExtractor — Extracts reusable coding patterns from high-scoring
+ * execution trajectories and stores them for future prompting.
+ *
+ * A "pattern" is a concise description of how a particular type of task
+ * was successfully completed: which files were involved, what steps were
+ * taken, what conventions were followed.
+ *
+ * These patterns are injected alongside trajectory few-shot examples
+ * when the PlannerAgent decomposes a new goal.
+ *
+ * Patterns are stored in ~/.buff/memory/patterns.json
+ */
+import type { LLMCallFn } from '../agents/agent.js';
+import type { Trajectory } from '../memory/trajectory-store.js';
+/** A reusable coding pattern extracted from successful trajectories */
+export interface CodingPattern {
+    /** Unique identifier */
+    id: string;
+    /** Short descriptive title (e.g., "Adding CLI commands") */
+    title: string;
+    /** Which project types this applies to (e.g., "typescript, node") */
+    applicableDomains: string[];
+    /** The pattern description — steps, conventions, file structure */
+    description: string;
+    /** File paths commonly involved (pattern-based, not absolute) */
+    commonFiles: string[];
+    /** Agent types commonly used */
+    commonAgentSequence: string[];
+    /** How many trajectories this was distilled from */
+    sourceCount: number;
+    /** Average score of source trajectories */
+    avgSourceScore: number;
+    /** When this pattern was created */
+    createdAt: number;
+    /** When this pattern was last used (for decay scoring) */
+    lastUsedAt: number;
+    /** How many times this pattern has been used */
+    usageCount: number;
+}
+/**
+ * Manages storage and retrieval of reusable coding patterns.
+ * Patterns are extracted from high-scoring trajectories via LLM.
+ */
+export declare class PatternStore {
+    private patterns;
+    constructor();
+    /**
+     * Get all stored patterns, optionally filtered by minimum quality score.
+     */
+    getAll(minQualityScore?: number): CodingPattern[];
+    /**
+     * Get patterns relevant to a specific project domain.
+     */
+    getByDomain(domainTags: string[]): CodingPattern[];
+    /**
+     * Format patterns as a prompt string for agent injection.
+     */
+    formatAsPrompt(domainTags?: string[]): string;
+    /**
+     * Extract patterns from high-scoring trajectories using the LLM.
+     * Newly extracted patterns are merged with existing ones (keeping the best).
+     */
+    extractFromTrajectories(trajectories: Trajectory[], callLLM: LLMCallFn): Promise<number>;
+    /**
+     * Mark a pattern as used (for decay tracking).
+     */
+    markUsed(patternId: string): void;
+    /**
+     * Compute a decay score for a pattern based on age and usage.
+     * Returns a score from 0 (expired) to 1 (fresh).
+     */
+    computeDecayScore(pattern: CodingPattern): number;
+    /**
+     * Garbage collect low-quality patterns.
+     * Returns the number of patterns removed.
+     */
+    garbageCollect(verbose?: boolean): number;
+    /**
+     * Get decay quality statistics for all patterns.
+     */
+    getQualityReport(): Array<{
+        id: string;
+        title: string;
+        decayScore: number;
+        usageCount: number;
+        ageDays: number;
+    }>;
+    /**
+     * Clear all patterns.
+     */
+    clear(): void;
+    private load;
+    private save;
+    private buildExtractionPrompt;
+    private parsePatterns;
+}
+export declare function getPatternStore(): PatternStore;
+//# sourceMappingURL=pattern-extractor.d.ts.map

package/dist/learning/pattern-extractor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pattern-extractor.d.ts","sourceRoot":"","sources":["../../src/learning/pattern-extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAMH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AACpD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAKhE,uEAAuE;AACvE,MAAM,WAAW,aAAa;IAC5B,wBAAwB;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,4DAA4D;IAC5D,KAAK,EAAE,MAAM,CAAC;IACd,qEAAqE;IACrE,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,mEAAmE;IACnE,WAAW,EAAE,MAAM,CAAC;IACpB,iEAAiE;IACjE,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,gCAAgC;IAChC,mBAAmB,EAAE,MAAM,EAAE,CAAC;IAC9B,oDAAoD;IACpD,WAAW,EAAE,MAAM,CAAC;IACpB,2CAA2C;IAC3C,cAAc,EAAE,MAAM,CAAC;IACvB,oCAAoC;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,0DAA0D;IAC1D,UAAU,EAAE,MAAM,CAAC;IACnB,gDAAgD;IAChD,UAAU,EAAE,MAAM,CAAC;CACpB;AAmDD;;;GAGG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAuB;;IAQvC;;OAEG;IACH,MAAM,CAAC,eAAe,CAAC,EAAE,MAAM,GAAG,aAAa,EAAE;IAQjD;;OAEG;IACH,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,aAAa,EAAE;IAWlD;;OAEG;IACH,cAAc,CAAC,UAAU,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM;IAqB7C;;;OAGG;IACG,uBAAuB,CAC3B,YAAY,EAAE,UAAU,EAAE,EAC1B,OAAO,EAAE,SAAS,GACjB,OAAO,CAAC,MAAM,CAAC;IAqDlB;;OAEG;IACH,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI;IASjC;;;OAGG;IACH,iBAAiB,CAAC,OAAO,EAAE,aAAa,GAAG,MAAM;IAqBjD;;;OAGG;IACH,cAAc,CAAC,OAAO,GAAE,OAAe,GAAG,MAAM;IA0BhD;;OAEG;IACH,gBAAgB,IAAI,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAA;KAAE,CAAC;IAWjH;;OAEG;IACH,KAAK,IAAI,IAAI;IAOb,OAAO,CAAC,IAAI;IAoBZ,OAAO,CAAC,IAAI;IAMZ,OAAO,CAAC,qBAAqB;IAe7B,OAAO,CAAC,aAAa;CAiCtB;AAKD,wBAAgB,eAAe,IAAI,YAAY,CAK9C"}

package/dist/learning/pattern-extractor.js

@@ -0,0 +1,310 @@
+/**
+ * PatternExtractor — Extracts reusable coding patterns from high-scoring
+ * execution trajectories and stores them for future prompting.
+ *
+ * A "pattern" is a concise description of how a particular type of task
+ * was successfully completed: which files were involved, what steps were
+ * taken, what conventions were followed.
+ *
+ * These patterns are injected alongside trajectory few-shot examples
+ * when the PlannerAgent decomposes a new goal.
+ *
+ * Patterns are stored in ~/.buff/memory/patterns.json
+ */
+import { readFileSync, writeFileSync, existsSync, mkdirSync } from 'node:fs';
+import { join } from 'node:path';
+import { homedir } from 'node:os';
+import { logger } from '../utils/logger.js';
+// ─── Constants ──────────────────────────────────────────────────────────────
+const MEMORY_DIR = join(homedir(), '.buff', 'memory');
+const PATTERNS_PATH = join(MEMORY_DIR, 'patterns.json');
+const CURRENT_VERSION = 2;
+const MAX_PATTERNS = 30;
+const MIN_SCORE_FOR_EXTRACTION = 0.7; // Only extract from high-quality trajectories
+const MAX_TRAJECTORIES_FOR_EXTRACTION = 5;
+// Pattern decay: patterns lose relevance over time
+const PATTERN_TTL_DAYS = 90; // Expire after 90 days without use
+const DECAY_DAYS_FOR_HALF_SCORE = 30; // Score halves after 30 days of no use
+const MIN_PATTERN_SCORE = 0.2; // Prune patterns below this score
+const EXTRACTION_PROMPT = `You are a senior software architect analyzing successful task executions. Given a set of execution trajectories, identify reusable patterns that would help complete similar tasks in the future.
+
+For each distinct pattern you identify, provide:
+1. A short title (max 60 chars)
+2. Which tech stacks/domains it applies to (comma-separated)
+3. A concise description of the approach/structure (2-4 sentences)
+4. The file paths typically involved (as glob-like patterns)
+5. The agent sequence that works well for this task type
+
+Focus on structural patterns, not specific code. What matters is:
+- Which files tend to be touched together?
+- What's the right order of operations?
+- What conventions should be followed?
+
+Return a JSON array of patterns. Example:
+[
+  {
+    "title": "Adding new CLI commands",
+    "applicableDomains": ["typescript", "node", "cli"],
+    "description": "When adding a new CLI command, first update the command registration in the router, then create the implementation module, then update help text and exports.",
+    "commonFiles": ["src/cli/router.ts", "src/cli/*.ts", "src/index.ts"],
+    "commonAgentSequence": ["context-gatherer", "writer", "reviewer"]
+  }
+]
+
+Extract up to 3 patterns from the provided trajectories.`;
+// ─── PatternStore ───────────────────────────────────────────────────────────
+/**
+ * Manages storage and retrieval of reusable coding patterns.
+ * Patterns are extracted from high-scoring trajectories via LLM.
+ */
+export class PatternStore {
+    patterns = [];
+    constructor() {
+        this.patterns = this.load();
+    }
+    // ── Public API ──────────────────────────────────────────────────────────
+    /**
+     * Get all stored patterns, optionally filtered by minimum quality score.
+     */
+    getAll(minQualityScore) {
+        const patterns = [...this.patterns];
+        if (minQualityScore !== undefined) {
+            return patterns.filter((p) => this.computeDecayScore(p) >= minQualityScore);
+        }
+        return patterns;
+    }
+    /**
+     * Get patterns relevant to a specific project domain.
+     */
+    getByDomain(domainTags) {
+        if (domainTags.length === 0)
+            return this.getAll().slice(0, 3);
+        return this.patterns
+            .filter((p) => p.applicableDomains.some((d) => domainTags.some((tag) => d.toLowerCase().includes(tag.toLowerCase()))))
+            .slice(0, 3);
+    }
+    /**
+     * Format patterns as a prompt string for agent injection.
+     */
+    formatAsPrompt(domainTags) {
+        const relevant = domainTags ? this.getByDomain(domainTags) : this.getAll().slice(0, 3);
+        if (relevant.length === 0)
+            return '';
+        const parts = relevant.map((p, i) => `## Pattern ${i + 1}: ${p.title}\n` +
+            `Domains: ${p.applicableDomains.join(', ')}\n` +
+            `Approach: ${p.description}\n` +
+            `Common files: ${p.commonFiles.join(', ')}\n` +
+            `Agent sequence: ${p.commonAgentSequence.join(' → ')}`);
+        return (`\n---\n` +
+            `Here are reusable patterns learned from past successful executions similar to this project:\n\n` +
+            parts.join('\n\n') +
+            `\n---\n`);
+    }
+    /**
+     * Extract patterns from high-scoring trajectories using the LLM.
+     * Newly extracted patterns are merged with existing ones (keeping the best).
+     */
+    async extractFromTrajectories(trajectories, callLLM) {
+        const highScoring = trajectories
+            .filter((t) => t.score >= MIN_SCORE_FOR_EXTRACTION)
+            .slice(0, MAX_TRAJECTORIES_FOR_EXTRACTION);
+        if (highScoring.length < 2)
+            return 0; // Need at least 2 for pattern extraction
+        const prompt = this.buildExtractionPrompt(highScoring);
+        let response;
+        try {
+            response = await callLLM(prompt, {
+                temperature: 0.3,
+                maxTokens: 4096,
+            });
+        }
+        catch (err) {
+            logger.debug(`Pattern extraction failed: ${err}`);
+            return 0;
+        }
+        const newPatterns = this.parsePatterns(response);
+        if (newPatterns.length === 0)
+            return 0;
+        // Merge: replace existing patterns with same title, add new ones
+        for (const pattern of newPatterns) {
+            pattern.id = `pattern-${Date.now()}-${Math.random().toString(36).slice(2, 6)}`;
+            pattern.sourceCount = highScoring.length;
+            pattern.avgSourceScore =
+                highScoring.reduce((sum, t) => sum + t.score, 0) / highScoring.length;
+            pattern.createdAt = Date.now();
+            pattern.lastUsedAt = Date.now();
+            pattern.usageCount = 0;
+            const existing = this.patterns.findIndex((p) => p.title.toLowerCase() === pattern.title.toLowerCase());
+            if (existing >= 0) {
+                this.patterns[existing] = pattern;
+            }
+            else {
+                this.patterns.push(pattern);
+            }
+        }
+        // Keep only the best ones
+        if (this.patterns.length > MAX_PATTERNS) {
+            this.patterns.sort((a, b) => b.avgSourceScore - a.avgSourceScore);
+            this.patterns = this.patterns.slice(0, MAX_PATTERNS);
+        }
+        this.save();
+        return newPatterns.length;
+    }
+    /**
+     * Mark a pattern as used (for decay tracking).
+     */
+    markUsed(patternId) {
+        const pattern = this.patterns.find((p) => p.id === patternId);
+        if (pattern) {
+            pattern.lastUsedAt = Date.now();
+            pattern.usageCount++;
+            this.save();
+        }
+    }
+    /**
+     * Compute a decay score for a pattern based on age and usage.
+     * Returns a score from 0 (expired) to 1 (fresh).
+     */
+    computeDecayScore(pattern) {
+        const now = Date.now();
+        const ageMs = now - pattern.createdAt;
+        const ageDays = ageMs / (1000 * 60 * 60 * 24);
+        // Hard expiry: pattern too old
+        if (ageDays > PATTERN_TTL_DAYS)
+            return 0;
+        // Time-based decay: score halves after DECAY_DAYS_FOR_HALF_SCORE
+        const timeScore = Math.pow(0.5, ageDays / DECAY_DAYS_FOR_HALF_SCORE);
+        // Usage bonus: patterns used more often are worth keeping
+        const usageBonus = Math.min(pattern.usageCount * 0.05, 0.3);
+        // Last-used bonus: recently used patterns get a boost
+        const daysSinceLastUse = (now - pattern.lastUsedAt) / (1000 * 60 * 60 * 24);
+        const recencyBonus = Math.max(0, 0.2 - daysSinceLastUse * 0.01);
+        return Math.min(1, timeScore + usageBonus + recencyBonus);
+    }
+    /**
+     * Garbage collect low-quality patterns.
+     * Returns the number of patterns removed.
+     */
+    garbageCollect(verbose = false) {
+        const before = this.patterns.length;
+        // Remove patterns below minimum score
+        this.patterns = this.patterns.filter((p) => {
+            const score = this.computeDecayScore(p);
+            if (score < MIN_PATTERN_SCORE) {
+                if (verbose) {
+                    logger.debug(`Pruning pattern '${p.title}' (decay score: ${(score * 100).toFixed(0)}%)`);
+                }
+                return false;
+            }
+            return true;
+        });
+        // Also enforce max patterns
+        if (this.patterns.length > MAX_PATTERNS) {
+            this.patterns.sort((a, b) => this.computeDecayScore(b) - this.computeDecayScore(a));
+            this.patterns = this.patterns.slice(0, MAX_PATTERNS);
+        }
+        const removed = before - this.patterns.length;
+        if (removed > 0)
+            this.save();
+        return removed;
+    }
+    /**
+     * Get decay quality statistics for all patterns.
+     */
+    getQualityReport() {
+        const now = Date.now();
+        return this.patterns.map((p) => ({
+            id: p.id,
+            title: p.title,
+            decayScore: this.computeDecayScore(p),
+            usageCount: p.usageCount,
+            ageDays: Math.floor((now - p.createdAt) / (1000 * 60 * 60 * 24)),
+        })).sort((a, b) => a.decayScore - b.decayScore); // Worst first
+    }
+    /**
+     * Clear all patterns.
+     */
+    clear() {
+        this.patterns = [];
+        this.save();
+    }
+    // ── Private ────────────────────────────────────────────────────────────
+    load() {
+        try {
+            ensureDir();
+            if (!existsSync(PATTERNS_PATH))
+                return [];
+            const raw = readFileSync(PATTERNS_PATH, 'utf-8');
+            const data = JSON.parse(raw);
+            // Migrate old-format patterns (version 1 → 2) that may lack lastUsedAt/usageCount
+            const patterns = (data.patterns || []).map((p) => ({
+                ...p,
+                lastUsedAt: p.lastUsedAt ?? p.createdAt ?? Date.now(),
+                usageCount: p.usageCount ?? 0,
+            }));
+            return patterns;
+        }
+        catch {
+            return [];
+        }
+    }
+    save() {
+        ensureDir();
+        const data = { patterns: this.patterns, version: CURRENT_VERSION };
+        writeFileSync(PATTERNS_PATH, JSON.stringify(data, null, 2), 'utf-8');
+    }
+    buildExtractionPrompt(trajectories) {
+        const trajText = trajectories
+            .map((t, i) => `Trajectory ${i + 1} (score: ${t.score.toFixed(2)}):\n` +
+            `Goal: ${t.goal}\n` +
+            `Project: ${t.projectFingerprint}\n` +
+            `Steps: ${t.taskPlan.map((s) => `[${s.agentType}] ${s.description}`).join('\n')}\n` +
+            `Files: ${t.fileChanges.map((fc) => fc.path).join(', ')}\n`)
+            .join('\n---\n');
+        return `${EXTRACTION_PROMPT}\n\n## Execution Trajectories\n\n${trajText}`;
+    }
+    parsePatterns(response) {
+        // Try direct JSON parse first
+        try {
+            const trimmed = response.trim();
+            // Strip code block wrappers if present
+            const jsonStr = trimmed.replace(/^```(?:json)?\s*/, '').replace(/\s*```$/, '');
+            const parsed = JSON.parse(jsonStr);
+            if (Array.isArray(parsed)) {
+                return parsed.filter((p) => p.title && p.description && Array.isArray(p.applicableDomains));
+            }
+        }
+        catch {
+            // Fall through
+        }
+        // Try extracting JSON array from the response
+        const arrayMatch = response.match(/\[[\s\S]*?\]/);
+        if (arrayMatch) {
+            try {
+                const parsed = JSON.parse(arrayMatch[0]);
+                if (Array.isArray(parsed)) {
+                    return parsed.filter((p) => p.title && p.description && Array.isArray(p.applicableDomains));
+                }
+            }
+            catch {
+                // Fall through
+            }
+        }
+        return [];
+    }
+}
+// Singleton
+let storeInstance = null;
+export function getPatternStore() {
+    if (!storeInstance) {
+        storeInstance = new PatternStore();
+    }
+    return storeInstance;
+}
+// ─── Helpers ────────────────────────────────────────────────────────────────
+function ensureDir() {
+    if (!existsSync(MEMORY_DIR)) {
+        mkdirSync(MEMORY_DIR, { recursive: true });
+    }
+}
+//# sourceMappingURL=pattern-extractor.js.map

package/dist/learning/pattern-extractor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pattern-extractor.js","sourceRoot":"","sources":["../../src/learning/pattern-extractor.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAC7E,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAIlC,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAoC5C,+EAA+E;AAE/E,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,EAAE,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC;AACtD,MAAM,aAAa,GAAG,IAAI,CAAC,UAAU,EAAE,eAAe,CAAC,CAAC;AACxD,MAAM,eAAe,GAAG,CAAC,CAAC;AAC1B,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,MAAM,wBAAwB,GAAG,GAAG,CAAC,CAAC,8CAA8C;AACpF,MAAM,+BAA+B,GAAG,CAAC,CAAC;AAE1C,mDAAmD;AACnD,MAAM,gBAAgB,GAAG,EAAE,CAAC,CAAY,mCAAmC;AAC3E,MAAM,yBAAyB,GAAG,EAAE,CAAC,CAAG,uCAAuC;AAC/E,MAAM,iBAAiB,GAAG,GAAG,CAAC,CAAU,kCAAkC;AAE1E,MAAM,iBAAiB,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;yDAyB+B,CAAC;AAE1D,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,OAAO,YAAY;IACf,QAAQ,GAAoB,EAAE,CAAC;IAEvC;QACE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC9B,CAAC;IAED,2EAA2E;IAE3E;;OAEG;IACH,MAAM,CAAC,eAAwB;QAC7B,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpC,IAAI,eAAe,KAAK,SAAS,EAAE,CAAC;YAClC,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,eAAe,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,UAAoB;QAC9B,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9D,OAAO,IAAI,CAAC,QAAQ;aACjB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACZ,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAC7B,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,CAAC,CAAC,CACtE,CACF;aACA,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,UAAqB;QAClC,MAAM,QAAQ,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CACxB,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI;YACnC,YAAY,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;YAC9C,aAAa,CAAC,CAAC,WAAW,IAAI;YAC9B,iBAAiB,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;YAC7C,mBAAmB,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CACzD,CAAC;QAEF,OAAO,CACL,SAAS;YACT,iGAAiG;YACjG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;YAClB,SAAS,CACV,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,uBAAuB,CAC3B,YAA0B,EAC1B,OAAkB;QAElB,MAAM,WAAW,GAAG,YAAY;aAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,wBAAwB,CAAC;aAClD,KAAK,CAAC,CAAC,EAAE,+BAA+B,CAAC,CAAC;QAE7C,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC,yCAAyC;QAE/E,MAAM,MAAM,GAAG,IAAI,CAAC,qBAAqB,CAAC,WAAW,CAAC,CAAC;QACvD,IAAI,QAAgB,CAAC;QAErB,IAAI,CAAC;YACH,QAAQ,GAAG,MAAM,OAAO,CAAC,MAAM,EAAE;gBAC/B,WAAW,EAAE,GAAG;gBAChB,SAAS,EAAE,IAAI;aAChB,CAAC,CAAC;QACL,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,MAAM,CAAC,KAAK,CAAC,8BAA8B,GAAG,EAAE,CAAC,CAAC;YAClD,OAAO,CAAC,CAAC;QACX,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEvC,iEAAiE;QACjE,KAAK,MAAM,OAAO,IAAI,WAAW,EAAE,CAAC;YAClC,OAAO,CAAC,EAAE,GAAG,WAAW,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;YAC/E,OAAO,CAAC,WAAW,GAAG,WAAW,CAAC,MAAM,CAAC;YACzC,OAAO,CAAC,cAAc;gBACpB,WAAW,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC;YACxE,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAC/B,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAChC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC;YAEvB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,KAAK,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,CAC7D,CAAC;YACF,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;gBAClB,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC;YACpC,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QAED,0BAA0B;QAC1B,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;YACxC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAC;YAClE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QACvD,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,WAAW,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,SAAiB;QACxB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,CAAC;QAC9D,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YAChC,OAAO,CAAC,UAAU,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,iBAAiB,CAAC,OAAsB;QACtC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,KAAK,GAAG,GAAG,GAAG,OAAO,CAAC,SAAS,CAAC;QACtC,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAE9C,+BAA+B;QAC/B,IAAI,OAAO,GAAG,gBAAgB;YAAE,OAAO,CAAC,CAAC;QAEzC,iEAAiE;QACjE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,OAAO,GAAG,yBAAyB,CAAC,CAAC;QAErE,0DAA0D;QAC1D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;QAE5D,sDAAsD;QACtD,MAAM,gBAAgB,GAAG,CAAC,GAAG,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC5E,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,gBAAgB,GAAG,IAAI,CAAC,CAAC;QAEhE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,GAAG,UAAU,GAAG,YAAY,CAAC,CAAC;IAC5D,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,UAAmB,KAAK;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAEpC,sCAAsC;QACtC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACzC,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;YACxC,IAAI,KAAK,GAAG,iBAAiB,EAAE,CAAC;gBAC9B,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,CAAC,KAAK,CAAC,oBAAoB,CAAC,CAAC,KAAK,mBAAmB,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC3F,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QAEH,4BAA4B;QAC5B,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;YACxC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,CAAC;YACpF,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;QACvD,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC9C,IAAI,OAAO,GAAG,CAAC;YAAE,IAAI,CAAC,IAAI,EAAE,CAAC;QAC7B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,gBAAgB;QACd,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC/B,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC;YACrC,UAAU,EAAE,CAAC,CAAC,UAAU;YACxB,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;SACjE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,cAAc;IACjE,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAED,0EAA0E;IAElE,IAAI;QACV,IAAI,CAAC;YACH,SAAS,EAAE,CAAC;YACZ,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC;gBAAE,OAAO,EAAE,CAAC;YAC1C,MAAM,GAAG,GAAG,YAAY,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC;YACjD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAgB,CAAC;YAE5C,kFAAkF;YAClF,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACjD,GAAG,CAAC;gBACJ,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC,CAAC,SAAS,IAAI,IAAI,CAAC,GAAG,EAAE;gBACrD,UAAU,EAAE,CAAC,CAAC,UAAU,IAAI,CAAC;aAC9B,CAAC,CAAC,CAAC;YAEJ,OAAO,QAAQ,CAAC;QAClB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAEO,IAAI;QACV,SAAS,EAAE,CAAC;QACZ,MAAM,IAAI,GAAgB,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC;QAChF,aAAa,CAAC,aAAa,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;IACvE,CAAC;IAEO,qBAAqB,CAAC,YAA0B;QACtD,MAAM,QAAQ,GAAG,YAAY;aAC1B,GAAG,CACF,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACP,cAAc,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM;YACvD,SAAS,CAAC,CAAC,IAAI,IAAI;YACnB,YAAY,CAAC,CAAC,kBAAkB,IAAI;YACpC,UAAU,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,SAAS,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI;YACnF,UAAU,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAC9D;aACA,IAAI,CAAC,SAAS,CAAC,CAAC;QAEnB,OAAO,GAAG,iBAAiB,oCAAoC,QAAQ,EAAE,CAAC;IAC5E,CAAC;IAEO,aAAa,CAAC,QAAgB;QACpC,8BAA8B;QAC9B,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;YAChC,uCAAuC;YACvC,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAC/E,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACnC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC1B,OAAO,MAAM,CAAC,MAAM,CAClB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,CACtE,CAAC;YACJ,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,eAAe;QACjB,CAAC;QAED,8CAA8C;QAC9C,MAAM,UAAU,GAAG,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QAClD,IAAI,UAAU,EAAE,CAAC;YACf,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC1B,OAAO,MAAM,CAAC,MAAM,CAClB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,WAAW,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,iBAAiB,CAAC,CACtE,CAAC;gBACJ,CAAC;YACH,CAAC;YAAC,MAAM,CAAC;gBACP,eAAe;YACjB,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;CACF;AAED,YAAY;AACZ,IAAI,aAAa,GAAwB,IAAI,CAAC;AAE9C,MAAM,UAAU,eAAe;IAC7B,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,aAAa,GAAG,IAAI,YAAY,EAAE,CAAC;IACrC,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED,+EAA+E;AAE/E,SAAS,SAAS;IAChB,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QAC5B,SAAS,CAAC,UAAU,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC7C,CAAC;AACH,CAAC"}

package/dist/learning/scorer.d.ts

@@ -0,0 +1,51 @@
+/**
+ * TrajectoryScorer — Scores execution trajectories based on outcome quality.
+ *
+ * Scoring heuristics (max score = 1.0):
+ * - Base completion: 0.4 (all tasks completed → 0.4, partial → proportional)
+ * - No test failures: +0.3 (all tests passed)
+ * - No reviewer issues: +0.2 (reviewer approved)
+ * - Fewer iterations: +0.1 (fewer agent steps = more efficient)
+ *
+ * Scores are computed when a trajectory is saved and can be re-scored later
+ * if the user provides feedback (e.g., "accepted changes").
+ *
+ * Scoring happens at save time in the TrajectoryStore and is stored
+ * in the trajectory's `score` field for search ranking.
+ */
+import type { OrchestrationResult } from '../agents/orchestrator.js';
+export interface ScoreComponents {
+    /** 0–0.4: based on task completion ratio */
+    completionScore: number;
+    /** 0–0.3: based on test success */
+    testScore: number;
+    /** 0–0.2: based on reviewer approval */
+    reviewScore: number;
+    /** 0–0.1: based on efficiency (fewer iterations) */
+    efficiencyScore: number;
+    /** Total score (0–1), clamped */
+    total: number;
+}
+export interface ScoreInput {
+    /** Tasks completed vs total (e.g., 5/5) */
+    tasksCompleted: number;
+    tasksTotal: number;
+    /** Whether all tests passed (from TesterAgent) */
+    testsPassed?: boolean;
+    /** Whether the reviewer approved (no critical issues) */
+    reviewPassed?: boolean;
+    /** Number of agent steps executed (fewer = more efficient) */
+    totalSteps?: number;
+    /** 0–1 user feedback (1 = accepted without changes) */
+    userAcceptance?: number;
+}
+/**
+ * Score a trajectory execution outcome.
+ * Returns component scores and the total.
+ */
+export declare function scoreTrajectory(input: ScoreInput): ScoreComponents;
+/**
+ * Convenience: score an OrchestrationResult directly.
+ */
+export declare function scoreOrchestrationResult(result: OrchestrationResult, extra?: Partial<ScoreInput>): number;
+//# sourceMappingURL=scorer.d.ts.map

package/dist/learning/scorer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scorer.d.ts","sourceRoot":"","sources":["../../src/learning/scorer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAIrE,MAAM,WAAW,eAAe;IAC9B,4CAA4C;IAC5C,eAAe,EAAE,MAAM,CAAC;IACxB,mCAAmC;IACnC,SAAS,EAAE,MAAM,CAAC;IAClB,wCAAwC;IACxC,WAAW,EAAE,MAAM,CAAC;IACpB,oDAAoD;IACpD,eAAe,EAAE,MAAM,CAAC;IACxB,iCAAiC;IACjC,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,UAAU;IACzB,2CAA2C;IAC3C,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE,MAAM,CAAC;IACnB,kDAAkD;IAClD,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB,yDAAyD;IACzD,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,8DAA8D;IAC9D,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,uDAAuD;IACvD,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAaD;;;GAGG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,UAAU,GAAG,eAAe,CAelE;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CACtC,MAAM,EAAE,mBAAmB,EAC3B,KAAK,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,GAC1B,MAAM,CAQR"}

package/dist/learning/scorer.js

@@ -0,0 +1,64 @@
+/**
+ * TrajectoryScorer — Scores execution trajectories based on outcome quality.
+ *
+ * Scoring heuristics (max score = 1.0):
+ * - Base completion: 0.4 (all tasks completed → 0.4, partial → proportional)
+ * - No test failures: +0.3 (all tests passed)
+ * - No reviewer issues: +0.2 (reviewer approved)
+ * - Fewer iterations: +0.1 (fewer agent steps = more efficient)
+ *
+ * Scores are computed when a trajectory is saved and can be re-scored later
+ * if the user provides feedback (e.g., "accepted changes").
+ *
+ * Scoring happens at save time in the TrajectoryStore and is stored
+ * in the trajectory's `score` field for search ranking.
+ */
+// ─── Constants ──────────────────────────────────────────────────────────────
+const MAX_COMPLETION_SCORE = 0.4;
+const MAX_TEST_SCORE = 0.3;
+const MAX_REVIEW_SCORE = 0.2;
+const MAX_EFFICIENCY_SCORE = 0.1;
+const MAX_USER_FEEDBACK_SCORE = 0.5;
+const BASELINE_STEPS = 3; // "Ideal" minimum steps for most tasks
+// ─── Scorer ─────────────────────────────────────────────────────────────────
+/**
+ * Score a trajectory execution outcome.
+ * Returns component scores and the total.
+ */
+export function scoreTrajectory(input) {
+    const completionScore = computeCompletionScore(input.tasksCompleted, input.tasksTotal);
+    const testScore = input.testsPassed === true ? MAX_TEST_SCORE : 0;
+    const reviewScore = input.reviewPassed === true ? MAX_REVIEW_SCORE : 0;
+    const efficiencyScore = computeEfficiencyScore(input.totalSteps);
+    const userScore = input.userAcceptance
+        ? input.userAcceptance * MAX_USER_FEEDBACK_SCORE
+        : 0;
+    const total = Math.min(completionScore + testScore + reviewScore + efficiencyScore + userScore, 1.0);
+    return { completionScore, testScore, reviewScore, efficiencyScore, total };
+}
+/**
+ * Convenience: score an OrchestrationResult directly.
+ */
+export function scoreOrchestrationResult(result, extra) {
+    const scored = scoreTrajectory({
+        tasksCompleted: result.tasksCompleted,
+        tasksTotal: result.tasksTotal,
+        reviewPassed: result.success,
+        ...extra,
+    });
+    return scored.total;
+}
+// ─── Helpers ────────────────────────────────────────────────────────────────
+function computeCompletionScore(completed, total) {
+    if (total === 0)
+        return 0;
+    return (completed / total) * MAX_COMPLETION_SCORE;
+}
+function computeEfficiencyScore(totalSteps) {
+    if (totalSteps === undefined || totalSteps <= 0)
+        return 0;
+    // Fewer steps = higher efficiency. 3 steps = max score, 10+ steps = 0.
+    const ratio = Math.max(0, 1 - (totalSteps - BASELINE_STEPS) / 10);
+    return ratio * MAX_EFFICIENCY_SCORE;
+}
+//# sourceMappingURL=scorer.js.map

package/dist/learning/scorer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scorer.js","sourceRoot":"","sources":["../../src/learning/scorer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAiCH,+EAA+E;AAE/E,MAAM,oBAAoB,GAAG,GAAG,CAAC;AACjC,MAAM,cAAc,GAAG,GAAG,CAAC;AAC3B,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAC7B,MAAM,oBAAoB,GAAG,GAAG,CAAC;AACjC,MAAM,uBAAuB,GAAG,GAAG,CAAC;AACpC,MAAM,cAAc,GAAG,CAAC,CAAC,CAAC,uCAAuC;AAEjE,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,KAAiB;IAC/C,MAAM,eAAe,GAAG,sBAAsB,CAAC,KAAK,CAAC,cAAc,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IACvF,MAAM,SAAS,GAAG,KAAK,CAAC,WAAW,KAAK,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,WAAW,GAAG,KAAK,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,eAAe,GAAG,sBAAsB,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;IACjE,MAAM,SAAS,GAAG,KAAK,CAAC,cAAc;QACpC,CAAC,CAAC,KAAK,CAAC,cAAc,GAAG,uBAAuB;QAChD,CAAC,CAAC,CAAC,CAAC;IAEN,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CACpB,eAAe,GAAG,SAAS,GAAG,WAAW,GAAG,eAAe,GAAG,SAAS,EACvE,GAAG,CACJ,CAAC;IAEF,OAAO,EAAE,eAAe,EAAE,SAAS,EAAE,WAAW,EAAE,eAAe,EAAE,KAAK,EAAE,CAAC;AAC7E,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,wBAAwB,CACtC,MAA2B,EAC3B,KAA2B;IAE3B,MAAM,MAAM,GAAG,eAAe,CAAC;QAC7B,cAAc,EAAE,MAAM,CAAC,cAAc;QACrC,UAAU,EAAE,MAAM,CAAC,UAAU;QAC7B,YAAY,EAAE,MAAM,CAAC,OAAO;QAC5B,GAAG,KAAK;KACT,CAAC,CAAC;IACH,OAAO,MAAM,CAAC,KAAK,CAAC;AACtB,CAAC;AAED,+EAA+E;AAE/E,SAAS,sBAAsB,CAAC,SAAiB,EAAE,KAAa;IAC9D,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,oBAAoB,CAAC;AACpD,CAAC;AAED,SAAS,sBAAsB,CAAC,UAAmB;IACjD,IAAI,UAAU,KAAK,SAAS,IAAI,UAAU,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1D,uEAAuE;IACvE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,UAAU,GAAG,cAAc,CAAC,GAAG,EAAE,CAAC,CAAC;IAClE,OAAO,KAAK,GAAG,oBAAoB,CAAC;AACtC,CAAC"}

package/dist/learning/self-improver.d.ts

@@ -0,0 +1,48 @@
+/**
+ * SelfImprover — The self-improvement loop that ties together scoring,
+ * agent performance tracking, pattern extraction, and model optimization.
+ *
+ * After each orchestration run (when `useMemory: true`), the SelfImprover:
+ * 1. Scores the trajectory (how well did we do?)
+ * 2. Records per-agent stats (which agents/models succeed/fail?)
+ * 3. Periodically extracts patterns from high-scoring trajectories
+ * 4. Provides optimization recommendations (best models per agent)
+ *
+ * The SelfImprover is called by the Orchestrator post-execution hook.
+ * Users can also interact with it via the `buff learn` CLI commands.
+ */
+import type { OrchestrationResult } from '../agents/orchestrator.js';
+import type { LLMCallFn } from '../agents/agent.js';
+export declare class SelfImprover {
+    private runCountSinceLastExtraction;
+    /**
+     * Process a completed orchestration run through the self-improvement loop.
+     * Scores the result, tracks agent stats, and conditionally extracts patterns.
+     *
+     * @param result       The completed orchestration result
+     * @param callLLM      LLM function for pattern extraction
+     * @param agentModels  The model map used for this run (for tracking model perf)
+     * @param verbose      Whether to log details
+     */
+    processRun(result: OrchestrationResult, callLLM: LLMCallFn, agentModels?: Record<string, string>, verbose?: boolean): Promise<void>;
+    /**
+     * Force pattern extraction from the best trajectories in the store.
+     */
+    extractPatterns(callLLM: LLMCallFn, verbose?: boolean): Promise<number>;
+    /**
+     * Get optimization recommendations based on collected stats.
+     * Returns a recommended model map for the Orchestrator.
+     */
+    getOptimizedModelMap(): Record<string, string>;
+    /**
+     * Get a human-readable summary of the self-improvement status.
+     */
+    getStatus(): string;
+    /**
+     * Reset extraction counter (called when user manually extracts patterns).
+     */
+    resetExtractionCounter(): void;
+    private averageScore;
+}
+export declare function getSelfImprover(): SelfImprover;
+//# sourceMappingURL=self-improver.d.ts.map

package/dist/learning/self-improver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"self-improver.d.ts","sourceRoot":"","sources":["../../src/learning/self-improver.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAEH,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,2BAA2B,CAAC;AAErE,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAoBpD,qBAAa,YAAY;IACvB,OAAO,CAAC,2BAA2B,CAAa;IAEhD;;;;;;;;OAQG;IACG,UAAU,CACd,MAAM,EAAE,mBAAmB,EAC3B,OAAO,EAAE,SAAS,EAClB,WAAW,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,EACpC,OAAO,GAAE,OAAe,GACvB,OAAO,CAAC,IAAI,CAAC;IA2BhB;;OAEG;IACG,eAAe,CACnB,OAAO,EAAE,SAAS,EAClB,OAAO,GAAE,OAAe,GACvB,OAAO,CAAC,MAAM,CAAC;IAkClB;;;OAGG;IACH,oBAAoB,IAAI,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;IAe9C;;OAEG;IACH,SAAS,IAAI,MAAM;IAgCnB;;OAEG;IACH,sBAAsB,IAAI,IAAI;IAM9B,OAAO,CAAC,YAAY;CAMrB;AAKD,wBAAgB,eAAe,IAAI,YAAY,CAK9C"}