Live data from Hacker News

New Bare Hash Map: 2X-3X Speedup over SOTA

github.com

41–42 of 42 posts

Re: New Bare Hash Map: 2X-3X Speedup over SOTA

#41
post #40

With respect to wyrand, it seems that all prime numbers are not created equal. I implemented wyrand() using the two primes just below 2^64. The upper 53 bits of each 64-bit random deviate was used to generate a uniform [0,1) floating point deviate. The expected value of the sum of the uniform floating point deviates is 0.5 * #deviates. When using the two primes numbers above, the resulting value was 0.6430236 * #devi…

you sure make popcount(prime)==32

Re: New Bare Hash Map: 2X-3X Speedup over SOTA

#42
post #40

With respect to wyrand, it seems that all prime numbers are not created equal. I implemented wyrand() using the two primes just below 2^64. The upper 53 bits of each 64-bit random deviate was used to generate a uniform [0,1) floating point deviate. The expected value of the sum of the uniform floating point deviates is 0.5 * #deviates. When using the two primes numbers above, the resulting value was 0.6430236 * #devi…

you sure make popcount(prime)==32

Thanks! Is that requirement in the documentation?
Post reply on HN