loopforge 1.15.1 → 2.0.0

package/dist/loop-compiler.js

@@ -1,2254 +1,351 @@
-/** LoopForge-loop_compile — Loop Compiler (v3.5 core).
+/** LoopForge cognitive-state compiler.
  *
- * Pure-function module for per-loop-iteration prompt compilation.
- *
- * Two layers:
- *   Layer 1 (Hard Gates): decideLevel() — 4-gate routing that CAN change compile level.
- *   Layer 2 (Soft Advisories): computeAdvisories() — warnings/alignment/health, NEVER
- *     change compile level directly.
- *
- * Compilation: compileL0() / compileL1() / compileL2() produce the actual prompt.
+ * The compiler evolves structured state and renders one prompt artifact.
+ * L0/L1/L2 control state density only; the external Agent owns reasoning.
  */
 import { createHash } from "node:crypto";
-import { readFileSync } from "node:fs";
 import { getPolicy } from "./policy.js";
 import { AgentStatus, makeCheckpointSummary, makeLoopCompileResponse, makeLoopHealth, makeLoopObjective, makeRollingSummary, makeTaskAlignment, } from "./protocol.js";
-import { routeTechniqueAdaptive, SKILLS_DIR } from "./builder.js";
-// ═══════════════════════════════════════════════════════════════════════════
-// Repair cue detection
-// ═══════════════════════════════════════════════════════════════════════════
-const REPAIR_CUES = [
-    "fix", "repair", "revise", "correct", "polish", "bug", "error",
-    "修复", "修改", "修正", "纠错", "补充", "改一下",
-];
-function detectsRepairSignal(request) {
-    let text = (request.new_since_last_round || "").toLowerCase();
-    if (request.last_round_result) {
-        text += " " + (request.last_round_result.output_summary || "").toLowerCase();
-        if (request.last_round_result.manual_fixes_needed) {
-            text += " " + request.last_round_result.manual_fixes_needed.toLowerCase();
-        }
-    }
-    return REPAIR_CUES.some((cue) => text.includes(cue));
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Tokenization helpers
-// ═══════════════════════════════════════════════════════════════════════════
-export function tokenize(text) {
-    const tokens = text.split(/\s+/);
-    const result = new Set();
-    for (let token of tokens) {
-        token = token.trim().replace(/^[.,;:!?()[\]{}'"]+|[.,;:!?()[\]{}'"]+$/g, "");
-        if (token.length >= 2) {
-            result.add(/^[\x00-\x7F]*$/.test(token) ? token.toLowerCase() : token);
-        }
-        // Add individual CJK chars as standalone tokens
-        for (const ch of token) {
-            if ((ch >= "一" && ch <= "鿿") ||
-                (ch >= "぀" && ch <= "ヿ")) {
-                result.add(ch);
-            }
-        }
-    }
-    return result;
-}
-export function jaccard(a, b) {
-    if (a.size === 0 || b.size === 0)
-        return 0.0;
-    let intersection = 0;
-    for (const item of a) {
-        if (b.has(item))
-            intersection++;
-    }
-    const union = a.size + b.size - intersection;
-    return union > 0 ? intersection / union : 0.0;
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Delegation helpers (v1.9 — AgentTool mode lightweight utilities)
-// ═══════════════════════════════════════════════════════════════════════════
-/** Filter relevant constraints for a sub-agent task using Jaccard token similarity.
- *  Returns constraints whose token overlap with the subTask exceeds the threshold.
- *  Default threshold 0.15 is intentionally lower than the 0.3/0.5 alignment thresholds
- *  — constraint filtering should err on the side of inclusion. */
-export function filterConstraintsForSubTask(allConstraints, subTask, threshold = 0.15) {
-    if (!allConstraints.length || !subTask.trim())
-        return [];
-    const taskTokens = tokenize(subTask);
-    if (taskTokens.size === 0)
-        return [];
-    return allConstraints.filter((c) => {
-        const cTokens = tokenize(c);
-        return jaccard(taskTokens, cTokens) >= threshold;
-    });
-}
-/** Format a self-contained delegation prompt for a sub-agent.
- *  Produces a prompt that stands alone — no references to parent conversation,
- *  no "based on above", no "continue from previous". This matches the AgentTool
- *  contract: "Workers can't see your conversation." */
-export function formatDelegationPrompt(subTask, subAgentType, relevantConstraints, options) {
-    const lines = [];
-    // Header
-    lines.push("### Delegated Task");
-    lines.push("");
-    lines.push(subTask);
-    lines.push("");
-    // Context (optional — e.g. file paths, module names)
-    if (options?.context) {
-        lines.push("### Context");
-        lines.push("");
-        lines.push(options.context);
-        lines.push("");
-    }
-    // Constraints (only for types that need them — Explore is read-only)
-    if (relevantConstraints.length && subAgentType !== "explore") {
-        lines.push("### Relevant Constraints");
-        for (const c of relevantConstraints)
-            lines.push(`- ${c}`);
-        lines.push("");
-    }
-    // Output format (for Explore and Plan agents)
-    if (subAgentType === "explore") {
-        if (options?.outputFormat) {
-            lines.push("### Output Format");
-            lines.push("");
-            lines.push(options.outputFormat);
-            lines.push("");
-        }
-        else {
-            lines.push("### Output Format");
-            lines.push("");
-            lines.push("Report findings as a structured list with file paths and line numbers.");
-            lines.push("");
-        }
-    }
-    if (subAgentType === "plan") {
-        lines.push("### Instructions");
-        lines.push("");
-        lines.push("Design a concrete implementation plan. Output must include:");
-        lines.push("- Step-by-step approach");
-        lines.push("- Critical files for implementation (3-5 files with paths)");
-        lines.push("- Key design decisions and tradeoffs");
-        lines.push("");
-    }
-    if (subAgentType === "general-purpose") {
-        lines.push("### Instructions");
-        lines.push("");
-        lines.push("Complete the task fully — don't gold-plate, but don't leave it half-done.");
-        lines.push("Report what was done, what files were changed, and any issues encountered.");
-        lines.push("");
-    }
-    if (!["explore", "general-purpose", "plan"].includes(subAgentType)) {
-        // Custom sub-agent type — generic template
-        lines.push("### Instructions");
-        lines.push("");
-        lines.push("Complete the task above and report results concisely.");
-        lines.push("");
-    }
-    return lines.join("\n");
-}
-/** Build a delegation history summary from vault context (v1.9 — multi-agent).
- *  Scans vault for delegation_journal entries and formats them as a table.
- *  Returns empty string if no delegation history exists. */
-export function buildDelegationSummary(vaultContext) {
-    if (!vaultContext)
-        return "";
-    const results = vaultContext.results;
-    if (!results?.length)
-        return "";
-    const delegations = results.filter((r) => r?.task_type === "delegation_journal");
-    if (!delegations.length)
-        return "";
-    // Helper: escape pipe characters so they don't break the markdown table
-    const esc = (s) => s.replace(/\|/g, "\\|");
-    // Collect all delegation entries across rounds
-    const entries = [];
-    for (const d of delegations) {
-        const lineage = d.loop_lineage;
-        const round = typeof lineage?.round === "number" ? lineage.round : 0;
-        const dels = lineage?.delegations;
-        if (!dels?.length)
-            continue;
-        for (const e of dels) {
-            entries.push({
-                round,
-                agentId: typeof e.agentId === "string" ? e.agentId : (typeof e.index === "number" ? `worker-${e.index}` : "?"),
-                type: typeof e.subAgentType === "string" ? e.subAgentType : "?",
-                task: typeof e.subTask === "string" ? e.subTask : "?",
-                result: typeof e.resultSummary === "string" ? e.resultSummary : "?",
-                success: typeof e.success === "boolean" ? e.success : true,
-            });
-        }
-    }
-    if (!entries.length)
-        return "";
-    const lines = [
-        "",
-        "### Delegation History (Multi-Agent)",
-        "",
-        "| Round | Agent | Type | Task | Result | ✓/✗ |",
-        "|-------|-------|------|------|--------|-----|",
-    ];
-    for (const e of entries) {
-        const status = e.success ? "✓" : "✗";
-        const shortAgent = e.agentId.length > 24 ? e.agentId.slice(0, 21) + "..." : e.agentId;
-        const shortTask = e.task.length > 50 ? e.task.slice(0, 47) + "..." : e.task;
-        const shortResult = e.result.length > 40 ? e.result.slice(0, 37) + "..." : e.result;
-        lines.push(`| R${e.round} | ${esc(shortAgent)} | ${e.type} | ${esc(shortTask)} | ${esc(shortResult)} | ${status} |`);
-    }
-    lines.push("");
-    return lines.join("\n");
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Goal identity
-// ═══════════════════════════════════════════════════════════════════════════
-export function computeGoalTextHash(task) {
-    const normalized = (task || "").trim().toLowerCase().replace(/\s+/g, " ");
-    return createHash("sha256").update(normalized, "utf-8").digest("hex").slice(0, 12);
-}
-export function deriveGoalId(loopId, task, explicitGoalId = "") {
-    if (explicitGoalId)
-        return explicitGoalId;
-    let taskPrefix = (task || "unnamed").slice(0, 60).trim().toLowerCase();
-    taskPrefix = taskPrefix.replace(/\s+/g, "-").replace(/[^a-z0-9-]/g, "");
-    return loopId ? `${loopId}:${taskPrefix}` : taskPrefix;
-}
-export function getPreviousRound(loopId, roundNum, vaultContext) {
-    if (vaultContext === null)
-        return null;
-    const results = vaultContext.results || [];
-    if (!results.length)
-        return null;
-    for (const r of results) {
-        const lineage = (r.loop_lineage || r.lineage || {});
-        if (lineage.loop_id === loopId && lineage.round === roundNum) {
-            return {
-                goal_id: lineage.goal_id ?? "",
-                goal_text_hash: lineage.goal_text_hash ?? "",
-                success: r.success ?? lineage.success ?? true,
-                task: r.task ?? r.user_intent ?? "",
-                constraints_active: lineage.constraints_active ?? [],
-                prompt_text: r.full_prompt ?? "",
-            };
-        }
-    }
-    return null;
-}
-function getRecentRounds(loopId, n, vaultContext) {
-    if (vaultContext === null)
+import { createCanonicalLoopState, renderCanonicalStateMarkdown, } from "./canonical-state.js";
+import { assemblePromptArtifact } from "./prompt-assembler.js";
+import { decidePromptLevel, } from "./prompt-policy.js";
+function unique(values) {
+    return [...new Set(values
+            .filter((value) => typeof value === "string")
+            .map((value) => value.trim())
+            .filter(Boolean))];
+}
+function contextEntries(context) {
+    if (!context || !Array.isArray(context.results))
         return [];
-    const results = vaultContext.results || [];
-    const rounds = [];
-    for (const r of results) {
-        const lineage = (r.loop_lineage || r.lineage || {});
-        if (lineage.loop_id === loopId) {
-            rounds.push({
-                success: r.success ?? lineage.success ?? false,
-                round: lineage.round ?? 0,
-                goal_text_hash: lineage.goal_text_hash ?? "",
-            });
-        }
-    }
-    rounds.sort((a, b) => b.round - a.round);
-    return rounds.slice(0, n);
-}
-/** Extract the technique used in the most recent round before currentRound.
- *  Scans vault entries for this loop_id and returns the technique_used field
- *  from the highest round number below currentRound.
- *  Returns null if no prior rounds exist (round 1 scenario). */
-function getPreviousTechnique(loopId, currentRound, vaultContext) {
-    if (vaultContext === null || currentRound <= 1)
-        return null;
-    const results = vaultContext.results || [];
-    if (!results.length)
-        return null;
-    let bestTechnique = null;
-    let bestRound = -1;
-    for (const r of results) {
-        const lineage = (r.loop_lineage || r.lineage || {});
-        if (lineage.loop_id !== loopId)
-            continue;
-        const rnd = lineage.round;
-        if (rnd >= currentRound || rnd <= bestRound)
-            continue;
-        // technique_used can be on the entry directly or in lineage
-        const technique = r.technique_used ??
-            lineage.technique_used ?? "";
-        if (technique) {
-            bestTechnique = technique;
-            bestRound = rnd;
-        }
-    }
-    return bestTechnique;
-}
-function techniqueChanged(loopId, newTechnique, currentRound, vaultContext) {
-    if (currentRound === 1)
-        return true; // Round 1: first selection is always a "change"
-    const prevTech = getPreviousTechnique(loopId, currentRound, vaultContext);
-    if (!prevTech)
-        return true; // No prior technique found → treat as change
-    return newTechnique !== prevTech;
-}
-/** Returns the mandatory state file read instruction that goes at the top
- *  of every compiled prompt. Tells the agent to read the loop state file
- *  before executing the round. */
-function renderStateFilePointer(loopId) {
-    return [
-        `⚠️ **BEFORE anything else**: Read \`.loopforge/state/${loopId}-state.md\``,
-        "for accumulated loop state — objective, constraints, progress, and cross-round summary.",
-        "This file is rewritten each round and is the single source of truth for loop state.",
-        "",
-    ].join("\n");
-}
-/** Render the full loop state file as markdown. Called by compileL2() every round.
- *  The file is a snapshot — rewritten in full each round, not appended.
- *  All sections have hard size caps from policy to prevent bloat.
- *
- *  Sections: Loop Objective, Progress, Cross-Round Summary, Active Constraints,
- *  Checkpoints, Delegation Summary. */
-function renderStateFile(params) {
-    const lines = [];
-    const sfPolicy = getPolicy().state_file;
-    // ── Header ──
-    lines.push(`# LoopForge State — ${params.loopId}`);
-    lines.push("");
-    lines.push(`**Round**: ${params.currentRound}/${params.maxRounds}`);
-    lines.push("");
-    // ── Loop Objective ──
-    if (params.loopObjective) {
-        const lo = params.loopObjective;
-        lines.push("## Loop Objective");
-        if (lo.version && lo.version > 1) {
-            lines.push(`> Version ${lo.version}, created at Round ${lo.created_at_round}`);
-        }
-        lines.push("");
-        lines.push(`**Objective**: ${lo.objective}`);
-        lines.push("");
-        if (lo.success_criteria.length) {
-            lines.push("### Success Criteria");
-            for (const sc of lo.success_criteria) {
-                // Check if this criterion has been met (from execution_evidence)
-                lines.push(`- ${sc}`);
-            }
-            lines.push("");
-        }
-        if (lo.hard_constraints.length) {
-            lines.push("### Hard Constraints");
-            for (const hc of lo.hard_constraints) {
-                lines.push(`- ${hc}`);
-            }
-            lines.push("");
-        }
-    }
-    // ── Progress Dashboard ──
-    if (params.progressDashboard) {
-        lines.push(params.progressDashboard);
-        lines.push("");
-    }
-    // ── Cross-Round Summary ──
-    if (params.rollingSummary && params.rollingSummary.rounds_sampled > 0) {
-        const rs = params.rollingSummary;
-        const maxRounds = sfPolicy.max_summary_rounds;
-        lines.push(`## Cross-Round Summary (Last ${Math.min(rs.rounds_sampled, maxRounds)} Rounds)`);
-        lines.push("");
-        if (rs.key_outcomes.length) {
-            lines.push("**Key Outcomes**:");
-            for (const ko of rs.key_outcomes.slice(0, maxRounds)) {
-                lines.push(`- ${ko}`);
-            }
-            lines.push("");
-        }
-        if (rs.recurring_issues.length) {
-            lines.push("**Recurring Issues**:");
-            for (const ri of rs.recurring_issues) {
-                lines.push(`- ⚠️ ${ri}`);
-            }
-            lines.push("");
-        }
-        if (rs.failed_patterns && rs.failed_patterns.length) {
-            lines.push("**Failure Patterns**:");
-            for (const fp of rs.failed_patterns) {
-                lines.push(`- 🚫 ${fp}`);
-            }
-            lines.push("");
-        }
-    }
-    // ── Active Constraints ──
-    lines.push("## Active Constraints");
-    lines.push("");
-    if (params.constraints.length) {
-        for (const c of params.constraints) {
-            lines.push(`- ${c}`);
-        }
-    }
-    else {
-        lines.push("_(none)_");
-    }
-    lines.push("");
-    if (params.retiredConstraints.length) {
-        lines.push("## Retired Constraints");
-        lines.push("");
-        for (const c of params.retiredConstraints.slice(0, 10)) {
-            lines.push(`- ~${c}~`);
-        }
-        lines.push("");
-    }
-    // ── Checkpoints ──
-    if (params.checkpoints.length) {
-        const maxCp = sfPolicy.max_checkpoints;
-        const shown = params.checkpoints.slice(-maxCp).reverse(); // newest first
-        lines.push(`## Checkpoints (${shown.length})`);
-        lines.push("");
-        for (const cp of shown) {
-            lines.push(`### ${cp.label || `Round ${cp.declared_at_round}`}`);
-            lines.push(`> Declared at Round ${cp.declared_at_round}`);
-            lines.push("");
-            if (cp.outcome) {
-                lines.push(`**Outcome**: ${cp.outcome}`);
-                lines.push("");
-            }
-            if (cp.carried_constraints.length) {
-                lines.push("**Carried Constraints**:");
-                for (const cc of cp.carried_constraints) {
-                    lines.push(`- ${cc}`);
-                }
-                lines.push("");
-            }
-            if (cp.resolved_constraints.length) {
-                lines.push("**Resolved Constraints**:");
-                for (const rc of cp.resolved_constraints) {
-                    lines.push(`- ✅ ${rc}`);
-                }
-                lines.push("");
-            }
-        }
-    }
-    // ── Delegation Summary ──
-    if (params.delegationSummary) {
-        lines.push(params.delegationSummary);
-    }
-    // ── External Context (current round only) ──
-    if (params.externalContext) {
-        lines.push("---");
-        lines.push("");
-        lines.push("## External Context (This Round)");
-        lines.push("");
-        lines.push(params.externalContext);
-        lines.push("");
-    }
-    return lines.join("\n");
-}
-function getPreviousRoundTask(loopId, roundNum, vaultContext) {
-    const prev = getPreviousRound(loopId, roundNum, vaultContext);
-    return prev?.task ?? "";
-}
-function vaultGetLoopObjective(loopId, vaultContext) {
-    if (vaultContext === null)
+    return context.results.filter((value) => value !== null && typeof value === "object" && !Array.isArray(value));
+}
+function lineage(entry) {
+    const value = entry.loop_lineage ?? entry.lineage;
+    return value !== null && typeof value === "object" && !Array.isArray(value)
+        ? value
+        : {};
+}
+function entryRound(entry) {
+    const value = lineage(entry).round;
+    return typeof value === "number" ? value : 0;
+}
+function loopEntries(loopId, context) {
+    return contextEntries(context)
+        .filter((entry) => entry.loop_id === loopId || lineage(entry).loop_id === loopId)
+        .sort((a, b) => entryRound(a) - entryRound(b));
+}
+export function computeGoalTextHash(text) {
+    const normalized = text.trim().replace(/\s+/g, " ").toLowerCase();
+    return createHash("sha256").update(normalized).digest("hex").slice(0, 12);
+}
+export function deriveGoalId(loopId, task, explicit = "") {
+    return explicit.trim() || `${loopId}:${task.trim().toLowerCase()
+        .replace(/[^a-z0-9\u4e00-\u9fff]+/g, "-")
+        .replace(/^-|-$/g, "")
+        .slice(0, 48) || computeGoalTextHash(task)}`;
+}
+export function getPreviousRound(loopId, round, context) {
+    const entry = [...loopEntries(loopId, context)].reverse()
+        .find((candidate) => entryRound(candidate) === round);
+    if (!entry)
         return null;
-    // Check global entries first
-    const globalEntries = vaultContext.global_entries || [];
-    for (const entry of globalEntries) {
-        const lo = entry.loop_objective;
-        if (lo && entry.loop_id === loopId) {
-            return { loop_objective: lo, loop_id: loopId };
-        }
-    }
-    // Check results
-    const results = vaultContext.results || [];
-    for (const r of results) {
-        const lo = r.loop_objective;
-        if (lo && r.loop_id === loopId) {
-            return { loop_objective: lo, loop_id: loopId };
-        }
-    }
-    return null;
-}
-function countConsecutiveHashMismatches(loopId, vaultContext) {
-    if (vaultContext === null)
-        return 0;
-    const rounds = getRecentRounds(loopId, 20, vaultContext);
-    if (rounds.length < 2)
-        return 0;
-    let count = 0;
-    for (let i = 0; i < rounds.length - 1; i++) {
-        const currHash = rounds[i].goal_text_hash;
-        const prevHash = rounds[i + 1].goal_text_hash;
-        if (currHash && prevHash && currHash !== prevHash) {
-            count++;
-        }
-        else {
-            break;
-        }
-    }
-    return count;
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Strategy collapse detection
-// ═══════════════════════════════════════════════════════════════════════════
-// Constraint Retirement (v3.5)
-// ═══════════════════════════════════════════════════════════════════════════
-function computeConstraintRetirement(activeConstraints, loopId, currentRound, vaultContext) {
-    if (!activeConstraints.length || vaultContext === null) {
-        return { active: [...activeConstraints], retired: [] };
-    }
-    const results = vaultContext.results || [];
-    if (!results.length) {
-        return { active: [...activeConstraints], retired: [] };
-    }
-    const policy = getPolicy();
-    const window = policy.constraints.retire_window;
-    const targetRounds = new Set();
-    for (let r = currentRound - window; r < currentRound; r++) {
-        targetRounds.add(r);
-    }
-    // Collect all text per target round for activity detection
-    const roundTexts = new Map();
-    for (const r of results) {
-        const lineage = (r.loop_lineage || r.lineage || {});
-        if (lineage.loop_id !== loopId)
-            continue;
-        const rnd = lineage.round;
-        if (!targetRounds.has(rnd))
-            continue;
-        let text = ((r.task ?? r.user_intent ?? "") + " " +
-            (lineage.task ?? "") + " " +
-            (r.output_summary ?? "")).toLowerCase();
-        for (const v of r.constraint_violations || []) {
-            text += " " + String(v).toLowerCase();
-        }
-        roundTexts.set(rnd, text);
-    }
-    const retired = [];
-    const pruned = [];
-    for (const constraint of activeConstraints) {
-        const cLower = constraint.toLowerCase();
-        const cNormalized = cLower.replace(/-/g, " ");
-        let isActive = false;
-        for (const text of roundTexts.values()) {
-            if (text.includes(cLower) || text.includes(cNormalized)) {
-                isActive = true;
-                break;
-            }
-        }
-        if (isActive || roundTexts.size < window) {
-            pruned.push(constraint);
-        }
-        else {
-            retired.push(constraint);
-        }
-    }
-    return { active: pruned, retired };
+    const data = lineage(entry);
+    return {
+        round,
+        goal_id: typeof data.goal_id === "string" ? data.goal_id : "",
+        goal_text_hash: typeof data.goal_text_hash === "string" ? data.goal_text_hash : "",
+        success: typeof entry.success === "boolean"
+            ? entry.success
+            : typeof data.success === "boolean" ? data.success : false,
+        task: typeof data.task === "string"
+            ? data.task
+            : typeof entry.task === "string" ? entry.task : "",
+        constraints_active: Array.isArray(data.constraints_active)
+            ? data.constraints_active.filter((value) => typeof value === "string")
+            : [],
+        output_summary: typeof entry.output_summary === "string"
+            ? entry.output_summary
+            : typeof data.output_summary === "string" ? data.output_summary : "",
+    };
 }
-// ═══════════════════════════════════════════════════════════════════════════
-// P4: Progress evidence helpers
-// ═══════════════════════════════════════════════════════════════════════════
-/** Extract execution evidence from a previous round in the vault.
- *  Used for progress gradient calculation and trend detection. */
-function getPreviousRoundEvidence(loopId, roundNum, vaultContext) {
-    if (vaultContext === null)
-        return null;
-    const results = vaultContext.results || [];
-    for (const r of results) {
-        const lineage = (r.loop_lineage || r.lineage || {});
-        if (lineage.loop_id !== loopId)
-            continue;
-        if (lineage.round !== roundNum)
+function latestObjective(loopId, context) {
+    const candidates = loopEntries(loopId, context).reverse();
+    for (const entry of candidates) {
+        const raw = entry.loop_objective;
+        if (!raw || typeof raw !== "object" || Array.isArray(raw))
             continue;
-        const evidence = (r.execution_evidence ?? lineage.execution_evidence);
-        if (evidence) {
-            return {
-                progress_estimate: evidence.progress_estimate ?? 0,
-                success_criteria_met: evidence.success_criteria_met ?? [],
-            };
-        }
-        return null;
+        const value = raw;
+        return makeLoopObjective({
+            objective: typeof value.objective === "string" ? value.objective : "",
+            success_criteria: Array.isArray(value.success_criteria)
+                ? value.success_criteria.filter((item) => typeof item === "string")
+                : [],
+            hard_constraints: Array.isArray(value.hard_constraints)
+                ? value.hard_constraints.filter((item) => typeof item === "string")
+                : [],
+            created_at_round: typeof value.created_at_round === "number" ? value.created_at_round : 1,
+            loop_id: loopId,
+            version: typeof value.version === "number" ? value.version : 1,
+            refinement_history: Array.isArray(value.refinement_history)
+                ? value.refinement_history.filter((item) => typeof item === "string")
+                : [],
+        });
     }
     return null;
 }
-/** Count consecutive rounds (including current) where progress delta
- *  has been below the stall threshold. */
-function countProgressStallRounds(loopId, currentRound, vaultContext, threshold) {
-    if (vaultContext === null || currentRound < 2)
-        return 0;
-    let count = 0;
-    for (let r = currentRound; r >= 2; r--) {
-        const curr = getPreviousRoundEvidence(loopId, r, vaultContext);
-        const prev = getPreviousRoundEvidence(loopId, r - 1, vaultContext);
-        if (curr && prev) {
-            const delta = curr.progress_estimate - prev.progress_estimate;
-            if (delta < threshold && curr.progress_estimate < 0.95) {
-                count++;
-            }
-            else {
-                break;
-            }
-        }
-        else {
-            break;
-        }
-    }
-    return count;
-}
-/** Detect repeated failure patterns in sampled rounds.
- *  A failure pattern = 2+ consecutive rounds where:
- *    1. success === false (failed)
- *    2. same technique was used
- *    3. task text is similar (Jaccard > 0.4)
- *
- *  Returns human-readable descriptions for injection into the prompt. */
-function detectFailurePatterns(sampled) {
-    if (sampled.length < 2)
-        return [];
-    const patterns = [];
-    let runStart = -1;
-    for (let i = 0; i < sampled.length; i++) {
-        const r = sampled[i];
-        const isFailed = r.success === false;
-        if (isFailed && runStart === -1) {
-            runStart = i;
-        }
-        else if (!isFailed && runStart !== -1) {
-            if (i - runStart >= 2) {
-                const pattern = classifyRun(sampled.slice(runStart, i));
-                if (pattern)
-                    patterns.push(pattern);
-            }
-            runStart = -1;
-        }
-    }
-    // Handle run at end of array
-    if (runStart !== -1 && sampled.length - runStart >= 2) {
-        const pattern = classifyRun(sampled.slice(runStart));
-        if (pattern)
-            patterns.push(pattern);
-    }
-    return patterns;
-}
-/** Classify a run of consecutive failed rounds as a failure pattern.
- *  Returns null if the rounds are too dissimilar to be the same pattern. */
-function classifyRun(run) {
-    if (run.length < 2)
-        return null;
-    // Must all use the same technique
-    const technique = run[0].technique_used || "unknown";
-    if (!run.every((r) => (r.technique_used || "unknown") === technique)) {
-        return null;
-    }
-    // Task text must be similar across the run (pairwise Jaccard)
-    const tokensList = run.map((r) => tokenize(r.task.toLowerCase()));
-    for (let i = 0; i < tokensList.length - 1; i++) {
-        for (let j = i + 1; j < tokensList.length; j++) {
-            if (jaccard(tokensList[i], tokensList[j]) < 0.4)
-                return null;
-        }
-    }
-    const rounds = `R${run[0].round}-R${run[run.length - 1].round}`;
-    const taskPreview = run[0].task.slice(0, 80);
-    const failureRate = `${run.length}/${run.length}`;
-    return (`technique '${technique}' on task '${taskPreview}' ` +
-        `failed ${run.length} consecutive rounds (${rounds}) — ` +
-        `consider strategy change`);
-}
-/** Extract round numbers referenced in failure pattern descriptions.
- *  Used by buildRollingSummary to identify which rounds to demote. */
-function extractFailureRoundNums(patterns) {
-    const nums = new Set();
-    for (const p of patterns) {
-        // Match "R2-R4" or "R5"
-        const rangeMatch = p.match(/R(\d+)-R(\d+)/);
-        if (rangeMatch) {
-            const start = parseInt(rangeMatch[1], 10);
-            const end = parseInt(rangeMatch[2], 10);
-            for (let r = start; r <= end; r++)
-                nums.add(r);
-        }
-        else {
-            const singleMatch = p.match(/R(\d+)/);
-            if (singleMatch)
-                nums.add(parseInt(singleMatch[1], 10));
-        }
-    }
-    return nums;
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Rolling Summary (v3.5)
-// ═══════════════════════════════════════════════════════════════════════════
-export function buildRollingSummary(loopId, currentRound, vaultContext, sinceRound) {
-    if (vaultContext === null)
-        return null;
-    const results = vaultContext.results || [];
-    if (!results.length)
-        return null;
-    const policy = getPolicy();
-    const window = policy.summary.window;
-    const minRound = sinceRound ?? 0;
-    // Collect rounds matching this loop_id, excluding current
-    const rounds = [];
-    for (const r of results) {
-        const lineage = (r.loop_lineage || r.lineage || {});
-        if (lineage.loop_id !== loopId)
-            continue;
-        const rnd = lineage.round;
-        if (rnd >= currentRound)
-            continue;
-        if (rnd < minRound)
-            continue;
-        rounds.push({
-            round: rnd,
-            success: r.success ?? lineage.success ?? false,
-            task: r.task ?? r.user_intent ?? "",
-            output_summary: r.output_summary ?? "",
-            constraint_violations: r.constraint_violations || [],
-            technique_used: r.technique_used ?? "",
+function evolveObjective(request, context) {
+    const current = request.loop_objective ?? latestObjective(request.loop_id, context) ??
+        makeLoopObjective({
+            objective: request.task,
+            success_criteria: ["Task goal achieved with verifiable evidence"],
+            hard_constraints: unique(request.constraints_from_plan),
+            created_at_round: 1,
+            loop_id: request.loop_id,
         });
-    }
-    if (!rounds.length)
+    const last = request.last_round_result;
+    const history = [...(current.refinement_history ?? [])];
+    let objective = current.objective || request.task;
+    let version = current.version ?? 1;
+    if (last?.objective_refinement?.trim()) {
+        const refinement = last.objective_refinement.trim();
+        history.push(refinement);
+        objective = `${objective}\nRefinement: ${refinement}`;
+        version++;
+    }
+    const revisions = new Map((last?.revised_success_criteria ?? []).map((item) => [item.old, item.new]));
+    return makeLoopObjective({
+        ...current,
+        objective,
+        version,
+        refinement_history: history.slice(-getPolicy().evolution.max_objective_versions),
+        success_criteria: unique(current.success_criteria.map((item) => revisions.get(item) ?? item)),
+        hard_constraints: unique(current.hard_constraints),
+        loop_id: request.loop_id,
+    });
+}
+function evolveConstraints(request, objective, previous) {
+    const retired = unique(request.last_round_result?.retracted_constraints ?? []);
+    const retiredSet = new Set(retired);
+    const discovered = unique(request.last_round_result?.discovered_constraints ?? [])
+        .slice(0, getPolicy().evolution.max_discovered_constraints_per_round);
+    const active = unique([
+        ...(previous?.constraints_active ?? []),
+        ...request.constraints_from_plan,
+        ...objective.hard_constraints,
+        ...objective.success_criteria,
+        ...discovered,
+    ]).filter((item) => !retiredSet.has(item))
+        .slice(0, getPolicy().evolution.max_active_constraints);
+    return { active, retired };
+}
+export function buildRollingSummary(loopId, currentRound, context, sinceRound = 0) {
+    const window = getPolicy().summary.window;
+    const entries = loopEntries(loopId, context)
+        .filter((entry) => {
+        const round = entryRound(entry);
+        return round >= sinceRound && round < currentRound;
+    })
+        .slice(-window);
+    if (entries.length === 0)
         return null;
-    // Sort by round descending, take last N
-    rounds.sort((a, b) => b.round - a.round);
-    const sampled = rounds.slice(0, window).reverse(); // chronological order
-    // v1.12: Key outcomes — all rounds with output_summary
-    const keyOutcomes = [];
-    for (const r of sampled) {
-        if (r.output_summary) {
-            const status = r.success ? "✓" : "✗";
-            keyOutcomes.push(`[R${r.round}] ${status} (${r.technique_used || "n/a"}): ` +
-                `${String(r.output_summary).slice(0, 200)}`);
-        }
-    }
-    // Recurring issues
-    const violationCounts = new Map();
-    for (const r of sampled) {
-        const seen = new Set();
-        for (const v of r.constraint_violations || []) {
-            const vNorm = String(v).trim().toLowerCase();
-            if (vNorm && !seen.has(vNorm)) {
-                violationCounts.set(vNorm, (violationCounts.get(vNorm) || 0) + 1);
-                seen.add(vNorm);
-            }
-        }
-    }
-    let recurringIssues = [...violationCounts.entries()]
-        .filter(([, count]) => count >= 2)
-        .sort((a, b) => b[1] - a[1])
-        .map(([v, count]) => `${v} (appeared in ${count} rounds)`);
-    // v1.7: Failure lineage weighting — detect and demote failure patterns
-    const sampledRounds = sampled.map((r) => ({
-        round: r.round,
-        success: r.success,
-        task: r.task,
-        output_summary: r.output_summary,
-        constraint_violations: r.constraint_violations,
-        technique_used: r.technique_used,
-    }));
-    const failurePatterns = detectFailurePatterns(sampledRounds);
-    const failedRoundNums = extractFailureRoundNums(failurePatterns);
-    // Re-weight key_outcomes: outcomes from failure-pattern rounds go to end
-    if (failedRoundNums.size > 0 && keyOutcomes.length > 0) {
-        const promoted = [];
-        const demoted = [];
-        for (const ko of keyOutcomes) {
-            const rndMatch = ko.match(/^\[R(\d+)\]/);
-            if (rndMatch && failedRoundNums.has(parseInt(rndMatch[1], 10))) {
-                demoted.push(ko.replace(/^\[R\d+\]/, "$& [Consider alternatives]"));
-            }
-            else {
-                promoted.push(ko);
-            }
-        }
-        keyOutcomes.length = 0;
-        keyOutcomes.push(...promoted, ...demoted);
-    }
-    // Re-weight recurring_issues: mark issues that ONLY appear in failure-pattern rounds
-    if (failedRoundNums.size > 0 && recurringIssues.length > 0) {
-        // Build per-round violation sets
-        const failureViolations = new Set();
-        const successViolations = new Set();
-        for (const r of sampledRounds) {
-            const target = failedRoundNums.has(r.round) ? failureViolations : successViolations;
-            for (const v of r.constraint_violations) {
-                target.add(String(v).trim().toLowerCase());
-            }
-        }
-        recurringIssues.length = 0;
-        recurringIssues.push(...[...violationCounts.entries()]
-            .filter(([, count]) => count >= 2)
-            .sort((a, b) => b[1] - a[1])
-            .map(([v, count]) => {
-            const vNorm = v.trim().toLowerCase();
-            // Mark if this issue only appears in failure rounds (possible dead end)
-            if (failureViolations.has(vNorm) && !successViolations.has(vNorm)) {
-                return `${v} (appeared in ${count} rounds) ⚠️ [Possible dead end — only in failed rounds]`;
-            }
-            return `${v} (appeared in ${count} rounds)`;
-        }));
+    const outcomes = [];
+    const issues = [];
+    for (const entry of entries) {
+        const data = lineage(entry);
+        const round = entryRound(entry);
+        const success = entry.success ?? data.success;
+        const summary = typeof entry.output_summary === "string"
+            ? entry.output_summary
+            : typeof data.output_summary === "string" ? data.output_summary : "";
+        if (summary)
+            outcomes.push(`[R${round}] ${success === false ? "failed" : "accepted"}: ${summary}`);
+        const violations = Array.isArray(entry.constraint_violations)
+            ? entry.constraint_violations
+            : Array.isArray(data.constraint_violations) ? data.constraint_violations : [];
+        issues.push(...violations.filter((item) => typeof item === "string"));
     }
     return makeRollingSummary({
-        key_outcomes: keyOutcomes,
-        recurring_issues: recurringIssues,
-        rounds_sampled: sampled.length,
+        key_outcomes: unique(outcomes),
+        recurring_issues: unique(issues),
+        rounds_sampled: entries.length,
         generated_at_round: currentRound,
-        failed_patterns: failurePatterns.length ? failurePatterns : [],
+        failed_patterns: [],
     });
 }
-export function formatRollingSummaryForPrompt(rs) {
-    if (rs === null || rs.rounds_sampled === 0)
-        return "";
-    const lines = [
-        "### Cross-Round Summary (Accumulated)",
-        "",
-        `**Sampled**: ${rs.rounds_sampled} prior rounds`,
-        "",
-    ];
-    if (rs.key_outcomes.length) {
-        lines.push("**Key Outcomes**:");
-        for (const ko of rs.key_outcomes)
-            lines.push(`- ${ko}`);
-        lines.push("");
-    }
-    if (rs.recurring_issues.length) {
-        lines.push("**Recurring Issues (appeared 2+ times)**:");
-        for (const ri of rs.recurring_issues)
-            lines.push(`- ⚠️ ${ri}`);
-        lines.push("");
-    }
-    // v1.7: Failure patterns — explicit warnings about repeated failure paths
-    if (rs.failed_patterns && rs.failed_patterns.length) {
-        lines.push("### ⚠️ Failure Patterns — Consider Strategy Change");
-        lines.push("");
-        lines.push("The following approaches failed repeatedly. The compiler has demoted " +
-            "their influence on key outcomes. Consider a different technique or " +
-            "narrower scope.");
-        for (const fp of rs.failed_patterns) {
-            lines.push(`- 🚫 ${fp}`);
-        }
-        lines.push("");
-    }
-    return lines.join("\n");
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Checkpoint compression (v1.10 — subtask boundary snapshots)
-// ═══════════════════════════════════════════════════════════════════════════
-/** Build a CheckpointSummary from the current round's self-evaluation state.
- *  Called when the Agent sets compression_checkpoint: true in its self-eval.
- *  Snapshots the current constraints and outcome so they survive rolling-window
- *  eviction in subsequent rounds. */
-export function buildCheckpointSummary(selfEval, round, activeConstraints, retiredConstraints) {
-    const policy = getPolicy();
-    const cpCfg = policy.checkpoint;
-    const maxCarried = cpCfg?.max_carried_constraints ?? 10;
-    const outcomeMaxChars = cpCfg?.outcome_max_chars ?? 200;
-    const label = selfEval.checkpoint_label?.trim() ||
-        `Subtask completed at round ${round}`;
-    const outcome = (selfEval.output_summary || "").trim().slice(0, outcomeMaxChars);
-    // Carried: constraints still active, capped
-    const carried = activeConstraints.slice(0, maxCarried);
-    // Resolved: constraints retired this round (retracted + the retire delta)
-    const resolved = retiredConstraints.slice(0, maxCarried);
-    return {
-        label,
-        declared_at_round: round,
-        outcome,
-        carried_constraints: carried,
-        resolved_constraints: resolved,
-    };
+function tokens(text) {
+    return new Set(text.toLowerCase().match(/[a-z0-9\u4e00-\u9fff]+/g) ?? []);
 }
-/** Format a CheckpointSummary as a prompt block.
- *  Renders as a fixed section that persists across rolling-window eviction.
- *  Returns empty string if the summary is null or has no meaningful data. */
-export function formatCheckpointForPrompt(cs) {
-    if (!cs)
-        return "";
-    // Must have at least a label and some content to be meaningful
-    if (!cs.label && !cs.outcome && !cs.carried_constraints.length)
-        return "";
-    const lines = [
-        `### Checkpoint: ${cs.label} (Round ${cs.declared_at_round})`,
-        "",
-    ];
-    if (cs.outcome) {
-        lines.push(`**Outcome**: ${cs.outcome}`);
-        lines.push("");
-    }
-    if (cs.carried_constraints.length) {
-        lines.push("**Carried Constraints** (still active):");
-        for (const c of cs.carried_constraints) {
-            lines.push(`- ${c}`);
-        }
-        lines.push("");
-    }
-    if (cs.resolved_constraints.length) {
-        lines.push("**Resolved Constraints** (closed with this checkpoint):");
-        for (const c of cs.resolved_constraints) {
-            lines.push(`- ${c}`);
-        }
-        lines.push("");
-    }
-    return lines.join("\n");
+function similarity(left, right) {
+    const a = tokens(left);
+    const b = tokens(right);
+    if (a.size === 0 || b.size === 0)
+        return 1;
+    let intersection = 0;
+    for (const value of a)
+        if (b.has(value))
+            intersection++;
+    return intersection / new Set([...a, ...b]).size;
 }
-/** Query the vault for the most recent checkpoint entry before the current
- *  round. Returns null if no checkpoint has been declared yet. */
-function loadLatestCheckpoint(loopId, currentRound, vaultContext) {
-    if (!vaultContext)
-        return null;
-    const results = vaultContext.results || [];
-    let latest = null;
-    let latestRound = -1;
-    for (const r of results) {
-        const lineage = (r.loop_lineage || r.lineage || {});
-        if (lineage.loop_id !== loopId)
-            continue;
-        const rnd = lineage.round;
-        if (rnd >= currentRound)
-            continue;
-        // Check for stored checkpoint summary on this entry
-        const cp = r.checkpoint_summary;
-        if (cp && typeof cp.declared_at_round === "number" && cp.declared_at_round > latestRound) {
-            latest = cp;
-            latestRound = cp.declared_at_round;
-        }
-    }
-    if (!latest)
-        return null;
-    return makeCheckpointSummary({
-        label: latest.label ?? "",
-        declared_at_round: latest.declared_at_round ?? 0,
-        outcome: latest.outcome ?? "",
-        carried_constraints: latest.carried_constraints ?? [],
-        resolved_constraints: latest.resolved_constraints ?? [],
+export function alignTask(proposedTask, request, context) {
+    const objective = request.loop_objective ?? latestObjective(request.loop_id, context);
+    if (!objective)
+        return makeTaskAlignment();
+    const score = similarity(proposedTask, [objective.objective, ...objective.success_criteria, ...objective.hard_constraints].join(" "));
+    return makeTaskAlignment({
+        is_aligned: score >= 0.3,
+        alignment_score: Number(score.toFixed(2)),
+        warning: score < 0.3 ? "Current task may be drifting from the loop objective." : "",
+        escalation: score < 0.3 ? "warn" : "none",
     });
 }
-// ═══════════════════════════════════════════════════════════════════════════
-// Shared state evolution (P0/P1/P5) — used by both compileL1 and compileL2
-// ═══════════════════════════════════════════════════════════════════════════
-/** Apply P1 objective refinement from last round's self-evaluation.
- *  Appends the refinement to the objective with a round marker.
- *  Returns the updated loop objective (or unchanged if no refinement). */
-function applyObjectiveRefinement(loopObjective, lastRoundResult, currentRound) {
-    if (!loopObjective || !lastRoundResult?.objective_refinement)
-        return loopObjective;
-    const refinement = lastRoundResult.objective_refinement.trim();
-    if (!refinement)
-        return loopObjective;
-    const version = (loopObjective.version ?? 1) + 1;
-    const history = [...(loopObjective.refinement_history ?? []), refinement];
-    const policy = getPolicy();
-    const maxVersions = policy.evolution?.max_objective_versions ?? 10;
-    const prunedHistory = history.slice(-maxVersions);
-    const refinedObjective = `${loopObjective.objective} [R${currentRound}: ${refinement}]`;
-    return makeLoopObjective({
-        ...loopObjective,
-        objective: refinedObjective,
-        version,
-        refinement_history: prunedHistory,
+export function checkLoopHealth(loopId, request, context) {
+    const previous = getPreviousRound(loopId, request.round - 1, context);
+    const alignment = alignTask(request.task, request, context);
+    const violations = request.last_round_result?.constraint_violations.length ?? 0;
+    const integrity = Math.max(0, 1 - violations * 0.2);
+    const continuity = previous ? similarity(previous.task, request.task) : 1;
+    const drift = alignment.alignment_score < 0.3 || continuity < 0.2;
+    return makeLoopHealth({
+        goal_alignment: alignment.alignment_score,
+        constraint_integrity: integrity,
+        drift_detected: drift,
+        strategy_stability: true,
+        task_continuity: Number(continuity.toFixed(2)),
+        escalation_recommended: drift || integrity < 0.6 ? "l2" : "none",
     });
 }
-/** Apply P0 discovered constraints and P5 retractions/revisions.
- *  Pure function — returns updated constraints, loop objective, and retired list. */
-function applyConstraintEvolution(constraints, loopObjective, lastRoundResult, currentRound) {
-    const retired = [];
-    let lo = loopObjective;
-    let cs = [...constraints];
-    // P0: Merge discovered constraints
-    if (lastRoundResult?.discovered_constraints?.length) {
-        const policy = getPolicy();
-        const maxPerRound = policy.evolution?.max_discovered_constraints_per_round ?? 5;
-        const maxActive = policy.evolution?.max_active_constraints ?? 15;
-        const newConstraints = lastRoundResult.discovered_constraints
-            .slice(0, maxPerRound)
-            .filter((c) => !cs.includes(c));
-        cs = [...cs, ...newConstraints].slice(0, maxActive);
-    }
-    // P5a: Retracted constraints
-    if (lastRoundResult?.retracted_constraints?.length) {
-        for (const rc of lastRoundResult.retracted_constraints) {
-            const idx = cs.indexOf(rc);
-            if (idx >= 0) {
-                cs.splice(idx, 1);
-                retired.push(`[agent-retracted] ${rc}`);
-            }
-        }
-    }
-    // P5b: Revised success criteria
-    if (lastRoundResult?.revised_success_criteria?.length && lo) {
-        const sc = [...lo.success_criteria];
-        for (const rev of lastRoundResult.revised_success_criteria) {
-            const idx = sc.indexOf(rev.old);
-            if (idx >= 0)
-                sc[idx] = rev.new;
-            else
-                sc.push(rev.new);
-        }
-        const version = (lo.version ?? 1) + 1;
-        const history = [
-            ...(lo.refinement_history ?? []),
-            `R${currentRound}: revised ${lastRoundResult.revised_success_criteria.length} success criteria`,
-        ];
-        const updatedLo = makeLoopObjective({
-            ...lo,
-            success_criteria: sc,
-            version,
-            refinement_history: history,
-        });
-        // Rebuild constraints to include revised criteria, deduplicate
-        cs = [...new Set([
-                ...cs.filter((c) => !updatedLo.hard_constraints.includes(c) && !updatedLo.success_criteria.includes(c)),
-                ...updatedLo.hard_constraints,
-                ...updatedLo.success_criteria,
-            ])];
-        lo = updatedLo;
-    }
-    return { constraints: cs, loopObjective: lo, retired };
+function levelDecision(request, context) {
+    const previous = getPreviousRound(request.loop_id, request.round - 1, context);
+    const last = request.last_round_result;
+    const hasNewInformation = Boolean(request.new_since_last_round.trim() ||
+        last?.discovered_constraints?.length ||
+        last?.objective_refinement?.trim() ||
+        last?.emerged_subtasks?.length ||
+        last?.retracted_constraints?.length ||
+        last?.revised_success_criteria?.length ||
+        last?.wrong_assumptions?.length);
+    const lastFullRound = loopEntries(request.loop_id, context)
+        .filter((entry) => lineage(entry).recompile_level === "l2")
+        .map(entryRound)
+        .filter((round) => round < request.round)
+        .at(-1) ?? 1;
+    return decidePromptLevel({
+        round: request.round,
+        attempt: request.attempt,
+        forceLevel: request.force_level,
+        hasPlanSource: Boolean(request.plan_source),
+        checkpointBoundary: last?.compression_checkpoint === true,
+        goalChanged: previous !== null && previous.goal_id !== deriveGoalId(request.loop_id, request.task, request.goal_id),
+        previousStateMissing: request.round > 1 && previous === null,
+        previousFailedWithoutNewInformation: last?.success === false && !hasNewInformation,
+        verificationContradicted: (request.verification_flags ?? [])
+            .some((flag) => flag.severity === "error"),
+        consecutiveRejections: request.consecutive_rejections,
+        fullRefreshInterval: getPolicy().prompt.full_refresh_interval,
+        lastFullRound,
+    });
 }
-/** Collect checkpoint summaries from vault entries for a given loop.
- *  Shared between compileL1 and compileL2 — same vault scanning logic. */
-function collectVaultCheckpoints(vaultContext, loopId, excludeRounds) {
-    const checkpoints = [];
-    if (!vaultContext)
-        return checkpoints;
-    const results = vaultContext.results || [];
-    for (const r of results) {
-        const lineage = (r.loop_lineage || r.lineage || {});
-        if (lineage.loop_id !== loopId)
-            continue;
-        const cp = r.checkpoint_summary;
-        if (cp && typeof cp.declared_at_round === "number") {
-            if (excludeRounds?.has(cp.declared_at_round))
-                continue;
-            if (checkpoints.some((c) => c.declared_at_round === cp.declared_at_round))
-                continue;
-            checkpoints.push(makeCheckpointSummary({
-                label: cp.label ?? "",
-                declared_at_round: cp.declared_at_round,
-                outcome: cp.outcome ?? "",
-                carried_constraints: cp.carried_constraints ?? [],
-                resolved_constraints: cp.resolved_constraints ?? [],
-            }));
-        }
-    }
-    return checkpoints;
+export function decideLevel(request, context) {
+    return levelDecision(request, context).level;
 }
-// ═══════════════════════════════════════════════════════════════════════════
-// External Context formatting (v1.7 — memory system integration)
-// ═══════════════════════════════════════════════════════════════════════════
-/** Format an external context string for injection into an L2 prompt.
- *  Wraps the raw context in a marked section with a priority disclaimer.
- *  Returns empty string if context is empty or injection is disabled by policy. */
-export function formatExternalContext(externalContext, sectionTitle, maxLength) {
-    if (!externalContext || externalContext.trim().length === 0)
-        return "";
-    const trimmed = externalContext.trim().slice(0, maxLength);
-    const truncationNote = trimmed.length < externalContext.trim().length
-        ? `\n> ⚠️ Context was truncated to ${maxLength} characters.`
-        : "";
+export function buildSelfEvalBlock(round) {
     return [
+        "### LoopForge Evaluation (Required)",
         "",
-        sectionTitle,
-        "",
-        "> ⚠️ **Role**: Situational awareness only. These are point-in-time",
-        "> observations from past sessions — claims about code locations or",
-        "> behaviour may be outdated. If any insight contradicts the Loop",
-        "> Objective or Active Constraints above, the LoopForge specification",
-        "> takes absolute precedence.",
-        "",
-        trimmed,
-        truncationNote,
-        "",
-        "---",
+        `After completing Round ${round}, submit JSON between these markers:`,
+        "---loopforge-eval",
+        JSON.stringify({
+            success: false,
+            output_summary: `<verified result of round ${round}>`,
+            constraint_violations: [],
+            should_continue: true,
+            discovered_constraints: [],
+            emerged_subtasks: [],
+            execution_evidence: {
+                files_changed: [],
+                test_results: { passed: 0, failed: 0, skipped: 0 },
+                success_criteria_met: [],
+                success_criteria_remaining: [],
+                progress_estimate: 0,
+            },
+            wrong_assumptions: [],
+            next_action: "<next concrete action, or empty when complete>",
+        }, null, 2),
+        "---end-loopforge-eval",
         "",
+        "Set success=true only when the full goal and hard constraints are verified.",
     ].join("\n");
 }
-// ═══════════════════════════════════════════════════════════════════════════
-// LAYER 1 — Hard Gates (can change compile level)
-// ═══════════════════════════════════════════════════════════════════════════
-export function decideLevel(request, vaultContext) {
-    // Gate 1: Explicit override (never overrides round 1 or plan_source)
-    if (request.force_level !== "auto" &&
-        ["l0", "l1", "l2"].includes(request.force_level)) {
-        if (request.round !== 1 && !request.plan_source) {
-            return request.force_level;
-        }
-    }
-    // ── L2 triggers: structural restarts ──────────────────────────────────
-    // Gate 2: First call or explicit plan → full rebuild
-    if (request.round === 1 || request.plan_source)
-        return "l2";
-    // Gate 3: Checkpoint boundary — subtask completed, re-plan
-    if (request.last_round_result?.compression_checkpoint === true)
-        return "l2";
-    // Gate 4: goal_id stability
-    const goalId = deriveGoalId(request.loop_id, request.task, request.goal_id);
-    const prev = getPreviousRound(request.loop_id, request.round - 1, vaultContext);
-    if (prev === null)
-        return "l2";
-    if (goalId !== prev.goal_id)
-        return "l2";
-    // ── L0 trigger: honest failure with no new information ────────────────
-    const lr = request.last_round_result;
-    const prevFailed = lr !== null && !lr.success;
-    const hasNoNewInfo = (lr?.discovered_constraints?.length ?? 0) === 0 &&
-        (lr?.objective_refinement?.trim().length ?? 0) === 0 &&
-        (lr?.emerged_subtasks?.length ?? 0) === 0 &&
-        (lr?.retracted_constraints?.length ?? 0) === 0 &&
-        (lr?.revised_success_criteria?.length ?? 0) === 0 &&
-        (lr?.wrong_assumptions?.length ?? 0) === 0 &&
-        request.constraints_from_plan.length === 0 &&
-        !detectsRepairSignal(request);
-    if (prevFailed && hasNoNewInfo)
-        return "l0";
-    // ── L1: default path — all P0-P5 state changes handled here ───────────
-    return "l1";
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// LAYER 2 — Soft Advisories (NEVER change compile level)
-// ═══════════════════════════════════════════════════════════════════════════
-export function alignTask(proposedTask, request, vaultContext) {
-    const objectiveEntry = vaultGetLoopObjective(request.loop_id, vaultContext);
-    let objData = null;
-    if (request.loop_objective) {
-        objData = request.loop_objective;
-    }
-    else if (objectiveEntry) {
-        const lo = objectiveEntry.loop_objective;
-        if (lo && typeof lo === "object") {
-            objData = lo;
-        }
-    }
-    if (objData === null)
-        return makeTaskAlignment();
-    const objective = objData.objective ?? "";
-    const successCriteria = objData.success_criteria ?? [];
-    const hardConstraints = objData.hard_constraints ?? [];
-    const proposedTokens = tokenize(proposedTask.toLowerCase());
-    const objText = `${objective} ${successCriteria.join(" ")} ${hardConstraints.join(" ")}`.toLowerCase();
-    const objTokens = tokenize(objText);
-    const score = proposedTokens.size && objTokens.size
-        ? jaccard(proposedTokens, objTokens)
-        : 1.0;
-    if (score >= 0.5) {
-        return makeTaskAlignment({
-            is_aligned: true,
-            alignment_score: Math.round(score * 100) / 100,
-        });
-    }
-    else if (score >= 0.3) {
-        return makeTaskAlignment({
-            is_aligned: true,
-            alignment_score: Math.round(score * 100) / 100,
-            warning: `Proposed task '${proposedTask.slice(0, 80)}' may be drifting from ` +
-                `loop objective '${objective}'. Consider narrowing scope.`,
-            escalation: "warn",
-        });
-    }
-    else {
-        return makeTaskAlignment({
-            is_aligned: false,
-            alignment_score: Math.round(score * 100) / 100,
-            warning: `Proposed task '${proposedTask.slice(0, 80)}' is OFF-OBJECTIVE. ` +
-                `Loop objective: '${objective}'. Full realignment recommended.`,
-            escalation: "block",
-        });
-    }
-}
-export function checkLoopHealth(loopId, request, vaultContext) {
-    const objectiveEntry = vaultGetLoopObjective(loopId, vaultContext);
-    let obj = null;
-    if (request.loop_objective) {
-        obj = request.loop_objective;
-    }
-    else if (objectiveEntry) {
-        const lo = objectiveEntry.loop_objective;
-        if (lo && typeof lo === "object") {
-            obj = lo;
-        }
-    }
-    if (obj === null)
-        return makeLoopHealth();
-    const objective = obj.objective ?? "";
-    const successCriteria = obj.success_criteria ?? [];
-    const hardConstraints = obj.hard_constraints ?? [];
-    // 1. goal_alignment
-    let goalAlignment = 1.0;
-    if (request.task) {
-        const taskTokens = tokenize(request.task.toLowerCase());
-        const objText = `${objective} ${successCriteria.join(" ")} ${hardConstraints.join(" ")}`.toLowerCase();
-        const objTokens = tokenize(objText);
-        goalAlignment =
-            taskTokens.size && objTokens.size
-                ? jaccard(taskTokens, objTokens)
-                : 1.0;
-    }
-    // 2. constraint_integrity
-    let constraintIntegrity = 1.0;
-    if (request.last_round_result && hardConstraints.length) {
-        const outputText = request.last_round_result.output_summary.toLowerCase();
-        const present = hardConstraints.filter((c) => c
-            .toLowerCase()
-            .split(/\s+/)
-            .some((word) => outputText.includes(word))).length;
-        constraintIntegrity = present / hardConstraints.length;
-    }
-    // 3. drift_detected
-    const driftDetected = countConsecutiveHashMismatches(loopId, vaultContext) >= 3;
-    // 4. strategy_stability
-    const recent = getRecentRounds(loopId, 3, vaultContext);
-    const strategyStability = recent.length > 0
-        ? recent.every((r) => r.success === true)
-        : true;
-    // 5. task_continuity
-    let taskContinuity = 1.0;
-    const prevTask = getPreviousRoundTask(loopId, request.round - 1, vaultContext);
-    if (prevTask && request.task) {
-        const currTokens = tokenize(request.task.toLowerCase());
-        const prevTokens = tokenize(prevTask.toLowerCase());
-        taskContinuity =
-            currTokens.size && prevTokens.size
-                ? jaccard(currTokens, prevTokens)
-                : 1.0;
-    }
-    // Escalation recommendation
-    let escalation = "none";
-    if (goalAlignment < 0.5) {
-        escalation = "l2";
-    }
-    else if (constraintIntegrity < 0.7) {
-        escalation = "l1";
-    }
-    else if (driftDetected) {
-        escalation = "l2";
-    }
-    return makeLoopHealth({
-        goal_alignment: Math.round(goalAlignment * 100) / 100,
-        constraint_integrity: Math.round(constraintIntegrity * 100) / 100,
-        drift_detected: driftDetected,
-        strategy_stability: strategyStability,
-        task_continuity: Math.round(taskContinuity * 100) / 100,
-        escalation_recommended: escalation,
-    });
-}
-function computeSuggestedNextTask(loopId, vaultContext) {
-    if (vaultContext === null)
-        return "";
-    const results = vaultContext.results || [];
-    let bestTask = "";
-    let bestRound = -1;
-    for (const r of results) {
-        const lineage = (r.loop_lineage || r.lineage || {});
-        if (lineage.loop_id !== loopId)
-            continue;
-        const rnd = lineage.round ?? 0;
-        if (rnd > bestRound) {
-            const task = r.task ?? r.user_intent ?? "";
-            if (task) {
-                bestTask = task;
-                bestRound = rnd;
-            }
-        }
-    }
-    return bestTask ? `[R${bestRound}] Previous task: ${bestTask.slice(0, 120)}` : "";
-}
-export function computeAdvisories(request, vaultContext) {
-    const warnings = [];
-    let alignment = null;
-    let health = null;
-    let suggested = "";
-    // goal_text_hash drift detection
-    const currentHash = computeGoalTextHash(request.task);
-    const prev = getPreviousRound(request.loop_id, request.round - 1, vaultContext);
-    if (prev && currentHash !== prev.goal_text_hash && prev.goal_text_hash) {
-        warnings.push(`goal_text_hash changed (${prev.goal_text_hash} → ${currentHash}) ` +
-            "but goal_id matched — wording drift detected");
-    }
-    // Repair cue detection
-    if (detectsRepairSignal(request)) {
-        warnings.push("repair signal detected — L1 patch applied");
-    }
-    // Task alignment
-    if (request.next_task_proposal) {
-        alignment = alignTask(request.next_task_proposal, request, vaultContext);
-        if (alignment.escalation !== "none") {
-            warnings.push(`task_alignment: ${alignment.warning}`);
-        }
-    }
-    // Loop health
-    const interval = Math.max(request.health_check_interval, 1);
-    if (request.round % interval === 0) {
-        health = checkLoopHealth(request.loop_id, request, vaultContext);
-        if (health.escalation_recommended !== "none") {
-            warnings.push(`loop_health recommends ${health.escalation_recommended}: ` +
-                `goal_alignment=${health.goal_alignment.toFixed(2)}, ` +
-                `constraint_integrity=${health.constraint_integrity.toFixed(2)}, ` +
-                `task_continuity=${health.task_continuity.toFixed(2)}`);
-        }
-        if (health.drift_detected) {
-            warnings.push("drift_detected: goal_text_hash diverged 3+ consecutive rounds");
-        }
-    }
-    // Forward hint
-    suggested = computeSuggestedNextTask(request.loop_id, vaultContext);
-    return { warnings, suggestedNextTask: suggested, alignment, health };
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Plan extraction
-// ═══════════════════════════════════════════════════════════════════════════
-function extractObjectiveFromPlan(planPath) {
-    let text;
-    try {
-        text = readFileSync(planPath, "utf-8");
-    }
-    catch {
-        return null;
-    }
-    const sections = {
-        goal: [],
-        success: [],
-        constraints: [],
-    };
-    let currentSection = null;
-    const goalPatterns = ["goal", "objective", "目标", "目的", "意图"];
-    const successPatterns = [
-        "success criteria", "acceptance criteria", "验收标准", "成功标准",
-        "done when", "完成标准", "交付标准", "outcome", "deliverable",
-        "结果", "产出", "交付物",
-    ];
-    const constraintPatterns = [
-        "hard constraint", "constraint", "non-goal", "out of scope",
-        "硬约束", "约束", "非目标", "不做什么", "限制",
-    ];
-    for (const line of text.split("\n")) {
-        const stripped = line.trim();
-        const low = stripped
-            .toLowerCase()
-            .replace(/^#+\s*/, "");
-        if (stripped.startsWith("#")) {
-            if (goalPatterns.some((p) => low.includes(p))) {
-                currentSection = "goal";
-                continue;
-            }
-            if (successPatterns.some((p) => low.includes(p))) {
-                currentSection = "success";
-                continue;
-            }
-            if (constraintPatterns.some((p) => low.includes(p))) {
-                currentSection = "constraints";
-                continue;
-            }
-            currentSection = null;
-            continue;
-        }
-        if (!currentSection)
-            continue;
-        if (/^[-*•]/.test(stripped)) {
-            const item = stripped.replace(/^[-*•]\s*/, "").trim();
-            if (item && item.length > 3) {
-                sections[currentSection].push(item);
-            }
-        }
-        else if (stripped && currentSection === "goal") {
-            if (!sections.goal.length && stripped.length > 10) {
-                sections.goal.push(stripped);
-            }
-        }
-        else if (stripped && currentSection === "success" && stripped.length > 10) {
-            // P3: Also capture free-text paragraphs under success criteria headers
-            if (!/^#/.test(stripped)) {
-                sections.success.push(stripped);
-            }
-        }
-    }
-    if (!Object.values(sections).some((v) => v.length))
+function checkpoint(request, active, retired) {
+    const last = request.last_round_result;
+    if (!last?.compression_checkpoint)
         return null;
-    return {
-        objective: sections.goal[0] ?? "",
-        success_criteria: sections.success,
-        hard_constraints: sections.constraints,
-    };
-}
-function computeLoopObjectiveFromTask(request, _vaultContext) {
-    const task = request.task || "";
-    const constraints = [...request.constraints_from_plan];
-    let objective = task.trim().slice(0, 200);
-    const successCriteria = [];
-    const hardConstraints = [...constraints];
-    // P3: Outcome-oriented default success criteria — describe the RESULT,
-    //      not the process. The process emerges from the loop.
-    if (/test|测试/i.test(task)) {
-        successCriteria.push("All tests pass with no regressions");
-    }
-    if (/compat|兼容/i.test(task)) {
-        successCriteria.push("Existing API contracts and integrations unchanged");
-    }
-    if (/security|安全|audit/i.test(task)) {
-        successCriteria.push("All identified vulnerabilities resolved or documented");
-    }
-    if (/fix|修复|bug/i.test(task)) {
-        successCriteria.push("Root cause addressed and verified, not just symptoms");
-    }
-    if (/build|create|implement|开发|实现|构建/i.test(task)) {
-        successCriteria.push("Deliverable matches specification and passes review");
-    }
-    if (/refactor|重构/i.test(task)) {
-        successCriteria.push("Behavior preserved, structure improved, no new failures");
-    }
-    if (/migrate|迁移|upgrade|升级/i.test(task)) {
-        successCriteria.push("Migration completes without data loss or downtime");
-    }
-    if (/perf|performance|optimize|性能|优化/i.test(task)) {
-        successCriteria.push("Measurable improvement verified by benchmarks");
-    }
-    // P3: Try to extract richer objective from plan_source
-    if (request.plan_source) {
-        const planExtracted = extractObjectiveFromPlan(request.plan_source);
-        if (planExtracted) {
-            if (planExtracted.objective) {
-                objective = planExtracted.objective;
-            }
-            if (planExtracted.success_criteria) {
-                successCriteria.push(...planExtracted.success_criteria);
-            }
-            if (planExtracted.hard_constraints) {
-                hardConstraints.push(...planExtracted.hard_constraints);
-            }
-        }
-        else {
-            hardConstraints.push(`Follow plan: ${request.plan_source}`);
-        }
-    }
-    // P3: Derive domain from task content for context-aware defaults
-    if (!successCriteria.length) {
-        if (/\.sol|solidity|contract|智能合约/i.test(task)) {
-            successCriteria.push("All functions respect check-effects-interactions pattern");
-            successCriteria.push("No unchecked external calls or reentrancy vectors");
-        }
-        else if (/\.tsx?|\.jsx?|react|component|组件/i.test(task)) {
-            successCriteria.push("Component renders correctly across all states (loading, empty, error)");
-            successCriteria.push("No prop-type or accessibility regressions");
-        }
-        else if (/api|endpoint|接口|route/i.test(task)) {
-            successCriteria.push("Endpoint responds correctly for all defined status codes");
-            successCriteria.push("Error responses follow the project's error schema");
-        }
-        else {
-            successCriteria.push("Task goal achieved with verifiable evidence");
-        }
-    }
-    if (!hardConstraints.length) {
-        hardConstraints.push("Do not modify files outside the stated scope");
-        hardConstraints.push("Preserve existing test coverage — no test deletions without replacement");
-    }
-    return makeLoopObjective({
-        objective,
-        success_criteria: successCriteria,
-        hard_constraints: hardConstraints,
-        created_at_round: 1,
-        loop_id: request.loop_id,
-        version: 1,
-        refinement_history: [],
+    const policy = getPolicy().checkpoint;
+    return makeCheckpointSummary({
+        label: last.checkpoint_label?.trim() || `Round ${last.round}`,
+        declared_at_round: last.round,
+        outcome: last.output_summary.slice(0, policy.outcome_max_chars),
+        carried_constraints: active.slice(0, policy.max_carried_constraints),
+        resolved_constraints: retired,
     });
 }
-// ═══════════════════════════════════════════════════════════════════════════
-// P4: Shared consistency checks and progress dashboard (used by L1 & L2)
-// ═══════════════════════════════════════════════════════════════════════════
-/** Run P4 consistency validation checks on agent execution evidence.
- *  Returns warning strings. Called by both compileL1 and compileL2.
- *  Three checks:
- *    1. Agent claims file changes but files_changed is empty
- *    2. Agent reports success but test results show failures
- *    3. Progress estimate mismatch (objective vs subjective) */
-function runP4ConsistencyChecks(evidence, outputSummary, success, loopObjective) {
-    const warnings = [];
-    // Check 1: Agent claims action but reports no files changed
-    if (evidence.files_changed.length === 0 && outputSummary) {
-        const actionWords = /\b(fix|modif|chang|updat|refactor|implement|add|remov|delet|rewrit|修补|修改|更改|更新|重构|实现|添加|删除|重写)\b/i;
-        if (actionWords.test(outputSummary)) {
-            warnings.push("P4: Agent output claims changes but execution_evidence.files_changed is empty — possible oversight");
-        }
-    }
-    // Check 2: Agent reports success but tests failed
-    if (evidence.test_results && evidence.test_results.failed > 0 && success) {
-        warnings.push(`P4: Agent reports success=true but ${evidence.test_results.failed} tests failed — claims may not match reality`);
-    }
-    // Check 3: Progress estimate mismatch with criteria tracking
-    if (loopObjective && loopObjective.success_criteria.length > 0) {
-        const metCount = evidence.success_criteria_met.length;
-        const totalCount = loopObjective.success_criteria.length;
-        const objectiveProgress = totalCount > 0 ? metCount / totalCount : 0;
-        const subjectiveProgress = evidence.progress_estimate;
-        const policy = getPolicy();
-        const mismatchThreshold = policy.evolution?.progress_mismatch_threshold ?? 0.3;
-        if (Math.abs(objectiveProgress - subjectiveProgress) > mismatchThreshold) {
-            warnings.push(`P4: Progress estimate mismatch — agent estimates ${(subjectiveProgress * 100).toFixed(0)}% but ${metCount}/${totalCount} criteria met (${(objectiveProgress * 100).toFixed(0)}%)`);
-        }
-    }
-    return warnings;
-}
-/** Build a progress dashboard string for prompt or state file injection.
- *  Used by both compileL1 and compileL2. When showTrend is true, also
- *  computes a trend arrow from vault history (L2 path). */
-function buildProgressDashboard(evidence, loopObjective, vaultContext, loopId, currentRound, showTrend) {
-    const totalCriteria = loopObjective?.success_criteria.length ?? 0;
-    const metCriteria = evidence.success_criteria_met.length;
-    const remainingCriteria = evidence.success_criteria_remaining;
-    const objProgress = totalCriteria > 0 ? metCriteria / totalCriteria : evidence.progress_estimate;
-    const subjProgress = evidence.progress_estimate;
-    const lines = [
-        "",
-        "### Progress Dashboard",
-        "",
-        `**Overall**: ${metCriteria}/${totalCriteria} criteria met (${(objProgress * 100).toFixed(0)}%)`,
-    ];
-    if (Math.abs(objProgress - subjProgress) > 0.05) {
-        lines.push(`**Agent estimate**: ${(subjProgress * 100).toFixed(0)}%`);
-    }
-    if (evidence.files_changed.length) {
-        lines.push(`**Files changed**: ${evidence.files_changed.join(", ")}`);
-    }
-    if (evidence.test_results) {
-        const tr = evidence.test_results;
-        lines.push(`**Tests**: ${tr.passed} passed, ${tr.failed} failed, ${tr.skipped} skipped`);
-    }
-    if (remainingCriteria.length) {
-        lines.push("**Remaining criteria**:");
-        for (const rc of remainingCriteria.slice(0, 5)) {
-            lines.push(`- ${rc}`);
-        }
-        if (remainingCriteria.length > 5) {
-            lines.push(`- ... and ${remainingCriteria.length - 5} more`);
-        }
-    }
-    lines.push("");
-    // Trend arrow — only computed in L2 path where full vault history is available
-    if (showTrend && vaultContext && loopObjective) {
-        const prevEvidence = getPreviousRoundEvidence(loopId, currentRound - 1, vaultContext);
-        if (prevEvidence) {
-            const trend = objProgress - (prevEvidence.success_criteria_met.length / Math.max(totalCriteria, 1));
-            if (trend > 0.03) {
-                lines.push(`**Trend**: ↑ advancing (+${(trend * 100).toFixed(0)}% this round)`);
-            }
-            else if (trend > -0.03) {
-                lines.push("**Trend**: → stable");
-            }
-            else {
-                lines.push(`**Trend**: ↓ regressing (${(trend * 100).toFixed(0)}% this round)`);
-            }
-            lines.push("");
-        }
-    }
-    return lines.join("\n");
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Compilation — L0 / L1 / L2
-// ═══════════════════════════════════════════════════════════════════════════
-function compileL0(request, vaultContext, prevRound) {
-    const prev = prevRound ??
-        getPreviousRound(request.loop_id, request.round - 1, vaultContext);
-    const cachedPrompt = prev?.prompt_text ?? "";
-    if (cachedPrompt) {
-        return makeLoopCompileResponse({
-            status: AgentStatus.OK,
-            prompt: cachedPrompt,
-            recompile_level: "l0",
-            diff_from_previous: `L0 cache hit — reusing prompt from round ${request.round - 1}`,
-            lineage: [`${request.loop_id}:r${request.round}`],
-            constraints_active: prev?.constraints_active ?? [],
-            constraints_retired: [],
-            technique_used: "cached",
-            loop_id: request.loop_id,
-            round: request.round,
-            goal_id: deriveGoalId(request.loop_id, request.task, request.goal_id),
-            goal_text_hash: computeGoalTextHash(request.task),
-            plan_source: request.plan_source,
-            warnings: [],
-        });
-    }
-    // Auto-escalate: no cached prompt → delegate to L2
-    const l2Response = compileL2(request, vaultContext);
-    l2Response.recompile_level = "l0";
-    l2Response.diff_from_previous =
-        `L0 auto-escalated to L2 — no cached prompt available from round ${request.round - 1}`;
-    return l2Response;
-}
-function compileL1(request, vaultContext, prevRound) {
-    const goalId = deriveGoalId(request.loop_id, request.task, request.goal_id);
-    const lr = request.last_round_result;
-    // ── v1.14: Technique routing (Tier 1 only — 4 techniques) ────────────
-    // L1 is the default path: technique evolves within Tier 1 unless
-    // decideLevel already escalated to L2 (strategy collapse / checkpoint).
-    const analysis = routeTechniqueAdaptive(request.task, vaultContext, request.loop_id, 
-    /* isCheckpoint */ false);
-    const technique = analysis.technique;
-    const referenceFile = analysis.reference_file;
-    // Determine if technique changed from last round
-    const techChanged = techniqueChanged(request.loop_id, technique, request.round, vaultContext);
-    // ── Loop Objective: load from vault, apply P1 refinement ─────────────
-    let loopObjective = null;
-    const vaultLo = vaultGetLoopObjective(request.loop_id, vaultContext);
-    if (vaultLo) {
-        const loData = vaultLo.loop_objective;
-        if (loData) {
-            loopObjective = makeLoopObjective({
-                objective: loData.objective ?? "",
-                success_criteria: loData.success_criteria ?? [],
-                hard_constraints: loData.hard_constraints ?? [],
-                created_at_round: loData.created_at_round ?? 1,
-                loop_id: loData.loop_id ?? request.loop_id,
-                version: loData.version ?? 1,
-                refinement_history: loData.refinement_history ?? [],
-            });
-        }
-    }
-    if (!loopObjective && request.loop_objective) {
-        loopObjective = request.loop_objective;
-    }
-    // P1: Apply objective refinement (shared)
-    loopObjective = applyObjectiveRefinement(loopObjective, lr, request.round);
-    // ── Build active constraints (base + LO) ─────────────────────────────
-    let constraints = [...request.constraints_from_plan];
-    if (loopObjective) {
-        constraints = [
-            ...new Set([
-                ...constraints,
-                ...loopObjective.hard_constraints,
-                ...loopObjective.success_criteria,
-            ]),
-        ];
-    }
-    // ── P0/P5: Constraint evolution (shared) ─────────────────────────────
-    const { constraints: evolvedCs, loopObjective: evolvedLo, retired } = applyConstraintEvolution(constraints, loopObjective, lr, request.round);
-    constraints = evolvedCs;
-    loopObjective = evolvedLo;
-    // ── Constraint retirement ────────────────────────────────────────────
-    const { active, retired: autoRetired } = computeConstraintRetirement(constraints, request.loop_id, request.round, vaultContext);
-    for (const r of autoRetired) {
-        if (!retired.includes(r))
-            retired.push(r);
-    }
-    // ── Rolling summary + P5c wrong assumptions ──────────────────────────
-    const rollingSummary = buildRollingSummary(request.loop_id, request.round, vaultContext);
-    if (lr?.wrong_assumptions?.length) {
-        if (rollingSummary) {
-            rollingSummary.key_outcomes = [
-                ...rollingSummary.key_outcomes,
-                ...lr.wrong_assumptions.map((a) => `Wrong assumption corrected: ${a}`),
-            ];
-        }
-    }
-    const rollingText = formatRollingSummaryForPrompt(rollingSummary);
-    // ── P2: Emerged subtasks → suggested next task ───────────────────────
-    let suggestedNextTask = "";
-    if (lr?.emerged_subtasks?.length) {
-        suggestedNextTask = lr.emerged_subtasks.slice(0, 3).join("; ");
-    }
-    // ── P4: Consistency validation ───────────────────────────────────────
-    const evidence = lr?.execution_evidence;
-    const warnings = evidence
-        ? runP4ConsistencyChecks(evidence, lr.output_summary, lr.success, loopObjective)
-        : [];
-    // ── Route to specialist (all 4 techniques available via Tier 1) ──────
-    let prompt;
-    if (technique === "step-back") {
-        prompt = compileStepBack(request, goalId, active, loopObjective, rollingText, analysis, { embedSkeleton: techChanged, level: "l1" });
-    }
-    else if (technique === "least-to-most") {
-        prompt = compileLeastToMost(request, goalId, active, loopObjective, rollingText, analysis, { embedSkeleton: techChanged, level: "l1" });
-    }
-    else if (technique === "tree-of-thought") {
-        prompt = compileToT(request, goalId, active, loopObjective, rollingText, analysis, { embedSkeleton: techChanged, level: "l1" });
-    }
-    else {
-        prompt = compileGeneric(request, goalId, active, loopObjective, rollingText, analysis, referenceFile, technique, { embedSkeleton: techChanged, level: "l1" });
-    }
-    // ── P4: Progress Dashboard ───────────────────────────────────────────
-    const progressDashboard = (evidence && loopObjective)
-        ? buildProgressDashboard(evidence, loopObjective, vaultContext, request.loop_id, request.round, /* showTrend */ false)
-        : "";
-    // ── v1.14: Render state file ─────────────────────────────────────────
-    const sfPolicy = getPolicy().state_file;
-    let stateFileContent;
-    if (sfPolicy.enabled) {
-        const allCheckpoints = collectVaultCheckpoints(vaultContext, request.loop_id);
-        const delegationSummary = vaultContext
-            ? buildDelegationSummary(vaultContext)
-            : "";
-        stateFileContent = renderStateFile({
-            loopId: request.loop_id,
-            currentRound: request.round,
-            maxRounds: request.max_rounds ?? sfPolicy.max_summary_rounds * 2,
-            loopObjective,
-            rollingSummary,
-            constraints: active,
-            retiredConstraints: retired,
-            checkpoints: allCheckpoints,
-            delegationSummary,
-            progressDashboard,
-            externalContext: request.external_context,
-        });
-        prompt = renderStateFilePointer(request.loop_id) + "\n" + prompt;
-    }
-    // ── Build thin diff ──────────────────────────────────────────────────
-    const violations = lr?.constraint_violations ?? [];
-    const diffParts = [];
-    if (request.constraints_from_plan.length) {
-        diffParts.push(`new constraints: [${request.constraints_from_plan.join(", ")}]`);
-    }
-    if (retired.length) {
-        diffParts.push(`retired constraints: [${retired.join(", ")}]`);
-    }
-    if (violations.length) {
-        diffParts.push(`violations: [${violations.join(", ")}]`);
-    }
-    if (request.new_since_last_round) {
-        diffParts.push(`delta: ${request.new_since_last_round.slice(0, 200)}`);
-    }
-    // v1.14: When state file is enabled, progressDashboard lives in the state
-    // file (see renderStateFile above). Only inline it in the prompt when the
-    // state file is disabled — this keeps the prompt truly thin.
-    const finalPrompt = sfPolicy.enabled ? prompt : prompt + progressDashboard;
-    return makeLoopCompileResponse({
+export function compileLoop(request, context) {
+    const decision = levelDecision(request, context);
+    const previous = getPreviousRound(request.loop_id, request.round - 1, context);
+    const objective = evolveObjective(request, context);
+    const constraints = evolveConstraints(request, objective, previous);
+    const rolling = buildRollingSummary(request.loop_id, request.round, context);
+    const alignment = alignTask(request.task, request, context);
+    const health = checkLoopHealth(request.loop_id, { ...request, loop_objective: objective }, context);
+    const warnings = unique([
+        alignment.warning,
+        health.escalation_recommended !== "none"
+            ? `Loop health recommends ${health.escalation_recommended}.`
+            : "",
+    ]);
+    const response = makeLoopCompileResponse({
         status: AgentStatus.OK,
-        prompt: finalPrompt,
-        recompile_level: "l1",
-        diff_from_previous: diffParts.length ? diffParts.join("; ") : "L1 continue — state updated in file.",
+        recompile_level: decision.level,
+        diff_from_previous: decision.reasons.join(","),
         lineage: [`${request.loop_id}:r${request.round}`],
-        constraints_active: active,
-        constraints_retired: retired,
-        technique_used: technique,
-        reference_file: referenceFile,
-        rolling_summary: rollingSummary,
+        constraints_active: constraints.active,
+        constraints_retired: constraints.retired,
         loop_id: request.loop_id,
         round: request.round,
-        goal_id: goalId,
+        goal_id: deriveGoalId(request.loop_id, request.task, request.goal_id),
         goal_text_hash: computeGoalTextHash(request.task),
-        loop_objective: loopObjective,
+        loop_objective: objective,
+        loop_health: health,
+        task_alignment: alignment,
+        rolling_summary: rolling,
+        checkpoint_summary: checkpoint(request, constraints.active, constraints.retired),
+        suggested_next_task: request.last_round_result?.next_action?.trim() ||
+            request.last_round_result?.emerged_subtasks?.[0] || "",
         plan_source: request.plan_source,
-        suggested_next_task: suggestedNextTask,
         warnings,
-        state_file_content: stateFileContent,
     });
-}
-export function compileL2(request, vaultContext) {
-    const goalId = deriveGoalId(request.loop_id, request.task, request.goal_id);
-    // v1.15: L2 no longer auto-selects a technique. The Agent reads the technique
-    // catalog (skills/prompt-techniques/SKILL.md), freely chooses the best fit
-    // based on loop state, reads the corresponding reference file, and applies
-    // it directly to the task.
-    // v1.10: Checkpoint — load existing or build new from last round's self-eval
-    let checkpointSummary = null;
-    let checkpointRound = 0;
-    // Check if the last round declared a checkpoint
-    const lr = request.last_round_result;
-    if (lr?.compression_checkpoint === true) {
-        // Build fresh checkpoint from the last round's data
-        // Constraints haven't been updated yet at this point, but we snapshot the
-        // current state as seen by this compile call (pre-P5 correction).
-        // We defer building until constraints are finalized below.
-        checkpointRound = request.round - 1;
-    }
-    else if (request.round > 1) {
-        // No new checkpoint — try loading the previous one from vault
-        checkpointSummary = loadLatestCheckpoint(request.loop_id, request.round, vaultContext);
-        if (checkpointSummary) {
-            checkpointRound = checkpointSummary.declared_at_round;
-        }
-    }
-    // v3.5: Rolling summary — optionally scoped to post-checkpoint rounds
-    const rollingSummary = buildRollingSummary(request.loop_id, request.round, vaultContext, checkpointRound > 0 ? checkpointRound : undefined);
-    // P5c: Wrong assumptions — must be applied BEFORE formatting so they appear
-    // in the rendered cross-round summary text injected into the prompt.
-    if (lr?.wrong_assumptions?.length) {
-        if (rollingSummary) {
-            rollingSummary.key_outcomes = [
-                ...rollingSummary.key_outcomes,
-                ...lr.wrong_assumptions.map((a) => `Wrong assumption corrected: ${a}`),
-            ];
-        }
-    }
-    const rollingText = formatRollingSummaryForPrompt(rollingSummary);
-    // ── Loop Objective: create at round 1, load from vault at later rounds ──
-    let loopObjective = null;
-    if (request.round === 1) {
-        if (request.loop_objective) {
-            loopObjective = request.loop_objective;
-        }
-        else {
-            loopObjective = computeLoopObjectiveFromTask(request, vaultContext);
-        }
-    }
-    else {
-        // P1 fix: Load loop objective from vault for round > 1
-        const vaultLo = vaultGetLoopObjective(request.loop_id, vaultContext);
-        if (vaultLo) {
-            const loData = vaultLo.loop_objective;
-            if (loData) {
-                loopObjective = makeLoopObjective({
-                    objective: loData.objective ?? "",
-                    success_criteria: loData.success_criteria ?? [],
-                    hard_constraints: loData.hard_constraints ?? [],
-                    created_at_round: loData.created_at_round ?? 1,
-                    loop_id: loData.loop_id ?? request.loop_id,
-                    version: loData.version ?? 1,
-                    refinement_history: loData.refinement_history ?? [],
-                });
-            }
-        }
-        if (!loopObjective && request.loop_objective) {
-            loopObjective = request.loop_objective;
-        }
-    }
-    // ── P1: Apply objective refinement (shared) ──
-    loopObjective = applyObjectiveRefinement(loopObjective, lr, request.round);
-    // ── Build active constraints (base + LO) ──
-    let constraints = [...request.constraints_from_plan];
-    if (loopObjective) {
-        constraints = [
-            ...new Set([
-                ...constraints,
-                ...loopObjective.hard_constraints,
-                ...loopObjective.success_criteria,
-            ]),
-        ];
-    }
-    // ═══════════════════════════════════════════════════════════════════════════
-    // P0/P5: Constraint evolution (shared) — retractions/revisions BEFORE prompt
-    // ═══════════════════════════════════════════════════════════════════════════
-    const warnings = [];
-    const evoResult = applyConstraintEvolution(constraints, loopObjective, lr, request.round);
-    constraints = evoResult.constraints;
-    loopObjective = evoResult.loopObjective;
-    const retired = evoResult.retired;
-    // ── v1.10: Build checkpoint summary if last round declared one ──
-    if (checkpointRound > 0 && !checkpointSummary && lr) {
-        // checkpointRound was set but no summary yet → fresh declaration
-        // We need the self-eval from last round. It's embedded in lr fields.
-        // Build a synthetic SelfEvaluation from the last_round_result for the builder.
-        const synthEval = {
-            success: lr.success,
-            output_summary: lr.output_summary,
-            constraint_violations: lr.constraint_violations,
-            should_continue: true,
-            compression_checkpoint: true,
-            checkpoint_label: lr.checkpoint_label ?? "",
-        };
-        checkpointSummary = buildCheckpointSummary(synthEval, checkpointRound, constraints, retired);
-    }
-    // ── v1.15: Build L2 prompt with Technique Selection block ──
-    // The Agent freely chooses a technique by reading the catalog and reference
-    // files. LoopForge provides the loop state (objective, constraints, rolling
-    // summary) — the Agent provides the reasoning strategy.
-    let prompt = buildL2Prompt(request, goalId, constraints, loopObjective, rollingText);
-    // ── v1.10: Inject checkpoint block (before rolling summary in prompt) ──
-    // The checkpoint is rendered before the external context so it appears
-    // in a natural position: after Loop Objective, before Cross-Round Summary.
-    if (checkpointSummary) {
-        prompt += "\n" + formatCheckpointForPrompt(checkpointSummary);
-    }
-    // ── v1.7: Inject external memory context (L2 only) ──
     const policy = getPolicy();
-    if (policy.memory_injection.enabled && request.external_context) {
-        prompt += formatExternalContext(request.external_context, policy.memory_injection.section_title, policy.memory_injection.max_context_length);
-    }
-    // ── P2: Emerged subtasks → suggested next task ──
-    let suggestedNextTask = "";
-    if (request.last_round_result?.emerged_subtasks?.length) {
-        suggestedNextTask = request.last_round_result.emerged_subtasks
-            .slice(0, 3)
-            .join("; ");
-    }
-    // ═══════════════════════════════════════════════════════════════════════════
-    // P4: Consistency validation — cross-check agent claims
-    // ═══════════════════════════════════════════════════════════════════════════
-    const evidence = lr?.execution_evidence;
-    if (evidence) {
-        warnings.push(...runP4ConsistencyChecks(evidence, lr.output_summary, lr.success, loopObjective));
-    }
-    // ═══════════════════════════════════════════════════════════════════════════
-    // P4: Progress gradient — early stall detection
-    // ═══════════════════════════════════════════════════════════════════════════
-    if (evidence && vaultContext) {
-        const prevEvidence = getPreviousRoundEvidence(request.loop_id, request.round - 1, vaultContext);
-        if (prevEvidence) {
-            const delta = evidence.progress_estimate - prevEvidence.progress_estimate;
-            const policy = getPolicy();
-            const stallThreshold = policy.evolution?.progress_stall_threshold ?? 0.05;
-            const stallRounds = policy.evolution?.progress_stall_rounds ?? 2;
-            if (delta < stallThreshold && evidence.progress_estimate < 0.95) {
-                // Check how many consecutive rounds have been below threshold
-                const stallCount = countProgressStallRounds(request.loop_id, request.round, vaultContext, stallThreshold);
-                if (stallCount >= stallRounds) {
-                    warnings.push(`P4: Progress has stalled — <${(stallThreshold * 100).toFixed(0)}% improvement for ${stallCount} consecutive rounds. Current: ${(evidence.progress_estimate * 100).toFixed(0)}%`);
-                }
-            }
-        }
-    }
-    // ═══════════════════════════════════════════════════════════════════════════
-    // P4: Build Progress Dashboard for prompt injection
-    // ═══════════════════════════════════════════════════════════════════════════
-    const progressDashboard = (evidence && loopObjective)
-        ? buildProgressDashboard(evidence, loopObjective, vaultContext, request.loop_id, request.round, /* showTrend */ true)
-        : "";
-    // ── v1.14: Render state file ──────────────────────────────────────────
-    // Collect all accumulated state and render it as a markdown snapshot.
-    // The caller writes this to .loopforge/state/{loopId}-state.md.
-    const sfPolicy = getPolicy().state_file;
-    let stateFileContent;
-    if (sfPolicy.enabled) {
-        const excludeRounds = checkpointSummary
-            ? new Set([checkpointSummary.declared_at_round])
-            : undefined;
-        const allCheckpoints = collectVaultCheckpoints(vaultContext, request.loop_id, excludeRounds);
-        if (checkpointSummary)
-            allCheckpoints.unshift(checkpointSummary);
-        const delegationSummary = vaultContext
-            ? buildDelegationSummary(vaultContext)
-            : "";
-        stateFileContent = renderStateFile({
-            loopId: request.loop_id,
-            currentRound: request.round,
-            maxRounds: request.max_rounds ?? sfPolicy.max_summary_rounds * 2,
-            loopObjective,
-            rollingSummary,
-            constraints,
-            retiredConstraints: retired,
-            checkpoints: allCheckpoints,
-            delegationSummary,
-            progressDashboard,
-            externalContext: request.external_context,
-        });
-        // Prepend state file pointer to the prompt
-        prompt = renderStateFilePointer(request.loop_id) + "\n" + prompt;
-    }
-    // v1.14: When state file is enabled, progressDashboard lives in the state
-    // file (see renderStateFile above). Only inline it in the prompt when the
-    // state file is disabled — this keeps the prompt truly thin.
-    const finalPrompt = sfPolicy.enabled ? prompt : prompt + progressDashboard;
-    return makeLoopCompileResponse({
-        status: AgentStatus.OK,
-        prompt: finalPrompt,
-        recompile_level: "l2",
-        diff_from_previous: request.round === 1 || request.plan_source
-            ? "Full recompile — new goal or first call."
-            : "Full recompile — goal_id changed or checkpoint boundary.",
-        lineage: [`${request.loop_id}:r${request.round}`],
-        constraints_active: constraints,
-        constraints_retired: retired,
-        technique_used: "agent-selected",
-        reference_file: `${SKILLS_DIR}/prompt-techniques/SKILL.md`,
-        rolling_summary: rollingSummary,
-        checkpoint_summary: checkpointSummary,
-        loop_id: request.loop_id,
-        round: request.round,
-        goal_id: goalId,
-        goal_text_hash: computeGoalTextHash(request.task),
-        loop_objective: loopObjective,
-        plan_source: request.plan_source,
-        suggested_next_task: suggestedNextTask,
-        warnings,
-        state_file_content: stateFileContent,
+    const statePath = `${policy.state_file.directory}/${request.loop_id}-state.md`;
+    const state = createCanonicalLoopState(request, response, statePath);
+    const markdown = renderCanonicalStateMarkdown(state);
+    const artifact = assemblePromptArtifact({
+        state,
+        level: decision.level,
+        reasons: decision.reasons,
+        mode: policy.prompt.injection_mode,
+        budgets: {
+            l0: policy.prompt.l0_max_chars,
+            l1: policy.prompt.l1_max_chars,
+            l2: policy.prompt.l2_max_chars,
+        },
+        attempt: request.attempt,
+        selfEvaluationBlock: buildSelfEvalBlock(request.round),
+        fullStateMarkdown: markdown,
     });
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// L2 Prompt Builder (v1.15 — Agent technique autonomy)
-// ═══════════════════════════════════════════════════════════════════════════
-/** Build the L2 restart prompt with a Technique Selection block.
- *  The Agent reads the technique catalog (SKILL.md), freely chooses the best
- *  technique based on loop state, reads the corresponding reference file, and
- *  applies it directly to the task. LoopForge provides context — the Agent
- *  provides the reasoning strategy. */
-function buildL2Prompt(request, goalId, constraints, loopObjective, rollingText) {
-    const ctx = {
-        request, goalId, constraints, loopObjective, rollingText, level: "l2",
-    };
-    const lines = [
-        `## LoopForge L2 Compile — Round ${request.round}`,
-        "",
-    ];
-    // Cross-round summary
-    if (rollingText) {
-        lines.push(rollingText);
-        lines.push("");
-    }
-    // Technique Selection — Agent freely chooses
-    lines.push("### Technique Selection", "", "This is a strategy restart point. Read the technique catalog to choose", "the best reasoning approach for this round:", "", `  \`${SKILLS_DIR}/prompt-techniques/SKILL.md\``, "", "Based on the loop state (state file + context below), freely select", "the technique that best fits this round's challenge. Then read the", "full reference for your chosen technique:", "", `  \`${SKILLS_DIR}/prompt-techniques/references/<chosen>.md\``, "", "Apply the technique's method directly to the task — do NOT generate", "an intermediate prompt. Execute the task using the chosen technique", "as your thinking framework.", "");
-    // Loop Objective
-    lines.push(...buildLoopObjectiveBlock(loopObjective));
-    // Active Constraints
-    lines.push(...buildConstraintsBlock(constraints));
-    // Plan Source
-    if (request.plan_source) {
-        lines.push(`**Plan Source**: ${request.plan_source}`);
-        lines.push("");
-    }
-    // Task
-    lines.push(...buildTaskBlock(ctx));
-    // Loop Identity
-    lines.push(...buildIdentityBlock(ctx));
-    return lines.join("\n");
-}
-function buildHeader(ctx, technique) {
-    const levelLabel = ctx.level.toUpperCase();
-    const lines = [
-        `## LoopForge ${levelLabel} Compile — Round ${ctx.request.round}`,
-        `**Technique**: ${technique} (embedded)`,
-        "",
-    ];
-    if (ctx.rollingText) {
-        lines.push(ctx.rollingText);
-        lines.push("");
-    }
-    return lines;
-}
-function buildLoopObjectiveBlock(lo) {
-    if (!lo)
-        return [];
-    const lines = [
-        "### Loop Objective (Anchor)",
-        `**Objective**: ${lo.objective}`,
-    ];
-    if (lo.success_criteria.length) {
-        lines.push("**Success Criteria**:");
-        for (const sc of lo.success_criteria)
-            lines.push(`- ${sc}`);
-    }
-    if (lo.hard_constraints.length) {
-        lines.push("**Hard Constraints**:");
-        for (const hc of lo.hard_constraints)
-            lines.push(`- ${hc}`);
-    }
-    lines.push("");
-    return lines;
-}
-function buildConstraintsBlock(constraints) {
-    if (!constraints.length)
-        return [];
-    const lines = ["### Active Constraints"];
-    for (const c of constraints)
-        lines.push(`- ${c}`);
-    lines.push("");
-    return lines;
-}
-function buildTaskBlock(ctx) {
-    const lines = [
-        "### Task",
-        ctx.request.task,
-        "",
-    ];
-    if (ctx.request.domain) {
-        lines.push(`**Domain**: ${ctx.request.domain}`);
-        lines.push("");
-    }
-    return lines;
-}
-function buildIdentityBlock(ctx) {
-    return [
-        "### Loop Identity",
-        `- Loop ID: \`${ctx.request.loop_id}\``,
-        `- Goal ID: \`${ctx.goalId}\``,
-        `- Round: ${ctx.request.round}`,
-        "",
-    ];
-}
-/** Generic compiler — reads technique reference file (fallback for zero-shot/few-shot/cot). */
-function compileGeneric(request, goalId, constraints, loopObjective, rollingText, analysis, referenceFile, technique, opts = {}) {
-    const embedSkeleton = opts.embedSkeleton !== false; // default true
-    const ctx = { request, goalId, constraints, loopObjective, rollingText, level: opts.level ?? "l2" };
-    const lines = [
-        ...buildHeader(ctx, technique),
-    ];
-    if (embedSkeleton) {
-        lines.push(`Read the technique reference BEFORE generating the prompt:`, `  Technique:  ${technique}`, `  Reference:  ${referenceFile}`, `  Rationale:  ${analysis.rationale}`, "");
-    }
-    else {
-        lines.push(`**Technique**: ${technique} (see state file for full reference)`, `**Rationale**: ${analysis.rationale}`, "");
-    }
-    lines.push(...buildLoopObjectiveBlock(loopObjective), ...buildConstraintsBlock(constraints), ...(request.plan_source ? [`**Plan Source**: ${request.plan_source}`, ""] : []), ...buildTaskBlock(ctx), ...buildIdentityBlock(ctx));
-    if (embedSkeleton) {
-        lines.push("### Generation Instructions", `1. Read \`${referenceFile}\` — study its structure rules, section count, and format requirements`, "2. Generate a complete prompt following that technique's structure", "3. The prompt must be self-contained — ready for a coding agent to execute", "4. Output only the generated prompt — no preamble, no meta-commentary");
-    }
-    return lines.join("\n");
-}
-// ── Step-Back specialist ───────────────────────────────────────────────────────
-function compileStepBack(request, goalId, constraints, loopObjective, rollingText, analysis, opts = {}) {
-    const embedSkeleton = opts.embedSkeleton !== false; // default true
-    const ctx = { request, goalId, constraints, loopObjective, rollingText, level: opts.level ?? "l2" };
-    const lines = [
-        ...buildHeader(ctx, "step-back"),
-        `**Rationale**: ${analysis.rationale}`,
-        "",
-    ];
-    if (embedSkeleton) {
-        lines.push("Generate a complete prompt using the **Step-Back** technique. Follow the 8-section skeleton below.", "Embed all structural constraints — do NOT reference an external file.", "");
-    }
-    else {
-        lines.push("**Technique**: step-back (see state file for the full skeleton).", "Generate a complete prompt following this technique.", "");
-    }
-    lines.push(...buildLoopObjectiveBlock(loopObjective), ...buildConstraintsBlock(constraints), ...(request.plan_source ? [`**Plan Source**: ${request.plan_source}`, ""] : []), ...buildTaskBlock(ctx), ...buildIdentityBlock(ctx));
-    if (embedSkeleton) {
-        lines.push("", "### 8-Section Skeleton (REQUIRED)", "", "| # | Section | Required | Notes |", "|---|---------|----------|-------|", "| 1 | 角色 | ✓ | Domain expert role appropriate to the task |", "| 2 | 任务 | ✓ | One-sentence task summary |", "| 3 | 输入 | ✓ | Target module/problem to analyse |", "| 4 | 输出格式 | ✓ | Numbered list of expected outputs |", "| 5 | **Step-Back 抽象框架** | ✓ | See format rules below |", "| 6 | 具体实现要求 | ✓ | MUST start with: **\"基于上述抽象框架，实现以下所有功能\"** |", "| 7 | 硬约束 | ✓ | Numbered list of hard constraints |", "| 8 | 生成要求 | ✓ | Acceptance criteria |", "", "### Section 5 — Step-Back 抽象框架 (CRITICAL)", "", "Must contain **2-3 abstract frameworks**. Each framework is an independent ASCII diagram.", "Frameworks are PARALLEL (peer-level), not sequential.", "", "Each framework format:", "```", "### 框架N：[Framework Name]", "", "[ASCII diagram with principles/formulas/classification tables/rule tables]", "", "Diagram content requirements:", "- Core principle/formula (e.g. \"Total = Σ(dimension × weight)\")", "- Component table (e.g. weight allocation table, type mapping table)", "- Rule description (e.g. \"Missing data dimensions use neutral value\")", "```", "", "**Tightening rules**:", "- The step-back question must be MORE ABSTRACT than the original problem, but cover all required information", "- Abstract ≠ vague. Use precise formulas, principles, standards, definitions, or causal mechanisms", "- Tighten to the MINIMUM generalisation layer that still covers the original problem", "- Reasoning must RETURN to the original problem — do not stay at the principle level", "", "**Section 6 transition sentence (MANDATORY)**:", "\"基于上述抽象框架，实现以下所有功能。\"", "", "### Generation Instructions", "1. Extract 2-3 abstract principles/frameworks from the task domain", "2. Build ASCII diagrams for each framework (formulas, tables, rules)", "3. Apply the abstraction back to the concrete task", "4. Verify: the generated prompt satisfies all structural rules in the skeleton above", "5. Output only the generated prompt — no preamble, no meta-commentary");
-    }
-    return lines.join("\n");
-}
-// ── Least-to-Most specialist ───────────────────────────────────────────────────
-function compileLeastToMost(request, goalId, constraints, loopObjective, rollingText, analysis, opts = {}) {
-    const embedSkeleton = opts.embedSkeleton !== false; // default true
-    const ctx = { request, goalId, constraints, loopObjective, rollingText, level: opts.level ?? "l2" };
-    const lines = [
-        ...buildHeader(ctx, "least-to-most"),
-        `**Rationale**: ${analysis.rationale}`,
-        "",
-    ];
-    if (embedSkeleton) {
-        lines.push("Generate a complete prompt using the **Least-to-Most** technique. Follow the 8-section skeleton below.", "Embed all structural constraints — do NOT reference an external file.", "");
-    }
-    else {
-        lines.push("**Technique**: least-to-most (see state file for the full skeleton).", "Generate a complete prompt following this technique.", "");
-    }
-    lines.push(...buildLoopObjectiveBlock(loopObjective), ...buildConstraintsBlock(constraints), ...(request.plan_source ? [`**Plan Source**: ${request.plan_source}`, ""] : []), ...buildTaskBlock(ctx), ...buildIdentityBlock(ctx));
-    if (embedSkeleton) {
-        lines.push("", "### 8-Section Skeleton (REQUIRED)", "", "| # | Section | Required | Notes |", "|---|---------|----------|-------|", "| 1 | 角色 | ✓ | Domain expert role appropriate to the task |", "| 2 | 任务 | ✓ | One-sentence task summary |", "| 3 | 输入 | ✓ | Target module |", "| 4 | 输出格式 | ✓ | Numbered list (e.g. \"1. DDL, 2. API, 3. Enum...\") |", "| 5 | **Least-to-Most 逐步推理框架** | ✓ | See format rules below |", "| 6 | 具体实现要求 | ✓ | Expand per output format list (NOT per sub-problem — sub-problems fully expanded in §5) |", "| 7 | 硬约束 | ✓ | Numbered list |", "| 8 | 生成要求 | ✓ | Acceptance criteria, must include: \"严格按照子问题顺序逐步实现\" |", "", "### Section 5 — Least-to-Most 逐步推理框架 (CRITICAL)", "", "Must contain **4-6 ordered sub-problems**. Each sub-problem format:", "", "```", "### 子问题 N：[Sub-problem Name]", "", "**目标：** [What this sub-problem solves, which prior sub-problem(s) it depends on]", "", "**要求：**", "- Specific requirement list", "- [If sub-problem involves enums/mapping tables, list them]", "", "---", "```", "", "**Critical rules**:", "- Sub-problem 1 is the SIMPLEST (e.g. \"Define enums and base data structures\")", "- Each sub-problem declares: \"基于子问题 N-1 的结论\"", "- The LAST sub-problem MUST be: **\"综合实现完整模块\"** — list all components to integrate", "- Sub-problems separated by `---`", "- Order goes from LEAST complex → MOST complex, dependency chain must be explicit", "- Each sub-problem must serve the original task — no unrelated steps", "- The final sub-problem must be equivalent to or directly address the original task", "", "### Generation Instructions", "1. Decompose the task into 4-6 ordered sub-problems with explicit dependencies", "2. Sub-problem 1 starts with the simplest building block (data structures, enums, base config)", "3. Each subsequent sub-problem builds on prior results", "4. Final sub-problem integrates all components into the complete module", "5. Verify: the generated prompt satisfies all structural rules in the skeleton above", "6. Output only the generated prompt — no preamble, no meta-commentary");
-    }
-    return lines.join("\n");
-}
-// ── Tree-of-Thought specialist ──────────────────────────────────────────────────
-function compileToT(request, goalId, constraints, loopObjective, rollingText, analysis, opts = {}) {
-    const embedSkeleton = opts.embedSkeleton !== false; // default true
-    const ctx = { request, goalId, constraints, loopObjective, rollingText, level: opts.level ?? "l2" };
-    const lines = [
-        ...buildHeader(ctx, "tree-of-thought"),
-        `**Rationale**: ${analysis.rationale}`,
-        "",
-    ];
-    if (embedSkeleton) {
-        lines.push("Generate a complete prompt using the **Tree-of-Thought** technique. Follow the 8-section skeleton below.", "Embed all structural constraints — do NOT reference an external file.", "");
-    }
-    else {
-        lines.push("**Technique**: tree-of-thought (see state file for the full skeleton).", "Generate a complete prompt following this technique.", "");
-    }
-    lines.push(...buildLoopObjectiveBlock(loopObjective), ...buildConstraintsBlock(constraints), ...(request.plan_source ? [`**Plan Source**: ${request.plan_source}`, ""] : []), ...buildTaskBlock(ctx), ...buildIdentityBlock(ctx));
-    if (embedSkeleton) {
-        lines.push("", "### 8-Section Skeleton (REQUIRED)", "", "| # | Section | Required | Notes |", "|---|---------|----------|-------|", "| 1 | 角色 | ✓ | Multi-path problem-solving expert; may introduce 3 expert personas |", "| 2 | 任务 | ✓ | One-sentence task summary |", "| 3 | 输入 | ✓ | High-risk complex problem |", "| 4 | 输出格式 | ✓ | \"先输出思维树过程，再输出最终答案/方案\" |", "| 5 | **思维树探索框架** | ✓ | See 3 sub-blocks below (REQUIRED) |", "| 6 | 具体实现要求 | ✓ | Expand per output format |", "| 7 | 硬约束 | ✓ | Include branch_count, max_depth, pruning rules, safety/performance constraints |", "| 8 | 生成要求 | ✓ | \"先探索多路径，再选择最优方案\" |", "", "### Section 5 — 思维树探索框架 (CRITICAL — 3 sub-blocks REQUIRED)", "", "**Sub-block A: Search Strategy Declaration**", "```", "搜索策略: [beam / dfs / expert-panel]", "分支数(branch_count): 2-4", "最大深度(max_depth): ≤3", "每轮保留数(keep_count): 1-2", "```", "Strategy selection guide:", "- **beam** (default): planning, creative, math search — generate multiple candidates per turn, keep top b", "- **dfs**: puzzles, constraint satisfaction, debugging — go deep on highest-score branch, backtrack on failure", "- **expert-panel**: 3+ experts each generate candidates, then cross-evaluate and revise", "", "**Sub-block B: Evaluation Criteria Table**", "| 标准 | 权重 | 说明 |", "|------|------|------|", "| 正确性 | 最高 | Logic/math correctness |", "| 可行性 | 高 | Can be actually implemented |", "| 约束匹配 | 高 | Satisfies hard constraints |", "| 性能 | 中 | Time/space efficiency |", "| 安全性 | 最高 | No vulnerabilities/privilege escalation |", "", "**Sub-block C: Thought Tree State Table Format**", "Require the model to output in this table format:", "```", "| 轮次 | 分支 | 候选方案 | 评估 | 决策 |", "|------|------|---------|------|------|", "| 1    | A    | [方案描述] | 评分/判断 | 保留/剪枝 |", "| 1    | B    | [方案描述] | 评分/判断 | 保留/剪枝 |", "| 1    | C    | [方案描述] | 评分/判断 | 保留/剪枝 |", "| 2    | A1   | [深入展开] | ... | ... |", "| ...  | ...  | ...       | ... | ... |", "", "最终选择: [最优方案 + 选择理由]", "```", "", "### Critical Rules", "- Hard constraints MUST be ranked FIRST in evaluation criteria", "- Branch count: 2-4, depth: ≤3 (prevents token explosion)", "- Every turn: generate multiple candidates → evaluate → keep/prune — never single-path", "- If all branches are low quality: backtrack to previous turn and regenerate", "- The core of ToT is NOT \"3 experts chatting\" — it's: candidate generation → state evaluation → search/prune → final selection", "- thought is a PUBLIC intermediate semantic unit, not hidden chain-of-thought", "- State table MUST have: round, branch ID, candidate description, evaluation score/judgment, keep/prune decision", "", "### Generation Instructions", "1. Select the appropriate search strategy (beam/dfs/expert-panel) based on task type", "2. Define 2-4 candidate approaches as initial branches", "3. Build evaluation criteria table with hard constraints ranked first", "4. Define the state table format for tracking exploration", "5. Set branch count and max depth to prevent token explosion", "6. Verify: the generated prompt satisfies all structural rules in the skeleton above", "7. Output only the generated prompt — no preamble, no meta-commentary");
-    }
-    return lines.join("\n");
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Self-Evaluation block (v1.1 — autonomous loop feedback)
-// ═══════════════════════════════════════════════════════════════════════════
-/** Build the standardized self-evaluation block appended to every compiled prompt.
- *  The agent MUST output a JSON self-evaluation between the delimiters.
- *  4 required fields + 3 optional evolution fields (P0–P2) —
- *  each consumed by at least one downstream function. */
-export function buildSelfEvalBlock(round) {
-    return [
-        "",
-        "### LoopForge Self-Evaluation (REQUIRED)",
-        "",
-        `You are completing Round ${round}. After finishing the task above, ` +
-            "you MUST output a self-evaluation in this exact format:",
-        "",
-        "```",
-        "---loopforge-eval",
-        "{",
-        '  "success": true,',
-        `  "output_summary": "<one paragraph — what was DONE in round ${round}, be specific>",`,
-        '  "constraint_violations": [],',
-        '  "should_continue": true,',
-        '  "discovered_constraints": [],',
-        '  "objective_refinement": "",',
-        '  "emerged_subtasks": [],',
-        '  "execution_evidence": {',
-        '    "files_changed": [],',
-        '    "test_results": {"passed": 0, "failed": 0, "skipped": 0},',
-        '    "success_criteria_met": [],',
-        '    "success_criteria_remaining": [],',
-        '    "progress_estimate": 0.0',
-        '  },',
-        '  "retracted_constraints": [],',
-        '  "revised_success_criteria": [],',
-        '  "wrong_assumptions": [],',
-        '  "compression_checkpoint": false,',
-        '  "checkpoint_label": ""',
-        "}",
-        "---end-loopforge-eval",
-        "```",
-        "",
-        "Field rules:",
-        `- success: true ONLY if all hard constraints were met and the task goal was achieved`,
-        `- output_summary: Be specific about what was PRODUCED, not what you "tried". ` +
-            `Bad: "worked on audit". Good: "Found 3 vulns: reentrancy in withdraw(), ` +
-            `integer overflow in transfer(), missing access control in mint()". ` +
-            `This feeds cross-round knowledge distillation.`,
-        `- constraint_violations: List ONLY constraints you actually broke. Empty array [] if none. ` +
-            `This directly affects constraint-integrity scoring and retirement decisions.`,
-        `- should_continue: false ONLY when the ENTIRE task is complete. ` +
-            `If there is more to audit/implement/test, say true. ` +
-            `This tells the autonomous runner when to stop.`,
-        `- discovered_constraints (P0 — optional): New constraints you discovered this round. ` +
-            `Omit or [] if none.`,
-        `- objective_refinement (P1 — optional): Deepened understanding of the task goal. ` +
-            `APPENDED to the original objective. Omit or "" if unchanged.`,
-        `- emerged_subtasks (P2 — optional): Sub-problems that surfaced during execution. ` +
-            `Omit or [] if none.`,
-        `- execution_evidence (P4 — recommended): Structured record of what you actually did. ` +
-            `files_changed: paths relative to project root. test_results: null if no tests run. ` +
-            `success_criteria_met/remaining: track against the Loop Objective. ` +
-            `progress_estimate: your honest estimate of overall completion (0.0 to 1.0). ` +
-            `This enables real progress tracking and early stall detection.`,
-        `- retracted_constraints (P5 — optional): Constraints you now believe are WRONG. ` +
-            `Removed from active guardrails. Only retract if you have evidence. Omit or [] if none.`,
-        `- revised_success_criteria (P5 — optional): Success criteria that need reformulation. ` +
-            `Array of {old, new} objects. Applied to the Loop Objective. Omit or [] if none.`,
-        `- wrong_assumptions (P5 — optional): Assumptions from earlier rounds that turned ` +
-            `out to be incorrect. Recorded as key lessons. Omit or [] if none.`,
-        `- compression_checkpoint (v1.10 — optional): Set to true when you have COMPLETED a ` +
-            `major subtask. The compiler will snapshot the current state (constraints, outcome) ` +
-            `into a persistent checkpoint that survives context-window eviction. ` +
-            `Use sparingly — only at genuine subtask boundaries, not every round. ` +
-            `Omit or false otherwise.`,
-        `- checkpoint_label (v1.10 — optional): Human-readable label for this checkpoint. ` +
-            `e.g. "数据模型层完成", "API layer complete", "Auth module done". ` +
-            `Used as the checkpoint heading in subsequent prompts. Only meaningful when ` +
-            `compression_checkpoint is true. Omit or "" otherwise.`,
-        `- The JSON MUST appear between the ---loopforge-eval and ---end-loopforge-eval markers`,
-        `- Do NOT wrap the markers in code fences — output them as raw text`,
-        "",
-    ].join("\n");
-}
-// ═══════════════════════════════════════════════════════════════════════════
-// Top-level compile — ties layers together
-// ═══════════════════════════════════════════════════════════════════════════
-export function compileLoop(request, vaultContext = null) {
-    // Layer 1: Decide compile level
-    const level = decideLevel(request, vaultContext);
-    // Compile at the decided level
-    let response;
-    if (level === "l0") {
-        response = compileL0(request, vaultContext);
-    }
-    else if (level === "l1") {
-        response = compileL1(request, vaultContext);
-    }
-    else {
-        response = compileL2(request, vaultContext);
-    }
-    // Layer 2: Compute advisories
-    const { warnings, suggestedNextTask, alignment, health } = computeAdvisories(request, vaultContext);
-    // Merge advisories into response (preserve P4 consistency warnings from L2)
-    response.warnings = [...(response.warnings || []), ...warnings];
-    // Only overwrite suggested_next_task from advisories if the compile function
-    // didn't already set one (e.g. L2 sets it from emerged_subtasks)
-    if (!response.suggested_next_task) {
-        response.suggested_next_task = suggestedNextTask;
-    }
-    response.task_alignment = alignment;
-    response.loop_health = health;
-    response.recompile_level = level;
-    // v1.1: Append self-evaluation block for autonomous loop feedback
-    response.prompt += buildSelfEvalBlock(request.round);
-    // Multi-agent: Inject delegation history if available
-    if (vaultContext) {
-        const delegationText = buildDelegationSummary(vaultContext);
-        if (delegationText) {
-            response.prompt += delegationText;
-        }
-    }
+    response.prompt = artifact.renderedPrompt;
+    response.prompt_artifact = artifact;
+    response.state_file_content = policy.state_file.enabled ? markdown : undefined;
     return response;
 }
 //# sourceMappingURL=loop-compiler.js.map