Token导航 LogoToken导航TokenDH.com
待分类执行命令github未标认证来源可访问许可证需确认审计通过

sequential-thinking顺序思维

Agent Skill

sequential-thinking 用于处理 GitHub 仓库、Issue、Pull Request 和代码协作信息,适合在 Codex、Claude、Cursor、Gemini CLI 中需要围绕仓库状态、代码变更或协作事项进行整理时使用。可结合来源仓库、安装命令和原始 README 继续核验具体用法。安装前建议确认权限范围、维护状态,以及是否会触发联网、命令执行或文件读写。

总安装

652

周安装

28

GitHub Stars

218

下载量

228
CodexClaudeCursorGemini CLI

安装说明

本站只整理中文说明和来源信息,不托管安装包,也不代用户安装。

GitHub

来源数

2

许可证

unknown

最后核验

2026-05-01

来源状态

来源可访问

安装方式

通过对话安装

复制提示词发给支持本地命令或 Skills 的 AI 助手,先确认命令和权限,再让它执行。

请帮我安装这个 Agent Skill:sequential-thinking(顺序思维)
来源仓库:https://github.com/mathews-tom/praxis-skills
仓库路径:skills/sequential-thinking
安装命令:
npx skills add https://github.com/mathews-tom/praxis-skills --skill sequential-thinking
安装前请先检查当前环境是否支持对应 CLI,并向我确认将要执行的命令、安装目录、联网范围和文件读写权限;确认后再执行。

命令行安装

复制命令到本机终端执行。该命令会通过 npx skills 从第三方来源获取 Skill;本站只展示命令,不托管安装包,也不自动执行。

skills.shnpx skills
npx skills add https://github.com/mathews-tom/praxis-skills --skill sequential-thinking

简介

sequential-thinking 用于处理 GitHub 仓库、Issue、Pull Request 和代码协作信息。

  • 适合在 Codex、Claude、Cursor、Gemini CLI 中围绕仓库状态进行信息整理。
  • 通过 npx skills add 命令从 GitHub 仓库安装,需确认权限范围和维护状态。
  • 建议结合原始 README 核验具体用法,注意是否会触发联网或文件读写操作。
  • 适用宿主包括 Codex、Claude、Cursor、Gemini CLI,接入前应确认版本、权限和运行环境要求。

SKILL.md

DEPRECATED — 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.

Sequential Thinking

Structured, reflective problem-solving methodology that replaces the Sequential Thinking MCP server's sequentialthinking tool with zero-cost instructional prompting.

Replaces: @modelcontextprotocol/server-sequential-thinking (1 tool, ~1,800 tokens/turn saved)

Quick Reference

CapabilityOld MCP ToolNew Approach
Step-by-step reasoningsequentialthinking(thought, thoughtNumber,...)Follow methodology below
Thought revisionsequentialthinking(isRevision=true, revisesThought=N)Inline revision protocol
Branch explorationsequentialthinking(branchFromThought=N, branchId=...)Branch labeling protocol
Dynamic scope adjustmentsequentialthinking(needsMoreThoughts=true)Scope reassessment checkpoints
Hypothesis verificationsequentialthinking loop until nextThoughtNeeded=falseVerify-before-conclude protocol

Prerequisites

None. This skill is pure methodology — no CLI tools, APIs, or authentication required.

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.

1. Scope Assessment

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.

2. Numbered Step Execution

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.

3. Revision Checkpoints

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 isRevision and revisesThought parameters. The key behavior is: name what changed, why, and what it invalidates downstream.

4. Branch Exploration

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 branchFromThought and branchId parameters. The value is making the decision point and rationale explicit, not the mechanical branching.

For especially consequential forks, briefly explore both branches (2–3 steps each) before committing, rather than choosing upfront.

5. Dynamic Scope Adjustment

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 needsMoreThoughts and totalThoughts adjustment. Don't artificially compress reasoning to fit an initial estimate — accuracy matters more than prediction.

6. Verification and Conclusion

Before presenting a final answer, always:

  1. Restate the original problem in your own words
  2. Trace the solution path: "Steps 1→3→5 established [X], steps 4→6 established [Y]"
  3. Verify against all stated constraints and requirements
  4. Flag remaining uncertainties or assumptions
  5. 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 nextThoughtNeeded=false terminal condition. The MCP required explicit signaling that thinking was complete; the methodology achieves this through the verification checklist.

Output Format

A sequential thinking session produces output with the following structure:

  • Numbered thoughts — each labeled Step N of M with a sub-goal statement, reasoning, and intermediate conclusion
  • Revision markers — inline Revising Step N: blocks that name what changed, why, and which downstream steps are affected
  • Branch indicatorsBranch Point (from Step N): blocks listing approaches with a commitment statement and rationale
  • Scope updatesScope Update: lines when the estimated step count changes mid-analysis
  • Verification block — a final checklist confirming each requirement is satisfied, with step references; flags unresolved uncertainties before concluding

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.

Common Workflows

Deep Debugging

When diagnosing a complex bug or system issue:

  1. Reproduce — State the observed vs expected behavior precisely
  2. Hypothesize — Generate 2–3 candidate root causes, ranked by likelihood
  3. Narrow — For the top hypothesis, identify the minimal test that would confirm or refute it
  4. Test — Execute the test, observe the result
  5. Iterate — If refuted, move to next hypothesis. If confirmed, trace to root cause
  6. Verify fix — Confirm the fix addresses the root cause without regression

Use Branch Exploration at step 2 to make competing hypotheses explicit.

Architectural Decision Making

For system design or technology choices:

  1. Frame — State the decision, constraints, and evaluation criteria with weights
  2. Enumerate — List viable options (aim for 3–5)
  3. Evaluate — Score each option against criteria; use a decision matrix
  4. Stress-test — For the top 1–2 options, probe failure modes and edge cases
  5. Decide — Commit with explicit rationale and documented trade-offs
  6. Record — State what would cause you to revisit this decision

Mathematical / Formal Reasoning

For proofs, derivations, or formal verification:

  1. State the claim or goal precisely
  2. Identify the proof strategy (direct, contradiction, induction, construction)
  3. Execute step by step, with each step justified by a named rule or lemma
  4. Check each step's validity before proceeding
  5. Verify the proof is complete (all cases covered, no gaps)

Use Revision Checkpoints aggressively — formal reasoning has high cascading-error risk.

Error Handling

ProblemCauseFix
Reasoning goes in circlesMissing revision checkpointForce a checkpoint: restate goal, check if any step repeated prior conclusions
Scope keeps expandingProblem underspecifiedPause and decompose into independent sub-problems; solve smallest first
Can't choose between branchesEvaluation criteria unclearMake criteria explicit and weighted before comparing options
Conclusion doesn't satisfy constraintsSkipped verification stepRun full verification checklist before presenting answer
Earlier step invalidatedNew information contradicts assumptionExplicit 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.

Token Savings Analysis

MetricMCP (per turn)Skill (per turn)Savings
Schema overhead~1,800 tokens0 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/invocation0 (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.

适合场景

01

用户想查找某类 Agent Skill 时

02

需要根据任务场景推荐可安装能力包时

03

需要对比不同来源的安装命令和来源信息时

能力概览

能力 1

按任务关键词查找相关 Skills

能力 2

展示可复制的安装命令

能力 3

保留来源站点、仓库和原始说明,方便继续核验

能力 4

展示第三方安全扫描或审计结果

安装后应在对应宿主中按原始 README 的触发条件使用;具体调用方式请以来源页面和 README 为准。

平台分布

Codex

38.24%
按下载量换算87

Claude

30.89%
按下载量换算70

Cursor

18.37%
按下载量换算42

Gemini CLI

10.08%
按下载量换算23

安全审计

Gen Agent Trust Hub

通过

Socket

通过

Snyk

通过

权限和风险

执行命令

安装流程涉及命令执行,可能通过 npx skills add https://github.com/mathews-tom/praxis-skills --skill sequential-thinking 联网下载 Skill 或依赖。用户安装前应确认命令来源、仓库内容和执行环境。

安装前确认

本站仅展示第三方公开信息,不托管安装包,不提供自动安装或运行环境。安装前应自行审查源码、依赖和命令行为。当前只有一个来源,正式发布前建议补源仓库或其他目录站核验。

来源信息

继续浏览同类 Skills