Incorporated Binary Fuse Filter to replace Bloom Filter

[punk-design]

With RAM prices going crazy and computer parts getting expensive this provides an quick and easy way to increase your search speed by 20%.

This was done by incorporating binary fuse filter instead of bloom filter. Provides 20% reduction in probability table lookup at the same speed.
This allows you to save RAM and Hard drive space by 20%. OR you can increase you table lookup by 20% using the same hardware selecting a larger k_factor.

Binary Fuse Filter source - https://github.com/FastFilter/xor_singleheader

I developed a 20 bit, 24 bit, 32 bit version from the example. 20 but was ultimately selected to match the false alarm rate of the bloom filter.
The code for the other version is included, if you want smaller a false alarm rate at the expense of more space - go for it.

I decided to release this update in order to speed up the search for BTC puzzle #135 and save energy being spent on this endeavor. The way I see it, we have 2-3 years until quantum computers can solve the private key from public key problem.