I'm working on a puzzle. I'm about 75% of the way through solving the puzzle.

The only thing left is you hash 33 two character pairs. I have 32 two character pairs.

Possible characters are [a-z, A-Z, 0-9]

Positionally the 33rd two character pair can be at the beginning, in between every other pair, or at the end.

Once a 33 two character pair is generated.

My programming skills are so rusty, that this one is causing me brain cramps.

Any help would be greatly appreciated.

  • 1
    $\begingroup$ Oh, you cheater... it's D5 for a reason! $\endgroup$
    – user46002
    Commented Jun 21, 2019 at 3:47

1 Answer 1


Certainly not elegant, but Give it a go

The result is

11aD1wwya0dCV4fkL01oDy0YeYY7qIXHn, which is made by adding 6e to the end. The hash it produces is the first one.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.