Exactly. Because every miner would like to be paid a block award, every miner will use a coinbase transaction that is different from all the other coinbase transactions. Because after all, those other coinbase transactions would pay somebody else instead.
Therefore, every miner is looking at a different transaction set, even if they pick up exactly the same set of transactions made by others. And therefore, every miner would get paid on a different nonce, even if they all started from zero and picked their next nonce just by incrementing one. And they don't. Every time, they start on a different random number for the first nonce.
Topic: how to find a nonce (Read 663 times)
Ok, think of your miner as a black box. you input a string of digits, of which the nounce is just a part, into the box and get a unique string of digits out. Incrementing the nounce creates a new input that results in a new, unique, output. Changing any part of the input string creates a new, unique output string. There other parts of that string of input numbers that vary. The transactions included, if you are using a pool that identifies itself in the coinbase, that would be different for the pools. Coinbase is part of that input string.
Basically, everyworker gets a somewhat unique set of inputs to work with.
Basically, everyworker gets a somewhat unique set of inputs to work with.
got it ,thx
,I'm happy to realise that the coinbase are always different from each miner,thus lead to a different input 
Ok, think of your miner as a black box. you input a string of digits, of which the nounce is just a part, into the box and get a unique string of digits out. Incrementing the nounce creates a new input that results in a new, unique, output. Changing any part of the input string creates a new, unique output string. There other parts of that string of input numbers that vary. The transactions included, if you are using a pool that identifies itself in the coinbase, that would be different for the pools. Coinbase is part of that input string.
Basically, everyworker gets a somewhat unique set of inputs to work with.
Basically, everyworker gets a somewhat unique set of inputs to work with.
In addition: Not every miner will have the same set of transactions that they're trying to include in the block. And a block-header contains a timestamp that will be (slightly) different for different miners.
You mean that the random nonce are relative to the transaction set and block-header contains
No. But if you change the contents of the block header, you change the outcome of the hashing function. So 2 miners that start with 0 as nonce and just increase it will get different hash-values if they have a different block header. So this means that even if miners use the same sequence of nonces to test, it's still quite possible for the slower miner to find a block first every now and then.
In addition: Not every miner will have the same set of transactions that they're trying to include in the block. And a block-header contains a timestamp that will be (slightly) different for different miners.
You mean that the random nonce are relative to the transaction set and block-header contains
I'm confused about the process of looking for a nonce embeded in a block by each node, if the method used by each node are the same ,such as every node start from 0,1,2……until one node found a block. if all nodes work on it by that way with solo mining model, does that means the node with maximum computing power can be the first one to find a block each times?
am I miss somening?
You don't have to start with 0 and go in sequence, you should choose a random noonce.am I miss somening?
got it,thx
In addition: Not every miner will have the same set of transactions that they're trying to include in the block. And a block-header contains a timestamp that will be (slightly) different for different miners.
I'm confused about the process of looking for a nonce embeded in a block by each node, if the method used by each node are the same ,such as every node start from 0,1,2……until one node found a block. if all nodes work on it by that way with solo mining model, does that means the node with maximum computing power can be the first one to find a block each times?
am I miss somening?
You don't have to start with 0 and go in sequence, you should choose a random noonce. am I miss somening?
I'm confused about the process of looking for a nonce embeded in a block by each node, if the method used by each node are the same ,such as every node start from 0,1,2……until one node found a block. if all nodes work on it by that way with solo mining model, does that means the node with maximum computing power can be the first one to find a block each times?
am I miss somening?
am I miss somening?
Jump to: