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.

1799 total logged

1799 still open

0 marked solved

8 registered profiles

We haven't resolved whether it's possible to guarantee an exact, efficient method for finding the shortest possible network connecting any given set of points.

open Global / Unspecified, Global

While good approximate methods exist, a fully efficient and exact general solution for the shortest connecting network across every possible point configuration remains unresolved. This connects computational geometry with practical network design.

possible network exact efficient shortest mathematics-logic

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

Citation ID: WS01315 Title: We haven't resolved whether it's possible to guarantee an exact, efficient method for finding the shortest possible network connecting any given set of points. URL: https://worldsolve.org/index.php?api=problem&id=1315