Apr 9, 2025

After a LOT of performance testing and tuning I've settled on the bloom filter and method of sizing [k=log2(m)], as well as the means of point hash combining for the bucket selector and filter entropy (fnv1a). Final tests on the mini show 48 minutes with the point duplicate search enabled, and 36.8 minutes with it disabled (which is a few seconds faster than the fastest milestone run ever on any machine). Since the hash combining has a higher computational cost, and is always in effect, I wanted to make sure there was no impact from it, and it appears to be inconsequential.