A cryptographic hash function whose computational graph depends on the message being hashed. Each input is routed through a forest of 8 binary trees, where branching decisions are driven by hidden sponge capacity state.
ForestHash-256: Collision-Resistant Hashing via Adaptive Computational Graphs
Madhava Gaikwad, Mohadeb Mondal — Independent Researchers, March 2026
IACR ePrint
python foresthash.pyRequires Python 3.8+, standard library only.
Research prototype. Ideal-model proofs complete; ideal-to-real gap open.