Nicheloom visits: 58,069 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 →

DOOM in the kernel, or fibers in eBPF

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.

Some time ago my coworker who was working on first version of Perforator (https://github.com/yandex/perforator) kept talking about eBPF, so I got curious about its ISA and restrictions. That was around the time I read about DOOM on pregnancy test, so I thought: "what if someone run DOOM inside of Linux kernel in eBPF? Surely, with some restrictions, this should still be possible?"I started to play around with it somewhere in 2024 - first stripping DOOM to bare minimum that is needed for showcase, simplifying code and trying to pass first restrictions that I encountered - function limit, recursion, memory access and checks. I tried to do this by hand, but it was, well, tedious labor. So I changed direction and instead started to do some of the things with LLVM-passes - rewriting memory access, simplifying and rewriting loops etc. But there were just so many corners. And given absence of time and all, I forgot about this project.But couple months ago I thought: "LLMs are quite good nowadays, so why not try again this time with more hands". I tried different approaches on how memory access could be "virtualized", how loops can be made bounded, and in general - how to run unbounded logic on such a machine.When I got DOOM running, I got carried away. Approach was so "generic", so it would be a crime not to try to run more things. And now we have it - lua running on xdp hot path, llama2 working with softfloats, and even cpython, that did not fit initially into 1M verifier budget, is running there now thanks to freplace.There is ton of work to do in order to make programs run faster, to make integration easier, but working examples are already there.

HN · launched Sep 9, 2026 · 53 upvotes (top 14%) · 0 views

Niche: scripting and execution runtimes · 56 launches, 4 in the last 7 days · 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 Compiling complex C programs and running fibers within the heavily restricted Linux eBPF verifier environment is deep systems and compiler research.

What it would actually take: The project uses LLVM bytecode transformations or custom compiler passes to rewrite C/Rust code into unrolled state machines and bounded loop constructs that satisfy the in-kernel eBPF verifier. It requires managing execution state via eBPF maps, implementing userspace trampoline runtimes, and bypassing strict kernel call depth and stack limits using cooperative multitasking/fibers. Building this demands elite Linux kernel internal knowledge, eBPF bytecode mastery, and compiler engineering expertise.

Discussion

10 comments analyzed.

Concerns raised: AI-generated writing quality and authenticity issues, eBPF program runtime memory limitations, eBPF verifier and compute limits, Map index/fd sharing limits (max 64), Performance overhead of array maps vs direct-use maps

Competitors

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

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

Launched 315 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.