HUNYUANPROVER: A Scalable Data Synthesis Framework and Guided Tree
  Search for Automated Theorem Proving
We introduce HunyuanProver, an language model finetuned from the Hunyuan 7B
for interactive automatic theorem proving with LEAN4. To alleviate the data
sparsity issue, we design a scalable framework to iterative synthesize data
with low cost. Besides, guided tree search algorithms are designed to enable
effective ``system 2 thinking`` of the prover. HunyuanProver achieves
state-of-the-art (SOTA) performances on major benchmarks. Specifically, it
achieves a pass of 68.4% on the miniF2F-test compared to 65.9%, the current
SOTA results. It proves 4 IMO statements (imo_1960_p2, imo_1962_p2},
imo_1964_p2 and imo_1983_p6) in miniF2F-test. To benefit the community, we will
open-source a dataset of 30k synthesized instances, where each instance
contains the original question in natural language, the converted statement by
autoformalization, and the proof by HunyuanProver.
6776bdde4f9262d263382cf3
Yang Li
6776bdde4f9262d263382cf4
Dong Du
claimed_verified
2025-07-29T07:12:45.223Z
651eaaad567de56557e7bde6
/avatars/7ddf08fe4459fa2b7b3796be4eb4f43d.svg
duu
user
dongdongdongdu
6776bdde4f9262d263382cf5
Linfeng Song
claimed_verified
2025-07-11T08:21:06.484Z
64c94eddcb2f1bf0e7db5a4d
/avatars/f7e2532d3c85d5e5b5a02c579ea68c3a.svg
Linfeng Song
user
freesunshine0316
6776bdde4f9262d263382cf6
Chen Li
6776bdde4f9262d263382cf7
Weikang Wang
6776bdde4f9262d263382cf8
Tao Yang
6776bdde4f9262d263382cf9
Haitao Mi
HUNYUANPROVER: A Scalable Data Synthesis Framework and Guided Tree
  Search for Automated Theorem Proving
We introduce HunyuanProver, an language model finetuned from the Hunyuan 7B
for interactive automatic theorem proving with LEAN4. To alleviate the data
sparsity issue, we design a scalable framework to iterative synthesize data
with low cost. Besides, guided tree search algorithms are designed to enable
effective ``system 2 thinking`` of the prover. HunyuanProver achieves
state-of-the-art (SOTA) performances on major benchmarks. Specifically, it
achieves a pass of 68.4% on the miniF2F-test compared to 65.9%, the current
SOTA results. It proves 4 IMO statements (imo_1960_p2, imo_1962_p2},
imo_1964_p2 and imo_1983_p6) in miniF2F-test. To benefit the community, we will
open-source a dataset of 30k synthesized instances, where each instance
contains the original question in natural language, the converted statement by
autoformalization, and the proof by HunyuanProver.
HunyuanProver, a language model fine-tuned for interactive theorem proving with LEAN4, achieves state-of-the-art performance on benchmarks by using a scalable data synthesis framework and guided tree search algorithms.
language model Hunyuan 7B interactive automatic theorem proving LEAN4 data sparsity scalable framework iterative synthesize low cost guided tree search algorithms system 2 thinking state-of-the-art performance miniF2F-test autoformalization