NanoProof: Open and Efficient Automated Theorem Proving in Lean 4
Quick summary
arXiv:2610.11605v1 Announce Type: cross Abstract: We introduce NanoProof, to our knowledge the first factorized execution-guided theorem prover in Lean 4 whose training data, extraction tooling, training pipeline, and weights are all released, making it end-to-end reproducible using open-source resources. To this end, we build and release a dataset of structured proof trees, as well as a tool for programmatic interaction and data extraction within the Lean 4 formal verifier. To support sustainable research, we focus on compute efficiency to facilitate accessible training and evaluation. NanoPr
Key takeaways
- arXiv:2610.11605v1 Announce Type: cross Abstract: We introduce NanoProof, to our knowledge the first factorized execution-guided theorem prover in Lean 4 whose training data, extraction tooling, training pipeline, and weights are all released, making it end-to-end reproducible using open-source resources.
- To this end, we build and release a dataset of structured proof trees, as well as a tool for programmatic interaction and data extraction within the Lean 4 formal verifier.
- To support sustainable research, we focus on compute efficiency to facilitate accessible training and evaluation.
Why it matters
“NanoProof: Open and Efficient Automated Theorem Proving in Lean 4” highlights the need for repeatable measurement rather than a single impressive demonstration. Independent validation across datasets and clearly stated limitations determine whether a result can guide product decisions.
Member comments