midas-mcp 5.23.0 → 5.43.1

package/dist/experiments/recursive-planning/recursive-session.d.ts

@@ -0,0 +1,201 @@
+/**
+ * Recursive Planning Session
+ *
+ * TRM-inspired recursive refinement for AI-assisted development.
+ *
+ * Based on "Less is More: Recursive Reasoning with Tiny Networks" (Jolicoeur-Martineau, 2025)
+ *
+ * Core concepts:
+ * - x: input/requirements (stable across iterations)
+ * - z: latent reasoning state (accumulated learning, chain-of-thought)
+ * - y: current answer/implementation state
+ *
+ * Key patterns:
+ * 1. Deep supervision: multiple refinement iterations (Nsup=16 default)
+ * 2. Recursive z refinement: reasoning improves with each cycle
+ * 3. Answer refinement: y improves given z
+ * 4. Adaptive halting: stop when correct, don't waste iterations
+ * 5. State persistence: z carries forward, preventing "forgetting"
+ */
+/**
+ * A single iteration snapshot
+ */
+export interface IterationSnapshot {
+    iteration: number;
+    z: string;
+    y: string;
+    confidence: number;
+    duration?: number;
+}
+/**
+ * Session state - the core x, y, z from TRM
+ */
+export interface SessionState {
+    /** x: Input requirements/context (stable) */
+    x: string;
+    /** y: Current answer/implementation */
+    y: string;
+    /** z: Latent reasoning (accumulated) */
+    z: string;
+    /** Current iteration number */
+    iteration: number;
+    /** Whether session has halted */
+    halted: boolean;
+    /** Reason for halting (if halted) */
+    haltReason: string | null;
+    /** History of all iterations */
+    history: IterationSnapshot[];
+}
+/**
+ * Session configuration
+ */
+export interface SessionConfig {
+    /** Maximum iterations (Nsup in TRM, default 16) */
+    maxIterations: number;
+    /** Number of latent recursions per iteration (T in TRM, default 1) */
+    latentRecursions: number;
+    /** Project path for persistence */
+    projectPath: string;
+}
+/**
+ * Full session object
+ */
+export interface RecursiveSession {
+    id: string;
+    state: SessionState;
+    config: SessionConfig;
+    createdAt: number;
+}
+/**
+ * Halt decision
+ */
+export interface HaltDecision {
+    shouldHalt: boolean;
+    confidence: number;
+    reason: string;
+}
+/**
+ * Refinement result
+ */
+export interface RefinementResult {
+    z: string;
+    duration: number;
+}
+/**
+ * Answer refinement result
+ */
+export interface AnswerRefinementResult {
+    y: string;
+    duration: number;
+}
+/**
+ * Iteration result
+ */
+export interface IterationResult {
+    state: SessionState;
+    duration: number;
+}
+/**
+ * Session run result
+ */
+export interface SessionRunResult {
+    session: RecursiveSession;
+    state: SessionState;
+    totalDuration: number;
+}
+/**
+ * Refiner function types
+ */
+export type ReasoningRefiner = (x: string, y: string, z: string) => string;
+export type AnswerRefiner = (y: string, z: string) => string;
+export type HaltChecker = (x: string, y: string, z: string) => HaltDecision;
+/**
+ * Session refiners configuration
+ */
+export interface SessionRefiners {
+    reasoningRefiner: ReasoningRefiner;
+    answerRefiner: AnswerRefiner;
+    haltChecker: HaltChecker;
+    latentRecursions?: number;
+}
+/**
+ * Create a new recursive session
+ */
+export declare function createSession(options: {
+    x: string;
+    y?: string;
+    z?: string;
+    projectPath: string;
+    maxIterations?: number;
+    latentRecursions?: number;
+    resume?: boolean;
+}): RecursiveSession;
+/**
+ * Serialize session state to JSON
+ */
+export declare function serializeState(state: SessionState): string;
+/**
+ * Deserialize session state from JSON
+ */
+export declare function deserializeState(json: string): SessionState;
+/**
+ * Refine reasoning (z) given x, y, and current z
+ *
+ * This is the core "latent recursion" from TRM:
+ * z = net(x, y, z)
+ */
+export declare function refineReasoning(options: {
+    x: string;
+    y: string;
+    z: string;
+    refiner: ReasoningRefiner;
+}): RefinementResult;
+/**
+ * Refine answer (y) given current y and z
+ *
+ * This is the answer update from TRM:
+ * y = net(y, z)
+ */
+export declare function refineAnswer(options: {
+    y: string;
+    z: string;
+    refiner: AnswerRefiner;
+}): AnswerRefinementResult;
+/**
+ * Merge old and new reasoning, with length cap
+ */
+export declare function mergeReasoning(oldZ: string, newZ: string): string;
+/**
+ * Check if session should halt
+ */
+export declare function checkHalt(options: {
+    x: string;
+    y: string;
+    z: string;
+    iteration?: number;
+    maxIterations?: number;
+    checker: HaltChecker;
+}): HaltDecision;
+/**
+ * Calculate confidence based on state
+ */
+export declare function calculateConfidence(x: string, y: string, z: string): number;
+/**
+ * Run a single iteration of the recursive refinement loop
+ *
+ * Pattern from TRM:
+ * 1. Refine z (latent reasoning) - potentially T times
+ * 2. Refine y (answer) based on z
+ * 3. Check if should halt
+ */
+export declare function runIteration(state: SessionState, refiners: SessionRefiners): IterationResult;
+/**
+ * Run a full recursive session until halt
+ *
+ * This implements the "deep supervision" loop from TRM:
+ * for step in range(N_supervision):
+ *   z, y = refine(x, y, z)
+ *   if should_halt: break
+ */
+export declare function runSession(session: RecursiveSession, refiners: SessionRefiners): SessionRunResult;
+//# sourceMappingURL=recursive-session.d.ts.map

package/dist/experiments/recursive-planning/recursive-session.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recursive-session.d.ts","sourceRoot":"","sources":["../../../src/experiments/recursive-planning/recursive-session.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAUH;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,SAAS,EAAE,MAAM,CAAC;IAClB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,6CAA6C;IAC7C,CAAC,EAAE,MAAM,CAAC;IACV,uCAAuC;IACvC,CAAC,EAAE,MAAM,CAAC;IACV,wCAAwC;IACxC,CAAC,EAAE,MAAM,CAAC;IACV,+BAA+B;IAC/B,SAAS,EAAE,MAAM,CAAC;IAClB,iCAAiC;IACjC,MAAM,EAAE,OAAO,CAAC;IAChB,qCAAqC;IACrC,UAAU,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,gCAAgC;IAChC,OAAO,EAAE,iBAAiB,EAAE,CAAC;CAC9B;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,mDAAmD;IACnD,aAAa,EAAE,MAAM,CAAC;IACtB,sEAAsE;IACtE,gBAAgB,EAAE,MAAM,CAAC;IACzB,mCAAmC;IACnC,WAAW,EAAE,MAAM,CAAC;CACrB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,YAAY,CAAC;IACpB,MAAM,EAAE,aAAa,CAAC;IACtB,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,UAAU,EAAE,OAAO,CAAC;IACpB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,sBAAsB;IACrC,CAAC,EAAE,MAAM,CAAC;IACV,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,YAAY,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,gBAAgB,CAAC;IAC1B,KAAK,EAAE,YAAY,CAAC;IACpB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,MAAM,gBAAgB,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;AAC3E,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,MAAM,CAAC;AAC7D,MAAM,MAAM,WAAW,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,YAAY,CAAC;AAE5E;;GAEG;AACH,MAAM,WAAW,eAAe;IAC9B,gBAAgB,EAAE,gBAAgB,CAAC;IACnC,aAAa,EAAE,aAAa,CAAC;IAC7B,WAAW,EAAE,WAAW,CAAC;IACzB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAuBD;;GAEG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE;IACrC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,CAAC,CAAC,EAAE,MAAM,CAAC;IACX,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAC1B,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB,GAAG,gBAAgB,CA8CnB;AAMD;;GAEG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,YAAY,GAAG,MAAM,CAE1D;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,YAAY,CAuB3D;AAoCD;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE;IACvC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,OAAO,EAAE,gBAAgB,CAAC;CAC3B,GAAG,gBAAgB,CAUnB;AAED;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE;IACpC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,OAAO,EAAE,aAAa,CAAC;CACxB,GAAG,sBAAsB,CAUzB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,CAajE;AAMD;;GAEG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE;IACjC,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,OAAO,EAAE,WAAW,CAAC;CACtB,GAAG,YAAY,CAaf;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAW3E;AAMD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,YAAY,EACnB,QAAQ,EAAE,eAAe,GACxB,eAAe,CAiEjB;AAMD;;;;;;;GAOG;AACH,wBAAgB,UAAU,CACxB,OAAO,EAAE,gBAAgB,EACzB,QAAQ,EAAE,eAAe,GACxB,gBAAgB,CAgDlB"}

package/dist/experiments/recursive-planning/recursive-session.js

@@ -0,0 +1,348 @@
+/**
+ * Recursive Planning Session
+ *
+ * TRM-inspired recursive refinement for AI-assisted development.
+ *
+ * Based on "Less is More: Recursive Reasoning with Tiny Networks" (Jolicoeur-Martineau, 2025)
+ *
+ * Core concepts:
+ * - x: input/requirements (stable across iterations)
+ * - z: latent reasoning state (accumulated learning, chain-of-thought)
+ * - y: current answer/implementation state
+ *
+ * Key patterns:
+ * 1. Deep supervision: multiple refinement iterations (Nsup=16 default)
+ * 2. Recursive z refinement: reasoning improves with each cycle
+ * 3. Answer refinement: y improves given z
+ * 4. Adaptive halting: stop when correct, don't waste iterations
+ * 5. State persistence: z carries forward, preventing "forgetting"
+ */
+import { existsSync, mkdirSync, readFileSync } from 'fs';
+import writeFileAtomic from 'write-file-atomic';
+import { join } from 'path';
+// ============================================================================
+// CONSTANTS
+// ============================================================================
+const MIDAS_DIR = '.midas';
+const SESSION_FILE = 'recursive-session.json';
+const MAX_REASONING_LENGTH = 8000;
+const DEFAULT_MAX_ITERATIONS = 16; // Nsup from TRM paper
+const DEFAULT_LATENT_RECURSIONS = 1; // T from TRM paper (simplified default)
+// ============================================================================
+// SESSION CREATION
+// ============================================================================
+/**
+ * Generate unique session ID
+ */
+function generateSessionId() {
+    return `session_${Date.now().toString(36)}_${Math.random().toString(36).slice(2, 8)}`;
+}
+/**
+ * Create a new recursive session
+ */
+export function createSession(options) {
+    const { x, y = '', z = '', projectPath, maxIterations = DEFAULT_MAX_ITERATIONS, latentRecursions = DEFAULT_LATENT_RECURSIONS, resume = false, } = options;
+    // Try to resume from disk if requested
+    if (resume) {
+        const existingState = loadSessionState(projectPath);
+        if (existingState && existingState.x === x) {
+            return {
+                id: generateSessionId(),
+                state: existingState,
+                config: {
+                    maxIterations,
+                    latentRecursions,
+                    projectPath,
+                },
+                createdAt: Date.now(),
+            };
+        }
+    }
+    return {
+        id: generateSessionId(),
+        state: {
+            x,
+            y,
+            z,
+            iteration: 0,
+            halted: false,
+            haltReason: null,
+            history: [],
+        },
+        config: {
+            maxIterations,
+            latentRecursions,
+            projectPath,
+        },
+        createdAt: Date.now(),
+    };
+}
+// ============================================================================
+// STATE SERIALIZATION
+// ============================================================================
+/**
+ * Serialize session state to JSON
+ */
+export function serializeState(state) {
+    return JSON.stringify(state, null, 2);
+}
+/**
+ * Deserialize session state from JSON
+ */
+export function deserializeState(json) {
+    try {
+        const data = JSON.parse(json);
+        return {
+            x: data.x ?? '',
+            y: data.y ?? '',
+            z: data.z ?? '',
+            iteration: data.iteration ?? 0,
+            halted: data.halted ?? false,
+            haltReason: data.haltReason ?? null,
+            history: data.history ?? [],
+        };
+    }
+    catch {
+        return {
+            x: '',
+            y: '',
+            z: '',
+            iteration: 0,
+            halted: false,
+            haltReason: null,
+            history: [],
+        };
+    }
+}
+/**
+ * Save session state to disk
+ */
+function saveSessionState(projectPath, state) {
+    try {
+        const dir = join(projectPath, MIDAS_DIR);
+        if (!existsSync(dir)) {
+            mkdirSync(dir, { recursive: true });
+        }
+        const path = join(dir, SESSION_FILE);
+        writeFileAtomic.sync(path, serializeState(state));
+    }
+    catch {
+        // Ignore save errors
+    }
+}
+/**
+ * Load session state from disk
+ */
+function loadSessionState(projectPath) {
+    try {
+        const path = join(projectPath, MIDAS_DIR, SESSION_FILE);
+        if (!existsSync(path))
+            return null;
+        const json = readFileSync(path, 'utf-8');
+        return deserializeState(json);
+    }
+    catch {
+        return null;
+    }
+}
+// ============================================================================
+// REFINEMENT FUNCTIONS
+// ============================================================================
+/**
+ * Refine reasoning (z) given x, y, and current z
+ *
+ * This is the core "latent recursion" from TRM:
+ * z = net(x, y, z)
+ */
+export function refineReasoning(options) {
+    const { x, y, z, refiner } = options;
+    const start = Date.now();
+    const newZ = refiner(x, y, z);
+    return {
+        z: newZ,
+        duration: Date.now() - start,
+    };
+}
+/**
+ * Refine answer (y) given current y and z
+ *
+ * This is the answer update from TRM:
+ * y = net(y, z)
+ */
+export function refineAnswer(options) {
+    const { y, z, refiner } = options;
+    const start = Date.now();
+    const newY = refiner(y, z);
+    return {
+        y: newY,
+        duration: Date.now() - start,
+    };
+}
+/**
+ * Merge old and new reasoning, with length cap
+ */
+export function mergeReasoning(oldZ, newZ) {
+    if (!oldZ)
+        return newZ;
+    if (!newZ)
+        return oldZ;
+    const merged = `${oldZ}\n${newZ}`;
+    // Cap length to prevent unbounded growth
+    if (merged.length > MAX_REASONING_LENGTH) {
+        // Keep the most recent reasoning (tail)
+        return merged.slice(-MAX_REASONING_LENGTH);
+    }
+    return merged;
+}
+// ============================================================================
+// HALTING
+// ============================================================================
+/**
+ * Check if session should halt
+ */
+export function checkHalt(options) {
+    const { x, y, z, iteration = 0, maxIterations = 16, checker } = options;
+    // Force halt at max iterations
+    if (iteration >= maxIterations) {
+        return {
+            shouldHalt: true,
+            confidence: calculateConfidence(x, y, z),
+            reason: `Reached max iterations (${maxIterations})`,
+        };
+    }
+    return checker(x, y, z);
+}
+/**
+ * Calculate confidence based on state
+ */
+export function calculateConfidence(x, y, z) {
+    if (!y)
+        return 0;
+    // Simple heuristic: more reasoning iterations = higher confidence
+    const iterations = (z.match(/iteration:/g) || []).length;
+    // Base confidence + iteration bonus, capped at 100
+    const base = 20;
+    const iterationBonus = iterations * 15;
+    return Math.min(100, base + iterationBonus);
+}
+// ============================================================================
+// ITERATION
+// ============================================================================
+/**
+ * Run a single iteration of the recursive refinement loop
+ *
+ * Pattern from TRM:
+ * 1. Refine z (latent reasoning) - potentially T times
+ * 2. Refine y (answer) based on z
+ * 3. Check if should halt
+ */
+export function runIteration(state, refiners) {
+    const { reasoningRefiner, answerRefiner, haltChecker, latentRecursions = DEFAULT_LATENT_RECURSIONS, } = refiners;
+    const start = Date.now();
+    // Clone state to avoid mutation
+    let newState = {
+        ...state,
+        history: [...state.history],
+    };
+    // Step 1: Refine z (latent reasoning) - T times
+    let currentZ = newState.z;
+    for (let t = 0; t < latentRecursions; t++) {
+        const result = refineReasoning({
+            x: newState.x,
+            y: newState.y,
+            z: currentZ,
+            refiner: reasoningRefiner,
+        });
+        currentZ = result.z;
+    }
+    newState.z = currentZ;
+    // Step 2: Refine y (answer) based on z
+    const answerResult = refineAnswer({
+        y: newState.y,
+        z: newState.z,
+        refiner: answerRefiner,
+    });
+    newState.y = answerResult.y;
+    // Step 3: Increment iteration and record history
+    newState.iteration++;
+    const confidence = calculateConfidence(newState.x, newState.y, newState.z);
+    newState.history.push({
+        iteration: newState.iteration,
+        z: newState.z,
+        y: newState.y,
+        confidence,
+    });
+    // Step 4: Check halt condition
+    const haltDecision = checkHalt({
+        x: newState.x,
+        y: newState.y,
+        z: newState.z,
+        iteration: newState.iteration,
+        checker: haltChecker,
+    });
+    if (haltDecision.shouldHalt) {
+        newState.halted = true;
+        newState.haltReason = haltDecision.reason;
+    }
+    return {
+        state: newState,
+        duration: Date.now() - start,
+    };
+}
+// ============================================================================
+// FULL SESSION RUN
+// ============================================================================
+/**
+ * Run a full recursive session until halt
+ *
+ * This implements the "deep supervision" loop from TRM:
+ * for step in range(N_supervision):
+ *   z, y = refine(x, y, z)
+ *   if should_halt: break
+ */
+export function runSession(session, refiners) {
+    const start = Date.now();
+    let currentState = { ...session.state };
+    // Handle zero or negative maxIterations
+    if (session.config.maxIterations <= 0) {
+        currentState.halted = true;
+        currentState.haltReason = 'maxIterations is 0';
+        saveSessionState(session.config.projectPath, currentState);
+        return {
+            session,
+            state: currentState,
+            totalDuration: Date.now() - start,
+        };
+    }
+    // Deep supervision loop
+    while (!currentState.halted && currentState.iteration < session.config.maxIterations) {
+        try {
+            const result = runIteration(currentState, {
+                ...refiners,
+                latentRecursions: refiners.latentRecursions ?? session.config.latentRecursions,
+            });
+            currentState = result.state;
+        }
+        catch (error) {
+            // Handle refiner errors gracefully
+            currentState.halted = true;
+            currentState.haltReason = `Refinement error: ${error instanceof Error ? error.message : 'unknown'}`;
+        }
+    }
+    // Ensure halted at max iterations
+    if (!currentState.halted && currentState.iteration >= session.config.maxIterations) {
+        currentState.halted = true;
+        currentState.haltReason = `Reached max iterations (${session.config.maxIterations})`;
+    }
+    // Persist state
+    saveSessionState(session.config.projectPath, currentState);
+    return {
+        session: {
+            ...session,
+            state: currentState,
+        },
+        state: currentState,
+        totalDuration: Date.now() - start,
+    };
+}
+//# sourceMappingURL=recursive-session.js.map

package/dist/experiments/recursive-planning/recursive-session.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"recursive-session.js","sourceRoot":"","sources":["../../../src/experiments/recursive-planning/recursive-session.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AAEH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AACzD,OAAO,eAAe,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAsH5B,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E,MAAM,SAAS,GAAG,QAAQ,CAAC;AAC3B,MAAM,YAAY,GAAG,wBAAwB,CAAC;AAC9C,MAAM,oBAAoB,GAAG,IAAI,CAAC;AAClC,MAAM,sBAAsB,GAAG,EAAE,CAAC,CAAE,sBAAsB;AAC1D,MAAM,yBAAyB,GAAG,CAAC,CAAC,CAAE,wCAAwC;AAE9E,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;GAEG;AACH,SAAS,iBAAiB;IACxB,OAAO,WAAW,IAAI,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AACxF,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,OAQ7B;IACC,MAAM,EACJ,CAAC,EACD,CAAC,GAAG,EAAE,EACN,CAAC,GAAG,EAAE,EACN,WAAW,EACX,aAAa,GAAG,sBAAsB,EACtC,gBAAgB,GAAG,yBAAyB,EAC5C,MAAM,GAAG,KAAK,GACf,GAAG,OAAO,CAAC;IAEZ,uCAAuC;IACvC,IAAI,MAAM,EAAE,CAAC;QACX,MAAM,aAAa,GAAG,gBAAgB,CAAC,WAAW,CAAC,CAAC;QACpD,IAAI,aAAa,IAAI,aAAa,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3C,OAAO;gBACL,EAAE,EAAE,iBAAiB,EAAE;gBACvB,KAAK,EAAE,aAAa;gBACpB,MAAM,EAAE;oBACN,aAAa;oBACb,gBAAgB;oBAChB,WAAW;iBACZ;gBACD,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;aACtB,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO;QACL,EAAE,EAAE,iBAAiB,EAAE;QACvB,KAAK,EAAE;YACL,CAAC;YACD,CAAC;YACD,CAAC;YACD,SAAS,EAAE,CAAC;YACZ,MAAM,EAAE,KAAK;YACb,UAAU,EAAE,IAAI;YAChB,OAAO,EAAE,EAAE;SACZ;QACD,MAAM,EAAE;YACN,aAAa;YACb,gBAAgB;YAChB,WAAW;SACZ;QACD,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;KACtB,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,sBAAsB;AACtB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,KAAmB;IAChD,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,IAAY;IAC3C,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO;YACL,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE;YACf,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE;YACf,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,EAAE;YACf,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,CAAC;YAC9B,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,KAAK;YAC5B,UAAU,EAAE,IAAI,CAAC,UAAU,IAAI,IAAI;YACnC,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,EAAE;SAC5B,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO;YACL,CAAC,EAAE,EAAE;YACL,CAAC,EAAE,EAAE;YACL,CAAC,EAAE,EAAE;YACL,SAAS,EAAE,CAAC;YACZ,MAAM,EAAE,KAAK;YACb,UAAU,EAAE,IAAI;YAChB,OAAO,EAAE,EAAE;SACZ,CAAC;IACJ,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,WAAmB,EAAE,KAAmB;IAChE,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;QACzC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YACrB,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QACrC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,CAAC;IAAC,MAAM,CAAC;QACP,qBAAqB;IACvB,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,WAAmB;IAC3C,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;QACxD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACnC,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACzC,OAAO,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,uBAAuB;AACvB,+EAA+E;AAE/E;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,OAK/B;IACC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC;IACrC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEzB,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAE9B,OAAO;QACL,CAAC,EAAE,IAAI;QACP,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;KAC7B,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,YAAY,CAAC,OAI5B;IACC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC;IAClC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEzB,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3B,OAAO;QACL,CAAC,EAAE,IAAI;QACP,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;KAC7B,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,IAAY,EAAE,IAAY;IACvD,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IACvB,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,MAAM,GAAG,GAAG,IAAI,KAAK,IAAI,EAAE,CAAC;IAElC,yCAAyC;IACzC,IAAI,MAAM,CAAC,MAAM,GAAG,oBAAoB,EAAE,CAAC;QACzC,wCAAwC;QACxC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,oBAAoB,CAAC,CAAC;IAC7C,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,+EAA+E;AAC/E,UAAU;AACV,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,OAOzB;IACC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS,GAAG,CAAC,EAAE,aAAa,GAAG,EAAE,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC;IAExE,+BAA+B;IAC/B,IAAI,SAAS,IAAI,aAAa,EAAE,CAAC;QAC/B,OAAO;YACL,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;YACxC,MAAM,EAAE,2BAA2B,aAAa,GAAG;SACpD,CAAC;IACJ,CAAC;IAED,OAAO,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS;IACjE,IAAI,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAEjB,kEAAkE;IAClE,MAAM,UAAU,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC;IAEzD,mDAAmD;IACnD,MAAM,IAAI,GAAG,EAAE,CAAC;IAChB,MAAM,cAAc,GAAG,UAAU,GAAG,EAAE,CAAC;IAEvC,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,cAAc,CAAC,CAAC;AAC9C,CAAC;AAED,+EAA+E;AAC/E,YAAY;AACZ,+EAA+E;AAE/E;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAmB,EACnB,QAAyB;IAEzB,MAAM,EACJ,gBAAgB,EAChB,aAAa,EACb,WAAW,EACX,gBAAgB,GAAG,yBAAyB,GAC7C,GAAG,QAAQ,CAAC;IAEb,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAEzB,gCAAgC;IAChC,IAAI,QAAQ,GAAiB;QAC3B,GAAG,KAAK;QACR,OAAO,EAAE,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;KAC5B,CAAC;IAEF,gDAAgD;IAChD,IAAI,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,MAAM,GAAG,eAAe,CAAC;YAC7B,CAAC,EAAE,QAAQ,CAAC,CAAC;YACb,CAAC,EAAE,QAAQ,CAAC,CAAC;YACb,CAAC,EAAE,QAAQ;YACX,OAAO,EAAE,gBAAgB;SAC1B,CAAC,CAAC;QACH,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC;IACtB,CAAC;IACD,QAAQ,CAAC,CAAC,GAAG,QAAQ,CAAC;IAEtB,uCAAuC;IACvC,MAAM,YAAY,GAAG,YAAY,CAAC;QAChC,CAAC,EAAE,QAAQ,CAAC,CAAC;QACb,CAAC,EAAE,QAAQ,CAAC,CAAC;QACb,OAAO,EAAE,aAAa;KACvB,CAAC,CAAC;IACH,QAAQ,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC;IAE5B,iDAAiD;IACjD,QAAQ,CAAC,SAAS,EAAE,CAAC;IACrB,MAAM,UAAU,GAAG,mBAAmB,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC3E,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;QACpB,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,CAAC,EAAE,QAAQ,CAAC,CAAC;QACb,CAAC,EAAE,QAAQ,CAAC,CAAC;QACb,UAAU;KACX,CAAC,CAAC;IAEH,+BAA+B;IAC/B,MAAM,YAAY,GAAG,SAAS,CAAC;QAC7B,CAAC,EAAE,QAAQ,CAAC,CAAC;QACb,CAAC,EAAE,QAAQ,CAAC,CAAC;QACb,CAAC,EAAE,QAAQ,CAAC,CAAC;QACb,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,OAAO,EAAE,WAAW;KACrB,CAAC,CAAC;IAEH,IAAI,YAAY,CAAC,UAAU,EAAE,CAAC;QAC5B,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC;QACvB,QAAQ,CAAC,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC;IAC5C,CAAC;IAED,OAAO;QACL,KAAK,EAAE,QAAQ;QACf,QAAQ,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;KAC7B,CAAC;AACJ,CAAC;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;;;;;;GAOG;AACH,MAAM,UAAU,UAAU,CACxB,OAAyB,EACzB,QAAyB;IAEzB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IACzB,IAAI,YAAY,GAAG,EAAE,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;IAExC,wCAAwC;IACxC,IAAI,OAAO,CAAC,MAAM,CAAC,aAAa,IAAI,CAAC,EAAE,CAAC;QACtC,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC;QAC3B,YAAY,CAAC,UAAU,GAAG,oBAAoB,CAAC;QAC/C,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QAC3D,OAAO;YACL,OAAO;YACP,KAAK,EAAE,YAAY;YACnB,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;SAClC,CAAC;IACJ,CAAC;IAED,wBAAwB;IACxB,OAAO,CAAC,YAAY,CAAC,MAAM,IAAI,YAAY,CAAC,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;QACrF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,YAAY,CAAC,YAAY,EAAE;gBACxC,GAAG,QAAQ;gBACX,gBAAgB,EAAE,QAAQ,CAAC,gBAAgB,IAAI,OAAO,CAAC,MAAM,CAAC,gBAAgB;aAC/E,CAAC,CAAC;YACH,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC;QAC9B,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,mCAAmC;YACnC,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC;YAC3B,YAAY,CAAC,UAAU,GAAG,qBAAqB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;QACtG,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,IAAI,CAAC,YAAY,CAAC,MAAM,IAAI,YAAY,CAAC,SAAS,IAAI,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;QACnF,YAAY,CAAC,MAAM,GAAG,IAAI,CAAC;QAC3B,YAAY,CAAC,UAAU,GAAG,2BAA2B,OAAO,CAAC,MAAM,CAAC,aAAa,GAAG,CAAC;IACvF,CAAC;IAED,gBAAgB;IAChB,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;IAE3D,OAAO;QACL,OAAO,EAAE;YACP,GAAG,OAAO;YACV,KAAK,EAAE,YAAY;SACpB;QACD,KAAK,EAAE,YAAY;QACnB,aAAa,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK;KAClC,CAAC;AACJ,CAAC"}

package/dist/experiments/recursive-planning/recursive-session.test.d.ts

@@ -0,0 +1,19 @@
+/**
+ * Recursive Planning Session - Tests
+ *
+ * TDD-first implementation of TRM-inspired recursive planning.
+ *
+ * Core concepts from the TRM paper:
+ * - x: input/requirements (stable across iterations)
+ * - z: latent reasoning state (accumulated learning, like chain-of-thought)
+ * - y: current answer/implementation state
+ *
+ * Key behaviors:
+ * 1. Deep supervision: multiple refinement iterations
+ * 2. Recursive z refinement: reasoning improves with each cycle
+ * 3. Answer refinement: y improves given z
+ * 4. Adaptive halting: stop when correct, don't waste iterations
+ * 5. State persistence: z carries forward, preventing "forgetting"
+ */
+export {};
+//# sourceMappingURL=recursive-session.test.d.ts.map

package/dist/experiments/recursive-planning/recursive-session.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"recursive-session.test.d.ts","sourceRoot":"","sources":["../../../src/experiments/recursive-planning/recursive-session.test.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;GAgBG"}