A sparse, compressed bitmap index in C. Better than Roaring Bitmaps?

Name: A sparse, compressed bitmap index in C. Better than Roaring Bitmaps?
Availability: InStock
Author: gregburd

by gregburd·May 19, 2026·2 points·0 comments

Visit Project View on HN

AI Analysis

●●SolidBig BrainNiche Gem

Beats Roaring Bitmaps on sparse runs with 8-byte descriptors for billion-bit sequences.

Strengths

•Dual encoding strategy switches between sparse bit-vectors and RLE based on local density patterns.
•Production-grade hardening includes fuzz harnesses, valgrind checks, and CI drift detection.
•Meson build system with Nix flake support ensures reproducible builds across architectures.

Weaknesses

•Zero stars and forks suggests limited community validation compared to established alternatives.
•Benchmarks claim superiority but lack direct side-by-side latency/throughput tables vs Roaring.

Post Description

This is an implementation of a sparse, compressed bitmap index. In the best case, it can store 2048 bits in just 8 bytes. In the worst case, it stores the 2048 bits uncompressed and requires an additional 8 bytes of overhead. It compares favorably against Roaring Bitmaps and other competition in the space, but is it better?