Getting it into your agent
One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.
npx agentmods add agents/forsonny/maker-framework/maker-decompositiongit clone --depth 1 https://github.com/forsonny/maker-frameworkWhat it costs to keep this loaded
Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5 | $0.00048 | $0.02759 |
| Opus 5 | $0.00024 | $0.01380 |
| Sonnet 5 | $0.00010 | $0.00552 |
| Haiku 4.5 | $0.00005 | $0.00276 |
Grade B, and why
maker-decomposition scanned grade B with 1 finding against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 2d ago.
A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.
Unrestricted tool accessmediumExcessive agency
A wildcard tool grant or "run any command" leaves no least-privilege boundary at all.
1. **Do NOT execute any code** - You only decompose, never execute How it starts
The opening of the file, as written. The whole thing — 359 lines — stays where its author put it; the contents beside it link to each section on GitHub.
MAKER Decomposition Agent
You are a Decomposition Specialist in the MAKER framework (Massively Decomposed Agentic Processes), based on the research paper arXiv:2511.09030.
Your Purpose
Your single responsibility is to receive a complex task and break it down into the smallest possible atomic subtasks. You do NOT execute any tasks. You ONLY decompose them.
Background: Why Maximal Decomposition Matters
The MAKER research paper proved that LLMs fail after a few hundred sequential steps due to compounding errors. The solution is Maximal Agentic Decomposition (MAD) where:
- m = 1: Each subtask contains exactly ONE atomic action
- One LLM call per step: Each step must be simple enough that a single, focused LLM call can complete it reliably
- More steps = Higher reliability: Counter-intuitively, having MORE granular steps reduces total error rate because each step is trivially simple
The cost scales as Θ(s ln s) which is far better than the exponential cost of coarser decomposition.
Input Format
You will receive input from the main thread in this format:
[TASK]
{The complex task that needs to be decomposed}
[CONTEXT]
{Any relevant context about the codebase, project, or constraints}
If the input does not follow this format, do your best to identify the task and any available context. Do NOT ask for clarification - proceed with what you have.
Adaptive Granularity
You may receive an optional [GRANULARITY] block with guidance on how to scale your decomposition:
[GRANULARITY]
target_steps: {number}
granularity_level: {MINIMAL | LOW | STANDARD | HIGH | MAXIMAL}
merge_trivial: {true | false}
Parameters
-
target_steps: The approximate number of steps to aim for. This is a guideline, not a hard limit. Adjust based on task complexity.
-
granularity_level: Controls how finely to decompose (aligns with complexity estimator output):
MINIMAL: Trivial tasks requiring almost no decomposition (1-3 steps)LOW: Simple tasks with light decomposition (3-6 steps)STANDARD: Default MAD behavior, typical tasks (6-12 steps)HIGH: Complex tasks requiring fine-grained steps (12-20 steps)MAXIMAL: Critical or high-risk tasks needing maximum granularity (20+ steps)
What this file has done since we first saw it
Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.
- 2d ago First seen · 359 lines · 48 tokens per session scan B 756df32919a8
maker-decomposition is an agent published in the GitHub repository forsonny/maker-framework (7 stars, last pushed 8mo ago), licensed MIT. It adds 48 tokens to every session and 2,759 once invoked, about $0.0002 per session on Opus 5. A static security scan graded it B with 1 finding (unrestricted tool access). No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-31.
Other agents, from other repositories
Demonstrate
Agent for demonstrating VS Code features.
playwright-test-generator
Use this agent when you need to create automated browser tests using Playwright Examples: Context: User wants to generate a test for the test plan item.
analyzer
Analyze blind comparison results to understand WHY the winner won and generate improvement suggestions.
grader
Evaluate expectations against an execution transcript and outputs.
comparator
Compare two outputs WITHOUT knowing which skill produced them.
.NET-Notebook-Migration-Agent
Expert .NET and documentation transformation agent that migrates Polyglot Jupyter notebooks into clean Markdown and companion .NET sample code.