Mathematicians · students · physicists · computer scientists
Computer-verified mathematics, by just talking. Ask in plain English and get back a proof a machine has actually checked.
“Prove that the product of two consecutive integers is even.”
n(n+1) — 4 steps, each one checked
“Prove that n = n + 1.”
no derivation exists — submission rejected
Ask in your own words. You don't need the name of a theorem to find the result that already exists.
You ask in English. What comes back is compiled Lean 4, not plausible-sounding text. If one step fails, nothing passes.
-- "the product of two consecutive integers is even" theorem even_mul_succ_self (n : ℤ) : Even (n * (n + 1)) := by rcases Int.even_or_odd n with h | h · exact h.mul_right _ · exact (Int.even_add_one.mpr (Int.not_even_iff_odd.mpr h)).mul_left _ ✓ compiled · 0 errors · 0 sorry axioms: propext, Classical.choice, Quot.sound
Every lemma you submit becomes a reusable block. Even an unproven conjecture can be posted — anything resting on it stays marked conditional until it's proved.
Attribution is mechanical, not declared. The graph knows who builds on what, and says so.
This box searches and verifies. To prove and submit your own results, sign in below and use your assistant.
The page hands you a ready-to-paste setup for Claude Code · Cursor · VS Code · OpenAI's SDK — any MCP client. Reading and searching need no account at all.