loopforge 1.12.0 → 2.0.0

package/dist/backends/fs.js

@@ -1,358 +0,0 @@
-/** FSBackend — filesystem implementation of VaultBackend.
- *
- * Wraps Node.js fs for JSON vault read/write and Markdown lineage I/O.
- * All file I/O is contained in this single module — engine.ts never
- * touches the filesystem directly.
- */
-import { readFileSync, writeFileSync, mkdirSync, readdirSync, existsSync, rmSync, } from "node:fs";
-import { resolve, dirname } from "node:path";
-import { homedir } from "node:os";
-// ═══════════════════════════════════════════════════════════════════════════
-// YAML frontmatter helpers (lightweight, no dependency)
-// ═══════════════════════════════════════════════════════════════════════════
-const FRONTMATTER_DELIM = "---";
-function escapeYamlString(value) {
-    if (/[":{}[\],&\*\#\?\-<>=!%@`]/.test(value) || value.includes("\n")) {
-        return `"${value.replace(/\\/g, "\\\\").replace(/"/g, '\\"')}"`;
-    }
-    return value;
-}
-function buildYamlFrontmatter(metadata) {
-    const lines = [FRONTMATTER_DELIM];
-    for (const [key, value] of Object.entries(metadata)) {
-        if (value === null || value === undefined)
-            continue;
-        if (Array.isArray(value)) {
-            if (value.length === 0) {
-                lines.push(`${key}: []`);
-            }
-            else {
-                lines.push(`${key}:`);
-                for (const item of value) {
-                    lines.push(`  - ${escapeYamlString(String(item))}`);
-                }
-            }
-        }
-        else if (typeof value === "object") {
-            lines.push(`${key}:`);
-            for (const [subKey, subValue] of Object.entries(value)) {
-                if (subValue !== null && subValue !== undefined) {
-                    if (Array.isArray(subValue)) {
-                        lines.push(`  ${subKey}:`);
-                        for (const item of subValue) {
-                            lines.push(`    - ${escapeYamlString(String(item))}`);
-                        }
-                    }
-                    else {
-                        lines.push(`  ${subKey}: ${escapeYamlString(String(subValue))}`);
-                    }
-                }
-            }
-        }
-        else if (typeof value === "boolean") {
-            lines.push(`${key}: ${value}`);
-        }
-        else if (typeof value === "number") {
-            lines.push(`${key}: ${value}`);
-        }
-        else {
-            lines.push(`${key}: ${escapeYamlString(String(value))}`);
-        }
-    }
-    lines.push(FRONTMATTER_DELIM);
-    return lines.join("\n") + "\n";
-}
-function parseYamlFrontmatter(text) {
-    const metadata = {};
-    let body = text;
-    if (!text.startsWith(FRONTMATTER_DELIM)) {
-        return { metadata, body };
-    }
-    const endIdx = text.indexOf(FRONTMATTER_DELIM, 3);
-    if (endIdx === -1) {
-        return { metadata, body };
-    }
-    const fmBlock = text.slice(3, endIdx).trim();
-    body = text.slice(endIdx + 3).trim();
-    // Simple YAML key: value parser (covers our subset)
-    let currentKey = "";
-    for (const line of fmBlock.split("\n")) {
-        const trimmed = line.trim();
-        if (!trimmed)
-            continue;
-        // List item
-        if (trimmed.startsWith("- ")) {
-            const item = trimmed.slice(2).trim().replace(/^"(.*)"$/, "$1");
-            if (currentKey && metadata[currentKey]) {
-                metadata[currentKey].push(item);
-            }
-            else if (currentKey) {
-                metadata[currentKey] = [item];
-            }
-            continue;
-        }
-        // Nested key (indented)
-        if (line.startsWith("  ") && !line.startsWith("    ")) {
-            const nestedMatch = trimmed.match(/^([a-z_]+):\s*(.*)/i);
-            if (nestedMatch && currentKey) {
-                const nKey = nestedMatch[1];
-                const nVal = nestedMatch[2].trim().replace(/^"(.*)"$/, "$1");
-                if (!metadata[currentKey]) {
-                    metadata[currentKey] = {};
-                }
-                metadata[currentKey][nKey] =
-                    coerceYamlScalar(nVal);
-            }
-            continue;
-        }
-        // Top-level key: value
-        const match = trimmed.match(/^([a-z_]+):\s*(.*)/i);
-        if (match) {
-            currentKey = match[1];
-            const val = match[2].trim();
-            if (val) {
-                metadata[currentKey] = coerceYamlScalar(val.replace(/^"(.*)"$/, "$1"));
-            }
-            else {
-                metadata[currentKey] = "";
-            }
-        }
-    }
-    return { metadata, body };
-}
-function coerceYamlScalar(value) {
-    if (value === "true" || value === "True")
-        return true;
-    if (value === "false" || value === "False")
-        return false;
-    const num = Number(value);
-    if (!Number.isNaN(num) && value.trim() !== "")
-        return num;
-    return value;
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Path helpers
-// ═══════════════════════════════════════════════════════════════════════════
-function lineageDirName(loopId) {
-    return `loop-${loopId.replace(/:/g, "-")}`;
-}
-function resolveVaultPath(rawPath) {
-    if (rawPath.startsWith("~")) {
-        return resolve(homedir(), rawPath.slice(2));
-    }
-    return resolve(rawPath);
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Markdown lineage I/O (module-level functions)
-// ═══════════════════════════════════════════════════════════════════════════
-export function readLineageMd(loopId, roundNum, vaultPath) {
-    const baseDir = vaultPath
-        ? dirname(resolveVaultPath(vaultPath))
-        : resolve(".promptcraft");
-    const mdPath = resolve(baseDir, "prompts", lineageDirName(loopId), `r${roundNum}.md`);
-    try {
-        const raw = readFileSync(mdPath, "utf-8");
-        const { metadata, body } = parseYamlFrontmatter(raw);
-        return { full_prompt: body, metadata };
-    }
-    catch {
-        return null;
-    }
-}
-export function writeLineageMd(loopId, roundNum, content, metadata, vaultPath) {
-    const baseDir = vaultPath
-        ? dirname(resolveVaultPath(vaultPath))
-        : resolve(".promptcraft");
-    const dir = resolve(baseDir, "prompts", lineageDirName(loopId));
-    const mdPath = resolve(dir, `r${roundNum}.md`);
-    try {
-        mkdirSync(dir, { recursive: true });
-        const fm = buildYamlFrontmatter(metadata);
-        writeFileSync(mdPath, fm + "\n" + content, "utf-8");
-        return mdPath;
-    }
-    catch {
-        return null;
-    }
-}
-export function scanLineageMd(loopId, vaultPath) {
-    const baseDir = vaultPath
-        ? dirname(resolveVaultPath(vaultPath))
-        : resolve(".promptcraft");
-    const dir = resolve(baseDir, "prompts", lineageDirName(loopId));
-    const entries = [];
-    try {
-        if (!existsSync(dir))
-            return entries;
-        const files = readdirSync(dir).filter((f) => f.startsWith("r") && f.endsWith(".md"));
-        for (const file of files) {
-            const roundMatch = file.match(/^r(\d+)\.md$/);
-            if (!roundMatch)
-                continue;
-            const roundNum = parseInt(roundMatch[1], 10);
-            const fullPath = resolve(dir, file);
-            const raw = readFileSync(fullPath, "utf-8");
-            const { metadata, body } = parseYamlFrontmatter(raw);
-            entries.push({
-                task_id: `loop:${loopId}:r${roundNum}`,
-                full_prompt: body,
-                technique_used: metadata.technique_used,
-                success: metadata.success ?? true,
-                loop_lineage: {
-                    loop_id: loopId,
-                    round: roundNum,
-                    goal_id: metadata.goal_id,
-                    goal_text_hash: metadata.goal_text_hash,
-                    recompile_level: metadata.recompile_level,
-                    constraints_active: metadata.constraints_active,
-                    task: metadata.task,
-                    technique_used: metadata.technique_used,
-                    success: metadata.success,
-                    output_summary: metadata.output_summary,
-                    constraint_violations: metadata.constraint_violations,
-                },
-                loop_id: loopId,
-                task: metadata.task,
-                output_summary: metadata.output_summary,
-                constraint_violations: metadata
-                    .constraint_violations,
-            });
-        }
-    }
-    catch {
-        // Directory doesn't exist or can't be read
-    }
-    return entries;
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// FSBackend
-// ═══════════════════════════════════════════════════════════════════════════
-export class FSBackend {
-    vaultPath;
-    // v2: federation — global vault for cross-project constraints (not yet implemented)
-    globalVaultPath;
-    /** Re-entrant lock depth — >0 means this process holds the lock. */
-    lockDepth = 0;
-    constructor(vaultPath = ".promptcraft/prompt_vault.json", globalVaultPath = "~/.promptcraft/global_vault.json") {
-        this.vaultPath = vaultPath;
-        this.globalVaultPath = globalVaultPath;
-    }
-    /** File-system mutex via mkdir (atomic on POSIX and Windows).
-     *  Re-entrant: nested calls from the same process bypass the lock. */
-    withLock(fn) {
-        if (this.lockDepth > 0) {
-            this.lockDepth++;
-            try {
-                return fn();
-            }
-            finally {
-                this.lockDepth--;
-            }
-        }
-        const lockPath = resolveVaultPath(this.vaultPath).replace(/\.json$/, ".lock");
-        for (let i = 0; i < 100; i++) {
-            try {
-                mkdirSync(lockPath);
-                break;
-            }
-            catch {
-                if (i === 99)
-                    throw new Error("Vault lock timeout");
-            }
-            // spin-wait 10ms
-            const start = Date.now();
-            while (Date.now() - start < 10) {
-                /* spin */
-            }
-        }
-        this.lockDepth = 1;
-        try {
-            return fn();
-        }
-        finally {
-            this.lockDepth = 0;
-            try {
-                rmSync(lockPath, { recursive: true });
-            }
-            catch {
-                /* orphaned lock — next process cleans up via timeout */
-            }
-        }
-    }
-    // ── JSON vault ────────────────────────────────────────────────────────
-    readVault() {
-        const resolved = resolveVaultPath(this.vaultPath);
-        try {
-            const raw = readFileSync(resolved, "utf-8");
-            return JSON.parse(raw);
-        }
-        catch {
-            return { entries: [] };
-        }
-    }
-    writeVault(data) {
-        this.withLock(() => {
-            const resolved = resolveVaultPath(this.vaultPath);
-            mkdirSync(dirname(resolved), { recursive: true });
-            writeFileSync(resolved, JSON.stringify(data, null, 2), "utf-8");
-        });
-    }
-    // ── Entry queries ─────────────────────────────────────────────────────
-    queryEntries(opts) {
-        const vault = this.readVault();
-        const entries = vault.entries || [];
-        return entries.filter((entry) => {
-            const taskId = String(entry.task_id ?? "");
-            // Feedback-only filter
-            if (opts?.feedbackOnly && !taskId.endsWith(":feedback")) {
-                return false;
-            }
-            // Exclude feedback entries when not feedbackOnly
-            if (!opts?.feedbackOnly && taskId.endsWith(":feedback")) {
-                return false;
-            }
-            // Prefix filter
-            if (opts?.prefix && !taskId.startsWith(opts.prefix)) {
-                return false;
-            }
-            // Pattern filter (simple substring match)
-            if (opts?.taskIdPattern &&
-                !taskId.includes(opts.taskIdPattern)) {
-                return false;
-            }
-            return true;
-        });
-    }
-    appendEntry(entry) {
-        this.withLock(() => {
-            const vault = this.readVault();
-            const entries = vault.entries || [];
-            entries.push(entry);
-            vault.entries = entries;
-            this.writeVault(vault);
-        });
-    }
-    appendEntries(entries) {
-        return this.withLock(() => {
-            if (entries.length === 0)
-                return 0;
-            const vault = this.readVault();
-            const existing = vault.entries || [];
-            vault.entries = [...existing, ...entries];
-            this.writeVault(vault);
-            return entries.length;
-        });
-    }
-    // ── Markdown lineage ──────────────────────────────────────────────────
-    writeLineageMd(loopId, roundNum, content, metadata) {
-        return writeLineageMd(loopId, roundNum, content, metadata, this.vaultPath);
-    }
-    readLineageMd(loopId, roundNum) {
-        const result = readLineageMd(loopId, roundNum, this.vaultPath);
-        return result?.full_prompt ?? null;
-    }
-    scanLineageMd(loopId) {
-        return scanLineageMd(loopId, this.vaultPath);
-    }
-}
-//# sourceMappingURL=fs.js.map

package/dist/backends/fs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fs.js","sourceRoot":"","sources":["../../src/backends/fs.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EACL,YAAY,EACZ,aAAa,EACb,SAAS,EACT,WAAW,EACX,UAAU,EACV,MAAM,GACP,MAAM,SAAS,CAAC;AACjB,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAC7C,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAGlC,8EAA8E;AAC9E,wDAAwD;AACxD,8EAA8E;AAE9E,MAAM,iBAAiB,GAAG,KAAK,CAAC;AAEhC,SAAS,gBAAgB,CAAC,KAAa;IACrC,IAAI,4BAA4B,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;QACrE,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC;IAClE,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,oBAAoB,CAAC,QAAiC;IAC7D,MAAM,KAAK,GAAa,CAAC,iBAAiB,CAAC,CAAC;IAC5C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QACpD,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QACpD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;gBACtB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;oBACzB,KAAK,CAAC,IAAI,CAAC,OAAO,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;gBACtD,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;YACtB,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAC7C,KAAgC,CACjC,EAAE,CAAC;gBACF,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;oBAChD,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC5B,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,GAAG,CAAC,CAAC;wBAC3B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;4BAC5B,KAAK,CAAC,IAAI,CAAC,SAAS,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;wBACxD,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,KAAK,CAAC,IAAI,CAAC,KAAK,MAAM,KAAK,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC;oBACnE,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;aAAM,IAAI,OAAO,KAAK,KAAK,SAAS,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,KAAK,EAAE,CAAC,CAAC;QACjC,CAAC;aAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,KAAK,EAAE,CAAC,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,gBAAgB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IAC9B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AACjC,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAY;IAIxC,MAAM,QAAQ,GAA4B,EAAE,CAAC;IAC7C,IAAI,IAAI,GAAG,IAAI,CAAC;IAEhB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,iBAAiB,CAAC,EAAE,CAAC;QACxC,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;IAClD,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;QAClB,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;IAC7C,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAErC,oDAAoD;IACpD,IAAI,UAAU,GAAG,EAAE,CAAC;IACpB,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,YAAY;QACZ,IAAI,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YAC/D,IAAI,UAAU,IAAI,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACtC,QAAQ,CAAC,UAAU,CAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChD,CAAC;iBAAM,IAAI,UAAU,EAAE,CAAC;gBACtB,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChC,CAAC;YACD,SAAS;QACX,CAAC;QAED,wBAAwB;QACxB,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YACtD,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;YACzD,IAAI,WAAW,IAAI,UAAU,EAAE,CAAC;gBAC9B,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;gBAC5B,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;gBAC7D,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC1B,QAAQ,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;gBAC5B,CAAC;gBACA,QAAQ,CAAC,UAAU,CAA6B,CAAC,IAAI,CAAC;oBACrD,gBAAgB,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;YACD,SAAS;QACX,CAAC;QAED,uBAAuB;QACvB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,qBAAqB,CAAC,CAAC;QACnD,IAAI,KAAK,EAAE,CAAC;YACV,UAAU,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACtB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,GAAG,EAAE,CAAC;gBACR,QAAQ,CAAC,UAAU,CAAC,GAAG,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC;YACzE,CAAC;iBAAM,CAAC;gBACN,QAAQ,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAC5B,CAAC;AAED,SAAS,gBAAgB,CAAC,KAAa;IACrC,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IACtD,IAAI,KAAK,KAAK,OAAO,IAAI,KAAK,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC;IACzD,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE;QAAE,OAAO,GAAG,CAAC;IAC1D,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E,SAAS,cAAc,CAAC,MAAc;IACpC,OAAO,QAAQ,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;AAC7C,CAAC;AAED,SAAS,gBAAgB,CAAC,OAAe;IACvC,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5B,OAAO,OAAO,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IACD,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC;AAC1B,CAAC;AAED,8EAA8E;AAC9E,gDAAgD;AAChD,8EAA8E;AAE9E,MAAM,UAAU,aAAa,CAC3B,MAAc,EACd,QAAgB,EAChB,SAAkB;IAElB,MAAM,OAAO,GAAG,SAAS;QACvB,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;IAC5B,MAAM,MAAM,GAAG,OAAO,CACpB,OAAO,EACP,SAAS,EACT,cAAc,CAAC,MAAM,CAAC,EACtB,IAAI,QAAQ,KAAK,CAClB,CAAC;IAEF,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QAC1C,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC;QACrD,OAAO,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;IACzC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,MAAc,EACd,QAAgB,EAChB,OAAe,EACf,QAAiC,EACjC,SAAkB;IAElB,MAAM,OAAO,GAAG,SAAS;QACvB,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,EAAE,SAAS,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;IAChE,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,QAAQ,KAAK,CAAC,CAAC;IAE/C,IAAI,CAAC;QACH,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,oBAAoB,CAAC,QAAQ,CAAC,CAAC;QAC1C,aAAa,CAAC,MAAM,EAAE,EAAE,GAAG,IAAI,GAAG,OAAO,EAAE,OAAO,CAAC,CAAC;QACpD,OAAO,MAAM,CAAC;IAChB,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,UAAU,aAAa,CAC3B,MAAc,EACd,SAAkB;IAElB,MAAM,OAAO,GAAG,SAAS;QACvB,CAAC,CAAC,OAAO,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;IAC5B,MAAM,GAAG,GAAG,OAAO,CAAC,OAAO,EAAE,SAAS,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;IAEhE,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,IAAI,CAAC;QACH,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,OAAO,OAAO,CAAC;QACrC,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,CACnC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,CAC9C,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;YAC9C,IAAI,CAAC,UAAU;gBAAE,SAAS;YAE1B,MAAM,QAAQ,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7C,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACpC,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC5C,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC;YAErD,OAAO,CAAC,IAAI,CAAC;gBACX,OAAO,EAAE,QAAQ,MAAM,KAAK,QAAQ,EAAE;gBACtC,WAAW,EAAE,IAAI;gBACjB,cAAc,EAAE,QAAQ,CAAC,cAAoC;gBAC7D,OAAO,EAAG,QAAQ,CAAC,OAAmB,IAAI,IAAI;gBAC9C,YAAY,EAAE;oBACZ,OAAO,EAAE,MAAM;oBACf,KAAK,EAAE,QAAQ;oBACf,OAAO,EAAE,QAAQ,CAAC,OAAO;oBACzB,cAAc,EAAE,QAAQ,CAAC,cAAc;oBACvC,eAAe,EAAE,QAAQ,CAAC,eAAe;oBACzC,kBAAkB,EAAE,QAAQ,CAAC,kBAAkB;oBAC/C,IAAI,EAAE,QAAQ,CAAC,IAAI;oBACnB,cAAc,EAAE,QAAQ,CAAC,cAAc;oBACvC,OAAO,EAAE,QAAQ,CAAC,OAAO;oBACzB,cAAc,EAAE,QAAQ,CAAC,cAAc;oBACvC,qBAAqB,EAAE,QAAQ,CAAC,qBAAqB;iBACtD;gBACD,OAAO,EAAE,MAAM;gBACf,IAAI,EAAE,QAAQ,CAAC,IAA0B;gBACzC,cAAc,EAAE,QAAQ,CAAC,cAAoC;gBAC7D,qBAAqB,EAAE,QAAQ;qBAC5B,qBAA6C;aACjD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,2CAA2C;IAC7C,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8EAA8E;AAC9E,YAAY;AACZ,8EAA8E;AAE9E,MAAM,OAAO,SAAS;IACH,SAAS,CAAS;IACnC,oFAAoF;IACnE,eAAe,CAAS;IACzC,oEAAoE;IAC5D,SAAS,GAAG,CAAC,CAAC;IAEtB,YACE,SAAS,GAAG,gCAAgC,EAC5C,eAAe,GAAG,kCAAkC;QAEpD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;IACzC,CAAC;IAED;0EACsE;IACtE,QAAQ,CAAI,EAAW;QACrB,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC;gBACH,OAAO,EAAE,EAAE,CAAC;YACd,CAAC;oBAAS,CAAC;gBACT,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,CACvD,SAAS,EACT,OAAO,CACR,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,IAAI,CAAC;gBACH,SAAS,CAAC,QAAQ,CAAC,CAAC;gBACpB,MAAM;YACR,CAAC;YAAC,MAAM,CAAC;gBACP,IAAI,CAAC,KAAK,EAAE;oBAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;YACtD,CAAC;YACD,iBAAiB;YACjB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,GAAG,EAAE,EAAE,CAAC;gBAC/B,UAAU;YACZ,CAAC;QACH,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC;YACH,OAAO,EAAE,EAAE,CAAC;QACd,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;YACnB,IAAI,CAAC;gBACH,MAAM,CAAC,QAAQ,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YACxC,CAAC;YAAC,MAAM,CAAC;gBACP,wDAAwD;YAC1D,CAAC;QACH,CAAC;IACH,CAAC;IAED,yEAAyE;IAEzE,SAAS;QACP,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAClD,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC5C,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACzB,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QACzB,CAAC;IACH,CAAC;IAED,UAAU,CAAC,IAA6B;QACtC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE;YACjB,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAClD,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAClD,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;IACL,CAAC;IAED,yEAAyE;IAEzE,YAAY,CAAC,IAIZ;QACC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAI,KAAK,CAAC,OAAwB,IAAI,EAAE,CAAC;QAEtD,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;YAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;YAE3C,uBAAuB;YACvB,IAAI,IAAI,EAAE,YAAY,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;gBACxD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,iDAAiD;YACjD,IAAI,CAAC,IAAI,EAAE,YAAY,IAAI,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;gBACxD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,gBAAgB;YAChB,IAAI,IAAI,EAAE,MAAM,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBACpD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,0CAA0C;YAC1C,IACE,IAAI,EAAE,aAAa;gBACnB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,EACpC,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;YAED,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAED,WAAW,CAAC,KAAiB;QAC3B,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE;YACjB,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,MAAM,OAAO,GAAI,KAAK,CAAC,OAAwB,IAAI,EAAE,CAAC;YACtD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC;YACxB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC;IAED,aAAa,CAAC,OAAqB;QACjC,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE;YACxB,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAI,KAAK,CAAC,OAAwB,IAAI,EAAE,CAAC;YACvD,KAAK,CAAC,OAAO,GAAG,CAAC,GAAG,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC;YAC1C,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YACvB,OAAO,OAAO,CAAC,MAAM,CAAC;QACxB,CAAC,CAAC,CAAC;IACL,CAAC;IAED,yEAAyE;IAEzE,cAAc,CACZ,MAAc,EACd,QAAgB,EAChB,OAAe,EACf,QAAiC;QAEjC,OAAO,cAAc,CAAC,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC7E,CAAC;IAED,aAAa,CAAC,MAAc,EAAE,QAAgB;QAC5C,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,EAAE,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/D,OAAO,MAAM,EAAE,WAAW,IAAI,IAAI,CAAC;IACrC,CAAC;IAED,aAAa,CAAC,MAAc;QAC1B,OAAO,aAAa,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/C,CAAC;CACF"}

package/dist/builder.d.ts

@@ -1,12 +0,0 @@
-/** LoopForge Agent — Technique router.
- *
- * Pure-function technique selection via keyword heuristic with tier gating.
- * Tier 1 (zero-shot / few-shot / CoT): always available.
- * Tier 2 (step-back / least-to-most / ToT): checkpoint boundaries or
- * after consecutive failures only.
- */
-import { type Analysis } from "./protocol.js";
-export declare const TECHNIQUE_REFERENCE: Record<string, string>;
-export declare function routeTechnique(task: string): Analysis;
-export declare function routeTechniqueAdaptive(task: string, vaultContext?: Record<string, unknown> | null, loopId?: string, isCheckpoint?: boolean): Analysis;
-//# sourceMappingURL=builder.d.ts.map

package/dist/builder.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"builder.d.ts","sourceRoot":"","sources":["../src/builder.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,EAGL,KAAK,QAAQ,EACd,MAAM,eAAe,CAAC;AA+BvB,eAAO,MAAM,mBAAmB,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAQtD,CAAC;AAgCF,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,CAmCrD;AAsHD,wBAAgB,sBAAsB,CACpC,IAAI,EAAE,MAAM,EACZ,YAAY,GAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAW,EACnD,MAAM,SAAK,EACX,YAAY,UAAQ,GACnB,QAAQ,CA+DV"}

package/dist/builder.js

@@ -1,259 +0,0 @@
-/** LoopForge Agent — Technique router.
- *
- * Pure-function technique selection via keyword heuristic with tier gating.
- * Tier 1 (zero-shot / few-shot / CoT): always available.
- * Tier 2 (step-back / least-to-most / ToT): checkpoint boundaries or
- * after consecutive failures only.
- */
-import { getPolicy } from "./policy.js";
-import { logEvent } from "./observability.js";
-import { makeAnalysis, Technique, } from "./protocol.js";
-// ═══════════════════════════════════════════════════════════════════════════
-// Routing table
-// ═══════════════════════════════════════════════════════════════════════════
-const ROUTING_TABLE = {
-    continuous_low: Technique.ZERO_SHOT,
-    independent_low: Technique.ZERO_SHOT,
-    continuous_medium: Technique.FEW_SHOT,
-    independent_medium: Technique.ZERO_SHOT_COT,
-    continuous_high: Technique.FEW_SHOT_COT,
-    independent_high: Technique.TREE_OF_THOUGHT,
-};
-const RATIONALE = {
-    [Technique.ZERO_SHOT]: "Low load — direct instruction suffices.",
-    [Technique.FEW_SHOT]: "Fixed I/O pattern expected — examples anchor output format.",
-    [Technique.ZERO_SHOT_COT]: "Multi-step reasoning needed, no examples provided.",
-    [Technique.FEW_SHOT_COT]: "Complex reasoning with provided examples — relay pattern.",
-    [Technique.STEP_BACK]: "Vague or legacy — abstract to principles first.",
-    [Technique.LEAST_TO_MOST]: "Decomposable into ordered subproblems.",
-    [Technique.TREE_OF_THOUGHT]: "High risk, multi-path — explore + evaluate + prune.",
-};
-export const TECHNIQUE_REFERENCE = {
-    "zero-shot": "loopforge/skills/prompt-techniques/references/zero-shot.md",
-    "few-shot": "loopforge/skills/prompt-techniques/references/few-shot.md",
-    "zero-shot-cot": "loopforge/skills/prompt-techniques/references/chain-of-thought.md",
-    "few-shot-cot": "loopforge/skills/prompt-techniques/references/chain-of-thought.md",
-    "step-back": "loopforge/skills/prompt-techniques/references/step-back.md",
-    "least-to-most": "loopforge/skills/prompt-techniques/references/least-to-most.md",
-    "tree-of-thought": "loopforge/skills/prompt-techniques/references/tree-of-thought.md",
-};
-// Keyword sets for heuristic classification
-const HIGH_LOAD_WORDS = new Set([
-    "security", "audit", "crypto", "encrypt", "concurrent",
-    "thread", "transaction", "rollback", "compile", "protocol",
-    "安全", "审计", "加密", "并发", "签名", "校验", "默克尔",
-    "assembly", "重放攻击", "共识", "虚拟机", "字节码",
-]);
-const LOW_LOAD_WORDS = new Set([
-    "rename", "format", "comment", "config", "readme", "simple", "basic",
-]);
-const CONTINUOUS_WORDS = new Set([
-    "fix", "modify", "update", "change", "refactor", "extend",
-    "add", "improve", "debug",
-]);
-// v1.1: Keywords that trigger specialist techniques (override routing table)
-const STEP_BACK_WORDS = new Set([
-    "重构", "排查", "legacy", "原则", "抽象", "根本原因", "root cause",
-    "报错", "逻辑混乱", "含糊", "vague", "审计方法", "底层",
-]);
-const LEAST_TO_MOST_WORDS = new Set([
-    "逐步", "搭建", "实现系统", "build system", "pipeline", "编译器",
-    "逐步求解", "有序", "从简单到复杂", "数据采集", "完整模块",
-    "多步骤", "部署流程", "子问题",
-]);
-// ═══════════════════════════════════════════════════════════════════════════
-// Keyword heuristic router
-// ═══════════════════════════════════════════════════════════════════════════
-export function routeTechnique(task) {
-    const taskLower = task.toLowerCase();
-    // Independence — check if any continuous word appears in task
-    const continuous = [...CONTINUOUS_WORDS].some((w) => taskLower.includes(w));
-    const independence = continuous ? "continuous" : "independent";
-    // Cognitive load — check keyword presence
-    let load;
-    if ([...HIGH_LOAD_WORDS].some((w) => taskLower.includes(w))) {
-        load = "high";
-    }
-    else if ([...LOW_LOAD_WORDS].some((w) => taskLower.includes(w))) {
-        load = "low";
-    }
-    else {
-        load = task.split(/\s+/).length > 8 ? "medium" : "low";
-    }
-    let technique = ROUTING_TABLE[`${independence}_${load}`] ?? Technique.ZERO_SHOT;
-    // v1.1: Keyword overrides for specialist techniques
-    if ([...STEP_BACK_WORDS].some((w) => taskLower.includes(w))) {
-        technique = Technique.STEP_BACK;
-        load = "high";
-    }
-    else if ([...LEAST_TO_MOST_WORDS].some((w) => taskLower.includes(w))) {
-        technique = Technique.LEAST_TO_MOST;
-        load = "high";
-    }
-    return makeAnalysis({
-        technique: technique,
-        rationale: RATIONALE[technique] ?? "Default route.",
-        independence,
-        cognitive_load: load,
-        reference_file: TECHNIQUE_REFERENCE[technique] ?? "",
-    });
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Tier definitions
-// ═══════════════════════════════════════════════════════════════════════════
-const TIER_1_TECHNIQUES = new Set([
-    Technique.ZERO_SHOT,
-    Technique.FEW_SHOT,
-    Technique.ZERO_SHOT_COT,
-    Technique.FEW_SHOT_COT,
-]);
-const TIER_2_TECHNIQUES = new Set([
-    Technique.STEP_BACK,
-    Technique.LEAST_TO_MOST,
-    Technique.TREE_OF_THOUGHT,
-]);
-function isTier2Technique(t) {
-    return TIER_2_TECHNIQUES.has(t);
-}
-// Downgrade map: Tier 2 → nearest Tier 1 equivalent
-const DOWNGRADE_TIER2_TO_TIER1 = {
-    [Technique.STEP_BACK]: Technique.FEW_SHOT_COT,
-    [Technique.LEAST_TO_MOST]: Technique.ZERO_SHOT_COT,
-    [Technique.TREE_OF_THOUGHT]: Technique.FEW_SHOT_COT,
-};
-function downgradeToTier1(technique) {
-    return DOWNGRADE_TIER2_TO_TIER1[technique] ?? Technique.FEW_SHOT;
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Consecutive failure detection
-// ═══════════════════════════════════════════════════════════════════════════
-function countConsecutiveFailures(loopId, vaultContext) {
-    if (vaultContext === null)
-        return 0;
-    const results = vaultContext.results || [];
-    if (!results.length)
-        return 0;
-    // Collect rounds with success field from feedback entries
-    const rounds = [];
-    for (const r of results) {
-        const lineage = (r.loop_lineage || r.lineage || {});
-        if (lineage.loop_id !== loopId)
-            continue;
-        const success = r.success !== undefined
-            ? r.success
-            : lineage.success;
-        if (success === undefined)
-            continue; // lineage entries without merged feedback — skip
-        rounds.push({
-            round: lineage.round ?? 0,
-            success,
-        });
-    }
-    rounds.sort((a, b) => b.round - a.round);
-    let count = 0;
-    for (const rnd of rounds) {
-        if (rnd.success === false) {
-            count++;
-        }
-        else {
-            break;
-        }
-    }
-    return count;
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Keyword routing restricted to a subset of techniques
-// ═══════════════════════════════════════════════════════════════════════════
-function keywordRouteRestricted(task, allowedTechniques) {
-    // Run full keyword routing first
-    const full = routeTechnique(task);
-    const technique = full.technique;
-    // If the keyword result is already in the allowed set, use it
-    if (allowedTechniques.includes(technique))
-        return full;
-    // If it's Tier 2 downgraded to Tier 1, map to the nearest Tier 1
-    if (isTier2Technique(technique)) {
-        const downgraded = downgradeToTier1(technique);
-        if (allowedTechniques.includes(downgraded)) {
-            return makeAnalysis({
-                technique: downgraded,
-                rationale: `${full.rationale} [DOWNGRADED: ${technique} → ${downgraded} — Tier 2 not available this round]`,
-                independence: full.independence,
-                cognitive_load: full.cognitive_load,
-                reference_file: TECHNIQUE_REFERENCE[downgraded] ?? full.reference_file,
-            });
-        }
-    }
-    // Fallback: pick the first technique in the allowed set
-    const fallback = allowedTechniques[0];
-    return makeAnalysis({
-        technique: fallback,
-        rationale: `${RATIONALE[fallback] ?? "Tier-restricted route."} [RESTRICTED: keyword ${technique} not in allowed set [${allowedTechniques.join(", ")}]]`,
-        independence: full.independence,
-        cognitive_load: full.cognitive_load,
-        reference_file: TECHNIQUE_REFERENCE[fallback] ?? "",
-    });
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Tier-gated technique router (v4.0)
-// ═══════════════════════════════════════════════════════════════════════════
-export function routeTechniqueAdaptive(task, vaultContext = null, loopId = "", isCheckpoint = false) {
-    // Step 1: Full keyword routing over all 7 techniques
-    const keyword = routeTechnique(task);
-    const technique = keyword.technique;
-    // Step 2: Determine which tier is allowed this round
-    const policy = getPolicy();
-    const tier2Failures = policy.technique.tier2_escalation_failures ?? 3;
-    const consecutiveFailures = vaultContext && loopId
-        ? countConsecutiveFailures(loopId, vaultContext)
-        : 0;
-    let allowedTechniques;
-    let tierLabel;
-    if (isCheckpoint) {
-        // Checkpoint boundary: full access to all 7 techniques
-        allowedTechniques = [
-            Technique.ZERO_SHOT, Technique.FEW_SHOT,
-            Technique.ZERO_SHOT_COT, Technique.FEW_SHOT_COT,
-            Technique.STEP_BACK, Technique.LEAST_TO_MOST, Technique.TREE_OF_THOUGHT,
-        ];
-        tierLabel = "checkpoint";
-    }
-    else if (consecutiveFailures >= tier2Failures) {
-        // Escalation: Tier 2 only
-        allowedTechniques = [
-            Technique.STEP_BACK, Technique.LEAST_TO_MOST, Technique.TREE_OF_THOUGHT,
-        ];
-        tierLabel = `escalated (${consecutiveFailures} consecutive failures)`;
-        logEvent("tier2_escalation", {
-            loopId,
-            consecutiveFailures,
-            keywordTechnique: technique,
-        });
-    }
-    else {
-        // Normal: Tier 1 only
-        allowedTechniques = [
-            Technique.ZERO_SHOT, Technique.FEW_SHOT,
-            Technique.ZERO_SHOT_COT, Technique.FEW_SHOT_COT,
-        ];
-        tierLabel = "default";
-    }
-    // Step 3: Apply gate — if keyword result is in allowed set, use it
-    if (allowedTechniques.includes(technique)) {
-        if (tierLabel === "default")
-            return keyword; // Most common path — no overhead
-        const label = tierLabel === "checkpoint"
-            ? `${keyword.rationale} [CHECKPOINT: full technique access]`
-            : `${keyword.rationale} [ESCALATED: Tier 2 — ${consecutiveFailures} consecutive failures]`;
-        return makeAnalysis({
-            technique,
-            rationale: label,
-            independence: keyword.independence,
-            cognitive_load: keyword.cognitive_load,
-            reference_file: keyword.reference_file,
-        });
-    }
-    // Step 4: Keyword result outside allowed set — downgrade or restrict
-    return keywordRouteRestricted(task, allowedTechniques);
-}
-//# sourceMappingURL=builder.js.map