CLI toolkit for Erdős problem research: literature ingestion, RAG search, and Lean 4 formalization

Stanford AI for Lean Club progress on Erdős problems: papers, frontier notes, visualizer data, and Lean formalization.

The official repository of the Nexus Resonance Codex (NRC)

The official repository of the Nexus Resonance Codex (NRC) Protein Folding Enhancements.

AlphaProof Nexus evolution on Erdős Problem #25 — does every congruence-avoiding set have a logarithmic density? Open problem, formalized in Lean 4.

Automated frontier-model attempts at every open Erdős problem — verdicts, completeness scores, full transcripts.

Open, fully rigorous re-certification of White's lower bound for Erdős's minimum-overlap problem (#36), with an independent verifier

AI-agent pipeline producing machine-verified Lean 4 proofs. Contributions to Google DeepMind's formal-conjectures (Erdős #1084 merged, #1052 in review).

Paper I: a finite, Lean-verified fractional clique-partition bound for split graphs. Part of an Erdős #81 research program; #81 remains open.

Weighted Erdős–Szekeres (Erdős #1026) in Lean 4 / Mathlib — human-scale proof plus a referee report, failure atlas, and extracted benchmarks for AI theorem-proving

Explicit C4-free subgraph certificates for hypercubes Q9 through Q15 with reproducible verification.

Lean 4 / Mathlib formalization toward Erdős #249 and #257: machine-checked Erdős-Borwein support cases, #249 denominator exclusions, and certificate reductions. No sorry; open problems remain open.

Lean 4 proof-chain package for Erdős Problem #647

Lean 4 formalization of an unconditional covering construction for Erdős problem 387, providing a GRH-free input to the Bui–Pratt–Zaharescu divisor argument.

Open Problems META-DB (Rei-AIOS) — 2,583 mathematical unsolved problems + Rei-AIOS research contributions. CC-BY 4.0. Paper 130 DOI: 10.5281/zenodo.19700758