tracelattice 1.3.0 → 1.3.2

package/dist/core/evaluator/SignalComputer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"SignalComputer.d.ts","sourceRoot":"","sources":["../../../src/core/evaluator/SignalComputer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AACtE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAMjD,iEAAiE;AACjE,UAAU,uBAAuB;IAChC,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE;QACX,cAAc,EAAE,MAAM,CAAC;QACvB,qBAAqB,EAAE,MAAM,CAAC;QAC9B,gBAAgB,EAAE,MAAM,CAAC;QACzB,oBAAoB,EAAE,MAAM,CAAC;KAC7B,CAAC;CACF;AAED;;;;;;GAMG;AACH,qBAAa,cAAc;IAC1B;;;;;;OAMG;IACI,wBAAwB,CAC9B,OAAO,EAAE,WAAW,EAAE,EACtB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,GACrC,iBAAiB;IAgCpB;;;;;;;;;;;OAWG;IACI,wBAAwB,CAC9B,OAAO,EAAE,WAAW,EAAE,EACtB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,EACvC,gBAAgB,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,EAC7C,WAAW,EAAE,MAAM,EAAE,GACnB,uBAAuB,GAAG,IAAI;IA0DjC;;;;;;OAMG;IACI,0BAA0B,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,MAAM;CAUhE"}
+{"version":3,"file":"SignalComputer.d.ts","sourceRoot":"","sources":["../../../src/core/evaluator/SignalComputer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AACtE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAgBjD,iEAAiE;AACjE,UAAU,uBAAuB;IAChC,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE;QACX,cAAc,EAAE,MAAM,CAAC;QACvB,qBAAqB,EAAE,MAAM,CAAC;QAC9B,gBAAgB,EAAE,MAAM,CAAC;QACzB,oBAAoB,EAAE,MAAM,GAAG,IAAI,CAAC;KACpC,CAAC;IACF,cAAc,EAAE;QACf,cAAc,EAAE,MAAM,CAAC;QACvB,qBAAqB,EAAE,MAAM,CAAC;QAC9B,gBAAgB,EAAE,MAAM,CAAC;QACzB,oBAAoB,EAAE,MAAM,GAAG,IAAI,CAAC;KACpC,CAAC;CACF;AAED;;;;;;GAMG;AACH,qBAAa,cAAc;IAC1B;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,eAAe,CAK5B;IAEX;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,qBAAqB,CAIlC;IAEX;;;;;;OAMG;IACI,wBAAwB,CAC9B,OAAO,EAAE,WAAW,EAAE,EACtB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,GACrC,iBAAiB;IAiCpB;;;;;;;;;;;;;;;OAeG;IACI,wBAAwB,CAC9B,OAAO,EAAE,WAAW,EAAE,EACtB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,EACvC,gBAAgB,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,EAC7C,WAAW,EAAE,MAAM,EAAE,GACnB,uBAAuB,GAAG,IAAI;IA+EjC;;;;;;OAMG;IACI,0BAA0B,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,IAAI;IAUvE;;;;;;OAMG;IACI,6BAA6B,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,MAAM,GAAG,IAAI;CAS1E"}

package/dist/core/evaluator/SignalComputer.js

@@ -1,6 +1,21 @@
 import { ALL_THOUGHT_TYPES, _computeChainDepth, _countByType } from "./internals.js";
 const FLOOR = 0.01;
+function roundToPrecision(value, decimals = 10) {
+    const factor = Math.pow(10, decimals);
+    return Math.round(value * factor) / factor;
+}
 class SignalComputer {
+    static QUALITY_WEIGHTS = {
+        typeDiversity: 0.3,
+        verificationCoverage: 0.3,
+        depthEfficiency: 0.2,
+        confidenceStability: 0.2
+    };
+    static QUALITY_WEIGHTS_NO_CS = {
+        typeDiversity: 0.375,
+        verificationCoverage: 0.375,
+        depthEfficiency: 0.25
+    };
     computeConfidenceSignals(history, branches) {
         const typeDistribution = _countByType(history);
         const allConfidences = history.map((t)=>t.confidence).filter((c)=>void 0 !== c);
@@ -12,10 +27,11 @@ class SignalComputer {
             thought_type_distribution: typeDistribution,
             has_hypothesis: history.some((t)=>'hypothesis' === t.thought_type),
             has_verification: history.some((t)=>'verification' === t.thought_type),
-            average_confidence: allConfidences.length > 0 ? allConfidences.reduce((a, b)=>a + b, 0) / allConfidences.length : null,
+            average_confidence: allConfidences.length > 0 ? roundToPrecision(allConfidences.reduce((a, b)=>a + b, 0) / allConfidences.length) : null,
             ...null !== structuralResult && {
                 structural_quality: structuralResult.score,
-                quality_components: structuralResult.components
+                quality_components: structuralResult.components,
+                quality_components_raw: structuralResult.raw_components
             }
         };
     }
@@ -30,38 +46,64 @@ class SignalComputer {
                 entropy -= pk * Math.log2(pk);
             }
         }
-        const typeDiversity = Math.max(entropy / Math.log2(6), FLOOR);
+        const rawTypeDiversity = entropy / Math.log2(6);
+        const typeDiversity = Math.max(rawTypeDiversity, FLOOR);
         const hypotheses = history.filter((t)=>'hypothesis' === t.thought_type);
         const hypothesisIds = new Set(hypotheses.map((t)=>t.hypothesis_id).filter(Boolean));
         const verifiedIds = new Set(history.filter((t)=>'verification' === t.thought_type && t.hypothesis_id).map((t)=>t.hypothesis_id));
-        const verificationCoverage = 0 === hypothesisIds.size ? 1.0 : Math.max([
+        const rawVerificationCoverage = 0 === hypothesisIds.size ? 1.0 : [
             ...hypothesisIds
-        ].filter((id)=>verifiedIds.has(id)).length / hypothesisIds.size, FLOOR);
+        ].filter((id)=>verifiedIds.has(id)).length / hypothesisIds.size;
+        const verificationCoverage = Math.max(rawVerificationCoverage, FLOOR);
         const chainDepth = _computeChainDepth(history);
         const branchCount = Object.keys(branches).length;
         const effectiveDepth = Math.max(chainDepth, branchCount + 1);
-        const depthEfficiency = Math.max(Math.min(effectiveDepth / total, 1.0), FLOOR);
+        const rawDepthEfficiency = Math.min(effectiveDepth / total, 1.0);
+        const depthEfficiency = Math.max(rawDepthEfficiency, FLOOR);
         const confidenceStability = this.computeConfidenceStability(confidences);
+        const rawConfidenceStability = this.computeRawConfidenceStability(confidences);
         const components = {
             type_diversity: typeDiversity,
             verification_coverage: verificationCoverage,
             depth_efficiency: depthEfficiency,
             confidence_stability: confidenceStability
         };
-        const score = Math.pow(typeDiversity, 0.3) * Math.pow(verificationCoverage, 0.3) * Math.pow(depthEfficiency, 0.2) * Math.pow(confidenceStability, 0.2);
+        const rawComponents = {
+            type_diversity: rawTypeDiversity,
+            verification_coverage: rawVerificationCoverage,
+            depth_efficiency: rawDepthEfficiency,
+            confidence_stability: rawConfidenceStability
+        };
+        let score;
+        if (null !== confidenceStability) {
+            const w = SignalComputer.QUALITY_WEIGHTS;
+            score = Math.pow(typeDiversity, w.typeDiversity) * Math.pow(verificationCoverage, w.verificationCoverage) * Math.pow(depthEfficiency, w.depthEfficiency) * Math.pow(confidenceStability, w.confidenceStability);
+        } else {
+            const w3 = SignalComputer.QUALITY_WEIGHTS_NO_CS;
+            score = Math.pow(typeDiversity, w3.typeDiversity) * Math.pow(verificationCoverage, w3.verificationCoverage) * Math.pow(depthEfficiency, w3.depthEfficiency);
+        }
         return {
             score,
-            components
+            components,
+            raw_components: rawComponents
         };
     }
     computeConfidenceStability(confidences) {
-        if (0 === confidences.length) return Math.max(0.5, FLOOR);
-        if (1 === confidences.length) return Math.max(1.0, FLOOR);
+        if (0 === confidences.length) return 0.5;
+        if (1 === confidences.length) return null;
         const mean = confidences.reduce((a, b)=>a + b, 0) / confidences.length;
         const variance = confidences.reduce((sum, c)=>sum + (c - mean) ** 2, 0) / confidences.length;
         const stddev = Math.sqrt(variance);
         return Math.max(1 - stddev, FLOOR);
     }
+    computeRawConfidenceStability(confidences) {
+        if (0 === confidences.length) return 0.5;
+        if (1 === confidences.length) return null;
+        const mean = confidences.reduce((a, b)=>a + b, 0) / confidences.length;
+        const variance = confidences.reduce((sum, c)=>sum + (c - mean) ** 2, 0) / confidences.length;
+        const stddev = Math.sqrt(variance);
+        return 1 - stddev;
+    }
 }
 export { SignalComputer };
 

package/dist/core/evaluator/SignalComputer.js.map

@@ -1 +1 @@
-{"version":3,"file":"core/evaluator/SignalComputer.js","sources":["../../../src/core/evaluator/SignalComputer.ts"],"sourcesContent":["/**\n * Confidence signal computation for sequential thinking.\n *\n * Provides {@link SignalComputer} — a pure stateless service that computes\n * {@link ConfidenceSignals} (including the composite `structural_quality`\n * score and its components) from thought history and branch data.\n *\n * Extracted from `ThoughtEvaluator` as part of the evaluator decomposition.\n * All methods are pure: no side effects, no I/O, no internal state.\n *\n * @module core/evaluator/SignalComputer\n */\n\nimport type { ConfidenceSignals, ThoughtType } from '../reasoning.js';\nimport type { ThoughtData } from '../thought.js';\nimport { ALL_THOUGHT_TYPES, _computeChainDepth, _countByType } from './internals.js';\n\n/** Floor value applied to each quality component to prevent geometric mean collapse. */\nconst FLOOR = 0.01;\n\n/** Result of {@link SignalComputer.computeStructuralQuality}. */\ninterface StructuralQualityResult {\n\tscore: number;\n\tcomponents: {\n\t\ttype_diversity: number;\n\t\tverification_coverage: number;\n\t\tdepth_efficiency: number;\n\t\tconfidence_stability: number;\n\t};\n}\n\n/**\n * Stateless service that computes {@link ConfidenceSignals} from thought history.\n *\n * @remarks\n * Pure computation — no side effects, no I/O, no internal state.\n * Safe to register as singleton or transient in DI.\n */\nexport class SignalComputer {\n\t/**\n\t * Compute confidence signals from history context.\n\t *\n\t * @param history - All thoughts in the current session\n\t * @param branches - Map of branch IDs to their thought arrays\n\t * @returns Computed confidence signals reflecting reasoning quality\n\t */\n\tpublic computeConfidenceSignals(\n\t\thistory: ThoughtData[],\n\t\tbranches: Record<string, ThoughtData[]>\n\t): ConfidenceSignals {\n\t\tconst typeDistribution = _countByType(history);\n\t\tconst allConfidences = history\n\t\t\t.map((t) => t.confidence)\n\t\t\t.filter((c): c is number => c !== undefined);\n\n\t\t// Compute structural quality components\n\t\tconst structuralResult = this.computeStructuralQuality(\n\t\t\thistory,\n\t\t\tbranches,\n\t\t\ttypeDistribution,\n\t\t\tallConfidences\n\t\t);\n\n\t\treturn {\n\t\t\treasoning_depth: history.length,\n\t\t\trevision_count: history.filter((t) => t.is_revision).length,\n\t\t\tbranch_count: Object.keys(branches).length,\n\t\t\tthought_type_distribution: typeDistribution,\n\t\t\thas_hypothesis: history.some((t) => t.thought_type === 'hypothesis'),\n\t\t\thas_verification: history.some((t) => t.thought_type === 'verification'),\n\t\t\taverage_confidence:\n\t\t\t\tallConfidences.length > 0\n\t\t\t\t\t? allConfidences.reduce((a, b) => a + b, 0) / allConfidences.length\n\t\t\t\t\t: null,\n\t\t\t...(structuralResult !== null && {\n\t\t\t\tstructural_quality: structuralResult.score,\n\t\t\t\tquality_components: structuralResult.components,\n\t\t\t}),\n\t\t};\n\t}\n\n\t/**\n\t * Compute the composite structural quality score and its components.\n\t *\n\t * Algorithm (all components floored at {@link FLOOR} = 0.01):\n\t * - `type_diversity` = Shannon entropy of thought_type distribution / log2(6)\n\t * - `verification_coverage` = verified_hypotheses / max(total_hypotheses, 1) (1.0 if none)\n\t * - `depth_efficiency` = max(chain_depth, branch_count + 1) / total_thoughts, clamped to 1.0\n\t * - `confidence_stability` = 1 - stddev(confidences), default 0.5 when empty\n\t * - `structural_quality` = td^0.3 * vc^0.3 * de^0.2 * cs^0.2 (weighted geometric mean)\n\t *\n\t * @returns Score + components, or `null` when history is empty\n\t */\n\tpublic computeStructuralQuality(\n\t\thistory: ThoughtData[],\n\t\tbranches: Record<string, ThoughtData[]>,\n\t\ttypeDistribution: Record<ThoughtType, number>,\n\t\tconfidences: number[]\n\t): StructuralQualityResult | null {\n\t\tif (history.length === 0) return null;\n\n\t\t// 1. type_diversity: Shannon entropy / log2(6)\n\t\tconst total = history.length;\n\t\tlet entropy = 0;\n\t\tfor (const type of ALL_THOUGHT_TYPES) {\n\t\t\tconst count = typeDistribution[type];\n\t\t\tif (count > 0) {\n\t\t\t\tconst pk = count / total;\n\t\t\t\tentropy -= pk * Math.log2(pk);\n\t\t\t}\n\t\t}\n\t\tconst typeDiversity = Math.max(entropy / Math.log2(6), FLOOR);\n\n\t\t// 2. verification_coverage: verified / total hypotheses (1.0 if none)\n\t\tconst hypotheses = history.filter((t) => t.thought_type === 'hypothesis');\n\t\tconst hypothesisIds = new Set(hypotheses.map((t) => t.hypothesis_id).filter(Boolean));\n\t\tconst verifiedIds = new Set(\n\t\t\thistory\n\t\t\t\t.filter((t) => t.thought_type === 'verification' && t.hypothesis_id)\n\t\t\t\t.map((t) => t.hypothesis_id)\n\t\t);\n\t\tconst verificationCoverage =\n\t\t\thypothesisIds.size === 0\n\t\t\t\t? 1.0\n\t\t\t\t: Math.max(\n\t\t\t\t\t\t[...hypothesisIds].filter((id) => verifiedIds.has(id)).length / hypothesisIds.size,\n\t\t\t\t\t\tFLOOR\n\t\t\t\t\t);\n\n\t\t// 3. depth_efficiency: max(chain_depth, branch_count + 1) / total_thoughts, clamped to 1.0\n\t\t// NOTE (Metis H3): Branching is desirable — treat branches as depth-equivalent.\n\t\tconst chainDepth = _computeChainDepth(history);\n\t\tconst branchCount = Object.keys(branches).length;\n\t\tconst effectiveDepth = Math.max(chainDepth, branchCount + 1);\n\t\tconst depthEfficiency = Math.max(Math.min(effectiveDepth / total, 1.0), FLOOR);\n\n\t\t// 4. confidence_stability: 1 - stddev(confidences), default 0.5\n\t\tconst confidenceStability = this.computeConfidenceStability(confidences);\n\n\t\tconst components = {\n\t\t\ttype_diversity: typeDiversity,\n\t\t\tverification_coverage: verificationCoverage,\n\t\t\tdepth_efficiency: depthEfficiency,\n\t\t\tconfidence_stability: confidenceStability,\n\t\t};\n\n\t\t// Weighted geometric mean: td^0.3 * vc^0.3 * de^0.2 * cs^0.2\n\t\tconst score =\n\t\t\tMath.pow(typeDiversity, 0.3) *\n\t\t\tMath.pow(verificationCoverage, 0.3) *\n\t\t\tMath.pow(depthEfficiency, 0.2) *\n\t\t\tMath.pow(confidenceStability, 0.2);\n\n\t\treturn { score, components };\n\t}\n\n\t/**\n\t * Compute confidence stability: 1 - stddev(confidences).\n\t *\n\t * - Empty input → 0.5 (default neutral value, floored at {@link FLOOR})\n\t * - Single value → 1.0 (perfectly stable, floored at {@link FLOOR})\n\t * - Otherwise → max(1 - stddev, FLOOR)\n\t */\n\tpublic computeConfidenceStability(confidences: number[]): number {\n\t\tif (confidences.length === 0) return Math.max(0.5, FLOOR);\n\t\tif (confidences.length === 1) return Math.max(1.0, FLOOR);\n\n\t\tconst mean = confidences.reduce((a, b) => a + b, 0) / confidences.length;\n\t\tconst variance =\n\t\t\tconfidences.reduce((sum, c) => sum + (c - mean) ** 2, 0) / confidences.length;\n\t\tconst stddev = Math.sqrt(variance);\n\t\treturn Math.max(1 - stddev, FLOOR);\n\t}\n}\n"],"names":["FLOOR","SignalComputer","history","branches","typeDistribution","_countByType","allConfidences","t","c","undefined","structuralResult","Object","a","b","confidences","total","entropy","type","ALL_THOUGHT_TYPES","count","pk","Math","typeDiversity","hypotheses","hypothesisIds","Set","Boolean","verifiedIds","verificationCoverage","id","chainDepth","_computeChainDepth","branchCount","effectiveDepth","depthEfficiency","confidenceStability","components","score","mean","variance","sum","stddev"],"mappings":";AAkBA,MAAMA,QAAQ;AAoBP,MAAMC;IAQL,yBACNC,OAAsB,EACtBC,QAAuC,EACnB;QACpB,MAAMC,mBAAmBC,aAAaH;QACtC,MAAMI,iBAAiBJ,QACrB,GAAG,CAAC,CAACK,IAAMA,EAAE,UAAU,EACvB,MAAM,CAAC,CAACC,IAAmBA,AAAMC,WAAND;QAG7B,MAAME,mBAAmB,IAAI,CAAC,wBAAwB,CACrDR,SACAC,UACAC,kBACAE;QAGD,OAAO;YACN,iBAAiBJ,QAAQ,MAAM;YAC/B,gBAAgBA,QAAQ,MAAM,CAAC,CAACK,IAAMA,EAAE,WAAW,EAAE,MAAM;YAC3D,cAAcI,OAAO,IAAI,CAACR,UAAU,MAAM;YAC1C,2BAA2BC;YAC3B,gBAAgBF,QAAQ,IAAI,CAAC,CAACK,IAAMA,AAAmB,iBAAnBA,EAAE,YAAY;YAClD,kBAAkBL,QAAQ,IAAI,CAAC,CAACK,IAAMA,AAAmB,mBAAnBA,EAAE,YAAY;YACpD,oBACCD,eAAe,MAAM,GAAG,IACrBA,eAAe,MAAM,CAAC,CAACM,GAAGC,IAAMD,IAAIC,GAAG,KAAKP,eAAe,MAAM,GACjE;YACJ,GAAII,AAAqB,SAArBA,oBAA6B;gBAChC,oBAAoBA,iBAAiB,KAAK;gBAC1C,oBAAoBA,iBAAiB,UAAU;YAChD,CAAC;QACF;IACD;IAcO,yBACNR,OAAsB,EACtBC,QAAuC,EACvCC,gBAA6C,EAC7CU,WAAqB,EACY;QACjC,IAAIZ,AAAmB,MAAnBA,QAAQ,MAAM,EAAQ,OAAO;QAGjC,MAAMa,QAAQb,QAAQ,MAAM;QAC5B,IAAIc,UAAU;QACd,KAAK,MAAMC,QAAQC,kBAAmB;YACrC,MAAMC,QAAQf,gBAAgB,CAACa,KAAK;YACpC,IAAIE,QAAQ,GAAG;gBACd,MAAMC,KAAKD,QAAQJ;gBACnBC,WAAWI,KAAKC,KAAK,IAAI,CAACD;YAC3B;QACD;QACA,MAAME,gBAAgBD,KAAK,GAAG,CAACL,UAAUK,KAAK,IAAI,CAAC,IAAIrB;QAGvD,MAAMuB,aAAarB,QAAQ,MAAM,CAAC,CAACK,IAAMA,AAAmB,iBAAnBA,EAAE,YAAY;QACvD,MAAMiB,gBAAgB,IAAIC,IAAIF,WAAW,GAAG,CAAC,CAAChB,IAAMA,EAAE,aAAa,EAAE,MAAM,CAACmB;QAC5E,MAAMC,cAAc,IAAIF,IACvBvB,QACE,MAAM,CAAC,CAACK,IAAMA,AAAmB,mBAAnBA,EAAE,YAAY,IAAuBA,EAAE,aAAa,EAClE,GAAG,CAAC,CAACA,IAAMA,EAAE,aAAa;QAE7B,MAAMqB,uBACLJ,AAAuB,MAAvBA,cAAc,IAAI,GACf,MACAH,KAAK,GAAG,CACR;eAAIG;SAAc,CAAC,MAAM,CAAC,CAACK,KAAOF,YAAY,GAAG,CAACE,KAAK,MAAM,GAAGL,cAAc,IAAI,EAClFxB;QAKJ,MAAM8B,aAAaC,mBAAmB7B;QACtC,MAAM8B,cAAcrB,OAAO,IAAI,CAACR,UAAU,MAAM;QAChD,MAAM8B,iBAAiBZ,KAAK,GAAG,CAACS,YAAYE,cAAc;QAC1D,MAAME,kBAAkBb,KAAK,GAAG,CAACA,KAAK,GAAG,CAACY,iBAAiBlB,OAAO,MAAMf;QAGxE,MAAMmC,sBAAsB,IAAI,CAAC,0BAA0B,CAACrB;QAE5D,MAAMsB,aAAa;YAClB,gBAAgBd;YAChB,uBAAuBM;YACvB,kBAAkBM;YAClB,sBAAsBC;QACvB;QAGA,MAAME,QACLhB,KAAK,GAAG,CAACC,eAAe,OACxBD,KAAK,GAAG,CAACO,sBAAsB,OAC/BP,KAAK,GAAG,CAACa,iBAAiB,OAC1Bb,KAAK,GAAG,CAACc,qBAAqB;QAE/B,OAAO;YAAEE;YAAOD;QAAW;IAC5B;IASO,2BAA2BtB,WAAqB,EAAU;QAChE,IAAIA,AAAuB,MAAvBA,YAAY,MAAM,EAAQ,OAAOO,KAAK,GAAG,CAAC,KAAKrB;QACnD,IAAIc,AAAuB,MAAvBA,YAAY,MAAM,EAAQ,OAAOO,KAAK,GAAG,CAAC,KAAKrB;QAEnD,MAAMsC,OAAOxB,YAAY,MAAM,CAAC,CAACF,GAAGC,IAAMD,IAAIC,GAAG,KAAKC,YAAY,MAAM;QACxE,MAAMyB,WACLzB,YAAY,MAAM,CAAC,CAAC0B,KAAKhC,IAAMgC,MAAOhC,AAAAA,CAAAA,IAAI8B,IAAG,KAAM,GAAG,KAAKxB,YAAY,MAAM;QAC9E,MAAM2B,SAASpB,KAAK,IAAI,CAACkB;QACzB,OAAOlB,KAAK,GAAG,CAAC,IAAIoB,QAAQzC;IAC7B;AACD"}
+{"version":3,"file":"core/evaluator/SignalComputer.js","sources":["../../../src/core/evaluator/SignalComputer.ts"],"sourcesContent":["/**\n * Confidence signal computation for sequential thinking.\n *\n * Provides {@link SignalComputer} — a pure stateless service that computes\n * {@link ConfidenceSignals} (including the composite `structural_quality`\n * score and its components) from thought history and branch data.\n *\n * Extracted from `ThoughtEvaluator` as part of the evaluator decomposition.\n * All methods are pure: no side effects, no I/O, no internal state.\n *\n * @module core/evaluator/SignalComputer\n */\n\nimport type { ConfidenceSignals, ThoughtType } from '../reasoning.js';\nimport type { ThoughtData } from '../thought.js';\nimport { ALL_THOUGHT_TYPES, _computeChainDepth, _countByType } from './internals.js';\n\n/** Floor value applied to each quality component to prevent geometric mean collapse. */\nconst FLOOR = 0.01;\n\n/**\n * Round a numeric value to a fixed number of decimal places to mitigate\n * IEEE 754 floating-point accumulation errors (e.g. 0.9 + 0.8 averaging to\n * 0.8500000000000001 instead of 0.85).\n */\nfunction roundToPrecision(value: number, decimals: number = 10): number {\n\tconst factor = Math.pow(10, decimals);\n\treturn Math.round(value * factor) / factor;\n}\n\n/** Result of {@link SignalComputer.computeStructuralQuality}. */\ninterface StructuralQualityResult {\n\tscore: number;\n\tcomponents: {\n\t\ttype_diversity: number;\n\t\tverification_coverage: number;\n\t\tdepth_efficiency: number;\n\t\tconfidence_stability: number | null;\n\t};\n\traw_components: {\n\t\ttype_diversity: number;\n\t\tverification_coverage: number;\n\t\tdepth_efficiency: number;\n\t\tconfidence_stability: number | null;\n\t};\n}\n\n/**\n * Stateless service that computes {@link ConfidenceSignals} from thought history.\n *\n * @remarks\n * Pure computation — no side effects, no I/O, no internal state.\n * Safe to register as singleton or transient in DI.\n */\nexport class SignalComputer {\n\t/**\n\t * Structural quality weight configuration.\n\t *\n\t * Weights reflect the relative importance of each quality dimension:\n\t * - type_diversity (0.3): Shannon entropy of thought types — rewards reasoning that uses\n\t *   multiple cognitive modes (hypothesis, verification, critique, synthesis) rather than\n\t *   monotonic sequences. Based on information theory: higher entropy = more information.\n\t *\n\t * - verification_coverage (0.3): Ratio of verified to total hypotheses — rewards scientific\n\t *   rigor. Hypotheses without verification are speculation; verification grounds reasoning.\n\t *   Equal weight with diversity because unverified reasoning is a common failure mode.\n\t *\n\t * - depth_efficiency (0.2): Ratio of structural depth to total thoughts — rewards efficient\n\t *   reasoning. Deep chains (many revisions/branches) are good; but only if proportionally\n\t *   dense. Padding with low-value thoughts penalizes this metric.\n\t *\n\t * - confidence_stability (0.2): Low variance in self-assessed confidence — rewards calibrated\n\t *   reasoning. Wildly fluctuating confidence suggests uncertainty about the approach.\n\t *   Lower weight because confidence values are LLM self-reports (inherently noisy).\n\t *\n\t * Design rationale:\n\t * - Diversity + Verification (0.6) > Depth + Stability (0.4): Structural properties of the\n\t *   reasoning DAG are more important than behavioral signals.\n\t * - All weights are positive (no dimension is penalizing).\n\t * - Weights sum to 1.0 for normalized scoring.\n\t * - When confidence_stability is unavailable (n<2), remaining weights redistribute\n\t *   proportionally: td→0.375, vc→0.375, de→0.25 (preserving relative ratios).\n\t */\n\tprivate static readonly QUALITY_WEIGHTS = {\n\t\ttypeDiversity: 0.3,\n\t\tverificationCoverage: 0.3,\n\t\tdepthEfficiency: 0.2,\n\t\tconfidenceStability: 0.2,\n\t} as const;\n\n\t/**\n\t * Redistributed weights when confidence_stability is excluded (n<2).\n\t * Preserves relative ratios of remaining components (sum = 1.0).\n\t */\n\tprivate static readonly QUALITY_WEIGHTS_NO_CS = {\n\t\ttypeDiversity: 0.375,\n\t\tverificationCoverage: 0.375,\n\t\tdepthEfficiency: 0.25,\n\t} as const;\n\n\t/**\n\t * Compute confidence signals from history context.\n\t *\n\t * @param history - All thoughts in the current session\n\t * @param branches - Map of branch IDs to their thought arrays\n\t * @returns Computed confidence signals reflecting reasoning quality\n\t */\n\tpublic computeConfidenceSignals(\n\t\thistory: ThoughtData[],\n\t\tbranches: Record<string, ThoughtData[]>\n\t): ConfidenceSignals {\n\t\tconst typeDistribution = _countByType(history);\n\t\tconst allConfidences = history\n\t\t\t.map((t) => t.confidence)\n\t\t\t.filter((c): c is number => c !== undefined);\n\n\t\t// Compute structural quality components\n\t\tconst structuralResult = this.computeStructuralQuality(\n\t\t\thistory,\n\t\t\tbranches,\n\t\t\ttypeDistribution,\n\t\t\tallConfidences\n\t\t);\n\n\t\treturn {\n\t\t\treasoning_depth: history.length,\n\t\t\trevision_count: history.filter((t) => t.is_revision).length,\n\t\t\tbranch_count: Object.keys(branches).length,\n\t\t\tthought_type_distribution: typeDistribution,\n\t\t\thas_hypothesis: history.some((t) => t.thought_type === 'hypothesis'),\n\t\t\thas_verification: history.some((t) => t.thought_type === 'verification'),\n\t\t\taverage_confidence:\n\t\t\t\tallConfidences.length > 0\n\t\t\t\t\t? roundToPrecision(allConfidences.reduce((a, b) => a + b, 0) / allConfidences.length)\n\t\t\t\t\t: null,\n\t\t\t...(structuralResult !== null && {\n\t\t\t\tstructural_quality: structuralResult.score,\n\t\t\t\tquality_components: structuralResult.components,\n\t\t\t\tquality_components_raw: structuralResult.raw_components,\n\t\t\t}),\n\t\t};\n\t}\n\n\t/**\n\t * Compute the composite structural quality score and its components.\n\t *\n\t * Algorithm (all components floored at {@link FLOOR} = 0.01):\n\t * - `type_diversity` = Shannon entropy of thought_type distribution / log2(6)\n\t * - `verification_coverage` = verified_hypotheses / max(total_hypotheses, 1) (1.0 if none)\n\t * - `depth_efficiency` = max(chain_depth, branch_count + 1) / total_thoughts, clamped to 1.0\n\t * - `confidence_stability` = 1 - stddev(confidences), default 0.5 when empty, null when single value\n\t * - `structural_quality` = td^0.3 * vc^0.3 * de^0.2 * cs^0.2 (weighted geometric mean)\n\t *\n\t * Note: When confidence_stability is null (fewer than 2 confidence values), it is\n\t * excluded from the geometric mean and the remaining weights are redistributed\n\t * proportionally (td→0.375, vc→0.375, de→0.25).\n\t *\n\t * @returns Score + components, or `null` when history is empty\n\t */\n\tpublic computeStructuralQuality(\n\t\thistory: ThoughtData[],\n\t\tbranches: Record<string, ThoughtData[]>,\n\t\ttypeDistribution: Record<ThoughtType, number>,\n\t\tconfidences: number[]\n\t): StructuralQualityResult | null {\n\t\tif (history.length === 0) return null;\n\n\t\t// 1. type_diversity: Shannon entropy / log2(6)\n\t\tconst total = history.length;\n\t\tlet entropy = 0;\n\t\tfor (const type of ALL_THOUGHT_TYPES) {\n\t\t\tconst count = typeDistribution[type];\n\t\t\tif (count > 0) {\n\t\t\t\tconst pk = count / total;\n\t\t\t\tentropy -= pk * Math.log2(pk);\n\t\t\t}\n\t\t}\n\t\tconst rawTypeDiversity = entropy / Math.log2(6);\n\t\tconst typeDiversity = Math.max(rawTypeDiversity, FLOOR);\n\n\t\t// 2. verification_coverage: verified / total hypotheses (1.0 if none)\n\t\tconst hypotheses = history.filter((t) => t.thought_type === 'hypothesis');\n\t\tconst hypothesisIds = new Set(hypotheses.map((t) => t.hypothesis_id).filter(Boolean));\n\t\tconst verifiedIds = new Set(\n\t\t\thistory\n\t\t\t\t.filter((t) => t.thought_type === 'verification' && t.hypothesis_id)\n\t\t\t\t.map((t) => t.hypothesis_id)\n\t\t);\n\t\tconst rawVerificationCoverage =\n\t\t\thypothesisIds.size === 0\n\t\t\t\t? 1.0\n\t\t\t\t: [...hypothesisIds].filter((id) => verifiedIds.has(id)).length / hypothesisIds.size;\n\t\tconst verificationCoverage = Math.max(rawVerificationCoverage, FLOOR);\n\n\t\t// 3. depth_efficiency: max(chain_depth, branch_count + 1) / total_thoughts, clamped to 1.0\n\t\t// NOTE (Metis H3): Branching is desirable — treat branches as depth-equivalent.\n\t\tconst chainDepth = _computeChainDepth(history);\n\t\tconst branchCount = Object.keys(branches).length;\n\t\tconst effectiveDepth = Math.max(chainDepth, branchCount + 1);\n\t\tconst rawDepthEfficiency = Math.min(effectiveDepth / total, 1.0);\n\t\tconst depthEfficiency = Math.max(rawDepthEfficiency, FLOOR);\n\n\t\t// 4. confidence_stability: 1 - stddev(confidences), default 0.5\n\t\tconst confidenceStability = this.computeConfidenceStability(confidences);\n\t\tconst rawConfidenceStability = this.computeRawConfidenceStability(confidences);\n\n\t\tconst components: StructuralQualityResult['components'] = {\n\t\t\ttype_diversity: typeDiversity,\n\t\t\tverification_coverage: verificationCoverage,\n\t\t\tdepth_efficiency: depthEfficiency,\n\t\t\tconfidence_stability: confidenceStability,\n\t\t};\n\n\t\tconst rawComponents: StructuralQualityResult['raw_components'] = {\n\t\t\ttype_diversity: rawTypeDiversity,\n\t\t\tverification_coverage: rawVerificationCoverage,\n\t\t\tdepth_efficiency: rawDepthEfficiency,\n\t\t\tconfidence_stability: rawConfidenceStability,\n\t\t};\n\n\t\t// Weighted geometric mean: td^0.3 * vc^0.3 * de^0.2 * cs^0.2\n\t\t// When confidence_stability is null (n<2), exclude it from the geomean\n\t\t// and redistribute its weight proportionally to remaining components\n\t\t// (normalized td=0.375, vc=0.375, de=0.25)\n\t\tlet score: number;\n\t\tif (confidenceStability !== null) {\n\t\t\tconst w = SignalComputer.QUALITY_WEIGHTS;\n\t\t\tscore =\n\t\t\t\tMath.pow(typeDiversity, w.typeDiversity) *\n\t\t\t\tMath.pow(verificationCoverage, w.verificationCoverage) *\n\t\t\t\tMath.pow(depthEfficiency, w.depthEfficiency) *\n\t\t\t\tMath.pow(confidenceStability, w.confidenceStability);\n\t\t} else {\n\t\t\tconst w3 = SignalComputer.QUALITY_WEIGHTS_NO_CS;\n\t\t\tscore =\n\t\t\t\tMath.pow(typeDiversity, w3.typeDiversity) *\n\t\t\t\tMath.pow(verificationCoverage, w3.verificationCoverage) *\n\t\t\t\tMath.pow(depthEfficiency, w3.depthEfficiency);\n\t\t}\n\n\t\treturn { score, components, raw_components: rawComponents };\n\t}\n\n\t/**\n\t * Compute confidence stability: 1 - stddev(confidences).\n\t *\n\t * - Empty input → 0.5 (neutral default)\n\t * - Single value → null (insufficient data, excluded from structural quality)\n\t * - Otherwise → max(1 - stddev, FLOOR)\n\t */\n\tpublic computeConfidenceStability(confidences: number[]): number | null {\n\t\tif (confidences.length === 0) return 0.5;\n\t\tif (confidences.length === 1) return null;\n\n\t\tconst mean = confidences.reduce((a, b) => a + b, 0) / confidences.length;\n\t\tconst variance = confidences.reduce((sum, c) => sum + (c - mean) ** 2, 0) / confidences.length;\n\t\tconst stddev = Math.sqrt(variance);\n\t\treturn Math.max(1 - stddev, FLOOR);\n\t}\n\n\t/**\n\t * Compute raw (unfloored) confidence stability: 1 - stddev(confidences).\n\t *\n\t * - Empty input → 0.5 (neutral default)\n\t * - Single value → null (insufficient data)\n\t * - Otherwise → 1 - stddev (may be below FLOOR)\n\t */\n\tpublic computeRawConfidenceStability(confidences: number[]): number | null {\n\t\tif (confidences.length === 0) return 0.5;\n\t\tif (confidences.length === 1) return null;\n\n\t\tconst mean = confidences.reduce((a, b) => a + b, 0) / confidences.length;\n\t\tconst variance = confidences.reduce((sum, c) => sum + (c - mean) ** 2, 0) / confidences.length;\n\t\tconst stddev = Math.sqrt(variance);\n\t\treturn 1 - stddev;\n\t}\n}\n"],"names":["FLOOR","roundToPrecision","value","decimals","factor","Math","SignalComputer","history","branches","typeDistribution","_countByType","allConfidences","t","c","undefined","structuralResult","Object","a","b","confidences","total","entropy","type","ALL_THOUGHT_TYPES","count","pk","rawTypeDiversity","typeDiversity","hypotheses","hypothesisIds","Set","Boolean","verifiedIds","rawVerificationCoverage","id","verificationCoverage","chainDepth","_computeChainDepth","branchCount","effectiveDepth","rawDepthEfficiency","depthEfficiency","confidenceStability","rawConfidenceStability","components","rawComponents","score","w","w3","mean","variance","sum","stddev"],"mappings":";AAkBA,MAAMA,QAAQ;AAOd,SAASC,iBAAiBC,KAAa,EAAEC,WAAmB,EAAE;IAC7D,MAAMC,SAASC,KAAK,GAAG,CAAC,IAAIF;IAC5B,OAAOE,KAAK,KAAK,CAACH,QAAQE,UAAUA;AACrC;AA0BO,MAAME;IA6BZ,OAAwB,kBAAkB;QACzC,eAAe;QACf,sBAAsB;QACtB,iBAAiB;QACjB,qBAAqB;IACtB,EAAW;IAMX,OAAwB,wBAAwB;QAC/C,eAAe;QACf,sBAAsB;QACtB,iBAAiB;IAClB,EAAW;IASJ,yBACNC,OAAsB,EACtBC,QAAuC,EACnB;QACpB,MAAMC,mBAAmBC,aAAaH;QACtC,MAAMI,iBAAiBJ,QACrB,GAAG,CAAC,CAACK,IAAMA,EAAE,UAAU,EACvB,MAAM,CAAC,CAACC,IAAmBA,AAAMC,WAAND;QAG7B,MAAME,mBAAmB,IAAI,CAAC,wBAAwB,CACrDR,SACAC,UACAC,kBACAE;QAGD,OAAO;YACN,iBAAiBJ,QAAQ,MAAM;YAC/B,gBAAgBA,QAAQ,MAAM,CAAC,CAACK,IAAMA,EAAE,WAAW,EAAE,MAAM;YAC3D,cAAcI,OAAO,IAAI,CAACR,UAAU,MAAM;YAC1C,2BAA2BC;YAC3B,gBAAgBF,QAAQ,IAAI,CAAC,CAACK,IAAMA,AAAmB,iBAAnBA,EAAE,YAAY;YAClD,kBAAkBL,QAAQ,IAAI,CAAC,CAACK,IAAMA,AAAmB,mBAAnBA,EAAE,YAAY;YACpD,oBACCD,eAAe,MAAM,GAAG,IACrBV,iBAAiBU,eAAe,MAAM,CAAC,CAACM,GAAGC,IAAMD,IAAIC,GAAG,KAAKP,eAAe,MAAM,IAClF;YACJ,GAAII,AAAqB,SAArBA,oBAA6B;gBAChC,oBAAoBA,iBAAiB,KAAK;gBAC1C,oBAAoBA,iBAAiB,UAAU;gBAC/C,wBAAwBA,iBAAiB,cAAc;YACxD,CAAC;QACF;IACD;IAkBO,yBACNR,OAAsB,EACtBC,QAAuC,EACvCC,gBAA6C,EAC7CU,WAAqB,EACY;QACjC,IAAIZ,AAAmB,MAAnBA,QAAQ,MAAM,EAAQ,OAAO;QAGjC,MAAMa,QAAQb,QAAQ,MAAM;QAC5B,IAAIc,UAAU;QACd,KAAK,MAAMC,QAAQC,kBAAmB;YACrC,MAAMC,QAAQf,gBAAgB,CAACa,KAAK;YACpC,IAAIE,QAAQ,GAAG;gBACd,MAAMC,KAAKD,QAAQJ;gBACnBC,WAAWI,KAAKpB,KAAK,IAAI,CAACoB;YAC3B;QACD;QACA,MAAMC,mBAAmBL,UAAUhB,KAAK,IAAI,CAAC;QAC7C,MAAMsB,gBAAgBtB,KAAK,GAAG,CAACqB,kBAAkB1B;QAGjD,MAAM4B,aAAarB,QAAQ,MAAM,CAAC,CAACK,IAAMA,AAAmB,iBAAnBA,EAAE,YAAY;QACvD,MAAMiB,gBAAgB,IAAIC,IAAIF,WAAW,GAAG,CAAC,CAAChB,IAAMA,EAAE,aAAa,EAAE,MAAM,CAACmB;QAC5E,MAAMC,cAAc,IAAIF,IACvBvB,QACE,MAAM,CAAC,CAACK,IAAMA,AAAmB,mBAAnBA,EAAE,YAAY,IAAuBA,EAAE,aAAa,EAClE,GAAG,CAAC,CAACA,IAAMA,EAAE,aAAa;QAE7B,MAAMqB,0BACLJ,AAAuB,MAAvBA,cAAc,IAAI,GACf,MACA;eAAIA;SAAc,CAAC,MAAM,CAAC,CAACK,KAAOF,YAAY,GAAG,CAACE,KAAK,MAAM,GAAGL,cAAc,IAAI;QACtF,MAAMM,uBAAuB9B,KAAK,GAAG,CAAC4B,yBAAyBjC;QAI/D,MAAMoC,aAAaC,mBAAmB9B;QACtC,MAAM+B,cAActB,OAAO,IAAI,CAACR,UAAU,MAAM;QAChD,MAAM+B,iBAAiBlC,KAAK,GAAG,CAAC+B,YAAYE,cAAc;QAC1D,MAAME,qBAAqBnC,KAAK,GAAG,CAACkC,iBAAiBnB,OAAO;QAC5D,MAAMqB,kBAAkBpC,KAAK,GAAG,CAACmC,oBAAoBxC;QAGrD,MAAM0C,sBAAsB,IAAI,CAAC,0BAA0B,CAACvB;QAC5D,MAAMwB,yBAAyB,IAAI,CAAC,6BAA6B,CAACxB;QAElE,MAAMyB,aAAoD;YACzD,gBAAgBjB;YAChB,uBAAuBQ;YACvB,kBAAkBM;YAClB,sBAAsBC;QACvB;QAEA,MAAMG,gBAA2D;YAChE,gBAAgBnB;YAChB,uBAAuBO;YACvB,kBAAkBO;YAClB,sBAAsBG;QACvB;QAMA,IAAIG;QACJ,IAAIJ,AAAwB,SAAxBA,qBAA8B;YACjC,MAAMK,IAAIzC,eAAe,eAAe;YACxCwC,QACCzC,KAAK,GAAG,CAACsB,eAAeoB,EAAE,aAAa,IACvC1C,KAAK,GAAG,CAAC8B,sBAAsBY,EAAE,oBAAoB,IACrD1C,KAAK,GAAG,CAACoC,iBAAiBM,EAAE,eAAe,IAC3C1C,KAAK,GAAG,CAACqC,qBAAqBK,EAAE,mBAAmB;QACrD,OAAO;YACN,MAAMC,KAAK1C,eAAe,qBAAqB;YAC/CwC,QACCzC,KAAK,GAAG,CAACsB,eAAeqB,GAAG,aAAa,IACxC3C,KAAK,GAAG,CAAC8B,sBAAsBa,GAAG,oBAAoB,IACtD3C,KAAK,GAAG,CAACoC,iBAAiBO,GAAG,eAAe;QAC9C;QAEA,OAAO;YAAEF;YAAOF;YAAY,gBAAgBC;QAAc;IAC3D;IASO,2BAA2B1B,WAAqB,EAAiB;QACvE,IAAIA,AAAuB,MAAvBA,YAAY,MAAM,EAAQ,OAAO;QACrC,IAAIA,AAAuB,MAAvBA,YAAY,MAAM,EAAQ,OAAO;QAErC,MAAM8B,OAAO9B,YAAY,MAAM,CAAC,CAACF,GAAGC,IAAMD,IAAIC,GAAG,KAAKC,YAAY,MAAM;QACxE,MAAM+B,WAAW/B,YAAY,MAAM,CAAC,CAACgC,KAAKtC,IAAMsC,MAAOtC,AAAAA,CAAAA,IAAIoC,IAAG,KAAM,GAAG,KAAK9B,YAAY,MAAM;QAC9F,MAAMiC,SAAS/C,KAAK,IAAI,CAAC6C;QACzB,OAAO7C,KAAK,GAAG,CAAC,IAAI+C,QAAQpD;IAC7B;IASO,8BAA8BmB,WAAqB,EAAiB;QAC1E,IAAIA,AAAuB,MAAvBA,YAAY,MAAM,EAAQ,OAAO;QACrC,IAAIA,AAAuB,MAAvBA,YAAY,MAAM,EAAQ,OAAO;QAErC,MAAM8B,OAAO9B,YAAY,MAAM,CAAC,CAACF,GAAGC,IAAMD,IAAIC,GAAG,KAAKC,YAAY,MAAM;QACxE,MAAM+B,WAAW/B,YAAY,MAAM,CAAC,CAACgC,KAAKtC,IAAMsC,MAAOtC,AAAAA,CAAAA,IAAIoC,IAAG,KAAM,GAAG,KAAK9B,YAAY,MAAM;QAC9F,MAAMiC,SAAS/C,KAAK,IAAI,CAAC6C;QACzB,OAAO,IAAIE;IACZ;AACD"}

package/dist/core/graph/EdgeEmitter.d.ts

@@ -0,0 +1,64 @@
+/**
+ * EdgeEmitter — emits DAG edges for thoughts based on their metadata.
+ *
+ * Stateless helper extracted from HistoryManager. Holds a reference to an
+ * optional `IEdgeStore` and a feature flag (`dagEdges`) gating writes.
+ *
+ * @module EdgeEmitter
+ */
+import type { IEdgeStore } from '../../contracts/interfaces.js';
+import type { Logger } from '../../logger/StructuredLogger.js';
+import type { ThoughtData } from '../thought.js';
+/** Minimal session view needed for edge emission. */
+export interface EdgeEmissionSession {
+    thought_history: ThoughtData[];
+    branches: Record<string, ThoughtData[]>;
+}
+/** Configuration options for EdgeEmitter. */
+export interface EdgeEmitterConfig {
+    edgeStore?: IEdgeStore;
+    dagEdges?: boolean;
+    defaultSessionId: string;
+    logger?: Logger;
+}
+/**
+ * Emits DAG edges for thought relationships when an `IEdgeStore` is configured
+ * and the `dagEdges` feature flag is enabled. No-ops otherwise.
+ */
+export declare class EdgeEmitter {
+    private readonly _edgeStore?;
+    private readonly _dagEdges;
+    private readonly _defaultSessionId;
+    private readonly _logger;
+    constructor(config: EdgeEmitterConfig);
+    /** Returns true when edge emission is active (store + flag both set). */
+    isEnabled(): boolean;
+    /**
+     * Emits DAG edges for a thought based on its metadata fields.
+     *
+     * Edge kinds (in priority order):
+     * - branch: branch_from_thought + branch_id → parent.id → current.id
+     * - merge: merge_from_thoughts → source.id → current.id (per source)
+     * - verifies: verification_target + thought_type=verification → current.id → target.id
+     * - critiques: verification_target + thought_type=critique → current.id → target.id
+     * - derives_from: synthesis_sources → source.id → current.id (per source)
+     * - revises: revises_thought → current.id → target.id
+     * - tool_invocation: tool_observation with _resumedFrom → tool_call.id → current.id
+     * - sequence: default chronological link from previous thought (if none of the above)
+     */
+    emitEdgesForThought(session: EdgeEmissionSession, thought: ThoughtData): void;
+    /**
+     * Resolves a thought_number to its stable id within the given session.
+     * Searches main history first, then branches.
+     *
+     * @returns The thought's id if found and non-empty, undefined otherwise
+     */
+    resolveThoughtId(session: EdgeEmissionSession, thoughtNumber: number): string | undefined;
+    /**
+     * Adds an edge to the edge store if both endpoints are non-empty strings.
+     * Returns true if added, false if skipped (missing endpoint).
+     * Failures (e.g. self-edge) are caught and logged.
+     */
+    private _addEdgeIfValid;
+}
+//# sourceMappingURL=EdgeEmitter.d.ts.map

package/dist/core/graph/EdgeEmitter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"EdgeEmitter.d.ts","sourceRoot":"","sources":["../../../src/core/graph/EdgeEmitter.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AAEhE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,kCAAkC,CAAC;AAE/D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAIjD,qDAAqD;AACrD,MAAM,WAAW,mBAAmB;IACnC,eAAe,EAAE,WAAW,EAAE,CAAC;IAC/B,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;CACxC;AAED,6CAA6C;AAC7C,MAAM,WAAW,iBAAiB;IACjC,SAAS,CAAC,EAAE,UAAU,CAAC;IACvB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,gBAAgB,EAAE,MAAM,CAAC;IACzB,MAAM,CAAC,EAAE,MAAM,CAAC;CAChB;AAED;;;GAGG;AACH,qBAAa,WAAW;IACvB,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAa;IACzC,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAU;IACpC,OAAO,CAAC,QAAQ,CAAC,iBAAiB,CAAS;IAC3C,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;gBAErB,MAAM,EAAE,iBAAiB;IAOrC,yEAAyE;IAClE,SAAS,IAAI,OAAO;IAI3B;;;;;;;;;;;;OAYG;IACI,mBAAmB,CAAC,OAAO,EAAE,mBAAmB,EAAE,OAAO,EAAE,WAAW,GAAG,IAAI;IAoFpF;;;;;OAKG;IACI,gBAAgB,CACtB,OAAO,EAAE,mBAAmB,EAC5B,aAAa,EAAE,MAAM,GACnB,MAAM,GAAG,SAAS;IAgBrB;;;;OAIG;IACH,OAAO,CAAC,eAAe;CAmCvB"}

package/dist/core/graph/EdgeEmitter.js

@@ -0,0 +1,99 @@
+import { getErrorMessage } from "../../errors.js";
+import { NullLogger } from "../../logger/NullLogger.js";
+import { generateUlid } from "../ids.js";
+class EdgeEmitter {
+    _edgeStore;
+    _dagEdges;
+    _defaultSessionId;
+    _logger;
+    constructor(config){
+        this._edgeStore = config.edgeStore;
+        this._dagEdges = config.dagEdges ?? true;
+        this._defaultSessionId = config.defaultSessionId;
+        this._logger = config.logger ?? new NullLogger();
+    }
+    isEnabled() {
+        return void 0 !== this._edgeStore && this._dagEdges;
+    }
+    emitEdgesForThought(session, thought) {
+        if (!this._edgeStore || !this._dagEdges) return;
+        if (!thought.id) return;
+        const sessionId = thought.session_id ?? this._defaultSessionId;
+        let emittedRelational = false;
+        if (void 0 !== thought.branch_from_thought && thought.branch_id) {
+            const parentId = this.resolveThoughtId(session, thought.branch_from_thought);
+            if (this._addEdgeIfValid(parentId, thought.id, 'branch', sessionId)) emittedRelational = true;
+        }
+        if (thought.merge_from_thoughts?.length) for (const src of thought.merge_from_thoughts){
+            const srcId = this.resolveThoughtId(session, src);
+            if (this._addEdgeIfValid(srcId, thought.id, 'merge', sessionId)) emittedRelational = true;
+        }
+        if (void 0 !== thought.verification_target && 'verification' === thought.thought_type) {
+            const targetId = this.resolveThoughtId(session, thought.verification_target);
+            if (this._addEdgeIfValid(thought.id, targetId, 'verifies', sessionId)) emittedRelational = true;
+        }
+        if (void 0 !== thought.verification_target && 'critique' === thought.thought_type) {
+            const targetId = this.resolveThoughtId(session, thought.verification_target);
+            if (this._addEdgeIfValid(thought.id, targetId, 'critiques', sessionId)) emittedRelational = true;
+        }
+        if (thought.synthesis_sources?.length) for (const src of thought.synthesis_sources){
+            const srcId = this.resolveThoughtId(session, src);
+            if (this._addEdgeIfValid(srcId, thought.id, 'derives_from', sessionId)) emittedRelational = true;
+        }
+        if (void 0 !== thought.revises_thought) {
+            const targetId = this.resolveThoughtId(session, thought.revises_thought);
+            if (this._addEdgeIfValid(thought.id, targetId, 'revises', sessionId)) emittedRelational = true;
+        }
+        if ('tool_observation' === thought.thought_type && void 0 !== thought._resumedFrom) {
+            const toolCallId = this.resolveThoughtId(session, thought._resumedFrom);
+            const meta = {};
+            if (void 0 !== thought.tool_name) meta.tool_name = thought.tool_name;
+            if (this._addEdgeIfValid(toolCallId, thought.id, 'tool_invocation', sessionId, Object.keys(meta).length > 0 ? meta : void 0)) emittedRelational = true;
+        }
+        if (!emittedRelational) {
+            const history = session.thought_history;
+            if (history.length >= 2) {
+                const prev = history[history.length - 2];
+                if (prev.id) this._addEdgeIfValid(prev.id, thought.id, 'sequence', sessionId);
+            }
+        }
+    }
+    resolveThoughtId(session, thoughtNumber) {
+        for (const t of session.thought_history)if (t.thought_number === thoughtNumber && 'string' == typeof t.id && t.id.length > 0) return t.id;
+        for (const branchThoughts of Object.values(session.branches))for (const t of branchThoughts)if (t.thought_number === thoughtNumber && 'string' == typeof t.id && t.id.length > 0) return t.id;
+    }
+    _addEdgeIfValid(from, to, kind, sessionId, metadata) {
+        if (!from || !to) {
+            this._logger.debug('Skipping edge: unresolved endpoint', {
+                kind,
+                from: from ?? null,
+                to: to ?? null
+            });
+            return false;
+        }
+        const edge = {
+            id: generateUlid(),
+            from,
+            to,
+            kind,
+            sessionId,
+            createdAt: Date.now(),
+            ...void 0 !== metadata ? {
+                metadata
+            } : {}
+        };
+        try {
+            this._edgeStore.addEdge(edge);
+            return true;
+        } catch (err) {
+            this._logger.info('Failed to add DAG edge', {
+                kind,
+                error: getErrorMessage(err)
+            });
+            return false;
+        }
+    }
+}
+export { EdgeEmitter };
+
+//# sourceMappingURL=EdgeEmitter.js.map

package/dist/core/graph/EdgeEmitter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"core/graph/EdgeEmitter.js","sources":["../../../src/core/graph/EdgeEmitter.ts"],"sourcesContent":["/**\n * EdgeEmitter — emits DAG edges for thoughts based on their metadata.\n *\n * Stateless helper extracted from HistoryManager. Holds a reference to an\n * optional `IEdgeStore` and a feature flag (`dagEdges`) gating writes.\n *\n * @module EdgeEmitter\n */\n\nimport type { IEdgeStore } from '../../contracts/interfaces.js';\nimport { getErrorMessage } from '../../errors.js';\nimport type { Logger } from '../../logger/StructuredLogger.js';\nimport { NullLogger } from '../../logger/NullLogger.js';\nimport type { ThoughtData } from '../thought.js';\nimport type { Edge, EdgeKind } from './Edge.js';\nimport { generateUlid } from '../ids.js';\n\n/** Minimal session view needed for edge emission. */\nexport interface EdgeEmissionSession {\n\tthought_history: ThoughtData[];\n\tbranches: Record<string, ThoughtData[]>;\n}\n\n/** Configuration options for EdgeEmitter. */\nexport interface EdgeEmitterConfig {\n\tedgeStore?: IEdgeStore;\n\tdagEdges?: boolean;\n\tdefaultSessionId: string;\n\tlogger?: Logger;\n}\n\n/**\n * Emits DAG edges for thought relationships when an `IEdgeStore` is configured\n * and the `dagEdges` feature flag is enabled. No-ops otherwise.\n */\nexport class EdgeEmitter {\n\tprivate readonly _edgeStore?: IEdgeStore;\n\tprivate readonly _dagEdges: boolean;\n\tprivate readonly _defaultSessionId: string;\n\tprivate readonly _logger: Logger;\n\n\tconstructor(config: EdgeEmitterConfig) {\n\t\tthis._edgeStore = config.edgeStore;\n\t\tthis._dagEdges = config.dagEdges ?? true;\n\t\tthis._defaultSessionId = config.defaultSessionId;\n\t\tthis._logger = config.logger ?? new NullLogger();\n\t}\n\n\t/** Returns true when edge emission is active (store + flag both set). */\n\tpublic isEnabled(): boolean {\n\t\treturn this._edgeStore !== undefined && this._dagEdges;\n\t}\n\n\t/**\n\t * Emits DAG edges for a thought based on its metadata fields.\n\t *\n\t * Edge kinds (in priority order):\n\t * - branch: branch_from_thought + branch_id → parent.id → current.id\n\t * - merge: merge_from_thoughts → source.id → current.id (per source)\n\t * - verifies: verification_target + thought_type=verification → current.id → target.id\n\t * - critiques: verification_target + thought_type=critique → current.id → target.id\n\t * - derives_from: synthesis_sources → source.id → current.id (per source)\n\t * - revises: revises_thought → current.id → target.id\n\t * - tool_invocation: tool_observation with _resumedFrom → tool_call.id → current.id\n\t * - sequence: default chronological link from previous thought (if none of the above)\n\t */\n\tpublic emitEdgesForThought(session: EdgeEmissionSession, thought: ThoughtData): void {\n\t\tif (!this._edgeStore || !this._dagEdges) return;\n\t\tif (!thought.id) return;\n\n\t\tconst sessionId = thought.session_id ?? this._defaultSessionId;\n\t\tlet emittedRelational = false;\n\n\t\tif (thought.branch_from_thought !== undefined && thought.branch_id) {\n\t\t\tconst parentId = this.resolveThoughtId(session, thought.branch_from_thought);\n\t\t\tif (this._addEdgeIfValid(parentId, thought.id, 'branch', sessionId)) {\n\t\t\t\temittedRelational = true;\n\t\t\t}\n\t\t}\n\n\t\tif (thought.merge_from_thoughts?.length) {\n\t\t\tfor (const src of thought.merge_from_thoughts) {\n\t\t\t\tconst srcId = this.resolveThoughtId(session, src);\n\t\t\t\tif (this._addEdgeIfValid(srcId, thought.id, 'merge', sessionId)) {\n\t\t\t\t\temittedRelational = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (thought.verification_target !== undefined && thought.thought_type === 'verification') {\n\t\t\tconst targetId = this.resolveThoughtId(session, thought.verification_target);\n\t\t\tif (this._addEdgeIfValid(thought.id, targetId, 'verifies', sessionId)) {\n\t\t\t\temittedRelational = true;\n\t\t\t}\n\t\t}\n\n\t\tif (thought.verification_target !== undefined && thought.thought_type === 'critique') {\n\t\t\tconst targetId = this.resolveThoughtId(session, thought.verification_target);\n\t\t\tif (this._addEdgeIfValid(thought.id, targetId, 'critiques', sessionId)) {\n\t\t\t\temittedRelational = true;\n\t\t\t}\n\t\t}\n\n\t\tif (thought.synthesis_sources?.length) {\n\t\t\tfor (const src of thought.synthesis_sources) {\n\t\t\t\tconst srcId = this.resolveThoughtId(session, src);\n\t\t\t\tif (this._addEdgeIfValid(srcId, thought.id, 'derives_from', sessionId)) {\n\t\t\t\t\temittedRelational = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (thought.revises_thought !== undefined) {\n\t\t\tconst targetId = this.resolveThoughtId(session, thought.revises_thought);\n\t\t\tif (this._addEdgeIfValid(thought.id, targetId, 'revises', sessionId)) {\n\t\t\t\temittedRelational = true;\n\t\t\t}\n\t\t}\n\n\t\t// tool_invocation edge: tool_call → tool_observation\n\t\tif (thought.thought_type === 'tool_observation' && thought._resumedFrom !== undefined) {\n\t\t\tconst toolCallId = this.resolveThoughtId(session, thought._resumedFrom);\n\t\t\tconst meta: Record<string, unknown> = {};\n\t\t\tif (thought.tool_name !== undefined) meta.tool_name = thought.tool_name;\n\t\t\tif (\n\t\t\t\tthis._addEdgeIfValid(\n\t\t\t\t\ttoolCallId,\n\t\t\t\t\tthought.id,\n\t\t\t\t\t'tool_invocation',\n\t\t\t\t\tsessionId,\n\t\t\t\t\tObject.keys(meta).length > 0 ? meta : undefined\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\temittedRelational = true;\n\t\t\t}\n\t\t}\n\n\t\tif (!emittedRelational) {\n\t\t\t// Default: chronological sequence from previous thought (the one before current).\n\t\t\t// current was just pushed, so prev is at length - 2.\n\t\t\tconst history = session.thought_history;\n\t\t\tif (history.length >= 2) {\n\t\t\t\tconst prev = history[history.length - 2]!;\n\t\t\t\tif (prev.id) {\n\t\t\t\t\tthis._addEdgeIfValid(prev.id, thought.id, 'sequence', sessionId);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Resolves a thought_number to its stable id within the given session.\n\t * Searches main history first, then branches.\n\t *\n\t * @returns The thought's id if found and non-empty, undefined otherwise\n\t */\n\tpublic resolveThoughtId(\n\t\tsession: EdgeEmissionSession,\n\t\tthoughtNumber: number\n\t): string | undefined {\n\t\tfor (const t of session.thought_history) {\n\t\t\tif (t.thought_number === thoughtNumber && typeof t.id === 'string' && t.id.length > 0) {\n\t\t\t\treturn t.id;\n\t\t\t}\n\t\t}\n\t\tfor (const branchThoughts of Object.values(session.branches)) {\n\t\t\tfor (const t of branchThoughts) {\n\t\t\t\tif (t.thought_number === thoughtNumber && typeof t.id === 'string' && t.id.length > 0) {\n\t\t\t\t\treturn t.id;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn undefined;\n\t}\n\n\t/**\n\t * Adds an edge to the edge store if both endpoints are non-empty strings.\n\t * Returns true if added, false if skipped (missing endpoint).\n\t * Failures (e.g. self-edge) are caught and logged.\n\t */\n\tprivate _addEdgeIfValid(\n\t\tfrom: string | undefined,\n\t\tto: string | undefined,\n\t\tkind: EdgeKind,\n\t\tsessionId: string,\n\t\tmetadata?: Record<string, unknown>\n\t): boolean {\n\t\tif (!from || !to) {\n\t\t\tthis._logger.debug('Skipping edge: unresolved endpoint', {\n\t\t\t\tkind,\n\t\t\t\tfrom: from ?? null,\n\t\t\t\tto: to ?? null,\n\t\t\t});\n\t\t\treturn false;\n\t\t}\n\t\tconst edge: Edge = {\n\t\t\tid: generateUlid(),\n\t\t\tfrom,\n\t\t\tto,\n\t\t\tkind,\n\t\t\tsessionId,\n\t\t\tcreatedAt: Date.now(),\n\t\t\t...(metadata !== undefined ? { metadata } : {}),\n\t\t};\n\t\ttry {\n\t\t\tthis._edgeStore!.addEdge(edge);\n\t\t\treturn true;\n\t\t} catch (err) {\n\t\t\tthis._logger.info('Failed to add DAG edge', {\n\t\t\t\tkind,\n\t\t\t\terror: getErrorMessage(err),\n\t\t\t});\n\t\t\treturn false;\n\t\t}\n\t}\n}\n"],"names":["EdgeEmitter","config","NullLogger","undefined","session","thought","sessionId","emittedRelational","parentId","src","srcId","targetId","toolCallId","meta","Object","history","prev","thoughtNumber","t","branchThoughts","from","to","kind","metadata","edge","generateUlid","Date","err","getErrorMessage"],"mappings":";;;AAmCO,MAAMA;IACK,WAAwB;IACxB,UAAmB;IACnB,kBAA0B;IAC1B,QAAgB;IAEjC,YAAYC,MAAyB,CAAE;QACtC,IAAI,CAAC,UAAU,GAAGA,OAAO,SAAS;QAClC,IAAI,CAAC,SAAS,GAAGA,OAAO,QAAQ,IAAI;QACpC,IAAI,CAAC,iBAAiB,GAAGA,OAAO,gBAAgB;QAChD,IAAI,CAAC,OAAO,GAAGA,OAAO,MAAM,IAAI,IAAIC;IACrC;IAGO,YAAqB;QAC3B,OAAO,AAAoBC,WAApB,IAAI,CAAC,UAAU,IAAkB,IAAI,CAAC,SAAS;IACvD;IAeO,oBAAoBC,OAA4B,EAAEC,OAAoB,EAAQ;QACpF,IAAI,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;QACzC,IAAI,CAACA,QAAQ,EAAE,EAAE;QAEjB,MAAMC,YAAYD,QAAQ,UAAU,IAAI,IAAI,CAAC,iBAAiB;QAC9D,IAAIE,oBAAoB;QAExB,IAAIF,AAAgCF,WAAhCE,QAAQ,mBAAmB,IAAkBA,QAAQ,SAAS,EAAE;YACnE,MAAMG,WAAW,IAAI,CAAC,gBAAgB,CAACJ,SAASC,QAAQ,mBAAmB;YAC3E,IAAI,IAAI,CAAC,eAAe,CAACG,UAAUH,QAAQ,EAAE,EAAE,UAAUC,YACxDC,oBAAoB;QAEtB;QAEA,IAAIF,QAAQ,mBAAmB,EAAE,QAChC,KAAK,MAAMI,OAAOJ,QAAQ,mBAAmB,CAAE;YAC9C,MAAMK,QAAQ,IAAI,CAAC,gBAAgB,CAACN,SAASK;YAC7C,IAAI,IAAI,CAAC,eAAe,CAACC,OAAOL,QAAQ,EAAE,EAAE,SAASC,YACpDC,oBAAoB;QAEtB;QAGD,IAAIF,AAAgCF,WAAhCE,QAAQ,mBAAmB,IAAkBA,AAAyB,mBAAzBA,QAAQ,YAAY,EAAqB;YACzF,MAAMM,WAAW,IAAI,CAAC,gBAAgB,CAACP,SAASC,QAAQ,mBAAmB;YAC3E,IAAI,IAAI,CAAC,eAAe,CAACA,QAAQ,EAAE,EAAEM,UAAU,YAAYL,YAC1DC,oBAAoB;QAEtB;QAEA,IAAIF,AAAgCF,WAAhCE,QAAQ,mBAAmB,IAAkBA,AAAyB,eAAzBA,QAAQ,YAAY,EAAiB;YACrF,MAAMM,WAAW,IAAI,CAAC,gBAAgB,CAACP,SAASC,QAAQ,mBAAmB;YAC3E,IAAI,IAAI,CAAC,eAAe,CAACA,QAAQ,EAAE,EAAEM,UAAU,aAAaL,YAC3DC,oBAAoB;QAEtB;QAEA,IAAIF,QAAQ,iBAAiB,EAAE,QAC9B,KAAK,MAAMI,OAAOJ,QAAQ,iBAAiB,CAAE;YAC5C,MAAMK,QAAQ,IAAI,CAAC,gBAAgB,CAACN,SAASK;YAC7C,IAAI,IAAI,CAAC,eAAe,CAACC,OAAOL,QAAQ,EAAE,EAAE,gBAAgBC,YAC3DC,oBAAoB;QAEtB;QAGD,IAAIF,AAA4BF,WAA5BE,QAAQ,eAAe,EAAgB;YAC1C,MAAMM,WAAW,IAAI,CAAC,gBAAgB,CAACP,SAASC,QAAQ,eAAe;YACvE,IAAI,IAAI,CAAC,eAAe,CAACA,QAAQ,EAAE,EAAEM,UAAU,WAAWL,YACzDC,oBAAoB;QAEtB;QAGA,IAAIF,AAAyB,uBAAzBA,QAAQ,YAAY,IAA2BA,AAAyBF,WAAzBE,QAAQ,YAAY,EAAgB;YACtF,MAAMO,aAAa,IAAI,CAAC,gBAAgB,CAACR,SAASC,QAAQ,YAAY;YACtE,MAAMQ,OAAgC,CAAC;YACvC,IAAIR,AAAsBF,WAAtBE,QAAQ,SAAS,EAAgBQ,KAAK,SAAS,GAAGR,QAAQ,SAAS;YACvE,IACC,IAAI,CAAC,eAAe,CACnBO,YACAP,QAAQ,EAAE,EACV,mBACAC,WACAQ,OAAO,IAAI,CAACD,MAAM,MAAM,GAAG,IAAIA,OAAOV,SAGvCI,oBAAoB;QAEtB;QAEA,IAAI,CAACA,mBAAmB;YAGvB,MAAMQ,UAAUX,QAAQ,eAAe;YACvC,IAAIW,QAAQ,MAAM,IAAI,GAAG;gBACxB,MAAMC,OAAOD,OAAO,CAACA,QAAQ,MAAM,GAAG,EAAE;gBACxC,IAAIC,KAAK,EAAE,EACV,IAAI,CAAC,eAAe,CAACA,KAAK,EAAE,EAAEX,QAAQ,EAAE,EAAE,YAAYC;YAExD;QACD;IACD;IAQO,iBACNF,OAA4B,EAC5Ba,aAAqB,EACA;QACrB,KAAK,MAAMC,KAAKd,QAAQ,eAAe,CACtC,IAAIc,EAAE,cAAc,KAAKD,iBAAiB,AAAgB,YAAhB,OAAOC,EAAE,EAAE,IAAiBA,EAAE,EAAE,CAAC,MAAM,GAAG,GACnF,OAAOA,EAAE,EAAE;QAGb,KAAK,MAAMC,kBAAkBL,OAAO,MAAM,CAACV,QAAQ,QAAQ,EAC1D,KAAK,MAAMc,KAAKC,eACf,IAAID,EAAE,cAAc,KAAKD,iBAAiB,AAAgB,YAAhB,OAAOC,EAAE,EAAE,IAAiBA,EAAE,EAAE,CAAC,MAAM,GAAG,GACnF,OAAOA,EAAE,EAAE;IAKf;IAOQ,gBACPE,IAAwB,EACxBC,EAAsB,EACtBC,IAAc,EACdhB,SAAiB,EACjBiB,QAAkC,EACxB;QACV,IAAI,CAACH,QAAQ,CAACC,IAAI;YACjB,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,sCAAsC;gBACxDC;gBACA,MAAMF,QAAQ;gBACd,IAAIC,MAAM;YACX;YACA,OAAO;QACR;QACA,MAAMG,OAAa;YAClB,IAAIC;YACJL;YACAC;YACAC;YACAhB;YACA,WAAWoB,KAAK,GAAG;YACnB,GAAIH,AAAapB,WAAboB,WAAyB;gBAAEA;YAAS,IAAI,CAAC,CAAC;QAC/C;QACA,IAAI;YACH,IAAI,CAAC,UAAU,CAAE,OAAO,CAACC;YACzB,OAAO;QACR,EAAE,OAAOG,KAAK;YACb,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,0BAA0B;gBAC3CL;gBACA,OAAOM,gBAAgBD;YACxB;YACA,OAAO;QACR;IACD;AACD"}

package/dist/core/reasoning.d.ts

@@ -109,8 +109,23 @@ export interface ConfidenceSignals {
         verification_coverage: number;
         /** max(chain_depth, branch_count + 1) / total_thoughts, clamped to [0, 1]. Branching is desirable. */
         depth_efficiency: number;
-        /** 1 - stddev(confidence values). Defaults to 0.5 if no confidence values. */
-        confidence_stability: number;
+        /** 1 - stddev(confidence values). Defaults to 0.5 if no confidence values. Null when fewer than 2 confidence values. */
+        confidence_stability: number | null;
+    };
+    /**
+     * Raw (unfloored) quality components before the 0.01 floor is applied.
+     * Only present when quality_components is present.
+     * Useful for debugging quality score calculations.
+     */
+    quality_components_raw?: {
+        /** Shannon entropy / log2(6) — may be below 0.01 floor. */
+        type_diversity: number;
+        /** verified / total hypotheses — may be below 0.01 floor. */
+        verification_coverage: number;
+        /** depth / total — may be below 0.01 floor. */
+        depth_efficiency: number;
+        /** 1 - stddev — may be below 0.01 floor. Null when fewer than 2 confidence values. */
+        confidence_stability: number | null;
     };
     /** Calibrated confidence score (post temperature scaling + prior shrinkage). Only present when features.calibration=true. */
     readonly calibrated_confidence?: number;

package/dist/core/reasoning.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"reasoning.d.ts","sourceRoot":"","sources":["../../src/core/reasoning.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAErE;;;;;;;;;;;;GAYG;AACH,MAAM,MAAM,WAAW,GACpB,SAAS,GACT,YAAY,GACZ,cAAc,GACd,UAAU,GACV,WAAW,GACX,MAAM,GACN,WAAW,GACX,kBAAkB,GAClB,YAAY,GACZ,eAAe,GACf,WAAW,CAAC;AAEf;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,aAAa;IAC7B,2CAA2C;IAC3C,OAAO,EAAE,MAAM,CAAC;IAEhB,uEAAuE;IACvE,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAE7B,0DAA0D;IAC1D,OAAO,EAAE,MAAM,CAAC;IAEhB,wEAAwE;IACxE,aAAa,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAChC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,WAAW,iBAAiB;IACjC,6CAA6C;IAC7C,eAAe,EAAE,MAAM,CAAC;IAExB,wCAAwC;IACxC,cAAc,EAAE,MAAM,CAAC;IAEvB,uBAAuB;IACvB,YAAY,EAAE,MAAM,CAAC;IAErB,0CAA0C;IAC1C,yBAAyB,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAEvD,8CAA8C;IAC9C,cAAc,EAAE,OAAO,CAAC;IAExB,uCAAuC;IACvC,gBAAgB,EAAE,OAAO,CAAC;IAE1B,wDAAwD;IACxD,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;IAElC;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAE5B;;;OAGG;IACH,kBAAkB,CAAC,EAAE;QACpB,8EAA8E;QAC9E,cAAc,EAAE,MAAM,CAAC;QACvB,0EAA0E;QAC1E,qBAAqB,EAAE,MAAM,CAAC;QAC9B,sGAAsG;QACtG,gBAAgB,EAAE,MAAM,CAAC;QACzB,8EAA8E;QAC9E,oBAAoB,EAAE,MAAM,CAAC;KAC7B,CAAC;IAEF,6HAA6H;IAC7H,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAExC,gGAAgG;IAChG,QAAQ,CAAC,mBAAmB,CAAC,EAAE,kBAAkB,CAAC;CAClD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,WAAW,cAAc;IAC9B,iCAAiC;IACjC,cAAc,EAAE,MAAM,CAAC;IAEvB,8BAA8B;IAC9B,cAAc,EAAE,MAAM,CAAC;IAEvB,iCAAiC;IACjC,eAAe,EAAE,MAAM,CAAC;IAExB,6CAA6C;IAC7C,YAAY,EAAE,MAAM,CAAC;IAErB,sCAAsC;IACtC,WAAW,EAAE,MAAM,CAAC;IAEpB,kCAAkC;IAClC,mBAAmB,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAEjD,0BAA0B;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IAEzB,0CAA0C;IAC1C,yBAAyB,EAAE,MAAM,CAAC;IAElC,uCAAuC;IACvC,2BAA2B,EAAE,MAAM,CAAC;IAEpC,uEAAuE;IACvE,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAC;IAErC,wEAAwE;IACxE,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;CAClC"}
+{"version":3,"file":"reasoning.d.ts","sourceRoot":"","sources":["../../src/core/reasoning.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,4BAA4B,CAAC;AAErE;;;;;;;;;;;;GAYG;AACH,MAAM,MAAM,WAAW,GACpB,SAAS,GACT,YAAY,GACZ,cAAc,GACd,UAAU,GACV,WAAW,GACX,MAAM,GACN,WAAW,GACX,kBAAkB,GAClB,YAAY,GACZ,eAAe,GACf,WAAW,CAAC;AAEf;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,aAAa;IAC7B,2CAA2C;IAC3C,OAAO,EAAE,MAAM,CAAC;IAEhB,uEAAuE;IACvE,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAE7B,0DAA0D;IAC1D,OAAO,EAAE,MAAM,CAAC;IAEhB,wEAAwE;IACxE,aAAa,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAChC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,WAAW,iBAAiB;IACjC,6CAA6C;IAC7C,eAAe,EAAE,MAAM,CAAC;IAExB,wCAAwC;IACxC,cAAc,EAAE,MAAM,CAAC;IAEvB,uBAAuB;IACvB,YAAY,EAAE,MAAM,CAAC;IAErB,0CAA0C;IAC1C,yBAAyB,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAEvD,8CAA8C;IAC9C,cAAc,EAAE,OAAO,CAAC;IAExB,uCAAuC;IACvC,gBAAgB,EAAE,OAAO,CAAC;IAE1B,wDAAwD;IACxD,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;IAElC;;;;OAIG;IACH,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAE5B;;;OAGG;IACH,kBAAkB,CAAC,EAAE;QACpB,8EAA8E;QAC9E,cAAc,EAAE,MAAM,CAAC;QACvB,0EAA0E;QAC1E,qBAAqB,EAAE,MAAM,CAAC;QAC9B,sGAAsG;QACtG,gBAAgB,EAAE,MAAM,CAAC;QACzB,wHAAwH;QACxH,oBAAoB,EAAE,MAAM,GAAG,IAAI,CAAC;KACpC,CAAC;IAEF;;;;OAIG;IACH,sBAAsB,CAAC,EAAE;QACxB,2DAA2D;QAC3D,cAAc,EAAE,MAAM,CAAC;QACvB,6DAA6D;QAC7D,qBAAqB,EAAE,MAAM,CAAC;QAC9B,+CAA+C;QAC/C,gBAAgB,EAAE,MAAM,CAAC;QACzB,sFAAsF;QACtF,oBAAoB,EAAE,MAAM,GAAG,IAAI,CAAC;KACpC,CAAC;IAEF,6HAA6H;IAC7H,QAAQ,CAAC,qBAAqB,CAAC,EAAE,MAAM,CAAC;IAExC,gGAAgG;IAChG,QAAQ,CAAC,mBAAmB,CAAC,EAAE,kBAAkB,CAAC;CAClD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,WAAW,cAAc;IAC9B,iCAAiC;IACjC,cAAc,EAAE,MAAM,CAAC;IAEvB,8BAA8B;IAC9B,cAAc,EAAE,MAAM,CAAC;IAEvB,iCAAiC;IACjC,eAAe,EAAE,MAAM,CAAC;IAExB,6CAA6C;IAC7C,YAAY,EAAE,MAAM,CAAC;IAErB,sCAAsC;IACtC,WAAW,EAAE,MAAM,CAAC;IAEpB,kCAAkC;IAClC,mBAAmB,EAAE,MAAM,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IAEjD,0BAA0B;IAC1B,gBAAgB,EAAE,MAAM,CAAC;IAEzB,0CAA0C;IAC1C,yBAAyB,EAAE,MAAM,CAAC;IAElC,uCAAuC;IACvC,2BAA2B,EAAE,MAAM,CAAC;IAEpC,uEAAuE;IACvE,qBAAqB,EAAE,MAAM,GAAG,IAAI,CAAC;IAErC,wEAAwE;IACxE,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;CAClC"}

package/dist/core/thought.d.ts

@@ -209,6 +209,13 @@ export interface ThoughtData {
     decomposition_children?: string[];
     /** Thought number being backtracked from */
     backtrack_target?: number;
+    /**
+     * When true, this thought has been logically retracted by a subsequent
+     * `backtrack` thought. The thought remains in history (append-only,
+     * event-sourcing) but is excluded from quality calculations.
+     * Default: false.
+     */
+    retracted?: boolean;
     /**
      * Internal: thought_number of the tool_call this tool_observation resumes from.
      * Set transiently by ThoughtProcessor; not part of the public API.

package/dist/core/thought.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"thought.d.ts","sourceRoot":"","sources":["../../src/core/thought.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAEpD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAM,WAAW,WAAW;IAC3B,4DAA4D;IAC5D,mBAAmB,CAAC,EAAE,MAAM,EAAE,CAAC;IAE/B,yDAAyD;IACzD,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAE5B,sDAAsD;IACtD,OAAO,EAAE,MAAM,CAAC;IAEhB;;;;;;;;;OASG;IACH,EAAE,CAAC,EAAE,MAAM,CAAC;IAEZ,0DAA0D;IAC1D,cAAc,EAAE,MAAM,CAAC;IAEvB,8EAA8E;IAC9E,cAAc,EAAE,MAAM,CAAC;IAEvB,uDAAuD;IACvD,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB,qDAAqD;IACrD,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB,uDAAuD;IACvD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAE7B,gEAAgE;IAChE,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,4EAA4E;IAC5E,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAE9B,oEAAoE;IACpE,mBAAmB,EAAE,OAAO,CAAC;IAE7B,wDAAwD;IACxD,YAAY,CAAC,EAAE,kBAAkB,CAAC;IAElC,qEAAqE;IACrE,cAAc,CAAC,EAAE,kBAAkB,EAAE,CAAC;IAEtC,uEAAuE;IACvE,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAE3B;;;;;;;;;OASG;IACH,YAAY,CAAC,EAAE,WAAW,CAAC;IAE3B;;;;;;;;OAQG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB;;;;;;;;OAQG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;;;;OAQG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB;;;;;;;OAOG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAE7B;;;;;;;OAOG;IACH,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC;IAE7B;;;;;;;OAOG;IACH,mBAAmB,CAAC,EAAE,MAAM,EAAE,CAAC;IAE/B;;;;;;;OAOG;IACH,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAE5B;;;;;;;OAOG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAE1B;;;;;;;;OAQG;IACH,eAAe,CAAC,EAAE,SAAS,GAAG,UAAU,GAAG,MAAM,CAAC;IAElD;;;;;;;;;OASG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB,uCAAuC;IACvC,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,wCAAwC;IACxC,cAAc,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAEzC,yDAAyD;IACzD,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB,8EAA8E;IAC9E,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAE5B,oDAAoD;IACpD,sBAAsB,CAAC,EAAE,MAAM,EAAE,CAAC;IAElC,4CAA4C;IAC5C,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAE1B;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;CACtB"}
+{"version":3,"file":"thought.d.ts","sourceRoot":"","sources":["../../src/core/thought.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAClD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAEpD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAM,WAAW,WAAW;IAC3B,4DAA4D;IAC5D,mBAAmB,CAAC,EAAE,MAAM,EAAE,CAAC;IAE/B,yDAAyD;IACzD,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAE5B,sDAAsD;IACtD,OAAO,EAAE,MAAM,CAAC;IAEhB;;;;;;;;;OASG;IACH,EAAE,CAAC,EAAE,MAAM,CAAC;IAEZ,0DAA0D;IAC1D,cAAc,EAAE,MAAM,CAAC;IAEvB,8EAA8E;IAC9E,cAAc,EAAE,MAAM,CAAC;IAEvB,uDAAuD;IACvD,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB,qDAAqD;IACrD,eAAe,CAAC,EAAE,MAAM,CAAC;IAEzB,uDAAuD;IACvD,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAE7B,gEAAgE;IAChE,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,4EAA4E;IAC5E,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAE9B,oEAAoE;IACpE,mBAAmB,EAAE,OAAO,CAAC;IAE7B,wDAAwD;IACxD,YAAY,CAAC,EAAE,kBAAkB,CAAC;IAElC,qEAAqE;IACrE,cAAc,CAAC,EAAE,kBAAkB,EAAE,CAAC;IAEtC,uEAAuE;IACvE,eAAe,CAAC,EAAE,MAAM,EAAE,CAAC;IAE3B;;;;;;;;;OASG;IACH,YAAY,CAAC,EAAE,WAAW,CAAC;IAE3B;;;;;;;;OAQG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB;;;;;;;;OAQG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;;;;OAQG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IAEvB;;;;;;;OAOG;IACH,mBAAmB,CAAC,EAAE,MAAM,CAAC;IAE7B;;;;;;;OAOG;IACH,iBAAiB,CAAC,EAAE,MAAM,EAAE,CAAC;IAE7B;;;;;;;OAOG;IACH,mBAAmB,CAAC,EAAE,MAAM,EAAE,CAAC;IAE/B;;;;;;;OAOG;IACH,gBAAgB,CAAC,EAAE,MAAM,EAAE,CAAC;IAE5B;;;;;;;OAOG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAE1B;;;;;;;;OAQG;IACH,eAAe,CAAC,EAAE,SAAS,GAAG,UAAU,GAAG,MAAM,CAAC;IAElD;;;;;;;;;OASG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IAEpB;;;;;;;;OAQG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB,uCAAuC;IACvC,SAAS,CAAC,EAAE,MAAM,CAAC;IAEnB,wCAAwC;IACxC,cAAc,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAEzC,yDAAyD;IACzD,WAAW,CAAC,EAAE,OAAO,CAAC;IAEtB,8EAA8E;IAC9E,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAE5B,oDAAoD;IACpD,sBAAsB,CAAC,EAAE,MAAM,EAAE,CAAC;IAElC,4CAA4C;IAC5C,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAE1B;;;;;OAKG;IACH,SAAS,CAAC,EAAE,OAAO,CAAC;IAEpB;;;;OAIG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;CACtB"}

package/dist/core/tools/InMemorySuspensionStore.js

@@ -1,5 +1,5 @@
 import { generateUlid } from "../ids.js";
-const DEFAULT_TTL_MS = 60000;
+const DEFAULT_TTL_MS = 300000;
 const DEFAULT_SWEEP_INTERVAL_MS = 60000;
 class InMemorySuspensionStore {
     _byToken = new Map();

package/dist/core/tools/InMemorySuspensionStore.js.map

@@ -1 +1 @@
-{"version":3,"file":"core/tools/InMemorySuspensionStore.js","sources":["../../../src/core/tools/InMemorySuspensionStore.ts"],"sourcesContent":["/**\n * In-memory implementation of {@link ISuspensionStore}.\n *\n * Stores suspension records in process memory with optional background\n * sweeping of expired entries. Suitable for single-process deployments;\n * cluster setups should provide a shared backend.\n *\n * @module core/tools/InMemorySuspensionStore\n */\n\nimport type { ISuspensionStore, SuspensionRecord } from '../../contracts/suspension.js';\nimport { generateUlid } from '../ids.js';\n\n/**\n * Configuration for {@link InMemorySuspensionStore}.\n */\nexport interface InMemorySuspensionStoreConfig {\n\t/** Default TTL applied to records that omit `ttlMs`. Defaults to 60_000ms. */\n\tttlMs?: number;\n\t/** Sweep interval for the background expiry timer. Defaults to 60_000ms. */\n\tsweepIntervalMs?: number;\n\t/** Optional logger; reserved for future diagnostic output. */\n\tlogger?: unknown;\n}\n\nconst DEFAULT_TTL_MS = 60_000;\nconst DEFAULT_SWEEP_INTERVAL_MS = 60_000;\n\n/**\n * In-memory suspension store with TTL expiry and background sweep.\n *\n * @example\n * ```typescript\n * const store = new InMemorySuspensionStore({ ttlMs: 30_000 });\n * store.start();\n * const rec = store.suspend({\n *   sessionId: 's1',\n *   toolCallThoughtNumber: 3,\n *   toolName: 'search',\n *   toolArguments: { q: 'foo' },\n *   expiresAt: 0,\n * });\n * const resumed = store.resume(rec.token);\n * store.stop();\n * ```\n */\nexport class InMemorySuspensionStore implements ISuspensionStore {\n\tprivate readonly _byToken: Map<string, SuspensionRecord> = new Map();\n\tprivate readonly _bySession: Map<string, Set<string>> = new Map();\n\tprivate readonly _ttlMs: number;\n\tprivate readonly _sweepIntervalMs: number;\n\tprivate _timer: ReturnType<typeof setInterval> | null = null;\n\n\tconstructor(config: InMemorySuspensionStoreConfig = {}) {\n\t\tthis._ttlMs = config.ttlMs ?? DEFAULT_TTL_MS;\n\t\tthis._sweepIntervalMs = config.sweepIntervalMs ?? DEFAULT_SWEEP_INTERVAL_MS;\n\t}\n\n\tsuspend(\n\t\trecord: Omit<SuspensionRecord, 'token' | 'createdAt'> & { ttlMs?: number },\n\t): SuspensionRecord {\n\t\tconst token = generateUlid();\n\t\tconst createdAt = Date.now();\n\t\tconst ttlMs = record.ttlMs ?? this._ttlMs;\n\t\tconst expiresAt = createdAt + ttlMs;\n\n\t\tconst full: SuspensionRecord = {\n\t\t\ttoken,\n\t\t\tsessionId: record.sessionId,\n\t\t\ttoolCallThoughtNumber: record.toolCallThoughtNumber,\n\t\t\ttoolName: record.toolName,\n\t\t\ttoolArguments: record.toolArguments,\n\t\t\tcreatedAt,\n\t\t\texpiresAt,\n\t\t};\n\n\t\tthis._byToken.set(token, full);\n\t\tlet bucket = this._bySession.get(full.sessionId);\n\t\tif (!bucket) {\n\t\t\tbucket = new Set();\n\t\t\tthis._bySession.set(full.sessionId, bucket);\n\t\t}\n\t\tbucket.add(token);\n\n\t\treturn full;\n\t}\n\n\tresume(token: string): SuspensionRecord | null {\n\t\tconst rec = this._byToken.get(token);\n\t\tif (!rec) return null;\n\t\tif (rec.expiresAt <= Date.now()) {\n\t\t\tthis._delete(token, rec.sessionId);\n\t\t\treturn null;\n\t\t}\n\t\tthis._delete(token, rec.sessionId);\n\t\treturn rec;\n\t}\n\n\tpeek(token: string): SuspensionRecord | null {\n\t\treturn this._byToken.get(token) ?? null;\n\t}\n\n\texpireOlderThan(now: number): number {\n\t\tlet removed = 0;\n\t\tfor (const [token, rec] of this._byToken) {\n\t\t\tif (rec.expiresAt <= now) {\n\t\t\t\tthis._delete(token, rec.sessionId);\n\t\t\t\tremoved++;\n\t\t\t}\n\t\t}\n\t\treturn removed;\n\t}\n\n\tclearSession(sessionId: string): void {\n\t\tconst bucket = this._bySession.get(sessionId);\n\t\tif (!bucket) return;\n\t\tfor (const token of bucket) {\n\t\t\tthis._byToken.delete(token);\n\t\t}\n\t\tthis._bySession.delete(sessionId);\n\t}\n\n\tsize(sessionId?: string): number {\n\t\tif (sessionId === undefined) return this._byToken.size;\n\t\treturn this._bySession.get(sessionId)?.size ?? 0;\n\t}\n\n\tstart(): void {\n\t\tif (this._timer !== null) return;\n\t\tthis._timer = setInterval(() => {\n\t\t\tthis.expireOlderThan(Date.now());\n\t\t}, this._sweepIntervalMs);\n\t\tthis._timer.unref?.();\n\t}\n\n\tstop(): void {\n\t\tif (this._timer === null) return;\n\t\tclearInterval(this._timer);\n\t\tthis._timer = null;\n\t}\n\n\tprivate _delete(token: string, sessionId: string): void {\n\t\tthis._byToken.delete(token);\n\t\tconst bucket = this._bySession.get(sessionId);\n\t\tif (bucket) {\n\t\t\tbucket.delete(token);\n\t\t\tif (bucket.size === 0) this._bySession.delete(sessionId);\n\t\t}\n\t}\n}\n"],"names":["DEFAULT_TTL_MS","DEFAULT_SWEEP_INTERVAL_MS","InMemorySuspensionStore","Map","config","record","token","generateUlid","createdAt","Date","ttlMs","expiresAt","full","bucket","Set","rec","now","removed","sessionId","undefined","setInterval","clearInterval"],"mappings":";AAyBA,MAAMA,iBAAiB;AACvB,MAAMC,4BAA4B;AAoB3B,MAAMC;IACK,WAA0C,IAAIC,MAAM;IACpD,aAAuC,IAAIA,MAAM;IACjD,OAAe;IACf,iBAAyB;IAClC,SAAgD,KAAK;IAE7D,YAAYC,SAAwC,CAAC,CAAC,CAAE;QACvD,IAAI,CAAC,MAAM,GAAGA,OAAO,KAAK,IAAIJ;QAC9B,IAAI,CAAC,gBAAgB,GAAGI,OAAO,eAAe,IAAIH;IACnD;IAEA,QACCI,MAA0E,EACvD;QACnB,MAAMC,QAAQC;QACd,MAAMC,YAAYC,KAAK,GAAG;QAC1B,MAAMC,QAAQL,OAAO,KAAK,IAAI,IAAI,CAAC,MAAM;QACzC,MAAMM,YAAYH,YAAYE;QAE9B,MAAME,OAAyB;YAC9BN;YACA,WAAWD,OAAO,SAAS;YAC3B,uBAAuBA,OAAO,qBAAqB;YACnD,UAAUA,OAAO,QAAQ;YACzB,eAAeA,OAAO,aAAa;YACnCG;YACAG;QACD;QAEA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAACL,OAAOM;QACzB,IAAIC,SAAS,IAAI,CAAC,UAAU,CAAC,GAAG,CAACD,KAAK,SAAS;QAC/C,IAAI,CAACC,QAAQ;YACZA,SAAS,IAAIC;YACb,IAAI,CAAC,UAAU,CAAC,GAAG,CAACF,KAAK,SAAS,EAAEC;QACrC;QACAA,OAAO,GAAG,CAACP;QAEX,OAAOM;IACR;IAEA,OAAON,KAAa,EAA2B;QAC9C,MAAMS,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAACT;QAC9B,IAAI,CAACS,KAAK,OAAO;QACjB,IAAIA,IAAI,SAAS,IAAIN,KAAK,GAAG,IAAI;YAChC,IAAI,CAAC,OAAO,CAACH,OAAOS,IAAI,SAAS;YACjC,OAAO;QACR;QACA,IAAI,CAAC,OAAO,CAACT,OAAOS,IAAI,SAAS;QACjC,OAAOA;IACR;IAEA,KAAKT,KAAa,EAA2B;QAC5C,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAACA,UAAU;IACpC;IAEA,gBAAgBU,GAAW,EAAU;QACpC,IAAIC,UAAU;QACd,KAAK,MAAM,CAACX,OAAOS,IAAI,IAAI,IAAI,CAAC,QAAQ,CACvC,IAAIA,IAAI,SAAS,IAAIC,KAAK;YACzB,IAAI,CAAC,OAAO,CAACV,OAAOS,IAAI,SAAS;YACjCE;QACD;QAED,OAAOA;IACR;IAEA,aAAaC,SAAiB,EAAQ;QACrC,MAAML,SAAS,IAAI,CAAC,UAAU,CAAC,GAAG,CAACK;QACnC,IAAI,CAACL,QAAQ;QACb,KAAK,MAAMP,SAASO,OACnB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAACP;QAEtB,IAAI,CAAC,UAAU,CAAC,MAAM,CAACY;IACxB;IAEA,KAAKA,SAAkB,EAAU;QAChC,IAAIA,AAAcC,WAAdD,WAAyB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI;QACtD,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAACA,YAAY,QAAQ;IAChD;IAEA,QAAc;QACb,IAAI,AAAgB,SAAhB,IAAI,CAAC,MAAM,EAAW;QAC1B,IAAI,CAAC,MAAM,GAAGE,YAAY;YACzB,IAAI,CAAC,eAAe,CAACX,KAAK,GAAG;QAC9B,GAAG,IAAI,CAAC,gBAAgB;QACxB,IAAI,CAAC,MAAM,CAAC,KAAK;IAClB;IAEA,OAAa;QACZ,IAAI,AAAgB,SAAhB,IAAI,CAAC,MAAM,EAAW;QAC1BY,cAAc,IAAI,CAAC,MAAM;QACzB,IAAI,CAAC,MAAM,GAAG;IACf;IAEQ,QAAQf,KAAa,EAAEY,SAAiB,EAAQ;QACvD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAACZ;QACrB,MAAMO,SAAS,IAAI,CAAC,UAAU,CAAC,GAAG,CAACK;QACnC,IAAIL,QAAQ;YACXA,OAAO,MAAM,CAACP;YACd,IAAIO,AAAgB,MAAhBA,OAAO,IAAI,EAAQ,IAAI,CAAC,UAAU,CAAC,MAAM,CAACK;QAC/C;IACD;AACD"}
+{"version":3,"file":"core/tools/InMemorySuspensionStore.js","sources":["../../../src/core/tools/InMemorySuspensionStore.ts"],"sourcesContent":["/**\n * In-memory implementation of {@link ISuspensionStore}.\n *\n * Stores suspension records in process memory with optional background\n * sweeping of expired entries. Suitable for single-process deployments;\n * cluster setups should provide a shared backend.\n *\n * @module core/tools/InMemorySuspensionStore\n */\n\nimport type { ISuspensionStore, SuspensionRecord } from '../../contracts/suspension.js';\nimport { generateUlid } from '../ids.js';\n\n/**\n * Configuration for {@link InMemorySuspensionStore}.\n */\nexport interface InMemorySuspensionStoreConfig {\n\t/** Default TTL applied to records that omit `ttlMs`. Defaults to 60_000ms. */\n\tttlMs?: number;\n\t/** Sweep interval for the background expiry timer. Defaults to 60_000ms. */\n\tsweepIntervalMs?: number;\n\t/** Optional logger; reserved for future diagnostic output. */\n\tlogger?: unknown;\n}\n\nconst DEFAULT_TTL_MS = 300_000;\nconst DEFAULT_SWEEP_INTERVAL_MS = 60_000;\n\n/**\n * In-memory suspension store with TTL expiry and background sweep.\n *\n * @example\n * ```typescript\n * const store = new InMemorySuspensionStore({ ttlMs: 30_000 });\n * store.start();\n * const rec = store.suspend({\n *   sessionId: 's1',\n *   toolCallThoughtNumber: 3,\n *   toolName: 'search',\n *   toolArguments: { q: 'foo' },\n *   expiresAt: 0,\n * });\n * const resumed = store.resume(rec.token);\n * store.stop();\n * ```\n */\nexport class InMemorySuspensionStore implements ISuspensionStore {\n\tprivate readonly _byToken: Map<string, SuspensionRecord> = new Map();\n\tprivate readonly _bySession: Map<string, Set<string>> = new Map();\n\tprivate readonly _ttlMs: number;\n\tprivate readonly _sweepIntervalMs: number;\n\tprivate _timer: ReturnType<typeof setInterval> | null = null;\n\n\tconstructor(config: InMemorySuspensionStoreConfig = {}) {\n\t\tthis._ttlMs = config.ttlMs ?? DEFAULT_TTL_MS;\n\t\tthis._sweepIntervalMs = config.sweepIntervalMs ?? DEFAULT_SWEEP_INTERVAL_MS;\n\t}\n\n\tsuspend(\n\t\trecord: Omit<SuspensionRecord, 'token' | 'createdAt'> & { ttlMs?: number },\n\t): SuspensionRecord {\n\t\tconst token = generateUlid();\n\t\tconst createdAt = Date.now();\n\t\tconst ttlMs = record.ttlMs ?? this._ttlMs;\n\t\tconst expiresAt = createdAt + ttlMs;\n\n\t\tconst full: SuspensionRecord = {\n\t\t\ttoken,\n\t\t\tsessionId: record.sessionId,\n\t\t\ttoolCallThoughtNumber: record.toolCallThoughtNumber,\n\t\t\ttoolName: record.toolName,\n\t\t\ttoolArguments: record.toolArguments,\n\t\t\tcreatedAt,\n\t\t\texpiresAt,\n\t\t};\n\n\t\tthis._byToken.set(token, full);\n\t\tlet bucket = this._bySession.get(full.sessionId);\n\t\tif (!bucket) {\n\t\t\tbucket = new Set();\n\t\t\tthis._bySession.set(full.sessionId, bucket);\n\t\t}\n\t\tbucket.add(token);\n\n\t\treturn full;\n\t}\n\n\tresume(token: string): SuspensionRecord | null {\n\t\tconst rec = this._byToken.get(token);\n\t\tif (!rec) return null;\n\t\tif (rec.expiresAt <= Date.now()) {\n\t\t\tthis._delete(token, rec.sessionId);\n\t\t\treturn null;\n\t\t}\n\t\tthis._delete(token, rec.sessionId);\n\t\treturn rec;\n\t}\n\n\tpeek(token: string): SuspensionRecord | null {\n\t\treturn this._byToken.get(token) ?? null;\n\t}\n\n\texpireOlderThan(now: number): number {\n\t\tlet removed = 0;\n\t\tfor (const [token, rec] of this._byToken) {\n\t\t\tif (rec.expiresAt <= now) {\n\t\t\t\tthis._delete(token, rec.sessionId);\n\t\t\t\tremoved++;\n\t\t\t}\n\t\t}\n\t\treturn removed;\n\t}\n\n\tclearSession(sessionId: string): void {\n\t\tconst bucket = this._bySession.get(sessionId);\n\t\tif (!bucket) return;\n\t\tfor (const token of bucket) {\n\t\t\tthis._byToken.delete(token);\n\t\t}\n\t\tthis._bySession.delete(sessionId);\n\t}\n\n\tsize(sessionId?: string): number {\n\t\tif (sessionId === undefined) return this._byToken.size;\n\t\treturn this._bySession.get(sessionId)?.size ?? 0;\n\t}\n\n\tstart(): void {\n\t\tif (this._timer !== null) return;\n\t\tthis._timer = setInterval(() => {\n\t\t\tthis.expireOlderThan(Date.now());\n\t\t}, this._sweepIntervalMs);\n\t\tthis._timer.unref?.();\n\t}\n\n\tstop(): void {\n\t\tif (this._timer === null) return;\n\t\tclearInterval(this._timer);\n\t\tthis._timer = null;\n\t}\n\n\tprivate _delete(token: string, sessionId: string): void {\n\t\tthis._byToken.delete(token);\n\t\tconst bucket = this._bySession.get(sessionId);\n\t\tif (bucket) {\n\t\t\tbucket.delete(token);\n\t\t\tif (bucket.size === 0) this._bySession.delete(sessionId);\n\t\t}\n\t}\n}\n"],"names":["DEFAULT_TTL_MS","DEFAULT_SWEEP_INTERVAL_MS","InMemorySuspensionStore","Map","config","record","token","generateUlid","createdAt","Date","ttlMs","expiresAt","full","bucket","Set","rec","now","removed","sessionId","undefined","setInterval","clearInterval"],"mappings":";AAyBA,MAAMA,iBAAiB;AACvB,MAAMC,4BAA4B;AAoB3B,MAAMC;IACK,WAA0C,IAAIC,MAAM;IACpD,aAAuC,IAAIA,MAAM;IACjD,OAAe;IACf,iBAAyB;IAClC,SAAgD,KAAK;IAE7D,YAAYC,SAAwC,CAAC,CAAC,CAAE;QACvD,IAAI,CAAC,MAAM,GAAGA,OAAO,KAAK,IAAIJ;QAC9B,IAAI,CAAC,gBAAgB,GAAGI,OAAO,eAAe,IAAIH;IACnD;IAEA,QACCI,MAA0E,EACvD;QACnB,MAAMC,QAAQC;QACd,MAAMC,YAAYC,KAAK,GAAG;QAC1B,MAAMC,QAAQL,OAAO,KAAK,IAAI,IAAI,CAAC,MAAM;QACzC,MAAMM,YAAYH,YAAYE;QAE9B,MAAME,OAAyB;YAC9BN;YACA,WAAWD,OAAO,SAAS;YAC3B,uBAAuBA,OAAO,qBAAqB;YACnD,UAAUA,OAAO,QAAQ;YACzB,eAAeA,OAAO,aAAa;YACnCG;YACAG;QACD;QAEA,IAAI,CAAC,QAAQ,CAAC,GAAG,CAACL,OAAOM;QACzB,IAAIC,SAAS,IAAI,CAAC,UAAU,CAAC,GAAG,CAACD,KAAK,SAAS;QAC/C,IAAI,CAACC,QAAQ;YACZA,SAAS,IAAIC;YACb,IAAI,CAAC,UAAU,CAAC,GAAG,CAACF,KAAK,SAAS,EAAEC;QACrC;QACAA,OAAO,GAAG,CAACP;QAEX,OAAOM;IACR;IAEA,OAAON,KAAa,EAA2B;QAC9C,MAAMS,MAAM,IAAI,CAAC,QAAQ,CAAC,GAAG,CAACT;QAC9B,IAAI,CAACS,KAAK,OAAO;QACjB,IAAIA,IAAI,SAAS,IAAIN,KAAK,GAAG,IAAI;YAChC,IAAI,CAAC,OAAO,CAACH,OAAOS,IAAI,SAAS;YACjC,OAAO;QACR;QACA,IAAI,CAAC,OAAO,CAACT,OAAOS,IAAI,SAAS;QACjC,OAAOA;IACR;IAEA,KAAKT,KAAa,EAA2B;QAC5C,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAACA,UAAU;IACpC;IAEA,gBAAgBU,GAAW,EAAU;QACpC,IAAIC,UAAU;QACd,KAAK,MAAM,CAACX,OAAOS,IAAI,IAAI,IAAI,CAAC,QAAQ,CACvC,IAAIA,IAAI,SAAS,IAAIC,KAAK;YACzB,IAAI,CAAC,OAAO,CAACV,OAAOS,IAAI,SAAS;YACjCE;QACD;QAED,OAAOA;IACR;IAEA,aAAaC,SAAiB,EAAQ;QACrC,MAAML,SAAS,IAAI,CAAC,UAAU,CAAC,GAAG,CAACK;QACnC,IAAI,CAACL,QAAQ;QACb,KAAK,MAAMP,SAASO,OACnB,IAAI,CAAC,QAAQ,CAAC,MAAM,CAACP;QAEtB,IAAI,CAAC,UAAU,CAAC,MAAM,CAACY;IACxB;IAEA,KAAKA,SAAkB,EAAU;QAChC,IAAIA,AAAcC,WAAdD,WAAyB,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI;QACtD,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAACA,YAAY,QAAQ;IAChD;IAEA,QAAc;QACb,IAAI,AAAgB,SAAhB,IAAI,CAAC,MAAM,EAAW;QAC1B,IAAI,CAAC,MAAM,GAAGE,YAAY;YACzB,IAAI,CAAC,eAAe,CAACX,KAAK,GAAG;QAC9B,GAAG,IAAI,CAAC,gBAAgB;QACxB,IAAI,CAAC,MAAM,CAAC,KAAK;IAClB;IAEA,OAAa;QACZ,IAAI,AAAgB,SAAhB,IAAI,CAAC,MAAM,EAAW;QAC1BY,cAAc,IAAI,CAAC,MAAM;QACzB,IAAI,CAAC,MAAM,GAAG;IACf;IAEQ,QAAQf,KAAa,EAAEY,SAAiB,EAAQ;QACvD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAACZ;QACrB,MAAMO,SAAS,IAAI,CAAC,UAAU,CAAC,GAAG,CAACK;QACnC,IAAIL,QAAQ;YACXA,OAAO,MAAM,CAACP;YACd,IAAIO,AAAgB,MAAhBA,OAAO,IAAI,EAAQ,IAAI,CAAC,UAAU,CAAC,MAAM,CAACK;QAC/C;IACD;AACD"}

package/dist/lib.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"lib.d.ts","sourceRoot":"","sources":["../src/lib.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,KAAK,CAAC,MAAM,SAAS,CAAC;AAC7B,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAA4B,wBAAwB,EAAE,MAAM,aAAa,CAAC;AACjF,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAKpD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAElE,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAa1D,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAIhE,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,6BAA6B,CAAC;AAKvE,MAAM,WAAW,aAAa;IAC7B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,MAAM,CAAC,EAAE,gBAAgB,CAAC;IAC1B,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,UAAU,CAAC,EAAE,iBAAiB,CAAC;IAC/B,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB;;;OAGG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;OAGG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B;;;OAGG;IACH,SAAS,CAAC,EAAE,OAAO,GAAG,KAAK,CAAC;IAC5B;;OAEG;IACH,mBAAmB,CAAC,EAAE,mBAAmB,CAAC;CAC1C;AAED;;GAEG;AACH,UAAU,YAAY;IACrB,gBAAgB,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACtD,cAAc,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACpD,cAAc,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACpD,gBAAgB,EAAE;QAAE,aAAa,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CAC9D;AAED,qBAAa,iCAAkC,SAAQ,YAAa,YAAW,WAAW;IACzF;;;;;;OAMG;WACU,MAAM,CAAC,OAAO,GAAE,aAAkB,GAAG,OAAO,CAAC,iCAAiC,CAAC;IAwBnF,IAAI,CAAC,CAAC,SAAS,MAAM,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAI/E,EAAE,CAAC,CAAC,SAAS,MAAM,YAAY,EACvC,KAAK,EAAE,CAAC,EACR,QAAQ,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,GAC1C,IAAI;IAKP,OAAO,CAAC,UAAU,CAAY;IAG9B,OAAO,CAAC,OAAO,CAAmB;IAClC,OAAO,CAAC,eAAe,CAAiB;IACxC,OAAO,CAAC,iBAAiB,CAAmB;IAC5C,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,aAAa,CAA6B;IAClD,OAAO,CAAC,YAAY,CAA4B;IAChD,OAAO,CAAC,OAAO,CAAe;IAG9B;;;;;;;OAOG;IACH,SAAgB,OAAO,EAAE,cAAc,CAAC;IAExC;;;;;;;OAOG;IACH,SAAgB,KAAK,EAAE,YAAY,CAAC;IAEpC;;;;;;;OAOG;IACH,SAAgB,MAAM,EAAE,aAAa,CAAC;IAEtC;;;;;;OAMG;IACH,SAAgB,MAAM,EAAE,YAAY,CAAC;gBAEzB,OAAO,GAAE,aAAkB;IAmCvC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAsKnC;;;OAGG;mBACkB,2BAA2B;IAYhD;;;OAGG;IACI,YAAY,IAAI,SAAS;IAIhC;;;;OAIG;IACU,mBAAmB,IAAI,OAAO,CAAC,MAAM,CAAC;IAKnD;;;OAGG;IACI,WAAW,IAAI,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC;IAKtC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,CAAC,OAAO,wBAAwB,CAAC;IASzE,kBAAkB,IAAI,MAAM;IAInC;;;OAGG;IACU,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAyClC;;;OAGG;IACI,KAAK,IAAI,IAAI;IAKpB;;;;OAIG;IACU,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;CAKrC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAsB,YAAY,CACjC,OAAO,GAAE,aAAkB,GACzB,OAAO,CAAC,iCAAiC,CAAC,CAE5C;AAGD,wBAAsB,gBAAgB,IAAI,OAAO,CAAC,iCAAiC,CAAC,CAmBnF"}
+{"version":3,"file":"lib.d.ts","sourceRoot":"","sources":["../src/lib.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAC3C,OAAO,KAAK,CAAC,MAAM,SAAS,CAAC;AAC7B,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAA4B,wBAAwB,EAAE,MAAM,aAAa,CAAC;AACjF,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAKpD,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAElE,OAAO,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAa1D,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAIhE,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAC5D,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,6BAA6B,CAAC;AAKvE,MAAM,WAAW,aAAa;IAC7B,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,MAAM,CAAC,EAAE,gBAAgB,CAAC;IAC1B,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB,MAAM,CAAC,EAAE,YAAY,CAAC;IACtB,UAAU,CAAC,EAAE,iBAAiB,CAAC;IAC/B,SAAS,CAAC,EAAE,SAAS,CAAC;IACtB;;;OAGG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;;OAGG;IACH,aAAa,CAAC,EAAE,OAAO,CAAC;IACxB;;;OAGG;IACH,mBAAmB,CAAC,EAAE,OAAO,CAAC;IAC9B;;;OAGG;IACH,SAAS,CAAC,EAAE,OAAO,GAAG,KAAK,CAAC;IAC5B;;OAEG;IACH,mBAAmB,CAAC,EAAE,mBAAmB,CAAC;CAC1C;AAED;;GAEG;AACH,UAAU,YAAY;IACrB,gBAAgB,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACtD,cAAc,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACpD,cAAc,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,KAAK,CAAA;KAAE,CAAC;IACpD,gBAAgB,EAAE;QAAE,aAAa,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CAC9D;AAED,qBAAa,iCAAkC,SAAQ,YAAa,YAAW,WAAW;IACzF;;;;;;OAMG;WACU,MAAM,CAAC,OAAO,GAAE,aAAkB,GAAG,OAAO,CAAC,iCAAiC,CAAC;IAwBnF,IAAI,CAAC,CAAC,SAAS,MAAM,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,OAAO;IAI/E,EAAE,CAAC,CAAC,SAAS,MAAM,YAAY,EACvC,KAAK,EAAE,CAAC,EACR,QAAQ,EAAE,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,IAAI,GAC1C,IAAI;IAKP,OAAO,CAAC,UAAU,CAAY;IAG9B,OAAO,CAAC,OAAO,CAAmB;IAClC,OAAO,CAAC,eAAe,CAAiB;IACxC,OAAO,CAAC,iBAAiB,CAAmB;IAC5C,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,aAAa,CAA6B;IAClD,OAAO,CAAC,YAAY,CAA4B;IAChD,OAAO,CAAC,OAAO,CAAe;IAG9B;;;;;;;OAOG;IACH,SAAgB,OAAO,EAAE,cAAc,CAAC;IAExC;;;;;;;OAOG;IACH,SAAgB,KAAK,EAAE,YAAY,CAAC;IAEpC;;;;;;;OAOG;IACH,SAAgB,MAAM,EAAE,aAAa,CAAC;IAEtC;;;;;;OAMG;IACH,SAAgB,MAAM,EAAE,YAAY,CAAC;gBAEzB,OAAO,GAAE,aAAkB;IAmCvC;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAsKnC;;;OAGG;mBACkB,2BAA2B;IAYhD;;;OAGG;IACI,YAAY,IAAI,SAAS;IAIhC;;;;OAIG;IACU,mBAAmB,IAAI,OAAO,CAAC,MAAM,CAAC;IAKnD;;;OAGG;IACI,WAAW,IAAI,MAAM,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC;IAKtC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,CAAC,OAAO,wBAAwB,CAAC;IAuBzE,kBAAkB,IAAI,MAAM;IAInC;;;OAGG;IACU,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC;IAyClC;;;OAGG;IACI,KAAK,IAAI,IAAI;IAKpB;;;;OAIG;IACU,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;CAKrC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAsB,YAAY,CACjC,OAAO,GAAE,aAAkB,GACzB,OAAO,CAAC,iCAAiC,CAAC,CAE5C;AAGD,wBAAsB,gBAAgB,IAAI,OAAO,CAAC,iCAAiC,CAAC,CAmBnF"}

package/dist/lib.js

@@ -193,6 +193,17 @@ class ToolAwareSequentialThinkingServer extends EventEmitter {
     async processThought(input) {
         const startTime = Date.now();
         const thoughtInput = input;
+        if ('string' == typeof thoughtInput.register_branch_id && thoughtInput.register_branch_id.length > 0) {
+            try {
+                this._historyManager.registerBranch(thoughtInput.session_id, thoughtInput.register_branch_id);
+            } catch (err) {
+                this._logger.warn('registerBranch skipped', {
+                    branch_id: thoughtInput.register_branch_id,
+                    error: err instanceof Error ? err.message : String(err)
+                });
+            }
+            delete thoughtInput.register_branch_id;
+        }
         const result = await this._thoughtProcessor.process(thoughtInput);
         const durationSeconds = (Date.now() - startTime) / 1000;
         this._metrics.histogram('thought_processing_duration_seconds', durationSeconds, {});