Skip to content

Goedel-Prover

An open model for automated theorem proving in Lean 4

Visit official site

What Goedel-Prover is

The model is described as an open large language model for automated theorem proving that turns natural-language maths problems into Lean 4 statements. It generates formal proofs and is evaluated on several benchmarks.

What you can do with it

  • Translate maths problems into formal Lean 4 code
  • Generate formal proofs from those statements
  • Run inference in parallel across several GPUs

Benchmark and data notes

  • A 57.6% success rate on miniF2F is stated
  • Seven PutnamBench problems are reported as solved
  • 29.7K formal proofs were made for Lean Workbook

Pros & cons

✓ What we like

  • Multiple datasets support performance evaluation
  • Multi-GPU parallel inference is supported

! What to watch out for

  • Setup involves cloning the repository and building a maths library
  • Proofs are produced in the Lean 4 formal language

FAQ

Which benchmarks are named?

miniF2F and PutnamBench appear in the features, with a 57.6% miniF2F success rate stated.

Is the model open?

The material describes open models and datasets for research and extension.

Last reviewed: 2026-11-15

More LLM API platform tools

View all →

How we review