Ribbon filter: Practically smaller than Bloom and Xor

What this post added

Introduced the Ribbon filter, a new space-efficient data structure that is practically smaller than Bloom filters. Ribbon filters offer near-continuous configurability in the accuracy-versus-space trade-off, with space overhead as low as 1 percent or less, and O(1) query times. They save roughly 1/3 of memory compared with Bloom filters by solving a linear system using Gaussian elimination on a band matrix structure, with an on-the-fly construction algorithm called Rapid Incremental Boolean Banding ON the fly (Ribbon).