wtf is open-math-problems?

This project is a tier list that ranks the famous unsolved problems in mathematics, from the Riemann Hypothesis down to lesser known open questions. Instead of ranking by fame or raw difficulty, entries are ranked by how central they are to the structure of mathematics and how much a proof would change the field, with fame only used to break ties. That is why some very well known problems land lower than you might expect. Each entry in the tier list can include a link to a Wikipedia or arXiv article explaining the problem, a formal statement of the problem written in the Lean 4 proof language, usually pulled from Google DeepMind's formal conjectures project, and links to prediction markets on sites like Manifold and Metaculus where people bet on whether and when the problem will be solved. Those market odds are described as snapshots from a specific point in time that will shift as more information comes in. The list is organized into tiers, starting with S tier for problems described as load bearing pillars of mathematics, such as the Riemann Hypothesis, P versus NP, and the Langlands program, followed by an A tier of field defining problems including the Birch and Swinnerton-Dyer conjecture, the Hodge conjecture, and Navier-Stokes global regularity. The project also keeps a section tracking problems that have recently been solved or partially solved, used as a calibration check for the rest of the list. The README itself is the primary content here rather than runnable code, and the repository is open to contributions through pull requests, especially for adding prediction markets or formalizations that exist but are not yet linked. The full README is longer than what was shown.