Given that we are using a high quality hash function (CityHash), we don't really need hash tables to be sized by prime numbers. Using a prime number modulo is useful to mitigate the effects of bad or unreliable (e.g. user provided) hash functions; that's not the case here. A power of two sizing (512 vs 509) results in about a 1% speedup when running open_cursor in a loop.