Nicheloom visits: 63,579 all-time · 8,415 in the last 7 days

The opportunity tracker for new startups.

Today: 1,441 launches · Niche of the day: digital marketing agency services · See what launched today →

Pathetic

Java pathfinding: 10k concurrent paths in ~7ms

Get picks like this daily. Today's launch numbers, the top launches, AI and tech news, and a daily opportunity pick, straight to your inbox.

Want to reach these readers? Sponsor an issue.

It started with drones. My co-founder and I were building a Minecraft plugin where drones had to navigate through unloaded chunks - terrain that doesn't even exist in memory yet. No existing library had any concept of it, which led to drones being stuck in non-existence.Sloppy at first, tightly coupled to Minecraft's API, we built our own. But somewhere along the way we realized: the problem wasn't Minecraft. It was how Java pathfinding is built in general - object-heavy, GC-hostile, and single-threaded by assumption.So I split the project. The core became its own thing: pure Java 8+ for compatibility, featuring a zero-allocation primitive heap instead of a theoretically optimal FibonacciHeap, because pointer chasing and cache misses were unacceptable. 100% async, even in a single-threaded, async-hating Minecraft hell, and a processor pipeline providing full extensibility. No game engine, yet the possibility to adapt to your environment.Sometimes it isn't the algorithm that needs optimization, but the environment it lives in. Pathetic is full of these micro-optimizations: a BloomFilter lookup before the expensive closed set check, a multi-metric squared heuristic to kill Math.sqrt() overhead, and bit-packing 3D coordinates into a single primitive long. In order to get Java fast, you need to treat it like C++.The result: 10k concurrent paths in ~7ms, where most libraries quietly die. A 20k distance path (equivalent to 100k+ nodes) in ~60ms without bloating the heap. The README is... a choice. Judge it, because it does the same to you.

HN · launched May 5, 2026 · 8 upvotes (top 51%) · 0 views

Niche: specialized algorithms and computing libraries · 233 launches, 4 in the last 7 days ▼ -71% · Explore this niche →

Category and tags

  • Horizontal
  • Dev tools
  • Developer
  • Not AI
  • Hobby / open-source project

Visit website ↗ Source listing ↗

Could you build this?

No Achieving 10,000 concurrent 3D paths in ~7ms through non-loaded virtual chunks requires deep systems-level algorithm optimization, custom spatial data structures, and non-blocking multi-threading.

What it would actually take: Building Pathetic requires a high-performance Java architecture using low-overhead concurrent data structures, off-heap memory management, and specialized pathfinding algorithms (such as optimized A*, JPS, or hierarchical pathfinding adapted for 3D sparse voxel grids). The core engineering hurdles involve asynchronous chunk/octree generation on demand without triggering full game-engine object allocation, cache-friendly bit-packing for voxel states, and custom memory allocators to prevent GC pauses. This necessitates senior game-engine or systems programming expertise in concurrency, spatial indexing, and CPU cache optimization.

Discussion

2 comments analyzed.

Competitors

Other products that read as similar to this one : 434 launches clear the similarity bar, closest 8 shown.

Attention rank: #230 of 435 (itself plus its competitors, highest first, normalized so YC and Product Hunt are compared fairly).

Launched 188 days after the earliest competitor.

The niche, labels, vibe code rating and competitor comparison on this page are analysis by Nicheloom. If you use them, please credit nicheloom.com. How you may use our data.