i think, yes i said think (not sure) that pools spread out the randomness.
eg lets pretend the nonse is a hash of a random number between 1-1billion
eg lets pretend the nonse is a hash of a random number between 1-1billion
In Bitcoin, the nonce is always a number between 1 and 4,294,967,295 (maximum 32 bit unsigned integer)
instead of all miners starting at 1. they would (or atleast should) tell:
miner A to start at 0 and work to 1million
miner B to start at 1million and 1 and work to 2million
and so on for 1000 miners
that way a block gets solved 1000 times faster then all miners singularly mining from 1-1billion
and if im wrong. then this is how i would program a mining pool
(i know its a bunch of letters and numbers, not just numbers, so replace miner A 0-1mill as a0 to a9blah and miner B as b0 to b9blah(you get the idea))
miner A to start at 0 and work to 1million
miner B to start at 1million and 1 and work to 2million
and so on for 1000 miners
that way a block gets solved 1000 times faster then all miners singularly mining from 1-1billion
and if im wrong. then this is how i would program a mining pool
(i know its a bunch of letters and numbers, not just numbers, so replace miner A 0-1mill as a0 to a9blah and miner B as b0 to b9blah(you get the idea))
No, the nonce is just a number. Any ASIC capable of more than 4GH/s can try all 4,294,967,295 possibilities in a fraction of a second. Most block headers have no possible solution. Instead of each miner being assigned a different nonce to start from, each miner receives a different set of block headers to attempt to solve.
Each miner attempts all possible nonces for the blockheaders that they are assigned, and if they don't find any solutions, then they request another set of headers to work on.
