math-verification

math-verification is a skill for Claude Code, Codex from gioviat/research-toolkit. It costs 81 tokens per session (541 once invoked), scanned A, original, MIT.

A skill for independently checking mathematical claims, proofs, bounds, formulas, and code that implements formulas.

In plain words
What is it for?
It restates assumptions, tests consistency and boundary cases, performs an independent calculation or re-derivation, and compares the result with the original.
Why use it?
It reduces the risk of accepting an incorrect derivation by checking assumptions, notation, edge cases, examples, and the full reasoning.

Skill for Claude CodeCodex

Part of the research-toolkit plugin — 7 skills, 5 agents, 1 hook shipped together

Install

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.

agentmods
npx agentmods add skills/gioviat/research-toolkit/math-verification
Any agent
npx skills add gioviat/research-toolkit --skill math-verification
Clone the repo
git clone --depth 1 https://github.com/gioviat/research-toolkit

Made for: Claude Code, Codex.

Or install research-toolkit, the plugin that ships this one along with the rest of its 7 skills, 5 agents, 1 hook.

Wrote 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.

agentmods badge for math-verification

README.md
[![agentmods](https://agentmods.dev/badge/skills/gioviat/research-toolkit/math-verification.svg)](https://agentmods.dev/skills/gioviat/research-toolkit/math-verification)
Your own site
<a href="https://agentmods.dev/skills/gioviat/research-toolkit/math-verification"><img src="https://agentmods.dev/badge/skills/gioviat/research-toolkit/math-verification.svg" alt="Measured on agentmods" height="20"></a>
Per session 81 Skills are progressive disclosure: only the name and description are preloaded; the body loads when the skill is used.
When invoked 541 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. Scan, not verified.
Origin original No closer match found in the catalogue.
Token cost

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.

ModelPer sessionOnce invoked
Fable 5 $0.00081 $0.00541
Opus 5 $0.00041 $0.00270
Sonnet 5 $0.00016 $0.00108
Haiku 4.5 $0.00008 $0.00054

Measured 3d ago against content hash 1e98a77adf45, method: parsed. Prices are Anthropic first-party input rates as of 2026-08-30, from the pricing page.

Security

Grade A, and why

math-verification 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 3d 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.

skills/math-verification/SKILL.md · 31 lines

How it starts

The opening of the file, as written. The whole thing — 31 lines — stays where its author put it; the contents beside it link to each section on GitHub.

Math verification

Before checking anything

  • Restate every assumption the claim depends on, explicitly, in your own words. If an assumption is implicit in the source material, name it.
  • State the claim itself in a form precise enough that "true" or "false" is unambiguous. If the claim as given is ambiguous, say so and verify the most natural reading, flagging the ambiguity.
  • Check that all symbols match the project's canonical notation (papers/notation.md). Flag any symbol used inconsistently with that file.

Verification order (cheapest checks first)

  1. Dimensional / type consistency: do units, shapes, or types match on both sides?
  2. Boundary and limiting cases: does the claim reduce to a known result at an edge case (n=1, t=0, d→∞, etc.)?
  3. A small numeric or symbolic example, computed independently (SymPy, a script, or a proof assistant where applicable) — not by re-reading the existing derivation and agreeing with it.
  4. Full independent re-derivation of the result, without looking at the given derivation step-by-step. Only after finishing, compare against the original to see where they diverge.

Rules

  • Never state that a derivation is correct because it "looks standard" or "follows the usual pattern." Redo the steps.
  • If a step cannot be verified with available tools (e.g., it requires a proof assistant you don't have, or relies on an unavailable reference), say exactly that: "unverified — requires X." Never round this up to "likely correct."
  • If you find an error, state the exact line/step where it occurs and what the correct expression should be, rather than a general "there may be an issue here."
  • Distinguish clearly between "I verified this is correct," "I verified this is incorrect," and "I could not verify this."

Output format

For each claim checked, report:

  • Claim (restated precisely)
  • Assumptions used
  • Method of verification (dimensional check / limiting case / independent derivation / symbolic computation)
  • Verdict: correct / incorrect / unverified, with the specific reason

Read the full file on GitHub · 31 lines

Changes

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.

  1. 3d ago First seen · 31 lines · 81 tokens per session scan A 1e98a77adf45

Subscribe to this mod's changes

math-verification is a skill published in the GitHub repository gioviat/research-toolkit (2 stars, last pushed 1mo ago), licensed MIT. It adds 81 tokens to every session and 541 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-31.

Related

Other skills, from other repositories

biopython

Comprehensive molecular biology toolkit. Use for sequence manipulation, file parsing (FASTA/GenBank/PDB), phylogenetics, and programmatic NCBI/PubMed access (Bio.Entrez). Best for batch processing, custom bioinformatics pipelines, BLAST automation. For quick lookups use gget; for multi-service integration use…

K-Dense-AI/scientific-agent-skills · 76 tokens

exploratory-data-analysis

Perform bounded, local exploratory analysis of explicitly supported scientific files. Use for redacted CSV/TSV/JSON profiles; optional NumPy, HDF5, FASTA/FASTQ, and basic image metadata inspection; missingness/leakage audits; outlier and transformation sensitivity; and rigorous EDA report scaffolds. Other domain…

K-Dense-AI/scientific-agent-skills · 83 tokens

nature-statistics

Audit, revise, or draft manuscript statistical reporting for Nature / high-impact journal submissions. Use when the user asks to check statistical analysis sections, p values, confidence intervals, sample size, biological versus technical replicates, randomization, blinding, multiple-comparison correction, model…

Yuan1z0825/nature-skills · 139 tokens

evaluating-with-leakage-gates

Evaluate an OpenMed de-identification or clinical NER model against the leakage-first release gates G1a through G8, which gate releases on residual PHI leakage rather than on F1. Use when the user wants to run the OpenMed eval harness on a synthetic golden set, decide whether a de-id model is RELEASABLE or…

maziyarpanahi/openmed · 158 tokens

mapping-to-snomed

Maps clinical concept spans extracted by OpenMed to SNOMED CT concepts through a USER-SUPPLIED terminology server (the user's own Ontoserver, Snowstorm, or UMLS/UTS), never a bundled vocabulary. Use when the user wants to code findings, disorders, procedures, body structures, or substances to SNOMED CT, run an ECL…

maziyarpanahi/openmed · 205 tokens

mixed-precision

Use FP16/BF16 mixed precision to accelerate training and reduce memory. Use when optimizing GPU performance.

aiming-lab/AutoResearchClaw · 25 tokens