|
|
|
|
|
by kd913
1876 days ago
|
|
I disagree, the computational expensive aspect is the fact that you are trying to find the inverse of the double hash.
Hence you are forced to brute force. If the problem was adjusted where it wasn't using a double hash, and had some simple two-way function than it wouldn't be considered computationally expensive. That is irrespective of the length of the nonce. E.G if it was just a how much do I add to get a nonce of length x. The complexity here is caused by the double hash. The length of the nonce is just an even further scaling of an already difficult problem. |
|