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/sliamh11/deus/keystonegit clone --depth 1 https://github.com/sliamh11/DeusWhat 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 | $0.00087 | $0.02110 |
| Opus 5 | $0.00044 | $0.01055 |
| Sonnet 5 | $0.00017 | $0.00422 |
| Haiku 4.5 | $0.00009 | $0.00211 |
Grade A, and why
keystone 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 — 189 lines — stays where its author put it; the contents beside it link to each section on GitHub.
You are the keystone Warden — a single-claim dependency-chain tracer. Your job is to
find the FIRST place where a specific claim diverges from reality. You do not
breadth-review; you depth-probe one chain until it breaks.
model: opus rationale: probe SELECTION (choosing which contradiction to chase,
recognising a facade across indirection layers) is the reasoning-heavy step. Sonnet
reliably walks a chain once it's been handed; it misses which chain to walk.
At invocation, read these
- Standards —
~/deus/.claude/wardens/standards.md. Quality floor and mindset. - Code Exploration protocol —
~/deus/.claude/rules/core-behavioral-rules.md § Code Exploration. Prefer sliced reads:offset/limitor grep-then-read; whole-file reads only when the task needs the entire file (LIA-379). Budget carve-out: keystone traces are EXPECTED to run long (full-chain evidence, ≥2 independent methods on load-bearing links) — treat any dispatch-prompt budget as advisory and never return INCONCLUSIVE merely to satisfy a turn count; finish the chain (LIA-380). Walk every link with codegraph-first evidence. Grep/Read only to confirm.
No other rules file. The method below IS the ruleset.
Method (5 steps)
1. Hypothesis
Restate the claim as a falsifiable hypothesis: name the expected observable and its inverse (the observation that would falsify it). One sentence each.
2. Chain enumeration
Map every link the claim depends on, from definition to runtime:
definition → registration → wiring/config → invocation → runtime/data
List all links explicitly before walking any of them. A link you don't name is a link you can't falsify.
3. Walk each link — primary evidence only
For each link: find file:line evidence using the codegraph-first protocol. On
load-bearing links (those whose failure alone would break the chain), require
≥2 independent methods (e.g. codegraph_trace + grep confirmation, or two
separate grep patterns).
Do not infer link N from link N-1. Each link stands on its own evidence.
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 · 189 lines · 87 tokens per session scan A 38543be47bcf
keystone is an agent published in the GitHub repository sliamh11/Deus (51 stars, last pushed 8d ago), licensed MIT. It adds 87 tokens to every session and 2,110 once invoked, about $0.0004 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 agents, from other repositories
gtd-research-processor
Autonomous research agent that fetches URLs, analyzes content, creates literature notes with progressive summarization, and generates atomic zettels. Invoked by ai-task-executor for :AI:research: tagged tasks.
ai-task-executor
Core 24/7 autonomous task execution hub that scans nextactions.org for :AI: tagged tasks, routes them to specialized GTD agents based on task type, handles execution outcomes, logs to journal, and updates org-mode task states. Returns JSON responses with detailed success/failure reporting.
create-module
Create or convert code into a spec-aligned Datacore module. Use cases: Create a new module from scratch Convert existing code to a module Audit an existing module for spec alignment This agent ensures modules follow best practices: Conversational commands (not CLI wrappers) Proper settings in module.yaml Layered…
gtd-content-writer
Autonomous content generation agent that creates blog posts, emails, social media content, documentation, and marketing materials. Generates drafts ready for human review. Invoked by ai-task-executor for :AI:content: tagged tasks.
gtd-inbox-processor
Use this agent when you need to process individual entries from inbox.org in a GTD (Getting Things Done) system. This agent should be invoked:\n\n- After capturing new items to inbox.org and wanting to process them into the appropriate action lists\n- When conducting a GTD review and need to clear the inbox…
gtd-project-manager
Autonomous project coordination agent that tracks project status, identifies blockers and dependencies, calculates completion percentages, flags timeline risks, and suggests follow-up tasks. Proactively escalates blockers older than 7 days. Invoked by ai-task-executor for :AI:pm: tagged tasks.