conatus 0.1.0

package/dist/goal-dependency-graph.d.ts

@@ -0,0 +1,112 @@
+import type { StateManager } from "./state-manager.js";
+import type { ILLMClient } from "./llm/llm-client.js";
+import type { DependencyEdge, DependencyEdgeStatus, DependencyGraph } from "./types/dependency.js";
+import type { DependencyType } from "./types/core.js";
+/**
+ * GoalDependencyGraph manages a DAG of dependencies between goals.
+ *
+ * Supports 4 edge types:
+ *   - prerequisite: goal A must complete before goal B can start
+ *   - resource_conflict: goals A and B compete for the same resource
+ *   - synergy: progress on goal A helps goal B
+ *   - conflict: goals A and B have incompatible objectives
+ *
+ * Persistence: ~/.motiva/dependency-graph.json (via StateManager.readRaw/writeRaw)
+ */
+export declare class GoalDependencyGraph {
+    private stateManager;
+    private llmClient?;
+    private graph;
+    constructor(stateManager: StateManager, llmClient?: ILLMClient);
+    /**
+     * Adds an edge to the graph.
+     * For prerequisite edges, validates that the addition would not create a cycle.
+     */
+    addEdge(edge: Omit<DependencyEdge, "created_at">): DependencyEdge;
+    /**
+     * Removes an edge matching from/to/type from the graph.
+     */
+    removeEdge(fromGoalId: string, toGoalId: string, type: DependencyType): void;
+    /**
+     * Updates the status of an edge identified by from/to.
+     */
+    updateEdgeStatus(fromGoalId: string, toGoalId: string, status: DependencyEdgeStatus): void;
+    /**
+     * Returns all edges where goalId appears as either from or to.
+     */
+    getEdges(goalId: string): DependencyEdge[];
+    /**
+     * Returns the first edge matching from/to (and optionally type), or null.
+     */
+    getEdge(fromGoalId: string, toGoalId: string, type?: DependencyType): DependencyEdge | null;
+    /**
+     * Detects whether adding a prerequisite edge from→to would create a cycle.
+     *
+     * Uses BFS starting from "to" following active prerequisite edges.
+     * If we can reach "from", adding from→to would form a cycle.
+     */
+    detectCycle(fromGoalId: string, toGoalId: string): boolean;
+    /**
+     * Returns active prerequisite edges that must be satisfied before goalId can proceed.
+     */
+    getPrerequisites(goalId: string): DependencyEdge[];
+    /**
+     * Returns true if goalId has unresolved prerequisites.
+     */
+    isBlocked(goalId: string): boolean;
+    /**
+     * Returns the IDs of goals that must complete before goalId can proceed.
+     */
+    getBlockingGoals(goalId: string): string[];
+    /**
+     * Returns active resource_conflict edges involving goalId.
+     */
+    getResourceConflicts(goalId: string): DependencyEdge[];
+    /**
+     * Returns goal IDs that have a synergy relationship with goalId.
+     */
+    getSynergyPartners(goalId: string): string[];
+    /**
+     * Uses an LLM to automatically detect dependency relationships between a new goal
+     * and a set of existing goals. Detected dependencies are added to the graph.
+     *
+     * Returns an empty array if no LLM client is configured or no existing goals are provided.
+     */
+    autoDetectDependencies(newGoalId: string, existingGoalIds: string[]): Promise<DependencyEdge[]>;
+    /**
+     * Add a strategy-level dependency between two strategies.
+     * Uses DependencyType "strategy_dependency" for the underlying edge.
+     * The sourceStrategyId is stored in from_goal_id and targetStrategyId in to_goal_id.
+     */
+    addStrategyDependency(sourceStrategyId: string, targetStrategyId: string, dependencyType: "prerequisite" | "enhances", goalId: string): void;
+    /**
+     * Get all strategy dependencies for a given strategy.
+     * Returns edges where this strategy is either source or target.
+     */
+    getStrategyDependencies(strategyId: string): Array<{
+        source_strategy_id: string;
+        target_strategy_id: string;
+        dependency_type: "prerequisite" | "enhances";
+        goal_id: string;
+    }>;
+    /**
+     * Check if a strategy is blocked by a prerequisite dependency.
+     * Returns true if the strategy has a prerequisite dependency where
+     * the source strategy is NOT in completedStrategyIds.
+     */
+    isStrategyBlocked(strategyId: string, completedStrategyIds: string[]): boolean;
+    /**
+     * Loads the dependency graph from disk.
+     * Returns an empty graph if no file exists or parsing fails.
+     */
+    load(): DependencyGraph;
+    /**
+     * Persists the dependency graph to disk.
+     */
+    save(graph: DependencyGraph): void;
+    /**
+     * Returns the current in-memory graph.
+     */
+    getGraph(): DependencyGraph;
+}
+//# sourceMappingURL=goal-dependency-graph.d.ts.map

package/dist/goal-dependency-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"goal-dependency-graph.d.ts","sourceRoot":"","sources":["../src/goal-dependency-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,KAAK,EAAE,UAAU,EAAc,MAAM,qBAAqB,CAAC;AAClE,OAAO,KAAK,EACV,cAAc,EACd,oBAAoB,EACpB,eAAe,EAChB,MAAM,uBAAuB,CAAC;AAE/B,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEtD;;;;;;;;;;GAUG;AACH,qBAAa,mBAAmB;IAC9B,OAAO,CAAC,YAAY,CAAe;IACnC,OAAO,CAAC,SAAS,CAAC,CAAa;IAC/B,OAAO,CAAC,KAAK,CAAkB;gBAEnB,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,EAAE,UAAU;IAQ9D;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,EAAE,YAAY,CAAC,GAAG,cAAc;IA0BjE;;OAEG;IACH,UAAU,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,cAAc,GAAG,IAAI;IAa5E;;OAEG;IACH,gBAAgB,CACd,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,oBAAoB,GAC3B,IAAI;IASP;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,cAAc,EAAE;IAM1C;;OAEG;IACH,OAAO,CACL,UAAU,EAAE,MAAM,EAClB,QAAQ,EAAE,MAAM,EAChB,IAAI,CAAC,EAAE,cAAc,GACpB,cAAc,GAAG,IAAI;IAaxB;;;;;OAKG;IACH,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,OAAO;IA4B1D;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,cAAc,EAAE;IASlD;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAIlC;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE;IAI1C;;OAEG;IACH,oBAAoB,CAAC,MAAM,EAAE,MAAM,GAAG,cAAc,EAAE;IAStD;;OAEG;IACH,kBAAkB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE;IAe5C;;;;;OAKG;IACG,sBAAsB,CAC1B,SAAS,EAAE,MAAM,EACjB,eAAe,EAAE,MAAM,EAAE,GACxB,OAAO,CAAC,cAAc,EAAE,CAAC;IA0D5B;;;;OAIG;IACH,qBAAqB,CACnB,gBAAgB,EAAE,MAAM,EACxB,gBAAgB,EAAE,MAAM,EACxB,cAAc,EAAE,cAAc,GAAG,UAAU,EAC3C,MAAM,EAAE,MAAM,GACb,IAAI;IAcP;;;OAGG;IACH,uBAAuB,CAAC,UAAU,EAAE,MAAM,GAAG,KAAK,CAAC;QACjD,kBAAkB,EAAE,MAAM,CAAC;QAC3B,kBAAkB,EAAE,MAAM,CAAC;QAC3B,eAAe,EAAE,cAAc,GAAG,UAAU,CAAC;QAC7C,OAAO,EAAE,MAAM,CAAC;KACjB,CAAC;IAqBF;;;;OAIG;IACH,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,oBAAoB,EAAE,MAAM,EAAE,GAAG,OAAO;IAY9E;;;OAGG;IACH,IAAI,IAAI,eAAe;IAYvB;;OAEG;IACH,IAAI,CAAC,KAAK,EAAE,eAAe,GAAG,IAAI;IAIlC;;OAEG;IACH,QAAQ,IAAI,eAAe;CAG5B"}

package/dist/goal-dependency-graph.js

@@ -0,0 +1,291 @@
+import { DependencyGraphSchema } from "./types/dependency.js";
+/**
+ * GoalDependencyGraph manages a DAG of dependencies between goals.
+ *
+ * Supports 4 edge types:
+ *   - prerequisite: goal A must complete before goal B can start
+ *   - resource_conflict: goals A and B compete for the same resource
+ *   - synergy: progress on goal A helps goal B
+ *   - conflict: goals A and B have incompatible objectives
+ *
+ * Persistence: ~/.motiva/dependency-graph.json (via StateManager.readRaw/writeRaw)
+ */
+export class GoalDependencyGraph {
+    stateManager;
+    llmClient;
+    graph;
+    constructor(stateManager, llmClient) {
+        this.stateManager = stateManager;
+        this.llmClient = llmClient;
+        this.graph = this.load();
+    }
+    // ─── CRUD ───
+    /**
+     * Adds an edge to the graph.
+     * For prerequisite edges, validates that the addition would not create a cycle.
+     */
+    addEdge(edge) {
+        if (edge.type === "prerequisite" && this.detectCycle(edge.from_goal_id, edge.to_goal_id)) {
+            throw new Error(`Adding prerequisite ${edge.from_goal_id} → ${edge.to_goal_id} would create a cycle`);
+        }
+        const fullEdge = {
+            ...edge,
+            created_at: new Date().toISOString(),
+        };
+        // Add nodes if not present
+        if (!this.graph.nodes.includes(edge.from_goal_id)) {
+            this.graph.nodes.push(edge.from_goal_id);
+        }
+        if (!this.graph.nodes.includes(edge.to_goal_id)) {
+            this.graph.nodes.push(edge.to_goal_id);
+        }
+        this.graph.edges.push(fullEdge);
+        this.graph.updated_at = new Date().toISOString();
+        this.save(this.graph);
+        return fullEdge;
+    }
+    /**
+     * Removes an edge matching from/to/type from the graph.
+     */
+    removeEdge(fromGoalId, toGoalId, type) {
+        this.graph.edges = this.graph.edges.filter((e) => !(e.from_goal_id === fromGoalId &&
+            e.to_goal_id === toGoalId &&
+            e.type === type));
+        this.graph.updated_at = new Date().toISOString();
+        this.save(this.graph);
+    }
+    /**
+     * Updates the status of an edge identified by from/to.
+     */
+    updateEdgeStatus(fromGoalId, toGoalId, status) {
+        const edge = this.getEdge(fromGoalId, toGoalId);
+        if (edge) {
+            edge.status = status;
+            this.graph.updated_at = new Date().toISOString();
+            this.save(this.graph);
+        }
+    }
+    /**
+     * Returns all edges where goalId appears as either from or to.
+     */
+    getEdges(goalId) {
+        return this.graph.edges.filter((e) => e.from_goal_id === goalId || e.to_goal_id === goalId);
+    }
+    /**
+     * Returns the first edge matching from/to (and optionally type), or null.
+     */
+    getEdge(fromGoalId, toGoalId, type) {
+        return (this.graph.edges.find((e) => e.from_goal_id === fromGoalId &&
+            e.to_goal_id === toGoalId &&
+            (!type || e.type === type)) ?? null);
+    }
+    // ─── DAG Validation ───
+    /**
+     * Detects whether adding a prerequisite edge from→to would create a cycle.
+     *
+     * Uses BFS starting from "to" following active prerequisite edges.
+     * If we can reach "from", adding from→to would form a cycle.
+     */
+    detectCycle(fromGoalId, toGoalId) {
+        const visited = new Set();
+        const queue = [toGoalId];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current === fromGoalId)
+                return true;
+            if (visited.has(current))
+                continue;
+            visited.add(current);
+            // Follow active prerequisite edges where current is the from_goal_id
+            for (const edge of this.graph.edges) {
+                if (edge.type === "prerequisite" &&
+                    edge.from_goal_id === current &&
+                    edge.status === "active") {
+                    queue.push(edge.to_goal_id);
+                }
+            }
+        }
+        return false;
+    }
+    // ─── Scheduling Influence ───
+    /**
+     * Returns active prerequisite edges that must be satisfied before goalId can proceed.
+     */
+    getPrerequisites(goalId) {
+        return this.graph.edges.filter((e) => e.to_goal_id === goalId &&
+            e.type === "prerequisite" &&
+            e.status === "active");
+    }
+    /**
+     * Returns true if goalId has unresolved prerequisites.
+     */
+    isBlocked(goalId) {
+        return this.getPrerequisites(goalId).length > 0;
+    }
+    /**
+     * Returns the IDs of goals that must complete before goalId can proceed.
+     */
+    getBlockingGoals(goalId) {
+        return this.getPrerequisites(goalId).map((e) => e.from_goal_id);
+    }
+    /**
+     * Returns active resource_conflict edges involving goalId.
+     */
+    getResourceConflicts(goalId) {
+        return this.graph.edges.filter((e) => e.type === "resource_conflict" &&
+            e.status === "active" &&
+            (e.from_goal_id === goalId || e.to_goal_id === goalId));
+    }
+    /**
+     * Returns goal IDs that have a synergy relationship with goalId.
+     */
+    getSynergyPartners(goalId) {
+        return this.graph.edges
+            .filter((e) => e.type === "synergy" &&
+            e.status === "active" &&
+            (e.from_goal_id === goalId || e.to_goal_id === goalId))
+            .map((e) => e.from_goal_id === goalId ? e.to_goal_id : e.from_goal_id);
+    }
+    // ─── LLM Auto-detection ───
+    /**
+     * Uses an LLM to automatically detect dependency relationships between a new goal
+     * and a set of existing goals. Detected dependencies are added to the graph.
+     *
+     * Returns an empty array if no LLM client is configured or no existing goals are provided.
+     */
+    async autoDetectDependencies(newGoalId, existingGoalIds) {
+        if (!this.llmClient || existingGoalIds.length === 0)
+            return [];
+        const prompt = `Analyze dependencies between a new goal and existing goals.
+
+New goal ID: ${newGoalId}
+Existing goal IDs: ${existingGoalIds.join(", ")}
+
+For each relationship found, return a JSON array of objects with:
+- from_goal_id: string
+- to_goal_id: string
+- type: "prerequisite" | "resource_conflict" | "synergy" | "conflict"
+- condition: string or null (when is this dependency satisfied?)
+- affected_dimensions: string[] (which dimensions are affected)
+- reasoning: string (why this dependency exists)
+- detection_confidence: number 0-1
+
+Return empty array [] if no dependencies found.`;
+        const messages = [{ role: "user", content: prompt }];
+        try {
+            const response = await this.llmClient.sendMessage(messages);
+            const parsed = JSON.parse(response.content);
+            if (!Array.isArray(parsed))
+                return [];
+            const edges = [];
+            for (const item of parsed) {
+                try {
+                    const edge = this.addEdge({
+                        from_goal_id: String(item["from_goal_id"] ?? ""),
+                        to_goal_id: String(item["to_goal_id"] ?? ""),
+                        type: item["type"] ?? "conflict",
+                        status: "active",
+                        condition: typeof item["condition"] === "string" ? item["condition"] : null,
+                        affected_dimensions: Array.isArray(item["affected_dimensions"])
+                            ? item["affected_dimensions"]
+                            : [],
+                        mitigation: null,
+                        detection_confidence: typeof item["detection_confidence"] === "number"
+                            ? item["detection_confidence"]
+                            : 0.5,
+                        reasoning: typeof item["reasoning"] === "string" ? item["reasoning"] : null,
+                    });
+                    edges.push(edge);
+                }
+                catch {
+                    // Skip malformed items
+                }
+            }
+            return edges;
+        }
+        catch {
+            return [];
+        }
+    }
+    // ─── Strategy Dependencies ───
+    /**
+     * Add a strategy-level dependency between two strategies.
+     * Uses DependencyType "strategy_dependency" for the underlying edge.
+     * The sourceStrategyId is stored in from_goal_id and targetStrategyId in to_goal_id.
+     */
+    addStrategyDependency(sourceStrategyId, targetStrategyId, dependencyType, goalId) {
+        this.addEdge({
+            from_goal_id: sourceStrategyId,
+            to_goal_id: targetStrategyId,
+            type: "strategy_dependency",
+            status: "active",
+            condition: null,
+            affected_dimensions: [],
+            mitigation: null,
+            detection_confidence: 1.0,
+            reasoning: `strategy_dependency_type:${dependencyType};goal_id:${goalId}`,
+        });
+    }
+    /**
+     * Get all strategy dependencies for a given strategy.
+     * Returns edges where this strategy is either source or target.
+     */
+    getStrategyDependencies(strategyId) {
+        return this.graph.edges
+            .filter((e) => e.type === "strategy_dependency" &&
+            (e.from_goal_id === strategyId || e.to_goal_id === strategyId))
+            .map((e) => {
+            // Extract dependency_type and goal_id from the reasoning field
+            const reasoning = e.reasoning ?? "";
+            const dtMatch = reasoning.match(/strategy_dependency_type:(prerequisite|enhances)/);
+            const giMatch = reasoning.match(/goal_id:([^;]+)/);
+            return {
+                source_strategy_id: e.from_goal_id,
+                target_strategy_id: e.to_goal_id,
+                dependency_type: (dtMatch?.[1] ?? "prerequisite"),
+                goal_id: giMatch?.[1] ?? "",
+            };
+        });
+    }
+    /**
+     * Check if a strategy is blocked by a prerequisite dependency.
+     * Returns true if the strategy has a prerequisite dependency where
+     * the source strategy is NOT in completedStrategyIds.
+     */
+    isStrategyBlocked(strategyId, completedStrategyIds) {
+        const deps = this.getStrategyDependencies(strategyId);
+        return deps.some((d) => d.dependency_type === "prerequisite" &&
+            d.target_strategy_id === strategyId &&
+            !completedStrategyIds.includes(d.source_strategy_id));
+    }
+    // ─── Persistence ───
+    /**
+     * Loads the dependency graph from disk.
+     * Returns an empty graph if no file exists or parsing fails.
+     */
+    load() {
+        try {
+            const raw = this.stateManager.readRaw("dependency-graph.json");
+            if (raw !== null) {
+                return DependencyGraphSchema.parse(raw);
+            }
+        }
+        catch {
+            // ignore parse errors — start fresh
+        }
+        return { nodes: [], edges: [], updated_at: new Date().toISOString() };
+    }
+    /**
+     * Persists the dependency graph to disk.
+     */
+    save(graph) {
+        this.stateManager.writeRaw("dependency-graph.json", graph);
+    }
+    /**
+     * Returns the current in-memory graph.
+     */
+    getGraph() {
+        return this.graph;
+    }
+}
+//# sourceMappingURL=goal-dependency-graph.js.map

package/dist/goal-dependency-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"goal-dependency-graph.js","sourceRoot":"","sources":["../src/goal-dependency-graph.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,qBAAqB,EAAE,MAAM,uBAAuB,CAAC;AAG9D;;;;;;;;;;GAUG;AACH,MAAM,OAAO,mBAAmB;IACtB,YAAY,CAAe;IAC3B,SAAS,CAAc;IACvB,KAAK,CAAkB;IAE/B,YAAY,YAA0B,EAAE,SAAsB;QAC5D,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;IAC3B,CAAC;IAED,eAAe;IAEf;;;OAGG;IACH,OAAO,CAAC,IAAwC;QAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACzF,MAAM,IAAI,KAAK,CACb,uBAAuB,IAAI,CAAC,YAAY,MAAM,IAAI,CAAC,UAAU,uBAAuB,CACrF,CAAC;QACJ,CAAC;QAED,MAAM,QAAQ,GAAmB;YAC/B,GAAG,IAAI;YACP,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;QAEF,2BAA2B;QAC3B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;YAClD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAChD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACzC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,UAAkB,EAAE,QAAgB,EAAE,IAAoB;QACnE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CACxC,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CACC,CAAC,CAAC,YAAY,KAAK,UAAU;YAC7B,CAAC,CAAC,UAAU,KAAK,QAAQ;YACzB,CAAC,CAAC,IAAI,KAAK,IAAI,CAChB,CACJ,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,gBAAgB,CACd,UAAkB,EAClB,QAAgB,EAChB,MAA4B;QAE5B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;QAChD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;YACrB,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;YACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,MAAc;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,MAAM,IAAI,CAAC,CAAC,UAAU,KAAK,MAAM,CAC5D,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,OAAO,CACL,UAAkB,EAClB,QAAgB,EAChB,IAAqB;QAErB,OAAO,CACL,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CACnB,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,YAAY,KAAK,UAAU;YAC7B,CAAC,CAAC,UAAU,KAAK,QAAQ;YACzB,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAC7B,IAAI,IAAI,CACV,CAAC;IACJ,CAAC;IAED,yBAAyB;IAEzB;;;;;OAKG;IACH,WAAW,CAAC,UAAkB,EAAE,QAAgB;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAa,CAAC,QAAQ,CAAC,CAAC;QAEnC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,KAAK,UAAU;gBAAE,OAAO,IAAI,CAAC;YACxC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YACnC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAErB,qEAAqE;YACrE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;gBACpC,IACE,IAAI,CAAC,IAAI,KAAK,cAAc;oBAC5B,IAAI,CAAC,YAAY,KAAK,OAAO;oBAC7B,IAAI,CAAC,MAAM,KAAK,QAAQ,EACxB,CAAC;oBACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,+BAA+B;IAE/B;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,UAAU,KAAK,MAAM;YACvB,CAAC,CAAC,IAAI,KAAK,cAAc;YACzB,CAAC,CAAC,MAAM,KAAK,QAAQ,CACxB,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,MAAc;QACtB,OAAO,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAc;QAC7B,OAAO,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,MAAc;QACjC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,mBAAmB;YAC9B,CAAC,CAAC,MAAM,KAAK,QAAQ;YACrB,CAAC,CAAC,CAAC,YAAY,KAAK,MAAM,IAAI,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,CACzD,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,MAAc;QAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK;aACpB,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,SAAS;YACpB,CAAC,CAAC,MAAM,KAAK,QAAQ;YACrB,CAAC,CAAC,CAAC,YAAY,KAAK,MAAM,IAAI,CAAC,CAAC,UAAU,KAAK,MAAM,CAAC,CACzD;aACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACT,CAAC,CAAC,YAAY,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAC1D,CAAC;IACN,CAAC;IAED,6BAA6B;IAE7B;;;;;OAKG;IACH,KAAK,CAAC,sBAAsB,CAC1B,SAAiB,EACjB,eAAyB;QAEzB,IAAI,CAAC,IAAI,CAAC,SAAS,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAE/D,MAAM,MAAM,GAAG;;eAEJ,SAAS;qBACH,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC;;;;;;;;;;;gDAWC,CAAC;QAE7C,MAAM,QAAQ,GAAiB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;QAEnE,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;YAC5D,MAAM,MAAM,GAAY,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACrD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;gBAAE,OAAO,EAAE,CAAC;YAEtC,MAAM,KAAK,GAAqB,EAAE,CAAC;YACnC,KAAK,MAAM,IAAI,IAAI,MAAmC,EAAE,CAAC;gBACvD,IAAI,CAAC;oBACH,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;wBACxB,YAAY,EAAE,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC;wBAChD,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC;wBAC5C,IAAI,EAAG,IAAI,CAAC,MAAM,CAAoB,IAAI,UAAU;wBACpD,MAAM,EAAE,QAAQ;wBAChB,SAAS,EAAE,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI;wBAC3E,mBAAmB,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;4BAC7D,CAAC,CAAE,IAAI,CAAC,qBAAqB,CAAc;4BAC3C,CAAC,CAAC,EAAE;wBACN,UAAU,EAAE,IAAI;wBAChB,oBAAoB,EAClB,OAAO,IAAI,CAAC,sBAAsB,CAAC,KAAK,QAAQ;4BAC9C,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC;4BAC9B,CAAC,CAAC,GAAG;wBACT,SAAS,EAAE,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI;qBAC5E,CAAC,CAAC;oBACH,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;gBAAC,MAAM,CAAC;oBACP,uBAAuB;gBACzB,CAAC;YACH,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,EAAE,CAAC;QACZ,CAAC;IACH,CAAC;IAED,gCAAgC;IAEhC;;;;OAIG;IACH,qBAAqB,CACnB,gBAAwB,EACxB,gBAAwB,EACxB,cAA2C,EAC3C,MAAc;QAEd,IAAI,CAAC,OAAO,CAAC;YACX,YAAY,EAAE,gBAAgB;YAC9B,UAAU,EAAE,gBAAgB;YAC5B,IAAI,EAAE,qBAAqB;YAC3B,MAAM,EAAE,QAAQ;YAChB,SAAS,EAAE,IAAI;YACf,mBAAmB,EAAE,EAAE;YACvB,UAAU,EAAE,IAAI;YAChB,oBAAoB,EAAE,GAAG;YACzB,SAAS,EAAE,4BAA4B,cAAc,YAAY,MAAM,EAAE;SAC1E,CAAC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,uBAAuB,CAAC,UAAkB;QAMxC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK;aACpB,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,qBAAqB;YAChC,CAAC,CAAC,CAAC,YAAY,KAAK,UAAU,IAAI,CAAC,CAAC,UAAU,KAAK,UAAU,CAAC,CACjE;aACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACT,+DAA+D;YAC/D,MAAM,SAAS,GAAG,CAAC,CAAC,SAAS,IAAI,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,kDAAkD,CAAC,CAAC;YACpF,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC;YACnD,OAAO;gBACL,kBAAkB,EAAE,CAAC,CAAC,YAAY;gBAClC,kBAAkB,EAAE,CAAC,CAAC,UAAU;gBAChC,eAAe,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,cAAc,CAAgC;gBAChF,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE;aAC5B,CAAC;QACJ,CAAC,CAAC,CAAC;IACP,CAAC;IAED;;;;OAIG;IACH,iBAAiB,CAAC,UAAkB,EAAE,oBAA8B;QAClE,MAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,UAAU,CAAC,CAAC;QACtD,OAAO,IAAI,CAAC,IAAI,CACd,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,eAAe,KAAK,cAAc;YACpC,CAAC,CAAC,kBAAkB,KAAK,UAAU;YACnC,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC,CAAC,kBAAkB,CAAC,CACvD,CAAC;IACJ,CAAC;IAED,sBAAsB;IAEtB;;;OAGG;IACH,IAAI;QACF,IAAI,CAAC;YACH,MAAM,GAAG,GAAG,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,uBAAuB,CAAC,CAAC;YAC/D,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;gBACjB,OAAO,qBAAqB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,oCAAoC;QACtC,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE,CAAC;IACxE,CAAC;IAED;;OAEG;IACH,IAAI,CAAC,KAAsB;QACzB,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,uBAAuB,EAAE,KAAK,CAAC,CAAC;IAC7D,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;CACF"}

package/dist/goal-negotiator.d.ts

@@ -0,0 +1,109 @@
+import { z } from "zod";
+import type { StateManager } from "./state-manager.js";
+import type { ILLMClient } from "./llm/llm-client.js";
+import { EthicsGate } from "./traits/ethics-gate.js";
+import { ObservationEngine } from "./observation/observation-engine.js";
+import type { Goal } from "./types/goal.js";
+import type { EthicsVerdict } from "./types/ethics.js";
+import type { NegotiationLog, NegotiationResponse } from "./types/negotiation.js";
+import type { CharacterConfig } from "./types/character.js";
+import type { SatisficingJudge } from "./drive/satisficing-judge.js";
+import type { GoalTreeManager } from "./goal-tree-manager.js";
+import type { GoalDecompositionConfig, DecompositionResult } from "./types/goal-tree.js";
+import type { CapabilityDetector } from "./observation/capability-detector.js";
+export declare class EthicsRejectedError extends Error {
+    readonly verdict: EthicsVerdict;
+    constructor(verdict: EthicsVerdict);
+}
+declare const GoalSuggestionSchema: z.ZodObject<{
+    title: z.ZodString;
+    description: z.ZodString;
+    rationale: z.ZodString;
+    dimensions_hint: z.ZodArray<z.ZodString, "many">;
+}, "strip", z.ZodTypeAny, {
+    title: string;
+    description: string;
+    rationale: string;
+    dimensions_hint: string[];
+}, {
+    title: string;
+    description: string;
+    rationale: string;
+    dimensions_hint: string[];
+}>;
+export type GoalSuggestion = z.infer<typeof GoalSuggestionSchema>;
+export declare class GoalNegotiator {
+    private readonly stateManager;
+    private readonly llmClient;
+    private readonly ethicsGate;
+    private readonly observationEngine;
+    private readonly characterConfig;
+    private readonly satisficingJudge?;
+    private readonly goalTreeManager?;
+    private readonly adapterCapabilities?;
+    constructor(stateManager: StateManager, llmClient: ILLMClient, ethicsGate: EthicsGate, observationEngine: ObservationEngine, characterConfig?: CharacterConfig, satisficingJudge?: SatisficingJudge, // Phase 2: auto-mapping proposals
+    goalTreeManager?: GoalTreeManager, adapterCapabilities?: Array<{
+        adapterType: string;
+        capabilities: string[];
+    }>);
+    /**
+     * Compute the feasibility ratio threshold for "ambitious" vs "infeasible".
+     * Driven by caution_level (1=conservative/strict → 2.0, 5=ambitious → 4.0).
+     * Formula: threshold = 1.5 + (caution_level * 0.5)
+     */
+    private getFeasibilityThreshold;
+    negotiate(rawGoalDescription: string, options?: {
+        deadline?: string;
+        constraints?: string[];
+        timeHorizonDays?: number;
+    }): Promise<{
+        goal: Goal;
+        response: NegotiationResponse;
+        log: NegotiationLog;
+    }>;
+    decompose(goalId: string, parentGoal: Goal): Promise<{
+        subgoals: Goal[];
+        rejectedSubgoals: Array<{
+            description: string;
+            reason: string;
+        }>;
+    }>;
+    renegotiate(goalId: string, trigger: "stall" | "new_info" | "user_request", context?: string): Promise<{
+        goal: Goal;
+        response: NegotiationResponse;
+        log: NegotiationLog;
+    }>;
+    /**
+     * Decompose a negotiated goal into subgoals using GoalTreeManager.
+     * For depth >= 2, skip negotiation and auto-accept.
+     * Returns null if goalTreeManager is not injected.
+     */
+    decomposeIntoSubgoals(goalId: string, config?: GoalDecompositionConfig): Promise<DecompositionResult | null>;
+    /**
+     * Suggest measurable improvement goals based on the given context.
+     * Does NOT save goals — it only suggests. Use negotiate() to register a suggestion.
+     */
+    suggestGoals(context: string, options?: {
+        maxSuggestions?: number;
+        existingGoals?: string[];
+        repoPath?: string;
+        capabilityDetector?: CapabilityDetector;
+    }): Promise<GoalSuggestion[]>;
+    private filterSuggestions;
+    getNegotiationLog(goalId: string): NegotiationLog | null;
+    private saveNegotiationLog;
+    private evaluateQualitatively;
+    private determineResponseType;
+    /**
+     * Estimate daily change rate from dimension history.
+     * Returns null if insufficient data.
+     */
+    private estimateChangeRate;
+    /**
+     * Calculate counter-proposal target given baseline, change rate, and time horizon.
+     * Uses acceleration factor from character.md.
+     */
+    static calculateRealisticTarget(baseline: number, changeRate: number, timeHorizonDays: number): number;
+}
+export {};
+//# sourceMappingURL=goal-negotiator.d.ts.map

package/dist/goal-negotiator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"goal-negotiator.d.ts","sourceRoot":"","sources":["../src/goal-negotiator.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AACxB,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACvD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACtD,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AACrD,OAAO,EAAE,iBAAiB,EAAE,MAAM,qCAAqC,CAAC;AAExE,OAAO,KAAK,EAAE,IAAI,EAAa,MAAM,iBAAiB,CAAC;AACvD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAOvD,OAAO,KAAK,EAGV,cAAc,EACd,mBAAmB,EACpB,MAAM,wBAAwB,CAAC;AAChC,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAE5D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AACrE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAC9D,OAAO,KAAK,EACV,uBAAuB,EACvB,mBAAmB,EACpB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,sCAAsC,CAAC;AAW/E,qBAAa,mBAAoB,SAAQ,KAAK;aAChB,OAAO,EAAE,aAAa;gBAAtB,OAAO,EAAE,aAAa;CAInD;AAwPD,QAAA,MAAM,oBAAoB;;;;;;;;;;;;;;;EAKxB,CAAC;AAIH,MAAM,MAAM,cAAc,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,oBAAoB,CAAC,CAAC;AAgHlE,qBAAa,cAAc;IACzB,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAe;IAC5C,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAa;IACvC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAa;IACxC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAoB;IACtD,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAkB;IAClD,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAmB;IACrD,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAkB;IACnD,OAAO,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAyD;gBAG5F,YAAY,EAAE,YAAY,EAC1B,SAAS,EAAE,UAAU,EACrB,UAAU,EAAE,UAAU,EACtB,iBAAiB,EAAE,iBAAiB,EACpC,eAAe,CAAC,EAAE,eAAe,EACjC,gBAAgB,CAAC,EAAE,gBAAgB,EAAG,kCAAkC;IACxE,eAAe,CAAC,EAAE,eAAe,EACjC,mBAAmB,CAAC,EAAE,KAAK,CAAC;QAAE,WAAW,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC;IAY9E;;;;OAIG;IACH,OAAO,CAAC,uBAAuB;IAMzB,SAAS,CACb,kBAAkB,EAAE,MAAM,EAC1B,OAAO,CAAC,EAAE;QACR,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,WAAW,CAAC,EAAE,MAAM,EAAE,CAAC;QACvB,eAAe,CAAC,EAAE,MAAM,CAAC;KAC1B,GACA,OAAO,CAAC;QACT,IAAI,EAAE,IAAI,CAAC;QACX,QAAQ,EAAE,mBAAmB,CAAC;QAC9B,GAAG,EAAE,cAAc,CAAC;KACrB,CAAC;IAoQI,SAAS,CACb,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,IAAI,GACf,OAAO,CAAC;QACT,QAAQ,EAAE,IAAI,EAAE,CAAC;QACjB,gBAAgB,EAAE,KAAK,CAAC;YAAE,WAAW,EAAE,MAAM,CAAC;YAAC,MAAM,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;KAClE,CAAC;IAqGI,WAAW,CACf,MAAM,EAAE,MAAM,EACd,OAAO,EAAE,OAAO,GAAG,UAAU,GAAG,cAAc,EAC9C,OAAO,CAAC,EAAE,MAAM,GACf,OAAO,CAAC;QACT,IAAI,EAAE,IAAI,CAAC;QACX,QAAQ,EAAE,mBAAmB,CAAC;QAC9B,GAAG,EAAE,cAAc,CAAC;KACrB,CAAC;IAuPF;;;;OAIG;IACG,qBAAqB,CACzB,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,uBAAuB,GAC/B,OAAO,CAAC,mBAAmB,GAAG,IAAI,CAAC;IAsBtC;;;OAGG;IACG,YAAY,CAChB,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE;QACR,cAAc,CAAC,EAAE,MAAM,CAAC;QACxB,aAAa,CAAC,EAAE,MAAM,EAAE,CAAC;QACzB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,kBAAkB,CAAC,EAAE,kBAAkB,CAAC;KACzC,GACA,OAAO,CAAC,cAAc,EAAE,CAAC;YAsDd,iBAAiB;IA4C/B,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,cAAc,GAAG,IAAI;IAQxD,OAAO,CAAC,kBAAkB;YAKZ,qBAAqB;IAmDnC,OAAO,CAAC,qBAAqB;IA+F7B;;;OAGG;IACH,OAAO,CAAC,kBAAkB;IAoB1B;;;OAGG;IACH,MAAM,CAAC,wBAAwB,CAC7B,QAAQ,EAAE,MAAM,EAChB,UAAU,EAAE,MAAM,EAClB,eAAe,EAAE,MAAM,GACtB,MAAM;CAGV"}