Dev tools · alternatives · 2026
24 alternatives to Coderive – Iterating through 1 Quintillion Inside a Loop in just 50ms
Author: Danison Nuñez Project: Coderive Project Type: Programming Language Highlight: Formula-based Execution ## Coderive - Iterating Through 1 Quintillion in a Loop *Subtitle: How a phone interpreter achieves what supercomputers cannot* The Impossible Loop: ```java // In any other language, this would be computational suicide for i in [0 to 1Qi] { // 1,000,000,000,000,000,000 iterations arr[i] = i * i } ``` Traditional Reality: · Python: MemoryError at array creation · Java/C++: Theoretical 31 years (with 8 exabytes of RAM) · NumPy/TensorFlow: Immediate crash ·…
Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1
Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…
2023 · github.com · its alternatives →
- 2
Here's a project I've been working on for the last few months. It's a new (I think) algorithm, that allows to adjust smoothly - and in real time - how many calculations you'd like to do during inference of an LLM model. It seems that it's possible to do just 20-25% of weight multiplications instead of all of them, and still get good inference results. I implemented it to run on M1/M2/M3 GPU. The mmul approximation itself can be pushed to run 2x fast before the quality of output collapses. The inference speed is just a bit faster than Llama.cpp's, because the rest of implementation…
2024 · asciinema.org · its alternatives →
- 3
I was fascinated reading through another recent HN submission about a highly efficient implementation of A* in Lisp, which got me thinking about how I could do something similar in Python. However, these kinds of pathfinding algorithms really need complex terrain/mazes with interesting obstructions to showcase what they can do and how they work. So, I started thinking about how I could generate cool and diverse random "mazes" (they aren't really mazes, but I'm not sure what the best term is). I got a bit carried away thinking of lots of different cool ways to generate these mazes, such…
2024 · github.com · its alternatives →
- 4
Contribute to igushev/IgushArray development by creating an account on GitHub.
2019 · github.com · its alternatives →
- 5
LoopMix128 is a fast C PRNG I wrote for non-cryptographic tasks. GitHub (MIT): https://github.com/danielcota/LoopMix128 Highlights: * ~0.37 ns/value (GCC 11.4, -O3 -march=native), 98% faster than xoroshiro128++ and PCG64. * Passes TestU01 BigCrush & PractRand (32TB). * Guaranteed 2^128 period. * Proven injective (192-bit state) via Z3 SMT solver; allows parallel streams. * Core requires only stdint.h. Seeking feedback on design, use cases, or further testing.
2025 · github.com · its alternatives →
- 6
I want to share a really dumb, but very practical project I have packaged this summer, to perform operations on strings much faster. I was using Python to work with a multi-terabyte newline-delimited file. Reading, splitting, and shuffling it was a nightmare. So, I wrapped a trivial hardware-friendly heuristic I've been using for the last few years into a CPython library. The part I enjoyed the most is implementing SIMD behavior without SIMD instructions... Using 64-bit words to work at 8-bit granularity. Unlike conventional SIMD, the code would remain the same for ~~almost~~ any hardware.…
2023 · ashvardanian.com · its alternatives →
- 7
Optimizer library for tail recursive calls in Java bytecode - Sipkab/jvm-tail-recursion
2020 · github.com · its alternatives →
- 8
The core question: how did HP's scientific calculators actually work at the gate level? That rabbit hole led to building one from scratch. The architectural decision everything else follows from: a decimal calculator should store numbers as BCD — one decimal digit per 4-bit nibble. A standard byte-oriented CPU (Z80, 6502) fights that layout constantly. So I designed a small custom CPU in Verilog where 4 bits is the natural data width and memory is nibble addressable. What the project covers: - Custom CPU: Harvard architecture, 12-bit ISA, 8-state execution FSM, hardware stack guard with a…
May 2026 · github.com · its alternatives →
- 9
I started writing this book 10 years ago in JavaScript, got through a few chapters (asymptotic notation, basic techniques, start of sorting), and then abandoned it. Recently I picked it back up, converted everything to TypeScript, and used AI (Zenflow [1] + Claude Opus 4.6) to complete the remaining chapters. I provided the structure, direction, and initial chapters; the AI generated the bulk of the remaining content under a spec-driven workflow. The book covers roughly a first 1-2 year CS curriculum: sorting, dynamic programming, graph algorithms, trees, heaps, hash tables, and more. All…
Mar 2026 · amoilanen.github.io · its alternatives →
- 10
This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).
2024 · github.com · its alternatives →
- 11
Meta programming utilities for C++14. Merged in matt-42/lithium - matt-42/iod
2014 · github.com · its alternatives →
- 12
Bitwise operations and conversions to hexadecimals
2016 · flippybitandtheattackofthehexadecimalsfrombase16.com · its alternatives →
- 13
Improve the execution speed of pythonic paradigms.
2018 · medium.com · its alternatives →
- 14
Haskell re-implementation of STOKE, the stochastic superoptimizer - blaze/notebooks/tutorial.ipynb at master · bollu/blaze
2019 · github.com · its alternatives →
- 15
a total and turing complete [?] programming language - raoofha/Ar
2024 · github.com · its alternatives →
- 16
Wrote this to learn more about the `chumsky` parser combinator library, rustyline, and the `ariadne` error reporting crate. Such a nice DX combo for writing new languages. Still a work in progress, but I thought I'd share :)
2025 · github.com · its alternatives →
- 17SA
Hey HN, I’m a physicist turned quant. Some friends and I 'built' SymDerive because we wanted a symbolic math library that was "Agent-Native" by design, but still a practical tool for humans. It boils down to two main goals: 1. Agent Reliability: I’ve found that AI agents write much more reliable code when they stick to stateless, functional pipelines (Lisp-style). It keeps them from hallucinating state changes or getting lost in long procedural scripts. I wanted a library that enforces that "Input -> Transform -> Output" flow by default. 2. Easing the transition to Python: For many…
Feb 2026 · its alternatives →
- 18AE
This seems unlikely to be a "new" idea, but I stumbled into it by accident and thought it was cool. Java source code below: // This class is in the public domain. public class Numbers { public static void main(String[] args) { int numRows = 256; int numColumns = 128; for (int row = 0; row < numRows; row++) { StringBuilder rowOutput = new StringBuilder(); for (int column = 0; column < numColumns; column++) { if ((row & column) != 0) rowOutput.append("1"); else rowOutput.append("0"); } System.out.println( String.format("row/col %s:\t%s", row, rowOutput.toString())); } } }
2014 · its alternatives →
- 19W1
Hey HackerNews, I built this project over the last few weeks as a palette cleanser from a failed game launch. I wanted to learn a bit about AI/Neural-Networks and naively thought I could build a tiny maze-solving AI in a weekend with a 100% solve rate. Well - I couldn't, but I got pretty close. 14 Bytes total model size, and a 96.5% solve rate on unseen mazes. Trained across 46 phases experimenting with different ideas to improve the model (better performance, smaller size). Its quite fun to watch the model attempt to solve the maze, when they fail its usually due to getting stuck in a…
Jul 2026 · con-dog.github.io · its alternatives →
- 20
I am playing around with using arrays of arbitrary dimension as framework for designing FFT implementations, as opposed to the more classical approach of tensor products and butterflies (too complicated in my opinion). It turns out, that with a modern compiler, you do not need much complexity to make a really fast implementation. This implementation is for powers of 2, and optimized for arrays that do not fit in cache. I do think it would be better to use a higher-level language to implement other cases (e.g. n = 2^a * 3^b * 5^c, multiple small FFTs, higher-dimensional), so I am currently…
2025 · gitlab.sac-home.org · its alternatives →
- 21
GitHub: https://github.com/TeamHypersomnia/Hypersomnia - The netcode relies on full simulation determinism - this includes Box2D physics. I'm using standard floating-point calculations and rely on IEEE754 compliance. I also use STREFLOP for portable math function implementations. This is commonly done for RTS games with a lot of synchronized units, however this technique is rarely if ever seen in games with complex physics, esp. shooters. - The atlas packer I wrote for the game was reused in Assassin's Creed, Skydio and received 2 scientific references:…
2024 · hypersomnia.io · its alternatives →
- 22
Quick note on how it works and how I've done my batch embedding engine IgniteMS. The whole thing runs as one process using Rust, reading input, tokenizing, packing batches, keeping the queue full. TensorRT handles inference. Python is only as a wrapper. I built it this way because when you use more than couple of GPUs, the GPUs stop being the problem. CPU cannot feed them fast enough. One A100 can go through batches faster than Python can tokenize and feed, so the GPU just sits there idle waiting for work. Most of my time went into optimizing this. At 8 GPUs that was basically the entire…
Jun 2026 · github.com · its alternatives →
- 23IM
I found a serious bottleneck in Python binding of Wasmer and Wasmtime and I found a trick to make 25x faster. Then beat all that using NumPy.
2023 · medium.com · its alternatives →
- 24
Learn Go (Golang) by writing real code in this interactive course. Practice structs, interfaces, errors, concurrency, and idiomatic backend patterns.
2020 · qvault.io · its alternatives →
Also compare
- A hash array-mapped trie implementation in C alternatives
- Speeding up LLM inference 2x times (possibly) alternatives
- Visual A* pathfinding and maze generation in Python alternatives
- Array with Constant Time Access and Fast Insertion and Deletion alternatives
- LoopMix128 – Fast C PRNG (.46ns), 2^128 Period, BigCrush/PractRand Pass alternatives
- Faking SIMD to Search and Sort Strings 5x Faster alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →