FNV (Fowler-Noll-Vo) is a fast non-cryptographic hash function. It's simple to implement, has good distribution, and is widely used in hash tables, checksums, and fingerprinting.

FNV-1 multiplies then XORs, while FNV-1a XORs then multiplies. FNV-1a has slightly better avalanche characteristics and is generally preferred.

FNV is used in DNS servers, web caches, database indexing, hash tables, file comparison, and anywhere fast hashing with good distribution is needed. It's part of many programming languages' standard libraries.

No. FNV is designed for speed and distribution, not security. It's trivial to create collisions. Use SHA-256 for security purposes.

FNV is defined for 32, 64, 128, 256, 512, and 1024 bits. The 32-bit and 64-bit versions are most common.

FNV is simple to implement (just XOR and multiply), fast, and has good distribution for hash tables. It's ideal when you need a quick, reliable hash without cryptographic overhead.

The offset basis is the initial hash value. For FNV-1a-32, it's 2166136261 (0x811c9dc5). For FNV-1a-64, it's 14695981039346656037.

Yes. All computation happens in your browser using JavaScript. Your data never leaves your device.

Related Tools