Editing Fowler–Noll–Vo hash function (section)

===FNV prime===

An ''FNV prime'' is a [[prime number]] and is determined as follows:<ref name="FNV_prime"/><ref name=FNV_prime_remarks>{{Cite web|url=http://www.isthe.com/chongo/tech/comp/fnv/index.html#fnv-prime|title=FNV Hash - A few remarks on FNV primes|website=www.isthe.com}}</ref>

For a given integer {{Mvar|s}} such that {{Math|4 < ''s'' < 11}}, let {{Math|1=''n'' = 2<sup>''s''</sup>}} and {{Math|1=''t'' = {{floor|(5 + ''n'') / 12}}}}; then the {{Mvar|n}}-[[bit]] FNV prime is the smallest [[prime number]] {{Mvar|p}} that is of the form
:<math>256^t + 2^8 + \mathrm{b}\,</math>

such that:
:* {{Math|0 < ''b'' < 2<sup>8</sup>}},
:* the number of one-bits in the [[binary number|binary]] representation of {{Mvar|b}} is either 4 or 5, and
:* {{Math|''p'' mod (2<sup>40</sup> &minus; 2<sup>24</sup> &minus; 1) > 2<sup>24</sup> + 2<sup>8</sup> + 2<sup>7</sup>}}.

Experimentally, FNV primes matching the above constraints tend to have better dispersion properties. They improve the polynomial feedback characteristic when an FNV prime multiplies an intermediate hash value. As such, the hash values produced are more scattered throughout the {{Mvar|n}}-[[bit]] hash space.<ref name=FNV_prime /><ref name= FNV_prime_remarks />