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 skills add frenzymath/Danus --skill propose-subgoal-decomposition-plansgit clone --depth 1 https://github.com/frenzymath/DanusWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/skills/frenzymath/danus/propose-subgoal-decomposition-plans)<a href="https://agentmods.dev/skills/frenzymath/danus/propose-subgoal-decomposition-plans"><img src="https://agentmods.dev/badge/skills/frenzymath/danus/propose-subgoal-decomposition-plans/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/skills/frenzymath/danus/propose-subgoal-decomposition-plans"><img src="https://agentmods.dev/badge/skills/frenzymath/danus/propose-subgoal-decomposition-plans.svg" alt="Reviewed on agentmods" width="80" height="20"></a>- NVIDIA SkillSpector pass
What 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.1 | $0.00055 | $0.00532 |
| Opus 5 | $0.00028 | $0.00266 |
| Sonnet 5 | $0.00011 | $0.00106 |
| Haiku 4.5 | $0.00006 | $0.00053 |
Grade A, and why
propose-subgoal-decomposition-plans scanned grade A with 0 findings 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 12d 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.
Nothing flagged
None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.
What it actually says
Propose Subgoal Decomposition Plans
Use this skill when the agent has enough context to propose several viable decomposition plans.
Input Contract
Read:
- the current target theorem or branch goal
- relevant
immediate_conclusions,toy_examples, andcounterexamples - relevant
failed_pathsandbranch_states - recent search results and useful references from
events
Procedure
- Gather the current information that materially constrains the problem: useful examples, failed claims, known obstructions, and relevant search results.
- Propose materially different decomposition plans.
- For each plan, state:
- the main idea of the plan
- the ordered subgoals
- why this plan is plausible given the current information
- which earlier failures or counterexamples it tries to avoid
- Hand each plan to
$direct-provingfor a quick screening pass.
Output Contract
Publish one plan per decomposition to global memory with gm_add (kind plan, a
judgment — verifiable=false): claim = the plan's goal + summary, evidence =
its motivation, plus these fields:
{
"plan_id": "...",
"record_type": "decomposition_plan",
"goal": "...",
"plan_summary": "...",
"subgoals": ["..."],
"motivation": ["..."],
"uses_information_from": {
"examples": ["..."],
"counterexamples": ["..."],
"key_failures": ["..."],
"search_results": ["..."]
},
"status": "proposed|screening|screened|selected|failed|solved",
"branch_id": "optional"
}
Also note the new plan set in your local memory (events).
Tools
gm_add(publish the plan findings)gm_search(recall the examples/counterexamples/dead-ends the plans build on)search_arxiv_theorems
Failure Logging
If the agent cannot yet propose meaningful decomposition plans, append an events record with:
event_type="decomposition_plans_not_ready"- the missing information
- the blockers that prevent proposing plans
What ships with it
1 file beside SKILL.md in the same directory: the scripts, references and assets a skill reads on demand. Not counted in the per-session cost; read them before you install if any of them is executable.
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.
- 12d ago First seen · 70 lines · 55 tokens per session scan A 47fba96ab5cc
propose-subgoal-decomposition-plans is a skill published in the GitHub repository frenzymath/Danus (430 stars, last pushed 16d ago), licensed Apache-2.0. It adds 55 tokens to every session and 532 once invoked, about $0.0003 per session on Opus 5. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-30.
Other skills, from other repositories
personal-genomics
Analyse personal DNA / genome files for pharmacogenomics, disease risk, carrier status, ancestry and traits. Use whenever the user mentions DNA or genome analysis, a raw genome file, gene names, drug-gene interactions, or wants to combine multiple DNA sources.
post-processing
Extract, analyze, and summarize simulation output data — pull spatial fields at specific timesteps, compute time-series trends and detect steady state, extract line profiles through the domain, generate statistical summaries and distributions, calculate derived quantities (gradients, fluxes, volume fractions…
nonlinear-solvers
Select and configure nonlinear solvers for root-finding f(x)=0, optimization min F(x), and least-squares problems — choose among Newton, Newton-Krylov, quasi-Newton (BFGS, L-BFGS), Broyden, Anderson acceleration, and Levenberg-Marquardt methods, configure line search or trust-region globalization, diagnose convergence…
slurm-job-script-generator
Generate correct, copy-pasteable SLURM sbatch job scripts and sanity-check HPC resource requests — configure nodes, MPI tasks, OpenMP threads, memory (per-node or per-cpu), GPUs, walltime, partitions, modules, and environment variables, with automatic detection of conflicting directives and oversubscription. Use when…
ontology-explorer
Parse, navigate, and query materials science ontology structures — browse class hierarchies, inspect individual classes and their properties, look up object and data property definitions with domain/range, search for ontology terms by keyword, and parse or summarize raw OWL/XML files. Currently supports CMSO and ASMO…
performance-profiling
Identify computational bottlenecks, analyze parallel scaling, estimate memory requirements, and generate optimization recommendations for materials simulations — parse timing logs to find dominant phases (solver, assembly, I/O), evaluate strong and weak scaling efficiency, profile memory from mesh and field…