Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement

arXiv:2606.06468Submitted Jun 5, 20260 benchmark results

Authors pending

Abstract

Uses blueprint dependency graphs and parallel Lean proving with DeepSeek-V4-Flash; achieves 99.2% pass@1 on MiniF2F-test and 75.6% on PutnamBench at a fraction of prior cost.

Tasks

edit

• Language models

Results

No benchmark results recorded yet.

submit

Benchmark results referencing this paper haven't been added to the registry yet. If you have a reproduction, submit it →

CodeSOTA extraction

Benchmark evidence

edit

Link this paper to benchmark rows, datasets, model cards, and reproduced results as evidence is extracted.

Add or update benchmark results

Logged-in editor · benchmark trail

Three places to go from here.

Index

All papers

All tracked papers in the registry, with benchmark result, model, and leaderboard linkage where available.

Replacement

Papers with Code is dead — alternatives

What replaced PWC for each use case: LLMs, OCR, speech, vision, robotics.

Top hub

Language models

Every benchmark in Language models.