hash-function

Anemoi: a Family of ZK-friendly Arithmetization Oriented Hash Functions

Hash function based on the non-reversible Cellular Automata Game of Life.

HashX is a high-performance 512-bit hashing algorithm optimized for speed, security, and scalability. It features multi-threading, advanced mixing, and HMAC-style security, ensuring strong collision resistance and a powerful avalanche effect. Ideal for checksums, indexing, data integrity, and non-cryptographic applications.

WISEATA — inspect what changed. Deterministic verification for the Wise Independent Network: see exactly how an artifact is shaped and whether it changed. Local-first, no servers. A Wise.Est Systems protocol.

Experimental 1536-bit sponge hash family featuring a controller-driven permutation with machine-checked Lean 4 wide-trail proofs

Self-referential image hash proof-of-work. The image defines its own hash function, then is hashed by it. 52 tests, 1750 h/s.

Arithmetization Friendly Hash Function Poseidon2b over Binary Extension Field

A test rig for 64-bit mixers that does not saturate: how much data before the output can be told from random. Kilobytes for weak mixers, terabytes for strong ones.

Hash tables efficiencies by hash functions, load factors, and collision handling methods, with hash code distribution analysis.

ARX-Hash is a minimal 32-bit keyed hash for teaching cryptography. It features an MD construction, configurable output (8 to 40 bits), and comes with a full teaching unit: guided implementation, cryptanalysis, Grover's algorithm simulation, and a pluggable SPHINCS+ variant

A lightweight cryptographic hash function inspired by ChaCha20, designed for speed, simplicity, and efficiency in resource-constrained environments. Ideal for embedded systems, research, and educational purposes. Not intended for production use without further cryptanalysis.

Cryptography Course, Second Project.