Install
$ agentstack add skill-d-oit-rust-2026-template-task-decomposition ✓ scanned · ✓ verified, works with Claude Code, Cursor, and more.
Security review
✓ PassedNo issues found. Passed automated security review. · v0.1.0 How review works →
- ✓ Prompt-injection patterns
- ✓ Secret / credential exfiltration
- ✓ Dangerous shell & filesystem operations
- ✓ Untrusted network calls
- ✓ Known-malicious package signatures
What it can access
- ✓ Network access No
- ✓ Filesystem access No
- ✓ Shell / process execution No
- ✓ Environment & secrets No
- ✓ Dynamic code execution No
From automated source analysis of v0.1.0. “Used” means the capability is present in the source — more access means more to trust, not that it’s unsafe.
Verified badge
Passed review? Show it. Paste this badge into your README, it links to the public security report.
Reliability & compatibility
Declared compatibility
Compatibility is declared by the source manifest. End-to-end runtime verification is coming, see below.
We're building live execution health for every listing: tool-call success rate, median latency, uptime, and last-checked timestamps, measured, not self-reported. It isn't live yet, so we don't show numbers we can't stand behind.
How agent discovery & health will work →About
Task Decomposition
Decompose high-level objectives into manageable, testable sub-tasks.
When to Use
- Complex requests with multiple components
- Multi-phase projects requiring coordination
- Tasks benefiting from parallel execution
Framework
1. Requirements Analysis
Extract: Primary objective, implicit requirements, constraints, success criteria.
2. Goal Hierarchy
Main Goal
├─ Sub-goal 1 → Tasks 1.1, 1.2
├─ Sub-goal 2 → Task 2.1
└─ Sub-goal 3
Atomic Criteria: Single action, defined inputs/outputs, one agent, testable.
3. Dependency Mapping
- Sequential: A → B → C
- Parallel: A, B, C (independent)
- Converging: A, B, C → D
4. Success Criteria
Define: Inputs, outputs, quality standards.
Process
Step 1: Understand Goal
Request: [Original]
Goal: [Main objective]
Type: [Implementation/Debug/Refactor]
Complexity: [Simple/Medium/Complex]
Step 2: Identify Components (3-7)
Step 3: Decompose Components
Step 4: Map Dependencies
Step 5: Assign Priorities
- P0 (Critical), P1 (Important), P2 (Nice-to-have)
Step 6: Estimate Complexity
- Low (2hr)
Patterns
Layer-Based (Rust)
- Data types / schemas
- Business logic
- API / CLI interface
- Integration tests
- Documentation
Feature-Based
- Core (MVP)
- Error handling (
thiserror/anyhow) - Performance (benches)
- Integration
- Testing
- Docs
Problem-Solution
- Reproduce
- Diagnose
- Design
- Fix
- Verify
- Prevent
Quality Checklist
- Atomic and actionable tasks
- Dependencies identified
- Measurable success criteria
- Appropriate complexity estimates
- No task >4 hours
- Parallelization opportunities found
Rationalizations
| Rationalization | Reality | |-----------------|---------| | "I already know what needs to be done, no need to decompose" | Skipping decomposition leads to scope creep, missed dependencies, and rework. | | "The task is too simple to break down" | Even simple tasks benefit from explicit success criteria and dependency mapping. |
Red Flags
- [ ] Defining tasks that are too vague to test or verify
- [ ] Skipping dependency mapping between decomposed tasks
- [ ] Creating tasks larger than 4 hours without further breakdown
Source & license
This open-source skill is cataloged on AgentStack and links to its original source — we do not rehost the code.
- Author: d-oit
- Source: d-oit/rust-2026-template
- License: MIT
- Homepage: https://d-oit.github.io/rust-2026-template/
Install and usage instructions live in the source repository linked above.
Reviews
No reviews yet, be the first.
Write a review
Versions
- v0.1.0 Imported from the upstream source.