Hacker News new | ask | show | jobs
by brudgers 1732 days ago
Finding a new value that hashes to four leading zeros is computationally difficult. Because the hash function is designed so that very few values hash to four leading zeros.

But testing to see if a value hashes to zero is computationally simpler. Just take the value, hash it, and see if it has four leading zeros.

What is sent is the input value, not the output with four leading zeros.

The miner claims "if you hash this value, you will get four leading zeros."