Break a hard mathematical problem into smaller claims and have a swarm of agents attempt to prove each one.
Keep a verified record of which mathematical facts have actually passed a checking step, avoiding unverified claims creeping into the result.
Generate a human-readable progress report or a publishable LaTeX paper from a completed proof search.
Study the fact-graph and role-separation architecture as a pattern for other multi-agent verification systems.
| frenzymath/danus | agricidaniel/claude-shorts | calesthio/generative-media-skills | |
|---|---|---|---|
| Stars | 92 | 93 | 93 |
| Language | Python | Python | Python |
| Setup difficulty | hard | moderate | easy |
| Complexity | 5/5 | 3/5 | 2/5 |
| Audience | researcher | developer | developer |
Figures from each repo's GitHub metadata at analysis time.
Requires your own API keys for Claude Code and a codex backend, plus running a local verification service.
Danus is a Python system that coordinates a team of AI agents to work through mathematical proofs together and keep track of what has actually been verified as true. A main agent, built on Claude Code, plans the overall strategy and directs a group of worker agents, each built on the codex tool, that attempt to prove individual pieces of a larger problem, such as a single lemma or example. The key design choice is a strict separation of roles. Workers submit a claim along with a supporting proof, and a separate verifier agent checks it and either accepts or rejects it with feedback for revision. Only the verifier can decide whether something counts as proven, and it does not keep memory between checks, judging each submission fresh. Once a claim passes, it is added to a shared fact graph, a structure that records every verified result and which earlier facts it depended on. The main agent itself has no ability to add unverified claims to this fact graph, so the separation between planning and truth checking is built into the system rather than relying on instructions alone. Because each worker only needs to load the specific facts relevant to its current claim, the amount of context any single agent has to hold stays manageable even as the overall proof grows very large. The README shows an example run that produced over 3,100 verified facts connected by more than 8,600 dependencies. Once a problem is solved, Danus can turn the accumulated fact graph into a written report or a formatted LaTeX paper. Setup involves running a bootstrap script to install dependencies, copying example configuration files and filling in your own API keys, starting a verification service, and then connecting Claude Code to the project directory. The system relies on the user's own API keys throughout and is licensed under Apache 2.0. Danus builds on an earlier project by the same team called Rethlas.
Danus coordinates a Claude Code main agent and a swarm of worker agents to collaboratively prove mathematical statements, with a separate verifier that gates every claim into a shared fact graph.
Mainly Python. The stack also includes Python, Claude Code, Codex.
Apache 2.0 license, free to use, modify, and distribute including for commercial purposes, with patent protection included.
Setup difficulty is rated hard, with roughly 1h+ to a first successful run.
Mainly researcher.
This repo across BitVibe Labs
double-check against the repo, no cap.