algorithms

algorithms is a command for Claude Code from Birfy/agentdescent. It costs 20 tokens per session (378 once invoked), scanned A, original, MIT.

A command for listing, inspecting, or running named AgentDescent algorithms. It shows an algorithm's settings and expected changes before asking for confirmation to run it on a specified path.

In plain words
What is it for?
Use it to browse available algorithms, inspect one, or prepare and run a selected algorithm against a path and optional test cases.
Why use it?
It prevents guessing algorithm names or running a change without first checking its parameters and estimated effect. The confirmation step keeps execution under the user's control.

Command for Claude Code

Written for Claude Code: argument-hint in frontmatter.

Part of the agentdescent plugin — 1 skill, 2 commands, 1 hook, 1 MCP server shipped together

Good fit Use it to browse available algorithms, inspect one, or prepare and run a selected algorithm against a path and optional test cases.

Compare 6 commands from other repositories ↓
Install with agentmods
npx agentmods add commands/birfy/agentdescent/algorithms
Install

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.

Clone the repo
git clone --depth 1 https://github.com/Birfy/agentdescent

Made for: Claude Code.

Or install agentdescent, the plugin that ships this one along with the rest of its 1 skill, 2 commands, 1 hook, 1 MCP server.

Wrote 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.

agentmods badge for algorithms

README.md
[![agentmods](https://agentmods.dev/badge/commands/birfy/agentdescent/algorithms/github.svg)](https://agentmods.dev/commands/birfy/agentdescent/algorithms)
Your own site
<a href="https://agentmods.dev/commands/birfy/agentdescent/algorithms"><img src="https://agentmods.dev/badge/commands/birfy/agentdescent/algorithms/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.

agentmods 80×15 button for algorithms

Your own site · 80×15
<a href="https://agentmods.dev/commands/birfy/agentdescent/algorithms"><img src="https://agentmods.dev/badge/commands/birfy/agentdescent/algorithms.svg" alt="Reviewed on agentmods" width="80" height="20"></a>
Per session 20 Only the description is in the session, so the agent can decide to use it. The body loads when it is invoked.
When invoked 378 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. A grade says what 26 rules found in the file — not that it is safe.
Origin original No closer match found in the catalogue.
Token cost

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.

ModelPer sessionOnce invoked
Fable 5.1 $0.00020 $0.00378
Opus 5.5 $0.00008 $0.00151
Sonnet 5.5 $0.00004 $0.00076
Haiku 4.5 $0.00002 $0.00038

Measured yesterday against content hash 41b6075c7f40, method: parsed. Prices are Anthropic first-party input rates as of 2026-10-07, from the pricing page.

Security

Grade A, and why

algorithms 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 yesterday.

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.

integrations/claude-code/commands/algorithms.md · 25 lines

What it actually says

Use the agentdescent skill / MCP tools. $ARGUMENTS chooses the verb; the data is the same as agentdescent algorithms list / show and the MCP tools list_algorithms / describe_algorithm. Never invent a name.

Parse $ARGUMENTS (trim; empty means list):

  • list [optional --kind K]: call list_algorithms (or agentdescent algorithms list [--kind K] [--json]). Show each name, one-line summary, kinds, and fidelity. If the user named a kind, filter to it.
  • show <name>: call describe_algorithm (or agentdescent algorithms show <name>). Show the full card (params, defaults, extra cost, what it changes). Stop here unless they ask to run it.
  • run <name> <path> [optional cases.jsonl] [optional --param k=v]: build a spec for the path with algorithm set to that name (and only the params they gave — validate with describe_algorithm / show first). Run doctor, plan, show the resolved algorithm card and estimate, and wait for my yes before start. Same apply/cancel/resume rules as /evolve.

If they only named a method with no path, show it and ask whether to run.

Changes

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.

  1. yesterday First seen · 25 lines · 20 tokens per session scan A 41b6075c7f40

Subscribe to this mod's changes

algorithms is a command published in the GitHub repository Birfy/agentdescent (201 stars, last pushed today), licensed MIT. It adds 20 tokens to every session and 378 once invoked, about $0.0001 per session on Opus 5.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-10-28.