pulseed 0.4.18 → 0.4.20

package/dist/orchestrator/strategy/portfolio-rebalance.js

@@ -0,0 +1,261 @@
+/**
+ * portfolio-rebalance.ts
+ *
+ * Pure/stateless helpers for PortfolioManager rebalancing logic.
+ * Functions here take configuration and data as explicit parameters
+ * and return results without side effects (except via the provided
+ * callbacks).
+ */
+/**
+ * Get the current gap value for a specific dimension of a goal.
+ * Reads from gap data provided by the caller (StateManager.readRaw).
+ */
+export async function getCurrentGapForDimension(goalId, dimension, readRaw) {
+    const raw = await readRaw(`gaps/${goalId}/current.json`);
+    if (!raw || typeof raw !== "object")
+        return null;
+    const gaps = raw;
+    const dimensionGap = gaps[dimension];
+    if (typeof dimensionGap === "number")
+        return dimensionGap;
+    const dimensions = gaps["dimensions"];
+    if (dimensions && typeof dimensions === "object") {
+        const dimData = dimensions[dimension];
+        if (dimData && typeof dimData === "object") {
+            const nwg = dimData["normalized_weighted_gap"];
+            if (typeof nwg === "number")
+                return nwg;
+        }
+    }
+    return null;
+}
+/**
+ * Calculate gap delta attributed to a strategy using dimension-target matching.
+ * Sums gap improvements across the strategy's target_dimensions.
+ */
+export async function calculateGapDeltaForStrategy(strategy, goalId, readRaw) {
+    let totalDelta = 0;
+    for (const dimension of strategy.target_dimensions) {
+        const currentGap = await getCurrentGapForDimension(goalId, dimension, readRaw);
+        if (currentGap === null)
+            continue;
+        const baseline = strategy.gap_snapshot_at_start ?? 1.0;
+        const delta = baseline - currentGap;
+        totalDelta += delta;
+    }
+    return totalDelta;
+}
+/**
+ * Calculate initial equal-split allocations for N strategies.
+ * Single strategy: [1.0].
+ * Multiple: equal split clamped to [min_allocation, max_allocation], sum = 1.0.
+ */
+export function calculateInitialAllocations(count, config) {
+    if (count === 1)
+        return [1.0];
+    const { min_allocation, max_allocation } = config;
+    let base = 1.0 / count;
+    base = Math.max(min_allocation, Math.min(max_allocation, base));
+    const allocations = new Array(count).fill(base);
+    const sum = allocations.reduce((a, b) => a + b, 0);
+    if (sum > 0 && Math.abs(sum - 1.0) > 0.001) {
+        const factor = 1.0 / sum;
+        for (let i = 0; i < allocations.length; i++) {
+            allocations[i] = Math.max(min_allocation, Math.min(max_allocation, allocations[i] * factor));
+        }
+        const finalSum = allocations.slice(0, -1).reduce((a, b) => a + b, 0);
+        allocations[allocations.length - 1] = Math.max(min_allocation, 1.0 - finalSum);
+    }
+    return allocations;
+}
+/**
+ * Count how many consecutive recent rebalances a strategy has been the lowest scorer
+ * (i.e., was adjusted down to min_allocation).
+ */
+export function countConsecutiveLowestRebalances(strategyId, history, minAllocation) {
+    let count = 0;
+    for (let i = history.length - 1; i >= 0; i--) {
+        const rebalance = history[i];
+        const adjustment = rebalance.adjustments.find((a) => a.strategy_id === strategyId);
+        if (adjustment && adjustment.new_allocation <= minAllocation) {
+            count++;
+        }
+        else {
+            break;
+        }
+    }
+    return count;
+}
+/**
+ * Redistribute freed allocation proportionally among remaining strategies
+ * based on effectiveness scores.
+ *
+ * Calls updateAllocation(goalId, strategyId, newAllocation) for each change.
+ */
+export function redistributeAllocation(goalId, remaining, records, freedAllocation, config, result, updateAllocation) {
+    if (remaining.length === 0 || freedAllocation <= 0)
+        return;
+    const scoredRemaining = remaining.map((s) => {
+        const record = records.find((r) => r.strategy_id === s.id);
+        return {
+            strategy: s,
+            score: record?.effectiveness_score ?? 0,
+        };
+    });
+    const totalScore = scoredRemaining.reduce((sum, r) => sum + Math.max(r.score, 0), 0);
+    for (const { strategy, score } of scoredRemaining) {
+        const proportion = totalScore > 0
+            ? Math.max(score, 0) / totalScore
+            : 1.0 / remaining.length;
+        const additionalAllocation = freedAllocation * proportion;
+        const oldAllocation = strategy.allocation;
+        const newAllocation = Math.min(config.max_allocation, oldAllocation + additionalAllocation);
+        if (Math.abs(newAllocation - oldAllocation) > 0.001) {
+            updateAllocation(goalId, strategy.id, newAllocation);
+            result.adjustments.push({
+                strategy_id: strategy.id,
+                old_allocation: oldAllocation,
+                new_allocation: newAllocation,
+                reason: "Redistribution from terminated strategy",
+            });
+        }
+    }
+}
+/**
+ * Adjust allocations based on effectiveness scores.
+ * Increases high-performers, decreases low-performers.
+ *
+ * Calls updateAllocation(goalId, strategyId, newAllocation) for each change.
+ */
+export function adjustAllocations(goalId, strategies, scoredRecords, config, result, updateAllocation) {
+    const sorted = [...scoredRecords].sort((a, b) => (b.effectiveness_score ?? 0) - (a.effectiveness_score ?? 0));
+    const totalScore = sorted.reduce((sum, r) => sum + Math.max(r.effectiveness_score ?? 0, 0), 0);
+    if (totalScore <= 0)
+        return;
+    const adjustments = [];
+    const newAllocations = new Map();
+    for (const record of sorted) {
+        const strategy = strategies.find((s) => s.id === record.strategy_id);
+        if (!strategy)
+            continue;
+        const proportion = Math.max(record.effectiveness_score ?? 0, 0) / totalScore;
+        let targetAllocation = proportion;
+        targetAllocation = Math.max(config.min_allocation, Math.min(config.max_allocation, targetAllocation));
+        newAllocations.set(strategy.id, targetAllocation);
+    }
+    const rawSum = Array.from(newAllocations.values()).reduce((a, b) => a + b, 0);
+    if (rawSum > 0 && Math.abs(rawSum - 1.0) > 0.001) {
+        const factor = 1.0 / rawSum;
+        for (const [id, alloc] of newAllocations) {
+            newAllocations.set(id, Math.max(config.min_allocation, alloc * factor));
+        }
+    }
+    for (const [strategyId, newAllocation] of newAllocations) {
+        const strategy = strategies.find((s) => s.id === strategyId);
+        if (!strategy)
+            continue;
+        const oldAllocation = strategy.allocation;
+        if (Math.abs(newAllocation - oldAllocation) > 0.001) {
+            updateAllocation(goalId, strategyId, newAllocation);
+            adjustments.push({
+                strategy_id: strategyId,
+                old_allocation: oldAllocation,
+                new_allocation: newAllocation,
+                reason: `Score-based rebalancing (effectiveness: ${scoredRecords
+                    .find((r) => r.strategy_id === strategyId)
+                    ?.effectiveness_score?.toFixed(3) ?? "N/A"})`,
+            });
+        }
+    }
+    result.adjustments.push(...adjustments);
+}
+/**
+ * Handle expiry of a WaitStrategy.
+ *
+ * When wait_until has passed:
+ * - Gap improved: complete the WaitStrategy
+ * - Gap unchanged: activate fallback strategy if one exists, otherwise trigger rebalance
+ * - Gap worsened: terminate the WaitStrategy and trigger rebalance
+ *
+ * @param isWaitStrategy - predicate to detect WaitStrategy instances
+ * @param getGap - get current gap for a dimension of a goal
+ * @param updateState - transition a strategy to a new state
+ * @param getPortfolioStrategies - get all strategies for a goal
+ */
+export async function handleWaitStrategyExpiry(goalId, strategyId, strategy, isWaitStrategy, getGap, updateState, getPortfolioStrategies) {
+    if (!isWaitStrategy(strategy))
+        return null;
+    const waitStrategy = strategy;
+    const waitUntil = new Date(waitStrategy.wait_until).getTime();
+    const now = Date.now();
+    if (now < waitUntil)
+        return null;
+    const currentGap = await getGap(goalId, strategy.primary_dimension);
+    if (currentGap === null)
+        return null;
+    const startGap = strategy.gap_snapshot_at_start ?? currentGap;
+    const gapDelta = currentGap - startGap;
+    if (gapDelta < 0) {
+        await updateState(strategyId, "completed");
+        return null;
+    }
+    if (gapDelta === 0) {
+        if (waitStrategy.fallback_strategy_id) {
+            const strategies = await getPortfolioStrategies(goalId);
+            const fallback = strategies.find((s) => s.id === waitStrategy.fallback_strategy_id);
+            if (fallback && fallback.state === "candidate") {
+                await updateState(fallback.id, "active");
+                await updateState(strategyId, "terminated");
+                return null;
+            }
+        }
+        await updateState(strategyId, "terminated");
+        return {
+            type: "stall_detected",
+            strategy_id: strategyId,
+            details: `WaitStrategy expired with no gap improvement: ${startGap.toFixed(3)} → ${currentGap.toFixed(3)}`,
+        };
+    }
+    await updateState(strategyId, "terminated");
+    return {
+        type: "stall_detected",
+        strategy_id: strategyId,
+        details: `WaitStrategy expired with gap worsening: ${startGap.toFixed(3)} → ${currentGap.toFixed(3)}`,
+    };
+}
+/**
+ * Select the next strategy across multiple goals.
+ *
+ * Sorts goals by "saturation ratio" (tasks dispatched / allocation) — the most
+ * underserved goal (lowest saturation) gets the next task. Within that goal,
+ * selectStrategyForTask() picks the best strategy.
+ *
+ * @param goalTaskCounts - map of goalId → total tasks dispatched
+ * @param selectStrategyForTask - select best strategy within one goal
+ */
+export async function selectNextStrategyAcrossGoals(goalIds, goalAllocations, goalTaskCounts, selectStrategyForTask) {
+    if (goalIds.length === 0)
+        return null;
+    const scored = goalIds.map((goalId) => {
+        const allocation = goalAllocations.get(goalId) ?? (1 / goalIds.length);
+        const taskCount = goalTaskCounts.get(goalId) ?? 0;
+        const saturation = allocation > 0 ? taskCount / allocation : Infinity;
+        return { goalId, saturation, allocation };
+    });
+    scored.sort((a, b) => a.saturation - b.saturation);
+    for (const { goalId, saturation } of scored) {
+        const allocation = goalAllocations.get(goalId) ?? 0;
+        if (allocation <= 0)
+            continue;
+        const selectionResult = await selectStrategyForTask(goalId);
+        if (selectionResult !== null) {
+            return {
+                goal_id: goalId,
+                strategy_id: selectionResult.strategy_id,
+                selection_reason: `Goal selected (saturation=${saturation.toFixed(2)}, allocation=${allocation.toFixed(2)}): ${selectionResult.reason}`,
+            };
+        }
+    }
+    return null;
+}
+//# sourceMappingURL=portfolio-rebalance.js.map

package/dist/orchestrator/strategy/portfolio-rebalance.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"portfolio-rebalance.js","sourceRoot":"","sources":["../../../src/orchestrator/strategy/portfolio-rebalance.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAYH;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,yBAAyB,CAC7C,MAAc,EACd,SAAiB,EACjB,OAAqD;IAErD,MAAM,GAAG,GAAG,MAAM,OAAO,CAAC,QAAQ,MAAM,eAAe,CAAC,CAAC;IACzD,IAAI,CAAC,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAEjD,MAAM,IAAI,GAAG,GAA8B,CAAC;IAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IACrC,IAAI,OAAO,YAAY,KAAK,QAAQ;QAAE,OAAO,YAAY,CAAC;IAE1D,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC;IACtC,IAAI,UAAU,IAAI,OAAO,UAAU,KAAK,QAAQ,EAAE,CAAC;QACjD,MAAM,OAAO,GAAI,UAAsC,CAAC,SAAS,CAAC,CAAC;QACnE,IAAI,OAAO,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAI,OAAmC,CAAC,yBAAyB,CAAC,CAAC;YAC5E,IAAI,OAAO,GAAG,KAAK,QAAQ;gBAAE,OAAO,GAAG,CAAC;QAC1C,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,4BAA4B,CAChD,QAAkB,EAClB,MAAc,EACd,OAAqD;IAErD,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,SAAS,IAAI,QAAQ,CAAC,iBAAiB,EAAE,CAAC;QACnD,MAAM,UAAU,GAAG,MAAM,yBAAyB,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAC/E,IAAI,UAAU,KAAK,IAAI;YAAE,SAAS;QAElC,MAAM,QAAQ,GAAG,QAAQ,CAAC,qBAAqB,IAAI,GAAG,CAAC;QACvD,MAAM,KAAK,GAAG,QAAQ,GAAG,UAAU,CAAC;QACpC,UAAU,IAAI,KAAK,CAAC;IACtB,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,2BAA2B,CACzC,KAAa,EACb,MAAkE;IAElE,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IAE9B,MAAM,EAAE,cAAc,EAAE,cAAc,EAAE,GAAG,MAAM,CAAC;IAClD,IAAI,IAAI,GAAG,GAAG,GAAG,KAAK,CAAC;IAEvB,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC,CAAC;IAEhE,MAAM,WAAW,GAAG,IAAI,KAAK,CAAS,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAExD,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,IAAI,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC;QAC3C,MAAM,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5C,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CACvB,cAAc,EACd,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAClD,CAAC;QACJ,CAAC;QACD,MAAM,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACrE,WAAW,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAC5C,cAAc,EACd,GAAG,GAAG,QAAQ,CACf,CAAC;IACJ,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gCAAgC,CAC9C,UAAkB,EAClB,OAA0B,EAC1B,aAAqB;IAErB,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7C,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,UAAU,GAAG,SAAS,CAAC,WAAW,CAAC,IAAI,CAC3C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,UAAU,CACpC,CAAC;QACF,IAAI,UAAU,IAAI,UAAU,CAAC,cAAc,IAAI,aAAa,EAAE,CAAC;YAC7D,KAAK,EAAE,CAAC;QACV,CAAC;aAAM,CAAC;YACN,MAAM;QACR,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,sBAAsB,CACpC,MAAc,EACd,SAAqB,EACrB,OAA8B,EAC9B,eAAuB,EACvB,MAA+C,EAC/C,MAAuB,EACvB,gBAIS;IAET,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,eAAe,IAAI,CAAC;QAAE,OAAO;IAE3D,MAAM,eAAe,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1C,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;QAC3D,OAAO;YACL,QAAQ,EAAE,CAAC;YACX,KAAK,EAAE,MAAM,EAAE,mBAAmB,IAAI,CAAC;SACxC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,eAAe,CAAC,MAAM,CACvC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,EACtC,CAAC,CACF,CAAC;IAEF,KAAK,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,eAAe,EAAE,CAAC;QAClD,MAAM,UAAU,GACd,UAAU,GAAG,CAAC;YACZ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,UAAU;YACjC,CAAC,CAAC,GAAG,GAAG,SAAS,CAAC,MAAM,CAAC;QAC7B,MAAM,oBAAoB,GAAG,eAAe,GAAG,UAAU,CAAC;QAC1D,MAAM,aAAa,GAAG,QAAQ,CAAC,UAAU,CAAC;QAC1C,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAC5B,MAAM,CAAC,cAAc,EACrB,aAAa,GAAG,oBAAoB,CACrC,CAAC;QAEF,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,aAAa,CAAC,GAAG,KAAK,EAAE,CAAC;YACpD,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;YACrD,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC;gBACtB,WAAW,EAAE,QAAQ,CAAC,EAAE;gBACxB,cAAc,EAAE,aAAa;gBAC7B,cAAc,EAAE,aAAa;gBAC7B,MAAM,EAAE,yCAAyC;aAClD,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAAc,EACd,UAAsB,EACtB,aAAoC,EACpC,MAAkE,EAClE,MAAuB,EACvB,gBAIS;IAET,MAAM,MAAM,GAAG,CAAC,GAAG,aAAa,CAAC,CAAC,IAAI,CACpC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,mBAAmB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,IAAI,CAAC,CAAC,CACtE,CAAC;IAEF,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAC9B,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB,IAAI,CAAC,EAAE,CAAC,CAAC,EACzD,CAAC,CACF,CAAC;IACF,IAAI,UAAU,IAAI,CAAC;QAAE,OAAO;IAE5B,MAAM,WAAW,GAA2B,EAAE,CAAC;IAC/C,MAAM,cAAc,GAAwB,IAAI,GAAG,EAAE,CAAC;IAEtD,KAAK,MAAM,MAAM,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,WAAW,CAAC,CAAC;QACrE,IAAI,CAAC,QAAQ;YAAE,SAAS;QAExB,MAAM,UAAU,GACd,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,mBAAmB,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;QAC5D,IAAI,gBAAgB,GAAG,UAAU,CAAC;QAElC,gBAAgB,GAAG,IAAI,CAAC,GAAG,CACzB,MAAM,CAAC,cAAc,EACrB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,cAAc,EAAE,gBAAgB,CAAC,CAClD,CAAC;QAEF,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,EAAE,gBAAgB,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC9E,IAAI,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC;QACjD,MAAM,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC;QAC5B,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,cAAc,EAAE,CAAC;YACzC,cAAc,CAAC,GAAG,CAChB,EAAE,EACF,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,cAAc,EAAE,KAAK,GAAG,MAAM,CAAC,CAChD,CAAC;QACJ,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,UAAU,EAAE,aAAa,CAAC,IAAI,cAAc,EAAE,CAAC;QACzD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,UAAU,CAAC,CAAC;QAC7D,IAAI,CAAC,QAAQ;YAAE,SAAS;QAExB,MAAM,aAAa,GAAG,QAAQ,CAAC,UAAU,CAAC;QAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,GAAG,aAAa,CAAC,GAAG,KAAK,EAAE,CAAC;YACpD,gBAAgB,CAAC,MAAM,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;YACpD,WAAW,CAAC,IAAI,CAAC;gBACf,WAAW,EAAE,UAAU;gBACvB,cAAc,EAAE,aAAa;gBAC7B,cAAc,EAAE,aAAa;gBAC7B,MAAM,EAAE,2CACN,aAAa;qBACV,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,KAAK,UAAU,CAAC;oBAC1C,EAAE,mBAAmB,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,KACzC,GAAG;aACJ,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;AAC1C,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,wBAAwB,CAC5C,MAAc,EACd,UAAkB,EAClB,QAAkB,EAClB,cAAwC,EACxC,MAAqF,EACrF,WAAwE,EACxE,sBAA4E;IAE5E,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAC;IAE3C,MAAM,YAAY,GAAG,QAAmC,CAAC;IACzD,MAAM,SAAS,GAAG,IAAI,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,OAAO,EAAE,CAAC;IAC9D,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEvB,IAAI,GAAG,GAAG,SAAS;QAAE,OAAO,IAAI,CAAC;IAEjC,MAAM,UAAU,GAAG,MAAM,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACpE,IAAI,UAAU,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAErC,MAAM,QAAQ,GAAG,QAAQ,CAAC,qBAAqB,IAAI,UAAU,CAAC;IAC9D,MAAM,QAAQ,GAAG,UAAU,GAAG,QAAQ,CAAC;IAEvC,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACjB,MAAM,WAAW,CAAC,UAAU,EAAE,WAAW,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;QACnB,IAAI,YAAY,CAAC,oBAAoB,EAAE,CAAC;YACtC,MAAM,UAAU,GAAG,MAAM,sBAAsB,CAAC,MAAM,CAAC,CAAC;YACxD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,YAAY,CAAC,oBAAoB,CAClD,CAAC;YACF,IAAI,QAAQ,IAAI,QAAQ,CAAC,KAAK,KAAK,WAAW,EAAE,CAAC;gBAC/C,MAAM,WAAW,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;gBACzC,MAAM,WAAW,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;gBAC5C,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,MAAM,WAAW,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;QAC5C,OAAO;YACL,IAAI,EAAE,gBAAgB;YACtB,WAAW,EAAE,UAAU;YACvB,OAAO,EAAE,iDAAiD,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;SAC3G,CAAC;IACJ,CAAC;IAED,MAAM,WAAW,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;IAC5C,OAAO;QACL,IAAI,EAAE,gBAAgB;QACtB,WAAW,EAAE,UAAU;QACvB,OAAO,EAAE,4CAA4C,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;KACtG,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,6BAA6B,CACjD,OAAiB,EACjB,eAAoC,EACpC,cAAmC,EACnC,qBAA2G;IAM3G,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEtC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QACpC,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;QACvE,MAAM,SAAS,GAAG,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAClD,MAAM,UAAU,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC;QACtE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;IAEnD,KAAK,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,MAAM,EAAE,CAAC;QAC5C,MAAM,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,UAAU,IAAI,CAAC;YAAE,SAAS;QAE9B,MAAM,eAAe,GAAG,MAAM,qBAAqB,CAAC,MAAM,CAAC,CAAC;QAC5D,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;YAC7B,OAAO;gBACL,OAAO,EAAE,MAAM;gBACf,WAAW,EAAE,eAAe,CAAC,WAAW;gBACxC,gBAAgB,EAAE,6BAA6B,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,gBAAgB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,eAAe,CAAC,MAAM,EAAE;aACxI,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/orchestrator/strategy/portfolio-scheduling.d.ts

@@ -0,0 +1,25 @@
+import type { GoalDependencyGraph } from "../goal/goal-dependency-graph.js";
+import type { DependencySchedule } from "../../base/types/cross-portfolio.js";
+/**
+ * Build a phased dependency schedule for the given goals using the provided
+ * GoalDependencyGraph instance.
+ *
+ * The schedule uses topological sort to group goals into phases where all
+ * goals in a phase can run concurrently. Phase 0 contains goals with no
+ * prerequisites; subsequent phases contain goals whose prerequisites are
+ * all satisfied by earlier phases.
+ *
+ * The critical path is the longest chain of prerequisite edges through the
+ * DAG (measured in number of nodes).
+ *
+ * @param goalIds — IDs of goals to schedule
+ * @param graph — the GoalDependencyGraph instance to query
+ * @returns DependencySchedule
+ */
+export declare function buildDependencySchedule(goalIds: string[], graph: GoalDependencyGraph): DependencySchedule;
+/**
+ * Compute the critical path (longest prerequisite chain) among the given goals.
+ * Returns the sequence of goalIds on the critical path.
+ */
+export declare function computeCriticalPath(goalIds: string[], prereqMap: Map<string, Set<string>>): string[];
+//# sourceMappingURL=portfolio-scheduling.d.ts.map

package/dist/orchestrator/strategy/portfolio-scheduling.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"portfolio-scheduling.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/strategy/portfolio-scheduling.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AAC5E,OAAO,KAAK,EACV,kBAAkB,EAEnB,MAAM,qCAAqC,CAAC;AAI7C;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,EAAE,mBAAmB,GACzB,kBAAkB,CA0EpB;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,MAAM,EAAE,EACjB,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,GAClC,MAAM,EAAE,CA0DV"}

package/dist/orchestrator/strategy/portfolio-scheduling.js

@@ -0,0 +1,133 @@
+// ─── Scheduling ───
+/**
+ * Build a phased dependency schedule for the given goals using the provided
+ * GoalDependencyGraph instance.
+ *
+ * The schedule uses topological sort to group goals into phases where all
+ * goals in a phase can run concurrently. Phase 0 contains goals with no
+ * prerequisites; subsequent phases contain goals whose prerequisites are
+ * all satisfied by earlier phases.
+ *
+ * The critical path is the longest chain of prerequisite edges through the
+ * DAG (measured in number of nodes).
+ *
+ * @param goalIds — IDs of goals to schedule
+ * @param graph — the GoalDependencyGraph instance to query
+ * @returns DependencySchedule
+ */
+export function buildDependencySchedule(goalIds, graph) {
+    if (goalIds.length === 0) {
+        return { phases: [], criticalPath: [] };
+    }
+    const goalSet = new Set(goalIds);
+    // Build adjacency: prereqMap[child] = Set of parents that must complete first
+    const prereqMap = new Map();
+    for (const id of goalIds) {
+        prereqMap.set(id, new Set());
+    }
+    for (const id of goalIds) {
+        const blockers = graph.getBlockingGoals(id).filter((b) => goalSet.has(b));
+        for (const blocker of blockers) {
+            prereqMap.get(id)?.add(blocker);
+        }
+    }
+    // Kahn's algorithm for topological sort into phases
+    const phases = [];
+    const completed = new Set();
+    const remaining = new Set(goalIds);
+    let phaseIndex = 0;
+    while (remaining.size > 0) {
+        // Goals whose all prerequisites are completed
+        const readyGoals = [];
+        for (const id of remaining) {
+            const prereqs = prereqMap.get(id);
+            const allSatisfied = [...prereqs].every((p) => completed.has(p));
+            if (allSatisfied) {
+                readyGoals.push(id);
+            }
+        }
+        if (readyGoals.length === 0) {
+            // Cycle detected or unresolvable — put all remaining in one phase
+            const cycleGoals = [...remaining];
+            const blockedBy = cycleGoals.flatMap((id) => [...(prereqMap.get(id) ?? [])].filter((p) => !completed.has(p)));
+            phases.push({
+                phase: phaseIndex,
+                goalIds: cycleGoals,
+                blockedBy: [...new Set(blockedBy)],
+            });
+            break;
+        }
+        // Collect the set of blockers for this phase's goals
+        const phaseBlockedBy = readyGoals.flatMap((id) => [...(prereqMap.get(id) ?? [])]);
+        phases.push({
+            phase: phaseIndex,
+            goalIds: readyGoals,
+            blockedBy: [...new Set(phaseBlockedBy)],
+        });
+        for (const id of readyGoals) {
+            completed.add(id);
+            remaining.delete(id);
+        }
+        phaseIndex++;
+    }
+    // Critical path: longest chain of prerequisite edges (BFS/DFS from each node)
+    const criticalPath = computeCriticalPath(goalIds, prereqMap);
+    return { phases, criticalPath };
+}
+/**
+ * Compute the critical path (longest prerequisite chain) among the given goals.
+ * Returns the sequence of goalIds on the critical path.
+ */
+export function computeCriticalPath(goalIds, prereqMap) {
+    // dp[id] = longest path length ending at id (in nodes)
+    const dp = new Map();
+    const parent = new Map();
+    function longestFrom(id) {
+        const cached = dp.get(id);
+        if (cached !== undefined)
+            return cached;
+        const prereqs = prereqMap.get(id) ?? new Set();
+        if (prereqs.size === 0) {
+            dp.set(id, 1);
+            parent.set(id, null);
+            return 1;
+        }
+        let best = 0;
+        let bestParent = null;
+        for (const p of prereqs) {
+            const len = longestFrom(p);
+            if (len > best) {
+                best = len;
+                bestParent = p;
+            }
+        }
+        dp.set(id, best + 1);
+        parent.set(id, bestParent);
+        return best + 1;
+    }
+    // Compute for all goals
+    for (const id of goalIds) {
+        longestFrom(id);
+    }
+    // Find the goal with the highest dp value
+    let maxLen = 0;
+    let maxGoal = goalIds[0] ?? "";
+    for (const id of goalIds) {
+        const len = dp.get(id) ?? 0;
+        if (len > maxLen) {
+            maxLen = len;
+            maxGoal = id;
+        }
+    }
+    if (maxLen === 0)
+        return [];
+    // Reconstruct path by following parent pointers
+    const path = [];
+    let current = maxGoal;
+    while (current !== null) {
+        path.unshift(current);
+        current = parent.get(current) ?? null;
+    }
+    return path;
+}
+//# sourceMappingURL=portfolio-scheduling.js.map

package/dist/orchestrator/strategy/portfolio-scheduling.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"portfolio-scheduling.js","sourceRoot":"","sources":["../../../src/orchestrator/strategy/portfolio-scheduling.ts"],"names":[],"mappings":"AAMA,qBAAqB;AAErB;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,uBAAuB,CACrC,OAAiB,EACjB,KAA0B;IAE1B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,YAAY,EAAE,EAAE,EAAE,CAAC;IAC1C,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAEjC,8EAA8E;IAC9E,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1E,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;YAC/B,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,MAAM,MAAM,GAAsB,EAAE,CAAC;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAEnC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,OAAO,SAAS,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1B,8CAA8C;QAC9C,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACnC,MAAM,YAAY,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACjE,IAAI,YAAY,EAAE,CAAC;gBACjB,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,kEAAkE;YAClE,MAAM,UAAU,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;YAClC,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAC1C,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAChE,CAAC;YACF,MAAM,CAAC,IAAI,CAAC;gBACV,KAAK,EAAE,UAAU;gBACjB,OAAO,EAAE,UAAU;gBACnB,SAAS,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;aACnC,CAAC,CAAC;YACH,MAAM;QACR,CAAC;QAED,qDAAqD;QACrD,MAAM,cAAc,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAC/C,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAC/B,CAAC;QAEF,MAAM,CAAC,IAAI,CAAC;YACV,KAAK,EAAE,UAAU;YACjB,OAAO,EAAE,UAAU;YACnB,SAAS,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,CAAC;SACxC,CAAC,CAAC;QAEH,KAAK,MAAM,EAAE,IAAI,UAAU,EAAE,CAAC;YAC5B,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAClB,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;QAED,UAAU,EAAE,CAAC;IACf,CAAC;IAED,8EAA8E;IAC9E,MAAM,YAAY,GAAG,mBAAmB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAE7D,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CACjC,OAAiB,EACjB,SAAmC;IAEnC,uDAAuD;IACvD,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEhD,SAAS,WAAW,CAAC,EAAU;QAC7B,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1B,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QAExC,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QAC/C,IAAI,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACvB,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YACrB,OAAO,CAAC,CAAC;QACX,CAAC;QAED,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,UAAU,GAAkB,IAAI,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,GAAG,GAAG,IAAI,EAAE,CAAC;gBACf,IAAI,GAAG,GAAG,CAAC;gBACX,UAAU,GAAG,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QAED,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAC3B,OAAO,IAAI,GAAG,CAAC,CAAC;IAClB,CAAC;IAED,wBAAwB;IACxB,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,WAAW,CAAC,EAAE,CAAC,CAAC;IAClB,CAAC;IAED,0CAA0C;IAC1C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAC/B,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,GAAG,GAAG,MAAM,EAAE,CAAC;YACjB,MAAM,GAAG,GAAG,CAAC;YACb,OAAO,GAAG,EAAE,CAAC;QACf,CAAC;IACH,CAAC;IAED,IAAI,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAE5B,gDAAgD;IAChD,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,OAAO,GAAkB,OAAO,CAAC;IACrC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;IACxC,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/orchestrator/strategy/strategy-helpers.d.ts

@@ -0,0 +1,119 @@
+import { z } from "zod";
+import type { StrategyState } from "../../base/types/core.js";
+import type { Strategy } from "../../base/types/strategy.js";
+import type { KnowledgeGapSignal } from "../../base/types/knowledge.js";
+export declare const VALID_TRANSITIONS: Record<StrategyState, StrategyState[]>;
+export declare const StrategyArraySchema: z.ZodArray<z.ZodObject<{
+    id: z.ZodOptional<z.ZodString>;
+    hypothesis: z.ZodString;
+    expected_effect: z.ZodArray<z.ZodObject<{
+        dimension: z.ZodString;
+        direction: z.ZodEnum<["increase", "decrease"]>;
+        magnitude: z.ZodEnum<["small", "medium", "large"]>;
+    }, "strip", z.ZodTypeAny, {
+        dimension: string;
+        direction: "increase" | "decrease";
+        magnitude: "medium" | "small" | "large";
+    }, {
+        dimension: string;
+        direction: "increase" | "decrease";
+        magnitude: "medium" | "small" | "large";
+    }>, "many">;
+    resource_estimate: z.ZodObject<{
+        sessions: z.ZodNumber;
+        duration: z.ZodObject<{
+            value: z.ZodNumber;
+            unit: z.ZodEnum<["minutes", "hours", "days", "weeks"]>;
+        }, "strip", z.ZodTypeAny, {
+            value: number;
+            unit: "minutes" | "hours" | "days" | "weeks";
+        }, {
+            value: number;
+            unit: "minutes" | "hours" | "days" | "weeks";
+        }>;
+        llm_calls: z.ZodDefault<z.ZodNullable<z.ZodNumber>>;
+    }, "strip", z.ZodTypeAny, {
+        sessions: number;
+        duration: {
+            value: number;
+            unit: "minutes" | "hours" | "days" | "weeks";
+        };
+        llm_calls: number | null;
+    }, {
+        sessions: number;
+        duration: {
+            value: number;
+            unit: "minutes" | "hours" | "days" | "weeks";
+        };
+        llm_calls?: number | null | undefined;
+    }>;
+    allocation: z.ZodDefault<z.ZodNumber>;
+    required_tools: z.ZodDefault<z.ZodArray<z.ZodString, "many">>;
+}, "strip", z.ZodTypeAny, {
+    hypothesis: string;
+    expected_effect: {
+        dimension: string;
+        direction: "increase" | "decrease";
+        magnitude: "medium" | "small" | "large";
+    }[];
+    resource_estimate: {
+        sessions: number;
+        duration: {
+            value: number;
+            unit: "minutes" | "hours" | "days" | "weeks";
+        };
+        llm_calls: number | null;
+    };
+    allocation: number;
+    required_tools: string[];
+    id?: string | undefined;
+}, {
+    hypothesis: string;
+    expected_effect: {
+        dimension: string;
+        direction: "increase" | "decrease";
+        magnitude: "medium" | "small" | "large";
+    }[];
+    resource_estimate: {
+        sessions: number;
+        duration: {
+            value: number;
+            unit: "minutes" | "hours" | "days" | "weeks";
+        };
+        llm_calls?: number | null | undefined;
+    };
+    id?: string | undefined;
+    allocation?: number | undefined;
+    required_tools?: string[] | undefined;
+}>, "many">;
+/**
+ * Unwrap a potentially-wrapped LLM response before schema validation.
+ * LLMs may return a wrapper object instead of a bare array. This function
+ * checks common wrapper keys, then falls back to single-key unwrapping.
+ */
+export declare function unwrapStrategyResponse(raw: unknown): unknown;
+export declare function buildGenerationPrompt(goalId: string, primaryDimension: string, targetDimensions: string[], context: {
+    currentGap: number;
+    pastStrategies: Strategy[];
+}, enrichment?: {
+    templatesBlock?: string;
+    lessonsBlock?: string;
+    workspaceBlock?: string;
+}): string;
+/**
+ * Redistribute freed allocation proportionally among remaining strategies.
+ * Returns a new array with updated allocations. Pure function.
+ */
+export declare function redistributeAllocation(strategies: Strategy[], excludeId: string, freedAllocation: number): Strategy[];
+/**
+ * Detect whether a set of strategy candidates indicates a knowledge gap.
+ *
+ * Rules:
+ *   - Zero candidates → `strategy_deadlock` (no hypotheses can be formed)
+ *   - All candidates have effectiveness_score < 0.3 AND not null →
+ *     `strategy_deadlock` (all known approaches exhausted)
+ *
+ * Returns null when candidates look viable.
+ */
+export declare function detectStrategyGap(candidates: Strategy[]): KnowledgeGapSignal | null;
+//# sourceMappingURL=strategy-helpers.d.ts.map

package/dist/orchestrator/strategy/strategy-helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"strategy-helpers.d.ts","sourceRoot":"","sources":["../../../src/orchestrator/strategy/strategy-helpers.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAIxB,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAC9D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,8BAA8B,CAAC;AAC7D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,+BAA+B,CAAC;AAIxE,eAAO,MAAM,iBAAiB,EAAE,MAAM,CAAC,aAAa,EAAE,aAAa,EAAE,CAOpE,CAAC;AAIF,eAAO,MAAM,mBAAmB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;WAsB/B,CAAC;AAEF;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,OAAO,GAAG,OAAO,CAa5D;AAID,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,MAAM,EACd,gBAAgB,EAAE,MAAM,EACxB,gBAAgB,EAAE,MAAM,EAAE,EAC1B,OAAO,EAAE;IAAE,UAAU,EAAE,MAAM,CAAC;IAAC,cAAc,EAAE,QAAQ,EAAE,CAAA;CAAE,EAC3D,UAAU,CAAC,EAAE;IAAE,cAAc,CAAC,EAAE,MAAM,CAAC;IAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAAC,cAAc,CAAC,EAAE,MAAM,CAAA;CAAE,GACvF,MAAM,CAuFR;AAID;;;GAGG;AACH,wBAAgB,sBAAsB,CACpC,UAAU,EAAE,QAAQ,EAAE,EACtB,SAAS,EAAE,MAAM,EACjB,eAAe,EAAE,MAAM,GACtB,QAAQ,EAAE,CAqBZ;AAID;;;;;;;;;GASG;AACH,wBAAgB,iBAAiB,CAAC,UAAU,EAAE,QAAQ,EAAE,GAAG,kBAAkB,GAAG,IAAI,CA4BnF"}