Palomar Opens Registry for Lean-Verified Mathematics
On August 18, Palomar opened a public registry for Lean formalizations whose proofs have been machine-checked, with entries based on fixed snapshots of public repositories. Mathematician Terry Tao described it as an analogue of a preprint server for Lean proofs. According to Palomar, entries record the exact checked statement, dependencies, verification result, and editorial-review findings.
Palomar has opened a public, searchable registry for mathematical results formalized and machine-checked in the Lean proof assistant. The registry accepts submissions based on immutable snapshots of public repositories and publishes the exact formal statement, library dependencies, proof-check result, and documented editorial-review findings for registered entries.
In an August 18 announcement, mathematician Terry Tao described Palomar as a "zeroth approximation" to a preprint server for Lean proofs. Tao wrote that the registry is intended to help readers assess claims emerging from a growing body of AI-generated and AI-assisted mathematical proofs, where verifying both the formal proof and its relationship to an informal mathematical claim can be difficult for non-specialists.
Two distinct review layers
According to Palomar's documentation, a registrable repository version must pass a mechanical verification process and an automated editorial review without a blocking issue.
For the mechanical layer, Palomar records a formal challenge statement separately from its proof. Its Comparator tool checks that the proof establishes that recorded statement, rather than a weakened alternative. The exported proof is replayed by Lean's kernel and the independent NanoDa kernel, while the registry also checks that only axioms permitted by Palomar's current policy are used.
The registry's second layer is non-mechanical. Palomar states that a language model evaluates whether the formal statement is a fair rendering of the associated informal account, which can appear in project documentation, declaration docstrings, a README, or formalization.yaml. The review standard also includes a research-interest threshold, according to the registry's About page.
Tao's description of the expected repository structure identifies three core artifacts:
- •A challenge file containing a short, human-readable Lean description of the result claimed.
- •A solution module containing the formal proof.
- •A formalization.yaml file with an informal description, metadata, and disclosures.
What the registry establishes
Palomar's published process separates several questions that are often conflated in formal-mathematics announcements: whether Lean accepts a proof, whether the proof uses permitted axioms, whether it proves the advertised formal theorem, and whether that theorem reasonably corresponds to an informal claim. The first three are grounded in mechanical checks; the last is explicitly an LLM-mediated editorial judgment rather than a mathematical proof of semantic equivalence.
For researchers building AI systems for theorem proving, that distinction is material. Formal proof verification can establish properties of a precisely specified Lean statement, but model-generated prose can still overstate, underspecify, or mischaracterize the theorem being formalized. Registries with immutable repository references and explicit proof artifacts can make independent inspection, citation, and reproducibility easier across both human and AI-assisted formalization work.
Palomar's documentation describes the project as a registry of external GitHub repository snapshots, rather than a repository that hosts all underlying code itself. That design ties each registered claim to a specific source state, avoiding ambiguity when a public proof project later changes.
Key Points
- 1Palomar indexes immutable Lean repository snapshots, linking each registered mathematical claim to an exact statement, dependencies, and proof-check record.
- 2The registry separates kernel-based proof verification from LLM review of whether formal and informal theorem descriptions correspond fairly.
- 3For AI theorem-proving research, searchable verified artifacts can improve reproducibility while preserving the distinction between syntax and mathematical interpretation.
Scoring Rationale
Palomar provides potentially useful verification and discovery infrastructure for formal mathematics and AI-assisted theorem proving. Its dual treatment of proof validity and informal-claim review is particularly relevant to researchers evaluating machine-generated formalization claims, and the registry is newly open for submissions.
Sources
Primary source and supporting public references used for this report.
Practice interview problems based on real data
1,625 SQL & Python problems across 15 industry datasets — the exact type of data you work with.
Try 250 free problems