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 still haven't determined the exact smallest number of unit distances that must repeat among any large set of points drawn on a plane.

open Global / Unspecified, Global

This problem, part of a broader family of questions in combinatorial geometry, has known bounds but no exact general formula for every configuration. Solving it would refine our understanding of how simple geometric constraints shape complex arrangements.

exact haven determined smallest number mathematics-logic

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

Citation ID: WS01266 Title: We still haven't determined the exact smallest number of unit distances that must repeat among any large set of points drawn on a plane. URL: https://worldsolve.org/index.php?api=problem&id=1266