The multiplication is performed modulo 2 n where n is the bit length of hash . The FNV-0 is the historic FNV algorithm. Use of the historic FNV-0 hash is not recommended. The FNV-0 hashes all buffers that contain only 0 octets to a hash value of 0. The FNV-1 does not suffer from this minor problem.
Some primes do hash better than other primes for a given integer size.
In the C FNV source below, primes are provided for 32 bit and 64 bit unsigned integers. If you would need a FNV hash of a different bit width send an EMail message with your name, EMail address and the bit width of interest to the address above .