Its quite simple. Basically, you hash a value into a series of indexes that point to a bit array of fixed length. You then turn all the bits those indexes point to to one. To check if a value is in your bloom filter, you simply hash a value into the indexes, and if all are 1, the value exsits in your bloom filter. The length of the array and the number of indices denotes the accuracy.