sha257sum

"it all began with the string 'kevin' which we thought we could hash...but that was pure hubris"

sha257sum is a containment protocol because standard SHA-256 was insufficient to bind the recursive energy of the test vector "kevin" so we had to go 35 rounds further

each round subjects the input buffer to sequential recursive salt-interleaved torment and if the buffer survives it is hashed again and again

access the raw recursive power of kevin through our web-based terminal. all 25+ implementations are pre-installed and ready for torment.

(requires docker container running on port 8080)

1. initial compression: the input is crushed via standard sha256sum
2. the reveresal: the last 8 hex characters are reversed
3. the interleave: the modified hash is interleaved byte-by-byte with one of 10 salts
4. the recursion: we repeat steps 1–3 for 35 rounds of cryptographic torment
5. final seal: there is one last sha256sum followed by one final last-8-hex-chars reversal

sha257sum has been ported to 25 languages so far but to ensure Kevin's containment across all known compute environments please help us write more (see github repo for open issues and howto)