Turns out it only takes a handful of ASCII characters before the old
bloom filter became 01111111 and matched everything. This implements a
better bloom filter which drastically reduces collisions and makes the
filter far more effective.

Since the new hashing takes a little more computation, using a lookup
table is a modest improvement over recalculating every character
processed.