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 skills/melodic-software/claude-code-plugins/snapshotnpx skills add melodic-software/claude-code-plugins --skill snapshotgit clone --depth 1 https://github.com/melodic-software/claude-code-pluginsWrote 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/melodic-software/claude-code-plugins/snapshot)<a href="https://agentmods.dev/skills/melodic-software/claude-code-plugins/snapshot"><img src="https://agentmods.dev/badge/skills/melodic-software/claude-code-plugins/snapshot.svg" alt="Measured on agentmods" 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.00209 | $0.02152 |
| Opus 5 | $0.00105 | $0.01076 |
| Sonnet 5 | $0.00042 | $0.00430 |
| Haiku 4.5 | $0.00021 | $0.00215 |
Grade A, and why
snapshot 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 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.
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 — 172 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Purpose
Answers "what does this cost, and is this machine even able to tell me?"
Read ${CLAUDE_PLUGIN_ROOT}/reference/harness-integrity.md before writing any harness
here. It is not optional background: five harnesses in the source run returned confident wrong
answers, and four of the five were checks written specifically to avoid being fooled.
Phase order, and why it is this order
1. Qualify the host, before measuring anything
The lib is plugin-bundled, not installed, so it needs its directory on sys.path before the
import. Anchor to the plugin root rather than the working directory; a bare
from spawn_noise import ... raises ModuleNotFoundError unless the caller happens to already be
in lib/.
import sys
from pathlib import Path
lib = Path(__file__).resolve().parents[3] / "lib" # <plugin-root>/lib
if str(lib) not in sys.path:
sys.path.insert(0, str(lib))
from spawn_noise import spawn_probe, is_measurable # noqa: E402
summary = spawn_probe()
measurable, why = is_measurable(summary)
parents[3] is correct from <plugin-root>/skills/<skill>/scripts/x.py. Count the levels for
wherever the caller actually sits rather than copying the index.
is_measurable() returns a verdict and its basis. A False is a hard refusal to report a
wall-clock number, subject only to the recorded override below.
The refusal names what it can still report. That matters: an unexplained refusal gets overridden reflexively. This host spread 15.7x across identical no-op spawns, and the durable result from the source run was a deterministic spawn count of 4 -> 1, not a duration.
Say plainly that this refusal is a house rule. No surveyed benchmarking tool refuses above a variance threshold: pyperf, Criterion, JMH and benchstat all warn and print the number anyway. pyperf's own thresholds (stdev >= 10% of the mean, min/max >= 50% from the mean, shortest value < 1 ms) are warnings. Presenting this refusal as consensus would be a miscitation.
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.
- 2d ago First seen · 172 lines · 209 tokens per session scan A 1cf6864a98c4
snapshot is a skill published in the GitHub repository melodic-software/claude-code-plugins (15 stars, last pushed today), licensed MIT. It adds 209 tokens to every session and 2,152 once invoked, about $0.0010 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-09-03.
Other skills, from other repositories
parallel-orchestrator
Manage parallel Claude Code workstreams using git worktrees. Use when: splitting large tasks across multiple workers, coordinating parallel development, monitoring worker progress, integrating completed work, analyzing work item documents (code reviews, issue lists). Triggers: parallel, orchestrator, worktrees…
parallel-worker
Execute focused implementation tasks in a parallel workflow. Use when: working on assigned files in a worktree, making checkpoint commits, signaling dependencies or blockers, completing orchestrator-assigned tasks. Triggers: worker, checkpoint, worktree, assigned scope, commit prefix, parallel task.
solve-constraint-puzzle
For constraint satisfaction: Sudoku, scheduling, N-queens, logic puzzles, SAT-like problems, assignment problems. Uses propagate-then-search pattern.
use-class-for-state
For complex state: encapsulate multiple interacting variables, stateful algorithms, backtracking search state.
build-priority-queue
For ordered processing: A search, Dijkstra, event simulation, task scheduling. Efficient min/max extraction with heap-based queue.
catch-expected-errors
For iteration with errors: catch exceptions during exploration, skip invalid cases, continue to next attempt.