Lesson 1: How do blockchains work - question about nonce #157
-
I'm going through the blockchain demo of the How Do Blockchains Work section in Lesson 1 and playing with https://andersbrownworth.com/blockchain/block and have a question about nonce. Nonce is defined as: A “number used once” to find the “solution” to the blockchain problem. Question: Can there only exist one single solution (or nonce) to a given problem (given a specific block & data)? Assume yes, but this is mathematically constrained somehow? |
Beta Was this translation helpful? Give feedback.
Replies: 1 comment 1 reply
-
Actually no :) There could be multiple nonces, and that's how the block difficulty is measured. https://www.nicehash.com/blog/post/blockchain-basics-difficulty#! If nonces are solved too quickly, blockchains will make themselves "harder" by making the problems harder. In the Andersbrownwroth.com example, we looked for hashes that started with 4 0's. But you could make it way harder by forcing them to find hashes that start with 8 0's. There can be many nonces that solve the same problem, the more their are, the easier it is to solve. |
Beta Was this translation helpful? Give feedback.
Actually no :)
There could be multiple nonces, and that's how the block difficulty is measured.
https://www.nicehash.com/blog/post/blockchain-basics-difficulty#!
If nonces are solved too quickly, blockchains will make themselves "harder" by making the problems harder. In the Andersbrownwroth.com example, we looked for hashes that started with 4 0's.
But you could make it way harder by forcing them to find hashes that start with 8 0's.
There can be many nonces that solve the same problem, the more their are, the easier it is to solve.