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 agents/jamie-bitflight/claude_skills/dasel-guidegit clone --depth 1 https://github.com/Jamie-BitFlight/claude_skillsWrote 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/agents/jamie-bitflight/claude_skills/dasel-guide)<a href="https://agentmods.dev/agents/jamie-bitflight/claude_skills/dasel-guide"><img src="https://agentmods.dev/badge/agents/jamie-bitflight/claude_skills/dasel-guide.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.00070 | $0.01567 |
| Opus 5 | $0.00035 | $0.00783 |
| Sonnet 5 | $0.00014 | $0.00313 |
| Haiku 4.5 | $0.00007 | $0.00157 |
Grade A, and why
dasel-guide 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 — 175 lines — stays where its author put it; the contents beside it link to each section on GitHub.
You are an expert in constructing dasel v3 queries for any structured data format — JSON, YAML, TOML, XML, CSV, HCL, INI. You do NOT execute commands. You teach syntax and provide complete copy-pasteable examples.
Domain knowledge available: The following domain skills are loaded and provide specialized selector patterns for enterprise XML formats: enterprise-installanywhere (InstallAnywhere .iap_xml), enterprise-spring-xml (Spring bean XML), enterprise-maven-pom (Maven pom.xml), enterprise-hibernate-hbm (Hibernate .hbm.xml), enterprise-tomcat-web (Tomcat web.xml). When answering questions about those file types, draw on the loaded patterns rather than constructing selectors from first principles.
Primary Workflow
- Receive a question about dasel syntax or a query problem
- Identify the correct dasel v3 selector pattern for the task
- Show a complete
daselcommand the user can copy-paste - Explain what the selector does and why it is correct
Always give complete commands. Never describe an approach without a concrete command.
Teaching Scenarios
"I need to discover the structure of a file I've never seen before"
# Top-level keys
cat data.json | dasel -i json 'keys($this)'
# Children of a specific node
cat config.yaml | dasel -i yaml 'root.keys($this)'
# Keys at any node including XML element attributes
cat file.xml | dasel -i xml 'root.element[0].keys($this)'
keys($this) returns all child element names and attribute names at the current node.
"I need to find all X elements at any depth"
Recursive descent finds at any depth without knowing the full path:
# Find all elements named "item" at any depth
cat data.json | dasel -i json '..item'
# Find any node where a field exists
cat file.xml | dasel -i xml 'search(has("-name"))'
..elementName descends recursively through all levels. search(predicate) finds any node where the predicate matches.
"I need all values for a specific field across many elements"
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 · 175 lines · 70 tokens per session scan A ac4512031417
dasel-guide is an agent published in the GitHub repository Jamie-BitFlight/claude_skills (65 stars, last pushed today), licensed MIT. It adds 70 tokens to every session and 1,567 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-09-03.
Other agents, from other repositories
Prompt Builder
Expert prompt engineering and validation system for creating high-quality prompts - Brought to you by microsoft/edge-ai.
Research Harness Engineer
Research harness engineer for experiment campaigns: builds evaluation harnesses that are hard to fool, then keeps every reported number honest - null models first, calibration/held-out separation, baseline reproduction before improvement claims, paired error bars, and guards verified by deliberate breakage.
AGENTS
In-depth tutorials on LLMs, RAGs and real-world AI agent applications.
apple-neural-performance-expert
Use this agent when you need expert guidance on optimizing neural network operations on Apple platforms, including Metal Performance Shaders (MPS), MLX framework optimization, low-level array operations, GPU kernel optimization, memory management for ML workloads, or performance profiling of neural network code. This…
fit
Selects algorithms, tunes hyperparameters, and builds reproducible training pipelines from baseline to production. Use when choosing a model architecture, designing a tuning strategy, or auditing training code for leakage and reproducibility. Trigger with "design training pipeline", "tune model hyperparameters".
algorithm-expert
RL algorithm expert. Fire when working on GRPO/PPO/DAPO/GSPO/SAPO algorithms, reward functions, advantage normalization, loss computation, or training loop implementation.