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 search-math-resultsgit 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/search-math-results)<a href="https://agentmods.dev/skills/frenzymath/danus/search-math-results"><img src="https://agentmods.dev/badge/skills/frenzymath/danus/search-math-results/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/search-math-results"><img src="https://agentmods.dev/badge/skills/frenzymath/danus/search-math-results.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.00048 | $0.02516 |
| Opus 5 | $0.00024 | $0.01258 |
| Sonnet 5 | $0.00010 | $0.00503 |
| Haiku 4.5 | $0.00005 | $0.00252 |
Grade A, and why
search-math-results 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 10d 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.
How it starts
The opening of the file, as written. The whole thing — 158 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Search Math Results
Use this skill as the default retrieval workflow for mathematical background and related results, conditioned on the live research program currently being pursued.
Input Contract
Read:
- the current target statement, subgoal, lemma, or claim
- the
program_stage, chosen from:fresh_orientationactive_programmature_subproblem
- the current
active_program, meaning the live research program currently being pursued, such as a construction route, globalization route, mutation route, or other proof strategy - the current
missing_mechanism, meaning the specific mechanism, construction, lemma, bridge, or proof move that is missing - the
search_mode, chosen from:repairmutationanalogyprogram_shifttheorem_level_blocker
- the search intent:
theoremconstructionexamplecounterexamplebackground
- relevant branch/subgoal context from memory
If the prompt explicitly declares the program_stage, active_program, missing_mechanism, or blocker policy, obey those declarations. If the prompt does not declare the stage, default to fresh_orientation for a new problem, first-pass search, or no mature program yet; use active_program when the run already has a live named program, branch, or missing mechanism; and use mature_subproblem only when the run is already narrowed to a repeatedly failed mature subproblem or mature active program.
Search Modes
repair: search for results or constructions that directly repair a specific missing step in the current active program.mutation: search for nearby constructions or variants that modify the current active program while preserving continuity with it.analogy: search broadly, including in apparently unrelated areas, for mechanisms, lemmas, constructions, examples, or proof ideas that might transfer to the current missing mechanism after translation or modest modification.program_shift: search for a genuinely new program after repeated failure of the current one, while explaining the possible splice point or bridge back to the current problem.theorem_level_blocker: search for obstruction or impossibility results only under the activation rule below.
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.
- 10d ago First seen · 158 lines · 48 tokens per session scan A 730b19c6b119
search-math-results is a skill published in the GitHub repository frenzymath/Danus (412 stars, last pushed 13d ago), licensed Apache-2.0. It adds 48 tokens to every session and 2,516 once invoked, about $0.0002 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…
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…
simulation-orchestrator
Orchestrate multi-simulation campaigns — generate parameter sweep configurations (grid, linspace, or Latin Hypercube sampling), initialize and track batch job campaigns, monitor job completion status, and aggregate results with summary statistics across all runs. Use when running a parameter study across dt, kappa, or…