Nicheloom visits: 58,094 all-time · 7,637 in the last 7 days

The opportunity tracker for new startups.

Today: 1,953 launches · Niche of the day: specialized calculation tools · See what launched today →

Eulix

Code navigation for large codebases

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.

Hey I've been working on Eulix, a tool for navigating large codebases.It parses a repository into symbols, call graphs and other structural information, then combines that with keyword and semantic retrieval to find relevant code.I tested it on OpenStack (~6.9M LOC / 29k files). One query about Nova's PCI passthrough scheduling pulled back the relevant filters, helpers and related call paths in well under a second once indexed.Some queries don't need an LLM at all, since Eulix can answer directly from the structured codebase data.It's open source and runs locally:https://github.com/Nurysso/eulixI'd especially like feedback from people who've worked on code search, static analysis, or large monorepos.on a side note it may be able to handle 30M+ loc codebase too, I haven't been able to test such huge repos cause I don't have a good enough gpu to embed parsers output! :)

HN · launched Sep 15, 2026 · 5 upvotes (top 87%) · 0 views

Niche: codebase visualization tools · 89 launches, 4 in the last 7 days ▼ -43% · Explore this niche →

Category and tags
  • Horizontal
  • Dev tools
  • Developer
  • Not AI
  • Commercial product

Source listing ↗

More like this: all 89 launches in codebase visualization tools →

Could you build this?

Partial Basic AST extraction and semantic search are standard, but scaling symbol extraction and call-graph resolution across multi-million LOC codebases (like OpenStack) with interactive low latency requires specialized static analysis pipelines.

What it would actually take: Requires tree-sitter or LSP-based semantic indexing, a graph database or custom in-memory graph index for cross-file symbol references and call hierarchies, combined with an embedding model and vector database (e.g., Qdrant/LanceDB) and BM25 search. The hard part is incremental graph construction and disambiguation across thousands of Python files without crashing or running out of memory.

Discussion

No comments on this launch.

Competitors

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

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

Launched 316 days after the earliest competitor.

  • MapX · ph · 2026-11-07 · 2 upvotes · similarity 0.48
  • A Satellite View for Python Code · hn · 2026-02-09 · 7 upvotes · similarity 0.48
  • Arcaide · hn · 2026-07-09 · 25 upvotes · similarity 0.48
  • CodeRLM · hn · 2026-02-11 · 81 upvotes · similarity 0.47
  • Clx · hn · 2026-07-11 · 143 upvotes · similarity 0.45
  • Sqry · hn · 2026-03-06 · 5 upvotes · similarity 0.44
  • Lamina · hn · 2025-11-20 · 5 upvotes · similarity 0.43
  • Ec · hn · 2026-02-04 · 18 upvotes · similarity 0.43

Related data

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.