2 ms·
HNers with long memories may remember the very similar XKCD "Alma mater" challenge from 2013[1][2] (which is no longer active). There is a sort of continuance
by loeg 7y ago
HNers with long memories may remember the very similar XKCD "Alma mater" challenge from 2013[1][2] (which is no longer active). There is a sort of continuance of that online at https://beatthehash.com/ https://beatthehash.com/ .
The goal of that challenge was similar: find some input string by brute force, such that the Skein-1024( input ) XOR a provided "target" has more zero bits than anyone else. (At the time, Skein was a SHA-3 finalist.)
Git commits must be marginally structured, whereas the Skein challenge input was arbritrary, but that doesn't change the problem much.
[1]: https://xkcd.com/1193/ https://xkcd.com/1193/
[2]: E.g., https://web.archive.org/web/20130403124655/https://xkcd.com/1193/ https://web.archive.org/web/20130403124655/https://xkcd.com/...