Self-growing neural networks via a custom Rust-to-LLVM compiler
Hi HN, I built NOMA (Neural-Oriented Machine Architecture), a systems language where reverse-mode autodiff is a compiler pass (lowered to LLVM IR). My goal is to treat model parameters as explicit, growable memory buffers. Since NOMA compiles to standalone native binaries (no Python runtime), it allows using realloc on weights mid-training. This makes "self-growing" architectures a system primitive rather than a complex framework hack. I just pushed a reproducible benchmark (Self-Growing XOR) to validate the methodology: it compares NOMA against PyTorch and C++, specifically testing how…
Self-growing neural networks via a custom Rust-to-LLVM compiler launched on December 28, 2025 with 8 votes, #1,039 of 11,628 launches that month and more than 75% of that year's launches.
What it does
A systems programming language where automatic differentiation is a compiler pass and model parameters are explicit, growable memory. - pierridotite/NOMA
A research-driven systems language for machine learning where autodiff is a compiler pass and model parameters are explicit, growable memory . I started NOMA after running into the same friction many times: in mainstream ML stacks, changing a model’s topology mid-training often means rebuilding graphs, copying weights, and resetting optimizer state. Biology suggests a different mental model. Nervous systems remain functional while continuously reshaping their micro-structure. Work on dendritic spine structural plasticity connects local structural remodeling to synaptic efficacy and learning/memory. That makes it a reasonable working hypothesis (not a claim of equivalence) that some forms of…from github.com
In the maker’s words, at launch
Hi HN, I built NOMA (Neural-Oriented Machine Architecture), a systems language where reverse-mode autodiff is a compiler pass (lowered to LLVM IR). My goal is to treat model parameters as explicit, growable memory buffers. Since NOMA compiles to standalone native binaries (no Python runtime), it allows using realloc…
Does a similar job
all alternatives →
Netmind Power2023 · netmind.ai · ▲272Hi HN, We just opened public access to Qwen3‑Coder‑480B‑A35B‑Instruct via a REST/SDK API. Why it might be interesting: - Fully open-source (Apache‑2.0): https://github.com/QwenLM/Qwen3-Coder - 480B params (35B active MoE), long context up to 1M tokens with YaRN - Matches Claude Sonnet/GPT‑4o on SWE-Bench Verified (81.6%) - Free tier: 100K tokens/month
We made our own inference engine for Apple Silicon2025 · github.com · ▲186We wrote our inference engine on Rust, it is faster than llama cpp in all of the use cases. Your feedback is very welcomed. Written from scratch with idea that you can add support of any kernel and platform.
High-Res Neural Cellular AutomataJun 2026 · cells2pixels.github.io · ▲208Neural CAs model self-organizing pattern formation. Now they can generate patterns at HD resolution in real-time, enabled by turning each CA cell into a Neural Field. Try 3 demos: grow a pattern from a seed (and damage it, it heals), synthesize PBR textures that can regenerate, or create 3D textures like clouds.
Autograd.c – A tiny ML framework built from scratchDec 2025 · github.com · ▲85built a tiny pytorch clone in c after going through prof. vijay janapa reddi's mlsys book: mlsysbook.ai/tinytorch/ perfect for learning how ml frameworks work under the hood :)
Noctie – A chess AI that predicts your rating2022 · noctie.ai · ▲134I built over the last two years a human-like neural network chess engine that tries to predict your rating from a single game. It automatically adapts to your play and tries to play like a human at your level would play, giving you a balanced game. At the core I’m using an AlphaZero / Leela Chess Zero style neural network that I have trained on 1 billion human games from the lichess.org open database. Around this network I have built a chess engine in Rust with algorithms that use the outputs from the NN to produce human-like moves at a given rating from beginner to world champion, as…
I built a tensor library from scratch in C++/CUDA2025 · github.com · ▲119Hi HN, Over the past few months, I've been building `dsc`, a tensor library from scratch in C++/CUDA. My main focus has been on getting the basics right, prioritizing a clean API, simplicity, and clear observability for running small LLMs locally. The key features are: - C++ core with CUDA support written from scratch. - A familiar, PyTorch-like Python API. - Runs real models: it's complete enough to load a model like Qwen from HuggingFace and run inference on both CUDA and CPU with a single line change[1]. - Simple, built-in observability for both Python and C++. Next on the roadmap is…
More ai this month
the category →
Paintings by AI models: programs run through a simulation of oil paint.
AI · 22d ago · stillwet.art
FastRouter.ai▲364Route requests to the right LLM for cost, latency & quality
AI · 23d ago · fastrouter.ai
Source: Show HN post ↗ · launch text quoted in part
Launched alongside, December 2025
the whole month →- GP
Life & fun · Dec 2025 · dosaygo-studio.github.io
Hi everyone! My name's Luke and I made the original Jmail here alongside Riley Walz. We had a ton of friends collaborate on building out more of the app suite last night in lieue of DOJ's "Epstein files" release. Please AMA!
Life & fun · Dec 2025 · jmail.world
PlanEat AI▲733AI turns your health goals into a 7-day menu & grocery list
AI · Dec 2025 · planeatai.com
Community, All the HN belong to you. This is an archive of hacker news that fits in your browser. When I made HN Made of Primes I realized I could probably do this offline sqlite/wasm thing with the whole GBs of archive. The whole dataset. So I tried it, and this is it. Have Hacker News on your device. Go to this repo (https://github.com/DOSAYGO-STUDIO/HackerBook): you can download it. Big Query -> ETL -> npx serve docs - that's it. 20 years of HN arguments and beauty, can be yours forever. So they'll never die. Ever. It's the unkillable static archive of HN and it's…
Dev tools · Dec 2025 · hackerbook.dosaygo.com
