# filter — geometry & stats
A Bloom filter answers "is this username taken?" with
definitely no or probably yes —
using just 512 bits, no list of names.
Each name lights 4 cells; a name is "taken"
only if all of its cells are lit.
live stats (from GET /v1/filter)
usernames added0
bits set0 / 512
fill0%
false-positive odds~0%
crowd the filter (POST /v1/seed)
rebuild (POST /v1/reset — wipes everything)
# the bit array
probe: hashes will appear here — h(name) → k positions
$ ready. type a username and hit CHECK or CLAIM.
checks 0
available 0
probably taken 0
false positives 0
# request log — live HTTP to Render