@skillstate/core 0.0.1 → 2.0.0

package/dist/runtime.js

@@ -0,0 +1,362 @@
+import { StateManager } from './state-manager.js';
+import { PromptTransformer } from './prompt-transformer.js';
+import { withRetry, withTimeout } from './resilience.js';
+import { clone } from './clock.js';
+/**
+ * @non-paper rejection reason when `run()` trips a char budget. Carries
+ * the committed prefix (`partialResults`, WITHOUT the exceeding step —
+ * the trip rolls its state and tracker entry back) so callers can resume
+ * or report deterministically.
+ */
+export class BudgetExceededError extends Error {
+    maxChars;
+    totalChars;
+    partialResults;
+    constructor(maxChars, totalChars, partialResults) {
+        super(`Char budget exceeded: ${totalChars} > ${maxChars}`);
+        this.name = 'BudgetExceededError';
+        this.maxChars = maxChars;
+        this.totalChars = totalChars;
+        this.partialResults = partialResults;
+    }
+}
+/** Deterministic fallback action when the patch is rejected after all retries. */
+const INVALID_PATCH_ACTION = '__invalid_patch__';
+const DEFAULT_MAX_VALIDATION_RETRIES = 2;
+const DEFAULT_MAX_STEPS = 100;
+const FENCE_MARKER = '```json';
+/**
+ * @non-paper: `withTimeout` needs a numeric deadline, so signal-only waits
+ * use the max setTimeout delay — effectively no timeout. The timer is
+ * cleared on settle, so the process never actually waits this long.
+ */
+const SIGNAL_ONLY_TIMEOUT_MS = 0x7fffffff;
+/**
+ * Reasoning (Rt) is everything before the response's JSON fence. It is
+ * returned to the caller but NEVER stored in state (§3.2: Rt discarded
+ * permanently). Only called on responses that parsed successfully, so the
+ * fence exists.
+ */
+function extractReasoning(response) {
+    return response.slice(0, response.indexOf(FENCE_MARKER)).trim();
+}
+/**
+ * Re-prompt after a failed attempt (paper §7): same prompt plus corrective
+ * feedback appended. Malformed outputs cannot corrupt Σt (Limitations) —
+ * the state is only ever replaced by a validated merge.
+ */
+function withRetryFeedback(prompt, reason) {
+    return `${prompt}\n\nYour previous response was invalid: ${reason}. Respond again. Reasoning is discarded; respond with the JSON block with exactly these two keys: state_patch and action.`;
+}
+/**
+ * Algorithm 1 runtime (paper §3.2) with the §7 rollback-retry cycle.
+ *
+ * Each step: format the paper-exact prompt At = (P, Σt, Ot), call the LLM,
+ * parse the response (Rt, ΔΣt, at), validate ΔΣt against the schema, merge
+ * it (Σt+1 = Σt ⊕ ΔΣt), and execute the action. The model never receives
+ * previous observations, actions, or reasoning (§3). Failed attempts
+ * re-prompt with corrective feedback; after exhausting retries the step
+ * fails deterministically — the state is left untouched and the action
+ * becomes `__invalid_patch__`.
+ *
+ * Reasoning is returned but never stored, and merged states are fresh
+ * objects, so a rejected patch can never leak into state (rollback is free).
+ */
+export class SkillStateRuntime {
+    spec;
+    llm;
+    execute;
+    tracker;
+    maxValidationRetries;
+    timeoutMs;
+    signal;
+    retry;
+    clock;
+    events;
+    logger;
+    tokenBudget;
+    charsBudget;
+    transformer = new PromptTransformer();
+    currentState;
+    stepCounter = 0;
+    constructor(options) {
+        this.spec = options.spec;
+        this.llm = options.llm;
+        this.execute = options.execute;
+        this.tracker = options.tracker;
+        this.maxValidationRetries =
+            options.maxValidationRetries ?? DEFAULT_MAX_VALIDATION_RETRIES;
+        this.timeoutMs = options.timeoutMs;
+        this.signal = options.signal;
+        this.retry = options.retry;
+        this.clock = options.clock;
+        this.events = options.events;
+        this.logger = options.logger;
+        this.tokenBudget = options.tokenBudget;
+        this.charsBudget = options.charsBudget;
+        this.currentState = options.initialState
+            ? structuredClone(options.initialState)
+            : StateManager.createInitialState(options.spec.schema);
+    }
+    /** Current state Σt (read-only copy). */
+    get state() {
+        return structuredClone(this.currentState);
+    }
+    /**
+     * @non-paper resilience wrapper (additive, opt-in).
+     *
+     * Paper path: no `timeoutMs`/`signal`/`retry` options — `fn` is invoked
+     * directly, byte-for-byte the paper behavior (no timer, no extra attempt).
+     * Resilience path: the call is threaded through `withTimeout` (deadline
+     * and/or abort) and, when `retry` is set, transient throws are re-issued
+     * via `withRetry`. Validation-retry (§7) semantics above this are
+     * unchanged: a TRANSPORT throw still propagates out of `step` exactly as
+     * a throwing `llm`/`execute` did before.
+     */
+    invokeResilient(fn) {
+        if (this.timeoutMs === undefined &&
+            this.signal === undefined &&
+            this.retry === undefined) {
+            return fn();
+        }
+        const attempt = () => {
+            const pending = fn();
+            if (this.timeoutMs === undefined && this.signal === undefined) {
+                return pending;
+            }
+            return withTimeout(pending, this.timeoutMs ?? SIGNAL_ONLY_TIMEOUT_MS, this.signal);
+        };
+        if (this.retry === undefined) {
+            return attempt();
+        }
+        return withRetry(attempt, this.retry);
+    }
+    /**
+     * @non-paper LLM dispatch (Wave 4 DX, additive).
+     *
+     * Paper path: `llm` is a legacy `LLMFn` — called verbatim with the
+     * prompt, exactly as before. Provider path: `llm.call(prompt, opts?)`
+     * is used instead, forwarding the runtime `signal?` so aborts reach
+     * the provider; both paths stay inside `invokeResilient`, so the
+     * `timeoutMs`/`signal`/`retry` transport semantics are identical.
+     */
+    invokeLLM(prompt) {
+        const llm = this.llm;
+        if (typeof llm === 'function') {
+            return this.invokeResilient(async () => ({ text: await llm(prompt) }));
+        }
+        const opts = this.signal !== undefined ? { signal: this.signal } : undefined;
+        return this.invokeResilient(() => llm.call(prompt, opts));
+    }
+    /**
+     * @non-paper timestamp source: injected `clock` or `Date.now()`.
+     * The default path is exactly the paper core's `Date.now()`.
+     */
+    now() {
+        return this.clock?.now() ?? Date.now();
+    }
+    /** @non-paper: first defined budget cap wins (run-level beats ctor-level). */
+    resolveMaxChars(runOpts) {
+        return (runOpts?.maxChars ??
+            runOpts?.tokenBudget?.maxChars ??
+            runOpts?.charsBudget?.maxChars ??
+            this.tokenBudget?.maxChars ??
+            this.charsBudget?.maxChars);
+    }
+    /** @non-paper: tracker total when tracked, local tally otherwise. */
+    currentTotalChars(localTotal) {
+        return this.tracker?.getBookkeeping().totalChars ?? localTotal;
+    }
+    /**
+     * Execute one Algorithm 1 step for observation Ot.
+     *
+     * Paper-exact Algorithm 1 + §7 rollback-retry; the @non-paper
+     * `events`/`logger` options only OBSERVE (emitted payloads never feed
+     * back into prompts, merges, or validation).
+     */
+    async step(observation) {
+        this.stepCounter += 1;
+        const stepNumber = this.stepCounter;
+        this.events?.emit('step:start', { step: stepNumber, observation });
+        try {
+            // 1. Construct the prompt At = (P, Σt, Ot) — paper-exact format.
+            // The observation is passed through verbatim: no trimming, no size
+            // rejection. The O(1) footprint is a property of the method (no
+            // history is ever re-sent), not of input caps.
+            const basePrompt = this.transformer.formatPaper(this.spec, this.currentState, observation);
+            const maxAttempts = 1 + this.maxValidationRetries;
+            let prompt = basePrompt;
+            let response = '';
+            let lastError = '';
+            let attempts = 0;
+            let accepted = null;
+            let responseChars = 0;
+            let promptCharsOverride;
+            // 2-4. Call the LLM, parse, validate — retrying with corrective feedback
+            // on parse or validation failure (§7 rollback-retry cycle).
+            while (attempts < maxAttempts) {
+                attempts += 1;
+                const produced = await this.invokeLLM(prompt);
+                response = produced.text;
+                const usage = produced.usage;
+                if (promptCharsOverride === undefined && usage?.promptChars !== undefined) {
+                    promptCharsOverride = usage.promptChars;
+                }
+                responseChars += usage?.completionChars ?? response.length;
+                const parsed = this.transformer.parseResponse(response);
+                if (parsed.ok) {
+                    const validation = StateManager.validatePatch(this.spec.schema, parsed.patch);
+                    if (validation.valid) {
+                        accepted = {
+                            patch: parsed.patch,
+                            action: parsed.action,
+                            reasoning: extractReasoning(response),
+                        };
+                        break;
+                    }
+                    else {
+                        lastError = validation.error;
+                    }
+                }
+                else {
+                    lastError = parsed.detail ?? parsed.reason;
+                }
+                prompt = withRetryFeedback(basePrompt, lastError);
+            }
+            // 5. On success: Σt+1 = Σt ⊕ ΔΣt. On exhaustion: state UNCHANGED —
+            // immutability makes rollback free (there is nothing to undo).
+            const invalidated = accepted === null;
+            const patch = accepted === null ? {} : accepted.patch;
+            const action = accepted === null ? INVALID_PATCH_ACTION : accepted.action;
+            const reasoning = accepted === null ? '' : accepted.reasoning;
+            const newState = accepted === null
+                ? this.currentState
+                : StateManager.mergeState(this.currentState, accepted.patch);
+            // 6. Execute at → new observation (synthesized error observation on
+            // exhaustion; the sentinel action is never executed).
+            const newObservation = accepted === null
+                ? {
+                    content: `Invalid state patch after ${attempts} attempts: ${lastError}`,
+                    timestamp: this.now(),
+                    source: 'skillstate',
+                }
+                : await this.invokeResilient(() => this.execute(action, newState));
+            // 7. Record the step in the tracker. Sizes are raw string CHARS (§4.3):
+            // promptChars is |At| — measured, unless a provider reported
+            // `usage.promptChars` (preferred verbatim); responseChars accumulates
+            // every attempt's raw response (`usage.completionChars` when reported).
+            // No tokenizer, no estimates, no retry-separate accounting.
+            const promptChars = promptCharsOverride ?? basePrompt.length;
+            this.tracker?.recordStep({
+                step: stepNumber,
+                observation,
+                reasoning,
+                statePatch: patch,
+                action,
+                promptChars,
+                responseChars,
+                timestamp: this.now(),
+                success: !invalidated,
+            });
+            if (accepted !== null) {
+                this.currentState = newState;
+            }
+            // @non-paper observability (never feeds back into Algorithm 1).
+            this.events?.emit('step:end', { step: stepNumber, action, invalidated });
+            if (invalidated) {
+                this.events?.emit('step:error', { step: stepNumber, error: lastError });
+                this.logger?.warn('step:invalidated', { step: stepNumber, error: lastError });
+            }
+            else {
+                this.logger?.info('step:end', { step: stepNumber, action });
+            }
+            // 8. Return the step result (reasoning is returned, never stored)
+            return {
+                step: stepNumber,
+                observation,
+                reasoning,
+                statePatch: patch,
+                action,
+                newObservation,
+                newState,
+                validationAttempts: attempts,
+                invalidated,
+                promptChars,
+                responseChars,
+            };
+        }
+        catch (error) {
+            // @non-paper: transport throws (llm/execute, timeouts, aborts) still
+            // propagate exactly as before — observed first, never swallowed.
+            const message = error instanceof Error ? error.message : String(error);
+            this.events?.emit('step:error', { step: stepNumber, error: message });
+            this.logger?.error('step:error', { step: stepNumber, error: message });
+            throw error;
+        }
+    }
+    /**
+     * Run steps until isDone(result) is true or maxSteps is reached. Each
+     * step's input observation is the previous step's newObservation.
+     *
+     * @non-paper `runOpts`/constructor budgets cap cumulative CHARS
+     * (prompt+response, §4.3). On trip the exceeding step is rolled back —
+     * runtime state restored, its tracker entry truncated — and
+     * `BudgetExceededError` (with the committed prefix) is thrown alongside
+     * a `budget:exceeded` event. No budget = the paper-exact loop above,
+     * untouched.
+     */
+    async run(first, isDone, maxSteps = DEFAULT_MAX_STEPS, runOpts) {
+        const results = [];
+        const maxChars = this.resolveMaxChars(runOpts);
+        let localTotal = 0;
+        let observation = first;
+        for (let i = 0; i < maxSteps; i += 1) {
+            if (maxChars !== undefined &&
+                this.currentTotalChars(localTotal) > maxChars) {
+                // Resumed into an already-blown budget: stop before any new commit.
+                const total = this.currentTotalChars(localTotal);
+                this.events?.emit('budget:exceeded', {
+                    step: results.length + 1,
+                    totalChars: total,
+                    maxChars,
+                });
+                this.logger?.warn('budget:exceeded', {
+                    step: results.length + 1,
+                    totalChars: total,
+                    maxChars,
+                });
+                throw new BudgetExceededError(maxChars, total, results);
+            }
+            const trackerCountBefore = this.tracker?.getBookkeeping().stepCount ?? 0;
+            const stateBefore = clone(this.currentState);
+            const result = await this.step(observation);
+            const totalAfter = this.currentTotalChars(localTotal + result.promptChars + result.responseChars);
+            if (maxChars !== undefined && totalAfter > maxChars) {
+                // Roll back the exceeding step: no partial commit survives.
+                this.currentState = stateBefore;
+                this.tracker?.truncateTo(trackerCountBefore);
+                this.events?.emit('budget:exceeded', {
+                    step: result.step,
+                    totalChars: totalAfter,
+                    maxChars,
+                });
+                this.logger?.warn('budget:exceeded', {
+                    step: result.step,
+                    totalChars: totalAfter,
+                    maxChars,
+                });
+                throw new BudgetExceededError(maxChars, totalAfter, results);
+            }
+            if (this.tracker === undefined) {
+                localTotal += result.promptChars + result.responseChars;
+            }
+            results.push(result);
+            if (isDone(result)) {
+                break;
+            }
+            observation = result.newObservation;
+        }
+        return results;
+    }
+}
+//# sourceMappingURL=runtime.js.map

package/dist/runtime.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"runtime.js","sourceRoot":"","sources":["../src/runtime.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAClD,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAGzD,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AA6GnC;;;;;GAKG;AACH,MAAM,OAAO,mBAAoB,SAAQ,KAAK;IACnC,QAAQ,CAAS;IACjB,UAAU,CAAS;IACnB,cAAc,CAAe;IAEtC,YACE,QAAgB,EAChB,UAAkB,EAClB,cAA4B;QAE5B,KAAK,CAAC,yBAAyB,UAAU,MAAM,QAAQ,EAAE,CAAC,CAAC;QAC3D,IAAI,CAAC,IAAI,GAAG,qBAAqB,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,cAAc,GAAG,cAAc,CAAC;IACvC,CAAC;CACF;AAuBD,kFAAkF;AAClF,MAAM,oBAAoB,GAAG,mBAAmB,CAAC;AACjD,MAAM,8BAA8B,GAAG,CAAC,CAAC;AACzC,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAC9B,MAAM,YAAY,GAAG,SAAS,CAAC;AAC/B;;;;GAIG;AACH,MAAM,sBAAsB,GAAG,UAAU,CAAC;AAE1C;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,QAAgB;IACxC,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;AAClE,CAAC;AAED;;;;GAIG;AACH,SAAS,iBAAiB,CAAC,MAAc,EAAE,MAAc;IACvD,OAAO,GAAG,MAAM,2CAA2C,MAAM,2HAA2H,CAAC;AAC/L,CAAC;AASD;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,iBAAiB;IACX,IAAI,CAAiB;IACrB,GAAG,CAAsB;IACzB,OAAO,CAAiB;IACxB,OAAO,CAA2B;IAClC,oBAAoB,CAAS;IAC7B,SAAS,CAAqB;IAC9B,MAAM,CAA0B;IAChC,KAAK,CAA2B;IAChC,KAAK,CAAoB;IACzB,MAAM,CAAkC;IACxC,MAAM,CAAqB;IAC3B,WAAW,CAA0B;IACrC,WAAW,CAA0B;IACrC,WAAW,GAAG,IAAI,iBAAiB,EAAE,CAAC;IAC/C,YAAY,CAAa;IACzB,WAAW,GAAG,CAAC,CAAC;IAExB,YAAY,OAAuB;QACjC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;QACvB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;QAC/B,IAAI,CAAC,oBAAoB;YACvB,OAAO,CAAC,oBAAoB,IAAI,8BAA8B,CAAC;QACjE,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QACnC,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;QACvC,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;QACvC,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY;YACtC,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,YAAY,CAAC;YACvC,CAAC,CAAC,YAAY,CAAC,kBAAkB,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3D,CAAC;IAED,yCAAyC;IACzC,IAAI,KAAK;QACP,OAAO,eAAe,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;;;;;;OAUG;IACK,eAAe,CAAI,EAAoB;QAC7C,IACE,IAAI,CAAC,SAAS,KAAK,SAAS;YAC5B,IAAI,CAAC,MAAM,KAAK,SAAS;YACzB,IAAI,CAAC,KAAK,KAAK,SAAS,EACxB,CAAC;YACD,OAAO,EAAE,EAAE,CAAC;QACd,CAAC;QACD,MAAM,OAAO,GAAG,GAAe,EAAE;YAC/B,MAAM,OAAO,GAAG,EAAE,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;gBAC9D,OAAO,OAAO,CAAC;YACjB,CAAC;YACD,OAAO,WAAW,CAChB,OAAO,EACP,IAAI,CAAC,SAAS,IAAI,sBAAsB,EACxC,IAAI,CAAC,MAAM,CACZ,CAAC;QACJ,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAC7B,OAAO,OAAO,EAAE,CAAC;QACnB,CAAC;QACD,OAAO,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;IAED;;;;;;;;OAQG;IACK,SAAS,CACf,MAAc;QAEd,MAAM,GAAG,GAAwB,IAAI,CAAC,GAAG,CAAC;QAC1C,IAAI,OAAO,GAAG,KAAK,UAAU,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7E,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED;;;OAGG;IACK,GAAG;QACT,OAAO,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,CAAC;IACzC,CAAC;IAED,8EAA8E;IACtE,eAAe,CAAC,OAAoB;QAC1C,OAAO,CACL,OAAO,EAAE,QAAQ;YACjB,OAAO,EAAE,WAAW,EAAE,QAAQ;YAC9B,OAAO,EAAE,WAAW,EAAE,QAAQ;YAC9B,IAAI,CAAC,WAAW,EAAE,QAAQ;YAC1B,IAAI,CAAC,WAAW,EAAE,QAAQ,CAC3B,CAAC;IACJ,CAAC;IAED,qEAAqE;IAC7D,iBAAiB,CAAC,UAAkB;QAC1C,OAAO,IAAI,CAAC,OAAO,EAAE,cAAc,EAAE,CAAC,UAAU,IAAI,UAAU,CAAC;IACjE,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,IAAI,CAAC,WAAwB;QACjC,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;QACtB,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC;QACpC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC,CAAC;QAEnE,IAAI,CAAC;YACH,iEAAiE;YACjE,mEAAmE;YACnE,gEAAgE;YAChE,+CAA+C;YAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAC7C,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,YAAY,EACjB,WAAW,CACZ,CAAC;YACF,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC;YAElD,IAAI,MAAM,GAAG,UAAU,CAAC;YACxB,IAAI,QAAQ,GAAG,EAAE,CAAC;YAClB,IAAI,SAAS,GAAG,EAAE,CAAC;YACnB,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,IAAI,QAAQ,GAA2B,IAAI,CAAC;YAC5C,IAAI,aAAa,GAAG,CAAC,CAAC;YACtB,IAAI,mBAAuC,CAAC;YAE5C,yEAAyE;YACzE,4DAA4D;YAC5D,OAAO,QAAQ,GAAG,WAAW,EAAE,CAAC;gBAC9B,QAAQ,IAAI,CAAC,CAAC;gBACd,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;gBAC9C,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC;gBACzB,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;gBAC7B,IAAI,mBAAmB,KAAK,SAAS,IAAI,KAAK,EAAE,WAAW,KAAK,SAAS,EAAE,CAAC;oBAC1E,mBAAmB,GAAG,KAAK,CAAC,WAAW,CAAC;gBAC1C,CAAC;gBACD,aAAa,IAAI,KAAK,EAAE,eAAe,IAAI,QAAQ,CAAC,MAAM,CAAC;gBAE3D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;gBACxD,IAAI,MAAM,CAAC,EAAE,EAAE,CAAC;oBACd,MAAM,UAAU,GAAG,YAAY,CAAC,aAAa,CAC3C,IAAI,CAAC,IAAI,CAAC,MAAM,EAChB,MAAM,CAAC,KAAK,CACb,CAAC;oBACF,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;wBACrB,QAAQ,GAAG;4BACT,KAAK,EAAE,MAAM,CAAC,KAAK;4BACnB,MAAM,EAAE,MAAM,CAAC,MAAM;4BACrB,SAAS,EAAE,gBAAgB,CAAC,QAAQ,CAAC;yBACtC,CAAC;wBACF,MAAM;oBACR,CAAC;yBAAM,CAAC;wBACN,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC;oBAC/B,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,SAAS,GAAG,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;gBAC7C,CAAC;gBACD,MAAM,GAAG,iBAAiB,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;YACpD,CAAC;YAED,mEAAmE;YACnE,+DAA+D;YAC/D,MAAM,WAAW,GAAG,QAAQ,KAAK,IAAI,CAAC;YACtC,MAAM,KAAK,GAAe,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC;YAClE,MAAM,MAAM,GACV,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC;YAC7D,MAAM,SAAS,GAAG,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC;YAC9D,MAAM,QAAQ,GACZ,QAAQ,KAAK,IAAI;gBACf,CAAC,CAAC,IAAI,CAAC,YAAY;gBACnB,CAAC,CAAC,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YAEjE,oEAAoE;YACpE,sDAAsD;YACtD,MAAM,cAAc,GAClB,QAAQ,KAAK,IAAI;gBACf,CAAC,CAAC;oBACE,OAAO,EAAE,6BAA6B,QAAQ,cAAc,SAAS,EAAE;oBACvE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;oBACrB,MAAM,EAAE,YAAY;iBACrB;gBACH,CAAC,CAAC,MAAM,IAAI,CAAC,eAAe,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;YAEvE,wEAAwE;YACxE,6DAA6D;YAC7D,sEAAsE;YACtE,wEAAwE;YACxE,4DAA4D;YAC5D,MAAM,WAAW,GAAG,mBAAmB,IAAI,UAAU,CAAC,MAAM,CAAC;YAC7D,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC;gBACvB,IAAI,EAAE,UAAU;gBAChB,WAAW;gBACX,SAAS;gBACT,UAAU,EAAE,KAAK;gBACjB,MAAM;gBACN,WAAW;gBACX,aAAa;gBACb,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;gBACrB,OAAO,EAAE,CAAC,WAAW;aACtB,CAAC,CAAC;YAEH,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;gBACtB,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;YAC/B,CAAC;YAED,gEAAgE;YAChE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;YACzE,IAAI,WAAW,EAAE,CAAC;gBAChB,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;gBACxE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,kBAAkB,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC,CAAC;YAChF,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC;YAC9D,CAAC;YAED,kEAAkE;YAClE,OAAO;gBACL,IAAI,EAAE,UAAU;gBAChB,WAAW;gBACX,SAAS;gBACT,UAAU,EAAE,KAAK;gBACjB,MAAM;gBACN,cAAc;gBACd,QAAQ;gBACR,kBAAkB,EAAE,QAAQ;gBAC5B,WAAW;gBACX,WAAW;gBACX,aAAa;aACd,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,qEAAqE;YACrE,iEAAiE;YACjE,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,YAAY,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;YACtE,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,YAAY,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;YACvE,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,GAAG,CACP,KAAkB,EAClB,MAAkC,EAClC,QAAQ,GAAW,iBAAiB,EACpC,OAAoB;QAEpB,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;QAC/C,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,IAAI,WAAW,GAAG,KAAK,CAAC;QAExB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YACrC,IACE,QAAQ,KAAK,SAAS;gBACtB,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,GAAG,QAAQ,EAC7C,CAAC;gBACD,oEAAoE;gBACpE,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;gBACjD,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,iBAAiB,EAAE;oBACnC,IAAI,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC;oBACxB,UAAU,EAAE,KAAK;oBACjB,QAAQ;iBACT,CAAC,CAAC;gBACH,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,iBAAiB,EAAE;oBACnC,IAAI,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC;oBACxB,UAAU,EAAE,KAAK;oBACjB,QAAQ;iBACT,CAAC,CAAC;gBACH,MAAM,IAAI,mBAAmB,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAC1D,CAAC;YAED,MAAM,kBAAkB,GAAG,IAAI,CAAC,OAAO,EAAE,cAAc,EAAE,CAAC,SAAS,IAAI,CAAC,CAAC;YACzE,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,iBAAiB,CACvC,UAAU,GAAG,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,aAAa,CACvD,CAAC;YAEF,IAAI,QAAQ,KAAK,SAAS,IAAI,UAAU,GAAG,QAAQ,EAAE,CAAC;gBACpD,4DAA4D;gBAC5D,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;gBAChC,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,kBAAkB,CAAC,CAAC;gBAC7C,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,iBAAiB,EAAE;oBACnC,IAAI,EAAE,MAAM,CAAC,IAAI;oBACjB,UAAU,EAAE,UAAU;oBACtB,QAAQ;iBACT,CAAC,CAAC;gBACH,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,iBAAiB,EAAE;oBACnC,IAAI,EAAE,MAAM,CAAC,IAAI;oBACjB,UAAU,EAAE,UAAU;oBACtB,QAAQ;iBACT,CAAC,CAAC;gBACH,MAAM,IAAI,mBAAmB,CAAC,QAAQ,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;YAC/D,CAAC;YAED,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,EAAE,CAAC;gBAC/B,UAAU,IAAI,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,aAAa,CAAC;YAC1D,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnB,MAAM;YACR,CAAC;YACD,WAAW,GAAG,MAAM,CAAC,cAAc,CAAC;QACtC,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/dist/schemas/index.d.ts

@@ -0,0 +1,2 @@
+export * from './intercode-ctf.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/schemas/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/schemas/index.ts"],"names":[],"mappings":"AACA,cAAc,oBAAoB,CAAC"}

package/dist/schemas/index.js

@@ -0,0 +1,3 @@
+// Canonical procedural specifications (paper §3.1 datasets).
+export * from './intercode-ctf.js';
+//# sourceMappingURL=index.js.map

package/dist/schemas/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/schemas/index.ts"],"names":[],"mappings":"AAAA,6DAA6D;AAC7D,cAAc,oBAAoB,CAAC"}

package/dist/schemas/intercode-ctf.d.ts

@@ -0,0 +1,3 @@
+import type { ProceduralSpec } from '../types.js';
+export declare const INTERCODE_CTF_SPEC: ProceduralSpec;
+//# sourceMappingURL=intercode-ctf.d.ts.map

package/dist/schemas/intercode-ctf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"intercode-ctf.d.ts","sourceRoot":"","sources":["../../src/schemas/intercode-ctf.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,aAAa,CAAC;AAUlD,eAAO,MAAM,kBAAkB,EAAE,cA4ChC,CAAC"}

package/dist/schemas/intercode-ctf.js

@@ -0,0 +1,53 @@
+// ---------------------------------------------------------------------------
+// Canonical InterCode CTF skill specification (paper §3.1)
+// ---------------------------------------------------------------------------
+//
+// The InterCode CTF benchmark task: an agent operates a bash shell inside a
+// Docker container and must locate a hidden flag. The paper fixes the state
+// schema to exactly these five fields — this spec is the canonical encoding.
+export const INTERCODE_CTF_SPEC = {
+    id: 'intercode-ctf',
+    name: 'InterCode CTF Agent',
+    version: '1.0.0',
+    instructions: `You are an autonomous CTF agent operating inside an InterCode CTF environment: a Docker container with a hidden flag somewhere on its filesystem.
+
+Your actions are bash commands executed in the container (e.g. ls, cat, grep, find, strings, file, head, tail). Each step you issue exactly one command.
+
+Strategy:
+- Form a hypothesis about where the flag might be, test it with one command, then update your state.
+- Record every command and hypothesis you have already tried in tested_hypotheses so you never repeat a failed approach.
+- Keep working_dir synced with your current directory in the container.
+- Track files that look promising in active_files; remove them (set to null) once you have ruled them out.
+- Summarize the outcome of your last command in cmd_summary.
+- When you discover a flag (format flag{...}), append it to discovered_flags.
+
+Iterate hypothesis -> command -> observation -> state update until the flag is found. Once discovered_flags contains the flag, you are done.`,
+    schema: {
+        discovered_flags: {
+            type: 'array',
+            default: [],
+            description: 'Flags discovered so far',
+        },
+        tested_hypotheses: {
+            type: 'array',
+            default: [],
+            description: 'Commands/hypotheses already tested to avoid repetition',
+        },
+        active_files: {
+            type: 'array',
+            default: [],
+            description: 'Files currently under investigation',
+        },
+        working_dir: {
+            type: 'string',
+            default: '/',
+            description: 'Current working directory',
+        },
+        cmd_summary: {
+            type: 'string',
+            default: '',
+            description: 'Summary of last command executed',
+        },
+    },
+};
+//# sourceMappingURL=intercode-ctf.js.map

package/dist/schemas/intercode-ctf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"intercode-ctf.js","sourceRoot":"","sources":["../../src/schemas/intercode-ctf.ts"],"names":[],"mappings":"AAEA,8EAA8E;AAC9E,2DAA2D;AAC3D,8EAA8E;AAC9E,EAAE;AACF,4EAA4E;AAC5E,4EAA4E;AAC5E,6EAA6E;AAE7E,MAAM,CAAC,MAAM,kBAAkB,GAAmB;IAChD,EAAE,EAAE,eAAe;IACnB,IAAI,EAAE,qBAAqB;IAC3B,OAAO,EAAE,OAAO;IAChB,YAAY,EAAE;;;;;;;;;;;;6IAY6H;IAC3I,MAAM,EAAE;QACN,gBAAgB,EAAE;YAChB,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,EAAE;YACX,WAAW,EAAE,yBAAyB;SACvC;QACD,iBAAiB,EAAE;YACjB,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,EAAE;YACX,WAAW,EAAE,wDAAwD;SACtE;QACD,YAAY,EAAE;YACZ,IAAI,EAAE,OAAO;YACb,OAAO,EAAE,EAAE;YACX,WAAW,EAAE,qCAAqC;SACnD;QACD,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,GAAG;YACZ,WAAW,EAAE,2BAA2B;SACzC;QACD,WAAW,EAAE;YACX,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,EAAE;YACX,WAAW,EAAE,kCAAkC;SAChD;KACF;CACF,CAAC"}

package/dist/shutdown.d.ts

@@ -0,0 +1,20 @@
+/**
+ * @non-paper graceful-shutdown hook (Wave 4 DX).
+ *
+ * The paper has no process lifecycle; this module adds an OPTIONAL,
+ * additive seam: `installShutdown(save)` checkpoints once per signal.
+ *
+ * - Registers one shared handler for `SIGINT` and `SIGTERM`;
+ * - each signal best-effort invokes `save()` (sync throws and async
+ *   rejections are swallowed — teardown must never crash);
+ * - returns an uninstall closure (idempotent) removing both listeners.
+ *
+ * The hook never calls `process.exit` itself: callers decide whether to
+ * exit after the checkpoint. Zero dependencies, Node >= 20, ESM.
+ */
+/**
+ * @non-paper install a checkpoint-on-signal hook. Returns an idempotent
+ * uninstall function.
+ */
+export declare function installShutdown(save: () => Promise<void>): () => void;
+//# sourceMappingURL=shutdown.d.ts.map

package/dist/shutdown.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shutdown.d.ts","sourceRoot":"","sources":["../src/shutdown.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAIH;;;GAGG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,MAAM,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,CAoBrE"}

package/dist/shutdown.js

@@ -0,0 +1,42 @@
+/**
+ * @non-paper graceful-shutdown hook (Wave 4 DX).
+ *
+ * The paper has no process lifecycle; this module adds an OPTIONAL,
+ * additive seam: `installShutdown(save)` checkpoints once per signal.
+ *
+ * - Registers one shared handler for `SIGINT` and `SIGTERM`;
+ * - each signal best-effort invokes `save()` (sync throws and async
+ *   rejections are swallowed — teardown must never crash);
+ * - returns an uninstall closure (idempotent) removing both listeners.
+ *
+ * The hook never calls `process.exit` itself: callers decide whether to
+ * exit after the checkpoint. Zero dependencies, Node >= 20, ESM.
+ */
+/// <reference types="node" />
+/**
+ * @non-paper install a checkpoint-on-signal hook. Returns an idempotent
+ * uninstall function.
+ */
+export function installShutdown(save) {
+    let installed = true;
+    const handler = () => {
+        try {
+            const pending = save();
+            pending.catch(() => { });
+        }
+        catch {
+            // Best-effort checkpoint: sync throws are swallowed like rejections.
+        }
+    };
+    process.on('SIGINT', handler);
+    process.on('SIGTERM', handler);
+    return () => {
+        if (installed === false) {
+            return;
+        }
+        installed = false;
+        process.removeListener('SIGINT', handler);
+        process.removeListener('SIGTERM', handler);
+    };
+}
+//# sourceMappingURL=shutdown.js.map

package/dist/shutdown.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shutdown.js","sourceRoot":"","sources":["../src/shutdown.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,8BAA8B;AAE9B;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,IAAyB;IACvD,IAAI,SAAS,GAAG,IAAI,CAAC;IACrB,MAAM,OAAO,GAAG,GAAS,EAAE;QACzB,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,IAAI,EAAE,CAAC;YACvB,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,qEAAqE;QACvE,CAAC;IACH,CAAC,CAAC;IACF,OAAO,CAAC,EAAE,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;IAC9B,OAAO,CAAC,EAAE,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC/B,OAAO,GAAG,EAAE;QACV,IAAI,SAAS,KAAK,KAAK,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QACD,SAAS,GAAG,KAAK,CAAC;QAClB,OAAO,CAAC,cAAc,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC1C,OAAO,CAAC,cAAc,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAC7C,CAAC,CAAC;AACJ,CAAC"}

package/dist/state-manager.d.ts

@@ -0,0 +1,23 @@
+import type { SkillState, StatePatch, StateSchema, ValidationResult } from './types.js';
+export declare function createInitialState(schema: StateSchema, overrides?: Partial<SkillState>): SkillState;
+export declare function mergeState(state: SkillState, patch: StatePatch): SkillState;
+export declare function validatePatch(schema: StateSchema, patch: StatePatch): ValidationResult;
+export declare function serializeState(state: SkillState, options?: {
+    pretty?: boolean;
+}): string;
+export declare function deserializeState(json: string): SkillState;
+export declare class StateManager {
+    static createInitialState: typeof createInitialState;
+    static mergeState: typeof mergeState;
+    static validatePatch: typeof validatePatch;
+    static serializeState: typeof serializeState;
+    static deserializeState: typeof deserializeState;
+}
+export declare function createStateManager(): {
+    createInitialState: typeof createInitialState;
+    mergeState: typeof mergeState;
+    validatePatch: typeof validatePatch;
+    serializeState: typeof serializeState;
+    deserializeState: typeof deserializeState;
+};
+//# sourceMappingURL=state-manager.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"state-manager.d.ts","sourceRoot":"","sources":["../src/state-manager.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,UAAU,EACV,UAAU,EACV,WAAW,EAEX,gBAAgB,EACjB,MAAM,YAAY,CAAC;AAMpB,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,WAAW,EACnB,SAAS,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,GAC9B,UAAU,CAWZ;AAcD,wBAAgB,UAAU,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,GAAG,UAAU,CAkB3E;AAgDD,wBAAgB,aAAa,CAC3B,MAAM,EAAE,WAAW,EACnB,KAAK,EAAE,UAAU,GAChB,gBAAgB,CAkBlB;AAMD,wBAAgB,cAAc,CAC5B,KAAK,EAAE,UAAU,EACjB,OAAO,CAAC,EAAE;IAAE,MAAM,CAAC,EAAE,OAAO,CAAA;CAAE,GAC7B,MAAM,CAKR;AAED,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,UAAU,CAEzD;AAMD,qBAAa,YAAY;IACvB,MAAM,CAAC,kBAAkB,4BAAsB;IAC/C,MAAM,CAAC,UAAU,oBAAc;IAC/B,MAAM,CAAC,aAAa,uBAAiB;IACrC,MAAM,CAAC,cAAc,wBAAkB;IACvC,MAAM,CAAC,gBAAgB,0BAAoB;CAC5C;AAMD,wBAAgB,kBAAkB;;;;;;EAQjC"}