sequential-thinking
Compare original and translation side by side
🇺🇸
Original
English🇨🇳
Translation
ChineseDEPRECATED — Sonnet 4 and Opus 4 handle structured chain-of-thought natively, including revision, branching, and scope adjustment. This skill no longer provides meaningful uplift over the base model. Retained for reference only.
已弃用 — Sonnet 4和Opus 4原生支持结构化思维链功能,包括修订、分支和范围调整。该技能相比基础模型已无法提供实质性提升,仅保留作为参考。
Sequential Thinking
Sequential Thinking 顺序思维法
Structured, reflective problem-solving methodology that replaces the Sequential Thinking
MCP server's tool with zero-cost instructional prompting.
sequentialthinkingReplaces: (1 tool, ~1,800 tokens/turn saved)
@modelcontextprotocol/server-sequential-thinking这是一种结构化、反思性的问题解决方法论,通过零成本的指令提示替代了Sequential Thinking MCP服务器的工具。
sequentialthinking替代对象:(节省1个工具调用,每轮约1800个token)
@modelcontextprotocol/server-sequential-thinkingQuick Reference
快速参考
| Capability | Old MCP Tool | New Approach |
|---|---|---|
| Step-by-step reasoning | | Follow methodology below |
| Thought revision | | Inline revision protocol |
| Branch exploration | | Branch labeling protocol |
| Dynamic scope adjustment | | Scope reassessment checkpoints |
| Hypothesis verification | | Verify-before-conclude protocol |
| 能力项 | 旧MCP工具实现方式 | 新实现方式 |
|---|---|---|
| 逐步推理 | | 遵循下方方法论 |
| 思维修订 | | 内联修订协议 |
| 分支探索 | | 分支标记协议 |
| 动态范围调整 | | 范围重新评估检查点 |
| 假设验证 | | 验证后再结论协议 |
Prerequisites
前置条件
None. This skill is pure methodology — no CLI tools, APIs, or authentication required.
无。该技能是纯方法论——无需CLI工具、API或身份验证。
Core Methodology
核心方法论
Structured Problem Solving Protocol
结构化问题解决协议
When facing a complex, multi-step problem, follow this protocol. The key behaviors
that the MCP tool enforced mechanically are now expressed as explicit steps.
面对复杂的多步骤问题时,请遵循以下协议。原MCP工具强制实现的关键行为,现在通过明确步骤来体现。
1. Scope Assessment
1. 范围评估
Before diving in, estimate the problem's complexity and declare it explicitly.
"This requires approximately N steps. Here's my decomposition: ..."
Map the problem into 3–7 sub-goals. If you can't decompose it, that's a signal
the problem needs clarification first — ask before proceeding.
开始前,先估算问题复杂度并明确声明:
"该问题大约需要N个步骤。我的分解如下:..."
将问题拆解为3-7个子目标。如果无法拆解,说明问题需要先澄清——请先提问再继续。
2. Numbered Step Execution
2. 分步执行
Work through each step with explicit structure:
- Step N of M — State the sub-goal for this step
- Show the reasoning or work
- State the intermediate conclusion
- Explicitly connect to the next step: "This means for step N+1, we need to..."
Do not skip ahead. Each step must produce a concrete, verifiable intermediate result.
按明确结构完成每个步骤:
- 第N步/共M步 — 声明当前步骤的子目标
- 展示推理过程或工作内容
- 给出中间结论
- 明确关联下一步:"这意味着第N+1步需要..."
不要跳步。每个步骤必须产生具体、可验证的中间结果。
3. Revision Checkpoints
3. 修订检查点
After every 3–4 steps, perform a mandatory self-check:
Checkpoint: Am I still on the right track?
- Do earlier conclusions still hold given what I've learned?
- Has the problem scope changed?
- Are my assumptions still valid?
If revision is needed, be explicit:
Revising Step N: My earlier conclusion that [X] was wrong because [Y]. The corrected conclusion is [Z]. This affects steps [list downstream impacts].
This replaces the MCP's and parameters. The key
behavior is: name what changed, why, and what it invalidates downstream.
isRevisionrevisesThought每完成3-4个步骤后,必须进行自我检查:
检查点: 我是否仍在正确的轨道上?
- 结合当前所学,之前的结论是否仍然成立?
- 问题范围是否发生变化?
- 我的假设是否仍然有效?
如果需要修订,请明确说明:
修订第N步: 我之前关于[X]的结论是错误的,原因是[Y]。修正后的结论是[Z]。这会影响以下后续步骤[列出受影响步骤]。
这替代了MCP的和参数。核心是明确说明变更内容、原因以及对下游步骤的影响。
isRevisionrevisesThought4. Branch Exploration
4. 分支探索
When multiple viable approaches exist, don't silently pick one. Make the fork visible:
Branch Point (from Step N):Approach A — [Label]: [Brief description and likely outcome] Approach B — [Label]: [Brief description and likely outcome]Evaluating: [1–2 sentence comparison on key trade-off] Committing to Approach [X] because [rationale].
This replaces the MCP's and parameters. The value
is making the decision point and rationale explicit, not the mechanical branching.
branchFromThoughtbranchIdFor especially consequential forks, briefly explore both branches (2–3 steps each)
before committing, rather than choosing upfront.
当存在多种可行方案时,不要默默选择其一。请明确展示分支点:
分支点(来自第N步):方案A — [标签]: [简要描述及可能结果] 方案B — [标签]: [简要描述及可能结果]评估:[1-2句话对比关键权衡点] 选择方案[X],原因是[理由]。
这替代了MCP的和参数。价值在于明确决策点和理由,而非机械分支。
branchFromThoughtbranchId对于特别重要的分支点,可先简要探索两个分支(各2-3步)再做决定,而非直接选择。
5. Dynamic Scope Adjustment
5. 动态范围调整
If you realize mid-analysis that the problem is larger or smaller than estimated:
Scope Update: Originally estimated N steps, now estimating M because [reason].
This replaces and adjustment. Don't artificially
compress reasoning to fit an initial estimate — accuracy matters more than prediction.
needsMoreThoughtstotalThoughts如果在分析过程中发现问题比最初估计的更大或更小:
范围更新: 最初估计需要N步,现在调整为M步,原因是[理由]。
这替代了和调整功能。不要为了迎合初始估计而压缩推理过程——准确性比预测更重要。
needsMoreThoughtstotalThoughts6. Verification and Conclusion
6. 验证与结论
Before presenting a final answer, always:
- Restate the original problem in your own words
- Trace the solution path: "Steps 1→3→5 established [X], steps 4→6 established [Y]"
- Verify against all stated constraints and requirements
- Flag remaining uncertainties or assumptions
- Conclude only when all constraints are satisfied
Verification: Does this solution satisfy all requirements?
- [Requirement 1]: ✓ Satisfied by [step reference]
- [Requirement 2]: ✓ Satisfied by [step reference]
- [Requirement 3]: ⚠ Partially — [explain gap and mitigation]
This replaces the terminal condition. The MCP required
explicit signaling that thinking was complete; the methodology achieves this through
the verification checklist.
nextThoughtNeeded=false在给出最终答案前,请务必完成以下步骤:
- 重述 原问题(用自己的话)
- 追溯 解决路径:"步骤1→3→5得出[X],步骤4→6得出[Y]"
- 验证 是否符合所有约束和要求
- 标记 剩余的不确定性或假设
- 结论 仅在所有约束满足时给出
验证: 该解决方案是否满足所有要求?
- [要求1]:✓ 由[步骤引用]满足
- [要求2]:✓ 由[步骤引用]满足
- [要求3]:⚠ 部分满足——[说明差距及缓解措施]
这替代了的终止条件。原MCP需要明确信号表示思考完成,而本方法论通过验证清单实现这一点。
nextThoughtNeeded=falseOutput Format
输出格式
A sequential thinking session produces output with the following structure:
- Numbered thoughts — each labeled with a sub-goal statement, reasoning, and intermediate conclusion
Step N of M - Revision markers — inline blocks that name what changed, why, and which downstream steps are affected
Revising Step N: - Branch indicators — blocks listing approaches with a commitment statement and rationale
Branch Point (from Step N): - Scope updates — lines when the estimated step count changes mid-analysis
Scope Update: - Verification block — a final checklist confirming each requirement is satisfied, with step references; flags unresolved uncertainties before concluding
顺序思维会话的输出应包含以下结构:
- 编号思维步骤 — 每个步骤标记为,包含子目标声明、推理过程和中间结论
第N步/共M步 - 修订标记 — 内联的块,说明变更内容、原因及受影响的下游步骤
修订第N步: - 分支指示器 — 块,列出方案并包含决策声明和理由
分支点(来自第N步): - 范围更新 — 当步骤估计数在分析过程中变化时,添加行
范围更新: - 验证块 — 最终的检查清单,确认每个要求是否满足并关联步骤引用;在结论前标记未解决的不确定性
Calibration Rules
校准规则
- Match depth to complexity: Simple problems (single decision, clear constraints) warrant 3-5 thoughts. Moderate problems (multi-step with trade-offs) warrant 5-10. Complex problems (architecture, debugging cascading failures, formal reasoning) warrant 10 or more — do not compress artificially.
- Revisions signal quality: A thinking session that revises earlier steps is more reliable than one that proceeds linearly without self-correction. Revision is not failure; it is the methodology working as intended.
- Prefer depth over breadth: Explore fewer branches more thoroughly rather than listing many options shallowly. A branch is worth exploring only if the choice between approaches materially changes the outcome.
- Scope honesty: If the initial step estimate was wrong, update it explicitly. An accurate mid-course correction is better than forcing conclusions to fit an outdated estimate.
- 匹配深度与复杂度:简单问题(单一决策、约束明确)需要3-5个步骤。中等问题(多步骤且有权衡)需要5-10个步骤。复杂问题(架构设计、级联故障调试、形式化推理)需要10个以上步骤——不要人为压缩。
- 修订体现质量:包含步骤修订的思维会话比无自我修正的线性会话更可靠。修订不是失败,而是方法论的正常运作。
- 宁深勿广:深入探索少数分支,而非浅尝辄止列出多个选项。只有当方案选择会实质性改变结果时,才值得探索分支。
- 诚实面对范围:如果初始步骤估计错误,请明确更新。准确的中途修正比强行迎合过时估计更重要。
Common Workflows
常见工作流
Deep Debugging
深度调试
When diagnosing a complex bug or system issue:
- Reproduce — State the observed vs expected behavior precisely
- Hypothesize — Generate 2–3 candidate root causes, ranked by likelihood
- Narrow — For the top hypothesis, identify the minimal test that would confirm or refute it
- Test — Execute the test, observe the result
- Iterate — If refuted, move to next hypothesis. If confirmed, trace to root cause
- Verify fix — Confirm the fix addresses the root cause without regression
Use Branch Exploration at step 2 to make competing hypotheses explicit.
诊断复杂bug或系统问题时:
- 复现 — 精确说明观察到的行为与预期行为的差异
- 假设 — 生成2-3个候选根本原因,按可能性排序
- 缩小范围 — 针对最可能的假设,确定最小验证测试用例
- 测试 — 执行测试并观察结果
- 迭代 — 如果假设被推翻,转向下一个假设;如果确认,追溯到根本原因
- 验证修复 — 确认修复解决了根本原因且无回归
在步骤2使用分支探索明确展示竞争假设。
Architectural Decision Making
架构决策
For system design or technology choices:
- Frame — State the decision, constraints, and evaluation criteria with weights
- Enumerate — List viable options (aim for 3–5)
- Evaluate — Score each option against criteria; use a decision matrix
- Stress-test — For the top 1–2 options, probe failure modes and edge cases
- Decide — Commit with explicit rationale and documented trade-offs
- Record — State what would cause you to revisit this decision
进行系统设计或技术选型时:
- 框架 — 明确决策内容、约束和带权重的评估标准
- 枚举 — 列出可行选项(目标3-5个)
- 评估 — 按标准给每个选项打分;使用决策矩阵
- 压力测试 — 针对前1-2个选项,探查故障模式和边缘情况
- 决策 — 明确给出选择及理由,并记录权衡点
- 记录 — 说明会导致重新审视该决策的触发条件
Mathematical / Formal Reasoning
数学/形式化推理
For proofs, derivations, or formal verification:
- State the claim or goal precisely
- Identify the proof strategy (direct, contradiction, induction, construction)
- Execute step by step, with each step justified by a named rule or lemma
- Check each step's validity before proceeding
- Verify the proof is complete (all cases covered, no gaps)
Use Revision Checkpoints aggressively — formal reasoning has high cascading-error risk.
进行证明、推导或形式化验证时:
- 明确 主张或目标
- 确定 证明策略(直接证明、反证法、归纳法、构造法)
- 分步执行,每个步骤需引用命名规则或引理作为依据
- 检查 每个步骤的有效性后再继续
- 验证 证明是否完整(覆盖所有情况、无漏洞)
积极使用修订检查点——形式化推理的级联错误风险很高。
Error Handling
错误处理
| Problem | Cause | Fix |
|---|---|---|
| Reasoning goes in circles | Missing revision checkpoint | Force a checkpoint: restate goal, check if any step repeated prior conclusions |
| Scope keeps expanding | Problem underspecified | Pause and decompose into independent sub-problems; solve smallest first |
| Can't choose between branches | Evaluation criteria unclear | Make criteria explicit and weighted before comparing options |
| Conclusion doesn't satisfy constraints | Skipped verification step | Run full verification checklist before presenting answer |
| Earlier step invalidated | New information contradicts assumption | Explicit revision: name the step, the error, and all downstream impacts |
| 问题现象 | 原因 | 解决方案 |
|---|---|---|
| 推理陷入循环 | 遗漏修订检查点 | 强制触发检查点:重述目标,检查是否有步骤重复之前的结论 |
| 范围持续扩大 | 问题定义不明确 | 暂停并分解为独立子问题;先解决最小的子问题 |
| 无法在分支间选择 | 评估标准不明确 | 在比较选项前,先明确带权重的评估标准 |
| 结论不符合约束条件 | 跳过了验证步骤 | 在给出答案前运行完整的验证检查清单 |
| 之前的步骤被推翻 | 新信息与假设矛盾 | 明确修订:指出步骤、错误内容及所有下游影响 |
Limitations
局限性
- No persistent state across conversations. The MCP server maintained a thought history within a session. This methodology relies on the conversation context window instead, which is equivalent within a single conversation but doesn't persist across sessions.
- No programmatic thought graph. The MCP returned structured JSON for each thought step, which could theoretically be consumed by other tools. The methodology produces natural language instead. In practice, the MCP's JSON output was rarely consumed programmatically.
- Self-discipline required. The MCP mechanically enforced step numbering and checkpoint structure. The methodology relies on Claude following the protocol. In practice, explicit instructions are as reliable as tool-call enforcement for reasoning patterns.
- 会话间无持久化状态:MCP服务器在会话内维护思维历史。本方法论依赖对话上下文窗口,在单一会话内效果相当,但无法跨会话持久化。
- 无程序化思维图:MCP为每个思维步骤返回结构化JSON,理论上可被其他工具消费。本方法论生成自然语言输出。实际上,MCP的JSON输出很少被程序化消费。
- 需自我约束:MCP强制实现步骤编号和检查点结构。本方法论依赖Claude遵循协议。实践中,明确指令与工具调用强制在推理模式上同样可靠。
Token Savings Analysis
Token节省分析
| Metric | MCP (per turn) | Skill (per turn) | Savings |
|---|---|---|---|
| Schema overhead | ~1,800 tokens | 0 tokens (loaded on demand) | ~1,800 tokens/turn |
| 20-turn conversation | ~36,000 tokens | ~300 tokens (one-time load) | ~35,700 tokens |
| Tool call overhead | ~200 tokens/invocation | 0 (native reasoning) | ~200 tokens/call |
The Sequential Thinking MCP is one of the highest-ROI conversions because it consumes
substantial schema tokens on every turn while providing functionality that Claude can
replicate natively through prompting.
| 指标 | MCP(每轮) | 本技能(每轮) | 节省量 |
|---|---|---|---|
| 架构开销 | ~1800个token | 0个token(按需加载) | 每轮约1800个token |
| 20轮对话 | ~36000个token | ~300个token(一次性加载) | 约35700个token |
| 工具调用开销 | ~200个token/调用 | 0(原生推理) | 每次调用约200个token |
Sequential Thinking MCP是ROI最高的替代案例之一,因为它每轮都会消耗大量架构token,而Claude可通过提示原生复制其功能。