This blog post will give an overview of a static bitsequence data structure known as RRR, which answers arbitrary length rank queries in $\mathcal{O}(1)$ time, and provides implicit compression. As my blog is informal, I give an introduction to this structure from a birds eye view. If you want, read my thesis for a version with better markup, and follow the citations for proofs by people smarter t
![RRR: A Succinct Rank/Select Index for Bit Vectors](https://cdn-ak-scissors.b.st-hatena.com/image/square/e6a8ccc4d33ac432c69db9dac27fde5ead7e50df/height=288;version=1;width=512/https%3A%2F%2Fs3-placid.s3.eu-central-1.amazonaws.com%2Fproduction%2Frest-images%2Fogmggaxdl%2Fghost-b0bc9ed5cb2977237163837d94f6805f-m28ulwjy.jpg)