Skip to content
All flows

recursive_lean_prover ​

Prove a theorem in Lean by splitting it up. Each lemma gets one plan from humanize1:gen-plan, a proof in prose revised until a reviewer finds no invalid step, a split into child lemmas where it needs one, and a formal proof built by humanize1:rlcr in a git worktree of its own. A lemma is accepted when your comparator passes and a fresh reviewer reruns it; it is then written to a Markdown wiki, and lemmas waiting on it can start.

flowverse v0.2.0

In hmz, open /flow → Flowverses → official and install recursive_lean_prover and installs humanize1, which it calls. Or run the release without installing anything:

hmz exec -f 'git+https://github.com/humanfia/recursive-lean-prover-flow@v0.2.0#recursive_lean_prover' …
release
v0.2.0 · commit 0631b18
earlier
v0.1.2 · v0.1.1 · v0.1.0
needs
humanize1 >=0.2.0,<0.3.0
licence
Apache-2.0

Read from humanfia/flowverse when this site was built.

worker: claude · codex · kimimeant for codex in both roles
recursive_lean_proversimulated

The whole run, at rest. Step through it with the buttons, or drag the bar.

One lemma of the proof. Its prose proof is revised from the reviewer’s first invalid step until it holds; then it splits, and each child lemma runs this same line a level down, at once. Once they are proved it is formalized, and accepted into the wiki.

The run, turn by turn
  1. worker — one plan; a session opened for this turn; runs humanize1:gen-plan
  2. worker — proof in prose; a session opened for this turn; hands reviewer as words: the proof
  3. reviewer — audits each step; a session opened for this turn; hands worker as words: invalid at step 3
  4. worker — revises step 3; a session opened for this turn; hands reviewer as words: the proof, revised
  5. reviewer — audits it again; a session opened for this turn; hands worker as words: valid
  6. worker — splits it in two; a session opened for this turn; hands worker, as builder as words: children proved
  7. worker, as builder — Lean, on a branch; a session opened for this turn; runs humanize1:rlcr; hands comparator in the tree: the candidate
  8. comparator — comparator passes; no turn of a model; hands reviewer in the tree: the same candidate
  9. reviewer — reruns it: accepted; a session opened for this turn; hands the finish as words: into the wiki

It ends when the root theorem is proved, the root theorem is refused, or the budget runs out.

See also: humanize1, the phases it is built from.