The catalogue brings together open questions across theoretical computer science, ordered within each category by votes, with catalogue priority breaking ties. Some formulations and their current open status still need review; each card preserves its sources and known limitations. Resolved and retired records are excluded from the reader.
Use Compact for a quick overview or Full for the complete statement and context. Anyone can add a public note directly, without an account. Names on these notes are optional and unverified. Propose a problem through the New problem form on GitHub; proposals appear in Community until reviewed for inclusion in the catalogue.
Vote with 👍 or 👎; click your selected thumb again to remove your vote. One vote per problem is remembered in this browser. Scores are shared with everyone and determine the Top selections within each category.
Selection plan
Our primary goal is a benchmark of 500 problems. Top 100 is a priority subset of those same 500, with secondary editorial attention.