From armory
Provides structured chain-of-thought reasoning protocol for complex problem-solving. Retained for deterministic, reviewable traces in audits or proofs.
npx claudepluginhub mathews-tom/armory --plugin armoryThis skill uses the workspace's default tool permissions.
> **DEPRECATED** — Opus 4.7 uses adaptive thinking (optional at each step) and Sonnet 4.6
Implements Playwright E2E testing patterns: Page Object Model, test organization, configuration, reporters, artifacts, and CI/CD integration for stable suites.
Guides Next.js 16+ Turbopack for faster dev via incremental bundling, FS caching, and HMR; covers webpack comparison, bundle analysis, and production builds.
Discovers and evaluates Laravel packages via LaraPlugins.io MCP. Searches by keyword/feature, filters by health score, Laravel/PHP compatibility; fetches details, metrics, and version history.
DEPRECATED — Opus 4.7 uses adaptive thinking (optional at each step) and Sonnet 4.6 handles structured chain-of-thought natively. For most tasks, prompting "Think carefully and step-by-step; this is harder than it looks" elicits the required depth. This methodology is retained as a reference pattern when deterministic, reviewable reasoning traces are required (audits, proofs, post-hoc analysis) regardless of the model's adaptive-thinking choice.
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)
| Capability | Old MCP Tool | New Approach |
|---|---|---|
| Step-by-step reasoning | sequentialthinking(thought, thoughtNumber, ...) | Follow methodology below |
| Thought revision | sequentialthinking(isRevision=true, revisesThought=N) | Inline revision protocol |
| Branch exploration | sequentialthinking(branchFromThought=N, branchId=...) | Branch labeling protocol |
| Dynamic scope adjustment | sequentialthinking(needsMoreThoughts=true) | Scope reassessment checkpoints |
| Hypothesis verification | sequentialthinking loop until nextThoughtNeeded=false | Verify-before-conclude protocol |
None. This skill is pure methodology — no CLI tools, APIs, or authentication required.
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.
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.
Work through each step with explicit structure:
Do not skip ahead. Each step must produce a concrete, verifiable intermediate result.
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.
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.
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.
Before presenting a final answer, always:
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.
A sequential thinking session produces output with the following structure:
Step N of M with a sub-goal statement, reasoning, and intermediate conclusionRevising Step N: blocks that name what changed, why, and which downstream steps are affectedBranch Point (from Step N): blocks listing approaches with a commitment statement and rationaleScope Update: lines when the estimated step count changes mid-analysisWhen diagnosing a complex bug or system issue:
Use Branch Exploration at step 2 to make competing hypotheses explicit.
For system design or technology choices:
For proofs, derivations, or formal verification:
Use Revision Checkpoints aggressively — formal reasoning has high cascading-error risk.
| 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 |
| 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.