loopforge 2.11.0 → 3.0.0

package/README.md

@@ -1,71 +1,13 @@
-# LoopForge
+# LoopForge package
 
-**A context window is not memory. Memory needs a runtime.**
+LoopForge is a cognitive state runtime for AI coding agents. It keeps a long
+task's objective, constraints, evidence, decisions and recovery state stable
+across many Agent-driven rounds.
 
-> **v2.11.0** — `npm install -g loopforge`. Node.js ≥ 18. Zero runtime dependencies.
-> [中文文档](../README.zh-CN.md)
-
----
-
-## The real problems with long-horizon tasks
-
-Any AI coding agent, given a long enough task, hits three walls. Not because the model isn't smart enough. Not because the context window isn't large enough. These are **architectural** problems.
-
-### Problem 1: The summary cascade
-
-Context fills up → compress. Fills up again → compress again. The third compression is a summary of a summary of a summary. Every cycle evaporates information — critical constraints get silently deleted because the summarizer judged them "no longer relevant." Researchers found that after 3–4 summary cycles, constraint violation rates spike from 0% to 59%. The agent doesn't know what it forgot, because the forgetting itself was compressed away.
-
-### Problem 2: Self-correction doesn't work
-
-Models cannot reliably improve themselves through introspection — they talk themselves out of correct answers. Effective recovery requires an **external verifier** — an independent observer that doesn't share the agent's context, doesn't participate in its reasoning, and only looks at inputs and outputs.
-
-### Problem 3: Compound error (p^N)
-
-If each step succeeds with probability p, N sequential steps succeed with probability p^N. Frontier agents nail nearly 100% of tasks under 4 minutes but crater to under 10% on tasks over 4 hours. Small errors at each step become the correct input for the next step.
-
-**These three problems amplify each other. The summary cascade loses information → lost information becomes errors → the agent can't self-correct because those errors look reasonable within its own context.**
-
----
-
-## What LoopForge does about it
-
-LoopForge doesn't compete on context window size. It runs **outside** the agent and provides three things:
-
-### 1. Breaks the summary cascade: Vault → compile, not summary → summary
-
-Each round's self-evaluation is written to a **typed vault** (JSON documents). The next round's prompt is not generated from the previous prompt's summary — it's **recompiled from the vault**. Milestones aren't summaries of summaries; they're recomputed from raw vault entries. Constraints and criteria carry stable IDs (`c-XXXXXXXX`, `cr-XXXXXXXX`) for exact matching — no Jaccard guesswork.
-
-```
-❌ Traditional: prompt → summary → next prompt → re-summarize → … (information evaporates each cycle)
-✅ LoopForge:  prompt → vault entry → next prompt (recompiled from vault, zero evaporation)
-```
-
-### 2. External judgment: the perspective the agent cannot provide for itself
-
-The verification gate cross-checks every agent claim against independent evidence — Git snapshots, test runner output, explicit verification commands. The enforcement gate detects what the agent cannot self-diagnose:
-
-- R1: You claimed success but criteria remain unmet → **you're deceiving yourself**
-- R3: You claimed success with no verifiable evidence → **your claim is empty**
-- R4: You've been stuck for 3 rounds → **you're stalled and you don't know it**
-- R5: Your progress is exactly zero → **you're going through the motions**
-- R7: You said you'd do X but did Y → **your intent and actions are disconnected**
-
-**The agent cannot self-detect these. The agent is the system that produced those narratives. External judgment is necessary.**
-
-### 3. Walk back from dead ends
-
-Progress stall or flatline → roll back to the last clean round instead of terminating. A diagnosis of why the path failed is injected. The backtrack prompt includes concrete workspace restore commands — `git checkout -- . && git clean -fd` with affected file lists. The verification gate checks that the workspace was actually restored before the next submission. Valid discoveries from skipped rounds are preserved.
-
----
-
-## What LoopForge is not
-
-- ❌ **Not a memory system** — the state file is a derived view. The vault is truth. No RAG, no vector DB.
-- ❌ **Not a context compressor** — doesn't compress prompts, doesn't do smart summarization. Recompiles from vault, not from the previous prompt.
-- ❌ **Not a constraint tracker** — constraints are one signal the verification gate monitors. The core value is external judgment.
-- ❌ **Not a replacement for the agent** — the agent still reads code, edits files, runs tools, and decides how to reason. LoopForge owns the **round boundary**.
-
----
+The Agent remains the executor: it reads code, edits files, runs tools and
+decides how to reason. LoopForge is the external round boundary that checks
+claims, commits canonical facts and rebuilds the next prompt. It is not a model,
+scheduler, unattended worker or second planning system.
 
 ## Install
 
@@ -75,79 +17,154 @@ loopforge init --client claude
 claude mcp add loopforge -- npx loopforge mcp
 ```
 
-Works with Claude Code, Codex CLI, or any MCP-compatible client.
-
-The MCP server path (`loopforge mcp`) is the primary integration. It provides
-the full cognitive infrastructure: verification gate, enforcement gate,
-backtrack, evidence collection, and crash recovery. The engine is also
-available as a library for custom integrations.
-
----
-
-## Architecture
-
+For Codex use `loopforge init --client codex` and register the same MCP command.
+The generic initializer prints an MCP configuration fragment. The package
+requires Node.js 18 or newer and has zero runtime dependencies.
+
+## How a loop works
+
+1. The Agent calls `loopforge_start` with one objective and its hard constraints.
+2. LoopForge compiles a prompt from canonical state.
+3. The Agent executes that prompt and submits a structured `RoundReport`.
+4. Runtime evidence is checked, the round boundary is enforced, and the result is accepted, rejected, backtracked or stopped.
+5. If work remains, the next prompt is compiled again from committed facts.
+
+The report deliberately separates `outcome` (`success`, `partial`, `failed` or
+`blocked`) from `continuation` (`continue` or `stop`). This prevents a local
+round result from being mistaken for completion of the whole objective. The old
+`status` report and free-form evaluation text are not accepted at the public
+boundary.
+
+```json
+{
+  "format": "loopforge.round-report",
+  "outcome": "partial",
+  "continuation": "continue",
+  "summary": "Implemented the parser and ran focused tests.",
+  "violations": [],
+  "agentIntent": "Add parser regression coverage next",
+  "evidence": {"files": ["src/parser.ts"], "checks": [], "claims": [], "provenance": {}},
+  "discoveries": {"wrongAssumptions": [], "emergedWork": [], "facts": [], "newConstraints": []},
+  "subGoalEvents": {"completed": [], "blocked": [], "canceled": []}
+}
 ```
-┌─────────────────────────────────────────────────────┐
-│                  Agent executes round                 │
-│  Reads code · Edits files · Runs tools · Reasons      │
-└──────────────────────┬──────────────────────────────┘
-                       │ Agent submits SelfEvaluation
-                       ▼
-┌─────────────────────────────────────────────────────┐
-│               LoopForge round boundary                │
-│                                                       │
-│  Evidence → Verify → Enforce → Commit → Compile       │
-│  (Git/cmd) (11 checks) (7 rules) (vault)  (next)     │
-│                                                       │
-│  accept:  commit state, compile next round             │
-│  reject:  retry same round, zero state mutation        │
-│  backtrack: roll back to last clean round, restore     │
-│  terminate: persist terminal state                     │
-└──────────────────────┬──────────────────────────────┘
-                       │ Recompile prompt from vault
-                       ▼
-┌─────────────────────────────────────────────────────┐
-│             Vault (typed JSON persistence)            │
-│  loops/<id>/rounds/<n>.json · session.json · policy   │
-│  Source of truth. Not a summary chain.                 │
-└─────────────────────────────────────────────────────┘
-```
-
----
 
-## Key capabilities
-
-**Vault → compile, not summary → summary.** Every round's self-evaluation is written to the vault. The next prompt is recompiled from vault entries. Stable IDs (`c-` / `cr-` / `sg-XXXXXXXX`) enable exact constraint, criterion, and sub-goal matching — no Jaccard false positives.
-
-**External judgment.** The verification gate cross-checks agent claims against independent evidence. The enforcement gate detects cognitive integrity violations — progress stalls, intent-action gaps, empty success claims. The judge never shares the agent's context.
-
-**Model expresses information needs.** Each round, the agent tells the compiler: what to emphasize, which sections to expand, where it's confused. The compiler reorders within safety boundaries — mandatory sections untouched, budget respected.
-
-**Walk back from dead ends.** Progress stall → roll back to last clean round with a diagnosis. Workspace restore is prompted and verified — the next submission is rejected if files from skipped rounds are still dirty.
-
-**Substantive drift, not filler.** R7 accepts intentional pivots only when the clarification references concrete IDs or file paths. Three consecutive weak clarifications terminate the loop.
-
-**Thin prompt, fat state file.** L0 (retry) / L1 (continuation) / L2 (full rehydration) control density only — reasoning strategy belongs to the agent. Truth is in the vault.
-
-**Pause · Resume · Replay.** Cross-process session leases. Idempotent resume after interruption. Time-travel queries over committed rounds.
-
-**Nine MCP tools.** `start` · `next` · `status` · `stop` · `pause` · `list` · `replay` · `resume` · `health`. Every tool returns typed `structuredContent`.
-
-**Zero dependencies. Policy-driven.** Node.js stdlib only. All thresholds, budgets, and intervals live in `loop_policy.json`. 491 tests.
+`blocked` reports include a blocker. User decisions and external side effects
+must stop at a User Gate; an Agent-resolvable technical blocker may continue
+only with concrete evidence requirements.
+
+## State model and prompt artifact
+
+The package follows a single-source rule: Goal, RoundEvent, EvidenceEnvelope,
+Constraint, SubGoal and GateDecision are durable facts; phase history, Current
+Focus, Todo, Handoff, progress, failed patterns and prompt diagnostics are
+rebuildable projections, never a competing plan or persistence layer. Compiler
+responses keep those derived views in one `projection` object. The full model,
+the L0/L1/L2 prompt levels and the immutable prompt artifact are described in
+the [project README](https://github.com/kyrielrving11/LoopForge/blob/main/README.md)
+under “Canonical cognitive state” and “One prompt artifact per attempt”.
+
+The default store is `.loopforge`. Events are written through the canonical
+writer and receive a monotonic `event_sequence` within each loop. Prompt and
+state hashes make a restart or replay auditable. Markdown state is only a
+replaceable view, not the recovery truth.
+
+Evidence collection and recovery are asynchronous. A malformed report is an
+input error; corrupt JSON, an invalid event format, or a sequence gap is a
+`storage_corruption` error and is never auto-repaired. The configured
+`maxRounds` must be a positive integer no greater than the policy limit.
+
+## Verification, enforcement and gates
+
+Git evidence is enabled by default. Explicit command providers run with an
+executable and argument array (`shell: false`), bounded output, a timeout and a
+workspace path check; required command failures contradict an unsupported
+success claim. Agent claims remain `claimed` until a provider observes them —
+provenance is owned by the runtime, and criteria coverage comes from verified
+claims, never from a progress estimate. A successful report that requests a
+stop is accepted as completion only when a live evidence provider produced
+verifiable evidence; with no provider, completion stays unresolved.
+
+Gate checks use `GateActionDescriptor` to make risk explicit: production,
+credentials, data migration, publishing, payment, external communication,
+public API changes, irreversible actions and unknown authorization are User
+Gates; bounded, reversible, explicitly agent-allowed workspace work is an
+Agent Gate. Decisions bind to an `actionHash`, so changing an action
+invalidates an earlier approval.
+
+For the full decision semantics — what the gate detects, how enforcement
+decides accept, reject, backtrack and stop — see the corresponding sections in
+the [project README](https://github.com/kyrielrving11/LoopForge/blob/main/README.md).
+
+## Recovery semantics
+
+A rejected attempt is zero-commit: its report does not enter canonical state.
+`loopforge_retry` keeps the same logical round ID and increments the attempt;
+`loopforge_next` cannot bypass a rejection. `loopforge_backtrack` returns a
+bounded restore point and verification requirements but never changes workspace
+files. Pause and resume preserve the transaction across client or process
+boundaries. Stop records termination without deleting the vault.
+
+`agentIntent` is an optional, non-authoritative suggestion retained inside the
+report for audit and drift comparison. It never overwrites Current Focus, Todo,
+runtime progress, completion, or the compiler's Suggested Next Action.
+
+Terminal enforcement escalation is tracked per rule. A rule can issue one
+guided retry before a repeated hit terminates it; accepting progress or
+backtracking clears the active rejection episode.
+
+## MCP surface
+
+The server exposes exactly twelve Agent-driven tools:
+
+```text
+loopforge_start       loopforge_next        loopforge_retry
+loopforge_backtrack   loopforge_resume      loopforge_pause
+loopforge_stop        loopforge_status      loopforge_history
+loopforge_gate_check  loopforge_gate_resolve loopforge_audit
+```
 
----
+`status` combines session, loop and persisted-loop views. `history` combines
+single-round inspection and event-timeline replay with sequence pagination. The
+old `list`, `health`, `inspect` and `replay` MCP names are not aliases. MCP
+Tasks and background Agent execution are intentionally outside this package.
+
+## Long-horizon use
+
+LoopForge can support dozens or hundreds of explicit rounds, context
+compression, restart, rejection and backtrack because every prompt is compiled
+from durable facts rather than from a summary of the previous prompt. It does
+not keep an Agent running after the client task ends. Use one loop per clear
+objective; for a large roadmap, let the Agent carry explicit outcomes between
+independent loops instead of creating an endless session.
+
+## Reliability boundaries
+
+Malformed canonical reports are rejected without changing the current session,
+round or vault, so callers can retry the same logical round. Persistence
+failures are returned as errors and never become a successful or partial
+commit. Drift clarification requires an explanation and a runtime-verifiable
+anchor; agent waiver flags are not accepted. `loopforge doctor` diagnoses
+unknown, deprecated, type-invalid and removed policy keys. Automatic Git
+restore is intentionally not implemented. Persistence and evidence collection
+are asynchronous; corrupt JSON, invalid event formats and sequence gaps return
+`storage_corruption` instead of a partial status. `maxRounds` must be a positive
+integer within the configured policy limit.
 
 ## Development
 
 ```bash
 npm run check
 npm test
-npm pack --dry-run --json
+npm run build
+npm run verify:artifacts
+npm pack --dry-run --json --ignore-scripts
 ```
 
-The protocol schema in `../loopforge-protocol.json` is generated from `src/protocol.ts`. Do not edit it by hand.
-
----
+The schema in the repository's `loopforge-protocol.json` is generated from
+`src/protocol.ts`.
+Do not edit it by hand. `init` installs `skills/perception/SKILL.md` for the
+selected client and prints its MCP registration command.
 
 ## License
 

package/dist/canonical-event-writer.d.ts

@@ -0,0 +1,20 @@
+import type { LoopStore } from "./loop-store.js";
+import type { VaultEntry } from "./vault-types.js";
+/** Single write boundary for canonical loop events.
+ *
+ * Stores may provide their own atomic sequence allocator (FileLoopStore does),
+ * but the writer also assigns and validates sequences for lightweight test or
+ * embedding backends. Every runtime event therefore enters the Vault through
+ * one deterministic path.
+ */
+export declare class CanonicalEventWriter {
+    private readonly backend;
+    constructor(backend: LoopStore);
+    private allEntries;
+    private replaceExisting;
+    private existing;
+    append(entry: VaultEntry): VaultEntry;
+    appendBatch(entries: VaultEntry[]): VaultEntry[];
+    private assertSequence;
+}
+//# sourceMappingURL=canonical-event-writer.d.ts.map

package/dist/canonical-event-writer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonical-event-writer.d.ts","sourceRoot":"","sources":["../src/canonical-event-writer.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEnD;;;;;;GAMG;AACH,qBAAa,oBAAoB;IACnB,OAAO,CAAC,QAAQ,CAAC,OAAO;gBAAP,OAAO,EAAE,SAAS;IAE/C,OAAO,CAAC,UAAU;IAelB,OAAO,CAAC,eAAe;IAQvB,OAAO,CAAC,QAAQ;IAMhB,MAAM,CAAC,KAAK,EAAE,UAAU,GAAG,UAAU;IAkCrC,WAAW,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,UAAU,EAAE;IAuChD,OAAO,CAAC,cAAc;CAiBvB"}

package/dist/canonical-event-writer.js

@@ -0,0 +1,131 @@
+import { StorageCorruptionError } from "./loop-store.js";
+/** Single write boundary for canonical loop events.
+ *
+ * Stores may provide their own atomic sequence allocator (FileLoopStore does),
+ * but the writer also assigns and validates sequences for lightweight test or
+ * embedding backends. Every runtime event therefore enters the Vault through
+ * one deterministic path.
+ */
+export class CanonicalEventWriter {
+    backend;
+    constructor(backend) {
+        this.backend = backend;
+    }
+    allEntries() {
+        // Global replacement needs entries from every loop, including backends
+        // whose default query excludes canonical `:event` records. Keep this
+        // fallback centralized here; per-loop runtime reads use queryLoopEvents.
+        const entries = this.backend.listLoopIds()
+            .flatMap((loopId) => this.backend.queryLoopEvents(loopId));
+        const seen = new Set();
+        return entries.filter((entry) => {
+            const key = `${entry.task_id ?? entry.id ?? ""}:${entry.event_sequence ?? ""}`;
+            if (seen.has(key))
+                return false;
+            seen.add(key);
+            return true;
+        });
+    }
+    replaceExisting(loopId, updated) {
+        const all = this.allEntries();
+        const filtered = all.filter((candidate) => !(candidate.loop_id === loopId && candidate.task_id === updated.task_id));
+        const replacement = [...filtered, updated];
+        this.backend.replaceEntries(replacement);
+    }
+    existing(loopId) {
+        const entries = this.backend.queryLoopEvents(loopId);
+        this.assertSequence(loopId, entries);
+        return entries;
+    }
+    append(entry) {
+        const write = () => {
+            const loopId = entry.loop_id;
+            if (!loopId)
+                throw new Error("Canonical events require loop_id");
+            if (entry.loop_id !== loopId)
+                throw new StorageCorruptionError("sequence_cross_loop", loopId, loopId);
+            const existing = this.existing(loopId);
+            const prior = existing.find((candidate) => candidate.task_id === entry.task_id);
+            if (prior && Number.isInteger(prior.event_sequence)) {
+                const updated = { ...entry, event_sequence: prior.event_sequence };
+                const priorComparable = { ...prior, id: undefined, timestamp: undefined };
+                const updatedComparable = { ...updated, id: undefined, timestamp: undefined };
+                if (JSON.stringify(priorComparable) === JSON.stringify(updatedComparable))
+                    return prior;
+                this.replaceExisting(loopId, updated);
+                return updated;
+            }
+            const max = existing.reduce((value, candidate) => typeof candidate.event_sequence === "number" && Number.isInteger(candidate.event_sequence)
+                ? Math.max(value, candidate.event_sequence)
+                : value, 0);
+            const next = max + 1;
+            const sequenced = { ...entry, event_sequence: entry.event_sequence ?? next };
+            if (!Number.isInteger(sequenced.event_sequence) || sequenced.event_sequence < 1 ||
+                existing.some((candidate) => candidate.event_sequence === sequenced.event_sequence)) {
+                throw new StorageCorruptionError("sequence_duplicate", loopId, loopId, sequenced.event_sequence);
+            }
+            if (sequenced.event_sequence !== next) {
+                throw new StorageCorruptionError("sequence_gap", loopId, loopId, sequenced.event_sequence);
+            }
+            this.backend.appendEntry(sequenced);
+            return sequenced;
+        };
+        return this.backend.withLock(write);
+    }
+    appendBatch(entries) {
+        if (entries.length === 0)
+            return [];
+        const write = () => {
+            const loopIds = new Set(entries.map((entry) => entry.loop_id));
+            if (loopIds.size !== 1 || loopIds.has(undefined)) {
+                throw new Error("A canonical event batch must belong to one loop");
+            }
+            const loopId = [...loopIds][0];
+            const existing = this.existing(loopId);
+            const existingTaskIds = new Set(existing.map((candidate) => candidate.task_id).filter(Boolean));
+            const batchTaskIds = entries.map((entry) => entry.task_id).filter(Boolean);
+            if (batchTaskIds.length !== new Set(batchTaskIds).size ||
+                batchTaskIds.some((taskId) => existingTaskIds.has(taskId))) {
+                throw new Error(`Duplicate canonical task id in event batch for loop ${loopId}`);
+            }
+            const used = new Set(existing
+                .map((candidate) => candidate.event_sequence)
+                .filter((value) => typeof value === "number" && Number.isInteger(value)));
+            let next = existing.reduce((value, candidate) => typeof candidate.event_sequence === "number" && Number.isInteger(candidate.event_sequence)
+                ? Math.max(value, candidate.event_sequence)
+                : value, 0) + 1;
+            const sequenced = entries.map((entry) => ({ ...entry, event_sequence: entry.event_sequence ?? next++ }));
+            const seen = new Set();
+            for (const entry of sequenced) {
+                if (!Number.isInteger(entry.event_sequence) || used.has(entry.event_sequence) || seen.has(entry.event_sequence)) {
+                    throw new StorageCorruptionError("sequence_duplicate", loopId, loopId, entry.event_sequence);
+                }
+                if (entry.event_sequence !== (existing.length ? Math.max(...used) : 0) + 1 + seen.size) {
+                    throw new StorageCorruptionError("sequence_gap", loopId, loopId, entry.event_sequence);
+                }
+                seen.add(entry.event_sequence);
+            }
+            this.backend.appendEntries(sequenced);
+            return sequenced;
+        };
+        return this.backend.withLock(write);
+    }
+    assertSequence(loopId, entries) {
+        const sorted = [...entries].sort((a, b) => (a.event_sequence ?? 0) - (b.event_sequence ?? 0));
+        const seen = new Set();
+        for (let index = 0; index < sorted.length; index++) {
+            const sequence = sorted[index].event_sequence;
+            if (!Number.isInteger(sequence) || sequence < 1) {
+                throw new StorageCorruptionError("sequence_invalid", loopId, loopId, sequence);
+            }
+            if (seen.has(sequence)) {
+                throw new StorageCorruptionError("sequence_duplicate", loopId, loopId, sequence);
+            }
+            seen.add(sequence);
+            if (sequence !== index + 1) {
+                throw new StorageCorruptionError("sequence_gap", loopId, loopId, sequence);
+            }
+        }
+    }
+}
+//# sourceMappingURL=canonical-event-writer.js.map

package/dist/canonical-event-writer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"canonical-event-writer.js","sourceRoot":"","sources":["../src/canonical-event-writer.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,iBAAiB,CAAC;AAIzD;;;;;;GAMG;AACH,MAAM,OAAO,oBAAoB;IACF;IAA7B,YAA6B,OAAkB;QAAlB,YAAO,GAAP,OAAO,CAAW;IAAG,CAAC;IAE3C,UAAU;QAChB,uEAAuE;QACvE,qEAAqE;QACrE,yEAAyE;QACzE,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE;aACvC,OAAO,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;YAC9B,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,EAAE,IAAI,EAAE,IAAI,KAAK,CAAC,cAAc,IAAI,EAAE,EAAE,CAAC;YAC/E,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACd,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,eAAe,CAAC,MAAc,EAAE,OAAmB;QACzD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CACxC,CAAC,CAAC,SAAS,CAAC,OAAO,KAAK,MAAM,IAAI,SAAS,CAAC,OAAO,KAAK,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5E,MAAM,WAAW,GAAG,CAAC,GAAG,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC;IAC3C,CAAC;IAEO,QAAQ,CAAC,MAAc;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QACrD,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACrC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,MAAM,CAAC,KAAiB;QACtB,MAAM,KAAK,GAAG,GAAe,EAAE;YAC7B,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC;YAC7B,IAAI,CAAC,MAAM;gBAAE,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,CAAC;YACjE,IAAI,KAAK,CAAC,OAAO,KAAK,MAAM;gBAAE,MAAM,IAAI,sBAAsB,CAAC,qBAAqB,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;YACtG,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,OAAO,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC;YAChF,IAAI,KAAK,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,cAAc,CAAC,EAAE,CAAC;gBACpD,MAAM,OAAO,GAAG,EAAE,GAAG,KAAK,EAAE,cAAc,EAAE,KAAK,CAAC,cAAc,EAAE,CAAC;gBACnE,MAAM,eAAe,GAAG,EAAE,GAAG,KAAK,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;gBAC1E,MAAM,iBAAiB,GAAG,EAAE,GAAG,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,CAAC;gBAC9E,IAAI,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,iBAAiB,CAAC;oBAAE,OAAO,KAAK,CAAC;gBACxF,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;gBACtC,OAAO,OAAO,CAAC;YACjB,CAAC;YACD,MAAM,GAAG,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,CAC/C,OAAO,SAAS,CAAC,cAAc,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,cAAc,CAAC;gBACxF,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,cAAc,CAAC;gBAC3C,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAChB,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;YACrB,MAAM,SAAS,GAAG,EAAE,GAAG,KAAK,EAAE,cAAc,EAAE,KAAK,CAAC,cAAc,IAAI,IAAI,EAAE,CAAC;YAC7E,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,SAAS,CAAC,cAAc,GAAG,CAAC;gBAC3E,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,cAAc,KAAK,SAAS,CAAC,cAAc,CAAC,EAAE,CAAC;gBACxF,MAAM,IAAI,sBAAsB,CAAC,oBAAoB,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,cAAc,CAAC,CAAC;YACnG,CAAC;YACD,IAAI,SAAS,CAAC,cAAc,KAAK,IAAI,EAAE,CAAC;gBACtC,MAAM,IAAI,sBAAsB,CAAC,cAAc,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,cAAc,CAAC,CAAC;YAC7F,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;YACpC,OAAO,SAAS,CAAC;QACnB,CAAC,CAAC;QACF,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,WAAW,CAAC,OAAqB;QAC/B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,GAAiB,EAAE;YAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAC/D,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACjD,MAAM,IAAI,KAAK,CAAC,iDAAiD,CAAC,CAAC;YACrE,CAAC;YACD,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAW,CAAC;YACzC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACvC,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAChG,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC3E,IAAI,YAAY,CAAC,MAAM,KAAK,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC,IAAI;gBAClD,YAAY,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC;gBAC/D,MAAM,IAAI,KAAK,CAAC,uDAAuD,MAAM,EAAE,CAAC,CAAC;YACnF,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ;iBAC1B,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,cAAc,CAAC;iBAC5C,MAAM,CAAC,CAAC,KAAK,EAAmB,EAAE,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7F,IAAI,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,CAC9C,OAAO,SAAS,CAAC,cAAc,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,cAAc,CAAC;gBACxF,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,cAAc,CAAC;gBAC3C,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YACpB,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,cAAc,EAAE,KAAK,CAAC,cAAc,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;YACzG,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;YAC/B,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;gBAC9B,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,cAAwB,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,cAAwB,CAAC,EAAE,CAAC;oBACpI,MAAM,IAAI,sBAAsB,CAAC,oBAAoB,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;gBAC/F,CAAC;gBACD,IAAI,KAAK,CAAC,cAAc,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;oBACvF,MAAM,IAAI,sBAAsB,CAAC,cAAc,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;gBACzF,CAAC;gBACD,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,cAAwB,CAAC,CAAC;YAC3C,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;YACtC,OAAO,SAAS,CAAC;QACnB,CAAC,CAAC;QACF,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAEO,cAAc,CAAC,MAAc,EAAE,OAAqB;QAC1D,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9F,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YACnD,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,cAAc,CAAC;YAC9C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAK,QAAmB,GAAG,CAAC,EAAE,CAAC;gBAC5D,MAAM,IAAI,sBAAsB,CAAC,kBAAkB,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YACjF,CAAC;YACD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAkB,CAAC,EAAE,CAAC;gBACjC,MAAM,IAAI,sBAAsB,CAAC,oBAAoB,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YACnF,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,QAAkB,CAAC,CAAC;YAC7B,IAAI,QAAQ,KAAK,KAAK,GAAG,CAAC,EAAE,CAAC;gBAC3B,MAAM,IAAI,sBAAsB,CAAC,cAAc,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC7E,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

package/dist/canonical-state.d.ts

@@ -3,17 +3,16 @@
  * The canonical state is data, not Markdown. Prompt and state-file renderers
  * consume the same value so they cannot silently drift apart.
  */
-import type { ConstraintMeta, LoopCompileRequest, LoopCompileResponse, MilestoneSummary, SubGoal, VerificationFlag } from "./protocol.js";
-export declare const CANONICAL_STATE_SCHEMA_VERSION: 1;
+import type { ConstraintMeta, LoopCompileRequest, LoopCompileResponse, SubGoal, VerificationFlag, DerivedGate, HandoffProjection, PhaseHistoryEntry, TodoProjection } from "./protocol.js";
+export declare const CANONICAL_STATE_FORMAT: "loopforge.state";
 export interface CanonicalLoopState {
-    schemaVersion: typeof CANONICAL_STATE_SCHEMA_VERSION;
+    format: "loopforge.state";
     loopId: string;
     round: number;
     maxRounds: number;
     goalId: string;
     objective: string;
     objectiveVersion: number;
-    currentTask: string;
     successCriteria: string[];
     hardConstraints: string[];
     activeConstraints: string[];
@@ -27,20 +26,9 @@ export interface CanonicalLoopState {
     blockers: string[];
     verificationFlags: VerificationFlag[];
     discoveries: string[];
-    nextAction: string;
     rollingOutcomes: string[];
     recurringIssues: string[];
     failedPatterns: string[];
-    /** v2.6: derived from agent_declared milestones. */
-    checkpoints: Array<{
-        label: string;
-        declared_at_round: number;
-        outcome: string;
-        carried_constraints: string[];
-        resolved_constraints: string[];
-    }>;
-    /** v2.1: Phase-boundary milestone summaries that survive window eviction. */
-    milestones: MilestoneSummary[];
     /** v2.1: Single-paragraph loop-level synthesis (formulaic). */
     loopSynthesis: string;
     /** v2.2: Structured sub-goals with compiler-managed lifecycle. */
@@ -49,7 +37,6 @@ export interface CanonicalLoopState {
     agentTrustScore: number | undefined;
     /** v2.5: Trust trend over last 10 rounds. */
     agentTrustTrend: number[];
-    suggestedNextTask: string;
     externalContext: string;
     stateFilePath: string;
     progress: {
@@ -63,6 +50,23 @@ export interface CanonicalLoopState {
             skipped: number;
         } | null;
     };
+    /** Derived obligations that must be rechecked after a change. */
+    regressionObligations: Array<{
+        id: string;
+        description: string;
+        sourceRound: number;
+        evidenceRefs: string[];
+        status: "open" | "satisfied" | "contradicted";
+    }>;
+    /** Derived views. They are rebuilt on every compile and are not a
+     * second transaction truth. */
+    phaseHistory: PhaseHistoryEntry[];
+    currentFocus: string;
+    todoProjection: TodoProjection | null;
+    suggestedNextAction: string;
+    activeGate: DerivedGate | null;
+    stateFreshness: "fresh" | "stale" | "missing";
+    handoff: HandoffProjection;
 }
 /** Deterministic JSON serialization used by state and prompt hashes. */
 export declare function stableStringify(value: unknown): string;

package/dist/canonical-state.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"canonical-state.d.ts","sourceRoot":"","sources":["../src/canonical-state.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,KAAK,EACV,cAAc,EACd,kBAAkB,EAClB,mBAAmB,EACnB,gBAAgB,EAChB,OAAO,EACP,gBAAgB,EACjB,MAAM,eAAe,CAAC;AAIvB,eAAO,MAAM,8BAA8B,EAAG,CAAU,CAAC;AAEzD,MAAM,WAAW,kBAAkB;IACjC,aAAa,EAAE,OAAO,8BAA8B,CAAC;IACrD,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,CAAC;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,wEAAwE;IACxE,mBAAmB,EAAE,MAAM,EAAE,CAAC;IAC9B,+CAA+C;IAC/C,kBAAkB,EAAE,cAAc,EAAE,CAAC;IACrC,qBAAqB,EAAE,MAAM,EAAE,CAAC;IAChC,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;IACtC,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,oDAAoD;IACpD,WAAW,EAAE,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,iBAAiB,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,mBAAmB,EAAE,MAAM,EAAE,CAAC;QAAC,oBAAoB,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IACjJ,6EAA6E;IAC7E,UAAU,EAAE,gBAAgB,EAAE,CAAC;IAC/B,+DAA+D;IAC/D,aAAa,EAAE,MAAM,CAAC;IACtB,kEAAkE;IAClE,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,8DAA8D;IAC9D,eAAe,EAAE,MAAM,GAAG,SAAS,CAAC;IACpC,6CAA6C;IAC7C,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,iBAAiB,EAAE,MAAM,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE;QACR,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;QACxB,WAAW,EAAE,MAAM,EAAE,CAAC;QACtB,iBAAiB,EAAE,MAAM,EAAE,CAAC;QAC5B,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,KAAK,EAAE;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,GAAG,IAAI,CAAC;KACnE,CAAC;CACH;AAID,wEAAwE;AACxE,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAYtD;AAED,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,kBAAkB,GAAG,MAAM,CAEpE;AA4CD;kEACkE;AAClE,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,kBAAkB,GAAG,MAAM,CAgK9E;AAED,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,kBAAkB,EAC3B,QAAQ,EAAE,mBAAmB,EAC7B,aAAa,EAAE,MAAM,GACpB,kBAAkB,CAiFpB"}
+{"version":3,"file":"canonical-state.d.ts","sourceRoot":"","sources":["../src/canonical-state.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH,OAAO,KAAK,EACV,cAAc,EACd,kBAAkB,EAClB,mBAAmB,EACnB,OAAO,EACP,gBAAgB,EAChB,WAAW,EACX,iBAAiB,EACjB,iBAAiB,EACjB,cAAc,EACf,MAAM,eAAe,CAAC;AAKvB,eAAO,MAAM,sBAAsB,EAAG,iBAA0B,CAAC;AAEjE,MAAM,WAAW,kBAAkB;IACjC,MAAM,EAAE,iBAAiB,CAAC;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,MAAM,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,gBAAgB,EAAE,MAAM,CAAC;IACzB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,wEAAwE;IACxE,mBAAmB,EAAE,MAAM,EAAE,CAAC;IAC9B,+CAA+C;IAC/C,kBAAkB,EAAE,cAAc,EAAE,CAAC;IACrC,qBAAqB,EAAE,MAAM,EAAE,CAAC;IAChC,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;IACtC,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,+DAA+D;IAC/D,aAAa,EAAE,MAAM,CAAC;IACtB,kEAAkE;IAClE,QAAQ,EAAE,OAAO,EAAE,CAAC;IACpB,8DAA8D;IAC9D,eAAe,EAAE,MAAM,GAAG,SAAS,CAAC;IACpC,6CAA6C;IAC7C,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;IACtB,QAAQ,EAAE;QACR,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;QACxB,WAAW,EAAE,MAAM,EAAE,CAAC;QACtB,iBAAiB,EAAE,MAAM,EAAE,CAAC;QAC5B,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,KAAK,EAAE;YAAE,MAAM,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAC;YAAC,OAAO,EAAE,MAAM,CAAA;SAAE,GAAG,IAAI,CAAC;KACnE,CAAC;IACF,iEAAiE;IACjE,qBAAqB,EAAE,KAAK,CAAC;QAC3B,EAAE,EAAE,MAAM,CAAC;QACX,WAAW,EAAE,MAAM,CAAC;QACpB,WAAW,EAAE,MAAM,CAAC;QACpB,YAAY,EAAE,MAAM,EAAE,CAAC;QACvB,MAAM,EAAE,MAAM,GAAG,WAAW,GAAG,cAAc,CAAC;KAC/C,CAAC,CAAC;IACH;mCAC+B;IAC/B,YAAY,EAAE,iBAAiB,EAAE,CAAC;IAClC,YAAY,EAAE,MAAM,CAAC;IACrB,cAAc,EAAE,cAAc,GAAG,IAAI,CAAC;IACtC,mBAAmB,EAAE,MAAM,CAAC;IAC5B,UAAU,EAAE,WAAW,GAAG,IAAI,CAAC;IAC/B,cAAc,EAAE,OAAO,GAAG,OAAO,GAAG,SAAS,CAAC;IAC9C,OAAO,EAAE,iBAAiB,CAAC;CAC5B;AAID,wEAAwE;AACxE,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAYtD;AAED,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,kBAAkB,GAAG,MAAM,CAEpE;AAwCD;kEACkE;AAClE,wBAAgB,4BAA4B,CAAC,KAAK,EAAE,kBAAkB,GAAG,MAAM,CAyK9E;AAED,wBAAgB,wBAAwB,CACtC,OAAO,EAAE,kBAAkB,EAC3B,QAAQ,EAAE,mBAAmB,EAC7B,aAAa,EAAE,MAAM,GACpB,kBAAkB,CAqMpB"}