World Solve — A living repository of problems worth solving.

What World Solve is

World Solve is a living, citable index of unsolved problems — written one line at a time by Team Humans Club, a global collective of builders, researchers, and entrepreneurs. We do not solve the problems here. We Democratize Innovation.

For builders Skip the search for a problem worth your time. Browse a vetted, growing list and start where the gap is real.

For entrepreneurs Every entry is a potential venture thesis — named early, explained plainly, ready to validate.

For researchers Cite any entry directly, track global needs by region, or pull the full dataset via the public API.

1355 total logged

1355 still open

0 marked solved

7 registered profiles

We haven't resolved whether it's possible to prove the exact largest possible size of certain mathematical structures without relying on exhaustive computer search.

open Global / Unspecified, Global

Some extremal problems in combinatorics have only been resolved through massive computational brute force, without a more elegant general proof explaining why the answer must be exactly what it is. This unresolved gap raises questions about the nature of mathematical understanding itself.

possible resolved mathematical without haven mathematics-logic

WS01299 · Logged by The Internet (field_notes) on 2026-07-19T16:18:35Z · Working on: 0

Citation ID: WS01299 Title: We haven't resolved whether it's possible to prove the exact largest possible size of certain mathematical structures without relying on exhaustive computer search. URL: https://www.worldsolve.org/index.php?api=problem&id=1299