Dev tools · alternatives · 2026
24 alternatives to TurboPFor – Bringing Fastest Integer Compression Incl. SIMD to Java
Fastest Integer Compression. Contribute to powturbo/TurboPFor-Integer-Compression development by creating an account on GitHub.
TurboPFor is a Java library for integer compression that uses SIMD optimization to achieve high-speed compression and decompression. It is designed for developers working with large datasets who need efficient data… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. TurboPFor – Bringing Fastest Integer Compression Incl. SIMD to Java launched in 2015; newer entries below may have overtaken it.
- 1
A very fast scalar implementation for Frame Of Reference integer compression. - cruppstahl/libfor
2015 · github.com · its alternatives →
- 2
A vector index built on TurboQuant, written in Rust with Python bindings - RyanCodrai/turbovec
Mar 2026 · github.com · its alternatives →
- 3
TurboRLE-Fastest Run Length Encoding. Contribute to powturbo/Turbo-Run-Length-Encoding development by creating an account on GitHub.
2015 · github.com · its alternatives →
- 4
TurboQuant▲295New LLM compression algorithm by Google
Mar 2026 · research.google · its alternatives →
- 5
Optimizer library for tail recursive calls in Java bytecode - Sipkab/jvm-tail-recursion
2020 · github.com · its alternatives →
- 6
TurboScripter▲131Your shortcut to effortless content creation at warp speed
2023 · share.streamlit.io · its alternatives →
- 7
Paritok▲258Spend up to 85% less and run 3× longer coding agent sessions
Aug 2026 · paritok.com · its alternatives →
- 8
TurboQuant WASM SIMD vector compression — 3 bits/dim with fast dot product. Requires relaxed SIMD (Chrome 114+, Firefox 128+, Safari 18+, Node 20+) - teamchong/turboquant-wasm
Apr 2026 · github.com · its alternatives →
- 9
I wrote libcorrect in C in 2016 and wanted to revisit it in Rust. Instead of doing just a direct conversion, I went down the rabbit hole of making Rust's std::simd work for me. I ended up with a templated, generic Viterbi decoder for convolutional codes that dispatches the decode at runtime depending on which instruction sets are available. For small rates and orders, the entire decode lives in registers. Larger codes work through memory but take advantage of some acceleration structures. I also spent some time building a tool to find optimal (max d_free) conv codes for a given rate and…
Aug 2026 · github.com · its alternatives →
- 10
Faster LZMA decoder for x86 CPUs (patch for XZ Utils). - faster_lzma_decoder_x86.patch
2021 · gist.github.com · its alternatives →
- 11
2018 · dropbox.github.io · its alternatives →
- 12
The world's fastest apk (android)/java open source decompiler - neocanable/garlic
2025 · github.com · its alternatives →
- 13OA
I built an experiment that uses an overfitted transformer and arithmetic coding to compress individual files. Instead of training the model to generalize, I train a 900KB transformer to memorize a single file and predict the next byte. Those predictions are fed into an arithmetic coder to produce the compressed output. On a 100MB NYC taxi CSV, it compresses to about 7MB (~0.5 bits/byte). On a 100MB slice of enwik9, it compresses to about 21MB (~1.68 bits/byte). It's pretty slow right now (roughly 20–30 minutes of training and 45 minutes each for compression and decompression on my…
Jun 2026 · its alternatives →
- 14
I've spent the last few months working on this codec. It has the following characteristics: - SOTA decompression throughput in its ratio class - Decent ratios (comparable to LZ4 at high effort levels) - Slow compression Most of the gains can be attributed to reducing branches and making decompression very friendly to out-of-order cores, by using a smart format. Results on the tarred Silesia corpus on Intel x86-64 follow: codec decode ratio encode misa77 -0 5219 MB/s 42.64% 54.5 MB/s misa77 -1 4274 MB/s 39.65% 51.2 MB/s lz4 2505 MB/s 47.59% 371 MB/s lz4hc -12…
Jul 2026 · github.com · its alternatives →
- 15
Hello HN, I'm very excited to have finished a gzip decoder that can speed up decompression using threads. On my Ryzen 3900X, I measured a 8x speedup over standard gzip, reaching 1.6 GB/s for a synthetic file with a consistent compression ratio of 1.3. A functional decompressor like this is kind of a first, that's why I am excited. Pragzip implements the two-staged decompression idea put forward with pugz, which unfortunately only works with gzipped text files not arbitrary files and has many more limitations. I think my main contribution over pugz might be a fast (~10 MB/s)…
2022 · github.com · its alternatives →
- 16
CodebaseUp▲139Low code fast-track to launch your idea next weekend
2023 · codebaseup.com · its alternatives →
- 17
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 →
- 18
SIMD noise library for Rust. Contribute to verpeteren/rust-simd-noise development by creating an account on GitHub.
2018 · github.com · its alternatives →
- 19
I have posted a much earlier version of this over a year ago [0]. Since then a lot has changed. Obviously, the name has changed. This happened for the paper publication [1]. I have also optimized the speed, integrated ISA-L for special cases, limited the compression-ratio-dependent maximum memory consumption, and finally added parallelized CRC32 computation, which adds ~5% overhead no matter the number of cores used. At this point, I am leaning towards calling it production-ready although there are still many ideas for improvements. Redoing the benchmarks of the older Show HN, would look…
2023 · github.com · its alternatives →
- 20
CodeBurn▲103See where your AI coding spend actually goes
Aug 2026 · codeburn.app · its alternatives →
- 21AG
This is a vector index I built that supports insertion and k-nearest neighbors (k-NN) querying, optimized for GPUs. It operates entirely in CUDA and can process queries on half a billion vectors in under 200 milliseconds. The codebase is structured as a standalone library with an HTTP API for remote access. It’s intended for high-performance search tasks—think similarity search, AI model retrieval, or reinforcement learning replay buffers. The codebase is located at https://github.com/rodlaf/BinaryGPUIndex.
2025 · rlafuente.com · its alternatives →
- 22IP
2017 · strandmark.net · its alternatives →
- 23
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 →
- 24
I initially built cs (codespelunker) as a way to answer the question, can BM25 relevance search work without building an index? Turns out it can, and so I iterated on the idea, building it into a full CLI tool. Recently I wanted to improve it by adding relevance of tools like Sourcegraph or Zoekt but again without adding an index. cs uses scc https://github.com/boyter/scc to understand the structure of the file on the fly. As such it can filter searches to code, comments or strings. It also applies a weighted BM25 algorithm where matches in actual code rank higher than…
2023 · github.com · 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 →