Implementation simplicity?
Sometimes you need a hash function in an environment that's not a Real Programming Language.
It's hard to do both small and big data correctly, and FNV is one of the few that optimizes for small data.
For moderately small data, larger than around 4 bytes, xxh3 beats it handily. But for extremely small sizes, FNV is still the winner.
Honestly people should probably just try to switch to xxh3 if performance is a concern, but FNV is certainly competitive for integer-size keys.
https://github.com/Cyan4973/xxHash/wiki/Performance-comparis...
See for example http://jonkagstrom.com/bit-mixer-construction/index.html
When the input is an integer, they're very good hash functions on their own.
cycles/map shows you that FNV1a is very good with hash tables, 4x faster than the blake3 monstrosity
Although the most important factor may have been that FNV is just easier to find. Looking for a hash algorithm is hard, the names are weird and opaque and it's hard to find a user friendly ranking or clear directions on how to pick one.
This is a surprisingly resistant belief. It may have been true once, but today FNV is not even close to being a fast hash function. Check the SMHasher benchmarks:
https://github.com/rurban/smhasher#smhasher
FNV1a almost 2x slower than blake3, a cryptographic hash function! More than 10x slower than modern hashers such as Farm, City, Spooky, ..., all of which have far better statistical quality than FNV1.
There is no good reason to use an FNV function nowadays.