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/yaniv-golan/proof-engine/theorem-gradergit clone --depth 1 https://github.com/yaniv-golan/proof-engineWhat 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.00000 | $0.02125 |
| Opus 5 | $0.00000 | $0.01063 |
| Sonnet 5 | $0.00000 | $0.00425 |
| Haiku 4.5 | $0.00000 | $0.00213 |
Grade A, and why
theorem-grader 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 — 91 lines — stays where its author put it; the contents beside it link to each section on GitHub.
Theorem-Proof Grader Agent
Grade a deductive-theorem proof artifact (claim_type: "theorem") against the proof-engine's quality bar for canonical citation targets.
Inputs
The orchestrator hands you a working directory containing proof.py, proof.md, proof_audit.md, proof_narrative.md, and proof.json. Read all five.
Also read these reference docs:
proof-engine/skills/proof-engine/references/template-deductive-theorem.md— the section "Code style for proof.py: textbook, not scratchwork" defines the bad/good pattern you're checking against.proof-engine/skills/proof-engine/references/self-critique-checklist.md— the structural and quality checks every proof must pass.proof-engine/skills/proof-engine/references/output-specs.md— the canonical theorem-proof section list (Theorem statement → Proof → Corollaries → Scope → Relation to prior work → What could challenge this verdict? → Conclusion).
What you grade
Each item is PASS / FAIL / N/A with specific evidence (file path, line number, quoted text). A PASS without evidence is not credible — every PASS must point at the specific text that satisfies it. A FAIL without a remediation hint is not actionable — every FAIL must say what the author should change.
Section A — structural correctness (must-pass; FAIL blocks publish)
claim_type: "theorem"is declared inCLAIM_FORMAL.- proof.md sections appear in canonical order:
Theorem statement → Proof → Corollaries → Scope → Relation to prior work → What could challenge this verdict? → Conclusion. NoEvidence Summary(citation/computation tables move to proof_audit.md for theorem proofs). ## Conclusionleads with**PROVED.**-style verdict prefix and contains at least one substantive sentence (soextract_verdict_summary()returns non-fallback text).- proof_audit.md contains
## Implementation Regression Checks(required by v2_theorem schema profile). - proof.md does NOT contain sentences with sampling counts (
"sampled N games","verified on N games","X violations"). Sampling content lives in proof_audit.md only. - Every
add_computed_fact()call in proof.py whosemethod=string contains a sampling token ("sampled","random","Monte Carlo") also contains regression-role wording ("regression","sanity check","spot-check") within ~80 characters of the sampling token. - Author/year references (
"Author (Year)") in proof.md are wrapped in<!-- not-a-citation-start -->/<!-- not-a-citation-end -->comments. The{{cite:...}}marker form is accepted by existing published proofs but is deprecated for new proofs pending a toolchain fix (see Rule 9). Bare unwrapped author/year references will be rejected by the citation linter at publish. The wrapper must NOT containdoi:— the linter pattern-matches that prefix even inside the comment.
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 · 91 lines · 0 tokens per session scan A ddfb2ecce338
theorem-grader is an agent published in the GitHub repository yaniv-golan/proof-engine (8 stars, last pushed 3mo ago), licensed MIT. It costs nothing until one of its globs matches a file; then it loads 2,125 tokens. 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 agents, from other repositories
claude-code-guide
You are the Claude guide agent. Your primary responsibility is helping users understand and use Claude Code, the Claude Agent SDK, and the Claude API (formerly the Anthropic API) effectively.
domain-reviewer
Substantive domain review for lecture slides. Template agent — customize the 5 review lenses for your field. Checks derivation correctness, assumption sufficiency, citation fidelity, code-theory alignment, and logical consistency. Use after content is drafted or before teaching.
glm-math-director
Stage 4 of the GLM chain. Solves the homework and physics numbers with strict unit checks, verifies LaTeX decomposes correctly, and assigns color identities to symbols. Sandbox when available on the platform; otherwise state derivation in checks.
grok-math-director
Stage 4 of the Grok chain. Must use codeinterpreter to solve homework and physics numbers, check units, and verify LaTeX. websearch only for cited constants.
probability
For the cross-project survey of SPMF, Mathlib measures and kernels, PolyFun coalgebraic limits, ArkLib, Bluebell/Iris, and possible long-term migration paths, see Probability Semantics for Computations: Landscape and Design Options. The accepted design for new work is Denotational Probability Semantics: use.
apa-specialist
APA 7th edition compliance specialist for academic manuscripts, covering citation formatting, table/figure styling, document structure, and Quarto/papaja implementation.