Palomar – a registry of Lean verified mathematics
Palomar – a registry of Lean verified mathematics
18 August, 2026 in admin, advertising | Tags: Lean, Palomar | by Terence Tao
In recent months there has been a proliferation of AI-generated proofs of various old and new results, some of which have been formalized in the proof assistant language Lean. However, checking that a given Lean repository actually proves the claimed statement is somewhat non-trivial, especially for an audience which is not expert in the use of Lean: one has to first check that the claimed formal Lean statements have proofs that typecheck, that the proofs do not contain any “cheats” such as adding additional axioms, and that the formal statements also match (in a semantic sense) the informal description of the claimed results.
To help bring some clarity to this situation, I am happy to announce that Palomar registry of Lean verified mathematics, which is an initiative incubated by the Lean FRO and by ICARM, is now open for submissions. I am serving in several roles on this registry, including on the scientific advisory board, together with Jeremy Avigad, Matthew Ballard, Jaume de Dios, Nestor Guillen, Bryna Kra, Kim Morrison, Ravi Vakil, and Akshay Venkatesh.
A detailed motivation for Palomar can be found here, and further information about Palomar can be found here. A zeroth approximation of what Palomar intends to be is the analogue of a preprint server for Lean proofs. More precisely, Palomar (which is named after the astronomical observatory) is a registry of external Github repositories (or more precisely, “snapshots” of such repositories, as represented by a specific Github commit) containing Lean code adhering to the current best practices for such formalizations, in particular containing
- A “challenge file” containing a short, human readable description in Lean of the results claimed.
- A “solution module” containing an (arbitrarily long) proof of the results claimed in the challenge file.
- A “formalization.yaml” file describing the results in informal language, and also containing a number of other relevant metadata and disclosures.
- Print (Opens in new window) Print
- Email a link to a friend (Opens in new window) Email
- More
- Share on X (Opens in new window) X
- Share on Facebook (Opens in new window) Facebook
- Share on Reddit (Opens in new window) Reddit
- Share on Pinterest (Opens in new window) Pinterest
- Palomar - a registry of Lean verified mathematics
- A digestion of the proof of Sendov's conjecture
- A digestion of the Jacobian conjecture counterexample
- Career advice
- About
- Notes on the classification of complex Lie algebras
- Does one have to be a genius to do maths?
- Books
- On writing
- Work hard
- August 2026 (3)
- July 2026 (9)
- June 2026 (3)
- May 2026 (1)
- March 2026 (4)
- February 2026 (3)
- January 2026 (4)
- December 2025 (5)
- November 2025 (5)
- September 2025 (1)
- August 2025 (3)
- July 2025 (1)
- June 2025 (2)
- May 2025 (5)
- April 2025 (2)
- March 2025 (1)
- February 2025 (3)
- January 2025 (1)
- December 2024 (3)
- November 2024 (4)
- October 2024 (1)
- September 2024 (4)
- August 2024 (3)
- July 2024 (3)
- June 2024 (1)
- May 2024 (1)
- April 2024 (5)
- March 2024 (1)
- December 2023 (2)
- November 2023 (2)
- October 2023 (1)
- September 2023 (3)
- August 2023 (3)
- June 2023 (8)
- May 2023 (1)
- April 2023 (1)
- March 2023 (2)
- February 2023 (1)
- January 2023 (2)
- December 2022 (3)
- November 2022 (3)
- October 2022 (3)
- September 2022 (1)
- July 2022 (3)
- June 2022 (1)
- May 2022 (2)
- April 2022 (2)
- March 2022 (5)
- February 2022 (3)
- January 2022 (1)
- December 2021 (2)
- November 2021 (2)
- October 2021 (1)
- September 2021 (2)
- August 2021 (1)
- July 2021 (3)
- June 2021 (1)
- May 2021 (2)
- February 2021 (6)
- January 2021 (2)
- December 2020 (4)
- November 2020 (2)
- October 2020 (4)
- September 2020 (5)
- August 2020 (2)
- July 2020 (2)
- June 2020 (1)
- May 2020 (2)
- April 2020 (3)
- March 2020 (9)
- February 2020 (1)
- January 2020 (3)
- December 2019 (4)
- November 2019 (2)
- September 2019 (2)
- August 2019 (3)
- July 2019 (2)
- June 2019 (4)
- May 2019 (6)
- April 2019 (4)
- March 2019 (2)
- February 2019 (5)
- January 2019 (1)
- December 2018 (6)
- November 2018 (2)
- October 2018 (2)
- September 2018 (5)
- August 2018 (3)
- July 2018 (3)
- June 2018 (1)
- May 2018 (4)
- April 2018 (4)
- March 2018 (5)
- February 2018 (4)
- January 2018 (5)
- December 2017 (5)
- November 2017 (3)
- October 2017 (4)
- September 2017 (4)
- August 2017 (5)
- July 2017 (5)
- June 2017 (1)
- May 2017 (3)
- April 2017 (2)
- March 2017 (3)
- February 2017 (1)
- January 2017 (2)
- December 2016 (2)
- November 2016 (2)
- October 2016 (5)
- September 2016 (4)
- August 2016 (4)
- July 2016 (1)
- June 2016 (3)
- May 2016 (5)
- April 2016 (2)
- March 2016 (6)
- February 2016 (2)
- January 2016 (1)
- December 2015 (4)
- November 2015 (6)
- October 2015 (5)
- September 2015 (5)
- August 2015 (4)
- July 2015 (7)
- June 2015 (1)
- May 2015 (5)
- April 2015 (4)
- March 2015 (3)
- February 2015 (4)
- January 2015 (4)
- December 2014 (6)
- November 2014 (5)
- October 2014 (4)
- September 2014 (3)
- August 2014 (4)
- July 2014 (5)
- June 2014 (5)
- May 2014 (5)
- April 2014 (2)
- March 2014 (4)
- February 2014 (5)
- January 2014 (4)
- December 2013 (4)
- November 2013 (5)
- October 2013 (4)
- September 2013 (5)
- August 2013 (1)
- July 2013 (7)
- June 2013 (12)
- May 2013 (4)
- April 2013 (2)
- March 2013 (2)
- February 2013 (6)
- January 2013 (1)
- December 2012 (4)
- November 2012 (7)
- October 2012 (6)
- September 2012 (4)
- August 2012 (3)
- July 2012 (4)
- June 2012 (3)
- May 2012 (3)
- April 2012 (4)
- March 2012 (5)
- February 2012 (5)
- January 2012 (4)
- December 2011 (8)
- November 2011 (8)
- October 2011 (7)
- September 2011 (6)
- August 2011 (8)
- July 2011 (9)
- June 2011 (8)
- May 2011 (11)
- April 2011 (3)
- March 2011 (10)
- February 2011 (3)
- January 2011 (5)
- December 2010 (5)
- November 2010 (6)
- October 2010 (9)
- September 2010 (9)
- August 2010 (3)
- July 2010 (4)
- June 2010 (8)
- May 2010 (8)
- April 2010 (8)
- March 2010 (8)
- February 2010 (10)
- January 2010 (12)
- December 2009 (11)
- November 2009 (8)
- October 2009 (15)
- September 2009 (6)
- August 2009 (13)
- July 2009 (10)
- June 2009 (11)
- May 2009 (9)
- April 2009 (11)
- March 2009 (14)
- February 2009 (13)
- January 2009 (18)
- December 2008 (8)
- November 2008 (9)
- October 2008 (10)
- September 2008 (5)
- August 2008 (6)
- July 2008 (7)
- June 2008 (8)
- May 2008 (11)
- April 2008 (12)
- March 2008 (12)
- February 2008 (13)
- January 2008 (17)
- December 2007 (10)
- November 2007 (9)
- October 2007 (9)
- September 2007 (7)
- August 2007 (9)
- July 2007 (9)
- June 2007 (6)
- May 2007 (10)
- April 2007 (11)
- March 2007 (9)
- February 2007 (4)
- expository (325) * tricks (13)
- guest blog (10)
- Mathematics (924) * math.AC (9) * math.AG (43) * math.AP (115) * math.AT (17) * math.CA (197) * math.CO (207) * math.CT (9) * math.CV (40) * math.DG (37) * math.DS (90) * math.FA (24) * math.GM (16) * math.GN (21) * math.GR (90) * math.GT (17) * math.HO (14) * math.IT (13) * math.LO (54) * math.MG (48) * math.MP (31) * math.NA (26) * math.NT (213) * math.OA (22) * math.PR (114) * math.QA (6) * math.RA (49) * math.RT (21) * math.SG (4) * math.SP (48) * math.ST (11)
- non-technical (213) * admin (49) * advertising (82) * diversions (7) * media (14) * journals (3) * obituary (15)
- opinion (37)
- paper (272) * book (23) * Companion (13) * update (26)
- question (128) * polymath (87)
- talk (69) * DLS (20)
- teaching (190) * 245A – Real analysis (11) * 245B – Real analysis (22) * 245C – Real analysis (6) * 246A – complex analysis (11) * 246B – complex analysis (5) * 246C – complex analysis (5) * 247B – Classical Fourier Analysis (5) * 254A – analytic prime number theory (19) * 254A – ergodic theory (18) * 254A – Hilbert's fifth problem (12) * 254A – Incompressible fluid equations (5) * 254A – random matrices (14) * 254B – expansion in groups (8) * 254B – Higher order Fourier analysis (9) * 255B – incompressible Euler equations (2) * 275A – probability theory (6) * 285G – poincare conjecture (20) * Logic reading seminar (8)
- The sciences (1)
- travel (26)
- Polymath News and AI and at a later stage to consider resources and tools that can advance such projects. Tim Gowers recently proposed […]")
- Polymath projects 2021 Following the post and separate posts describing some of […]")
- A sort of Polymath on a famous MathOverflow problem
- Ten Years of Polymath
- Updates and Pictures by Bucić, Kwan, Pokrovskiy, and Sudakov First, there is a remarkable development on Rota’s basis conjecture (Polymath12) described in the paper Halfway to Rota’s basis conjecture, by Matija Bucić, Matthew Kwan, Alexey Pokrovskiy, and Benny Sudakov Abstract: In 1989, Rota made the following conject […]")
- Polymath proposal: finding simpler unit distance graphs of chromatic number 5, defined as the minimum number of colours that can be assigned to the points of the plane so as to prevent any two points unit distance apart from being the same colour. It was first posed in 1950 and the bounds […]")
- A new polymath proposal (related to the Riemann Hypothesis) over Tao’s blog A new polymath proposal over Terry Tao’s blog who wrote: “Building on the interest expressed in the comments to this previous post, I am now formally proposing to initiate a “Polymath project” on the topic of obtaining new upper bounds on the de Bruijn-Newman constant . […]")
- Spontaneous Polymath 14 – A success!")
- Polymath 13 – a success!
- Non-transitive Dice over Gowers’s Blog is now running over Gowers blog. (Here is the link to the first post.) ")
(There are also some additional technical requirements for the repository which I will omit here.) If a snapshot of a repository is submitted to Palomar, it will check both (a) that the solution module typechecks and proves exactly the results claimed in the challenge file, and that (b) the informal description of the result in the formalization.yaml file appears to match the result claimed in the challenge file, and that the repository meets various minimal standards required for a registry entry. The first check (a) is purely mechanical, using the Lean tool Comparator; the second check (b) is non-deterministic, being performed by a large language model. If a repository passes both checks, it can be registered on Palomar. It is worth stressing that the checks in (a) and (b) fall well short of what a proper human peer review of a submission for novelty, interest, and accuracy would give; in particular, Palomar is not a peer-reviewed journal.
The submission process is thorough, but achievable: as a test, I successfully managed to submit my own recent formalization of the proof of Sendov’s conjecture to Palomar, and also plan to submit some older formalizations to the registry soon.
In any event, the registry is now open for formalizations of both old and new results. Submissions (whether human-generated, AI-generated, or some mixture of both) are welcome; please read the (somewhat detailed) instructions here before starting a submission. (I will however note that modern AI agents are quite helpful in assisting with the mechanical details of the submission, though a human review is still strongly recommended.)
Discussion and feedback on Palomar will occur on this Zulip channel.
Share this:
Like Loading...
Recent Comments
| | Terence Tao on Palomar – a registry of… |
| ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ | ---------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- |
|
| Anonymous on A digestion of the proof of Se… |
|
| Terence Tao on Palomar – a registry of… |
|
| Anonymous on Palomar – a registry of… |
|
| Lars Warren Ericson on Palomar – a registry of… |
|
| Teng Zhang on A digestion of the proof of Se… |
|
| Terence Tao on Palomar – a registry of… |
|
| Teng Zhang on A digestion of the proof of Se… |
|
| Anonymous on Palomar – a registry of… |
|
| ygtisik on Palomar – a registry of… |
|
| Terence Tao on Palomar – a registry of… |
|
| Terence Tao on Palomar – a registry of… |
|
| Terence Tao on Palomar – a registry of… |
|
| Anonymous on Palomar – a registry of… |
|
| David Bevan on Palomar – a registry of… |
Top Posts
Archives
Categories
###
additive combinatorics approximate groups arithmetic progressions Artificial Intelligence Ben Green Cauchy-Schwarz Cayley graphs central limit theorem Chowla conjecture compressed sensing correspondence principle cosmic distance ladder distributions divisor function eigenvalues Elias Stein Emmanuel Breuillard entropy equidistribution Erdos ergodic theory Euler equations exponential sums finite fields Fourier transform Freiman's theorem Gowers uniformity norm Gowers uniformity norms graph theory Gromov's theorem GUE Hilbert's fifth problem ICM incompressible Euler equations inverse conjecture Joni Teravainen Kaisa Matomaki Kakeya conjecture Lie algebras Lie groups Liouville function Littlewood-Offord problem Maksym Radziwill Mobius function Navier-Stokes equations nilpotent groups nilsequences nonstandard analysis Paul Erdos politics polymath1 polymath8 Polymath15 polynomial method polynomials prime gaps prime numbers prime number theorem random matrices randomness Ratner's theorem regularity lemma Ricci flow Riemann zeta function Schrodinger equation Shannon entropy sieve theory structure Szemeredi's theorem Tamar Ziegler ultrafilters universality Van Vu wave maps Yitang Zhang
The Polymath Blog
15 comments
Comments feed for this article
Anonymous
cool
Anonymous
\> the second check (b) is non-deterministic, being performed by a large language model
Shouldn’t this be just preliminary? I think submissions should have an additional, human-performed level of verification.
As stated above, Palomar does not perform human review of repositories, which will not scale to the volume of repositories we envisage processing. (This is similar to the arXiv, which performs minimal checks of acceptability for the preprints it accepts, but also does not perform human review.) However, we would be fine with a third-party service performing additional review on top of the minimal checks that Palomar performs.
Anonymous
As GitHub is becoming less reliable every year, have you considered alternate git forges or hosting the repositories yourself instead of relying on external companies to keep their services available in the future?
We do not have the resources to host and maintain repositories directly, but would be open to expanding the whitelist of approved repository hosting services beyond Github if there is sufficient demand for doing so.
A very quick look at Palomar suggests that it would be much more helpful if each submission required (a) a meaningful Title, and (b) a (well-written) Abstract explaining what is proved — just as one sees in arXiv. At present, the titles and descriptions do not enable me to understand what many of the submissions achieve.
To be honest, I’m rather shocked that this went live without a requirement of this sort. (Who is the main interface actually supposed to be for if it’s impossible to work out what entries are about?)
I’ll pass this suggestion on to the maintainers. Currently we rely on the \`project.name\` and \`project.description\` fields of the repository \`formalization.yaml\` to provide the informal description of the project, although this does not perfectly map on to the title and abstract of a preprint because the claims being registered may only form a subset of the content of the repository, rather than represent the full repository project itself. So there may be a need to add separate title and abstract fields, but this will need some discussion to implement properly.
Anonymous
Such a good idea! Do you think that there is a chance of integration with Androma? If so, please get in touch with viktor@androma.org
ygtisik
nice idea overall for setting a level. I work on whataifound.org to maintain a documented registry of AI usage and contributions in math and science. Palomar will definitely be something we integrate for data checks and validation.
Anonymous
Is there consideration of requiring or at least marking submissions that include a human readable explanation of the proof(which can be higher level than a normal paper since the proof is formalized alongside it). I’m concerned that the machinery behind them will become much less accessible for reuse.
This registry is not designed to assess informal proofs (see item 3 of <https://palomar-registry.org/about#what-palomar-is-not>). However, we have no objection to having third-party services that build upon the registry to perform assessments of this type.
Lars Warren Ericson
How would you handle this repo with this arXiv writeup and this Lean proof code directory. It formalizes an entire paper which has multiple definitions and theorems. In general how would you approach Lean formalizations of whole papers, especially very long ones with hundred of results?
We have a hard cap of 1000 lines (and 100KB) on the size of the challenge Lean file, which we very much want to keep human-readable (and AI-reviewable). (We in fact have a preference for challenge files that are significantly shorter than this hard cap, e.g., 300 lines.) For a large repository with multiple theorems which cannot all be stated in Lean within this cap, this would mean that multiple registry entries would be required to register separate statements for each major results.
If the results require extensive definitions to import that are not currently in Mathlib and whose constructions are too large to fit within the cap, then another option is to set up the required definitions in a Tau Ceti repository, which can then be imported as a dependency for the challenge file.
Anonymous
Do you think it is acceptable to register important results on Palomar before a preprint is submitted (while the writing is still in progress)?
I have (reluctantly) come to the conclusion that authorship of the different stages of a proof development cycle – generation, verification, exposition, publication, and canonicalization – will become increasingly decoupled, that an author may be responsible for one part of this cycle but not be involved in another. In particular, much as we already normalize the submission of a preprint to a server such as the arXiv before formal publication, or the publication of paper before the definitive textbook containing the result is written, we will increasingly have to also permit the registration of formal proofs before a preprint is available. I do not view this decoupling of authorship as ideal, but it may be manageable as long as the incentives are such that the separate groups of authors can each be recognized for their particular contributions to the proof development cycle.
Leave a comment Cancel reply
Δ
