Paul Reichert
Also known as datokrat
Paul Reichert is a Research Software Engineer whose work extends Lean and mathlib for formal mathematics. In 2022, he worked to formalize a chapter of convex geometry in Lean while writing a master's thesis; he later published mathematical notes and a software-security essay, and helped add the Freyd-Mitchell and Gabriel-Popescu theorems to mathlib. His later Lean work included an iterator library and a simp-set tactic labeled LLM-generated. As of October 2026, he is a Research Software Engineer on the Lean FRO team.
Timeline
-
2022
A thesis in convex geometry
In August 2022, he writes a master's thesis in convex geometry in Karlsruhe, Germany, while trying to formalize a chapter on Brunn-Minkowski theory in Lean. He plans to contribute some of the missing Brunn-Minkowski results to mathlib.
-
August 2023
Mathematics on paulr.de
On paulr.de, he publishes English notes about mathematical problems he enjoyed. His August 2023 posts include "Linearly independent subsets," "Three palindromes," and "Necklaces and triangulations of quadrilaterals."
-
December 2023
Read-only Turing machines
In December 2023, he publishes "Read-only Turing machines," a mathematics note on his site.
-
February 2024–2025
The abelian categories project
In February 2024, he joins Julia Markus Himmel and Jakob von Raumer on the mathlib project about abelian categories; its first part spans more than 100 pull requests. In 2025, the team completes the project with the Freyd-Mitchell and Gabriel-Popescu theorems in mathlib; the Freyd-Mitchell embedding theorem enters mathlib in February 2025.
-
April 2024
An essay on software security
In April 2024, he publishes "Thoughts on software security," noting how much code and how many authors people trust every day.
-
September 2025–December 2025
Lean's iterator library
In his GitHub repository, he works on a Lean iterator library intended for the standard library. In September 2025, he says polymorphic ranges need many type classes and plans a manual for iterators and ranges. In October 2025, he proposes total extrinsic termination proofs so `it.toList` can be used before an iterator's finiteness is proved. After a contributor proposes `scan` in December 2025, he says it needs `Finite` and `Productive` instances and lemmas like those for `drop` before it can enter the standard library.
-
March 2026
An LLM-generated Lean tactic
By March 2026, his datokrat GitHub gists include a Lean tactic named `minimize_simps`, described as an LLM-generated simp-set minimizer.
-
As of October 2026
Research Software Engineer at Lean FRO
As of October 2026, he is a Research Software Engineer on the Lean FRO team. Leo de Moura is Chief Architect and Co-Founder; Sebastian Ullrich is Head of Engineering and Co-Founder.
Sources and credits
Photo: We have no published photo of Paul Reichert yet. Send us a free-licensed photo.
- Topic: Hello! - Zulip Chat Archive
- Paul Reichert
- Theorems about abelian categories | Lean community blog
- Freyd-Mitchell and Gabriel-Popescu - Julia Markus Himmel
- Thoughts on software security
- datokrat (Paul Reichert) · GitHub
- Topic: Iterating ranges with PRange - Zulip Chat Archive
- Topic: Extrinsic finiteness proofs for iterators - Zulip Chat Archive
- Topic: scan combinator for iterators - Zulip Chat Archive
- datokrat’s gists · GitHub
- Team — Lean Lang
