limen-ai 1.0.0

package/dist/reference-agent/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/reference-agent/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAC7C,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtD,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,4BAA4B,CAAC;AAMvE;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,oBAAoB,GAC3B,cAAc,CAEhB;AAMD,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD,YAAY,EACV,oBAAoB,EACpB,iBAAiB,EACjB,mBAAmB,EACnB,gBAAgB,EAChB,qBAAqB,EACrB,wBAAwB,EACxB,kBAAkB,EAClB,qBAAqB,EACrB,aAAa,EACb,eAAe,GAChB,MAAM,4BAA4B,CAAC;AAEpC,OAAO,EACL,2BAA2B,EAC3B,qBAAqB,EACrB,kBAAkB,EAClB,wBAAwB,EACxB,+BAA+B,EAC/B,4BAA4B,GAC7B,MAAM,4BAA4B,CAAC"}

package/dist/reference-agent/index.js

@@ -0,0 +1,53 @@
+/**
+ * Reference Agent public exports.
+ * S ref: S49 (developer experience), §41 (use cases)
+ *
+ * Phase: 5 (Reference Agent)
+ * Implements: SDD File Manifest -- public entry point
+ *
+ * This file is the SOLE public entry point for the reference agent.
+ * Consumers import from here. Internal modules are not exported.
+ *
+ * Usage:
+ *   import { createReferenceAgent } from './reference-agent/index.js';
+ *   import type { Limen } from './api/index.js';
+ *
+ *   const limen: Limen = await createLimen({ ... });
+ *   const agent = createReferenceAgent(limen, { name: 'strategist' });
+ *   const result = await agent.runMission({
+ *     objective: 'Analyze SEA drone delivery market',
+ *     constraints: { tokenBudget: 50000, deadline: '48h' },
+ *   });
+ *
+ * I-17: The reference agent imports ONLY from src/api/.
+ *       No kernel, substrate, or orchestration internals.
+ */
+import { ReferenceAgent } from './reference_agent.js';
+// ============================================================================
+// Factory Function (S49 DX)
+// ============================================================================
+/**
+ * S49: Create a reference agent instance.
+ *
+ * This is the canonical developer experience entry point.
+ * The agent is a library -- it does not run autonomously.
+ * The consumer drives execution by calling runMission().
+ *
+ * @param limen - A Limen engine instance (from createLimen())
+ * @param config - Agent configuration
+ * @returns ReferenceAgent instance ready to run missions
+ */
+export function createReferenceAgent(limen, config) {
+    return new ReferenceAgent(limen, config);
+}
+// ============================================================================
+// Public Type Exports
+// ============================================================================
+export { ReferenceAgent } from './reference_agent.js';
+export { DEFAULT_BUDGET_DECAY_FACTOR, MISSION_TREE_DEFAULTS, MAX_PLAN_REVISIONS, DEFAULT_MAX_TASK_RETRIES, ESCALATION_CONFIDENCE_THRESHOLD, BUDGET_CHECKPOINT_THRESHOLDS, } from './reference_agent.types.js';
+// DR-P5-013: Internal modules are NOT exported from the public API surface.
+// Consumers should use only the factory function and public types.
+// For testing, import directly from the internal module files.
+// Internal modules: SystemCallClient, MissionPlanner, TaskExecutor,
+// ArtifactManager, CheckpointHandler, ResultAggregator.
+//# sourceMappingURL=index.js.map

package/dist/reference-agent/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/reference-agent/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AAGH,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAGtD,+EAA+E;AAC/E,4BAA4B;AAC5B,+EAA+E;AAE/E;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAY,EACZ,MAA4B;IAE5B,OAAO,IAAI,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AAC3C,CAAC;AAED,+EAA+E;AAC/E,sBAAsB;AACtB,+EAA+E;AAE/E,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAetD,OAAO,EACL,2BAA2B,EAC3B,qBAAqB,EACrB,kBAAkB,EAClB,wBAAwB,EACxB,+BAA+B,EAC/B,4BAA4B,GAC7B,MAAM,4BAA4B,CAAC;AAEpC,4EAA4E;AAC5E,mEAAmE;AACnE,+DAA+D;AAC/D,oEAAoE;AACpE,wDAAwD"}

package/dist/reference-agent/mission_planner.d.ts

@@ -0,0 +1,163 @@
+/**
+ * MissionPlanner -- objective decomposition into task graphs.
+ * S ref: S15 (propose_mission), S16 (propose_task_graph),
+ *        SD-01 (lifecycle-phase grouping), SD-02 (heuristic decomposition)
+ *
+ * Phase: 5 (Reference Agent)
+ * Implements: SDD §10 Build Order Step 2 (MissionPlanner)
+ *
+ * The MissionPlanner is responsible for:
+ *   1. Decomposing an objective into a TaskGraphInput (DAG of tasks)
+ *   2. Computing objectiveAlignment for every graph (I-24 mandatory)
+ *   3. Supporting both heuristic (deterministic) and LLM-augmented decomposition
+ *   4. Tracking plan version for revision counting (FM-17)
+ *
+ * The planner does NOT execute tasks. It produces proposals that the
+ * orchestrator validates (DAG acyclicity, budget, alignment).
+ *
+ * Invariants enforced: I-24 (goal anchoring -- objectiveAlignment on every graph)
+ * Failure modes defended: FM-14 (semantic drift), FM-17 (plan explosion)
+ */
+import type { MissionId, TaskGraphInput, TaskGraphOutput, TaskSpec, DecompositionStrategy, AgentExecutionState } from './reference_agent.types.js';
+import { SystemCallClient } from './system_call_client.js';
+/**
+ * SD-02: Expected shape of LLM decomposition response.
+ * Used for runtime validation of the untyped `result` from requestCapability.
+ */
+interface LlmDecomposeResponse {
+    readonly tasks: ReadonlyArray<{
+        readonly id: string;
+        readonly description: string;
+        readonly executionMode: 'deterministic' | 'stochastic' | 'hybrid';
+        readonly estimatedTokens: number;
+        readonly capabilitiesRequired?: readonly string[];
+    }>;
+    readonly dependencies: ReadonlyArray<{
+        readonly from: string;
+        readonly to: string;
+    }>;
+}
+/**
+ * SD-02: Validate that the LLM response matches the expected decomposition schema.
+ * Returns the validated response or null if validation fails.
+ *
+ * Validation rules:
+ *   - tasks must be a non-empty array
+ *   - each task must have a non-empty string id
+ *   - each task must have estimatedTokens > 0
+ *   - each dependency must reference valid task IDs
+ *   - total estimatedTokens must not exceed remaining budget
+ *
+ * @param result - Untyped result from requestCapability
+ * @param remainingBudget - Budget available for decomposition
+ * @returns Validated response or null
+ */
+export declare function validateLlmDecomposeResponse(result: unknown, remainingBudget: number): LlmDecomposeResponse | null;
+/**
+ * SD-02: Heuristic decomposition -- deterministic task graph generation.
+ *
+ * Derives a standard 4-phase research structure from the objective:
+ *   Phase 1: Research (gather data) -- independent tasks
+ *   Phase 2: Analyze (process data) -- depends on research
+ *   Phase 3: Synthesize (combine findings) -- depends on analysis
+ *   Phase 4: Deliver (produce output) -- depends on synthesis
+ *
+ * This structure maps to §41 UC-12's research -> analyze -> synthesize -> deliver.
+ * Each phase is a single task, creating a linear DAG.
+ *
+ * For UC-10 recursive missions, the research phase may produce a "delegation"
+ * task that the executor handles by spawning a child mission.
+ *
+ * I-24: objectiveAlignment computed by direct reference to the objective.
+ *
+ * @param missionId - The mission this graph belongs to
+ * @param objective - The mission objective to decompose
+ * @param budget - Available token budget (determines task granularity)
+ * @param capabilities - Available capabilities (determines task types)
+ * @returns TaskGraphInput ready for proposeTaskGraph
+ */
+export declare function heuristicDecompose(missionId: MissionId, objective: string, budget: number, capabilities: readonly string[]): TaskGraphInput;
+/**
+ * SD-01: MissionPlanner groups propose_mission + propose_task_graph calls.
+ * These are the "planning" calls that define WHAT the agent will do.
+ *
+ * The planner:
+ *   1. Decomposes objectives into task graphs (heuristic or LLM-augmented)
+ *   2. Proposes task graphs via the SystemCallClient
+ *   3. Handles plan revisions within FM-17 limits
+ *   4. Ensures I-24 objectiveAlignment on every proposal
+ */
+export declare class MissionPlanner {
+    private readonly client;
+    readonly strategy: DecompositionStrategy;
+    constructor(client: SystemCallClient, strategy?: DecompositionStrategy);
+    /**
+     * §16, I-24: Create and propose an initial task graph for a mission.
+     *
+     * DR-P5-001: Returns both the TaskGraphInput that was proposed AND the
+     * TaskGraphOutput from the system. The caller must use the returned
+     * graphInput to drive execution — not a second decomposition.
+     *
+     * @param state - Current agent execution state
+     * @returns { graphInput, graphOutput } — the proposed graph and the system's validation result
+     * @throws ClassifiedError on validation failure
+     */
+    planMission(state: AgentExecutionState): Promise<{
+        graphInput: TaskGraphInput;
+        graphOutput: TaskGraphOutput;
+    }>;
+    /**
+     * §16, FM-17: Propose a revised task graph (replan).
+     *
+     * Called when a checkpoint response triggers replanning.
+     * Tracks revision count against MAX_PLAN_REVISIONS limit.
+     *
+     * DR-P5-001: Returns the graphInput alongside graphOutput so the caller
+     * can drive execution from the exact graph that was accepted.
+     *
+     * @param state - Current agent execution state
+     * @param reason - Why replanning is needed
+     * @returns { graphInput, graphOutput } or null if revision limit reached
+     */
+    replan(state: AgentExecutionState, _reason: string): Promise<{
+        graphInput: TaskGraphInput;
+        graphOutput: TaskGraphOutput;
+    } | null>;
+    /**
+     * §16: Create a TaskGraphInput from a revised set of tasks.
+     * Used when a specific revised graph is needed (e.g., from checkpoint replan).
+     *
+     * @param missionId - Mission this graph belongs to
+     * @param tasks - The revised task list
+     * @param dependencies - The revised dependency list
+     * @param objective - The mission objective for alignment
+     * @returns TaskGraphInput ready for proposeTaskGraph
+     */
+    createRevisedGraph(missionId: MissionId, tasks: readonly TaskSpec[], dependencies: readonly {
+        readonly from: string;
+        readonly to: string;
+    }[], objective: string): TaskGraphInput;
+    /**
+     * SD-02: Decompose objective into task graph using configured strategy.
+     *
+     * When strategy is 'llm-augmented':
+     *   1. Calls requestCapability (SC-7) for LLM-powered decomposition
+     *   2. Validates the response schema rigorously
+     *   3. Tracks budget consumed by the capability call
+     *   4. Falls back to heuristic on ANY error (I-16 graceful degradation)
+     *
+     * When strategy is 'heuristic':
+     *   Uses deterministic heuristicDecompose() directly.
+     *
+     * DR-P5-002: Uses state.capabilities (threaded from MissionRunOptions.constraints.capabilities)
+     * to determine execution mode and attach capabilities to tasks.
+     *
+     * I-24: objectiveAlignment is always present in the returned TaskGraphInput.
+     *
+     * @param state - Agent execution state with objective and constraints
+     * @returns TaskGraphInput for proposal
+     */
+    private decompose;
+}
+export {};
+//# sourceMappingURL=mission_planner.d.ts.map

package/dist/reference-agent/mission_planner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mission_planner.d.ts","sourceRoot":"","sources":["../../src/reference-agent/mission_planner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAEH,OAAO,KAAK,EACV,SAAS,EACT,cAAc,EAAE,eAAe,EAAE,QAAQ,EAEzC,qBAAqB,EACrB,mBAAmB,EACpB,MAAM,4BAA4B,CAAC;AAGpC,OAAO,EAAE,gBAAgB,EAAqB,MAAM,yBAAyB,CAAC;AAM9E;;;GAGG;AACH,UAAU,oBAAoB;IAC5B,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC;QAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;QACpB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;QAC7B,QAAQ,CAAC,aAAa,EAAE,eAAe,GAAG,YAAY,GAAG,QAAQ,CAAC;QAClE,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;QACjC,QAAQ,CAAC,oBAAoB,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;KACnD,CAAC,CAAC;IACH,QAAQ,CAAC,YAAY,EAAE,aAAa,CAAC;QACnC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QACtB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;KACrB,CAAC,CAAC;CACJ;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,4BAA4B,CAC1C,MAAM,EAAE,OAAO,EACf,eAAe,EAAE,MAAM,GACtB,oBAAoB,GAAG,IAAI,CA4D7B;AAeD;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,kBAAkB,CAChC,SAAS,EAAE,SAAS,EACpB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,SAAS,MAAM,EAAE,GAC9B,cAAc,CAoEhB;AAMD;;;;;;;;;GASG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAmB;IAC1C,QAAQ,CAAC,QAAQ,EAAE,qBAAqB,CAAC;gBAE7B,MAAM,EAAE,gBAAgB,EAAE,QAAQ,GAAE,qBAAmC;IAKnF;;;;;;;;;;OAUG;IACG,WAAW,CAAC,KAAK,EAAE,mBAAmB,GAAG,OAAO,CAAC;QAAE,UAAU,EAAE,cAAc,CAAC;QAAC,WAAW,EAAE,eAAe,CAAA;KAAE,CAAC;IAgBpH;;;;;;;;;;;;OAYG;IACG,MAAM,CAAC,KAAK,EAAE,mBAAmB,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC;QAAE,UAAU,EAAE,cAAc,CAAC;QAAC,WAAW,EAAE,eAAe,CAAA;KAAE,GAAG,IAAI,CAAC;IA6BvI;;;;;;;;;OASG;IACH,kBAAkB,CAChB,SAAS,EAAE,SAAS,EACpB,KAAK,EAAE,SAAS,QAAQ,EAAE,EAC1B,YAAY,EAAE,SAAS;QAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;KAAE,EAAE,EACvE,SAAS,EAAE,MAAM,GAChB,cAAc;IAUjB;;;;;;;;;;;;;;;;;;;OAmBG;YACW,SAAS;CAwExB"}

package/dist/reference-agent/mission_planner.js

@@ -0,0 +1,375 @@
+/**
+ * MissionPlanner -- objective decomposition into task graphs.
+ * S ref: S15 (propose_mission), S16 (propose_task_graph),
+ *        SD-01 (lifecycle-phase grouping), SD-02 (heuristic decomposition)
+ *
+ * Phase: 5 (Reference Agent)
+ * Implements: SDD §10 Build Order Step 2 (MissionPlanner)
+ *
+ * The MissionPlanner is responsible for:
+ *   1. Decomposing an objective into a TaskGraphInput (DAG of tasks)
+ *   2. Computing objectiveAlignment for every graph (I-24 mandatory)
+ *   3. Supporting both heuristic (deterministic) and LLM-augmented decomposition
+ *   4. Tracking plan version for revision counting (FM-17)
+ *
+ * The planner does NOT execute tasks. It produces proposals that the
+ * orchestrator validates (DAG acyclicity, budget, alignment).
+ *
+ * Invariants enforced: I-24 (goal anchoring -- objectiveAlignment on every graph)
+ * Failure modes defended: FM-14 (semantic drift), FM-17 (plan explosion)
+ */
+import { MAX_PLAN_REVISIONS } from './reference_agent.types.js';
+import { toClassifiedError } from './system_call_client.js';
+/**
+ * SD-02: Validate that the LLM response matches the expected decomposition schema.
+ * Returns the validated response or null if validation fails.
+ *
+ * Validation rules:
+ *   - tasks must be a non-empty array
+ *   - each task must have a non-empty string id
+ *   - each task must have estimatedTokens > 0
+ *   - each dependency must reference valid task IDs
+ *   - total estimatedTokens must not exceed remaining budget
+ *
+ * @param result - Untyped result from requestCapability
+ * @param remainingBudget - Budget available for decomposition
+ * @returns Validated response or null
+ */
+export function validateLlmDecomposeResponse(result, remainingBudget) {
+    if (!result || typeof result !== 'object')
+        return null;
+    const r = result;
+    // Validate tasks array
+    if (!Array.isArray(r['tasks']) || r['tasks'].length === 0)
+        return null;
+    const tasks = r['tasks'];
+    const validModes = new Set(['deterministic', 'stochastic', 'hybrid']);
+    const taskIds = new Set();
+    let totalEstimated = 0;
+    for (const task of tasks) {
+        if (!task || typeof task !== 'object')
+            return null;
+        const t = task;
+        // id: non-empty string
+        if (typeof t['id'] !== 'string' || t['id'].length === 0)
+            return null;
+        // estimatedTokens: positive number
+        if (typeof t['estimatedTokens'] !== 'number' || t['estimatedTokens'] <= 0)
+            return null;
+        // description: non-empty string
+        if (typeof t['description'] !== 'string' || t['description'].length === 0)
+            return null;
+        // executionMode: valid enum
+        if (typeof t['executionMode'] !== 'string' || !validModes.has(t['executionMode']))
+            return null;
+        taskIds.add(t['id']);
+        totalEstimated += t['estimatedTokens'];
+    }
+    // Total estimated tokens must not exceed budget
+    if (totalEstimated > remainingBudget)
+        return null;
+    // Validate dependencies
+    const deps = Array.isArray(r['dependencies']) ? r['dependencies'] : [];
+    for (const dep of deps) {
+        if (!dep || typeof dep !== 'object')
+            return null;
+        const d = dep;
+        if (typeof d['from'] !== 'string' || !taskIds.has(d['from']))
+            return null;
+        if (typeof d['to'] !== 'string' || !taskIds.has(d['to']))
+            return null;
+    }
+    // F-S6-002 FIX: Construct validated object from verified fields instead of casting raw input
+    return {
+        tasks: r['tasks'].map((t) => {
+            const task = t;
+            return {
+                id: task['id'],
+                description: task['description'],
+                executionMode: task['executionMode'],
+                estimatedTokens: task['estimatedTokens'],
+                ...(Array.isArray(task['capabilitiesRequired'])
+                    ? { capabilitiesRequired: task['capabilitiesRequired'] }
+                    : {}),
+            };
+        }),
+        dependencies: deps.map((d) => {
+            const dep = d;
+            return { from: dep['from'], to: dep['to'] };
+        }),
+    };
+}
+// ============================================================================
+// Task ID Generation
+// ============================================================================
+/** Generate a deterministic task ID from mission context. */
+function makeTaskId(missionId, index) {
+    return `task-${missionId.replace(/^mission-/, '')}-${index}`;
+}
+// ============================================================================
+// Heuristic Decomposition (SD-02)
+// ============================================================================
+/**
+ * SD-02: Heuristic decomposition -- deterministic task graph generation.
+ *
+ * Derives a standard 4-phase research structure from the objective:
+ *   Phase 1: Research (gather data) -- independent tasks
+ *   Phase 2: Analyze (process data) -- depends on research
+ *   Phase 3: Synthesize (combine findings) -- depends on analysis
+ *   Phase 4: Deliver (produce output) -- depends on synthesis
+ *
+ * This structure maps to §41 UC-12's research -> analyze -> synthesize -> deliver.
+ * Each phase is a single task, creating a linear DAG.
+ *
+ * For UC-10 recursive missions, the research phase may produce a "delegation"
+ * task that the executor handles by spawning a child mission.
+ *
+ * I-24: objectiveAlignment computed by direct reference to the objective.
+ *
+ * @param missionId - The mission this graph belongs to
+ * @param objective - The mission objective to decompose
+ * @param budget - Available token budget (determines task granularity)
+ * @param capabilities - Available capabilities (determines task types)
+ * @returns TaskGraphInput ready for proposeTaskGraph
+ */
+export function heuristicDecompose(missionId, objective, budget, capabilities) {
+    const mid = missionId;
+    const tasks = [];
+    const dependencies = [];
+    // Determine execution mode based on capabilities
+    const hasStochastic = capabilities.length > 0;
+    const mode = hasStochastic ? 'stochastic' : 'deterministic';
+    // Budget allocation: research 30%, analyze 30%, synthesize 20%, deliver 20%
+    const researchBudget = Math.floor(budget * 0.30);
+    const analyzeBudget = Math.floor(budget * 0.30);
+    const synthesizeBudget = Math.floor(budget * 0.20);
+    const deliverBudget = Math.floor(budget * 0.20);
+    // Phase 1: Research
+    const researchId = makeTaskId(mid, 1);
+    tasks.push({
+        id: researchId,
+        description: `Research: Gather data and information relevant to "${objective}"`,
+        executionMode: mode,
+        estimatedTokens: researchBudget,
+        capabilitiesRequired: capabilities.filter(c => c === 'web_search' || c === 'data_query'),
+    });
+    // Phase 2: Analyze
+    const analyzeId = makeTaskId(mid, 2);
+    tasks.push({
+        id: analyzeId,
+        description: `Analyze: Process and analyze findings from research on "${objective}"`,
+        executionMode: mode,
+        estimatedTokens: analyzeBudget,
+        capabilitiesRequired: capabilities.filter(c => c === 'code_execute' || c === 'data_query'),
+    });
+    dependencies.push({ from: researchId, to: analyzeId });
+    // Phase 3: Synthesize
+    const synthesizeId = makeTaskId(mid, 3);
+    tasks.push({
+        id: synthesizeId,
+        description: `Synthesize: Combine analysis results into coherent findings for "${objective}"`,
+        executionMode: mode,
+        estimatedTokens: synthesizeBudget,
+    });
+    dependencies.push({ from: analyzeId, to: synthesizeId });
+    // Phase 4: Deliver
+    const deliverId = makeTaskId(mid, 4);
+    tasks.push({
+        id: deliverId,
+        description: `Deliver: Produce final deliverables for "${objective}"`,
+        executionMode: 'deterministic',
+        estimatedTokens: deliverBudget,
+    });
+    dependencies.push({ from: synthesizeId, to: deliverId });
+    // I-24: objectiveAlignment -- direct reference to objective
+    const objectiveAlignment = `Tasks decompose "${objective}" into four phases: ` +
+        `research (data gathering), analysis (processing), synthesis (combining), ` +
+        `and delivery (final output). Each phase directly supports the mission objective.`;
+    return {
+        missionId,
+        tasks,
+        dependencies,
+        objectiveAlignment,
+    };
+}
+// ============================================================================
+// MissionPlanner Class
+// ============================================================================
+/**
+ * SD-01: MissionPlanner groups propose_mission + propose_task_graph calls.
+ * These are the "planning" calls that define WHAT the agent will do.
+ *
+ * The planner:
+ *   1. Decomposes objectives into task graphs (heuristic or LLM-augmented)
+ *   2. Proposes task graphs via the SystemCallClient
+ *   3. Handles plan revisions within FM-17 limits
+ *   4. Ensures I-24 objectiveAlignment on every proposal
+ */
+export class MissionPlanner {
+    client;
+    strategy;
+    constructor(client, strategy = 'heuristic') {
+        this.client = client;
+        this.strategy = strategy;
+    }
+    /**
+     * §16, I-24: Create and propose an initial task graph for a mission.
+     *
+     * DR-P5-001: Returns both the TaskGraphInput that was proposed AND the
+     * TaskGraphOutput from the system. The caller must use the returned
+     * graphInput to drive execution — not a second decomposition.
+     *
+     * @param state - Current agent execution state
+     * @returns { graphInput, graphOutput } — the proposed graph and the system's validation result
+     * @throws ClassifiedError on validation failure
+     */
+    async planMission(state) {
+        const graphInput = await this.decompose(state);
+        const graphOutput = await this.client.proposeTaskGraph(graphInput);
+        // Update state with plan version
+        state.currentPlanVersion = graphOutput.planVersion;
+        state.planRevisionCount = 0;
+        // Track active task IDs
+        for (const task of graphInput.tasks) {
+            state.activeTaskIds.add(task.id);
+        }
+        return { graphInput, graphOutput };
+    }
+    /**
+     * §16, FM-17: Propose a revised task graph (replan).
+     *
+     * Called when a checkpoint response triggers replanning.
+     * Tracks revision count against MAX_PLAN_REVISIONS limit.
+     *
+     * DR-P5-001: Returns the graphInput alongside graphOutput so the caller
+     * can drive execution from the exact graph that was accepted.
+     *
+     * @param state - Current agent execution state
+     * @param reason - Why replanning is needed
+     * @returns { graphInput, graphOutput } or null if revision limit reached
+     */
+    async replan(state, _reason) {
+        // FM-17: Check plan revision limit
+        if (state.planRevisionCount >= MAX_PLAN_REVISIONS) {
+            return null; // Submit with current plan
+        }
+        const graphInput = await this.decompose(state);
+        try {
+            const graphOutput = await this.client.proposeTaskGraph(graphInput);
+            state.currentPlanVersion = graphOutput.planVersion;
+            state.planRevisionCount++;
+            // Clear and repopulate active tasks
+            state.activeTaskIds.clear();
+            for (const task of graphInput.tasks) {
+                state.activeTaskIds.add(task.id);
+            }
+            return { graphInput, graphOutput };
+        }
+        catch (error) {
+            const classified = toClassifiedError(error);
+            if (classified.code === 'PLAN_REVISION_LIMIT') {
+                return null; // System-enforced limit reached
+            }
+            throw classified;
+        }
+    }
+    /**
+     * §16: Create a TaskGraphInput from a revised set of tasks.
+     * Used when a specific revised graph is needed (e.g., from checkpoint replan).
+     *
+     * @param missionId - Mission this graph belongs to
+     * @param tasks - The revised task list
+     * @param dependencies - The revised dependency list
+     * @param objective - The mission objective for alignment
+     * @returns TaskGraphInput ready for proposeTaskGraph
+     */
+    createRevisedGraph(missionId, tasks, dependencies, objective) {
+        return {
+            missionId,
+            tasks,
+            dependencies,
+            objectiveAlignment: `Revised plan for "${objective}" based on checkpoint feedback. ` +
+                `${tasks.length} tasks in revised graph.`,
+        };
+    }
+    /**
+     * SD-02: Decompose objective into task graph using configured strategy.
+     *
+     * When strategy is 'llm-augmented':
+     *   1. Calls requestCapability (SC-7) for LLM-powered decomposition
+     *   2. Validates the response schema rigorously
+     *   3. Tracks budget consumed by the capability call
+     *   4. Falls back to heuristic on ANY error (I-16 graceful degradation)
+     *
+     * When strategy is 'heuristic':
+     *   Uses deterministic heuristicDecompose() directly.
+     *
+     * DR-P5-002: Uses state.capabilities (threaded from MissionRunOptions.constraints.capabilities)
+     * to determine execution mode and attach capabilities to tasks.
+     *
+     * I-24: objectiveAlignment is always present in the returned TaskGraphInput.
+     *
+     * @param state - Agent execution state with objective and constraints
+     * @returns TaskGraphInput for proposal
+     */
+    async decompose(state) {
+        const remainingBudget = state.budgetAllocated - state.budgetConsumed;
+        if (this.strategy === 'llm-augmented') {
+            try {
+                // SD-02: LLM-augmented decomposition via requestCapability (SC-7)
+                const syntheticTaskId = `task-${state.missionId.replace(/^mission-/, '')}-llm-decompose`;
+                const input = {
+                    capabilityType: 'api_call',
+                    parameters: {
+                        prompt: `Decompose the following objective into a task graph (DAG of tasks):\n\n` +
+                            `Objective: "${state.objective}"\n\n` +
+                            `Available capabilities: ${JSON.stringify(state.capabilities)}\n` +
+                            `Remaining budget (tokens): ${remainingBudget}\n\n` +
+                            `Return a JSON object with:\n` +
+                            `- tasks: array of { id: string, description: string, executionMode: "deterministic"|"stochastic"|"hybrid", estimatedTokens: number, capabilitiesRequired?: string[] }\n` +
+                            `- dependencies: array of { from: string, to: string } referencing task IDs\n\n` +
+                            `Total estimatedTokens across all tasks must not exceed ${remainingBudget}.`,
+                        schema: {
+                            tasks: [{ id: 'string', description: 'string', executionMode: 'string', estimatedTokens: 'number' }],
+                            dependencies: [{ from: 'string', to: 'string' }],
+                        },
+                        objective: state.objective,
+                        budget: remainingBudget,
+                        capabilities: state.capabilities,
+                    },
+                    missionId: state.missionId,
+                    taskId: syntheticTaskId,
+                };
+                const output = await this.client.requestCapability(input);
+                // F-S6-001 FIX: Guard against NaN/Infinity/negative token costs
+                const tokensCost = output.resourcesConsumed.tokens ?? 0;
+                if (Number.isFinite(tokensCost) && tokensCost > 0) {
+                    state.budgetConsumed += tokensCost;
+                }
+                // Validate the response schema
+                const validated = validateLlmDecomposeResponse(output.result, remainingBudget);
+                if (validated === null) {
+                    // I-16: Invalid response -> fall through to heuristic
+                    return heuristicDecompose(state.missionId, state.objective, remainingBudget, state.capabilities);
+                }
+                // I-24: objectiveAlignment -- direct reference to objective from LLM decomposition
+                const objectiveAlignment = `LLM-augmented decomposition for "${state.objective}": ` +
+                    `${validated.tasks.length} tasks generated. ` +
+                    `Each task derived from the mission objective to ensure goal anchoring.`;
+                return {
+                    missionId: state.missionId,
+                    tasks: validated.tasks,
+                    dependencies: validated.dependencies,
+                    objectiveAlignment,
+                };
+            }
+            catch (_error) {
+                // I-16: Graceful degradation -- any error falls back to heuristic decomposition.
+                // This covers: SANDBOX_VIOLATION, CAPABILITY_DENIED, network errors, parse failures.
+                return heuristicDecompose(state.missionId, state.objective, remainingBudget, state.capabilities);
+            }
+        }
+        return heuristicDecompose(state.missionId, state.objective, remainingBudget, state.capabilities);
+    }
+}
+//# sourceMappingURL=mission_planner.js.map

package/dist/reference-agent/mission_planner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mission_planner.js","sourceRoot":"","sources":["../../src/reference-agent/mission_planner.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;GAmBG;AAUH,OAAO,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAChE,OAAO,EAAoB,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAwB9E;;;;;;;;;;;;;;GAcG;AACH,MAAM,UAAU,4BAA4B,CAC1C,MAAe,EACf,eAAuB;IAEvB,IAAI,CAAC,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACvD,MAAM,CAAC,GAAG,MAAiC,CAAC;IAE5C,uBAAuB;IACvB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACvE,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAc,CAAC;IAEtC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,eAAe,EAAE,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC;IACtE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,IAAI,cAAc,GAAG,CAAC,CAAC;IAEvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC;QACnD,MAAM,CAAC,GAAG,IAA+B,CAAC;QAE1C,uBAAuB;QACvB,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACrE,mCAAmC;QACnC,IAAI,OAAO,CAAC,CAAC,iBAAiB,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACvF,gCAAgC;QAChC,IAAI,OAAO,CAAC,CAAC,aAAa,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACvF,4BAA4B;QAC5B,IAAI,OAAO,CAAC,CAAC,eAAe,CAAC,KAAK,QAAQ,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAE/F,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACrB,cAAc,IAAI,CAAC,CAAC,iBAAiB,CAAC,CAAC;IACzC,CAAC;IAED,gDAAgD;IAChD,IAAI,cAAc,GAAG,eAAe;QAAE,OAAO,IAAI,CAAC;IAElD,wBAAwB;IACxB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAc,CAAC,CAAC,CAAC,EAAE,CAAC;IACpF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC;QACjD,MAAM,CAAC,GAAG,GAA8B,CAAC;QACzC,IAAI,OAAO,CAAC,CAAC,MAAM,CAAC,KAAK,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;QAC1E,IAAI,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IACxE,CAAC;IAED,6FAA6F;IAC7F,OAAO;QACL,KAAK,EAAG,CAAC,CAAC,OAAO,CAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACzC,MAAM,IAAI,GAAG,CAA4B,CAAC;YAC1C,OAAO;gBACL,EAAE,EAAE,IAAI,CAAC,IAAI,CAAW;gBACxB,WAAW,EAAE,IAAI,CAAC,aAAa,CAAW;gBAC1C,aAAa,EAAE,IAAI,CAAC,eAAe,CAA8C;gBACjF,eAAe,EAAE,IAAI,CAAC,iBAAiB,CAAW;gBAClD,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;oBAC7C,CAAC,CAAC,EAAE,oBAAoB,EAAE,IAAI,CAAC,sBAAsB,CAAsB,EAAE;oBAC7E,CAAC,CAAC,EAAE,CAAC;aACR,CAAC;QACJ,CAAC,CAAC;QACF,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC3B,MAAM,GAAG,GAAG,CAA4B,CAAC;YACzC,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAW,EAAE,EAAE,EAAE,GAAG,CAAC,IAAI,CAAW,EAAE,CAAC;QAClE,CAAC,CAAC;KACH,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,qBAAqB;AACrB,+EAA+E;AAE/E,6DAA6D;AAC7D,SAAS,UAAU,CAAC,SAAiB,EAAE,KAAa;IAClD,OAAO,QAAQ,SAAS,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;AAC/D,CAAC;AAED,+EAA+E;AAC/E,kCAAkC;AAClC,+EAA+E;AAE/E;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,MAAM,UAAU,kBAAkB,CAChC,SAAoB,EACpB,SAAiB,EACjB,MAAc,EACd,YAA+B;IAE/B,MAAM,GAAG,GAAG,SAAmB,CAAC;IAChC,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,YAAY,GAA0D,EAAE,CAAC;IAE/E,iDAAiD;IACjD,MAAM,aAAa,GAAG,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9C,MAAM,IAAI,GAA8C,aAAa,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,eAAe,CAAC;IAEvG,4EAA4E;IAC5E,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IACjD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IAChD,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IACnD,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;IAEhD,oBAAoB;IACpB,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACtC,KAAK,CAAC,IAAI,CAAC;QACT,EAAE,EAAE,UAAU;QACd,WAAW,EAAE,sDAAsD,SAAS,GAAG;QAC/E,aAAa,EAAE,IAAI;QACnB,eAAe,EAAE,cAAc;QAC/B,oBAAoB,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,YAAY,IAAI,CAAC,KAAK,YAAY,CAAC;KACzF,CAAC,CAAC;IAEH,mBAAmB;IACnB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACrC,KAAK,CAAC,IAAI,CAAC;QACT,EAAE,EAAE,SAAS;QACb,WAAW,EAAE,2DAA2D,SAAS,GAAG;QACpF,aAAa,EAAE,IAAI;QACnB,eAAe,EAAE,aAAa;QAC9B,oBAAoB,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,cAAc,IAAI,CAAC,KAAK,YAAY,CAAC;KAC3F,CAAC,CAAC;IACH,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;IAEvD,sBAAsB;IACtB,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACxC,KAAK,CAAC,IAAI,CAAC;QACT,EAAE,EAAE,YAAY;QAChB,WAAW,EAAE,oEAAoE,SAAS,GAAG;QAC7F,aAAa,EAAE,IAAI;QACnB,eAAe,EAAE,gBAAgB;KAClC,CAAC,CAAC;IACH,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC;IAEzD,mBAAmB;IACnB,MAAM,SAAS,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACrC,KAAK,CAAC,IAAI,CAAC;QACT,EAAE,EAAE,SAAS;QACb,WAAW,EAAE,4CAA4C,SAAS,GAAG;QACrE,aAAa,EAAE,eAAe;QAC9B,eAAe,EAAE,aAAa;KAC/B,CAAC,CAAC;IACH,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,SAAS,EAAE,CAAC,CAAC;IAEzD,4DAA4D;IAC5D,MAAM,kBAAkB,GACtB,oBAAoB,SAAS,sBAAsB;QACnD,2EAA2E;QAC3E,kFAAkF,CAAC;IAErF,OAAO;QACL,SAAS;QACT,KAAK;QACL,YAAY;QACZ,kBAAkB;KACnB,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,uBAAuB;AACvB,+EAA+E;AAE/E;;;;;;;;;GASG;AACH,MAAM,OAAO,cAAc;IACR,MAAM,CAAmB;IACjC,QAAQ,CAAwB;IAEzC,YAAY,MAAwB,EAAE,WAAkC,WAAW;QACjF,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC3B,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,WAAW,CAAC,KAA0B;QAC1C,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC;QAEnE,iCAAiC;QACjC,KAAK,CAAC,kBAAkB,GAAG,WAAW,CAAC,WAAW,CAAC;QACnD,KAAK,CAAC,iBAAiB,GAAG,CAAC,CAAC;QAE5B,wBAAwB;QACxB,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;YACpC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;IACrC,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,MAAM,CAAC,KAA0B,EAAE,OAAe;QACtD,mCAAmC;QACnC,IAAI,KAAK,CAAC,iBAAiB,IAAI,kBAAkB,EAAE,CAAC;YAClD,OAAO,IAAI,CAAC,CAAC,2BAA2B;QAC1C,CAAC;QAED,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC;YACH,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC;YAEnE,KAAK,CAAC,kBAAkB,GAAG,WAAW,CAAC,WAAW,CAAC;YACnD,KAAK,CAAC,iBAAiB,EAAE,CAAC;YAE1B,oCAAoC;YACpC,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;YAC5B,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,EAAE,CAAC;gBACpC,KAAK,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnC,CAAC;YAED,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;QACrC,CAAC;QAAC,OAAO,KAAc,EAAE,CAAC;YACxB,MAAM,UAAU,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,UAAU,CAAC,IAAI,KAAK,qBAAqB,EAAE,CAAC;gBAC9C,OAAO,IAAI,CAAC,CAAC,gCAAgC;YAC/C,CAAC;YACD,MAAM,UAAU,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;;;;;;;OASG;IACH,kBAAkB,CAChB,SAAoB,EACpB,KAA0B,EAC1B,YAAuE,EACvE,SAAiB;QAEjB,OAAO;YACL,SAAS;YACT,KAAK;YACL,YAAY;YACZ,kBAAkB,EAAE,qBAAqB,SAAS,kCAAkC;gBAClF,GAAG,KAAK,CAAC,MAAM,0BAA0B;SAC5C,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;;;;;;;OAmBG;IACK,KAAK,CAAC,SAAS,CAAC,KAA0B;QAChD,MAAM,eAAe,GAAG,KAAK,CAAC,eAAe,GAAG,KAAK,CAAC,cAAc,CAAC;QAErE,IAAI,IAAI,CAAC,QAAQ,KAAK,eAAe,EAAE,CAAC;YACtC,IAAI,CAAC;gBACH,kEAAkE;gBAClE,MAAM,eAAe,GAAG,QAAS,KAAK,CAAC,SAAoB,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,gBAA0B,CAAC;gBAE/G,MAAM,KAAK,GAA2B;oBACpC,cAAc,EAAE,UAAU;oBAC1B,UAAU,EAAE;wBACV,MAAM,EAAE,yEAAyE;4BAC/E,eAAe,KAAK,CAAC,SAAS,OAAO;4BACrC,2BAA2B,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI;4BACjE,8BAA8B,eAAe,MAAM;4BACnD,8BAA8B;4BAC9B,yKAAyK;4BACzK,gFAAgF;4BAChF,0DAA0D,eAAe,GAAG;wBAC9E,MAAM,EAAE;4BACN,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,aAAa,EAAE,QAAQ,EAAE,eAAe,EAAE,QAAQ,EAAE,CAAC;4BACpG,YAAY,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC;yBACjD;wBACD,SAAS,EAAE,KAAK,CAAC,SAAS;wBAC1B,MAAM,EAAE,eAAe;wBACvB,YAAY,EAAE,KAAK,CAAC,YAAY;qBACjC;oBACD,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,MAAM,EAAE,eAAe;iBACxB,CAAC;gBAEF,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;gBAE1D,gEAAgE;gBAChE,MAAM,UAAU,GAAG,MAAM,CAAC,iBAAiB,CAAC,MAAM,IAAI,CAAC,CAAC;gBACxD,IAAI,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;oBAClD,KAAK,CAAC,cAAc,IAAI,UAAU,CAAC;gBACrC,CAAC;gBAED,+BAA+B;gBAC/B,MAAM,SAAS,GAAG,4BAA4B,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;gBAC/E,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;oBACvB,sDAAsD;oBACtD,OAAO,kBAAkB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,eAAe,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;gBACnG,CAAC;gBAED,mFAAmF;gBACnF,MAAM,kBAAkB,GACtB,oCAAoC,KAAK,CAAC,SAAS,KAAK;oBACxD,GAAG,SAAS,CAAC,KAAK,CAAC,MAAM,oBAAoB;oBAC7C,wEAAwE,CAAC;gBAE3E,OAAO;oBACL,SAAS,EAAE,KAAK,CAAC,SAAS;oBAC1B,KAAK,EAAE,SAAS,CAAC,KAA4B;oBAC7C,YAAY,EAAE,SAAS,CAAC,YAAY;oBACpC,kBAAkB;iBACnB,CAAC;YACJ,CAAC;YAAC,OAAO,MAAe,EAAE,CAAC;gBACzB,iFAAiF;gBACjF,qFAAqF;gBACrF,OAAO,kBAAkB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,eAAe,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;YACnG,CAAC;QACH,CAAC;QAED,OAAO,kBAAkB,CACvB,KAAK,CAAC,SAAS,EACf,KAAK,CAAC,SAAS,EACf,eAAe,EACf,KAAK,CAAC,YAAY,CACnB,CAAC;IACJ,CAAC;CACF"}