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.
git clone --depth 1 https://github.com/widnyana/eyay-toolkitsWrote 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/commands/widnyana/eyay-toolkits/cg-plan)<a href="https://agentmods.dev/commands/widnyana/eyay-toolkits/cg-plan"><img src="https://agentmods.dev/badge/commands/widnyana/eyay-toolkits/cg-plan/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/commands/widnyana/eyay-toolkits/cg-plan"><img src="https://agentmods.dev/badge/commands/widnyana/eyay-toolkits/cg-plan.svg" alt="Reviewed on agentmods" width="80" height="20"></a>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.00018 | $0.00785 |
| Opus 5 | $0.00009 | $0.00392 |
| Sonnet 5 | $0.00004 | $0.00157 |
| Haiku 4.5 | $0.00002 | $0.00078 |
Grade A, and why
cg-plan 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 9d 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 — 65 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Task: $ARGUMENTS
Design it before writing any code. Apply the full Design Thinking pipeline and produce a complete Design Graph in Graph Protocol format. Code suggestions must match the graph — if a snippet contradicts the graph, fix the graph or fix the code, never let them drift silently.
Graph Protocol — quick reference
Emit ALL sections below, in this order, with these markers:
PROBLEM: <one line — if it doesn't fit, the problem is not understood; refine first>
X → DesignGraph<A, E, R>
│ │ │ │ │
│ │ │ │ └─ R: what each node needs (§5)
│ │ │ └──── E: where the graph breaks (§4)
│ │ └─────── A: what flows through nodes (§2)
│ │
│ └─ nodes = functions, edges = data flow
│
└─ the problem
SHAPES: records · IDs · state variants · named errors
GRAPH: ascii call graph, annotated inline:
R: deps · E: err ⟳retry[×n] → ↯escape(alt) | ☠die · 🔒 unknown→trusted
CARDINALITY: node (1) one-shot · (N) many over time · (T) time-bounded
BOUNDARIES: every untrusted→trusted crossing (parse, don't validate)
BEHAVIOR: orthogonal layers (retry, cache, logging) that wrap without changing the graph
SCOPE: resources: acquire@x → release@x (structural, not convention)
TEST LAYERS: the R tests provide — same GRAPH, zero code change
VERDICT: the target structure the implementation must satisfy
Pipeline to follow
- §1 Shapes — the domain nouns, named before any graph is drawn.
- §2 A — happy path as a call graph, drawn first.
- §3 Cardinality — one-shot
(1), many(N), time-bounded(T)per node. - §4 E — every break point gets one of:
⟳retry,↯escape(alt),☠die. - §5 R — every node declares its requirements; provided at the composition root.
- §6 Boundary — parse
unknown → trustedat edges only; trust inside. - §7 Behavior — cross-cutting concerns wrap nodes orthogonally.
- §8 Scope — acquire/release structurally bound (RAII / defer / context managers).
- §9 Test — same graph runs with test R; if it can't, hidden deps exist.
- §10 Structure — happy path body = A only; failure handling at defined join points = E. Divergent strategies (per-fork failure semantics) are the one exception — mark them.
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.
- 9d ago First seen · 65 lines · 18 tokens per session scan A d945d9c45f59
cg-plan is a command published in the GitHub repository widnyana/eyay-toolkits (7 stars, last pushed 6d ago), licensed MIT. It adds 18 tokens to every session and 785 once invoked, about $0.0001 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-31.
Other commands, from other repositories
psql-query
Run ad-hoc PostgreSQL analytics queries against dev/test database.
genshijin-compress
A command for safely shortening Markdown or text files into the genshijin style.
feat
Quick feature commit. Use for new feature, add feature, implement, create new.
nyann:diff-profile
Compare two nyann profiles side-by-side and show what changes between them: hooks, branching, CI, documentation, extras, governance. Useful before switching profiles to understand the impact.
summary
Generate a consolidated project brief from design artifacts. For the full spec package with YAML specs and validation, use /compile instead.
spec
Generate technical specifications from design artifacts.