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 don't know whether P equals NP, or whether some problems are fundamentally harder to solve than to check.

open Global / Unspecified, Global

If P equaled NP, countless hard problems in logistics, cryptography, and optimization could be solved efficiently, but most computer scientists suspect they can't. This remains the most famous open question in computer science.

whether problems know equals some mathematics-logic

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

Citation ID: WS01229 Title: We don't know whether P equals NP, or whether some problems are fundamentally harder to solve than to check. URL: https://worldsolve.org/index.php?api=problem&id=1229

Log in

Register

Repository Status

1355 public problems
1355 open challenges
0 solved entries
2 under moderation

Filtering Tips

Search by title keyword, country, or theme.
Use category + continent together for better narrowing.
Click any citation code to copy a direct reference format.