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 determined whether every finite set of geometric points can always be enclosed within a uniquely defined smallest possible shape of a specific type.

open Global / Unspecified, Global

Enclosing shape problems, like finding the smallest circle or polygon containing a set of points, are solved for many specific shape types, but a fully general theory covering every possible enclosing shape remains incomplete. This connects computational geometry with practical applications like facility location.

shape every set points smallest mathematics-logic

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

Citation ID: WS01348 Title: We haven't determined whether every finite set of geometric points can always be enclosed within a uniquely defined smallest possible shape of a specific type. URL: https://worldsolve.org/index.php?api=problem&id=1348