Alternatives
Products that do what BlazeDiff v2 – Fastest image diff with native binary and SIMD does
Started with a pure JS implementation (still the fastest JS image diff), but wanted to push performance further. I rewrote the core in Rust to make it the fastest open-source single-threaded image diff. On 4K images (5600×3200): ~327ms vs odiff's ~1215ms. Binaries are ~3x smaller too (~700KB vs ~2MB). The core insight: make the cold pass smarter to make the hot pass do less work. Instead of simple pixel equality, the cold pass scans dynamic-sized blocks and marks "problematic" ones - blocks that might contain differences. The hot pass then only runs YIQ perceptual diff and antialiasing check…
- 1
- 2
- 3FA
2021 · github.com
- 4CB
2021 · github.com
- 5LI
Dec 2025 · github.com
- 6T5
2021 · tensorbase.io
- 7TF
2023 · hgreer.com
- 8SA
I’ve been working on shuck, a shell script linter written in Rust. ShellCheck is excellent project and set the bar for this space. However, it's very slow and take up a far amount of resources. shuck is conservatively 20x faster than shellcheck and uses a fraction of the resources. shuck currently supports sh, bash, dash, ksh, mksh, and zsh. shuck should mostly be a drop in replacement for shellcheck but it is not a port since shellcheck is GPL. It is s clean-room implementation with its own parser and analysis engine, so behavior may differ in some cases. shuck is tested against shellcheck…
Apr 2026 · github.com
- 9IB
I built a Rust drop-in replacement for svelte-check that's 10-30x faster for Svelte 5 projects. What it does: - Parses Svelte files with a custom Rust parser - Transforms them to TSX in parallel using Rayon - Runs type-checking via Microsoft's tsgo (the native Go port of TypeScript) - Maps errors back to original .svelte locations via source maps Why it's fast: The official svelte-check uses TypeScript's Language Service API optimized for IDEs with persistent connections. Great for autocomplete but slow for batch CLI checks. svelte-check-rs writes real TSX files to disk and runs tsgo as a…
Jan 2026 · svelte-check-rs.vercel.app
- 10DA
Hi HN, I'd like to share DualMix128, a pseudo-random number generator I developed. It's written in C and achieves very high speed while maintaining strong statistical properties for non-cryptographic use. GitHub (MIT License): https://github.com/the-othernet/DualMix128 Key points: * *Fast:* Benchmarked at ~0.36 ns per 64-bit generation on GCC 11.4 (-O3 -march=native). This was over 2x faster than `xoroshiro128++` (~0.74 ns) and competitive with `wyrand` (~0.36 ns) in the same tests. (Benchmark code/results in repo). * *Robust:* Passes the full TestU01 BigCrush suite…
2025 · github.com
- 11AI
2017 · github.com
- 12IE
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
- 13ES
Hi HN, I built EdgeVec, a vector database that runs entirely in the browser. It implements HNSW (Hierarchical Navigable Small World) graphs for approximate nearest neighbor search. Performance: - Sub-millisecond search at 100k vectors (768 dimensions, k=10) - 148 KB gzipped bundle - 3.6x memory reduction with scalar quantization Use cases: browser extensions with semantic search, local-first apps, privacy-preserving RAG. Technical: Written in Rust, compiled to WASM. Uses AVX2 SIMD on native, simd128 on WASM. IndexedDB for browser persistence. npm:…
Dec 2025 · github.com
- 14US
2021 · github.com
- 15HA
Most ZK proving systems are optimized for server-grade hardware with massive RAM. When scaling to industrial-sized traces (2^20+ rows), they often hit a "Memory Wall" where allocation and data movement become a larger bottleneck than the actual computation. I have been developing Hekate, a ZK engine written in Rust that utilizes a Zero-Copy streaming model and a hybrid tiled evaluator. To test its limits, I ran a head-to-head benchmark against Binius64 on an Apple M3 Max laptop using Keccak-256. The results highlight a significant architectural divergence: At 2^15 rows: Binius64 is faster…
Jan 2026
- 16TR
Last week I wanted to quickly view some Gaussian splats which I had trained on a remote server that didn’t have any open ports or a display device. So I ended up downloading everything locally just to inspect the results This weekend I put together a terminal-based Gaussian splats viewer that renders directly in the terminal. It works over SSH and currently runs on CPU only and written in rust with claude code. I’ve found it to be pretty useful for quickly checking which .ply files correspond to which scenes and getting a rough sense of their quality. Along the way, I also wrote a small…
Apr 2026 · github.com
- 17TF
2020 · github.com
- 18SS
Raw performance (the lack of) is always a contentious point for JavaScript, especially in our post-Moore era of computing. Node.js gets around this issue through extensive of use of native libraries and modules written in C, including the V8 JS engine itself. But as application developers, how do YOU create high performance functions? Write in C and run as a NAPI module? Write in Rust and run as a V8 wasm? Well, there is another (better and faster) way now! The SSVM is a fully featured WebAssembly VM that is optimized for server-side applications.…
2020
- 19AF
fasthex - a very optimized hex dumper with all the features other hex dumpers have too
Jun 2026 · github.com
- 20
This project is a little performance-optimization experiment focused on reducing the size of Go binary patches, which can be useful for quick incremental updates of live services. When a Go program grows by a few bytes through an incremental change, a bunch of related references and offsets throughout the compiled binary end up changing that makes general-purpose binary-diff encoders inefficient: `zstd --patch-from` produces a 530kb patch for a one-line change in a 30MB binary. bsdiff improves upon this (150KB patch) thanks to a delta compression algorithm that can handle relative offsets.…
9d ago · github.com
- 21DB
Hey HN, my name is Tom and I'm the founder of Svix. We've been working on Diom (https://diom.com) for the last 6 months, and I'm excited to finally share it on HN! Diom is a single Rust binary that replaces Redis, RabbitMQ, Kafka, and a lot of custom code for many common use-cases. It's open-source, self-contained, and has no external runtime dependencies. While building Svix, we had to reimplement the same backend primitives that everyone reimplements when building a service: robust caching, rate-limiting, idempotency, and more. We also constantly felt the tension between building…
May 2026 · github.com
- 22PR
Well, it happened. After endless release candidates, we've finally made it to v0.1.0. What's inside: GPU-accelerated rendering with WebGPU shaders, shadows, and goodies like silhouette edges and a special soft-light mode Core operations run up to 1000x faster than the original PyMOL. Surface generation that used to send you on a coffee run now finishes the moment you hit the button Full PyMOL selection algebra support — 95+ keywords, boolean logic, distance/expansion operators, slash-macros Distance, angle, and dihedral measurements, atom labels — everything you need for structural…
Feb 2026 · github.com
- 23D5
Hi HN! I built dhi, a data validation library that uses Zig to compile to both native C (Python) and SIMD WASM (TypeScript). Key points: - Drop-in API compatibility with Pydantic (Python) and Zod (TypeScript) - Python: 24.9M validations/sec (520x faster than Pydantic V2) - TypeScript: up to 77x faster than Zod on invalid data - 28KB WASM bundle, zero JS runtime overhead I'd love feedback on the API surface, benchmarks, and real-world integration pain points. If you're curious, the repo has full benchmarks and examples.
Jan 2026 · github.com
- 24AV
AvifHash leverages the power of AVIF to create image placeholders that are both compact and efficient. This Proof of Concept shows promising results: at 27 characters, AvifHash outperforms BlurHash https://blurha.sh/ (using 4x3 components) in quality and detail retention. At a similar quality, BlurHash needs 54 (5x5) to 76 characters (6x6 components). Given that AVIF decoding is done by the web engine, AvifHash is very small: the entire demo page (including parsing and re-hydration code) is only 2.3 kB gzipped.
2024 · juliobbv.com
Ranked by how close each launch is in meaning, then by votes. Refine with a description →