We present EasyProver, a Lean proving system built from recursive agents with isolated contexts, asynchronous search, parallel tactic probing, and an elastic elaboration service. Using an off-the-shel
EasyProver is a Lean proving system using recursive agents and asynchronous search that solves nearly all Putnam and IMO benchmark problems, while Aegis generates harder verification tasks from competitive programming to benchmark provers and support reinforcement learning.
We present EasyProver, a Lean proving system built from recursive agents with isolated contexts, asynchronous search, parallel tactic probing, and an elastic elaboration service. Using an off-the-shelf frontier model with no additional training, it proves 669/672 PutnamBench problems and all six IMO 2026 formalizations and resolves 597/600 NTP4VC verification conditions and all 189 VERINA tasks by proof or refutation. Because these benchmarks are close to saturation, we also introduce Aegis, which converts competitive programming problems into much harder verification tasks over real implementations. The pipeline writes safe Rust solutions, translates them into Lean with Aeneas, generates…
Summary and abstract excerpt via Hugging Face Papers ↗ · arXiv.
Scaling Lean Theorem Proving for Real-World Code Verification was first seen on Hugging Face · Daily papers on Nov 2, 2026. Since then it has appeared in 9 checks on 2 different days. Its best position was #24 of 30, reached on Nov 2, 15:28 UTC. It dropped off the list after Nov 3, 01:28 UTC.
Position on Hugging Face · Daily papers at every check (lower is better).
Best rank per day (UTC).
Platform metric as reported by Hugging Face.
Archived daily, weekly and monthly lists that include this entry.
Not at the moment. It was last on the list on Nov 3, 01:28 UTC, after 2 days of trending.
#24 on Hugging Face · Daily papers, on Nov 2, 15:28 UTC. Trendoday checks this list every 120 minutes.
It was first seen on Nov 2, 2026 and has been on the list on 2 days (9 checks) since.