How to make the trade-off between collision numbers and performance of recurrence calculation for H[i]?

More the prime is bigger, less false positive we gets. This is supposed to make our code faster.

In the other hand, more the prime is bigger, the related division and multiplication operations get slower.