Life & fun · alternatives · 2026

24 alternatives to Detecting collision between 500k circles below 5ms

Heya. I created a flexible collision engine for broad detection in C that's also pretty fast. Personally that's my best, so I wanted to show it here. Although... still not as fast as DragonEnergy's one that supposedly handled millions of agents bouncing off each other every frame on an old i3, haha. I hope I get better at this! He set the bar pretty high for me. I was considering including some small function that tries finding the nearest entity, although I think it might be better to simply use query for that matter. Perhaps in the future I will get a good idea of how to do that more…

This is a collision detection engine written in C that handles broad-phase collision checks for circles. It performs collision detection on 500,000 circles in under 5 milliseconds on standard hardware. The tool is… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Prices are shown for the 1 we have checked on their own sites, 1 of them free or with a free tier. Detecting collision between 500k circles below 5ms launched in 2023; newer entries below may have overtaken it.

1
I've built a locally running Perplexity clonefree▲669
The video demo runs a 7b Model on a normal gaming GPU. I think it already works quite well (accounting for the limited hardware power). :)
2024 · github.com · its alternatives →
2
Chunk sidecars▲77
Hi HN! My name is Olaf, I work at CircleCI as a technology advisor in the CTO office, came in through the acquisition of my company Vamp.io (progressive delivery for microservices on k8s) in 2021. Wanted to hear the HN community feedback and thoughts on a project we think could be very interesting when adding AI coding agents to the SDLC and your CI pipelines. Our team at CircleCI built Chunk sidecars after repeatedly running into the same issue internally: by the time our CI catches a failure, the agent has already moved on and most of the useful context is gone. The basic idea of Chunk…
May 2026 · circleci.com · its alternatives →
3ID
Intrusion Detection in Real-time▲69
Abstract page for arXiv paper 1911.04464: MIDAS: Microcluster-Based Detector of Anomalies in Edge Streams
2020 · arxiv.org · its alternatives →
4
Speeding up LLM inference 2x times (possibly)▲419
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 →
5
A local merge queue for parallel Claude Code agents▲42
I have been pushing up to 90 commits a day on a MacBook Air via 4-5 parallel agents. As you can imagine when all the agents try to build, test and run dev servers on an 8GB machine it is the fast lane to a force quit and restart. I also did not want to pay the CI minutes on 90 pushes a day. So I designed a local merge queue to have all commits land one at a time and fully tested. Hopefully this helps other folks with more modest machines. Appreciate any feedback.
Jul 2026 · github.com · its alternatives →
6
1990s Game Dev Algorithms for Distributed Systems▲12
Classic physics engine algorithms — SAT collision detection and Morton Z-curve indexing — become viable on-chain primitives only where the execution model supports dynamic object access at runtime. Here's why EVM, Solana, and Aptos can't run them, and Sui can.
Apr 2026 · docs.merca.earth · its alternatives →
7
Midas, a Streaming Anomaly Detector. Now Implemented in Go▲88
Go implementation of MIDAS: Microcluster-Based Detector of Anomalies in Edge Streams - steve0hh/midas
2020 · github.com · its alternatives →
8
I replaced Beads with a faster, simpler Markdown-based task tracker▲84
I've been running long duration coding agents with Claude Code for about 6 months now. Steve Yegge released Beads back in October and I found that giving Claude tools for proper task tracking was a massive unlock. But Beads grew massively in a short time and every release made it slower and more frustrating to use. I started battling it several times a week as its background daemon took to syncing the wrong things at the wrong times. Over the holidays I finally ripped it out and wrote ticket as a replacement. It keeps the core concept I actually cared about (graph-based task dependencies)…
Jan 2026 · github.com · its alternatives →
9
A fast 2D physics engine▲14
A very fast and scalable physics engine, based on Box2D. - mtsamis/box2d-optimized
2020 · github.com · its alternatives →
10
A benchmark + latency sim for LLM db queries: ClickHouse / Postgres▲12
Performance comparison of ClickHouse vs PostgreSQL using LLM-style query patterns on realistic aircraft tracking data - GitHub - 514-labs/LLM-query-test: Performance comparison of ClickHouse vs PostgreSQL using LLM-style query patterns on realistic aircraft tracking data
2025 · github.com · its alternatives →
11
Running Gemma-4 26B at 124 tokens/SEC on a CPU, no GPU▲10
I wanted to know how fast a 26B mixture-of-experts model could run on a desktop CPU with no GPU. Got ~40 tok/s single-stream (lossless) and ~124 batched. The surprising part was the byte budget: for this model you compress the output head (32% of per-token bytes), not the experts (16%). The writeup has the bandwidth roofline and the dead-ends; the repo has the reproducible recipe. Happy to answer questions. Repo: https://github.com/arun-prasath2005/gemma4-cpu-moe
Jun 2026 · apeg.dev · its alternatives →
12AR
A real-time ballistic solver for moving targets under drag (C++)▲5
Hi HN, I’m sharing a small open-source project I’ve been working on: a native C++ ballistic solver that computes launch angles to intercept moving targets in real time, under gravity and air drag. Instead of relying on vacuum assumptions, closed-form equations, or lookup tables, the solver formulates the intercept as a nonlinear problem and solves it numerically using time integration and iterative methods. The motivation came from game and simulation scenarios where simpler approaches tend to break down: - moving targets - strongly curved trajectories due to drag - real-time constraints The…
Jan 2026 · its alternatives →
13
We made a tool that lets you research electronic components faster▲8
Hi HN, I’ve spent the last decade building hardware products like humanoid robots, 3D printers, and self-driving tractors. I needed a tool to navigate technical documents faster, so I created one with friends. This tool helps with component search, cross-referencing, comparison, and debugging. We’d love your feedback, whether you find it useful or not. Thank you! Try it here: www.convergelab.ai
2024 · convergelab.ai · its alternatives →
14
Generating Collisions on NeuralHash▲22
Proof of Concept : generating collisions on a neural perceptual hash - collisionLSH.py
2021 · gist.github.com · its alternatives →
15
Midas, Microcluster-Based Detector of Anomalies in Edge Streams▲15
Anomaly Detection on Dynamic (time-evolving) Graphs in Real-time and Streaming manner. Detecting intrusions (DoS and DDoS attacks), frauds, fake rating anomalies. - Stream-AD/MIDAS
2019 · github.com · its alternatives →
16IA
I also made a three-body simulation▲12
Somewhat inspired by a recent post here, I also made a three-body simulation on a whim, meaning to try out macroquad[0] (verdict: really nice!). Thanks to the engine I could trivially target wasm as well, so others can get mesmerized too. The source is available here: https://github.com/sulami/three-bodies [0]: https://docs.rs/macroquad/latest/macroquad
2024 · three-bodies.sulami.xyz · its alternatives →
17
I made a Web shooter in C++ with no engine. Fully deterministic netcode▲10
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 →
18
GDBS PRO▲3
I built a physics computation platform that replaces brute-force numerical PDE solvers with analytic geometry evaluated in a 13D coordinate space. Instead of discretizing onto million-cell meshes and iterating to convergence on a supercomputer, GDBS maps physical systems into geometric positions where observables become exact coordinates. Evaluation is O(N) instead of O(N³), so what takes HPC clusters hours runs in <100ms in WebAssembly in the browser. 7 physics domains: plasma/fusion, materials science, cosmology, geophysics, fluid dynamics, quantum information, and…
Jul 2026 · gdbs.getvaultsync.com · its alternatives →
19
Serve 100 Large AI models on a single GPU with low impact to TTFT▲7
I wanted to build an inference provider for proprietary AI models, but I did not have a huge GPU farm. I started experimenting with Serverless AI inference, but found out that coldstarts were huge. I went deep into the research and put together an engine that loads large models from SSD to VRAM up to ten times faster than alternatives. It works with vLLM, and transformers, and more coming soon. With this project you can hot-swap entire large models (32B) on demand. Its great for: Serverless AI Inference Robotics On Prem deployments Local Agents And Its open source. Let me know if anyone…
Nov 2025 · github.com · its alternatives →
20
Fastlytics▲10
I built Fastlytics to help F1 fans analyze races through interactive charts like speed traces, tire strategies, and position tracking. It uses the FastF1 Python library for data and React for the frontend. Open-sourced under MIT License – would love feedback or contributions! Live demo: https://fastlytics.app GitHub: https://github.com/subhashhhhhh/Fastlytics
2025 · fastlytics.app · its alternatives →
21
PwnScan▲8
For at least a few years (since before COVID), in my circle everbody wants an AI tool that finds vulnerabilities in binaries. I have my reservations about such a tool because of my perception that AI is overhyped, so I decided to build one myself to see how useful it could be (or not). I was actually kinda surprised how well it worked for my collection of binaries with known CVEs. It definitely has false positives and negatives, as any static analysis tool would, but I think its actually somewhat usable. I dont think the results are super actionable, but interesting nonetheless. I still…
2025 · pwnscan.com · its alternatives →
22UI
USearch Images demo in 200 lines of Python▲9
Hey everyone! I am excited to share updates on four of my & my teams' open-source projects that take large-scale search systems to the next level: USearch, UForm, UCall, and StringZilla. These projects are designed to work seamlessly together, end-to-end—covering everything from indexing and AI to storage and networking. And yeah, they're optimized for x86 AVX2/512 and Arm NEON/SVE hardware. USearch [1]: Think of it as Meta FAISS on steroids. It's now quicker, supports clustering of any granularity, and offers multi-index lookups. Plus, it's got more native bindings than probably…
2023 · usearch-images.com · its alternatives →
23
I wrote a GPU-less billion-vector DB for molecule search (live demo)▲9
Input a SMILES string (or pick one molecule from the examples) and it returns up to 100k molecules closest in 3-D shape or electrostatic similarity – from 10+ billion scale databases — typically in under 5-10 s. *Why it might interest HN* * Entire index lives on disk — no GPU at query-time, less than ~10 GB RAM total. * Built from scratch (no FAISS index / Milvus / Pinecone). * Index-build cost: one Nvidia T4 (~ 300USD) for one 5.5B database. * Open to anyone, predict ADMET, export results as CSV/SDF. Full write-up & benchmarks (DUD-E, LIT-PCBA, SVS) in the pre-print:…
2025 · cheese-new.deepmedchem.com · its alternatives →
24AW
A WebGPU-based browser engine with "Blam "-style physics▲5
I’ve spent the last few days prototyping a browser-based game engine stack designed for instant-load, "Roblox-for-Teens" style deployment. The goal is to lower the floor for AA indie devs who want high-fidelity physics and instant web distribution without the overhead of Unity or a heavy Godot export. The Stack Engine: A headless WASM/WebGPU implementation. I’m currently using custom flags and selective streaming to bypass standard browser memory and execution limits. Physics: I’ve ported Jolt (Guerrilla Games) but modified the solver to mimic the original Blam! engine (Bungie/Halo…
Jan 2026 · its alternatives →

Also compare

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 →