Theorem-prover training stops scaling data: 500 boundary-hard tasks mined from verified proofs lift both provers
Reinforcement learning for formal theorem proving is bottlenecked by scarce hard tasks: existing Lean problems are either already solved by current provers or too uninformative. ProofFrontier starts from verified Lean theorem–proof pairs, keeps each theorem statement unchanged, and hides proof-structural guidance around key local nodes so the prover must rediscover intermediate reasoning; base-prover pass rates then select tasks that are solvable in principle but not easily solved. GRPO training on 500 synthesized tasks improves DeepSeek-Prover-V2-7B and Goedel-Prover-V2-8B on miniF2F, ProofNet and PutnamBench over each base model.