News for hackers. Stuff that matters.
Re:In-memory hash tree implementation by mxmm on Sunday March 27, 2016 @11:36AM (#11370291)
If something hashes to 31, it will be

1 (mod 2) 1 (mod 3) 1 (mod 5) 3 (mod 7) 9 (mod 11) 5 (mod 13) 14 (mod 17) 12 (mod 19) 8 (mod 23) 2 (mod 31)

This would then dictate the location in the hash tree (depending on how deep it is) of any entry to hashes to 31 or to those values modulo those primes.

There are no comments on this comment yet.