pulseed 0.1.5 → 0.2.0

package/dist/platform/drive/satisficing-judge.d.ts

@@ -0,0 +1,140 @@
+import { StateManager } from "../../base/state/state-manager.js";
+import type { Goal, Dimension } from "../../base/types/goal.js";
+import type { CompletionJudgment, DimensionSatisfaction, IterationConstraints, ThresholdAdjustmentProposal, MappingProposal, ConvergenceJudgment, SatisficingStatus } from "../../base/types/satisficing.js";
+import type { IEmbeddingClient } from "../knowledge/embedding-client.js";
+export { aggregateValues } from "./satisficing-helpers.js";
+/**
+ * SatisficingJudge implements the completion judgment logic defined in satisficing.md.
+ *
+ * Responsibility: determine whether a goal (or individual dimension) is "good enough"
+ * to declare done, applying progress ceilings based on confidence tiers.
+ *
+ * Key design rules:
+ * - Completion requires ALL dimensions satisfied AND no low-confidence dimensions.
+ * - Progress ceiling: high >= 0.85 → 1.0 | medium >= 0.50 → 0.85 | low < 0.50 → 0.60
+ * - These ceiling values are from satisficing.md (distinct from ObservationEngine ceilings).
+ * - null current_value is treated as fully unsatisfied.
+ */
+export declare class SatisficingJudge {
+    private readonly stateManager;
+    private readonly embeddingClient?;
+    private readonly onSatisficingJudgment?;
+    private readonly gapHistory;
+    private readonly satisficingStreak;
+    constructor(stateManager: StateManager, embeddingClient?: IEmbeddingClient, // Phase 2: for dimension mapping proposals
+    onSatisficingJudgment?: (goalId: string, satisfiedDimensions: string[]) => void);
+    /**
+     * Compute the variance of an array of numbers. Returns null if fewer than 2 values.
+     */
+    private computeVariance;
+    /**
+     * Record a gap observation for a goal dimension into the ring buffer.
+     * Pushes the gap value and trims to CONVERGENCE_WINDOW.
+     */
+    private recordGap;
+    /**
+     * Judge convergence for a single gap value against a threshold.
+     * Records the gap in the ring buffer, then evaluates:
+     *   - gap < threshold → satisficed (existing behavior)
+     *   - variance < ε AND gap ≤ threshold × 1.5 → converged_satisficed
+     *   - variance < ε AND gap > threshold × 1.5 → stalled
+     *   - otherwise → in_progress
+     *
+     * @param key      Unique key for the ring buffer (e.g., `${goalId}:${dimensionName}`)
+     * @param gap      Current normalized gap value [0, 1]
+     * @param threshold The satisficing threshold (normalized gap target, typically 0 means met)
+     */
+    judgeConvergence(key: string, gap: number, threshold: number): ConvergenceJudgment;
+    /**
+     * Clear the gap history ring buffer for a specific key.
+     * Call this when a goal is reset or completed.
+     */
+    clearGapHistory(key: string): void;
+    private getConfidenceTier;
+    private getCeiling;
+    /**
+     * Compute actual progress (0–1) toward satisfying a dimension.
+     * Progress = 1 - normalized_gap, clamped to [0, 1].
+     * For binary thresholds (present/match), either 0 or 1.
+     * null current_value = 0 progress.
+     */
+    private computeActualProgress;
+    /**
+     * Determine whether a dimension's current_value meets its threshold.
+     * Uses raw boolean logic (not gap magnitude) for the is_satisfied flag.
+     */
+    private isSatisfiedRaw;
+    /**
+     * Check if a single dimension is satisfied with appropriate confidence ceiling.
+     */
+    isDimensionSatisfied(dim: Dimension): DimensionSatisfaction;
+    /**
+     * Propose dimension mappings between subgoal and parent goal dimensions
+     * using embedding similarity.
+     */
+    proposeDimensionMapping(subgoalDimensions: Array<{
+        name: string;
+        description?: string;
+    }>, parentGoalDimensions: Array<{
+        name: string;
+        description?: string;
+    }>): Promise<MappingProposal[]>;
+    /**
+     * Determine if a goal is fully complete.
+     * Complete iff all dimensions are satisfied AND no dimension has low confidence.
+     *
+     * @param goal The goal to check.
+     * @param convergenceStatuses Optional map of dimension key → SatisficingStatus from judgeConvergence().
+     *   When a dimension's convergence status is "converged_satisficed", it is treated as satisfied
+     *   (gap has stabilized within acceptable range — good enough).
+     *   Keys should match the format used with judgeConvergence(): `${goalId}:${dimensionName}`.
+     */
+    isGoalComplete(goal: Goal, convergenceStatuses?: Map<string, SatisficingStatus>): CompletionJudgment;
+    /**
+     * Apply progress ceiling based on confidence tier.
+     * Returns min(actualProgress, ceiling).
+     */
+    applyProgressCeiling(actualProgress: number, confidence: number): number;
+    /**
+     * Select dimensions to focus on in the next iteration.
+     *
+     * Algorithm:
+     * 1. Exclude already-satisfied dimensions.
+     * 2. Among remaining, sort by drive score (highest first).
+     * 3. Take top max_dimensions.
+     */
+    selectDimensionsForIteration(dimensions: Dimension[], driveScores: Array<{
+        dimension_name: string;
+        score: number;
+    }>, constraints?: IterationConstraints): string[];
+    /**
+     * Detect dimensions where threshold adjustment may be warranted.
+     *
+     * Condition 1: >= 3 failures AND normalized_gap has not improved (no progress).
+     * Condition 2: all other dimensions satisfied, this one is still far from threshold.
+     */
+    detectThresholdAdjustmentNeeded(goal: Goal, failureCounts: Map<string, number>): Promise<ThresholdAdjustmentProposal[]>;
+    /**
+     * Judge completion of an entire goal tree by checking all children recursively.
+     * Non-leaf nodes are complete when all children are completed or cancelled(merged).
+     *
+     * @param rootId The ID of the root goal of the tree.
+     * @returns CompletionJudgment for the root node.
+     */
+    judgeTreeCompletion(rootId: string, convergenceStatuses?: Map<string, SatisficingStatus>): Promise<CompletionJudgment>;
+    /**
+     * Propagate subgoal completion to the parent goal's matching dimension.
+     *
+     * Phase 2: supports dimension_mapping for aggregation-based propagation.
+     * - If any subgoal dimension has dimension_mapping set, use aggregation path.
+     * - Mixed: mapped dimensions use aggregation; unmapped dimensions fall back to name matching.
+     * - Backwards compatible: if no dimensions have dimension_mapping, behaves like MVP.
+     *
+     * @param subgoalId The subgoal's ID (used for name matching in MVP path).
+     * @param parentGoalId The parent goal's ID to update.
+     * @param subgoalDimensions Optional subgoal dimensions for aggregation mapping.
+     *   When omitted, falls back to MVP name-based matching only.
+     */
+    propagateSubgoalCompletion(subgoalId: string, parentGoalId: string, subgoalDimensions?: import("../../base/types/goal.js").Dimension[]): Promise<void>;
+}
+//# sourceMappingURL=satisficing-judge.d.ts.map

package/dist/platform/drive/satisficing-judge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"satisficing-judge.d.ts","sourceRoot":"","sources":["../../../src/platform/drive/satisficing-judge.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AAEjE,OAAO,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AAChE,OAAO,KAAK,EACV,kBAAkB,EAClB,qBAAqB,EACrB,oBAAoB,EACpB,2BAA2B,EAC3B,eAAe,EACf,mBAAmB,EACnB,iBAAiB,EAClB,MAAM,iCAAiC,CAAC;AACzC,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,kCAAkC,CAAC;AAYzE,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAQ3D;;;;;;;;;;;GAWG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAe;IAC5C,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAmB;IACpD,OAAO,CAAC,QAAQ,CAAC,qBAAqB,CAAC,CAA0D;IAGjG,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAoC;IAI/D,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAkC;gBAGlE,YAAY,EAAE,YAAY,EAC1B,eAAe,CAAC,EAAE,gBAAgB,EAAG,2CAA2C;IAChF,qBAAqB,CAAC,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,mBAAmB,EAAE,MAAM,EAAE,KAAK,IAAI;IASjF;;OAEG;IACH,OAAO,CAAC,eAAe;IAOvB;;;OAGG;IACH,OAAO,CAAC,SAAS;IASjB;;;;;;;;;;;OAWG;IACH,gBAAgB,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,mBAAmB;IAyBlF;;;OAGG;IACH,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAMlC,OAAO,CAAC,iBAAiB;IAMzB,OAAO,CAAC,UAAU;IAalB;;;;;OAKG;IACH,OAAO,CAAC,qBAAqB;IAO7B;;;OAGG;IACH,OAAO,CAAC,cAAc;IAwBtB;;OAEG;IACH,oBAAoB,CAAC,GAAG,EAAE,SAAS,GAAG,qBAAqB;IAsB3D;;;OAGG;IACG,uBAAuB,CAC3B,iBAAiB,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,EAChE,oBAAoB,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,WAAW,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,GAClE,OAAO,CAAC,eAAe,EAAE,CAAC;IAoC7B;;;;;;;;;OASG;IACH,cAAc,CACZ,IAAI,EAAE,IAAI,EACV,mBAAmB,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,GACnD,kBAAkB;IAwErB;;;OAGG;IACH,oBAAoB,CAAC,cAAc,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM;IAMxE;;;;;;;OAOG;IACH,4BAA4B,CAC1B,UAAU,EAAE,SAAS,EAAE,EACvB,WAAW,EAAE,KAAK,CAAC;QAAE,cAAc,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,EAC7D,WAAW,CAAC,EAAE,oBAAoB,GACjC,MAAM,EAAE;IAwBX;;;;;OAKG;IACG,+BAA+B,CACnC,IAAI,EAAE,IAAI,EACV,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GACjC,OAAO,CAAC,2BAA2B,EAAE,CAAC;IA+FzC;;;;;;OAMG;IACG,mBAAmB,CACvB,MAAM,EAAE,MAAM,EACd,mBAAmB,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,GACnD,OAAO,CAAC,kBAAkB,CAAC;IAY9B;;;;;;;;;;;;OAYG;IACG,0BAA0B,CAC9B,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,MAAM,EACpB,iBAAiB,CAAC,EAAE,OAAO,0BAA0B,EAAE,SAAS,EAAE,GACjE,OAAO,CAAC,IAAI,CAAC;CASjB"}

package/dist/platform/drive/satisficing-judge.js

@@ -0,0 +1,427 @@
+import { dimensionProgress } from "./gap-calculator.js";
+import { toNumber, isTruthy, toNumberOrNull, getNumericThresholdValue, getNumericThresholdValueForProposal, } from "./satisficing-helpers.js";
+import { judgeTreeCompletion as judgeTreeCompletionFn, propagateSubgoalCompletion as propagateSubgoalCompletionFn, } from "./satisficing-propagation.js";
+export { aggregateValues } from "./satisficing-helpers.js";
+// ─── Convergence Detection Constants ───
+const CONVERGENCE_WINDOW = 5; // ring buffer size
+const CONVERGENCE_EPSILON = 0.01; // variance threshold
+const ACCEPTABLE_RANGE_FACTOR = 1.5; // threshold × this = acceptable range ceiling
+/**
+ * SatisficingJudge implements the completion judgment logic defined in satisficing.md.
+ *
+ * Responsibility: determine whether a goal (or individual dimension) is "good enough"
+ * to declare done, applying progress ceilings based on confidence tiers.
+ *
+ * Key design rules:
+ * - Completion requires ALL dimensions satisfied AND no low-confidence dimensions.
+ * - Progress ceiling: high >= 0.85 → 1.0 | medium >= 0.50 → 0.85 | low < 0.50 → 0.60
+ * - These ceiling values are from satisficing.md (distinct from ObservationEngine ceilings).
+ * - null current_value is treated as fully unsatisfied.
+ */
+export class SatisficingJudge {
+    stateManager;
+    embeddingClient;
+    onSatisficingJudgment;
+    // Ring buffers keyed by goalId+dimensionName to track recent gap values
+    gapHistory = new Map();
+    // P0: Satisficing double-confirmation guard (§4.4)
+    // Tracks consecutive cycles where all dimensions are met, keyed by goalId
+    satisficingStreak = new Map();
+    constructor(stateManager, embeddingClient, // Phase 2: for dimension mapping proposals
+    onSatisficingJudgment) {
+        this.stateManager = stateManager;
+        this.embeddingClient = embeddingClient;
+        this.onSatisficingJudgment = onSatisficingJudgment;
+    }
+    // ─── Convergence Detection ───
+    /**
+     * Compute the variance of an array of numbers. Returns null if fewer than 2 values.
+     */
+    computeVariance(values) {
+        if (values.length < 2)
+            return null;
+        const mean = values.reduce((s, v) => s + v, 0) / values.length;
+        const squaredDiffs = values.map((v) => (v - mean) ** 2);
+        return squaredDiffs.reduce((s, v) => s + v, 0) / values.length;
+    }
+    /**
+     * Record a gap observation for a goal dimension into the ring buffer.
+     * Pushes the gap value and trims to CONVERGENCE_WINDOW.
+     */
+    recordGap(key, gap) {
+        const buf = this.gapHistory.get(key) ?? [];
+        buf.push(gap);
+        if (buf.length > CONVERGENCE_WINDOW) {
+            buf.shift();
+        }
+        this.gapHistory.set(key, buf);
+    }
+    /**
+     * Judge convergence for a single gap value against a threshold.
+     * Records the gap in the ring buffer, then evaluates:
+     *   - gap < threshold → satisficed (existing behavior)
+     *   - variance < ε AND gap ≤ threshold × 1.5 → converged_satisficed
+     *   - variance < ε AND gap > threshold × 1.5 → stalled
+     *   - otherwise → in_progress
+     *
+     * @param key      Unique key for the ring buffer (e.g., `${goalId}:${dimensionName}`)
+     * @param gap      Current normalized gap value [0, 1]
+     * @param threshold The satisficing threshold (normalized gap target, typically 0 means met)
+     */
+    judgeConvergence(key, gap, threshold) {
+        this.recordGap(key, gap);
+        const buf = this.gapHistory.get(key) ?? [];
+        const variance = this.computeVariance(buf);
+        let status;
+        if (gap < threshold) {
+            status = "satisficed";
+        }
+        else if (variance !== null && variance < CONVERGENCE_EPSILON) {
+            const acceptableRange = threshold * ACCEPTABLE_RANGE_FACTOR;
+            status = gap <= acceptableRange ? "converged_satisficed" : "stalled";
+        }
+        else {
+            status = "in_progress";
+        }
+        return {
+            status,
+            gap,
+            variance,
+            window_size: CONVERGENCE_WINDOW,
+            samples_available: buf.length,
+        };
+    }
+    /**
+     * Clear the gap history ring buffer for a specific key.
+     * Call this when a goal is reset or completed.
+     */
+    clearGapHistory(key) {
+        this.gapHistory.delete(key);
+    }
+    // ─── Confidence Tier Helpers ───
+    getConfidenceTier(confidence) {
+        if (confidence >= 0.85)
+            return "high";
+        if (confidence >= 0.50)
+            return "medium";
+        return "low";
+    }
+    getCeiling(tier) {
+        switch (tier) {
+            case "high":
+                return 1.0;
+            case "medium":
+                return 0.85;
+            case "low":
+                return 0.60;
+        }
+    }
+    // ─── Progress Calculation (inverse of gap) ───
+    /**
+     * Compute actual progress (0–1) toward satisfying a dimension.
+     * Progress = 1 - normalized_gap, clamped to [0, 1].
+     * For binary thresholds (present/match), either 0 or 1.
+     * null current_value = 0 progress.
+     */
+    computeActualProgress(dim) {
+        if (dim.current_value === null)
+            return 0;
+        return dimensionProgress(dim.current_value, dim.threshold) ?? 0;
+    }
+    // ─── Satisfaction Check ───
+    /**
+     * Determine whether a dimension's current_value meets its threshold.
+     * Uses raw boolean logic (not gap magnitude) for the is_satisfied flag.
+     */
+    isSatisfiedRaw(dim) {
+        const { current_value, threshold } = dim;
+        if (current_value === null)
+            return false;
+        switch (threshold.type) {
+            case "min":
+                return toNumber(current_value) >= threshold.value;
+            case "max":
+                return toNumber(current_value) <= threshold.value;
+            case "range":
+                return (toNumber(current_value) >= threshold.low &&
+                    toNumber(current_value) <= threshold.high);
+            case "present":
+                return isTruthy(current_value);
+            case "match":
+                return current_value === threshold.value;
+        }
+    }
+    // ─── Public API ───
+    /**
+     * Check if a single dimension is satisfied with appropriate confidence ceiling.
+     */
+    isDimensionSatisfied(dim) {
+        const isSatisfied = this.isSatisfiedRaw(dim);
+        const tier = this.getConfidenceTier(dim.confidence);
+        const ceiling = this.getCeiling(tier);
+        const actualProgress = this.computeActualProgress(dim);
+        const effectiveProgress = Math.min(actualProgress, ceiling);
+        // threshold_value for the schema — use numeric representation where applicable
+        const thresholdValue = getNumericThresholdValue(dim);
+        return {
+            dimension_name: dim.name,
+            is_satisfied: isSatisfied,
+            current_value: toNumberOrNull(dim.current_value),
+            threshold_value: thresholdValue,
+            confidence: dim.confidence,
+            confidence_tier: tier,
+            effective_progress: effectiveProgress,
+            progress_ceiling: ceiling,
+        };
+    }
+    /**
+     * Propose dimension mappings between subgoal and parent goal dimensions
+     * using embedding similarity.
+     */
+    async proposeDimensionMapping(subgoalDimensions, parentGoalDimensions) {
+        if (!this.embeddingClient)
+            return [];
+        const proposals = [];
+        for (const subDim of subgoalDimensions) {
+            const subText = subDim.description ? `${subDim.name}: ${subDim.description}` : subDim.name;
+            const subVector = await this.embeddingClient.embed(subText);
+            let bestMatch = null;
+            for (const parentDim of parentGoalDimensions) {
+                const parentText = parentDim.description ? `${parentDim.name}: ${parentDim.description}` : parentDim.name;
+                const parentVector = await this.embeddingClient.embed(parentText);
+                const similarity = this.embeddingClient.cosineSimilarity(subVector, parentVector);
+                if (!bestMatch || similarity > bestMatch.similarity) {
+                    bestMatch = { name: parentDim.name, similarity };
+                }
+            }
+            if (bestMatch && bestMatch.similarity > 0.5) {
+                proposals.push({
+                    subgoal_dimension: subDim.name,
+                    parent_dimension: bestMatch.name,
+                    similarity_score: bestMatch.similarity,
+                    suggested_aggregation: "avg", // default; could be smarter
+                    confidence: Math.min(bestMatch.similarity, 0.9),
+                    reasoning: `Dimension "${subDim.name}" is semantically similar to parent dimension "${bestMatch.name}" (similarity: ${bestMatch.similarity.toFixed(3)})`,
+                });
+            }
+        }
+        return proposals;
+    }
+    /**
+     * Determine if a goal is fully complete.
+     * Complete iff all dimensions are satisfied AND no dimension has low confidence.
+     *
+     * @param goal The goal to check.
+     * @param convergenceStatuses Optional map of dimension key → SatisficingStatus from judgeConvergence().
+     *   When a dimension's convergence status is "converged_satisficed", it is treated as satisfied
+     *   (gap has stabilized within acceptable range — good enough).
+     *   Keys should match the format used with judgeConvergence(): `${goalId}:${dimensionName}`.
+     */
+    isGoalComplete(goal, convergenceStatuses) {
+        const dims = goal.dimensions;
+        if (dims.length === 0) {
+            return {
+                is_complete: true,
+                blocking_dimensions: [],
+                low_confidence_dimensions: [],
+                needs_verification_task: false,
+                checked_at: new Date().toISOString(),
+            };
+        }
+        const satisfactions = dims.map((d) => {
+            const base = this.isDimensionSatisfied(d);
+            // If not already satisfied, check if convergence status marks it as converged_satisficed
+            if (!base.is_satisfied && convergenceStatuses) {
+                const key = `${goal.id}:${d.name}`;
+                const status = convergenceStatuses.get(key);
+                if (status === "converged_satisficed") {
+                    return { ...base, is_satisfied: true, confidence_tier: base.confidence_tier === "low" ? "medium" : base.confidence_tier };
+                }
+            }
+            return base;
+        });
+        const blockingDimensions = satisfactions
+            .filter((s) => !s.is_satisfied)
+            .map((s) => s.dimension_name);
+        const lowConfidenceDimensions = satisfactions
+            .filter((s) => s.confidence_tier === "low")
+            .map((s) => s.dimension_name);
+        // needs_verification_task: any dimension appears to meet threshold but confidence < 0.85
+        const needsVerification = satisfactions.some((s) => s.is_satisfied && s.confidence < 0.85);
+        // P0: Satisficing double-confirmation guard (§4.4)
+        // Require 2 consecutive cycles of gap <= threshold before declaring complete
+        const allDimensionsMet = blockingDimensions.length === 0 && lowConfidenceDimensions.length === 0;
+        let isComplete = false;
+        if (allDimensionsMet) {
+            const streak = (this.satisficingStreak.get(goal.id) ?? 0) + 1;
+            this.satisficingStreak.set(goal.id, streak);
+            if (streak >= 2) {
+                isComplete = true;
+                this.satisficingStreak.delete(goal.id); // Reset after confirmed completion
+            }
+        }
+        else {
+            this.satisficingStreak.set(goal.id, 0); // Reset streak
+        }
+        if (this.onSatisficingJudgment) {
+            const satisfiedDims = satisfactions
+                .filter(s => s.is_satisfied)
+                .map(s => s.dimension_name);
+            if (satisfiedDims.length > 0) {
+                this.onSatisficingJudgment(goal.id, satisfiedDims);
+            }
+        }
+        return {
+            is_complete: isComplete,
+            blocking_dimensions: blockingDimensions,
+            low_confidence_dimensions: lowConfidenceDimensions,
+            needs_verification_task: needsVerification,
+            checked_at: new Date().toISOString(),
+        };
+    }
+    /**
+     * Apply progress ceiling based on confidence tier.
+     * Returns min(actualProgress, ceiling).
+     */
+    applyProgressCeiling(actualProgress, confidence) {
+        const tier = this.getConfidenceTier(confidence);
+        const ceiling = this.getCeiling(tier);
+        return Math.min(actualProgress, ceiling);
+    }
+    /**
+     * Select dimensions to focus on in the next iteration.
+     *
+     * Algorithm:
+     * 1. Exclude already-satisfied dimensions.
+     * 2. Among remaining, sort by drive score (highest first).
+     * 3. Take top max_dimensions.
+     */
+    selectDimensionsForIteration(dimensions, driveScores, constraints) {
+        const maxDimensions = constraints?.max_dimensions ?? 3;
+        const uncertaintyThreshold = constraints?.uncertainty_threshold ?? 0.50;
+        // Build score lookup
+        const scoreMap = new Map(driveScores.map((ds) => [ds.dimension_name, ds.score]));
+        // Filter out satisfied dimensions; mark low-confidence as needing observation first
+        const candidates = dimensions
+            .filter((dim) => !this.isSatisfiedRaw(dim))
+            .filter((dim) => dim.confidence >= uncertaintyThreshold);
+        // Sort by drive score descending
+        candidates.sort((a, b) => {
+            const scoreA = scoreMap.get(a.name) ?? 0;
+            const scoreB = scoreMap.get(b.name) ?? 0;
+            return scoreB - scoreA;
+        });
+        return candidates.slice(0, maxDimensions).map((d) => d.name);
+    }
+    /**
+     * Detect dimensions where threshold adjustment may be warranted.
+     *
+     * Condition 1: >= 3 failures AND normalized_gap has not improved (no progress).
+     * Condition 2: all other dimensions satisfied, this one is still far from threshold.
+     */
+    async detectThresholdAdjustmentNeeded(goal, failureCounts) {
+        const proposals = [];
+        const dims = goal.dimensions;
+        if (dims.length === 0)
+            return proposals;
+        const satisfactions = dims.map((d) => this.isDimensionSatisfied(d));
+        const satisfiedSet = new Set(satisfactions.filter((s) => s.is_satisfied).map((s) => s.dimension_name));
+        for (const dim of dims) {
+            const failures = failureCounts.get(dim.name) ?? 0;
+            const progress = this.computeActualProgress(dim);
+            // Condition 1: high failure count + no meaningful progress (< 10%)
+            if (failures >= 3 && progress < 0.10) {
+                const currentThreshold = getNumericThresholdValueForProposal(dim);
+                if (currentThreshold !== null) {
+                    const proposedThreshold = currentThreshold * 0.8; // propose 20% reduction
+                    proposals.push({
+                        goal_id: goal.id,
+                        dimension_name: dim.name,
+                        current_threshold: currentThreshold,
+                        proposed_threshold: proposedThreshold,
+                        reason: "high_failure_no_progress",
+                        evidence: `${failures} failures with ${Math.round(progress * 100)}% progress toward threshold`,
+                    });
+                }
+            }
+            // Condition 3: Resource undershoot — tasks complete much faster than estimated
+            // but goal progress is stagnant, suggesting the threshold may be too ambitious.
+            // Requires task cost history (actual_elapsed_ms + estimated_duration_ms fields).
+            {
+                const rawHistory = await this.stateManager.readRaw(`tasks/${goal.id}/task-history.json`);
+                const taskHistory = Array.isArray(rawHistory) ? rawHistory : [];
+                const dimHistory = taskHistory.filter((h) => h.primary_dimension === dim.name &&
+                    typeof h.actual_elapsed_ms === "number" &&
+                    typeof h.estimated_duration_ms === "number" &&
+                    h.estimated_duration_ms > 0);
+                if (dimHistory.length >= 3) {
+                    const avgEstimated = dimHistory.reduce((s, h) => s + h.estimated_duration_ms, 0) / dimHistory.length;
+                    const avgActual = dimHistory.reduce((s, h) => s + h.actual_elapsed_ms, 0) / dimHistory.length;
+                    if (avgActual < 0.5 * avgEstimated && progress < 0.5) {
+                        const currentThreshold = getNumericThresholdValueForProposal(dim);
+                        if (currentThreshold !== null &&
+                            !proposals.some((p) => p.dimension_name === dim.name)) {
+                            proposals.push({
+                                goal_id: goal.id,
+                                dimension_name: dim.name,
+                                current_threshold: currentThreshold,
+                                proposed_threshold: currentThreshold * 0.85,
+                                reason: "resource_undershoot",
+                                evidence: `${dimHistory.length} tasks averaged ${Math.round(avgActual)}ms vs ${Math.round(avgEstimated)}ms estimated; goal progress at ${Math.round(progress * 100)}%`,
+                            });
+                        }
+                    }
+                }
+            }
+            // Condition 2: bottleneck — all other dimensions satisfied, this one is far (< 30%)
+            const othersAllSatisfied = dims
+                .filter((d) => d.name !== dim.name)
+                .every((d) => satisfiedSet.has(d.name));
+            if (othersAllSatisfied && !satisfiedSet.has(dim.name) && progress < 0.30) {
+                const currentThreshold = getNumericThresholdValueForProposal(dim);
+                if (currentThreshold !== null && !proposals.some((p) => p.dimension_name === dim.name)) {
+                    const proposedThreshold = currentThreshold * 0.8;
+                    proposals.push({
+                        goal_id: goal.id,
+                        dimension_name: dim.name,
+                        current_threshold: currentThreshold,
+                        proposed_threshold: proposedThreshold,
+                        reason: "bottleneck_dimension",
+                        evidence: `All other dimensions satisfied; this dimension at ${Math.round(progress * 100)}% progress`,
+                    });
+                }
+            }
+        }
+        return proposals;
+    }
+    /**
+     * Judge completion of an entire goal tree by checking all children recursively.
+     * Non-leaf nodes are complete when all children are completed or cancelled(merged).
+     *
+     * @param rootId The ID of the root goal of the tree.
+     * @returns CompletionJudgment for the root node.
+     */
+    async judgeTreeCompletion(rootId, convergenceStatuses) {
+        // judgeTreeCompletion advances the streak by one per call (same as flat goals).
+        // Callers (e.g. CoreLoop) must invoke this across two separate cycles for the
+        // double-confirmation guard to confirm completion — matching flat-goal behaviour.
+        return await judgeTreeCompletionFn(rootId, this.stateManager, (goal, cs) => this.isGoalComplete(goal, cs), convergenceStatuses);
+    }
+    /**
+     * Propagate subgoal completion to the parent goal's matching dimension.
+     *
+     * Phase 2: supports dimension_mapping for aggregation-based propagation.
+     * - If any subgoal dimension has dimension_mapping set, use aggregation path.
+     * - Mixed: mapped dimensions use aggregation; unmapped dimensions fall back to name matching.
+     * - Backwards compatible: if no dimensions have dimension_mapping, behaves like MVP.
+     *
+     * @param subgoalId The subgoal's ID (used for name matching in MVP path).
+     * @param parentGoalId The parent goal's ID to update.
+     * @param subgoalDimensions Optional subgoal dimensions for aggregation mapping.
+     *   When omitted, falls back to MVP name-based matching only.
+     */
+    async propagateSubgoalCompletion(subgoalId, parentGoalId, subgoalDimensions) {
+        await propagateSubgoalCompletionFn(subgoalId, parentGoalId, this.stateManager, (dim) => this.computeActualProgress(dim), subgoalDimensions);
+    }
+}
+//# sourceMappingURL=satisficing-judge.js.map

package/dist/platform/drive/satisficing-judge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"satisficing-judge.js","sourceRoot":"","sources":["../../../src/platform/drive/satisficing-judge.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAYxD,OAAO,EACL,QAAQ,EACR,QAAQ,EACR,cAAc,EACd,wBAAwB,EACxB,mCAAmC,GACpC,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,mBAAmB,IAAI,qBAAqB,EAC5C,0BAA0B,IAAI,4BAA4B,GAC3D,MAAM,8BAA8B,CAAC;AACtC,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAE3D,0CAA0C;AAE1C,MAAM,kBAAkB,GAAG,CAAC,CAAC,CAAQ,mBAAmB;AACxD,MAAM,mBAAmB,GAAG,IAAI,CAAC,CAAI,qBAAqB;AAC1D,MAAM,uBAAuB,GAAG,GAAG,CAAC,CAAC,8CAA8C;AAEnF;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,gBAAgB;IACV,YAAY,CAAe;IAC3B,eAAe,CAAoB;IACnC,qBAAqB,CAA2D;IAEjG,wEAAwE;IACvD,UAAU,GAA0B,IAAI,GAAG,EAAE,CAAC;IAE/D,mDAAmD;IACnD,0EAA0E;IACzD,iBAAiB,GAAwB,IAAI,GAAG,EAAE,CAAC;IAEpE,YACE,YAA0B,EAC1B,eAAkC,EAAG,2CAA2C;IAChF,qBAA+E;QAE/E,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACjC,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,qBAAqB,GAAG,qBAAqB,CAAC;IACrD,CAAC;IAED,gCAAgC;IAEhC;;OAEG;IACK,eAAe,CAAC,MAAgB;QACtC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACnC,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAC/D,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACxD,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACjE,CAAC;IAED;;;OAGG;IACK,SAAS,CAAC,GAAW,EAAE,GAAW;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAC3C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,IAAI,GAAG,CAAC,MAAM,GAAG,kBAAkB,EAAE,CAAC;YACpC,GAAG,CAAC,KAAK,EAAE,CAAC;QACd,CAAC;QACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;;;;;;OAWG;IACH,gBAAgB,CAAC,GAAW,EAAE,GAAW,EAAE,SAAiB;QAC1D,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;QAE3C,IAAI,MAAyB,CAAC;QAE9B,IAAI,GAAG,GAAG,SAAS,EAAE,CAAC;YACpB,MAAM,GAAG,YAAY,CAAC;QACxB,CAAC;aAAM,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,GAAG,mBAAmB,EAAE,CAAC;YAC/D,MAAM,eAAe,GAAG,SAAS,GAAG,uBAAuB,CAAC;YAC5D,MAAM,GAAG,GAAG,IAAI,eAAe,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,SAAS,CAAC;QACvE,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,aAAa,CAAC;QACzB,CAAC;QAED,OAAO;YACL,MAAM;YACN,GAAG;YACH,QAAQ;YACR,WAAW,EAAE,kBAAkB;YAC/B,iBAAiB,EAAE,GAAG,CAAC,MAAM;SAC9B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,eAAe,CAAC,GAAW;QACzB,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,kCAAkC;IAE1B,iBAAiB,CAAC,UAAkB;QAC1C,IAAI,UAAU,IAAI,IAAI;YAAE,OAAO,MAAM,CAAC;QACtC,IAAI,UAAU,IAAI,IAAI;YAAE,OAAO,QAAQ,CAAC;QACxC,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,UAAU,CAAC,IAA+B;QAChD,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,MAAM;gBACT,OAAO,GAAG,CAAC;YACb,KAAK,QAAQ;gBACX,OAAO,IAAI,CAAC;YACd,KAAK,KAAK;gBACR,OAAO,IAAI,CAAC;QAChB,CAAC;IACH,CAAC;IAED,gDAAgD;IAEhD;;;;;OAKG;IACK,qBAAqB,CAAC,GAAc;QAC1C,IAAI,GAAG,CAAC,aAAa,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;QACzC,OAAO,iBAAiB,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAClE,CAAC;IAED,6BAA6B;IAE7B;;;OAGG;IACK,cAAc,CAAC,GAAc;QACnC,MAAM,EAAE,aAAa,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;QAEzC,IAAI,aAAa,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAEzC,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;YACvB,KAAK,KAAK;gBACR,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC;YACpD,KAAK,KAAK;gBACR,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,SAAS,CAAC,KAAK,CAAC;YACpD,KAAK,OAAO;gBACV,OAAO,CACL,QAAQ,CAAC,aAAa,CAAC,IAAI,SAAS,CAAC,GAAG;oBACxC,QAAQ,CAAC,aAAa,CAAC,IAAI,SAAS,CAAC,IAAI,CAC1C,CAAC;YACJ,KAAK,SAAS;gBACZ,OAAO,QAAQ,CAAC,aAAa,CAAC,CAAC;YACjC,KAAK,OAAO;gBACV,OAAO,aAAa,KAAK,SAAS,CAAC,KAAK,CAAC;QAC7C,CAAC;IACH,CAAC;IAED,qBAAqB;IAErB;;OAEG;IACH,oBAAoB,CAAC,GAAc;QACjC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACpD,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,cAAc,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;QACvD,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAE5D,+EAA+E;QAC/E,MAAM,cAAc,GAAG,wBAAwB,CAAC,GAAG,CAAC,CAAC;QAErD,OAAO;YACL,cAAc,EAAE,GAAG,CAAC,IAAI;YACxB,YAAY,EAAE,WAAW;YACzB,aAAa,EAAE,cAAc,CAAC,GAAG,CAAC,aAAa,CAAC;YAChD,eAAe,EAAE,cAAc;YAC/B,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,eAAe,EAAE,IAAI;YACrB,kBAAkB,EAAE,iBAAiB;YACrC,gBAAgB,EAAE,OAAO;SAC1B,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,uBAAuB,CAC3B,iBAAgE,EAChE,oBAAmE;QAEnE,IAAI,CAAC,IAAI,CAAC,eAAe;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,SAAS,GAAsB,EAAE,CAAC;QAExC,KAAK,MAAM,MAAM,IAAI,iBAAiB,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;YAC3F,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YAE5D,IAAI,SAAS,GAAgD,IAAI,CAAC;YAElE,KAAK,MAAM,SAAS,IAAI,oBAAoB,EAAE,CAAC;gBAC7C,MAAM,UAAU,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC;gBAC1G,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBAClE,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;gBAElF,IAAI,CAAC,SAAS,IAAI,UAAU,GAAG,SAAS,CAAC,UAAU,EAAE,CAAC;oBACpD,SAAS,GAAG,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,UAAU,EAAE,CAAC;gBACnD,CAAC;YACH,CAAC;YAED,IAAI,SAAS,IAAI,SAAS,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;gBAC5C,SAAS,CAAC,IAAI,CAAC;oBACb,iBAAiB,EAAE,MAAM,CAAC,IAAI;oBAC9B,gBAAgB,EAAE,SAAS,CAAC,IAAI;oBAChC,gBAAgB,EAAE,SAAS,CAAC,UAAU;oBACtC,qBAAqB,EAAE,KAAK,EAAG,4BAA4B;oBAC3D,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,UAAU,EAAE,GAAG,CAAC;oBAC/C,SAAS,EAAE,cAAc,MAAM,CAAC,IAAI,kDAAkD,SAAS,CAAC,IAAI,kBAAkB,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG;iBACzJ,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;OASG;IACH,cAAc,CACZ,IAAU,EACV,mBAAoD;QAEpD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;QAE7B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,OAAO;gBACL,WAAW,EAAE,IAAI;gBACjB,mBAAmB,EAAE,EAAE;gBACvB,yBAAyB,EAAE,EAAE;gBAC7B,uBAAuB,EAAE,KAAK;gBAC9B,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;aACrC,CAAC;QACJ,CAAC;QAED,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACnC,MAAM,IAAI,GAAG,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC;YAC1C,yFAAyF;YACzF,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,mBAAmB,EAAE,CAAC;gBAC9C,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBACnC,MAAM,MAAM,GAAG,mBAAmB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC5C,IAAI,MAAM,KAAK,sBAAsB,EAAE,CAAC;oBACtC,OAAO,EAAE,GAAG,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,CAAC,eAAe,KAAK,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,EAAE,CAAC;gBAC5H,CAAC;YACH,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QAEH,MAAM,kBAAkB,GAAG,aAAa;aACrC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC;aAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;QAEhC,MAAM,uBAAuB,GAAG,aAAa;aAC1C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,KAAK,KAAK,CAAC;aAC1C,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;QAEhC,yFAAyF;QACzF,MAAM,iBAAiB,GAAG,aAAa,CAAC,IAAI,CAC1C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,UAAU,GAAG,IAAI,CAC7C,CAAC;QAEF,mDAAmD;QACnD,6EAA6E;QAC7E,MAAM,gBAAgB,GAAG,kBAAkB,CAAC,MAAM,KAAK,CAAC,IAAI,uBAAuB,CAAC,MAAM,KAAK,CAAC,CAAC;QACjG,IAAI,UAAU,GAAG,KAAK,CAAC;QACvB,IAAI,gBAAgB,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9D,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YAC5C,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;gBAChB,UAAU,GAAG,IAAI,CAAC;gBAClB,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAE,mCAAmC;YAC9E,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAE,eAAe;QAC1D,CAAC;QAED,IAAI,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC/B,MAAM,aAAa,GAAG,aAAa;iBAChC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC;iBAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC;YAC9B,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,OAAO;YACL,WAAW,EAAE,UAAU;YACvB,mBAAmB,EAAE,kBAAkB;YACvC,yBAAyB,EAAE,uBAAuB;YAClD,uBAAuB,EAAE,iBAAiB;YAC1C,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,oBAAoB,CAAC,cAAsB,EAAE,UAAkB;QAC7D,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACtC,OAAO,IAAI,CAAC,GAAG,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;;OAOG;IACH,4BAA4B,CAC1B,UAAuB,EACvB,WAA6D,EAC7D,WAAkC;QAElC,MAAM,aAAa,GAAG,WAAW,EAAE,cAAc,IAAI,CAAC,CAAC;QACvD,MAAM,oBAAoB,GAAG,WAAW,EAAE,qBAAqB,IAAI,IAAI,CAAC;QAExE,qBAAqB;QACrB,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,cAAc,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CACvD,CAAC;QAEF,oFAAoF;QACpF,MAAM,UAAU,GAAG,UAAU;aAC1B,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;aAC1C,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,IAAI,oBAAoB,CAAC,CAAC;QAE3D,iCAAiC;QACjC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACvB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzC,OAAO,MAAM,GAAG,MAAM,CAAC;QACzB,CAAC,CAAC,CAAC;QAEH,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,+BAA+B,CACnC,IAAU,EACV,aAAkC;QAElC,MAAM,SAAS,GAAkC,EAAE,CAAC;QACpD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;QAE7B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAExC,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CACzE,CAAC;QAEF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC;YAEjD,mEAAmE;YACnE,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ,GAAG,IAAI,EAAE,CAAC;gBACrC,MAAM,gBAAgB,GAAG,mCAAmC,CAAC,GAAG,CAAC,CAAC;gBAClE,IAAI,gBAAgB,KAAK,IAAI,EAAE,CAAC;oBAC9B,MAAM,iBAAiB,GAAG,gBAAgB,GAAG,GAAG,CAAC,CAAC,wBAAwB;oBAC1E,SAAS,CAAC,IAAI,CAAC;wBACb,OAAO,EAAE,IAAI,CAAC,EAAE;wBAChB,cAAc,EAAE,GAAG,CAAC,IAAI;wBACxB,iBAAiB,EAAE,gBAAgB;wBACnC,kBAAkB,EAAE,iBAAiB;wBACrC,MAAM,EAAE,0BAA0B;wBAClC,QAAQ,EAAE,GAAG,QAAQ,kBAAkB,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC,6BAA6B;qBAC/F,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,+EAA+E;YAC/E,gFAAgF;YAChF,iFAAiF;YACjF,CAAC;gBACC,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,SAAS,IAAI,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBACzF,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;gBAEhE,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CACnC,CAAC,CAA0B,EAAE,EAAE,CAC7B,CAAC,CAAC,iBAAiB,KAAK,GAAG,CAAC,IAAI;oBAChC,OAAO,CAAC,CAAC,iBAAiB,KAAK,QAAQ;oBACvC,OAAO,CAAC,CAAC,qBAAqB,KAAK,QAAQ;oBAC1C,CAAC,CAAC,qBAAgC,GAAG,CAAC,CAC6B,CAAC;gBAEzE,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;oBAC3B,MAAM,YAAY,GAChB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,qBAAqB,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;oBAClF,MAAM,SAAS,GACb,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,iBAAiB,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC;oBAE9E,IAAI,SAAS,GAAG,GAAG,GAAG,YAAY,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;wBACrD,MAAM,gBAAgB,GAAG,mCAAmC,CAAC,GAAG,CAAC,CAAC;wBAClE,IACE,gBAAgB,KAAK,IAAI;4BACzB,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,GAAG,CAAC,IAAI,CAAC,EACrD,CAAC;4BACD,SAAS,CAAC,IAAI,CAAC;gCACb,OAAO,EAAE,IAAI,CAAC,EAAE;gCAChB,cAAc,EAAE,GAAG,CAAC,IAAI;gCACxB,iBAAiB,EAAE,gBAAgB;gCACnC,kBAAkB,EAAE,gBAAgB,GAAG,IAAI;gCAC3C,MAAM,EAAE,qBAAqB;gCAC7B,QAAQ,EAAE,GAAG,UAAU,CAAC,MAAM,mBAAmB,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,kCAAkC,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC,GAAG;6BACvK,CAAC,CAAC;wBACL,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YAED,oFAAoF;YACpF,MAAM,kBAAkB,GAAG,IAAI;iBAC5B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC;iBAClC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAE1C,IAAI,kBAAkB,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,QAAQ,GAAG,IAAI,EAAE,CAAC;gBACzE,MAAM,gBAAgB,GAAG,mCAAmC,CAAC,GAAG,CAAC,CAAC;gBAClE,IAAI,gBAAgB,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,KAAK,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACvF,MAAM,iBAAiB,GAAG,gBAAgB,GAAG,GAAG,CAAC;oBACjD,SAAS,CAAC,IAAI,CAAC;wBACb,OAAO,EAAE,IAAI,CAAC,EAAE;wBAChB,cAAc,EAAE,GAAG,CAAC,IAAI;wBACxB,iBAAiB,EAAE,gBAAgB;wBACnC,kBAAkB,EAAE,iBAAiB;wBACrC,MAAM,EAAE,sBAAsB;wBAC9B,QAAQ,EAAE,qDAAqD,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC,YAAY;qBACtG,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,mBAAmB,CACvB,MAAc,EACd,mBAAoD;QAEpD,gFAAgF;QAChF,8EAA8E;QAC9E,kFAAkF;QAClF,OAAO,MAAM,qBAAqB,CAChC,MAAM,EACN,IAAI,CAAC,YAAY,EACjB,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC,EAC3C,mBAAmB,CACpB,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,KAAK,CAAC,0BAA0B,CAC9B,SAAiB,EACjB,YAAoB,EACpB,iBAAkE;QAElE,MAAM,4BAA4B,CAChC,SAAS,EACT,YAAY,EACZ,IAAI,CAAC,YAAY,EACjB,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,EACxC,iBAAiB,CAClB,CAAC;IACJ,CAAC;CACF"}

package/dist/platform/drive/satisficing-propagation.d.ts

@@ -0,0 +1,30 @@
+import { StateManager } from "../../base/state/state-manager.js";
+import type { Goal } from "../../base/types/goal.js";
+import type { CompletionJudgment, SatisficingStatus } from "../../base/types/satisficing.js";
+import type { Logger } from "../../runtime/logger.js";
+/**
+ * Judge completion of an entire goal tree by checking all children recursively.
+ * Non-leaf nodes are complete when all children are completed or cancelled(merged).
+ *
+ * @param rootId The ID of the root goal of the tree.
+ * @param stateManager StateManager instance for loading goals.
+ * @param isGoalComplete Function to check leaf node completion.
+ * @returns CompletionJudgment for the root node.
+ */
+export declare function judgeTreeCompletion(rootId: string, stateManager: StateManager, isGoalComplete: (goal: Goal, convergenceStatuses?: Map<string, SatisficingStatus>) => CompletionJudgment, convergenceStatuses?: Map<string, SatisficingStatus>): Promise<CompletionJudgment>;
+/**
+ * Propagate subgoal completion to the parent goal's matching dimension.
+ *
+ * Phase 2: supports dimension_mapping for aggregation-based propagation.
+ * - If any subgoal dimension has dimension_mapping set, use aggregation path.
+ * - Mixed: mapped dimensions use aggregation; unmapped dimensions fall back to name matching.
+ * - Backwards compatible: if no dimensions have dimension_mapping, behaves like MVP.
+ *
+ * @param subgoalId The subgoal's ID (used for name matching in MVP path).
+ * @param parentGoalId The parent goal's ID to update.
+ * @param stateManager StateManager instance.
+ * @param computeActualProgress Function to compute progress for a dimension.
+ * @param subgoalDimensions Optional subgoal dimensions for aggregation mapping.
+ */
+export declare function propagateSubgoalCompletion(subgoalId: string, parentGoalId: string, stateManager: StateManager, computeActualProgress: (dim: import("../../base/types/goal.js").Dimension) => number, subgoalDimensions?: import("../../base/types/goal.js").Dimension[], logger?: Logger): Promise<void>;
+//# sourceMappingURL=satisficing-propagation.d.ts.map

package/dist/platform/drive/satisficing-propagation.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"satisficing-propagation.d.ts","sourceRoot":"","sources":["../../../src/platform/drive/satisficing-propagation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,MAAM,mCAAmC,CAAC;AACjE,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,0BAA0B,CAAC;AACrD,OAAO,KAAK,EACV,kBAAkB,EAClB,iBAAiB,EAClB,MAAM,iCAAiC,CAAC;AAEzC,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAEtD;;;;;;;;GAQG;AACH,wBAAsB,mBAAmB,CACvC,MAAM,EAAE,MAAM,EACd,YAAY,EAAE,YAAY,EAC1B,cAAc,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,mBAAmB,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,KAAK,kBAAkB,EACxG,mBAAmB,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,iBAAiB,CAAC,GACnD,OAAO,CAAC,kBAAkB,CAAC,CAmE7B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAsB,0BAA0B,CAC9C,SAAS,EAAE,MAAM,EACjB,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,YAAY,EAC1B,qBAAqB,EAAE,CAAC,GAAG,EAAE,OAAO,0BAA0B,EAAE,SAAS,KAAK,MAAM,EACpF,iBAAiB,CAAC,EAAE,OAAO,0BAA0B,EAAE,SAAS,EAAE,EAClE,MAAM,CAAC,EAAE,MAAM,GACd,OAAO,CAAC,IAAI,CAAC,CA0If"}