I imagine having a prime number size might reduce the chance of collision, probably as a result of some property of modular arithmetic. But if you’re using a d

I imagine having a prime number size might reduce the chance of collision, probably as a result of some property of modular arithmetic. But if you’re using a decent (i.e. actually pseudorandom) hash function I would think this is moot?