@iworkforces/tracelattice 2.3.0 → 2.3.1

package/dist/schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"schema.js","sources":["../src/schema.ts"],"sourcesContent":["/**\n * Valibot validation schemas for the sequential thinking MCP tool.\n *\n * This module defines the validation schemas used for the sequential thinking tool,\n * including schemas for tool recommendations, skill recommendations, step recommendations,\n * and the main sequential thinking input. All schemas use Valibot for runtime validation\n * and provide detailed descriptions for MCP protocol compatibility.\n *\n * @remarks\n * **Schema Overview:**\n * - `ToolRecommendationSchema` - Validates tool recommendation objects with confidence scores\n * - `SkillRecommendationSchema` - Validates skill recommendation objects\n * - `StepRecommendationSchema` - Validates step coordination structures\n * - `SequentialThinkingSchema` - Main schema for thought input validation\n * - Reasoning enhancement fields: thought_type, quality_score, confidence, hypothesis_id, etc.\n *\n * @example\n * ```typescript\n * import { SequentialThinkingSchema } from './schema.js';\n * import { safeParse } from 'valibot';\n *\n * const result = safeParse(SequentialThinkingSchema, inputData);\n * if (result.success) {\n *   const thought = result.output;\n *   // Process the valid thought\n * } else {\n *   console.error('Validation failed:', result.issues);\n * }\n * ```\n * @module schema\n */\n\nimport * as v from 'valibot';\nimport type { Tool } from './types/tool.js';\nimport type { Edge, EdgeKind } from './core/graph/Edge.js';\n/**\n * Detailed description for the sequential thinking tool.\n *\n * This description is shown to LLMs when they consider using this tool.\n * It explains when to use the tool, its features, parameters, and best practices.\n */\nconst TOOL_DESCRIPTION = `A detailed tool for dynamic and reflective problem-solving through thoughts.\nThis tool helps analyze problems through a flexible thinking process that can adapt and evolve.\nEach thought can build on, question, or revise previous insights as understanding deepens.\n\nIMPORTANT: This server facilitates sequential thinking with MCP tool coordination and skill recommendations. The LLM analyzes available tools and skills to make intelligent recommendations, which are then tracked and organized by this server.\n\nEach invocation records exactly one authored thought and returns. When strategy_hint.action is continue, invoke this tool again with the next thought; do not stop or provide a final answer. terminate permits stopping. The server does not author later thoughts or call itself.\n\nWhen to use this tool:\n- Breaking down complex problems into steps\n- Planning and design with room for revision\n- Analysis that might need course correction\n- Problems where the full scope might not be clear initially\n- Problems that require a multi-step solution\n- Tasks that need to maintain context over multiple steps\n- Situations where irrelevant information needs to be filtered out\n- When you need guidance on which tools to use and in what order\n- When you need guidance on which skills to invoke for specific workflows\n\nKey features:\n- You can adjust total_thoughts up or down as you progress\n- You can question or revise previous thoughts\n- You can add more thoughts even after reaching what seemed like the end\n- You can express uncertainty and explore alternative approaches\n- Not every thought needs to build linearly - you can branch or backtrack\n- Generates a solution hypothesis\n- Verifies the hypothesis based on the Chain of Thought steps\n- Recommends appropriate tools for each step\n- Recommends appropriate skills alongside tools\n- Provides rationale for tool recommendations\n- Suggests tool execution order and parameters\n- Tracks previous recommendations and remaining steps\n\nParameters explained:\n- available_mcp_tools: (Optional) Array of MCP tool names that are available for use (e.g., [\"mcp-omnisearch\", \"mcp-turso-cloud\"])\n- available_skills: (Optional) Array of skill names that are available for use (e.g., [\"commit\", \"review-pr\", \"pdf\"])\n- thought: Your current thinking step, which can include:\n* Regular analytical steps\n* Revisions of previous thoughts\n* Questions about previous decisions\n* Realizations about needing more analysis\n* Changes in approach\n* Hypothesis generation\n* Hypothesis verification\n* Tool recommendations and rationale\n- next_thought_needed: True if you need more thinking, even if at what seemed like the end. Omission defaults to true; the effective next action is in strategy_hint.\n- thought_number: Current number in sequence (can go beyond initial total if needed)\n- total_thoughts: Current estimate of thoughts needed (can be adjusted up/down)\n- is_revision: A boolean indicating if this thought revises previous thinking\n- revises_thought: If is_revision is true, which thought number is being reconsidered\n- branch_from_thought: If branching, which thought number is the branching point\n- branch_id: Identifier for the current branch (if any)\n- needs_more_thoughts: If reaching end but realizing more thoughts needed\n- current_step: Current step recommendation, including:\n* step_description: What needs to be done\n* recommended_tools: (CRITICAL: PLURAL - \"recommended_tools\" with an 's') Tools recommended for this step - MUST be an array.\n* recommended_skills: (CRITICAL: PLURAL - \"recommended_skills\" with an 's') Skills recommended for this step (optional) - MUST be an array.\n* expected_outcome: What to expect from this step\n* next_step_conditions: Conditions to consider for the next step\n- previous_steps: Steps already recommended (each step MUST use \"recommended_tools\" PLURAL)\n- remaining_steps: High-level descriptions of upcoming steps\n\nReasoning Enhancement Parameters:\n- thought_type: Thought purpose: 'regular' (default), 'hypothesis', 'verification', 'critique', 'synthesis', 'meta', 'tool_call' (requires toolInterleave flag), 'tool_observation' (requires toolInterleave flag), 'assumption' (requires newThoughtTypes flag), 'decomposition' (requires newThoughtTypes flag), 'backtrack' (requires newThoughtTypes flag; logically retracts the thought referenced by backtrack_target - the target remains in history but is excluded from quality calculations)\n- quality_score: Self-assessed quality of this thought (0-1)\n- confidence: Confidence in this thought's correctness (0-1)\n- hypothesis_id: Links hypothesis to verification (alphanumeric, hyphens, underscores)\n- verification_target: For 'verification'/'critique', the thought_number of a uniquely retained identity. Branch/revision number reuse is legal, but ambiguous numeric targets fail. Result-bearing verification requires a non-retracted target with confidence.\n- verification_result: Optional exact outcome label (0 = incorrect, 1 = correct) for a verification_target; only has outcome semantics on thought_type='verification'\n- synthesis_sources: For 'synthesis' type, the thought_numbers being combined\n- merge_from_thoughts: Thought numbers from other branches merged (graph reasoning)\n- merge_branch_ids: Branch IDs merged into current context\n- meta_observation: Observation about reasoning process (with thought_type 'meta')\n- reasoning_depth: How deep to reason: 'shallow' (quick), 'moderate' (default), 'deep' (thorough)\n- session_id: Required unique identifier that scopes thought history, branches, and statistics to an explicit session. Format: alphanumeric, hyphens, underscores, 1-100 chars; the retired value __global__ is rejected.\n- reset_state: (Optional) Authorized fresh-chain replacement for session_id, deleting its durable data and preserving its former owner. SESSION_EXPIRED requires this explicit recovery or a new session_id; invalid or failed reset does not reopen the expired scope.\n\nResponse Enrichment:\n- When reasoning fields are set, response includes confidence_signals (depth, revision/branch count, type distribution, avg confidence, structural_quality, quality_components) and reasoning_stats (hypothesis tracking)\n- confidence_signals.structural_quality: Composite 0-1 score — weighted geometric mean of type_diversity (0.3), verification_coverage (0.3), depth_efficiency (0.2), confidence_stability (0.2). Weights: type_diversity=0.3, verification_coverage=0.3, depth_efficiency=0.2, confidence_stability=0.2 (weighted geometric mean). All components floored at 0.01 to prevent collapse.\n- confidence_signals.quality_components: Individual metrics — type_diversity (Shannon entropy/log₂(6)), verification_coverage (verified/total hypotheses, 1.0 if none), depth_efficiency (max(chain_depth, branch_count+1)/total, branching rewarded), confidence_stability (1 - stddev(confidence), default 0.5, null when fewer than 2 confidence values)\n- reasoning_hints: (Conditional) Array of actionable hint strings from cross-thought pattern analysis. Only warning-severity patterns produce hints. Max 3 hints per response, with 3-thought cooldown per pattern per session. Hints are prioritized: confidence_drift > unverified_hypothesis > no_alternatives_explored > consecutive_without_verification, so the most actionable patterns fill the cap first. Present only when warnings are detected.\n- Detected patterns (internal, not in response): consecutive_without_verification (3+ regular thoughts without verification), unverified_hypothesis (hypothesis without verification within 3 thoughts after it), no_alternatives_explored (5+ thoughts with no critique/branches), monotonic_type (5+ consecutive same type), confidence_drift (3+ consecutive decreasing confidence), healthy_verification (hypothesis verified within 3 thoughts — info only)\nYou should:\n1. Start with an initial estimate of needed thoughts, but be ready to adjust\n2. Feel free to question or revise previous thoughts\n3. Don't hesitate to add more thoughts if needed, even at the \"end\"\n4. Express uncertainty when present\n5. Mark thoughts that revise previous thinking or branch into new paths\n6. Ignore information that is irrelevant to the current step\n7. Generate a solution hypothesis when appropriate\n8. Verify the hypothesis based on the Chain of Thought steps\n9. Consider available tools that could help with the current step\n10. Provide clear rationale for tool recommendations\n11. Suggest specific tool parameters when appropriate\n12. Consider alternative tools for each step\n13. Track progress through the recommended steps\n14. Consider available skills that provide workflows for complex tasks\n15. Coordinate skill invocation with tool recommendations (skills may call tools)\n16. Provide a single, ideally correct answer as the final output\n17. Only set next_thought_needed to false when truly done and a satisfactory answer is reached\n18. Classify your reasoning steps using thought_type for better analytics and self-awareness\n19. Use hypothesis → verification chains to test solutions before committing\n20. Self-assess quality and confidence to track reasoning reliability\n21. Use merge_from_thoughts to combine insights from multiple reasoning branches\n22. Use session_id to isolate independent reasoning chains from each other\n23. Use reset_state: true when starting a completely new analysis to avoid statistical contamination from previous chains`;\n\n/**\n * Valibot schema for validating tool recommendation objects.\n *\n * Validates that a tool recommendation has:\n * - A tool name (string)\n * - A confidence score between 0 and 1\n * - A rationale explaining the recommendation\n * - A priority number for ordering\n * - Optional suggested input parameters\n * - Optional alternative tools\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { ToolRecommendationSchema } from './schema.js';\n *\n * const result = safeParse(ToolRecommendationSchema, {\n *   tool_name: 'mcp__tavily-mcp__tavily-search',\n *   confidence: 0.9,\n *   rationale: 'Best for web search',\n *   priority: 1\n * });\n * ```\n */\nexport const ToolRecommendationSchema = v.object({\n\ttool_name: v.pipe(v.string(), v.description('Name of the tool being recommended')),\n\tconfidence: v.pipe(\n\t\tv.number(),\n\t\tv.minValue(0),\n\t\tv.maxValue(1),\n\t\tv.description('0-1 indicating confidence in recommendation')\n\t),\n\trationale: v.pipe(v.string(), v.maxLength(2000), v.description('Why this tool is recommended')),\n\tpriority: v.optional(\n\t\tv.pipe(v.number(), v.description('Order in the recommendation sequence (default: 999)'))\n\t),\n\tsuggested_inputs: v.optional(\n\t\tv.pipe(\n\t\t\tv.record(v.string(), v.union([v.string(), v.number(), v.boolean(), v.null()])),\n\t\t\tv.description('Optional suggested parameters (flat key-value pairs only)')\n\t\t)\n\t),\n\talternatives: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Alternative tools that could be used'))\n\t),\n});\n\n/**\n * Valibot schema for validating skill recommendation objects.\n *\n * Validates that a skill recommendation has:\n * - A skill name (string)\n * - A confidence score between 0 and 1\n * - A rationale explaining the recommendation\n * - A priority number for ordering\n * - Optional alternative skills\n * - Optional allowed tools list\n * - Optional user invocable flag\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { SkillRecommendationSchema } from './schema.js';\n *\n * const result = safeParse(SkillRecommendationSchema, {\n *   skill_name: 'commit',\n *   confidence: 0.95,\n *   rationale: 'Handles git commit workflow',\n *   priority: 1,\n *   user_invocable: true\n * });\n * ```\n */\nexport const SkillRecommendationSchema = v.object({\n\tskill_name: v.pipe(v.string(), v.description('Name of the skill being recommended')),\n\tconfidence: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.minValue(0),\n\t\t\tv.maxValue(1),\n\t\t\tv.description('0-1 indicating confidence in recommendation (default: 0.5)')\n\t\t)\n\t),\n\trationale: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.maxLength(2000),\n\t\t\tv.description('Why this skill is recommended (default: empty string)')\n\t\t)\n\t),\n\tpriority: v.optional(\n\t\tv.pipe(v.number(), v.description('Order in the recommendation sequence (default: 999)'))\n\t),\n\talternatives: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Alternative skills that could be used'))\n\t),\n\tallowed_tools: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.string()),\n\t\t\tv.description('Tools this skill is allowed to use (from skill frontmatter)')\n\t\t)\n\t),\n\tuser_invocable: v.optional(\n\t\tv.pipe(v.boolean(), v.description('Whether this skill can be user-invoked'))\n\t),\n});\n\n/**\n * Valibot schema for validating step recommendation objects.\n *\n * Validates that a step recommendation has:\n * - A step description\n * - An array of recommended tools\n * - An optional array of recommended skills\n * - An expected outcome\n * - Optional conditions for the next step\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { StepRecommendationSchema } from './schema.js';\n *\n * const result = safeParse(StepRecommendationSchema, {\n *   step_description: 'Search for TypeScript files',\n *   recommended_tools: [{ ... }],\n *   expected_outcome: 'List of all TypeScript files'\n * });\n * ```\n */\nexport const StepRecommendationSchema = v.object({\n\tstep_description: v.pipe(v.string(), v.description('What needs to be done')),\n\trecommended_tools: v.pipe(\n\t\tv.array(ToolRecommendationSchema),\n\t\tv.description('Tools recommended for this step')\n\t),\n\trecommended_skills: v.optional(\n\t\tv.pipe(v.array(SkillRecommendationSchema), v.description('Skills recommended for this step'))\n\t),\n\texpected_outcome: v.pipe(v.string(), v.description('What to expect from this step')),\n\tnext_step_conditions: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Conditions to consider for the next step'))\n\t),\n});\n\n/**\n * Valibot schema for validating partial tool recommendation objects.\n *\n * This is a lenient version of ToolRecommendationSchema used for previous_steps,\n * where LLMs naturally provide partial/skeletal data. Only tool_name and rationale\n * are required, while confidence and priority are optional with default values.\n *\n * Validates that a partial tool recommendation has:\n * - A tool name (required)\n * - A rationale explaining the recommendation (required)\n * - An optional confidence score (defaults to 0.5)\n * - An optional priority number (defaults to 999)\n * - Optional suggested input parameters\n * - Optional alternative tools\n *\n * @remarks\n * **Design Rationale:**\n * LLMs tend to provide complete data for current_step but only partial data\n * for previous_steps (historical context). This schema accommodates that natural\n * LLM behavior while maintaining data integrity through sensible defaults.\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { PartialToolRecommendationSchema } from './schema.js';\n *\n * // Minimal valid input (LLM often generates this for previous_steps)\n * const result = safeParse(PartialToolRecommendationSchema, {\n *   tool_name: 'Read',\n *   rationale: 'Read the file'\n * });\n * // confidence and priority will be filled in by the normalizer\n * ```\n */\nexport const PartialToolRecommendationSchema = v.object({\n\ttool_name: v.pipe(v.string(), v.description('Name of the tool being recommended')),\n\trationale: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.maxLength(2000),\n\t\t\tv.description('Why this tool is recommended (default: empty string)')\n\t\t)\n\t),\n\tconfidence: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.minValue(0),\n\t\t\tv.maxValue(1),\n\t\t\tv.description('0-1 indicating confidence in recommendation (default: 0.5)')\n\t\t)\n\t),\n\tpriority: v.optional(\n\t\tv.pipe(v.number(), v.description('Order in the recommendation sequence (default: 999)'))\n\t),\n\tsuggested_inputs: v.optional(\n\t\tv.pipe(\n\t\t\tv.record(v.string(), v.union([v.string(), v.number(), v.boolean(), v.null()])),\n\t\t\tv.description('Optional suggested parameters (flat key-value pairs only)')\n\t\t)\n\t),\n\talternatives: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Alternative tools that could be used'))\n\t),\n});\n\n/**\n * Valibot schema for validating partial step recommendation objects.\n *\n * This is a lenient version of StepRecommendationSchema used for previous_steps,\n * where LLMs naturally provide partial/skeletal data. Only step_description is\n * strictly required, while expected_outcome and tool recommendation fields are\n * optional with default values.\n *\n * Validates that a partial step recommendation has:\n * - A step description (required)\n * - An array of recommended tools (with optional confidence/priority)\n * - An optional array of recommended skills\n * - An optional expected outcome (defaults to empty string)\n * - Optional conditions for the next step\n *\n * @remarks\n * **Design Rationale:**\n * LLMs provide complete, detailed data for current_step but only brief summaries\n * for previous_steps. This schema allows the natural LLM behavior while the\n * InputNormalizer fills in sensible defaults for missing fields.\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { PartialStepRecommendationSchema } from './schema.js';\n *\n * // Minimal valid input (LLM often generates this for previous_steps)\n * const result = safeParse(PartialStepRecommendationSchema, {\n *   step_description: 'Read the file',\n *   recommended_tools: [{\n *     tool_name: 'Read',\n *     rationale: 'Read the file'\n *   }]\n * });\n * // confidence, priority, and expected_outcome will be filled in by normalizer\n * ```\n */\nexport const PartialStepRecommendationSchema = v.object({\n\tstep_description: v.pipe(v.string(), v.description('What needs to be done')),\n\trecommended_tools: v.pipe(\n\t\tv.array(PartialToolRecommendationSchema),\n\t\tv.description('Tools recommended for this step')\n\t),\n\trecommended_skills: v.optional(\n\t\tv.pipe(v.array(SkillRecommendationSchema), v.description('Skills recommended for this step'))\n\t),\n\texpected_outcome: v.optional(\n\t\tv.pipe(v.string(), v.description('What to expect from this step (default: empty string)'))\n\t),\n\tnext_step_conditions: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Conditions to consider for the next step'))\n\t),\n});\n\n/**\n * Main Valibot schema for validating sequential thinking tool input.\n *\n * This is the primary schema used for the sequential thinking MCP tool.\n * It validates all thought data including:\n * - Optional available tools and skills arrays\n * - The thought content (required)\n * - Thought numbering (thought_number, total_thoughts)\n * - Revision and branching metadata\n * - Current, previous, and remaining step recommendations\n *\n * @remarks\n * **Validation Rules:**\n * - `thought_number` must be >= 1\n * - `total_thoughts` must be >= 1\n * - `branch_id` must be 1-50 characters, alphanumeric/hyphens/underscores only\n * - `confidence` values must be between 0 and 1\n * - `thought_type` must be one of: regular, hypothesis, verification, critique, synthesis, meta\n * - `quality_score` and `confidence` must be between 0 and 1\n * - `hypothesis_id` must be 1-50 characters, alphanumeric/hyphens/underscores only\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { SequentialThinkingSchema } from './schema.js';\n *\n * const result = safeParse(SequentialThinkingSchema, {\n *   thought: 'I need to analyze the problem',\n *   thought_number: 1,\n *   total_thoughts: 5,\n *   session_id: 'analysis-task',\n *   next_thought_needed: true,\n *   available_mcp_tools: ['Read', 'Write', 'Grep']\n * });\n *\n * if (result.success) {\n *   console.log('Valid thought:', result.output);\n * } else {\n *   console.error('Validation errors:', result.issues);\n * }\n * ```\n */\nexport const SequentialThinkingSchema = v.object({\n\tavailable_mcp_tools: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.string()),\n\t\t\tv.description(\n\t\t\t\t'Array of MCP tool names available for use (e.g., [\"mcp-omnisearch\", \"mcp-turso-cloud\"])'\n\t\t\t)\n\t\t)\n\t),\n\tavailable_skills: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.string()),\n\t\t\tv.description('Array of skill names available for use (e.g., [\"commit\", \"review-pr\", \"pdf\"])')\n\t\t)\n\t),\n\tthought: v.pipe(v.string(), v.description('Your current thinking step')),\n\tid: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.minLength(1),\n\t\t\tv.maxLength(30),\n\t\t\tv.description('Unique identifier for this thought. Auto-generated if not provided.')\n\t\t)\n\t),\n\tnext_thought_needed: v.optional(\n\t\tv.pipe(\n\t\t\tv.boolean(),\n\t\t\tv.description(\n\t\t\t\t'Omission defaults to true; the effective next action is returned in strategy_hint.'\n\t\t\t)\n\t\t)\n\t),\n\tthought_number: v.pipe(v.number(), v.minValue(1), v.description('Current thought number')),\n\ttotal_thoughts: v.pipe(\n\t\tv.number(),\n\t\tv.minValue(1),\n\t\tv.description('Estimated total thoughts needed')\n\t),\n\tis_revision: v.optional(\n\t\tv.pipe(v.boolean(), v.description('Whether this revises previous thinking'))\n\t),\n\trevises_thought: v.optional(\n\t\tv.pipe(v.number(), v.minValue(1), v.description('Which thought is being reconsidered'))\n\t),\n\tbranch_from_thought: v.optional(\n\t\tv.pipe(v.number(), v.minValue(1), v.description('Branching point thought number'))\n\t),\n\tbranch_id: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.regex(\n\t\t\t\t/^[a-zA-Z0-9_-]+$/,\n\t\t\t\t'Branch ID must contain only letters, numbers, hyphens, and underscores'\n\t\t\t),\n\t\t\tv.minLength(1),\n\t\t\tv.maxLength(50),\n\t\t\tv.description('Branch identifier (alphanumeric, hyphens, underscores only, max 50 chars)')\n\t\t)\n\t),\n\tneeds_more_thoughts: v.optional(\n\t\tv.pipe(v.boolean(), v.description('If more thoughts are needed'))\n\t),\n\tcurrent_step: v.optional(\n\t\tv.pipe(StepRecommendationSchema, v.description('Current step recommendation'))\n\t),\n\tprevious_steps: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(PartialStepRecommendationSchema),\n\t\t\tv.description(\n\t\t\t\t'Steps already recommended (lenient schema - allows partial data with defaults)'\n\t\t\t)\n\t\t)\n\t),\n\tremaining_steps: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('High-level descriptions of upcoming steps'))\n\t),\n\tthought_type: v.optional(\n\t\tv.pipe(\n\t\t\tv.picklist([\n\t\t\t\t'regular',\n\t\t\t\t'hypothesis',\n\t\t\t\t'verification',\n\t\t\t\t'critique',\n\t\t\t\t'synthesis',\n\t\t\t\t'meta',\n\t\t\t\t'tool_call',\n\t\t\t\t'tool_observation',\n\t\t\t\t'assumption',\n\t\t\t\t'decomposition',\n\t\t\t\t'backtrack',\n\t\t\t]),\n\t\t\tv.description(\n\t\t\t\t'Classified purpose: regular (default), hypothesis, verification, critique, synthesis, meta, tool_call (requires toolInterleave), tool_observation (requires toolInterleave), assumption (requires newThoughtTypes), decomposition (requires newThoughtTypes), backtrack (requires newThoughtTypes)'\n\t\t\t)\n\t\t)\n\t),\n\tquality_score: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.minValue(0),\n\t\t\tv.maxValue(1),\n\t\t\tv.description('Self-assessed quality score (0-1)')\n\t\t)\n\t),\n\tconfidence: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.minValue(0),\n\t\t\tv.maxValue(1),\n\t\t\tv.description('Explicit confidence in correctness (0-1)')\n\t\t)\n\t),\n\thypothesis_id: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.regex(\n\t\t\t\t/^[a-zA-Z0-9_-]+$/,\n\t\t\t\t'Hypothesis ID must contain only letters, numbers, hyphens, and underscores'\n\t\t\t),\n\t\t\tv.minLength(1),\n\t\t\tv.maxLength(50),\n\t\t\tv.description('Identifier linking hypothesis to verification thoughts')\n\t\t)\n\t),\n\tverification_target: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.minValue(1),\n\t\t\tv.description(\n\t\t\t\t'Uniquely retained thought number being verified or critiqued; ambiguous numeric targets fail even though branch/revision number reuse is legal'\n\t\t\t)\n\t\t)\n\t),\n\tverification_result: v.optional(\n\t\tv.pipe(\n\t\t\tv.union([v.literal(0), v.literal(1)]),\n\t\t\tv.description('Exact verification outcome label: 0 for incorrect, 1 for correct')\n\t\t)\n\t),\n\tsynthesis_sources: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.pipe(v.number(), v.minValue(1))),\n\t\t\tv.description('Thought numbers being synthesized')\n\t\t)\n\t),\n\tmerge_from_thoughts: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.pipe(v.number(), v.minValue(1))),\n\t\t\tv.description('Thought numbers from other branches being merged (DAG)')\n\t\t)\n\t),\n\tmerge_branch_ids: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.pipe(v.string(), v.regex(/^[a-zA-Z0-9_-]+$/), v.maxLength(50))),\n\t\t\tv.description('Branch IDs being merged into current context')\n\t\t)\n\t),\n\tmeta_observation: v.optional(\n\t\tv.pipe(v.string(), v.description('Metacognitive observation about reasoning process'))\n\t),\n\treasoning_depth: v.optional(\n\t\tv.pipe(\n\t\t\tv.picklist(['shallow', 'moderate', 'deep']),\n\t\t\tv.description('Effort signal: how deep reasoning should go')\n\t\t)\n\t),\n\tsession_id: v.pipe(\n\t\tv.string(),\n\t\tv.regex(\n\t\t\t/^[a-zA-Z0-9_-]+$/,\n\t\t\t'Session ID must contain only letters, numbers, hyphens, and underscores'\n\t\t),\n\t\tv.minLength(1),\n\t\tv.maxLength(100),\n\t\tv.notValue('__global__', \"Session ID '__global__' is retired; use an explicit named session\"),\n\t\tv.description(\n\t\t\t'Required named session for state isolation. SESSION_EXPIRED after runtime eviction requires an authorized reset_state fresh chain or a new session_id; ordinary continuation cannot recreate it.'\n\t\t)\n\t),\n\treset_state: v.optional(\n\t\tv.pipe(\n\t\t\tv.boolean(),\n\t\t\tv.description(\n\t\t\t\t'Authorized fresh-chain replacement, deleting target-session durable data and preserving its former owner. Recovers SESSION_EXPIRED only on successful reset; invalid or failed reset does not reopen it.'\n\t\t\t)\n\t\t)\n\t),\n\ttool_name: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.minLength(1),\n\t\t\tv.description('Name of the tool being invoked (for tool_call thoughts)')\n\t\t)\n\t),\n\ttool_arguments: v.optional(\n\t\tv.pipe(\n\t\t\tv.record(v.string(), v.unknown()),\n\t\t\tv.description('Arguments passed to the tool (for tool_call thoughts)')\n\t\t)\n\t),\n\ttool_result: v.optional(\n\t\tv.pipe(\n\t\t\tv.unknown(),\n\t\t\tv.description('Result returned by the tool (for tool_observation thoughts)')\n\t\t)\n\t),\n\tcontinuation_token: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.minLength(1),\n\t\t\tv.description('Token for resuming long-running tool invocations')\n\t\t)\n\t),\n\tdecomposition_children: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Child thought IDs produced by decomposition'))\n\t),\n\tbacktrack_target: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.integer(),\n\t\t\tv.minValue(1),\n\t\t\tv.description(\n\t\t\t\t'Thought number to backtrack to. When the parent thought has thought_type=backtrack, this thought is logically retracted: it remains in history but is excluded from quality signals and reasoning stats.'\n\t\t\t)\n\t\t)\n\t),\n\tregister_branch_id: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.regex(\n\t\t\t\t/^[a-zA-Z0-9_-]+$/,\n\t\t\t\t'register_branch_id must contain only letters, numbers, hyphens, and underscores'\n\t\t\t),\n\t\t\tv.minLength(1),\n\t\t\tv.maxLength(50),\n\t\t\tv.description(\n\t\t\t\t'Pre-declares a branch ID for this session before any thoughts reference it. Useful so that subsequent thoughts using merge_branch_ids can target a branch that has not yet received any thoughts.'\n\t\t\t)\n\t\t)\n\t),\n});\n\n/** Inferred output type of the sequential thinking schema (string IDs, no branded types). */\nexport type SchemaOutput = v.InferOutput<typeof SequentialThinkingSchema>;\n\n/**\n * The sequential thinking tool definition for MCP registration.\n *\n * This object defines the tool that is registered with the MCP server.\n * The inputSchema is left empty as the schema is handled by tmcp\n * when registering the tool using the Valibot adapter.\n *\n * @example\n * ```typescript\n * import { SEQUENTIAL_THINKING_TOOL } from './schema.js';\n * import { McpServer } from 'tmcp';\n *\n * const server = new McpServer({ name: 'my-server', version: '1.0.0' });\n * server.tool({\n *   name: SEQUENTIAL_THINKING_TOOL.name,\n *   description: SEQUENTIAL_THINKING_TOOL.description,\n *   schema: SequentialThinkingSchema\n * }, handler);\n * ```\n */\nexport const SEQUENTIAL_THINKING_TOOL: Tool = {\n\tname: 'sequentialthinking_tools',\n\tdescription: TOOL_DESCRIPTION,\n\tinputSchema: {}, // Schema is handled by tmcp when registering the tool\n};\n\n/**\n * Valibot schema for validating JSON-RPC 2.0 request messages.\n *\n * Validates that a JSON-RPC request has:\n * - A jsonrpc version (must be \"2.0\")\n * - A method name (string)\n * - Optional params (object or array)\n * - Optional id (string, number, or null for notifications)\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { JsonRpcRequestSchema } from './schema.js';\n *\n * const result = safeParse(JsonRpcRequestSchema, {\n *   jsonrpc: '2.0',\n *   method: 'tools/list',\n *   id: 1\n * });\n * ```\n */\nexport const JsonRpcRequestSchema = v.object({\n\tjsonrpc: v.pipe(\n\t\tv.string(),\n\t\tv.literal('2.0'),\n\t\tv.description('JSON-RPC protocol version (must be \"2.0\")')\n\t),\n\tmethod: v.pipe(v.string(), v.minLength(1), v.description('Method name to invoke')),\n\tparams: v.optional(\n\t\tv.pipe(\n\t\t\tv.union([v.array(v.unknown()), v.record(v.string(), v.unknown())]),\n\t\t\tv.description('Method parameters (object or array)')\n\t\t)\n\t),\n\tid: v.optional(\n\t\tv.pipe(\n\t\t\tv.union([v.string(), v.number(), v.null()]),\n\t\t\tv.description('Request ID (omit for notifications)')\n\t\t)\n\t),\n});\n\n/**\n * Schema for {@link EdgeKind} — the semantic relationship between two thoughts.\n */\nexport const EdgeKindSchema = v.union([\n\tv.literal('sequence'),\n\tv.literal('branch'),\n\tv.literal('merge'),\n\tv.literal('verifies'),\n\tv.literal('critiques'),\n\tv.literal('derives_from'),\n\tv.literal('tool_invocation'),\n\tv.literal('revises'),\n]) satisfies v.GenericSchema<EdgeKind>;\n\n/**\n * Schema for {@link Edge} — a directed edge in the thought DAG.\n */\nexport const EdgeSchema = v.object({\n\tid: v.pipe(v.string(), v.minLength(1), v.maxLength(30)),\n\tfrom: v.pipe(v.string(), v.minLength(1), v.maxLength(30)),\n\tto: v.pipe(v.string(), v.minLength(1), v.maxLength(30)),\n\tkind: EdgeKindSchema,\n\tsessionId: v.pipe(v.string(), v.minLength(1)),\n\tcreatedAt: v.number(),\n\tmetadata: v.optional(v.record(v.string(), v.unknown())),\n}) satisfies v.GenericSchema<\n\tOmit<Edge, 'id' | 'from' | 'to' | 'sessionId'> & {\n\t\tid: string;\n\t\tfrom: string;\n\t\tto: string;\n\t\tsessionId: string;\n\t}\n>;\n"],"names":["TOOL_DESCRIPTION","ToolRecommendationSchema","v","SkillRecommendationSchema","StepRecommendationSchema","PartialToolRecommendationSchema","PartialStepRecommendationSchema","SequentialThinkingSchema","SEQUENTIAL_THINKING_TOOL","JsonRpcRequestSchema","EdgeKindSchema","EdgeSchema"],"mappings":";AAyCA,MAAMA,mBAAmB,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;yHA0G+F,CAAC;AA0BnH,MAAMC,2BAA2BC,0BAAAA,MAAQ,CAAC;IAChD,WAAWA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAC5C,YAAYA,0BAAAA,IAAM,CACjBA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAEf,WAAWA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC,OAAOA,0BAAAA,WAAa,CAAC;IAC/D,UAAUA,0BAAAA,QAAU,CACnBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAElC,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,KAAO,CAAC;QAACA,0BAAAA,MAAQ;QAAIA,0BAAAA,MAAQ;QAAIA,0BAAAA,OAAS;QAAIA,yBAAAA,CAAAA,OAAM;KAAG,IAC5EA,0BAAAA,WAAa,CAAC;IAGhB,cAAcA,0BAAAA,QAAU,CACvBA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;AAE5C;AA4BO,MAAMC,4BAA4BD,0BAAAA,MAAQ,CAAC;IACjD,YAAYA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAC7C,YAAYA,0BAAAA,QAAU,CACrBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAGhB,WAAWA,0BAAAA,QAAU,CACpBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,SAAW,CAAC,OACZA,0BAAAA,WAAa,CAAC;IAGhB,UAAUA,0BAAAA,QAAU,CACnBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAElC,cAAcA,0BAAAA,QAAU,CACvBA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;IAE3C,eAAeA,0BAAAA,QAAU,CACxBA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAChBA,0BAAAA,WAAa,CAAC;IAGhB,gBAAgBA,0BAAAA,QAAU,CACzBA,0BAAAA,IAAM,CAACA,0BAAAA,OAAS,IAAIA,0BAAAA,WAAa,CAAC;AAEpC;AAwBO,MAAME,2BAA2BF,0BAAAA,MAAQ,CAAC;IAChD,kBAAkBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IACnD,mBAAmBA,0BAAAA,IAAM,CACxBA,0BAAAA,KAAO,CAACD,2BACRC,0BAAAA,WAAa,CAAC;IAEf,oBAAoBA,0BAAAA,QAAU,CAC7BA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACC,4BAA4BD,0BAAAA,WAAa,CAAC;IAE1D,kBAAkBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IACnD,sBAAsBA,0BAAAA,QAAU,CAC/BA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;AAE5C;AAoCO,MAAMG,kCAAkCH,0BAAAA,MAAQ,CAAC;IACvD,WAAWA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAC5C,WAAWA,0BAAAA,QAAU,CACpBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,SAAW,CAAC,OACZA,0BAAAA,WAAa,CAAC;IAGhB,YAAYA,0BAAAA,QAAU,CACrBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAGhB,UAAUA,0BAAAA,QAAU,CACnBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAElC,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,KAAO,CAAC;QAACA,0BAAAA,MAAQ;QAAIA,0BAAAA,MAAQ;QAAIA,0BAAAA,OAAS;QAAIA,yBAAAA,CAAAA,OAAM;KAAG,IAC5EA,0BAAAA,WAAa,CAAC;IAGhB,cAAcA,0BAAAA,QAAU,CACvBA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;AAE5C;AAuCO,MAAMI,kCAAkCJ,0BAAAA,MAAQ,CAAC;IACvD,kBAAkBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IACnD,mBAAmBA,0BAAAA,IAAM,CACxBA,0BAAAA,KAAO,CAACG,kCACRH,0BAAAA,WAAa,CAAC;IAEf,oBAAoBA,0BAAAA,QAAU,CAC7BA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACC,4BAA4BD,0BAAAA,WAAa,CAAC;IAE1D,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAElC,sBAAsBA,0BAAAA,QAAU,CAC/BA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;AAE5C;AA4CO,MAAMK,2BAA2BL,0BAAAA,MAAQ,CAAC;IAChD,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAChBA,0BAAAA,WAAa,CACZ;IAIH,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAChBA,0BAAAA,WAAa,CAAC;IAGhB,SAASA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAC1C,IAAIA,0BAAAA,QAAU,CACbA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,SAAW,CAAC,KACZA,0BAAAA,WAAa,CAAC;IAGhB,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CACLA,0BAAAA,OAAS,IACTA,0BAAAA,WAAa,CACZ;IAIH,gBAAgBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,QAAU,CAAC,IAAIA,0BAAAA,WAAa,CAAC;IAChE,gBAAgBA,0BAAAA,IAAM,CACrBA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAEf,aAAaA,0BAAAA,QAAU,CACtBA,0BAAAA,IAAM,CAACA,0BAAAA,OAAS,IAAIA,0BAAAA,WAAa,CAAC;IAEnC,iBAAiBA,0BAAAA,QAAU,CAC1BA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,QAAU,CAAC,IAAIA,0BAAAA,WAAa,CAAC;IAEjD,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,QAAU,CAAC,IAAIA,0BAAAA,WAAa,CAAC;IAEjD,WAAWA,0BAAAA,QAAU,CACpBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,KAAO,CACN,oBACA,2EAEDA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,SAAW,CAAC,KACZA,0BAAAA,WAAa,CAAC;IAGhB,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CAACA,0BAAAA,OAAS,IAAIA,0BAAAA,WAAa,CAAC;IAEnC,cAAcA,0BAAAA,QAAU,CACvBA,0BAAAA,IAAM,CAACE,0BAA0BF,0BAAAA,WAAa,CAAC;IAEhD,gBAAgBA,0BAAAA,QAAU,CACzBA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACI,kCACRJ,0BAAAA,WAAa,CACZ;IAIH,iBAAiBA,0BAAAA,QAAU,CAC1BA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;IAE3C,cAAcA,0BAAAA,QAAU,CACvBA,0BAAAA,IAAM,CACLA,0BAAAA,QAAU,CAAC;QACV;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;KACA,GACDA,0BAAAA,WAAa,CACZ;IAIH,eAAeA,0BAAAA,QAAU,CACxBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAGhB,YAAYA,0BAAAA,QAAU,CACrBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAGhB,eAAeA,0BAAAA,QAAU,CACxBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,KAAO,CACN,oBACA,+EAEDA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,SAAW,CAAC,KACZA,0BAAAA,WAAa,CAAC;IAGhB,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CACZ;IAIH,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAAC;QAACA,0BAAAA,OAAS,CAAC;QAAIA,0BAAAA,OAAS,CAAC;KAAG,GACpCA,0BAAAA,WAAa,CAAC;IAGhB,mBAAmBA,0BAAAA,QAAU,CAC5BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,QAAU,CAAC,MACtCA,0BAAAA,WAAa,CAAC;IAGhB,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,QAAU,CAAC,MACtCA,0BAAAA,WAAa,CAAC;IAGhB,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,KAAO,CAAC,qBAAqBA,0BAAAA,SAAW,CAAC,OACpEA,0BAAAA,WAAa,CAAC;IAGhB,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAElC,iBAAiBA,0BAAAA,QAAU,CAC1BA,0BAAAA,IAAM,CACLA,0BAAAA,QAAU,CAAC;QAAC;QAAW;QAAY;KAAO,GAC1CA,0BAAAA,WAAa,CAAC;IAGhB,YAAYA,0BAAAA,IAAM,CACjBA,0BAAAA,MAAQ,IACRA,0BAAAA,KAAO,CACN,oBACA,4EAEDA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,SAAW,CAAC,MACZA,0BAAAA,QAAU,CAAC,cAAc,sEACzBA,0BAAAA,WAAa,CACZ;IAGF,aAAaA,0BAAAA,QAAU,CACtBA,0BAAAA,IAAM,CACLA,0BAAAA,OAAS,IACTA,0BAAAA,WAAa,CACZ;IAIH,WAAWA,0BAAAA,QAAU,CACpBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,WAAa,CAAC;IAGhB,gBAAgBA,0BAAAA,QAAU,CACzBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,OAAS,KAC9BA,0BAAAA,WAAa,CAAC;IAGhB,aAAaA,0BAAAA,QAAU,CACtBA,0BAAAA,IAAM,CACLA,0BAAAA,OAAS,IACTA,0BAAAA,WAAa,CAAC;IAGhB,oBAAoBA,0BAAAA,QAAU,CAC7BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,WAAa,CAAC;IAGhB,wBAAwBA,0BAAAA,QAAU,CACjCA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;IAE3C,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,OAAS,IACTA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CACZ;IAIH,oBAAoBA,0BAAAA,QAAU,CAC7BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,KAAO,CACN,oBACA,oFAEDA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,SAAW,CAAC,KACZA,0BAAAA,WAAa,CACZ;AAIJ;AAyBO,MAAMM,2BAAiC;IAC7C,MAAM;IACN,aAAaR;IACb,aAAa,CAAC;AACf;AAuBO,MAAMS,uBAAuBP,0BAAAA,MAAQ,CAAC;IAC5C,SAASA,0BAAAA,IAAM,CACdA,0BAAAA,MAAQ,IACRA,0BAAAA,OAAS,CAAC,QACVA,0BAAAA,WAAa,CAAC;IAEf,QAAQA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC,IAAIA,0BAAAA,WAAa,CAAC;IACzD,QAAQA,0BAAAA,QAAU,CACjBA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAAC;QAACA,0BAAAA,KAAO,CAACA,0BAAAA,OAAS;QAAKA,0BAAAA,MAAQ,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,OAAS;KAAI,GACjEA,0BAAAA,WAAa,CAAC;IAGhB,IAAIA,0BAAAA,QAAU,CACbA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAAC;QAACA,0BAAAA,MAAQ;QAAIA,0BAAAA,MAAQ;QAAIA,yBAAAA,CAAAA,OAAM;KAAG,GAC1CA,0BAAAA,WAAa,CAAC;AAGjB;AAKO,MAAMQ,iBAAiBR,0BAAAA,KAAO,CAAC;IACrCA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;CACV;AAKM,MAAMS,aAAaT,0BAAAA,MAAQ,CAAC;IAClC,IAAIA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC,IAAIA,0BAAAA,SAAW,CAAC;IACnD,MAAMA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC,IAAIA,0BAAAA,SAAW,CAAC;IACrD,IAAIA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC,IAAIA,0BAAAA,SAAW,CAAC;IACnD,MAAMQ;IACN,WAAWR,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC;IAC1C,WAAWA,0BAAAA,MAAQ;IACnB,UAAUA,0BAAAA,QAAU,CAACA,0BAAAA,MAAQ,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,OAAS;AACpD"}
+{"version":3,"file":"schema.js","sources":["../src/schema.ts"],"sourcesContent":["/**\n * Valibot validation schemas for the sequential thinking MCP tool.\n *\n * This module defines the validation schemas used for the sequential thinking tool,\n * including schemas for tool recommendations, skill recommendations, step recommendations,\n * and the main sequential thinking input. All schemas use Valibot for runtime validation\n * and provide detailed descriptions for MCP protocol compatibility.\n *\n * @remarks\n * **Schema Overview:**\n * - `ToolRecommendationSchema` - Validates tool recommendation objects with confidence scores\n * - `SkillRecommendationSchema` - Validates skill recommendation objects\n * - `StepRecommendationSchema` - Validates step coordination structures\n * - `SequentialThinkingSchema` - Main schema for thought input validation\n * - Reasoning enhancement fields: thought_type, quality_score, confidence, hypothesis_id, etc.\n *\n * @example\n * ```typescript\n * import { SequentialThinkingSchema } from './schema.js';\n * import { safeParse } from 'valibot';\n *\n * const result = safeParse(SequentialThinkingSchema, inputData);\n * if (result.success) {\n *   const thought = result.output;\n *   // Process the valid thought\n * } else {\n *   console.error('Validation failed:', result.issues);\n * }\n * ```\n * @module schema\n */\n\nimport * as v from 'valibot';\nimport type { Tool } from './types/tool.js';\nimport type { Edge, EdgeKind } from './core/graph/Edge.js';\n/**\n * Detailed description for the sequential thinking tool.\n *\n * This description is shown to LLMs when they consider using this tool.\n * It explains when to use the tool, its features, parameters, and best practices.\n */\nconst TOOL_DESCRIPTION = `A detailed tool for dynamic and reflective problem-solving through thoughts.\nThis tool helps analyze problems through a flexible thinking process that can adapt and evolve.\nEach thought can build on, question, or revise previous insights as understanding deepens.\n\nIMPORTANT: This server facilitates sequential thinking with MCP tool coordination and skill recommendations. The LLM analyzes available tools and skills to make intelligent recommendations, which are then tracked and organized by this server.\n\nEach invocation records exactly one authored thought and returns. When strategy_hint.action is continue, invoke this tool again with the next thought; do not stop or provide a final answer. terminate permits stopping. The server does not author later thoughts or call itself.\n\nWhen to use this tool:\n- Breaking down complex problems into steps\n- Planning and design with room for revision\n- Analysis that might need course correction\n- Problems where the full scope might not be clear initially\n- Problems that require a multi-step solution\n- Tasks that need to maintain context over multiple steps\n- Situations where irrelevant information needs to be filtered out\n- When you need guidance on which tools to use and in what order\n- When you need guidance on which skills to invoke for specific workflows\n\nKey features:\n- You can adjust total_thoughts up or down as you progress\n- You can question or revise previous thoughts\n- You can add more thoughts even after reaching what seemed like the end\n- You can express uncertainty and explore alternative approaches\n- Not every thought needs to build linearly - you can branch or backtrack\n- Generates a solution hypothesis\n- Verifies the hypothesis based on the Chain of Thought steps\n- Recommends appropriate tools for each step\n- Recommends appropriate skills alongside tools\n- Provides rationale for tool recommendations\n- Suggests tool execution order and parameters\n- Tracks previous recommendations and remaining steps\n\nParameters explained:\n- available_mcp_tools: (Optional) Array of MCP tool names that are available for use (e.g., [\"mcp-omnisearch\", \"mcp-turso-cloud\"])\n- available_skills: (Optional) Array of skill names that are available for use (e.g., [\"commit\", \"review-pr\", \"pdf\"])\n- thought: Your current thinking step, which can include:\n* Regular analytical steps\n* Revisions of previous thoughts\n* Questions about previous decisions\n* Realizations about needing more analysis\n* Changes in approach\n* Hypothesis generation\n* Hypothesis verification\n* Tool recommendations and rationale\n- next_thought_needed: True if you need more thinking, even if at what seemed like the end. Omission defaults to true; the effective next action is in strategy_hint.\n- thought_number: Current number in sequence (can go beyond initial total if needed)\n- total_thoughts: Current estimate of thoughts needed (can be adjusted up/down)\n- is_revision: A boolean indicating if this thought revises previous thinking\n- revises_thought: If is_revision is true, which thought number is being reconsidered\n- branch_from_thought: If branching, which thought number is the branching point\n- branch_id: Identifier for the current branch (if any)\n- needs_more_thoughts: If reaching end but realizing more thoughts needed\n- current_step: Current step recommendation, including:\n* step_description: What needs to be done\n* recommended_tools: (CRITICAL: PLURAL - \"recommended_tools\" with an 's') Tools recommended for this step - MUST be an array.\n* recommended_skills: (CRITICAL: PLURAL - \"recommended_skills\" with an 's') Skills recommended for this step (optional) - MUST be an array.\n* expected_outcome: What to expect from this step\n* next_step_conditions: Conditions to consider for the next step\n- previous_steps: Steps already recommended (each step MUST use \"recommended_tools\" PLURAL)\n- remaining_steps: High-level descriptions of upcoming steps\n\nReasoning Enhancement Parameters:\n- thought_type: Thought purpose: 'regular' (default), 'hypothesis', 'verification', 'critique', 'synthesis', 'meta', 'tool_call' (requires toolInterleave flag), 'tool_observation' (requires toolInterleave flag), 'assumption' (requires newThoughtTypes flag), 'decomposition' (requires newThoughtTypes flag), 'backtrack' (requires newThoughtTypes flag; logically retracts the thought referenced by backtrack_target - the target remains in history but is excluded from quality calculations)\n- quality_score: Self-assessed quality of this thought (0-1)\n- confidence: Confidence in this thought's correctness (0-1)\n- hypothesis_id: Links hypothesis to verification (alphanumeric, hyphens, underscores)\n- verification_target: For 'verification'/'critique', the thought_number of a uniquely retained identity. Branch/revision number reuse is legal, but ambiguous numeric targets fail. Result-bearing verification requires a non-retracted target with confidence.\n- verification_result: Optional exact outcome label (0 = incorrect, 1 = correct) for a verification_target; only has outcome semantics on thought_type='verification'\n- synthesis_sources: For 'synthesis' type, the thought_numbers being combined\n- merge_from_thoughts: Thought numbers from other branches merged (graph reasoning)\n- merge_branch_ids: Branch IDs merged into current context\n- meta_observation: Observation about reasoning process (with thought_type 'meta')\n- reasoning_depth: How deep to reason: 'shallow' (quick), 'moderate' (default), 'deep' (thorough)\n- session_id: Required unique identifier that scopes thought history, branches, and statistics to an explicit session. Format: alphanumeric, hyphens, underscores, 1-100 chars; the retired value __global__ is rejected.\n- reset_state: (Optional) Authorized fresh-chain replacement for session_id, deleting its durable data and preserving its former owner. SESSION_EXPIRED requires this explicit recovery or a new session_id; invalid or failed reset does not reopen the expired scope.\n\nResponse Enrichment:\n- When reasoning fields are set, response includes confidence_signals (depth, revision/branch count, type distribution, avg confidence, structural_quality, quality_components) and reasoning_stats (hypothesis tracking)\n- confidence_signals.structural_quality: Composite 0-1 score — weighted geometric mean of type_diversity (0.3), verification_coverage (0.3), depth_efficiency (0.2), confidence_stability (0.2). Weights: type_diversity=0.3, verification_coverage=0.3, depth_efficiency=0.2, confidence_stability=0.2 (weighted geometric mean). All components floored at 0.01 to prevent collapse.\n- confidence_signals.quality_components: Individual metrics — type_diversity (Shannon entropy/log₂(6)), verification_coverage (verified/total hypotheses, 1.0 if none), depth_efficiency (max(chain_depth, branch_count+1)/total, branching rewarded), confidence_stability (1 - stddev(confidence), default 0.5, null when fewer than 2 confidence values)\n- confidence_signals.graph_signals: Present when the active thought graph has at least one edge: node/edge/root/leaf/component counts, longest_path (null on cycle), max in/out degree, edge_kind_counts, branching_factor, relational_density.\n- graph_context: Current thought's root_distance, ancestor_count, inbound/outbound neighbours (thought_number + edge kind + optional branch_id). Omitted when the thought has no edges.\n- reasoning_hints: (Conditional) Array of actionable hint strings from cross-thought pattern analysis. Only warning-severity patterns produce hints. Max 3 hints per response, with 3-thought cooldown per pattern per session. Hints are prioritized: refuted_hypothesis_dependency > confidence_drift > unverified_hypothesis > unaddressed_critique > no_alternatives_explored > consecutive_without_verification, so the most actionable patterns fill the cap first. Present only when warnings are detected.\n- Detected patterns (internal, not in response): consecutive_without_verification (3+ regular thoughts without verification), unverified_hypothesis (hypothesis without verification within 3 thoughts after it), no_alternatives_explored (5+ thoughts with no critique/branches), monotonic_type (5+ consecutive same type), confidence_drift (3+ consecutive decreasing confidence), healthy_verification (hypothesis verified within 3 thoughts — info only), refuted_hypothesis_dependency (thoughts deriving/merging/branching from a hypothesis whose latest verification_result is 0, not revised/backtracked), unaddressed_critique (critiqued thought not revised or later verified within 3 thoughts)\nYou should:\n1. Start with an initial estimate of needed thoughts, but be ready to adjust\n2. Feel free to question or revise previous thoughts\n3. Don't hesitate to add more thoughts if needed, even at the \"end\"\n4. Express uncertainty when present\n5. Mark thoughts that revise previous thinking or branch into new paths\n6. Ignore information that is irrelevant to the current step\n7. Generate a solution hypothesis when appropriate\n8. Verify the hypothesis based on the Chain of Thought steps\n9. Consider available tools that could help with the current step\n10. Provide clear rationale for tool recommendations\n11. Suggest specific tool parameters when appropriate\n12. Consider alternative tools for each step\n13. Track progress through the recommended steps\n14. Consider available skills that provide workflows for complex tasks\n15. Coordinate skill invocation with tool recommendations (skills may call tools)\n16. Provide a single, ideally correct answer as the final output\n17. Only set next_thought_needed to false when truly done and a satisfactory answer is reached\n18. Classify your reasoning steps using thought_type for better analytics and self-awareness\n19. Use hypothesis → verification chains to test solutions before committing\n20. Self-assess quality and confidence to track reasoning reliability\n21. Use merge_from_thoughts to combine insights from multiple reasoning branches\n22. Use session_id to isolate independent reasoning chains from each other\n23. Use reset_state: true when starting a completely new analysis to avoid statistical contamination from previous chains`;\n\n/**\n * Valibot schema for validating tool recommendation objects.\n *\n * Validates that a tool recommendation has:\n * - A tool name (string)\n * - A confidence score between 0 and 1\n * - A rationale explaining the recommendation\n * - A priority number for ordering\n * - Optional suggested input parameters\n * - Optional alternative tools\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { ToolRecommendationSchema } from './schema.js';\n *\n * const result = safeParse(ToolRecommendationSchema, {\n *   tool_name: 'mcp__tavily-mcp__tavily-search',\n *   confidence: 0.9,\n *   rationale: 'Best for web search',\n *   priority: 1\n * });\n * ```\n */\nexport const ToolRecommendationSchema = v.object({\n\ttool_name: v.pipe(v.string(), v.description('Name of the tool being recommended')),\n\tconfidence: v.pipe(\n\t\tv.number(),\n\t\tv.minValue(0),\n\t\tv.maxValue(1),\n\t\tv.description('0-1 indicating confidence in recommendation')\n\t),\n\trationale: v.pipe(v.string(), v.maxLength(2000), v.description('Why this tool is recommended')),\n\tpriority: v.optional(\n\t\tv.pipe(v.number(), v.description('Order in the recommendation sequence (default: 999)'))\n\t),\n\tsuggested_inputs: v.optional(\n\t\tv.pipe(\n\t\t\tv.record(v.string(), v.union([v.string(), v.number(), v.boolean(), v.null()])),\n\t\t\tv.description('Optional suggested parameters (flat key-value pairs only)')\n\t\t)\n\t),\n\talternatives: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Alternative tools that could be used'))\n\t),\n});\n\n/**\n * Valibot schema for validating skill recommendation objects.\n *\n * Validates that a skill recommendation has:\n * - A skill name (string)\n * - A confidence score between 0 and 1\n * - A rationale explaining the recommendation\n * - A priority number for ordering\n * - Optional alternative skills\n * - Optional allowed tools list\n * - Optional user invocable flag\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { SkillRecommendationSchema } from './schema.js';\n *\n * const result = safeParse(SkillRecommendationSchema, {\n *   skill_name: 'commit',\n *   confidence: 0.95,\n *   rationale: 'Handles git commit workflow',\n *   priority: 1,\n *   user_invocable: true\n * });\n * ```\n */\nexport const SkillRecommendationSchema = v.object({\n\tskill_name: v.pipe(v.string(), v.description('Name of the skill being recommended')),\n\tconfidence: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.minValue(0),\n\t\t\tv.maxValue(1),\n\t\t\tv.description('0-1 indicating confidence in recommendation (default: 0.5)')\n\t\t)\n\t),\n\trationale: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.maxLength(2000),\n\t\t\tv.description('Why this skill is recommended (default: empty string)')\n\t\t)\n\t),\n\tpriority: v.optional(\n\t\tv.pipe(v.number(), v.description('Order in the recommendation sequence (default: 999)'))\n\t),\n\talternatives: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Alternative skills that could be used'))\n\t),\n\tallowed_tools: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.string()),\n\t\t\tv.description('Tools this skill is allowed to use (from skill frontmatter)')\n\t\t)\n\t),\n\tuser_invocable: v.optional(\n\t\tv.pipe(v.boolean(), v.description('Whether this skill can be user-invoked'))\n\t),\n});\n\n/**\n * Valibot schema for validating step recommendation objects.\n *\n * Validates that a step recommendation has:\n * - A step description\n * - An array of recommended tools\n * - An optional array of recommended skills\n * - An expected outcome\n * - Optional conditions for the next step\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { StepRecommendationSchema } from './schema.js';\n *\n * const result = safeParse(StepRecommendationSchema, {\n *   step_description: 'Search for TypeScript files',\n *   recommended_tools: [{ ... }],\n *   expected_outcome: 'List of all TypeScript files'\n * });\n * ```\n */\nexport const StepRecommendationSchema = v.object({\n\tstep_description: v.pipe(v.string(), v.description('What needs to be done')),\n\trecommended_tools: v.pipe(\n\t\tv.array(ToolRecommendationSchema),\n\t\tv.description('Tools recommended for this step')\n\t),\n\trecommended_skills: v.optional(\n\t\tv.pipe(v.array(SkillRecommendationSchema), v.description('Skills recommended for this step'))\n\t),\n\texpected_outcome: v.pipe(v.string(), v.description('What to expect from this step')),\n\tnext_step_conditions: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Conditions to consider for the next step'))\n\t),\n});\n\n/**\n * Valibot schema for validating partial tool recommendation objects.\n *\n * This is a lenient version of ToolRecommendationSchema used for previous_steps,\n * where LLMs naturally provide partial/skeletal data. Only tool_name and rationale\n * are required, while confidence and priority are optional with default values.\n *\n * Validates that a partial tool recommendation has:\n * - A tool name (required)\n * - A rationale explaining the recommendation (required)\n * - An optional confidence score (defaults to 0.5)\n * - An optional priority number (defaults to 999)\n * - Optional suggested input parameters\n * - Optional alternative tools\n *\n * @remarks\n * **Design Rationale:**\n * LLMs tend to provide complete data for current_step but only partial data\n * for previous_steps (historical context). This schema accommodates that natural\n * LLM behavior while maintaining data integrity through sensible defaults.\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { PartialToolRecommendationSchema } from './schema.js';\n *\n * // Minimal valid input (LLM often generates this for previous_steps)\n * const result = safeParse(PartialToolRecommendationSchema, {\n *   tool_name: 'Read',\n *   rationale: 'Read the file'\n * });\n * // confidence and priority will be filled in by the normalizer\n * ```\n */\nexport const PartialToolRecommendationSchema = v.object({\n\ttool_name: v.pipe(v.string(), v.description('Name of the tool being recommended')),\n\trationale: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.maxLength(2000),\n\t\t\tv.description('Why this tool is recommended (default: empty string)')\n\t\t)\n\t),\n\tconfidence: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.minValue(0),\n\t\t\tv.maxValue(1),\n\t\t\tv.description('0-1 indicating confidence in recommendation (default: 0.5)')\n\t\t)\n\t),\n\tpriority: v.optional(\n\t\tv.pipe(v.number(), v.description('Order in the recommendation sequence (default: 999)'))\n\t),\n\tsuggested_inputs: v.optional(\n\t\tv.pipe(\n\t\t\tv.record(v.string(), v.union([v.string(), v.number(), v.boolean(), v.null()])),\n\t\t\tv.description('Optional suggested parameters (flat key-value pairs only)')\n\t\t)\n\t),\n\talternatives: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Alternative tools that could be used'))\n\t),\n});\n\n/**\n * Valibot schema for validating partial step recommendation objects.\n *\n * This is a lenient version of StepRecommendationSchema used for previous_steps,\n * where LLMs naturally provide partial/skeletal data. Only step_description is\n * strictly required, while expected_outcome and tool recommendation fields are\n * optional with default values.\n *\n * Validates that a partial step recommendation has:\n * - A step description (required)\n * - An array of recommended tools (with optional confidence/priority)\n * - An optional array of recommended skills\n * - An optional expected outcome (defaults to empty string)\n * - Optional conditions for the next step\n *\n * @remarks\n * **Design Rationale:**\n * LLMs provide complete, detailed data for current_step but only brief summaries\n * for previous_steps. This schema allows the natural LLM behavior while the\n * InputNormalizer fills in sensible defaults for missing fields.\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { PartialStepRecommendationSchema } from './schema.js';\n *\n * // Minimal valid input (LLM often generates this for previous_steps)\n * const result = safeParse(PartialStepRecommendationSchema, {\n *   step_description: 'Read the file',\n *   recommended_tools: [{\n *     tool_name: 'Read',\n *     rationale: 'Read the file'\n *   }]\n * });\n * // confidence, priority, and expected_outcome will be filled in by normalizer\n * ```\n */\nexport const PartialStepRecommendationSchema = v.object({\n\tstep_description: v.pipe(v.string(), v.description('What needs to be done')),\n\trecommended_tools: v.pipe(\n\t\tv.array(PartialToolRecommendationSchema),\n\t\tv.description('Tools recommended for this step')\n\t),\n\trecommended_skills: v.optional(\n\t\tv.pipe(v.array(SkillRecommendationSchema), v.description('Skills recommended for this step'))\n\t),\n\texpected_outcome: v.optional(\n\t\tv.pipe(v.string(), v.description('What to expect from this step (default: empty string)'))\n\t),\n\tnext_step_conditions: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Conditions to consider for the next step'))\n\t),\n});\n\n/**\n * Main Valibot schema for validating sequential thinking tool input.\n *\n * This is the primary schema used for the sequential thinking MCP tool.\n * It validates all thought data including:\n * - Optional available tools and skills arrays\n * - The thought content (required)\n * - Thought numbering (thought_number, total_thoughts)\n * - Revision and branching metadata\n * - Current, previous, and remaining step recommendations\n *\n * @remarks\n * **Validation Rules:**\n * - `thought_number` must be >= 1\n * - `total_thoughts` must be >= 1\n * - `branch_id` must be 1-50 characters, alphanumeric/hyphens/underscores only\n * - `confidence` values must be between 0 and 1\n * - `thought_type` must be one of: regular, hypothesis, verification, critique, synthesis, meta\n * - `quality_score` and `confidence` must be between 0 and 1\n * - `hypothesis_id` must be 1-50 characters, alphanumeric/hyphens/underscores only\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { SequentialThinkingSchema } from './schema.js';\n *\n * const result = safeParse(SequentialThinkingSchema, {\n *   thought: 'I need to analyze the problem',\n *   thought_number: 1,\n *   total_thoughts: 5,\n *   session_id: 'analysis-task',\n *   next_thought_needed: true,\n *   available_mcp_tools: ['Read', 'Write', 'Grep']\n * });\n *\n * if (result.success) {\n *   console.log('Valid thought:', result.output);\n * } else {\n *   console.error('Validation errors:', result.issues);\n * }\n * ```\n */\nexport const SequentialThinkingSchema = v.object({\n\tavailable_mcp_tools: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.string()),\n\t\t\tv.description(\n\t\t\t\t'Array of MCP tool names available for use (e.g., [\"mcp-omnisearch\", \"mcp-turso-cloud\"])'\n\t\t\t)\n\t\t)\n\t),\n\tavailable_skills: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.string()),\n\t\t\tv.description('Array of skill names available for use (e.g., [\"commit\", \"review-pr\", \"pdf\"])')\n\t\t)\n\t),\n\tthought: v.pipe(v.string(), v.description('Your current thinking step')),\n\tid: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.minLength(1),\n\t\t\tv.maxLength(30),\n\t\t\tv.description('Unique identifier for this thought. Auto-generated if not provided.')\n\t\t)\n\t),\n\tnext_thought_needed: v.optional(\n\t\tv.pipe(\n\t\t\tv.boolean(),\n\t\t\tv.description(\n\t\t\t\t'Omission defaults to true; the effective next action is returned in strategy_hint.'\n\t\t\t)\n\t\t)\n\t),\n\tthought_number: v.pipe(v.number(), v.minValue(1), v.description('Current thought number')),\n\ttotal_thoughts: v.pipe(\n\t\tv.number(),\n\t\tv.minValue(1),\n\t\tv.description('Estimated total thoughts needed')\n\t),\n\tis_revision: v.optional(\n\t\tv.pipe(v.boolean(), v.description('Whether this revises previous thinking'))\n\t),\n\trevises_thought: v.optional(\n\t\tv.pipe(v.number(), v.minValue(1), v.description('Which thought is being reconsidered'))\n\t),\n\tbranch_from_thought: v.optional(\n\t\tv.pipe(v.number(), v.minValue(1), v.description('Branching point thought number'))\n\t),\n\tbranch_id: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.regex(\n\t\t\t\t/^[a-zA-Z0-9_-]+$/,\n\t\t\t\t'Branch ID must contain only letters, numbers, hyphens, and underscores'\n\t\t\t),\n\t\t\tv.minLength(1),\n\t\t\tv.maxLength(50),\n\t\t\tv.description('Branch identifier (alphanumeric, hyphens, underscores only, max 50 chars)')\n\t\t)\n\t),\n\tneeds_more_thoughts: v.optional(\n\t\tv.pipe(v.boolean(), v.description('If more thoughts are needed'))\n\t),\n\tcurrent_step: v.optional(\n\t\tv.pipe(StepRecommendationSchema, v.description('Current step recommendation'))\n\t),\n\tprevious_steps: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(PartialStepRecommendationSchema),\n\t\t\tv.description(\n\t\t\t\t'Steps already recommended (lenient schema - allows partial data with defaults)'\n\t\t\t)\n\t\t)\n\t),\n\tremaining_steps: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('High-level descriptions of upcoming steps'))\n\t),\n\tthought_type: v.optional(\n\t\tv.pipe(\n\t\t\tv.picklist([\n\t\t\t\t'regular',\n\t\t\t\t'hypothesis',\n\t\t\t\t'verification',\n\t\t\t\t'critique',\n\t\t\t\t'synthesis',\n\t\t\t\t'meta',\n\t\t\t\t'tool_call',\n\t\t\t\t'tool_observation',\n\t\t\t\t'assumption',\n\t\t\t\t'decomposition',\n\t\t\t\t'backtrack',\n\t\t\t]),\n\t\t\tv.description(\n\t\t\t\t'Classified purpose: regular (default), hypothesis, verification, critique, synthesis, meta, tool_call (requires toolInterleave), tool_observation (requires toolInterleave), assumption (requires newThoughtTypes), decomposition (requires newThoughtTypes), backtrack (requires newThoughtTypes)'\n\t\t\t)\n\t\t)\n\t),\n\tquality_score: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.minValue(0),\n\t\t\tv.maxValue(1),\n\t\t\tv.description('Self-assessed quality score (0-1)')\n\t\t)\n\t),\n\tconfidence: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.minValue(0),\n\t\t\tv.maxValue(1),\n\t\t\tv.description('Explicit confidence in correctness (0-1)')\n\t\t)\n\t),\n\thypothesis_id: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.regex(\n\t\t\t\t/^[a-zA-Z0-9_-]+$/,\n\t\t\t\t'Hypothesis ID must contain only letters, numbers, hyphens, and underscores'\n\t\t\t),\n\t\t\tv.minLength(1),\n\t\t\tv.maxLength(50),\n\t\t\tv.description('Identifier linking hypothesis to verification thoughts')\n\t\t)\n\t),\n\tverification_target: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.minValue(1),\n\t\t\tv.description(\n\t\t\t\t'Uniquely retained thought number being verified or critiqued; ambiguous numeric targets fail even though branch/revision number reuse is legal'\n\t\t\t)\n\t\t)\n\t),\n\tverification_result: v.optional(\n\t\tv.pipe(\n\t\t\tv.union([v.literal(0), v.literal(1)]),\n\t\t\tv.description('Exact verification outcome label: 0 for incorrect, 1 for correct')\n\t\t)\n\t),\n\tsynthesis_sources: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.pipe(v.number(), v.minValue(1))),\n\t\t\tv.description('Thought numbers being synthesized')\n\t\t)\n\t),\n\tmerge_from_thoughts: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.pipe(v.number(), v.minValue(1))),\n\t\t\tv.description('Thought numbers from other branches being merged (DAG)')\n\t\t)\n\t),\n\tmerge_branch_ids: v.optional(\n\t\tv.pipe(\n\t\t\tv.array(v.pipe(v.string(), v.regex(/^[a-zA-Z0-9_-]+$/), v.maxLength(50))),\n\t\t\tv.description('Branch IDs being merged into current context')\n\t\t)\n\t),\n\tmeta_observation: v.optional(\n\t\tv.pipe(v.string(), v.description('Metacognitive observation about reasoning process'))\n\t),\n\treasoning_depth: v.optional(\n\t\tv.pipe(\n\t\t\tv.picklist(['shallow', 'moderate', 'deep']),\n\t\t\tv.description('Effort signal: how deep reasoning should go')\n\t\t)\n\t),\n\tsession_id: v.pipe(\n\t\tv.string(),\n\t\tv.regex(\n\t\t\t/^[a-zA-Z0-9_-]+$/,\n\t\t\t'Session ID must contain only letters, numbers, hyphens, and underscores'\n\t\t),\n\t\tv.minLength(1),\n\t\tv.maxLength(100),\n\t\tv.notValue('__global__', \"Session ID '__global__' is retired; use an explicit named session\"),\n\t\tv.description(\n\t\t\t'Required named session for state isolation. SESSION_EXPIRED after runtime eviction requires an authorized reset_state fresh chain or a new session_id; ordinary continuation cannot recreate it.'\n\t\t)\n\t),\n\treset_state: v.optional(\n\t\tv.pipe(\n\t\t\tv.boolean(),\n\t\t\tv.description(\n\t\t\t\t'Authorized fresh-chain replacement, deleting target-session durable data and preserving its former owner. Recovers SESSION_EXPIRED only on successful reset; invalid or failed reset does not reopen it.'\n\t\t\t)\n\t\t)\n\t),\n\ttool_name: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.minLength(1),\n\t\t\tv.description('Name of the tool being invoked (for tool_call thoughts)')\n\t\t)\n\t),\n\ttool_arguments: v.optional(\n\t\tv.pipe(\n\t\t\tv.record(v.string(), v.unknown()),\n\t\t\tv.description('Arguments passed to the tool (for tool_call thoughts)')\n\t\t)\n\t),\n\ttool_result: v.optional(\n\t\tv.pipe(\n\t\t\tv.unknown(),\n\t\t\tv.description('Result returned by the tool (for tool_observation thoughts)')\n\t\t)\n\t),\n\tcontinuation_token: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.minLength(1),\n\t\t\tv.description('Token for resuming long-running tool invocations')\n\t\t)\n\t),\n\tdecomposition_children: v.optional(\n\t\tv.pipe(v.array(v.string()), v.description('Child thought IDs produced by decomposition'))\n\t),\n\tbacktrack_target: v.optional(\n\t\tv.pipe(\n\t\t\tv.number(),\n\t\t\tv.integer(),\n\t\t\tv.minValue(1),\n\t\t\tv.description(\n\t\t\t\t'Thought number to backtrack to. When the parent thought has thought_type=backtrack, this thought is logically retracted: it remains in history but is excluded from quality signals and reasoning stats.'\n\t\t\t)\n\t\t)\n\t),\n\tregister_branch_id: v.optional(\n\t\tv.pipe(\n\t\t\tv.string(),\n\t\t\tv.regex(\n\t\t\t\t/^[a-zA-Z0-9_-]+$/,\n\t\t\t\t'register_branch_id must contain only letters, numbers, hyphens, and underscores'\n\t\t\t),\n\t\t\tv.minLength(1),\n\t\t\tv.maxLength(50),\n\t\t\tv.description(\n\t\t\t\t'Pre-declares a branch ID for this session before any thoughts reference it. Useful so that subsequent thoughts using merge_branch_ids can target a branch that has not yet received any thoughts.'\n\t\t\t)\n\t\t)\n\t),\n});\n\n/** Inferred output type of the sequential thinking schema (string IDs, no branded types). */\nexport type SchemaOutput = v.InferOutput<typeof SequentialThinkingSchema>;\n\n/**\n * The sequential thinking tool definition for MCP registration.\n *\n * This object defines the tool that is registered with the MCP server.\n * The inputSchema is left empty as the schema is handled by tmcp\n * when registering the tool using the Valibot adapter.\n *\n * @example\n * ```typescript\n * import { SEQUENTIAL_THINKING_TOOL } from './schema.js';\n * import { McpServer } from 'tmcp';\n *\n * const server = new McpServer({ name: 'my-server', version: '1.0.0' });\n * server.tool({\n *   name: SEQUENTIAL_THINKING_TOOL.name,\n *   description: SEQUENTIAL_THINKING_TOOL.description,\n *   schema: SequentialThinkingSchema\n * }, handler);\n * ```\n */\nexport const SEQUENTIAL_THINKING_TOOL: Tool = {\n\tname: 'sequentialthinking_tools',\n\tdescription: TOOL_DESCRIPTION,\n\tinputSchema: {}, // Schema is handled by tmcp when registering the tool\n};\n\n/**\n * Valibot schema for validating JSON-RPC 2.0 request messages.\n *\n * Validates that a JSON-RPC request has:\n * - A jsonrpc version (must be \"2.0\")\n * - A method name (string)\n * - Optional params (object or array)\n * - Optional id (string, number, or null for notifications)\n *\n * @example\n * ```typescript\n * import { safeParse } from 'valibot';\n * import { JsonRpcRequestSchema } from './schema.js';\n *\n * const result = safeParse(JsonRpcRequestSchema, {\n *   jsonrpc: '2.0',\n *   method: 'tools/list',\n *   id: 1\n * });\n * ```\n */\nexport const JsonRpcRequestSchema = v.object({\n\tjsonrpc: v.pipe(\n\t\tv.string(),\n\t\tv.literal('2.0'),\n\t\tv.description('JSON-RPC protocol version (must be \"2.0\")')\n\t),\n\tmethod: v.pipe(v.string(), v.minLength(1), v.description('Method name to invoke')),\n\tparams: v.optional(\n\t\tv.pipe(\n\t\t\tv.union([v.array(v.unknown()), v.record(v.string(), v.unknown())]),\n\t\t\tv.description('Method parameters (object or array)')\n\t\t)\n\t),\n\tid: v.optional(\n\t\tv.pipe(\n\t\t\tv.union([v.string(), v.number(), v.null()]),\n\t\t\tv.description('Request ID (omit for notifications)')\n\t\t)\n\t),\n});\n\n/**\n * Schema for {@link EdgeKind} — the semantic relationship between two thoughts.\n */\nexport const EdgeKindSchema = v.union([\n\tv.literal('sequence'),\n\tv.literal('branch'),\n\tv.literal('merge'),\n\tv.literal('verifies'),\n\tv.literal('critiques'),\n\tv.literal('derives_from'),\n\tv.literal('tool_invocation'),\n\tv.literal('revises'),\n]) satisfies v.GenericSchema<EdgeKind>;\n\n/**\n * Schema for {@link Edge} — a directed edge in the thought DAG.\n */\nexport const EdgeSchema = v.object({\n\tid: v.pipe(v.string(), v.minLength(1), v.maxLength(30)),\n\tfrom: v.pipe(v.string(), v.minLength(1), v.maxLength(30)),\n\tto: v.pipe(v.string(), v.minLength(1), v.maxLength(30)),\n\tkind: EdgeKindSchema,\n\tsessionId: v.pipe(v.string(), v.minLength(1)),\n\tcreatedAt: v.number(),\n\tmetadata: v.optional(v.record(v.string(), v.unknown())),\n}) satisfies v.GenericSchema<\n\tOmit<Edge, 'id' | 'from' | 'to' | 'sessionId'> & {\n\t\tid: string;\n\t\tfrom: string;\n\t\tto: string;\n\t\tsessionId: string;\n\t}\n>;\n"],"names":["TOOL_DESCRIPTION","ToolRecommendationSchema","v","SkillRecommendationSchema","StepRecommendationSchema","PartialToolRecommendationSchema","PartialStepRecommendationSchema","SequentialThinkingSchema","SEQUENTIAL_THINKING_TOOL","JsonRpcRequestSchema","EdgeKindSchema","EdgeSchema"],"mappings":";AAyCA,MAAMA,mBAAmB,CAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;yHA4G+F,CAAC;AA0BnH,MAAMC,2BAA2BC,0BAAAA,MAAQ,CAAC;IAChD,WAAWA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAC5C,YAAYA,0BAAAA,IAAM,CACjBA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAEf,WAAWA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC,OAAOA,0BAAAA,WAAa,CAAC;IAC/D,UAAUA,0BAAAA,QAAU,CACnBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAElC,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,KAAO,CAAC;QAACA,0BAAAA,MAAQ;QAAIA,0BAAAA,MAAQ;QAAIA,0BAAAA,OAAS;QAAIA,yBAAAA,CAAAA,OAAM;KAAG,IAC5EA,0BAAAA,WAAa,CAAC;IAGhB,cAAcA,0BAAAA,QAAU,CACvBA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;AAE5C;AA4BO,MAAMC,4BAA4BD,0BAAAA,MAAQ,CAAC;IACjD,YAAYA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAC7C,YAAYA,0BAAAA,QAAU,CACrBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAGhB,WAAWA,0BAAAA,QAAU,CACpBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,SAAW,CAAC,OACZA,0BAAAA,WAAa,CAAC;IAGhB,UAAUA,0BAAAA,QAAU,CACnBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAElC,cAAcA,0BAAAA,QAAU,CACvBA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;IAE3C,eAAeA,0BAAAA,QAAU,CACxBA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAChBA,0BAAAA,WAAa,CAAC;IAGhB,gBAAgBA,0BAAAA,QAAU,CACzBA,0BAAAA,IAAM,CAACA,0BAAAA,OAAS,IAAIA,0BAAAA,WAAa,CAAC;AAEpC;AAwBO,MAAME,2BAA2BF,0BAAAA,MAAQ,CAAC;IAChD,kBAAkBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IACnD,mBAAmBA,0BAAAA,IAAM,CACxBA,0BAAAA,KAAO,CAACD,2BACRC,0BAAAA,WAAa,CAAC;IAEf,oBAAoBA,0BAAAA,QAAU,CAC7BA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACC,4BAA4BD,0BAAAA,WAAa,CAAC;IAE1D,kBAAkBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IACnD,sBAAsBA,0BAAAA,QAAU,CAC/BA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;AAE5C;AAoCO,MAAMG,kCAAkCH,0BAAAA,MAAQ,CAAC;IACvD,WAAWA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAC5C,WAAWA,0BAAAA,QAAU,CACpBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,SAAW,CAAC,OACZA,0BAAAA,WAAa,CAAC;IAGhB,YAAYA,0BAAAA,QAAU,CACrBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAGhB,UAAUA,0BAAAA,QAAU,CACnBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAElC,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,KAAO,CAAC;QAACA,0BAAAA,MAAQ;QAAIA,0BAAAA,MAAQ;QAAIA,0BAAAA,OAAS;QAAIA,yBAAAA,CAAAA,OAAM;KAAG,IAC5EA,0BAAAA,WAAa,CAAC;IAGhB,cAAcA,0BAAAA,QAAU,CACvBA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;AAE5C;AAuCO,MAAMI,kCAAkCJ,0BAAAA,MAAQ,CAAC;IACvD,kBAAkBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IACnD,mBAAmBA,0BAAAA,IAAM,CACxBA,0BAAAA,KAAO,CAACG,kCACRH,0BAAAA,WAAa,CAAC;IAEf,oBAAoBA,0BAAAA,QAAU,CAC7BA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACC,4BAA4BD,0BAAAA,WAAa,CAAC;IAE1D,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAElC,sBAAsBA,0BAAAA,QAAU,CAC/BA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;AAE5C;AA4CO,MAAMK,2BAA2BL,0BAAAA,MAAQ,CAAC;IAChD,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAChBA,0BAAAA,WAAa,CACZ;IAIH,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAChBA,0BAAAA,WAAa,CAAC;IAGhB,SAASA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAC1C,IAAIA,0BAAAA,QAAU,CACbA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,SAAW,CAAC,KACZA,0BAAAA,WAAa,CAAC;IAGhB,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CACLA,0BAAAA,OAAS,IACTA,0BAAAA,WAAa,CACZ;IAIH,gBAAgBA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,QAAU,CAAC,IAAIA,0BAAAA,WAAa,CAAC;IAChE,gBAAgBA,0BAAAA,IAAM,CACrBA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAEf,aAAaA,0BAAAA,QAAU,CACtBA,0BAAAA,IAAM,CAACA,0BAAAA,OAAS,IAAIA,0BAAAA,WAAa,CAAC;IAEnC,iBAAiBA,0BAAAA,QAAU,CAC1BA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,QAAU,CAAC,IAAIA,0BAAAA,WAAa,CAAC;IAEjD,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,QAAU,CAAC,IAAIA,0BAAAA,WAAa,CAAC;IAEjD,WAAWA,0BAAAA,QAAU,CACpBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,KAAO,CACN,oBACA,2EAEDA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,SAAW,CAAC,KACZA,0BAAAA,WAAa,CAAC;IAGhB,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CAACA,0BAAAA,OAAS,IAAIA,0BAAAA,WAAa,CAAC;IAEnC,cAAcA,0BAAAA,QAAU,CACvBA,0BAAAA,IAAM,CAACE,0BAA0BF,0BAAAA,WAAa,CAAC;IAEhD,gBAAgBA,0BAAAA,QAAU,CACzBA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACI,kCACRJ,0BAAAA,WAAa,CACZ;IAIH,iBAAiBA,0BAAAA,QAAU,CAC1BA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;IAE3C,cAAcA,0BAAAA,QAAU,CACvBA,0BAAAA,IAAM,CACLA,0BAAAA,QAAU,CAAC;QACV;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;QACA;KACA,GACDA,0BAAAA,WAAa,CACZ;IAIH,eAAeA,0BAAAA,QAAU,CACxBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAGhB,YAAYA,0BAAAA,QAAU,CACrBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CAAC;IAGhB,eAAeA,0BAAAA,QAAU,CACxBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,KAAO,CACN,oBACA,+EAEDA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,SAAW,CAAC,KACZA,0BAAAA,WAAa,CAAC;IAGhB,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CACZ;IAIH,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAAC;QAACA,0BAAAA,OAAS,CAAC;QAAIA,0BAAAA,OAAS,CAAC;KAAG,GACpCA,0BAAAA,WAAa,CAAC;IAGhB,mBAAmBA,0BAAAA,QAAU,CAC5BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,QAAU,CAAC,MACtCA,0BAAAA,WAAa,CAAC;IAGhB,qBAAqBA,0BAAAA,QAAU,CAC9BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,QAAU,CAAC,MACtCA,0BAAAA,WAAa,CAAC;IAGhB,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAACA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,KAAO,CAAC,qBAAqBA,0BAAAA,SAAW,CAAC,OACpEA,0BAAAA,WAAa,CAAC;IAGhB,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,WAAa,CAAC;IAElC,iBAAiBA,0BAAAA,QAAU,CAC1BA,0BAAAA,IAAM,CACLA,0BAAAA,QAAU,CAAC;QAAC;QAAW;QAAY;KAAO,GAC1CA,0BAAAA,WAAa,CAAC;IAGhB,YAAYA,0BAAAA,IAAM,CACjBA,0BAAAA,MAAQ,IACRA,0BAAAA,KAAO,CACN,oBACA,4EAEDA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,SAAW,CAAC,MACZA,0BAAAA,QAAU,CAAC,cAAc,sEACzBA,0BAAAA,WAAa,CACZ;IAGF,aAAaA,0BAAAA,QAAU,CACtBA,0BAAAA,IAAM,CACLA,0BAAAA,OAAS,IACTA,0BAAAA,WAAa,CACZ;IAIH,WAAWA,0BAAAA,QAAU,CACpBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,WAAa,CAAC;IAGhB,gBAAgBA,0BAAAA,QAAU,CACzBA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,OAAS,KAC9BA,0BAAAA,WAAa,CAAC;IAGhB,aAAaA,0BAAAA,QAAU,CACtBA,0BAAAA,IAAM,CACLA,0BAAAA,OAAS,IACTA,0BAAAA,WAAa,CAAC;IAGhB,oBAAoBA,0BAAAA,QAAU,CAC7BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,WAAa,CAAC;IAGhB,wBAAwBA,0BAAAA,QAAU,CACjCA,0BAAAA,IAAM,CAACA,0BAAAA,KAAO,CAACA,0BAAAA,MAAQ,KAAKA,0BAAAA,WAAa,CAAC;IAE3C,kBAAkBA,0BAAAA,QAAU,CAC3BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,OAAS,IACTA,0BAAAA,QAAU,CAAC,IACXA,0BAAAA,WAAa,CACZ;IAIH,oBAAoBA,0BAAAA,QAAU,CAC7BA,0BAAAA,IAAM,CACLA,0BAAAA,MAAQ,IACRA,0BAAAA,KAAO,CACN,oBACA,oFAEDA,0BAAAA,SAAW,CAAC,IACZA,0BAAAA,SAAW,CAAC,KACZA,0BAAAA,WAAa,CACZ;AAIJ;AAyBO,MAAMM,2BAAiC;IAC7C,MAAM;IACN,aAAaR;IACb,aAAa,CAAC;AACf;AAuBO,MAAMS,uBAAuBP,0BAAAA,MAAQ,CAAC;IAC5C,SAASA,0BAAAA,IAAM,CACdA,0BAAAA,MAAQ,IACRA,0BAAAA,OAAS,CAAC,QACVA,0BAAAA,WAAa,CAAC;IAEf,QAAQA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC,IAAIA,0BAAAA,WAAa,CAAC;IACzD,QAAQA,0BAAAA,QAAU,CACjBA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAAC;QAACA,0BAAAA,KAAO,CAACA,0BAAAA,OAAS;QAAKA,0BAAAA,MAAQ,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,OAAS;KAAI,GACjEA,0BAAAA,WAAa,CAAC;IAGhB,IAAIA,0BAAAA,QAAU,CACbA,0BAAAA,IAAM,CACLA,0BAAAA,KAAO,CAAC;QAACA,0BAAAA,MAAQ;QAAIA,0BAAAA,MAAQ;QAAIA,yBAAAA,CAAAA,OAAM;KAAG,GAC1CA,0BAAAA,WAAa,CAAC;AAGjB;AAKO,MAAMQ,iBAAiBR,0BAAAA,KAAO,CAAC;IACrCA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;IACVA,0BAAAA,OAAS,CAAC;CACV;AAKM,MAAMS,aAAaT,0BAAAA,MAAQ,CAAC;IAClC,IAAIA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC,IAAIA,0BAAAA,SAAW,CAAC;IACnD,MAAMA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC,IAAIA,0BAAAA,SAAW,CAAC;IACrD,IAAIA,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC,IAAIA,0BAAAA,SAAW,CAAC;IACnD,MAAMQ;IACN,WAAWR,0BAAAA,IAAM,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,SAAW,CAAC;IAC1C,WAAWA,0BAAAA,MAAQ;IACnB,UAAUA,0BAAAA,QAAU,CAACA,0BAAAA,MAAQ,CAACA,0BAAAA,MAAQ,IAAIA,0BAAAA,OAAS;AACpD"}

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@iworkforces/tracelattice",
-	"version": "2.3.0",
+	"version": "2.3.1",
 	"description": "Semantic Sequential Thinking Layer For AI Agents.",
 	"type": "module",
 	"main": "dist/lib.js",
@@ -88,16 +88,16 @@
 		"@eslint/js": "^10.0.1",
 		"@rsbuild/core": "^2.2.11",
 		"@rslib/core": "^1.0.3",
-		"@types/node": "^26.6.3",
-		"@typescript-eslint/eslint-plugin": "^8.71.0",
-		"@typescript-eslint/parser": "^8.71.0",
+		"@types/node": "^26.6.4",
+		"@typescript-eslint/eslint-plugin": "^8.71.1",
+		"@typescript-eslint/parser": "^8.71.1",
 		"@vitest/coverage-v8": "^5.0.3",
 		"better-sqlite3": "13.0.3",
-		"eslint": "^10.11.0",
+		"eslint": "^10.12.0",
 		"globals": "^17.13.0",
 		"prettier": "^3.9.9",
 		"typescript": "npm:@typescript/typescript6@^6.0.2",
-		"typescript-eslint": "^8.71.0",
+		"typescript-eslint": "^8.71.1",
 		"vitest": "^5.0.3"
 	},
 	"allowScripts": {