Computes SHA1 proof-of-work: for a given 64 byte prefix finds a suffix such that the SHA1 hash of the resulting string has number of leading zeroes equal to the difficulty
parameter.
make
./sha1-pow <prefix> <difficulty>
Fast SHA1 implementation in assembly is a courtesy of Project Nayuki.