pulseed 0.6.5 → 0.7.0

package/dist/platform/drive/progress-predictor.js

@@ -1,116 +0,0 @@
-const TREND_THRESHOLD = 0.005;
-/**
- * ProgressPredictor uses linear regression on recent gap history to predict
- * future gap scores, enabling early stall detection before a stall is confirmed.
- */
-export class ProgressPredictor {
-    minDataPoints;
-    constructor(minDataPoints = 3) {
-        this.minDataPoints = minDataPoints;
-    }
-    /**
-     * Predict the next gap score and trend from gap history.
-     * Returns null if there are fewer than minDataPoints entries.
-     *
-     * @param gapHistory - Array of normalized gap scores (0-1)
-     * @param windowSize - Number of recent entries to use for regression
-     */
-    predict(gapHistory, windowSize = 5) {
-        if (gapHistory.length < this.minDataPoints) {
-            return null;
-        }
-        // Take last windowSize entries
-        const window = gapHistory.slice(-windowSize);
-        const n = window.length;
-        // x values: 0, 1, 2, ..., n-1
-        // y values: gap scores
-        let sumX = 0;
-        let sumY = 0;
-        let sumXY = 0;
-        let sumXX = 0;
-        for (let i = 0; i < n; i++) {
-            sumX += i;
-            sumY += window[i];
-            sumXY += i * window[i];
-            sumXX += i * i;
-        }
-        const denominator = n * sumXX - sumX * sumX;
-        let slope;
-        let intercept;
-        if (denominator === 0) {
-            // All x values are equal (n=1) — use flat line
-            slope = 0;
-            intercept = sumY / n;
-        }
-        else {
-            slope = (n * sumXY - sumX * sumY) / denominator;
-            intercept = (sumY - slope * sumX) / n;
-        }
-        // Predicted next gap score: x = n (next step after 0..n-1)
-        const predictedRaw = slope * n + intercept;
-        const predictedGapScore = Math.max(0, Math.min(1, predictedRaw));
-        // R² (coefficient of determination)
-        const meanY = sumY / n;
-        let ssTot = 0;
-        let ssRes = 0;
-        for (let i = 0; i < n; i++) {
-            const fitted = slope * i + intercept;
-            ssTot += (window[i] - meanY) ** 2;
-            ssRes += (window[i] - fitted) ** 2;
-        }
-        const confidence = ssTot === 0 ? 1.0 : Math.max(0, 1 - ssRes / ssTot);
-        // Trend classification
-        let trend;
-        if (slope < -TREND_THRESHOLD) {
-            trend = "improving"; // gap decreasing → progress
-        }
-        else if (slope > TREND_THRESHOLD) {
-            trend = "worsening"; // gap increasing → regression
-        }
-        else {
-            trend = "stable";
-        }
-        // Predicted iterations to reach gap=0 (only when improving)
-        let predictedIterationsToGoal = null;
-        if (trend === "improving" && slope < 0) {
-            // Solve: slope * x + intercept = 0 → x = -intercept / slope
-            // x is relative to x=0 in the window, so subtract current last index (n-1)
-            const xAtZero = -intercept / slope;
-            const stepsFromNow = xAtZero - (n - 1);
-            if (stepsFromNow > 0.5) {
-                predictedIterationsToGoal = Math.ceil(stepsFromNow);
-            }
-        }
-        return {
-            predictedGapScore,
-            confidence,
-            trend,
-            predictedIterationsToGoal,
-            slopePerIteration: slope,
-        };
-    }
-    /**
-     * Convert outcome-metric trend context into the existing gap-oriented
-     * prediction shape. Metric trend slope is outcome-oriented, so improving
-     * metrics map to decreasing gap.
-     */
-    predictMetricTrend(context) {
-        const trend = context.trend === "regressing" ? "worsening"
-            : context.trend === "stalled" || context.trend === "noisy" ? "stable"
-                : "improving";
-        const slopePerIteration = -Math.abs(context.recent_slope_per_observation);
-        const gapSlope = trend === "worsening"
-            ? Math.abs(context.recent_slope_per_observation)
-            : trend === "stable"
-                ? 0
-                : slopePerIteration;
-        return {
-            predictedGapScore: trend === "worsening" ? 1 : trend === "stable" ? 0.5 : 0,
-            confidence: context.confidence,
-            trend,
-            predictedIterationsToGoal: null,
-            slopePerIteration: gapSlope,
-        };
-    }
-}
-//# sourceMappingURL=progress-predictor.js.map

package/dist/platform/drive/progress-predictor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"progress-predictor.js","sourceRoot":"","sources":["../../../src/platform/drive/progress-predictor.ts"],"names":[],"mappings":"AAUA,MAAM,eAAe,GAAG,KAAK,CAAC;AAE9B;;;GAGG;AACH,MAAM,OAAO,iBAAiB;IACX,aAAa,CAAS;IAEvC,YAAY,aAAa,GAAG,CAAC;QAC3B,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,UAAoB,EAAE,UAAU,GAAG,CAAC;QAC1C,IAAI,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,CAAC;QAED,+BAA+B;QAC/B,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,CAAC;QAC7C,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QAExB,8BAA8B;QAC9B,uBAAuB;QACvB,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,CAAC;YACV,IAAI,IAAI,MAAM,CAAC,CAAC,CAAE,CAAC;YACnB,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;QACjB,CAAC;QAED,MAAM,WAAW,GAAG,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC;QAE5C,IAAI,KAAa,CAAC;QAClB,IAAI,SAAiB,CAAC;QAEtB,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;YACtB,+CAA+C;YAC/C,KAAK,GAAG,CAAC,CAAC;YACV,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,CAAC,CAAC,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,WAAW,CAAC;YAChD,SAAS,GAAG,CAAC,IAAI,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QACxC,CAAC;QAED,2DAA2D;QAC3D,MAAM,YAAY,GAAG,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC;QAC3C,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,CAAC;QAEjE,oCAAoC;QACpC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;QACvB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,GAAG,SAAS,CAAC;YACrC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;YACnC,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;QACtC,CAAC;QAED,MAAM,UAAU,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC;QAEtE,uBAAuB;QACvB,IAAI,KAA2C,CAAC;QAChD,IAAI,KAAK,GAAG,CAAC,eAAe,EAAE,CAAC;YAC7B,KAAK,GAAG,WAAW,CAAC,CAAC,4BAA4B;QACnD,CAAC;aAAM,IAAI,KAAK,GAAG,eAAe,EAAE,CAAC;YACnC,KAAK,GAAG,WAAW,CAAC,CAAC,8BAA8B;QACrD,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,QAAQ,CAAC;QACnB,CAAC;QAED,4DAA4D;QAC5D,IAAI,yBAAyB,GAAkB,IAAI,CAAC;QACpD,IAAI,KAAK,KAAK,WAAW,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACvC,4DAA4D;YAC5D,2EAA2E;YAC3E,MAAM,OAAO,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC;YACnC,MAAM,YAAY,GAAG,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,IAAI,YAAY,GAAG,GAAG,EAAE,CAAC;gBACvB,yBAAyB,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YACtD,CAAC;QACH,CAAC;QAED,OAAO;YACL,iBAAiB;YACjB,UAAU;YACV,KAAK;YACL,yBAAyB;YACzB,iBAAiB,EAAE,KAAK;SACzB,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,kBAAkB,CAAC,OAA2B;QAC5C,MAAM,KAAK,GACT,OAAO,CAAC,KAAK,KAAK,YAAY,CAAC,CAAC,CAAC,WAAW;YAC1C,CAAC,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,IAAI,OAAO,CAAC,KAAK,KAAK,OAAO,CAAC,CAAC,CAAC,QAAQ;gBACnE,CAAC,CAAC,WAAW,CAAC;QACpB,MAAM,iBAAiB,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,4BAA4B,CAAC,CAAC;QAC1E,MAAM,QAAQ,GAAG,KAAK,KAAK,WAAW;YACpC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,4BAA4B,CAAC;YAChD,CAAC,CAAC,KAAK,KAAK,QAAQ;gBAClB,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,iBAAiB,CAAC;QACxB,OAAO;YACL,iBAAiB,EAAE,KAAK,KAAK,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3E,UAAU,EAAE,OAAO,CAAC,UAAU;YAC9B,KAAK;YACL,yBAAyB,EAAE,IAAI;YAC/B,iBAAiB,EAAE,QAAQ;SAC5B,CAAC;IACJ,CAAC;CACF"}

package/dist/platform/drive/reward-log.d.ts

@@ -1,51 +0,0 @@
-/**
- * reward-log.ts
- *
- * Consolidated JSON log output for the reward (drive score) computation.
- * Controlled by the PULSEED_REWARD_LOG environment variable.
- *
- * Usage:
- *   PULSEED_REWARD_LOG=1 pulseed run <goal>
- *
- * Each log line is a single JSON object written to stderr so it does not
- * pollute stdout / TUI output. Default: OFF.
- */
-import type { DriveScore } from "../../base/types/drive.js";
-import type { CompletionJudgment } from "../../base/types/satisficing.js";
-export interface RewardLogEntry {
-    ts: string;
-    goal_id: string;
-    iteration: number;
-    gap_aggregate: number;
-    confidence_avg: number;
-    trust_score: number | null;
-    drive_scores: Array<{
-        dimension: string;
-        dissatisfaction: number;
-        deadline: number;
-        opportunity: number;
-        final_score: number;
-        dominant_drive: string;
-    }>;
-    top_dimension: string | null;
-    is_complete: boolean;
-    blocking_dimensions: string[];
-}
-/**
- * Returns true when PULSEED_REWARD_LOG=1 is set in the environment.
- */
-export declare function isRewardLogEnabled(): boolean;
-/**
- * Emit a single JSON line to stderr with all major reward computation inputs/outputs.
- * No-op when PULSEED_REWARD_LOG is not set to "1".
- */
-export declare function logRewardComputation(params: {
-    goalId: string;
-    iteration: number;
-    gapAggregate: number;
-    confidenceAvg: number;
-    trustScore: number | null;
-    driveScores: DriveScore[];
-    completionJudgment: CompletionJudgment | null;
-}): void;
-//# sourceMappingURL=reward-log.d.ts.map

package/dist/platform/drive/reward-log.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"reward-log.d.ts","sourceRoot":"","sources":["../../../src/platform/drive/reward-log.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AAC5D,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AAE1E,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,MAAM,CAAC;IAClB,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3B,YAAY,EAAE,KAAK,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,eAAe,EAAE,MAAM,CAAC;QACxB,QAAQ,EAAE,MAAM,CAAC;QACjB,WAAW,EAAE,MAAM,CAAC;QACpB,WAAW,EAAE,MAAM,CAAC;QACpB,cAAc,EAAE,MAAM,CAAC;KACxB,CAAC,CAAC;IACH,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,WAAW,EAAE,OAAO,CAAC;IACrB,mBAAmB,EAAE,MAAM,EAAE,CAAC;CAC/B;AAED;;GAEG;AACH,wBAAgB,kBAAkB,IAAI,OAAO,CAE5C;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE;IAC3C,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,YAAY,EAAE,MAAM,CAAC;IACrB,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,WAAW,EAAE,UAAU,EAAE,CAAC;IAC1B,kBAAkB,EAAE,kBAAkB,GAAG,IAAI,CAAC;CAC/C,GAAG,IAAI,CAyBP"}

package/dist/platform/drive/reward-log.js

@@ -1,48 +0,0 @@
-/**
- * reward-log.ts
- *
- * Consolidated JSON log output for the reward (drive score) computation.
- * Controlled by the PULSEED_REWARD_LOG environment variable.
- *
- * Usage:
- *   PULSEED_REWARD_LOG=1 pulseed run <goal>
- *
- * Each log line is a single JSON object written to stderr so it does not
- * pollute stdout / TUI output. Default: OFF.
- */
-/**
- * Returns true when PULSEED_REWARD_LOG=1 is set in the environment.
- */
-export function isRewardLogEnabled() {
-    return process.env["PULSEED_REWARD_LOG"] === "1";
-}
-/**
- * Emit a single JSON line to stderr with all major reward computation inputs/outputs.
- * No-op when PULSEED_REWARD_LOG is not set to "1".
- */
-export function logRewardComputation(params) {
-    if (!isRewardLogEnabled())
-        return;
-    const entry = {
-        ts: new Date().toISOString(),
-        goal_id: params.goalId,
-        iteration: params.iteration,
-        gap_aggregate: params.gapAggregate,
-        confidence_avg: params.confidenceAvg,
-        trust_score: params.trustScore,
-        drive_scores: params.driveScores.map((s) => ({
-            dimension: s.dimension_name,
-            dissatisfaction: s.dissatisfaction,
-            deadline: s.deadline,
-            opportunity: s.opportunity,
-            final_score: s.final_score,
-            dominant_drive: s.dominant_drive,
-        })),
-        // assumes driveScores sorted by score desc (caller contract)
-        top_dimension: params.driveScores[0]?.dimension_name ?? null,
-        is_complete: params.completionJudgment?.is_complete ?? false,
-        blocking_dimensions: params.completionJudgment?.blocking_dimensions ?? [],
-    };
-    process.stderr.write(JSON.stringify(entry) + "\n");
-}
-//# sourceMappingURL=reward-log.js.map

package/dist/platform/drive/reward-log.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"reward-log.js","sourceRoot":"","sources":["../../../src/platform/drive/reward-log.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAyBH;;GAEG;AACH,MAAM,UAAU,kBAAkB;IAChC,OAAO,OAAO,CAAC,GAAG,CAAC,oBAAoB,CAAC,KAAK,GAAG,CAAC;AACnD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAQpC;IACC,IAAI,CAAC,kBAAkB,EAAE;QAAE,OAAO;IAElC,MAAM,KAAK,GAAmB;QAC5B,EAAE,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QAC5B,OAAO,EAAE,MAAM,CAAC,MAAM;QACtB,SAAS,EAAE,MAAM,CAAC,SAAS;QAC3B,aAAa,EAAE,MAAM,CAAC,YAAY;QAClC,cAAc,EAAE,MAAM,CAAC,aAAa;QACpC,WAAW,EAAE,MAAM,CAAC,UAAU;QAC9B,YAAY,EAAE,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC3C,SAAS,EAAE,CAAC,CAAC,cAAc;YAC3B,eAAe,EAAE,CAAC,CAAC,eAAe;YAClC,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,cAAc,EAAE,CAAC,CAAC,cAAc;SACjC,CAAC,CAAC;QACH,6DAA6D;QAC7D,aAAa,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,cAAc,IAAI,IAAI;QAC5D,WAAW,EAAE,MAAM,CAAC,kBAAkB,EAAE,WAAW,IAAI,KAAK;QAC5D,mBAAmB,EAAE,MAAM,CAAC,kBAAkB,EAAE,mBAAmB,IAAI,EAAE;KAC1E,CAAC;IAEF,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,CAAC;AACrD,CAAC"}

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

@@ -1,28 +0,0 @@
-import type { Dimension } from "../../base/types/goal.js";
-/**
- * Aggregate an array of numeric values using the specified strategy.
- *
- * @param values - Numeric values to aggregate.
- * @param aggregation - Strategy: "min" | "avg" | "max" | "all_required".
- * @param thresholds - For "all_required": fulfillment ratios are already computed (values = ratios).
- * @returns Aggregated value, or 0 if values array is empty.
- */
-export declare function aggregateValues(values: number[], aggregation: "min" | "avg" | "max" | "all_required", thresholds?: number[]): number;
-export declare function toNumber(value: number | string | boolean | null): number;
-export declare function isTruthy(value: number | string | boolean | null): boolean;
-export declare function toNumberOrNull(value: number | string | boolean | null): number | null;
-/**
- * Extract a representative numeric threshold value for the DimensionSatisfaction schema.
- * Returns null for "present" (no numeric threshold).
- */
-export declare function getNumericThresholdValue(dim: Dimension): number | null;
-/**
- * Returns the numeric threshold for adjustment proposals.
- * Only applicable to numeric thresholds (min/max/range).
- */
-export declare function getNumericThresholdValueForProposal(dim: Dimension): number | null;
-/**
- * Compute the value that fully satisfies the threshold (for propagation).
- */
-export declare function getSatisfiedValue(dim: Dimension): number | string | boolean | null;
-//# sourceMappingURL=satisficing-helpers.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"satisficing-helpers.d.ts","sourceRoot":"","sources":["../../../src/platform/drive/satisficing-helpers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AAI1D;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,MAAM,EAAE,MAAM,EAAE,EAChB,WAAW,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,cAAc,EACnD,UAAU,CAAC,EAAE,MAAM,EAAE,GACpB,MAAM,CAiBR;AAID,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,GAAG,MAAM,CAQxE;AAED,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,GAAG,OAAO,CAMzE;AAED,wBAAgB,cAAc,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,GAAG,MAAM,GAAG,IAAI,CAGrF;AAED;;;GAGG;AACH,wBAAgB,wBAAwB,CAAC,GAAG,EAAE,SAAS,GAAG,MAAM,GAAG,IAAI,CActE;AAED;;;GAGG;AACH,wBAAgB,mCAAmC,CAAC,GAAG,EAAE,SAAS,GAAG,MAAM,GAAG,IAAI,CAajF;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,SAAS,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,IAAI,CAclF"}

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

@@ -1,111 +0,0 @@
-// ─── Pure Helper: aggregateValues ───
-/**
- * Aggregate an array of numeric values using the specified strategy.
- *
- * @param values - Numeric values to aggregate.
- * @param aggregation - Strategy: "min" | "avg" | "max" | "all_required".
- * @param thresholds - For "all_required": fulfillment ratios are already computed (values = ratios).
- * @returns Aggregated value, or 0 if values array is empty.
- */
-export function aggregateValues(values, aggregation, thresholds) {
-    if (values.length === 0)
-        return 0;
-    switch (aggregation) {
-        case "min":
-            return Math.min(...values);
-        case "max":
-            return Math.max(...values);
-        case "avg": {
-            const sum = values.reduce((acc, v) => acc + v, 0);
-            return sum / values.length;
-        }
-        case "all_required":
-            // values are fulfillment ratios (0..1); return the minimum ratio
-            // (parent is "complete" only if all ratios = 1.0, expressed as min)
-            return Math.min(...values);
-    }
-}
-// ─── Helpers ───
-export function toNumber(value) {
-    if (typeof value === "number")
-        return value;
-    if (typeof value === "boolean")
-        return value ? 1 : 0;
-    if (typeof value === "string") {
-        const n = Number(value);
-        return isNaN(n) ? 0 : n;
-    }
-    return 0;
-}
-export function isTruthy(value) {
-    if (value === null || value === undefined)
-        return false;
-    if (typeof value === "boolean")
-        return value;
-    if (typeof value === "number")
-        return value !== 0;
-    if (typeof value === "string")
-        return value.length > 0;
-    return false;
-}
-export function toNumberOrNull(value) {
-    if (value === null)
-        return null;
-    return toNumber(value);
-}
-/**
- * Extract a representative numeric threshold value for the DimensionSatisfaction schema.
- * Returns null for "present" (no numeric threshold).
- */
-export function getNumericThresholdValue(dim) {
-    const { threshold } = dim;
-    switch (threshold.type) {
-        case "min":
-            return threshold.value;
-        case "max":
-            return threshold.value;
-        case "range":
-            return threshold.high; // use upper bound as representative
-        case "present":
-            return null;
-        case "match":
-            return typeof threshold.value === "number" ? threshold.value : null;
-    }
-}
-/**
- * Returns the numeric threshold for adjustment proposals.
- * Only applicable to numeric thresholds (min/max/range).
- */
-export function getNumericThresholdValueForProposal(dim) {
-    const { threshold } = dim;
-    switch (threshold.type) {
-        case "min":
-            return threshold.value;
-        case "max":
-            return threshold.value;
-        case "range":
-            return threshold.high;
-        case "present":
-        case "match":
-            return null; // adjustment not meaningful for binary thresholds
-    }
-}
-/**
- * Compute the value that fully satisfies the threshold (for propagation).
- */
-export function getSatisfiedValue(dim) {
-    const { threshold } = dim;
-    switch (threshold.type) {
-        case "min":
-            return threshold.value;
-        case "max":
-            return threshold.value;
-        case "range":
-            return (threshold.low + threshold.high) / 2;
-        case "present":
-            return true;
-        case "match":
-            return threshold.value;
-    }
-}
-//# sourceMappingURL=satisficing-helpers.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"satisficing-helpers.js","sourceRoot":"","sources":["../../../src/platform/drive/satisficing-helpers.ts"],"names":[],"mappings":"AAEA,uCAAuC;AAEvC;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,MAAgB,EAChB,WAAmD,EACnD,UAAqB;IAErB,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAElC,QAAQ,WAAW,EAAE,CAAC;QACpB,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QAC7B,KAAK,KAAK;YACR,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QAC7B,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,OAAO,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC;QAC7B,CAAC;QACD,KAAK,cAAc;YACjB,iEAAiE;YACjE,oEAAoE;YACpE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IAC/B,CAAC;AACH,CAAC;AAED,kBAAkB;AAElB,MAAM,UAAU,QAAQ,CAAC,KAAuC;IAC9D,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC5C,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QACxB,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,KAAuC;IAC9D,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACxD,IAAI,OAAO,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC7C,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,KAAK,CAAC,CAAC;IAClD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACvD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAuC;IACpE,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAChC,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,wBAAwB,CAAC,GAAc;IACrD,MAAM,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;IAC1B,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,IAAI,CAAC,CAAC,oCAAoC;QAC7D,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC;QACd,KAAK,OAAO;YACV,OAAO,OAAO,SAAS,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IACxE,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,mCAAmC,CAAC,GAAc;IAChE,MAAM,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;IAC1B,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,IAAI,CAAC;QACxB,KAAK,SAAS,CAAC;QACf,KAAK,OAAO;YACV,OAAO,IAAI,CAAC,CAAC,kDAAkD;IACnE,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAc;IAC9C,MAAM,EAAE,SAAS,EAAE,GAAG,GAAG,CAAC;IAC1B,QAAQ,SAAS,CAAC,IAAI,EAAE,CAAC;QACvB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,KAAK;YACR,OAAO,SAAS,CAAC,KAAK,CAAC;QACzB,KAAK,OAAO;YACV,OAAO,CAAC,SAAS,CAAC,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9C,KAAK,SAAS;YACZ,OAAO,IAAI,CAAC;QACd,KAAK,OAAO;YACV,OAAO,SAAS,CAAC,KAAK,CAAC;IAC3B,CAAC;AACH,CAAC"}

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

@@ -1,140 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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+GzC;;;;;;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"}