Number theory, geometry, topology, algebra, analysis, combinatorics, and solved problems.
Open Mathematics pageMathematics · Computer science · Physics
Map the hidden history of hard problems.
Problem cards, failed routes, partial results, and source trails in one searchable atlas.
Featured problems
Start with the landmarks.
Domains
Browse by field.
Complexity, algorithms, cryptography, logic, verification, machine learning, and lower bound barriers.
Open Computer Science page
Particle physics, cosmology, astronomy, condensed matter, and failure histories of experimental programs.
Open Physics page
Structured memory
A map of attempts, not just answers.
Failure Atlas keeps the useful negative space of research visible: failed approaches, surviving partial results, and nearby problems that share the same methods.
Problem atlas
Problem cards
Failure modes
A legend for stalled proof routes.
Graph layer
Explore how problems share methods and barriers.
Global atlas graph
Use the controls to compare fields, relation types, and shared attempted methods.
Mathematics
Computer Science
Physics
Curated relation
Shared method
Click a node to open its card and update the explorer below.
Selected problem explorer
Open a problem to inspect tried methods, partial successes, failures, and neighboring cards.
Click a method, partial result, failure, or source to inspect the local proof history.
Research object graph
Drag the nodes to inspect how problems, methods, partial results, failures, sources, and bridge families connect.
Problem
Method / attempt
Worked partially
Failed / blocked
Source
Bridge family
Bridge matrix
Bridge families show methods that travel across fields: topology in CS, spectral methods in graphs and physics, SAT and formalization in finite combinatorics, and more.
History
Timeline of breakthroughs, barriers, and negative results.
Selected milestones, not a definitive ranking.
This timeline highlights sourced events already connected to atlas cards: breakthroughs, impossibility results, independence phenomena, barriers, and solved cases.
Contribution design
Every attempted route should have a precise card.
A good entry names the method, states what it proves, identifies the obstruction, and cites the sources that support it.