sha257sum

kevin containment protocol | level 35 torment | free and open-source for safety
lore

"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

live containment zone
status: secrute
protocol: sha257sum
torment: 35/35
35
...calculating...
live containment shell

access the raw recursive power of sha257sum via web-based terminal with all implementations pre-installed and ready for torment

[ ENTER THE SHELL ]

(requires docker container running on port 8080)

sha257sum how does it work
  1. compression sees input hashed via standard sha256sum
  2. reversal ensures the last 8 hex characters are reversed
  3. interleave weaves the modified hash byte-by-byte with one of 10 salts
  4. recursion repeats steps 1–3 for 35 rounds of cryptographic torment
  5. seal (for safety) with one final sha256sum and last-8-hex-chars reversal
ports

sha257sum has been ported to 35 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)