I just published a blueprint for a new hash function I designed, called Kaoru Hash.
It's a deterministic, fixed-length cryptographic hash that uses no IVs, no lookup tables, no externally chosen constants — the only source of complexity is the input message itself.
The internal pipeline applies invertible base transformations (binary → hex → decimal) that recursively expand and diffuse the message before a final projection. The output is a 300-character digest over [a–zA–Z0–9].
Official PDF + spec (DOI): https://doi.org/10.17605/OSF.IO/TGRZC
It's designed as an open, auditable cryptographic primitive — no hidden seeds, no black-box assumptions, and no trust in institutional parameters.
Feedback and cryptanalysis welcome.
Click to Open Code Editor