Commerce · alternatives · 2026
24 alternatives to How to store a set of four 5-bit values in one 16-bit value
Cool trick to store 4 5-bit values in one 16-bit value. - jaamesd/BucketCompressionTrick
This is a GitHub repository explaining how to pack four 5-bit values into a single 16-bit integer. It provides technical guidance on bitwise operations and data compression for developers who need to store multiple… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. How to store a set of four 5-bit values in one 16-bit value launched in 2018; newer entries below may have overtaken it.
- 1
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 →
- 2
Properties of a Novel Binary Representation of Integers using Base-𝜙 - irradix/paper.md at main · DOSAYGO-STUDIO/irradix
2024 · github.com · its alternatives →
- 3
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 →
- 4
Simple in-memory Key/Value Store written in Elixir using `cabol/ex_shards` - cabol/kvx
2016 · github.com · its alternatives →
- 5
The fastest 128-bit and 256-bit hash, passes all tests, and under 140 source lines of code. API library and CLI tool in C++ and NodeJS/Wasm - DOSAYGO-STUDIO/rain
2024 · github.com · its alternatives →
- 6OA
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 →
- 7
A small, portable, linear probing hash map. Contribute to e-dant/salmagundi development by creating an account on GitHub.
2024 · github.com · its alternatives →
- 8
A totally proof-of-concept FoundationDB based network block device backend - dividuum/fdb-nbd
2018 · github.com · its alternatives →
- 9
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 →
- 10
Bitwise operations and conversions to hexadecimals
2016 · flippybitandtheattackofthehexadecimalsfrombase16.com · its alternatives →
- 11
While building a Retrieval-Augmented Generation (RAG) system, I was frustrated by my vector database consuming 8GB RAM just to search my own PDFs. After incurring $150 in cloud costs, I had an unconventional idea: what if I encoded my documents into video frames? The concept sounded absurd—storing text in video? But modern video codecs have been optimized for compression over decades. So, I converted text into QR codes, then encoded those as video frames, letting H.264/H.265 handle the compression. The results were surprising. 10,000 PDFs compressed down to a 1.4GB video file. Search…
2025 · github.com · its alternatives →
- 12
Optimizer library for tail recursive calls in Java bytecode - Sipkab/jvm-tail-recursion
2020 · github.com · its alternatives →
- 13UJ
2017 · npmjs.com · its alternatives →
- 14
A vector index built on TurboQuant, written in Rust with Python bindings - RyanCodrai/turbovec
Mar 2026 · github.com · its alternatives →
- 15AT
A 3.16M-parameter INT4 transformer running entirely in the on-chip memory of a Xilinx Kria KV260. Zero DRAM in the token loop, 59,965 tok/s on the fabric, bit-exact. Chat with it live.
Aug 2026 · mikeayles.com · its alternatives →
- 16
MD5-Monomorphic Shellcode Packer - all payloads have the same MD5 hash - DavidBuchanan314/monomorph
2022 · github.com · its alternatives →
- 17
I'm excited to share Hashmap.me, a small tool I've built to simplify data storage and retrieval. It's a straightforward service that allows developers to store data records via HTTP requests and retrieve them easily, all without the hassle of setting up and managing a database. Initially I built this because I was tired of creating a database to prototype my own projects, I just wanted to persist my in memory cache between restarts early on. Each hashmap you create corresponds to its own collection in MongoDB. Perfect for small projects, quick prototypes, or learning purposes. I'd love to…
2024 · hashmap.me · its alternatives →
- 18
Contribute to sendilkumarn/gopurerc development by creating an account on GitHub.
2020 · github.com · its alternatives →
- 19
Problem JSON/NDJSON is everywhere in data platforms, but compression usually breaks searchability. You either keep queryable raw stores (high I/O/egress) or compress into gz/zstd blobs (cheap to store, painful to probe). The “cloud tax” shows up as wasted reads. What I built (SEE — Semantic Entropy Encoding) A schema-aware, searchable compression codec for JSON that keeps exists/pos lookups fast while still compressing. Internals: structure-aware delta + dictionaries, a PageDir + mini-index to jump to relevant pages, and a tuned Bloom filter that skips ~99% of pages.…
2025 · github.com · its alternatives →
- 20
A Go library that implements Consistent Hashing and Consistent Hashing With Bounded Loads. - lafikl/consistent
2017 · github.com · its alternatives →
- 21
Utilities for packing/unpacking fields in a bitstream - astronautlabs/bitstream
2022 · github.com · its alternatives →
- 22
Embeddable minimal in-memory GZIP decompression library for embedded systems - wkoszek/mini_gzip
2015 · github.com · its alternatives →
- 23
Verified AI infrastructure for regulated deployment. UltraCompress (our wedge): near-lossless 5-bit compression with SHA-256-reproducible reconstruction - prove the model in production is the one you validated. 23 architectures (0.6B-405B), Hermes-3-405B @ 1.0066x. OpenAI-compatible API. pip install
May 2026 · github.com · its alternatives →
- 24
A simple re-implementation of Google's sparsehash as a learning excercise. - qpfiffer/Simple-Sparsehash
2015 · github.com · its alternatives →
Also compare
- A nibble-oriented CPU in Verilog to build a scientific calculator alternatives
- Outperforming VByte for Large Integers Using Phi-Encoding alternatives
- A hash array-mapped trie implementation in C alternatives
- Simple in-memory key/value store written in Elixir using Shards alternatives
- Rain hashes – well designed, simple and fast variable sized hashes alternatives
- Overfitted a 900KB Transformer to Compress a 100MB CSV into 7MB 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 →