In other words, that there exists a nonce for the block that will result in sha256(sha256(block header + nonce)) hash under the current difficulty barrier number.
Can it be mathematically proven that a block can be solved?
user1497250
- 181
- 4