Hello everybody,

My question is: How to make the trade-off between collision numbers and performance of computing the sliding window hash?

More the prime is big, less false positive we gets. This is supposed to make our code faster.
On the other hands, more the prime is big, the related operations (multiplication + module) get slower.

Thanks in advance!