pulseed 0.1.5 → 0.2.0

package/dist/orchestrator/goal/state-aggregator.js

@@ -0,0 +1,331 @@
+import { StateError } from "../../base/utils/errors.js";
+import { aggregateValues } from "../../platform/drive/satisficing-judge.js";
+import { dimensionProgress } from "../../platform/drive/gap-calculator.js";
+/**
+ * StateAggregator handles upward aggregation (children → parent) and
+ * downward propagation (parent → children) of goal state, plus cascade
+ * completion detection.
+ *
+ * Design ref: docs/design/goal-tree.md §5 (state aggregation) and §6 (state propagation).
+ */
+export class StateAggregator {
+    stateManager;
+    satisficingJudge;
+    /**
+     * In-memory registry of StateAggregationRules keyed by parent_id.
+     * Rules are injected via registerAggregationRule().
+     */
+    aggregationRules = new Map();
+    constructor(stateManager, satisficingJudge) {
+        this.stateManager = stateManager;
+        this.satisficingJudge = satisficingJudge;
+    }
+    /**
+     * Register (or replace) a StateAggregationRule for a parent goal.
+     * The rule overrides the default "min" aggregation for that parent.
+     */
+    registerAggregationRule(rule) {
+        this.aggregationRules.set(rule.parent_id, rule);
+    }
+    // ─── Upward Aggregation ───
+    /**
+     * Aggregate the current states of all direct children of parentId into a
+     * single AggregatedState.
+     *
+     * Algorithm (goal-tree.md §5):
+     *   1. Load parent goal to get children_ids.
+     *   2. For each child, compute a normalized gap (average of per-dimension gaps).
+     *   3. Determine aggregation method from registered rule or default "min".
+     *   4. Aggregate child gaps with the chosen method.
+     *   5. Confidence = min(child confidences) — conservative.
+     *
+     * @throws if the parent goal cannot be found.
+     */
+    async aggregateChildStates(parentId) {
+        const parent = await this.stateManager.loadGoal(parentId);
+        if (parent === null) {
+            throw new StateError(`StateAggregator.aggregateChildStates: parent goal "${parentId}" not found`);
+        }
+        const childIds = parent.children_ids;
+        const childGaps = {};
+        const childCompletions = {};
+        const childConfidences = [];
+        for (const childId of childIds) {
+            const child = await this.stateManager.loadGoal(childId);
+            if (child === null) {
+                // Missing child: treat as fully incomplete with low confidence
+                childGaps[childId] = 1.0;
+                childCompletions[childId] = false;
+                childConfidences.push(0);
+                continue;
+            }
+            const gap = computeChildGap(child);
+            childGaps[childId] = gap;
+            childCompletions[childId] = child.status === "completed";
+            const minConf = minChildConfidence(child);
+            childConfidences.push(minConf);
+        }
+        const aggregationMethod = this.resolveAggregationMethod(parentId);
+        let aggregatedGap;
+        if (childIds.length === 0) {
+            aggregatedGap = 0;
+        }
+        else {
+            const gapValues = childIds.map((id) => childGaps[id] ?? 1.0);
+            if (aggregationMethod === "all_required") {
+                // all_required: parent is blocked as long as any child is incomplete
+                // Express as minimum fulfillment ratio (1 - gap)
+                const fulfillmentRatios = gapValues.map((g) => 1 - g);
+                const minFulfillment = aggregateValues(fulfillmentRatios, "all_required");
+                aggregatedGap = 1 - minFulfillment;
+            }
+            else {
+                aggregatedGap = aggregateValues(gapValues, aggregationMethod);
+            }
+        }
+        const aggregatedConfidence = childConfidences.length > 0 ? Math.min(...childConfidences) : 1.0;
+        const clampedGap = Math.min(1, Math.max(0, aggregatedGap));
+        // Persist aggregated progress back to the parent goal so that
+        // `pulseed status --goal <id>` shows progress rather than "not yet measured".
+        if (childIds.length > 0) {
+            const freshParent = await this.stateManager.loadGoal(parentId);
+            if (freshParent !== null && freshParent.dimensions.length > 0) {
+                const now = new Date().toISOString();
+                const updatedDimensions = freshParent.dimensions.map((dim) => {
+                    const t = dim.threshold;
+                    // Only update numeric threshold dimensions
+                    if (t.type === "present" || t.type === "match")
+                        return dim;
+                    // Derive a synthetic current_value from the aggregated progress (1 - gap)
+                    let syntheticValue;
+                    if (t.type === "min") {
+                        syntheticValue = t.value * (1 - clampedGap);
+                    }
+                    else if (t.type === "max") {
+                        // For max threshold: gap=0 means at/below cap (best), gap=1 means far above cap (worst).
+                        // syntheticValue must be ABOVE threshold when gap > 0, so use (1 + clampedGap).
+                        syntheticValue = t.value * (1 + clampedGap);
+                    }
+                    else {
+                        // range: use midpoint as reference
+                        const mid = (t.low + t.high) / 2;
+                        syntheticValue = mid * (1 - clampedGap);
+                    }
+                    return {
+                        ...dim,
+                        current_value: syntheticValue,
+                        confidence: aggregatedConfidence,
+                        last_updated: now,
+                    };
+                });
+                await this.stateManager.saveGoal({
+                    ...freshParent,
+                    dimensions: updatedDimensions,
+                    updated_at: now,
+                });
+            }
+        }
+        return {
+            parent_id: parentId,
+            aggregated_gap: clampedGap,
+            aggregated_confidence: aggregatedConfidence,
+            child_gaps: childGaps,
+            child_completions: childCompletions,
+            aggregation_method: aggregationMethod,
+            timestamp: new Date().toISOString(),
+        };
+    }
+    // ─── Downward Propagation ───
+    /**
+     * Propagate parent-level state changes down to all direct children.
+     *
+     * Two propagation types (goal-tree.md §5):
+     *   a. Constraint propagation: new parent constraints are appended to children
+     *      that don't already have them (idempotent).
+     *   b. Deadline propagation: if the parent deadline differs from the children's
+     *      proportional position, adjust each child's deadline proportionally.
+     *
+     * Note: this method reads the parent goal's CURRENT deadline; to propagate a
+     * deadline change the caller must first save the updated parent, then call
+     * propagateStateDown().
+     *
+     * @throws if the parent goal cannot be found.
+     */
+    async propagateStateDown(parentId) {
+        const parent = await this.stateManager.loadGoal(parentId);
+        if (parent === null) {
+            throw new StateError(`StateAggregator.propagateStateDown: parent goal "${parentId}" not found`);
+        }
+        const parentDeadlineMs = parseDeadlineMs(parent.deadline);
+        const now = Date.now();
+        for (const childId of parent.children_ids) {
+            const child = await this.stateManager.loadGoal(childId);
+            if (child === null)
+                continue;
+            let updated = { ...child };
+            // ─── a. Constraint propagation ───
+            const existingConstraints = new Set(child.constraints);
+            const newConstraints = parent.constraints.filter((c) => !existingConstraints.has(c));
+            if (newConstraints.length > 0) {
+                updated = {
+                    ...updated,
+                    constraints: [...child.constraints, ...newConstraints],
+                };
+            }
+            // ─── b. Deadline propagation ───
+            if (parentDeadlineMs !== null) {
+                const childDeadlineMs = parseDeadlineMs(child.deadline);
+                if (childDeadlineMs !== null) {
+                    // Proportional adjustment:
+                    //   remaining_parent = parentDeadline - now
+                    //   remaining_child  = childDeadline - now
+                    //   ratio = remaining_parent / original_remaining_parent
+                    // Since we don't store the "original" parent deadline, we derive
+                    // the ratio from how much of the parent's window is left relative
+                    // to the child's remaining window.  The simplest safe approach
+                    // (matching goal-tree.md §5) is:
+                    //   new_child_deadline = now + (childRemainingMs / parentRemainingMs) * parentRemainingMs
+                    // which simplifies to: keep child proportional within parent's window.
+                    //
+                    // Concretely: child gets the same ratio of parent's deadline window
+                    // as the child's remaining time relative to the parent.
+                    const parentRemainingMs = parentDeadlineMs - now;
+                    const childRemainingMs = childDeadlineMs - now;
+                    if (parentRemainingMs > 0 && childRemainingMs !== parentRemainingMs) {
+                        // New child deadline = now + min(childRemainingMs, parentRemainingMs)
+                        // so the child is never later than the parent.
+                        const newChildRemainingMs = Math.min(childRemainingMs, parentRemainingMs);
+                        const newChildDeadlineMs = now + newChildRemainingMs;
+                        updated = {
+                            ...updated,
+                            deadline: new Date(newChildDeadlineMs).toISOString(),
+                        };
+                    }
+                }
+            }
+            if (updated.constraints !== child.constraints ||
+                updated.deadline !== child.deadline) {
+                await this.stateManager.saveGoal({
+                    ...updated,
+                    updated_at: new Date().toISOString(),
+                });
+            }
+        }
+    }
+    // ─── Completion Cascade ───
+    /**
+     * Walk up the tree from goalId and return IDs of ancestors that have
+     * become eligible for completion because ALL of their children are either
+     * "completed" or cancelled (treated as pruned-and-done).
+     *
+     * The starting goalId is treated as if it were already completed — this
+     * allows callers to invoke checkCompletionCascade immediately after deciding
+     * to complete a goal, before the status has been persisted.
+     *
+     * This method does NOT mutate any goal status — the caller decides what to
+     * do with the returned list (e.g. mark them "completed").
+     *
+     * @param goalId Starting point (usually the goal that just completed).
+     * @returns Ordered array of newly-completable ancestor IDs (bottom-up order).
+     */
+    async checkCompletionCascade(goalId) {
+        const completable = [];
+        // Track which goals are effectively complete for the purpose of this walk.
+        // The starting goal is treated as complete even if its DB status is "active".
+        const effectivelyComplete = new Set([goalId]);
+        let currentId = goalId;
+        // Walk up the parent chain
+        while (currentId !== null) {
+            const current = await this.stateManager.loadGoal(currentId);
+            if (current === null)
+                break;
+            const parentId = current.parent_id;
+            if (parentId === null)
+                break; // reached root — stop (root itself has no parent to cascade to)
+            const parent = await this.stateManager.loadGoal(parentId);
+            if (parent === null)
+                break;
+            // Check whether ALL children of the parent are done
+            let allChildrenDone = true;
+            for (const childId of parent.children_ids) {
+                if (effectivelyComplete.has(childId))
+                    continue; // treated as complete
+                const child = await this.stateManager.loadGoal(childId);
+                if (child === null) {
+                    allChildrenDone = false;
+                    break;
+                }
+                if (child.status === "completed" || child.status === "cancelled" || child.status === "abandoned")
+                    continue;
+                allChildrenDone = false;
+                break;
+            }
+            if (!allChildrenDone)
+                break; // stop cascade — parent still blocked
+            completable.push(parentId);
+            // Mark parent as effectively complete so its own parent sees it as done
+            effectivelyComplete.add(parentId);
+            currentId = parentId;
+        }
+        return completable;
+    }
+    // ─── Helpers ───
+    resolveAggregationMethod(parentId) {
+        const rule = this.aggregationRules.get(parentId);
+        return rule?.aggregation ?? "min";
+    }
+}
+// ─── Module-level pure helpers ───
+/**
+ * Compute a normalized gap in [0, 1] for a goal by averaging the normalized
+ * gap of each of its dimensions.
+ *
+ * Per-dimension formula (simplified, matches task spec):
+ *   min threshold: max(0, (target - current) / target)  [guard: target=0 → 0 or 1]
+ *   max threshold: max(0, (current - target) / target)  [guard: target=0 → 0 or 1]
+ *   default:       |current - target| / max(|target|, 1)
+ *
+ * When current_value is null, the dimension gap is 1 (fully unmet).
+ * When there are no dimensions, gap = 0 (consider it done).
+ */
+function computeChildGap(goal) {
+    if (goal.dimensions.length === 0)
+        return 0;
+    // If the goal is already completed/cancelled, gap = 0
+    if (goal.status === "completed" || goal.status === "cancelled" || goal.status === "abandoned")
+        return 0;
+    const dimGaps = goal.dimensions.map((dim) => computeDimensionGapSimple(dim));
+    const sum = dimGaps.reduce((acc, g) => acc + g, 0);
+    return Math.min(1, Math.max(0, sum / dimGaps.length));
+}
+/**
+ * Compute a simple normalized gap [0,1] for a single dimension.
+ * Uses the formulas from the task spec rather than the full
+ * confidence-weighted pipeline (which is used by GapCalculator for drive scoring).
+ */
+function computeDimensionGapSimple(dim) {
+    if (dim.current_value === null)
+        return 1;
+    const prog = dimensionProgress(dim.current_value, dim.threshold);
+    return prog === null ? 1 : 1 - prog;
+}
+/**
+ * Compute the minimum confidence across all dimensions of a goal.
+ * Returns 1.0 when there are no dimensions (nothing uncertain).
+ */
+function minChildConfidence(goal) {
+    if (goal.dimensions.length === 0)
+        return 1.0;
+    return Math.min(...goal.dimensions.map((d) => d.confidence));
+}
+/**
+ * Parse an ISO 8601 deadline string into milliseconds since epoch.
+ * Returns null if the deadline is null or unparseable.
+ */
+function parseDeadlineMs(deadline) {
+    if (deadline === null)
+        return null;
+    const ms = Date.parse(deadline);
+    return isNaN(ms) ? null : ms;
+}
+//# sourceMappingURL=state-aggregator.js.map

package/dist/orchestrator/goal/state-aggregator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"state-aggregator.js","sourceRoot":"","sources":["../../../src/orchestrator/goal/state-aggregator.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AACxD,OAAO,EAAoB,eAAe,EAAE,MAAM,2CAA2C,CAAC;AAC9F,OAAO,EAAE,iBAAiB,EAAE,MAAM,wCAAwC,CAAC;AAqB3E;;;;;;GAMG;AACH,MAAM,OAAO,eAAe;IACT,YAAY,CAAe;IAC3B,gBAAgB,CAAmB;IAEpD;;;OAGG;IACc,gBAAgB,GAC/B,IAAI,GAAG,EAAE,CAAC;IAEZ,YAAY,YAA0B,EAAE,gBAAkC;QACxE,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACH,uBAAuB,CAAC,IAA0B;QAChD,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAClD,CAAC;IAED,6BAA6B;IAE7B;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,oBAAoB,CAAC,QAAgB;QACzC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,UAAU,CAClB,sDAAsD,QAAQ,aAAa,CAC5E,CAAC;QACJ,CAAC;QAED,MAAM,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC;QACrC,MAAM,SAAS,GAA2B,EAAE,CAAC;QAC7C,MAAM,gBAAgB,GAA4B,EAAE,CAAC;QACrD,MAAM,gBAAgB,GAAa,EAAE,CAAC;QAEtC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACxD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACnB,+DAA+D;gBAC/D,SAAS,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC;gBACzB,gBAAgB,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC;gBAClC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACzB,SAAS;YACX,CAAC;YAED,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;YACnC,SAAS,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC;YACzB,gBAAgB,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,KAAK,WAAW,CAAC;YAEzD,MAAM,OAAO,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;YAC1C,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC;QAED,MAAM,iBAAiB,GAAG,IAAI,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC;QAElE,IAAI,aAAqB,CAAC;QAC1B,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,aAAa,GAAG,CAAC,CAAC;QACpB,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC;YAE7D,IAAI,iBAAiB,KAAK,cAAc,EAAE,CAAC;gBACzC,qEAAqE;gBACrE,iDAAiD;gBACjD,MAAM,iBAAiB,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBACtD,MAAM,cAAc,GAAG,eAAe,CACpC,iBAAiB,EACjB,cAAc,CACf,CAAC;gBACF,aAAa,GAAG,CAAC,GAAG,cAAc,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACN,aAAa,GAAG,eAAe,CAAC,SAAS,EAAE,iBAAiB,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QAED,MAAM,oBAAoB,GACxB,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAEpE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;QAE3D,8DAA8D;QAC9D,8EAA8E;QAC9E,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC/D,IAAI,WAAW,KAAK,IAAI,IAAI,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9D,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;gBACrC,MAAM,iBAAiB,GAAG,WAAW,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;oBAC3D,MAAM,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC;oBACxB,2CAA2C;oBAC3C,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;wBAAE,OAAO,GAAG,CAAC;oBAE3D,0EAA0E;oBAC1E,IAAI,cAAsB,CAAC;oBAC3B,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;wBACrB,cAAc,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;oBAC9C,CAAC;yBAAM,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;wBAC5B,yFAAyF;wBACzF,gFAAgF;wBAChF,cAAc,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;oBAC9C,CAAC;yBAAM,CAAC;wBACN,mCAAmC;wBACnC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;wBACjC,cAAc,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;oBAC1C,CAAC;oBAED,OAAO;wBACL,GAAG,GAAG;wBACN,aAAa,EAAE,cAAc;wBAC7B,UAAU,EAAE,oBAAoB;wBAChC,YAAY,EAAE,GAAG;qBAClB,CAAC;gBACJ,CAAC,CAAC,CAAC;gBAEH,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;oBAC/B,GAAG,WAAW;oBACd,UAAU,EAAE,iBAAiB;oBAC7B,UAAU,EAAE,GAAG;iBAChB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO;YACL,SAAS,EAAE,QAAQ;YACnB,cAAc,EAAE,UAAU;YAC1B,qBAAqB,EAAE,oBAAoB;YAC3C,UAAU,EAAE,SAAS;YACrB,iBAAiB,EAAE,gBAAgB;YACnC,kBAAkB,EAAE,iBAAiB;YACrC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACpC,CAAC;IACJ,CAAC;IAED,+BAA+B;IAE/B;;;;;;;;;;;;;;OAcG;IACH,KAAK,CAAC,kBAAkB,CAAC,QAAgB;QACvC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC1D,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;YACpB,MAAM,IAAI,UAAU,CAClB,oDAAoD,QAAQ,aAAa,CAC1E,CAAC;QACJ,CAAC;QAED,MAAM,gBAAgB,GAAG,eAAe,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC1D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;YACxD,IAAI,KAAK,KAAK,IAAI;gBAAE,SAAS;YAE7B,IAAI,OAAO,GAAG,EAAE,GAAG,KAAK,EAAE,CAAC;YAE3B,oCAAoC;YACpC,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YACvD,MAAM,cAAc,GAAG,MAAM,CAAC,WAAW,CAAC,MAAM,CAC9C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,CAAC,CAAC,CACnC,CAAC;YACF,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC9B,OAAO,GAAG;oBACR,GAAG,OAAO;oBACV,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,GAAG,cAAc,CAAC;iBACvD,CAAC;YACJ,CAAC;YAED,kCAAkC;YAClC,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;gBAC9B,MAAM,eAAe,GAAG,eAAe,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;gBAExD,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;oBAC7B,2BAA2B;oBAC3B,4CAA4C;oBAC5C,2CAA2C;oBAC3C,yDAAyD;oBACzD,iEAAiE;oBACjE,kEAAkE;oBAClE,+DAA+D;oBAC/D,iCAAiC;oBACjC,0FAA0F;oBAC1F,uEAAuE;oBACvE,EAAE;oBACF,oEAAoE;oBACpE,wDAAwD;oBACxD,MAAM,iBAAiB,GAAG,gBAAgB,GAAG,GAAG,CAAC;oBACjD,MAAM,gBAAgB,GAAG,eAAe,GAAG,GAAG,CAAC;oBAE/C,IAAI,iBAAiB,GAAG,CAAC,IAAI,gBAAgB,KAAK,iBAAiB,EAAE,CAAC;wBACpE,sEAAsE;wBACtE,+CAA+C;wBAC/C,MAAM,mBAAmB,GAAG,IAAI,CAAC,GAAG,CAClC,gBAAgB,EAChB,iBAAiB,CAClB,CAAC;wBACF,MAAM,kBAAkB,GAAG,GAAG,GAAG,mBAAmB,CAAC;wBACrD,OAAO,GAAG;4BACR,GAAG,OAAO;4BACV,QAAQ,EAAE,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,WAAW,EAAE;yBACrD,CAAC;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IACE,OAAO,CAAC,WAAW,KAAK,KAAK,CAAC,WAAW;gBACzC,OAAO,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,EACnC,CAAC;gBACD,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;oBAC/B,GAAG,OAAO;oBACV,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;iBACrC,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,6BAA6B;IAE7B;;;;;;;;;;;;;;OAcG;IACH,KAAK,CAAC,sBAAsB,CAAC,MAAc;QACzC,MAAM,WAAW,GAAa,EAAE,CAAC;QAEjC,2EAA2E;QAC3E,8EAA8E;QAC9E,MAAM,mBAAmB,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QAEtD,IAAI,SAAS,GAAkB,MAAM,CAAC;QAEtC,2BAA2B;QAC3B,OAAO,SAAS,KAAK,IAAI,EAAE,CAAC;YAC1B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC5D,IAAI,OAAO,KAAK,IAAI;gBAAE,MAAM;YAE5B,MAAM,QAAQ,GAAG,OAAO,CAAC,SAAS,CAAC;YACnC,IAAI,QAAQ,KAAK,IAAI;gBAAE,MAAM,CAAC,gEAAgE;YAE9F,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC1D,IAAI,MAAM,KAAK,IAAI;gBAAE,MAAM;YAE3B,oDAAoD;YACpD,IAAI,eAAe,GAAG,IAAI,CAAC;YAC3B,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;gBAC1C,IAAI,mBAAmB,CAAC,GAAG,CAAC,OAAO,CAAC;oBAAE,SAAS,CAAC,sBAAsB;gBACtE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;gBACxD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;oBAAC,eAAe,GAAG,KAAK,CAAC;oBAAC,MAAM;gBAAC,CAAC;gBACvD,IAAI,KAAK,CAAC,MAAM,KAAK,WAAW,IAAI,KAAK,CAAC,MAAM,KAAK,WAAW,IAAI,KAAK,CAAC,MAAM,KAAK,WAAW;oBAAE,SAAS;gBAC3G,eAAe,GAAG,KAAK,CAAC;gBACxB,MAAM;YACR,CAAC;YAED,IAAI,CAAC,eAAe;gBAAE,MAAM,CAAC,sCAAsC;YAEnE,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3B,wEAAwE;YACxE,mBAAmB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAClC,SAAS,GAAG,QAAQ,CAAC;QACvB,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,kBAAkB;IAEV,wBAAwB,CAAC,QAAgB;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACjD,OAAO,IAAI,EAAE,WAAW,IAAI,KAAK,CAAC;IACpC,CAAC;CACF;AAED,oCAAoC;AAEpC;;;;;;;;;;;GAWG;AACH,SAAS,eAAe,CAAC,IAAU;IACjC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAE3C,sDAAsD;IACtD,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW;QAAE,OAAO,CAAC,CAAC;IAExG,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,yBAAyB,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7E,MAAM,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;AACxD,CAAC;AAED;;;;GAIG;AACH,SAAS,yBAAyB,CAAC,GAAc;IAC/C,IAAI,GAAG,CAAC,aAAa,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IACzC,MAAM,IAAI,GAAG,iBAAiB,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;IACjE,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,IAAU;IACpC,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC7C,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;AAC/D,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CAAC,QAAuB;IAC9C,IAAI,QAAQ,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACnC,MAAM,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;IAChC,OAAO,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;AAC/B,CAAC"}

package/dist/orchestrator/goal/subgoal-curriculum 2.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Difficulty-based curriculum ordering for subgoal selection.
+ * Prioritizes medium-complexity (0.3-0.7) subgoals using gap × (1 - confidence).
+ */
+import type { Goal } from "../../base/types/goal.js";
+/** Preferred difficulty band for curriculum-based selection. */
+export declare const MEDIUM_BAND: {
+    min: number;
+    max: number;
+};
+/** Goals with aggregated gap below this threshold are treated as medium difficulty to avoid starvation. */
+export declare const NEAR_COMPLETE_GAP_THRESHOLD = 0.1;
+/**
+ * Estimate difficulty for a single goal.
+ * difficulty = aggregatedGap × (1 - minConfidence), clamped to [0, 1].
+ * Uses calculateDimensionGap for consistent gap computation, aggregateGaps for aggregation.
+ * Returns 0.5 (medium) when dimensions is empty or goal is near-complete.
+ */
+export declare function estimateDifficulty(goal: Goal): number;
+/**
+ * Sort subgoal entries in-place using center-biased curriculum ordering.
+ * Primary: |difficulty - 0.5| ascending (closest to medium first).
+ * Tiebreaker: depth descending (deeper first).
+ */
+export declare function curriculumSort(entries: Array<{
+    id: string;
+    depth: number;
+    difficulty: number;
+}>): void;
+//# sourceMappingURL=subgoal-curriculum%202.d.ts.map

package/dist/orchestrator/goal/subgoal-curriculum 2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgoal-curriculum 2.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/goal/subgoal-curriculum 2.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AAMrD,gEAAgE;AAChE,eAAO,MAAM,WAAW;;;CAAyB,CAAC;AAElD,2GAA2G;AAC3G,eAAO,MAAM,2BAA2B,MAAM,CAAC;AAE/C;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CA8BrD;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,GAChE,IAAI,CAON"}

package/dist/orchestrator/goal/subgoal-curriculum 2.js

@@ -0,0 +1,53 @@
+/**
+ * Difficulty-based curriculum ordering for subgoal selection.
+ * Prioritizes medium-complexity (0.3-0.7) subgoals using gap × (1 - confidence).
+ */
+import { calculateDimensionGap, aggregateGaps, } from "../../platform/drive/gap-calculator.js";
+/** Preferred difficulty band for curriculum-based selection. */
+export const MEDIUM_BAND = { min: 0.3, max: 0.7 };
+/** Goals with aggregated gap below this threshold are treated as medium difficulty to avoid starvation. */
+export const NEAR_COMPLETE_GAP_THRESHOLD = 0.1;
+/**
+ * Estimate difficulty for a single goal.
+ * difficulty = aggregatedGap × (1 - minConfidence), clamped to [0, 1].
+ * Uses calculateDimensionGap for consistent gap computation, aggregateGaps for aggregation.
+ * Returns 0.5 (medium) when dimensions is empty or goal is near-complete.
+ */
+export function estimateDifficulty(goal) {
+    const dims = goal.dimensions;
+    if (dims.length === 0)
+        return 0.5;
+    const weightedGaps = dims.map((d) => calculateDimensionGap({
+        name: d.name,
+        current_value: d.current_value,
+        threshold: d.threshold,
+        confidence: d.confidence,
+        uncertainty_weight: d.uncertainty_weight,
+    }, goal.uncertainty_weight));
+    // Use normalized_gap (pre-uncertainty-weighting) so the confidence multiplier
+    // below applies uniformly, including for null current_value (which yields 1.0).
+    const gapValues = weightedGaps.map((wg) => wg.normalized_gap);
+    const weights = dims.map((d) => d.weight ?? 1.0);
+    const minConfidence = Math.min(...dims.map((d) => d.confidence));
+    const aggregatedGap = aggregateGaps(gapValues, goal.gap_aggregation, weights);
+    // Near-complete goals (gap < threshold) should not be starved — treat as medium difficulty
+    if (aggregatedGap < NEAR_COMPLETE_GAP_THRESHOLD)
+        return 0.5;
+    const difficulty = aggregatedGap * (1 - minConfidence);
+    return Math.min(1, Math.max(0, difficulty));
+}
+/**
+ * Sort subgoal entries in-place using center-biased curriculum ordering.
+ * Primary: |difficulty - 0.5| ascending (closest to medium first).
+ * Tiebreaker: depth descending (deeper first).
+ */
+export function curriculumSort(entries) {
+    entries.sort((a, b) => {
+        const aDist = Math.abs(a.difficulty - 0.5);
+        const bDist = Math.abs(b.difficulty - 0.5);
+        if (aDist !== bDist)
+            return aDist - bDist;
+        return b.depth - a.depth;
+    });
+}
+//# sourceMappingURL=subgoal-curriculum%202.js.map

package/dist/orchestrator/goal/subgoal-curriculum 2.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgoal-curriculum 2.js","sourceRoot":"","sources":["../../../src/orchestrator/goal/subgoal-curriculum 2.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACL,qBAAqB,EACrB,aAAa,GACd,MAAM,wCAAwC,CAAC;AAEhD,gEAAgE;AAChE,MAAM,CAAC,MAAM,WAAW,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAElD,2GAA2G;AAC3G,MAAM,CAAC,MAAM,2BAA2B,GAAG,GAAG,CAAC;AAE/C;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAU;IAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;IAC7B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAElC,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClC,qBAAqB,CACnB;QACE,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,aAAa,EAAE,CAAC,CAAC,aAAa;QAC9B,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,kBAAkB,EAAE,CAAC,CAAC,kBAAkB;KACzC,EACD,IAAI,CAAC,kBAAkB,CACxB,CACF,CAAC;IAEF,8EAA8E;IAC9E,gFAAgF;IAChF,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC;IAC9D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC;IACjD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAEjE,MAAM,aAAa,GAAG,aAAa,CAAC,SAAS,EAAE,IAAI,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC;IAE9E,2FAA2F;IAC3F,IAAI,aAAa,GAAG,2BAA2B;QAAE,OAAO,GAAG,CAAC;IAE5D,MAAM,UAAU,GAAG,aAAa,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC;IACvD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,OAAiE;IAEjE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;QAC3C,IAAI,KAAK,KAAK,KAAK;YAAE,OAAO,KAAK,GAAG,KAAK,CAAC;QAC1C,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/orchestrator/goal/subgoal-curriculum.d.ts

@@ -0,0 +1,30 @@
+/**
+ * Difficulty-based curriculum ordering for subgoal selection.
+ * Prioritizes medium-complexity (0.3-0.7) subgoals using gap × (1 - confidence).
+ */
+import type { Goal } from "../../base/types/goal.js";
+/** Preferred difficulty band for curriculum-based selection. */
+export declare const MEDIUM_BAND: {
+    min: number;
+    max: number;
+};
+/** Goals with aggregated gap below this threshold are treated as medium difficulty to avoid starvation. */
+export declare const NEAR_COMPLETE_GAP_THRESHOLD = 0.1;
+/**
+ * Estimate difficulty for a single goal.
+ * difficulty = aggregatedGap × (1 - minConfidence), clamped to [0, 1].
+ * Uses calculateDimensionGap for consistent gap computation, aggregateGaps for aggregation.
+ * Returns 0.5 (medium) when dimensions is empty or goal is near-complete.
+ */
+export declare function estimateDifficulty(goal: Goal): number;
+/**
+ * Sort subgoal entries in-place using center-biased curriculum ordering.
+ * Primary: |difficulty - 0.5| ascending (closest to medium first).
+ * Tiebreaker: depth descending (deeper first).
+ */
+export declare function curriculumSort(entries: Array<{
+    id: string;
+    depth: number;
+    difficulty: number;
+}>): void;
+//# sourceMappingURL=subgoal-curriculum.d.ts.map

package/dist/orchestrator/goal/subgoal-curriculum.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgoal-curriculum.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/goal/subgoal-curriculum.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AAMrD,gEAAgE;AAChE,eAAO,MAAM,WAAW;;;CAAyB,CAAC;AAElD,2GAA2G;AAC3G,eAAO,MAAM,2BAA2B,MAAM,CAAC;AAE/C;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CA8BrD;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAC;IAAC,UAAU,EAAE,MAAM,CAAA;CAAE,CAAC,GAChE,IAAI,CAON"}

package/dist/orchestrator/goal/subgoal-curriculum.js

@@ -0,0 +1,53 @@
+/**
+ * Difficulty-based curriculum ordering for subgoal selection.
+ * Prioritizes medium-complexity (0.3-0.7) subgoals using gap × (1 - confidence).
+ */
+import { calculateDimensionGap, aggregateGaps, } from "../../platform/drive/gap-calculator.js";
+/** Preferred difficulty band for curriculum-based selection. */
+export const MEDIUM_BAND = { min: 0.3, max: 0.7 };
+/** Goals with aggregated gap below this threshold are treated as medium difficulty to avoid starvation. */
+export const NEAR_COMPLETE_GAP_THRESHOLD = 0.1;
+/**
+ * Estimate difficulty for a single goal.
+ * difficulty = aggregatedGap × (1 - minConfidence), clamped to [0, 1].
+ * Uses calculateDimensionGap for consistent gap computation, aggregateGaps for aggregation.
+ * Returns 0.5 (medium) when dimensions is empty or goal is near-complete.
+ */
+export function estimateDifficulty(goal) {
+    const dims = goal.dimensions;
+    if (dims.length === 0)
+        return 0.5;
+    const weightedGaps = dims.map((d) => calculateDimensionGap({
+        name: d.name,
+        current_value: d.current_value,
+        threshold: d.threshold,
+        confidence: d.confidence,
+        uncertainty_weight: d.uncertainty_weight,
+    }, goal.uncertainty_weight));
+    // Use normalized_gap (pre-uncertainty-weighting) so the confidence multiplier
+    // below applies uniformly, including for null current_value (which yields 1.0).
+    const gapValues = weightedGaps.map((wg) => wg.normalized_gap);
+    const weights = dims.map((d) => d.weight ?? 1.0);
+    const minConfidence = Math.min(...dims.map((d) => d.confidence));
+    const aggregatedGap = aggregateGaps(gapValues, goal.gap_aggregation, weights);
+    // Near-complete goals (gap < threshold) should not be starved — treat as medium difficulty
+    if (aggregatedGap < NEAR_COMPLETE_GAP_THRESHOLD)
+        return 0.5;
+    const difficulty = aggregatedGap * (1 - minConfidence);
+    return Math.min(1, Math.max(0, difficulty));
+}
+/**
+ * Sort subgoal entries in-place using center-biased curriculum ordering.
+ * Primary: |difficulty - 0.5| ascending (closest to medium first).
+ * Tiebreaker: depth descending (deeper first).
+ */
+export function curriculumSort(entries) {
+    entries.sort((a, b) => {
+        const aDist = Math.abs(a.difficulty - 0.5);
+        const bDist = Math.abs(b.difficulty - 0.5);
+        if (aDist !== bDist)
+            return aDist - bDist;
+        return b.depth - a.depth;
+    });
+}
+//# sourceMappingURL=subgoal-curriculum.js.map

package/dist/orchestrator/goal/subgoal-curriculum.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgoal-curriculum.js","sourceRoot":"","sources":["../../../src/orchestrator/goal/subgoal-curriculum.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACL,qBAAqB,EACrB,aAAa,GACd,MAAM,wCAAwC,CAAC;AAEhD,gEAAgE;AAChE,MAAM,CAAC,MAAM,WAAW,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAElD,2GAA2G;AAC3G,MAAM,CAAC,MAAM,2BAA2B,GAAG,GAAG,CAAC;AAE/C;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAU;IAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;IAC7B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAElC,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAClC,qBAAqB,CACnB;QACE,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,aAAa,EAAE,CAAC,CAAC,aAAa;QAC9B,SAAS,EAAE,CAAC,CAAC,SAAS;QACtB,UAAU,EAAE,CAAC,CAAC,UAAU;QACxB,kBAAkB,EAAE,CAAC,CAAC,kBAAkB;KACzC,EACD,IAAI,CAAC,kBAAkB,CACxB,CACF,CAAC;IAEF,8EAA8E;IAC9E,gFAAgF;IAChF,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,cAAc,CAAC,CAAC;IAC9D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC;IACjD,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC;IAEjE,MAAM,aAAa,GAAG,aAAa,CAAC,SAAS,EAAE,IAAI,CAAC,eAAe,EAAE,OAAO,CAAC,CAAC;IAE9E,2FAA2F;IAC3F,IAAI,aAAa,GAAG,2BAA2B;QAAE,OAAO,GAAG,CAAC;IAE5D,MAAM,UAAU,GAAG,aAAa,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC;IACvD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC5B,OAAiE;IAEjE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC;QAC3C,IAAI,KAAK,KAAK,KAAK;YAAE,OAAO,KAAK,GAAG,KAAK,CAAC;QAC1C,OAAO,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC"}

package/dist/orchestrator/goal/tree-loop-orchestrator 2.d.ts

@@ -0,0 +1,100 @@
+import type { StateManager } from "../../base/state/state-manager.js";
+import type { GoalTreeManager } from "./goal-tree-manager.js";
+import type { GoalRefiner } from "./goal-refiner.js";
+import type { StateAggregator } from "./state-aggregator.js";
+import type { SatisficingJudge } from "../../platform/drive/satisficing-judge.js";
+import type { GoalDecompositionConfig } from "../../base/types/goal-tree.js";
+/**
+ * TreeLoopOrchestrator manages the execution of independent loops across
+ * all nodes in a goal tree.
+ *
+ * Responsibilities:
+ *   - Selecting the next node to execute (leaf-first priority)
+ *   - Enforcing parallel_loop_limit for concurrent execution
+ *   - Tracking loop_status transitions (idle → running → idle/paused)
+ *   - Triggering state aggregation on node completion
+ *   - Detecting and cascading completion up the tree
+ *
+ * Design ref: docs/design/goal-tree.md §14C
+ */
+export declare class TreeLoopOrchestrator {
+    private readonly stateManager;
+    private readonly goalTreeManager;
+    private readonly stateAggregator;
+    private readonly satisficingJudge;
+    private readonly goalRefiner?;
+    /**
+     * GoalDecompositionConfig used to control parallel execution limits.
+     * Updated by startTreeExecution(); defaults applied until first call.
+     */
+    private config;
+    constructor(stateManager: StateManager, goalTreeManager: GoalTreeManager, stateAggregator: StateAggregator, satisficingJudge: SatisficingJudge, goalRefiner?: GoalRefiner | undefined);
+    /**
+     * Initialize tree execution.
+     * Saves the config and optionally resets all node loop_status to "idle".
+     * The actual per-node loops are driven by CoreLoop calling selectNextNode()
+     * in a tree-mode iteration.
+     */
+    startTreeExecution(rootId: string, config: GoalDecompositionConfig): Promise<void>;
+    /**
+     * Ensure the goal at goalId has been refined (has validated leaves or children).
+     * When GoalRefiner is available and the goal has no validated leaf dimensions
+     * and no children, calls refiner.refine(goalId).
+     * Falls back to GoalTreeManager.decomposeGoal() if refiner is absent.
+     * No-op if the goal already has children or validated dimensions.
+     */
+    ensureGoalRefined(goalId: string, options?: {
+        force?: boolean;
+    }): Promise<void>;
+    /**
+     * Select the next node to execute from the tree rooted at rootId.
+     *
+     * Algorithm (MVP: leaf-first):
+     *   1. Get tree state — if active_loops.length >= parallel_loop_limit, return null.
+     *   2. Collect all goal IDs in the tree (root + descendants).
+     *   3. Filter to active + idle nodes (not running, not paused).
+     *   4. Prefer leaf nodes (node_type === "leaf") over non-leaf nodes.
+     *   5. Return the first candidate's ID and set its loop_status to "running".
+     *
+     * Returns null when:
+     *   - parallel_loop_limit is already reached
+     *   - No eligible (active + idle) nodes remain
+     */
+    selectNextNode(rootId: string): Promise<string | null>;
+    /**
+     * Pause the loop for a specific node.
+     * Sets loop_status to "paused".
+     * No-op if the goal is not found.
+     */
+    pauseNodeLoop(goalId: string): Promise<void>;
+    /**
+     * Resume the loop for a specific node.
+     * Sets loop_status to "running".
+     * No-op if the goal is not found.
+     */
+    resumeNodeLoop(goalId: string): Promise<void>;
+    /**
+     * Called when a node's execution cycle completes.
+     *
+     * Actions:
+     *   1. Reset loop_status to "idle" (release the execution slot).
+     *   2. Aggregate state bottom-up to the root.
+     *   3. Run completion cascade to auto-complete ancestor nodes whose
+     *      children are all done.
+     */
+    onNodeCompleted(goalId: string): Promise<void>;
+    /**
+     * Collect all descendant IDs (not including rootId itself).
+     */
+    private _collectAllDescendantIds;
+    /**
+     * Select the best eligible node from the tree, preferring active idle leaves
+     * and deeper leaves before non-leaf nodes.
+     */
+    private _selectEligibleNodeId;
+    /**
+     * Apply completion cascade results by marking each ancestor as completed.
+     */
+    private _applyCompletionCascade;
+}
+//# sourceMappingURL=tree-loop-orchestrator%202.d.ts.map

package/dist/orchestrator/goal/tree-loop-orchestrator 2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree-loop-orchestrator 2.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/goal/tree-loop-orchestrator 2.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AACtE,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AAC9D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAErD,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAC7D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,2CAA2C,CAAC;AAClF,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,+BAA+B,CAAC;AAI7E;;;;;;;;;;;;GAYG;AACH,qBAAa,oBAAoB;IAa7B,OAAO,CAAC,QAAQ,CAAC,YAAY;IAC7B,OAAO,CAAC,QAAQ,CAAC,eAAe;IAChC,OAAO,CAAC,QAAQ,CAAC,eAAe;IAChC,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IACjC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC;IAhB/B;;;OAGG;IACH,OAAO,CAAC,MAAM,CAKZ;gBAGiB,YAAY,EAAE,YAAY,EAC1B,eAAe,EAAE,eAAe,EAChC,eAAe,EAAE,eAAe,EAChC,gBAAgB,EAAE,gBAAgB,EAClC,WAAW,CAAC,EAAE,WAAW,YAAA;IAK5C;;;;;OAKG;IACG,kBAAkB,CACtB,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,uBAAuB,GAC9B,OAAO,CAAC,IAAI,CAAC;IAwBhB;;;;;;OAMG;IACG,iBAAiB,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,KAAK,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAiCrF;;;;;;;;;;;;;OAaG;IACG,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;IA4B5D;;;;OAIG;IACG,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAWlD;;;;OAIG;IACG,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAanD;;;;;;;;OAQG;IACG,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAgCpD;;OAEG;YACW,wBAAwB;IAWtC;;;OAGG;YACW,qBAAqB;IAqBnC;;OAEG;YACW,uBAAuB;CAatC"}