Find a nonce such that hash(x + nonce) has n leading zeroes, and you've invented Proof of Work :)

It is amazing how different techniques add up, but almost exclusively base off of a novel, mathematically sound, fundamental piece of computer science.