On Feb 23, 2022, at 14:00:21, Tom Harper wrote: > > Your best bet is a dynamic hash table of size of an appropriate Mersenne > Prime. The fastest effective way to hash your key is using the CKSM > instruction. Although fast, it does produce more synonyms than other hash > techniques. > Why a Mersenne Prime? The first thing I find is: <https://www.quora.com/How-are-Mersenne-primes-used> The key is that you can compute x mod p really fast if p is a Mersenne prime.
Is this a significant advantage on z hardware? Are name/token services, IEANTCR/IEANTRT useful here? -- gil
