No, that's not correct. There's no "issuing" of a block. You're probably thinking in terms of a "round", as pools often call the timespan until they find a block. If the difficulty changes during a "round", the block has to be found with the new difficulty.
This might not be the right thread but after i read your answer i thought id better get dirty and get rid of my missconceptions.
So i went to the lions den (https://en.bitcoin.it/wiki/Block
) and honestly, that page could use some clarifying.
As i understand it now the generation of blocks is actually done when the block is solved (and several blocks can be solved competing for the same space in the block chain).
But other pages (https://en.bitcoin.it/wiki/Block_hashing_algorithm
) talk about it as if the block exists from the beginning, which i guess it does: "When generating, you constantly hash the block header. The block is also occasionally updated as you are working on it."
When reading about the generation algorithm (https://en.bitcoin.it/wiki/Generation_Calculator
) it says that:
"Divide by 115792089237316195423570985008687907853269984665640564039457584007913129639935, which is the maximum value of a 256-bit number. You now have the probability of a single hash solving a block."
If this holds true there is a finite number of hashings that would guarantee that a block is solved.
Thus the following statement on the https://en.bitcoin.it/wiki/Block
page is incorrect.
"What if I'm 1% towards calculating a block and...?
- There's no such thing as being 1% towards solving a block. You don't make progress towards solving it. After working on it for 24 hours, your chances of solving it are equal to what your chances were at the start or at any moment. Believing otherwise is what's known as the Gambler's fallacy .
- It's like trying to flip 53 coins at once and have them all come up heads. Each time you try, your chances of success are the same. "
The citation above is only true if we are talking about an infinitely long serie.
As an example.
- The maximum value is: 115792089237316195423570985008687907853269984665640564039457584007913129639935.
- If the calculation above (Generation_Calculator) is true the chances of finding the hash when 115792089237316195423570985008687907853269984665640564039457584007913129639935 - 1 hashes has been done equals 1.
- Thus proving the block page to be wrong.
I have no idea what the correct answer is
Maybe this should have been in another thread...