Topic: How mining really works? Ping vs hash rate (Read 1894 times)
From the Wiki page on Bitcoin Difficulty:
What network hash rate results in a given difficulty?
The difficulty is adjusted every 2016 blocks based on the time it took to find the previous 2016 blocks. At the desired rate of one block each 10 minutes, 2016 blocks would take exactly two weeks to find. If the previous 2016 blocks took more than two weeks to find, the difficulty is reduced. If they took less than two weeks, the difficulty is increased. The change in difficulty is in proportion to the amount of time over or under two weeks the previous 2016 blocks took to find.
To find a block, the hash must be less than the target. The hash is effectively a random number between 0 and 2**256-1. The offset for difficulty 1 is
There is a lot more information on the page below that may help answer your question.
https://en.bitcoin.it/wiki/Difficulty
Quote
60 THashes per second, is around 8 minutes
Why?
Or, mining does not works as I think?
I can not understand very well how mining works
We have :
nVersion, hashPrevBlock,hashMerkleRoot,nTime,nBits, are known?
Only nNonce should be tested and sha256(sha256(header)) < nBits
Unsigned int max is 2^32, 1/(2^32) s, for full test.
If machine can perform 2 * 1/(2^32) should solve a block in a second = 8.5GSha256/s
At this point, seems more important conectivity to whole network. Is this correct?
How new block are propagated?
We have :
Quote
static const int CURRENT_VERSION=2;
int nVersion; /* const */
uint256 hashPrevBlock; /* char */
uint256 hashMerkleRoot; /* char */
unsigned int nTime; /* year 2038 max */
unsigned int nBits; /* 2^32 */
unsigned int nNonce;/* 2^32 */
int nVersion; /* const */
uint256 hashPrevBlock; /* char */
uint256 hashMerkleRoot; /* char */
unsigned int nTime; /* year 2038 max */
unsigned int nBits; /* 2^32 */
unsigned int nNonce;/* 2^32 */
nVersion, hashPrevBlock,hashMerkleRoot,nTime,nBits, are known?
Only nNonce should be tested and sha256(sha256(header)) < nBits
Unsigned int max is 2^32, 1/(2^32) s, for full test.
If machine can perform 2 * 1/(2^32) should solve a block in a second = 8.5GSha256/s
At this point, seems more important conectivity to whole network. Is this correct?
How new block are propagated?
Jump to: