cwebber2dzho: a bloom filter is just a sizable bytevector, where hashes are made to the size of that large bytevector, and then are bitwise OR'ed into a union where each 1 is where *any* member of the set had a 1 in its hash and a 0 is where no members had a 1
