Bitcoin hash calculation method
Publish: 2021-05-21 11:38:22
1. In order to understand the technical principle of bitcoin, we need to understand two important cryptographic techniques: hash code: it converts a long string into a fixed length string, and its conversion is irreversible, that is, it is impossible to guess the original string from hash code. Sha256 is mainly used in bitcoin protocol
public key system: corresponds to a public key and a private key, keeps the private key in the application and publishes the public key. When Party A transmits information to Party B, it can use Party A's private key to encrypt the information, and Party B can use Party A's public key to decrypt the information, so as to ensure that the third party cannot impersonate Party A to send the information; At the same time, when Party A transmits information to Party B, it is encrypted with Party B's public key and sent to Party B, and then Party B decrypts it with his own private key, so as to ensure that the third party cannot eavesdrop on the communication between the two people. RSA is the most common public key system, but the lliptic curve digital signature algorithm is used in bitcoin protocol. What's the difference between cash and bank account? Bitcoin is an electronic currency in BTC. In this article, it is also used to refer to the whole bitcoin system. Like opening an account in a bank, the corresponding concept in bitcoin is address. Everyone can have one or more bitcoin addresses, which are used to pay and collect money. Each address is a string that starts with 1. For example, I have two bitcoin accounts, and. A bitcoin account is uniquely determined by a pair of public key and private key. To save the account, you only need to save the private key file. Unlike bank accounts, banks keep all transaction records and maintain the book balance of each account, while bitcoin's transaction records are jointly maintained by the whole P2P network through a pre agreed protocol. How much money is in my account address? Although the current account balance can be seen by bitcoin software, unlike banks, there is no place to maintain the book balance of each address. It can only calculate the account balance in real time through all historical transactions. How do I pay? When I pay from address a to address B of the other party, the payment amount is e. at this time, both parties will announce the transaction information to each network node, telling address a to pay to address B, and the payment amount is e. In order to prevent the third party from forging the transaction information, the transaction information will be encrypted with the private key of address A. at this time, the network node receiving the transaction information can use the public key of address a to verify that the transaction information is indeed sent by address a. Of course, trading software will help us do these things, we just need to input the relevant parameters in the software. What will the network node do after receiving the transaction information? This is the most important part of the bitcoin system, which needs to be elaborated. For the sake of simplicity, only bitcoin protocol has been implemented. In the current version, each network node will save all transaction information synchronously. There are two kinds of transaction information in history, one is & quot; Verified & quot; The transaction information, that is, the verified transaction information, is stored in a series of "blocks". Each & quot; block" Is the previous & quot; bock" The ID of each block is the hash code of the hash code of the block and the new transaction information (see an actual block). The other category refers to those who also & quot; Unverified & quot; The transaction information just paid above belongs to this category. When a network node receives new unverified transaction information (possibly more than one), it can calculate the book balance of each address at that time because the node keeps all the transaction information in history, so it can calculate whether the transaction information is valid, that is, whether there is enough balance in the payment account. After eliminating the invalid transaction information, it first takes out the last & quot; block" Then, the unverified transaction information is combined with the ID, and a verification code is added to form a new "block". It needs a lot of calculation to build a new block, because it needs to calculate the verification code, so that the above combination becomes a block, that is, the first several bits of the hash code of the block are 1. At present, the first 13 bits need to be 1 (generally, the specific method is uncertain), which means that if the block is generated by enumeration method, the average number of enumerations is 16 ^ 13. Using CPU resources to generate a block is called "gold mining", because the proction of the block will get a certain reward, and the reward information has been included in the block. When a network node generates a new block, it will broadcast to other network nodes. However, this network block may not be accepted by the network, because it is possible that other network nodes have proced the block earlier. Only the earliest block or the block with the largest number of subsequent blocks is valid, and the remaining blocks are no longer used as the initial blocks of the next block. How does the other party confirm that the payment is successful? When the payment information is distributed to the network node, the network node begins to calculate whether the transaction is valid (that is, whether the account balance is enough to pay), and attempts to generate blocks containing the transaction information. When six blocks (one direct block and five subsequent blocks) contain the transaction information, the transaction information is considered "verified", so that the transaction is formally confirmed, and the other party can confirm the successful payment. A possible problem is that I will pay the balance of address a to address B, and at the same time pay to address C. If I only verify that the single comparison transaction is valid. At this point, my way of cheating is to generate six blocks including B to B and six blocks including C to C before the truth is revealed. Because I need a very long CPU time to generate a block, compared with the whole network, the probability of my cheating success is very small. What is the motivation of network nodes to proce blocks? As can be seen from the above description, in order to make the transaction information effective, the network node needs to generate 1 and 5 subsequent blocks to contain the transaction information, and such block generation is very CPU intensive. How to let other network nodes help to proce blocks as soon as possible? The answer is very simple. The agreement stipulates that BTC will be rewarded for the address where the block is proced, as well as the Commission promised by both parties. At present, the reward for procing a block is 50btc, which will be halved every four years in the future. For example, the reward will be 25btc from 2013 to 2016. Is the transaction anonymous? Yes, and No. All bitcoin transactions are visible. We can check all transaction records of each account, such as mine. But what's different from the banking monetary system is that everyone's account itself is anonymous, and everyone can open many accounts. In general, anonymity is not as good as it claims. But bitcoin has another advantage in doing black market trading: it can't be frozen. Even if the police trace a bitcoin address, there is nothing they can do unless they trace the computer used by the exchange based on the Internet address. How to ensure that bitcoin does not depreciate? Generally speaking, in the case of equivalent trading activities, the value of money is inversely proportional to the amount of money issued. Unlike the traditional money market, the central bank can determine the amount of money issued. Bitcoin does not have a central issuing institution. Only by procing blocks can we get a certain amount of BTC currency. Therefore, bitcoin's new amount of money depends on: 1. The speed of procing blocks: bitcoin's agreement stipulates that the difficulty of procing blocks is fixed at an average of 2016 every two weeks, about 10 minutes. Moore's law of doubling CPU speed every 18 months will not speed up the proction of block. 2. The number of rewards for block proction: at present, 50 BTC is awarded for each block proced, which is halved every four years. In 2013, 25 BTC is awarded, and in 2017, 12.5 BTC is awarded. Considering the above two factors, bitcoin's currency issuing speed is not controlled by any single node in the network. Its protocol makes the currency stock known in advance, and the maximum stock is only 21 million BTC
public key system: corresponds to a public key and a private key, keeps the private key in the application and publishes the public key. When Party A transmits information to Party B, it can use Party A's private key to encrypt the information, and Party B can use Party A's public key to decrypt the information, so as to ensure that the third party cannot impersonate Party A to send the information; At the same time, when Party A transmits information to Party B, it is encrypted with Party B's public key and sent to Party B, and then Party B decrypts it with his own private key, so as to ensure that the third party cannot eavesdrop on the communication between the two people. RSA is the most common public key system, but the lliptic curve digital signature algorithm is used in bitcoin protocol. What's the difference between cash and bank account? Bitcoin is an electronic currency in BTC. In this article, it is also used to refer to the whole bitcoin system. Like opening an account in a bank, the corresponding concept in bitcoin is address. Everyone can have one or more bitcoin addresses, which are used to pay and collect money. Each address is a string that starts with 1. For example, I have two bitcoin accounts, and. A bitcoin account is uniquely determined by a pair of public key and private key. To save the account, you only need to save the private key file. Unlike bank accounts, banks keep all transaction records and maintain the book balance of each account, while bitcoin's transaction records are jointly maintained by the whole P2P network through a pre agreed protocol. How much money is in my account address? Although the current account balance can be seen by bitcoin software, unlike banks, there is no place to maintain the book balance of each address. It can only calculate the account balance in real time through all historical transactions. How do I pay? When I pay from address a to address B of the other party, the payment amount is e. at this time, both parties will announce the transaction information to each network node, telling address a to pay to address B, and the payment amount is e. In order to prevent the third party from forging the transaction information, the transaction information will be encrypted with the private key of address A. at this time, the network node receiving the transaction information can use the public key of address a to verify that the transaction information is indeed sent by address a. Of course, trading software will help us do these things, we just need to input the relevant parameters in the software. What will the network node do after receiving the transaction information? This is the most important part of the bitcoin system, which needs to be elaborated. For the sake of simplicity, only bitcoin protocol has been implemented. In the current version, each network node will save all transaction information synchronously. There are two kinds of transaction information in history, one is & quot; Verified & quot; The transaction information, that is, the verified transaction information, is stored in a series of "blocks". Each & quot; block" Is the previous & quot; bock" The ID of each block is the hash code of the hash code of the block and the new transaction information (see an actual block). The other category refers to those who also & quot; Unverified & quot; The transaction information just paid above belongs to this category. When a network node receives new unverified transaction information (possibly more than one), it can calculate the book balance of each address at that time because the node keeps all the transaction information in history, so it can calculate whether the transaction information is valid, that is, whether there is enough balance in the payment account. After eliminating the invalid transaction information, it first takes out the last & quot; block" Then, the unverified transaction information is combined with the ID, and a verification code is added to form a new "block". It needs a lot of calculation to build a new block, because it needs to calculate the verification code, so that the above combination becomes a block, that is, the first several bits of the hash code of the block are 1. At present, the first 13 bits need to be 1 (generally, the specific method is uncertain), which means that if the block is generated by enumeration method, the average number of enumerations is 16 ^ 13. Using CPU resources to generate a block is called "gold mining", because the proction of the block will get a certain reward, and the reward information has been included in the block. When a network node generates a new block, it will broadcast to other network nodes. However, this network block may not be accepted by the network, because it is possible that other network nodes have proced the block earlier. Only the earliest block or the block with the largest number of subsequent blocks is valid, and the remaining blocks are no longer used as the initial blocks of the next block. How does the other party confirm that the payment is successful? When the payment information is distributed to the network node, the network node begins to calculate whether the transaction is valid (that is, whether the account balance is enough to pay), and attempts to generate blocks containing the transaction information. When six blocks (one direct block and five subsequent blocks) contain the transaction information, the transaction information is considered "verified", so that the transaction is formally confirmed, and the other party can confirm the successful payment. A possible problem is that I will pay the balance of address a to address B, and at the same time pay to address C. If I only verify that the single comparison transaction is valid. At this point, my way of cheating is to generate six blocks including B to B and six blocks including C to C before the truth is revealed. Because I need a very long CPU time to generate a block, compared with the whole network, the probability of my cheating success is very small. What is the motivation of network nodes to proce blocks? As can be seen from the above description, in order to make the transaction information effective, the network node needs to generate 1 and 5 subsequent blocks to contain the transaction information, and such block generation is very CPU intensive. How to let other network nodes help to proce blocks as soon as possible? The answer is very simple. The agreement stipulates that BTC will be rewarded for the address where the block is proced, as well as the Commission promised by both parties. At present, the reward for procing a block is 50btc, which will be halved every four years in the future. For example, the reward will be 25btc from 2013 to 2016. Is the transaction anonymous? Yes, and No. All bitcoin transactions are visible. We can check all transaction records of each account, such as mine. But what's different from the banking monetary system is that everyone's account itself is anonymous, and everyone can open many accounts. In general, anonymity is not as good as it claims. But bitcoin has another advantage in doing black market trading: it can't be frozen. Even if the police trace a bitcoin address, there is nothing they can do unless they trace the computer used by the exchange based on the Internet address. How to ensure that bitcoin does not depreciate? Generally speaking, in the case of equivalent trading activities, the value of money is inversely proportional to the amount of money issued. Unlike the traditional money market, the central bank can determine the amount of money issued. Bitcoin does not have a central issuing institution. Only by procing blocks can we get a certain amount of BTC currency. Therefore, bitcoin's new amount of money depends on: 1. The speed of procing blocks: bitcoin's agreement stipulates that the difficulty of procing blocks is fixed at an average of 2016 every two weeks, about 10 minutes. Moore's law of doubling CPU speed every 18 months will not speed up the proction of block. 2. The number of rewards for block proction: at present, 50 BTC is awarded for each block proced, which is halved every four years. In 2013, 25 BTC is awarded, and in 2017, 12.5 BTC is awarded. Considering the above two factors, bitcoin's currency issuing speed is not controlled by any single node in the network. Its protocol makes the currency stock known in advance, and the maximum stock is only 21 million BTC
2. What is hash algorithm? How to ensure the fairness of mining
hash algorithm is a cryptographic algorithm that can only encrypt, but not decrypt. It can convert any length of information into a fixed length string
this string has two characteristics:
1. Even if the input value changes only a little, the output hash value will be very different
2. Only exactly the same input value can get exactly the same output value
3. There is no rule between the input value and the output value, so the input value cannot be calculated by the output value. In order to find the specified output value, we can only use enumeration method: constantly change the input value to find the output value that meets the conditions
hash algorithm ensures that the results of bitcoin mining can not be deced reversely. Therefore, the miner's continuous operation is essentially brutally cracking the correct input value. Whoever finds the first one will get the bitcoin reward.
hash algorithm is a cryptographic algorithm that can only encrypt, but not decrypt. It can convert any length of information into a fixed length string
this string has two characteristics:
1. Even if the input value changes only a little, the output hash value will be very different
2. Only exactly the same input value can get exactly the same output value
3. There is no rule between the input value and the output value, so the input value cannot be calculated by the output value. In order to find the specified output value, we can only use enumeration method: constantly change the input value to find the output value that meets the conditions
hash algorithm ensures that the results of bitcoin mining can not be deced reversely. Therefore, the miner's continuous operation is essentially brutally cracking the correct input value. Whoever finds the first one will get the bitcoin reward.
3.
renrenfu financial and business school tells you that every bitcoin node will collect all unconfirmed transactions and gather them into a data block, which will be integrated with the previous data block. The miner node will attach a random adjustment number and calculate the SHA-256 hash value of the previous data block. The mining node keeps trying again and again until it finds the random adjustment number so that the generated hash value is lower than a specific target
because hash operation is irreversible, it is very difficult to find the required random adjustment number, which requires a continuous trial and error process that can predict the total number. At this time, the workload proof mechanism will play a role. When a node finds a satisfactory solution, it can broadcast its results to the whole network. Other nodes can receive the new data block and check whether it meets the specification. If other nodes do meet the requirements by calculating the hash value, then the data block is valid, and other nodes will accept the data block and attach it to their own chain
bitcoin mining uses SHA-256 hash value operation. This algorithm will carry out a large number of 32-bit integer circular right shift operations
exhaustive verification until it finds a data that meets the requirements. This meaningless data is a dollar
4.
Hash algorithm maps any length of binary value to a fixed length of smaller binary value, which is called hash value. Hash value is a unique and compact numerical representation of a piece of data. If you hash a piece of plaintext and change only one letter of the paragraph, subsequent hashes will proce different values. It is computationally impossible to find two different inputs with the same hash value
message authentication code (MAC) hash function is usually used with digital signature to sign data, while message detection code (MDC) hash function is used for data integrity
the basic information of bitcoin network is as follows:
all digital currencies that need to be mined have hash values, such as Laite coin, Ruitai coin, doggy coin, Weimeng coin, Diandian coin, Yuanbao coin, etc< br />
5. Fool tests Summoner
[comedy + compare h bar]<
grandson of the slippery ghost
[so this is introced by a friend = v = I haven't seen it]
black cat
[male master is a killer, and he was called the terminator of hell later because he was influenced by Shaye]
holy mark of the wind
[absolutely recommended!! The handsome male protagonist is the contractor, controlling the wind is the wind warlock, while the female owner is the famous fire warlock family. Then they quarrel when they meet, but they have very good feelings. They are both arrogant. But later, another person who lives in the male owner's memory appears. The male owner of the weak and weak shrimp suddenly knows that his family has the power to become a robber. Then turn around and turn into a robber. It's very handsome
goblin's tail
[keep pushing. Magic. The painting style is beautiful, the plot is better, it's just a little hot, but you're sure to like it!]
leaves... If it's not enough, then you go to QQ, I'm telling you, I've seen animation ~ give me 0.0
[comedy + compare h bar]<
grandson of the slippery ghost
[so this is introced by a friend = v = I haven't seen it]
black cat
[male master is a killer, and he was called the terminator of hell later because he was influenced by Shaye]
holy mark of the wind
[absolutely recommended!! The handsome male protagonist is the contractor, controlling the wind is the wind warlock, while the female owner is the famous fire warlock family. Then they quarrel when they meet, but they have very good feelings. They are both arrogant. But later, another person who lives in the male owner's memory appears. The male owner of the weak and weak shrimp suddenly knows that his family has the power to become a robber. Then turn around and turn into a robber. It's very handsome
goblin's tail
[keep pushing. Magic. The painting style is beautiful, the plot is better, it's just a little hot, but you're sure to like it!]
leaves... If it's not enough, then you go to QQ, I'm telling you, I've seen animation ~ give me 0.0
6. There are mainly two kinds of bitcoin algorithms, which are elliptic curve digital signature algorithm and sha256 hash algorithm
elliptic curve digital signature algorithm is mainly used in the generation process of bitcoin public key and private key, which is the cornerstone of bitcoin system. SHA-256 hash algorithm is mainly used in the workload proof mechanism of bitcoin
the principle of bitcoin generation is the special solution generated by complex operation, and mining is the process of finding the special solution. However, the total number of bitcoin is only 21 million, and with the continuous mining of bitcoin, the more difficult it will be to proce bitcoin, and the cost of acquiring bitcoin may be higher than the price of bitcoin itself
the bitcoin block consists of a block header and the transaction list contained in the block. The size of the block header is 80 bytes, which is composed of 4-byte version number, 32 byte hash value of the previous block, 32 byte Merkle root hash, 4-byte timestamp (current time), 4-byte current difficulty value and 4-byte random number. A block header with a fixed length of 80 bytes is the input string used to prove the workload of bitcoin. Constantly change the random number in the block header, that is, the value of nonce, and do double sha256 operation on the block header after each change, and compare the result value with the target value of the current network. If it is less than the target value, the problem is solved successfully, and the workload is proved to be complete
the essence of bitcoin is actually the unique solution of a set of equations generated by a bunch of complex algorithms. Bitcoin is the first distributed virtual currency in the world, which has no specific distribution center. The network of bitcoin is composed of all users, because there is no center to ensure the security of data.
elliptic curve digital signature algorithm is mainly used in the generation process of bitcoin public key and private key, which is the cornerstone of bitcoin system. SHA-256 hash algorithm is mainly used in the workload proof mechanism of bitcoin
the principle of bitcoin generation is the special solution generated by complex operation, and mining is the process of finding the special solution. However, the total number of bitcoin is only 21 million, and with the continuous mining of bitcoin, the more difficult it will be to proce bitcoin, and the cost of acquiring bitcoin may be higher than the price of bitcoin itself
the bitcoin block consists of a block header and the transaction list contained in the block. The size of the block header is 80 bytes, which is composed of 4-byte version number, 32 byte hash value of the previous block, 32 byte Merkle root hash, 4-byte timestamp (current time), 4-byte current difficulty value and 4-byte random number. A block header with a fixed length of 80 bytes is the input string used to prove the workload of bitcoin. Constantly change the random number in the block header, that is, the value of nonce, and do double sha256 operation on the block header after each change, and compare the result value with the target value of the current network. If it is less than the target value, the problem is solved successfully, and the workload is proved to be complete
the essence of bitcoin is actually the unique solution of a set of equations generated by a bunch of complex algorithms. Bitcoin is the first distributed virtual currency in the world, which has no specific distribution center. The network of bitcoin is composed of all users, because there is no center to ensure the security of data.
7. The revenue of bitcoin is based on bitcoin every day. The rise and fall are calculated. If it's long, it's positive. If it's down, it's not. Haha, I suggest that my friends try not to play for him, because the price of bitcoin is very high now. If you buy it now, it's the order taker. It's going to hold you tight. And you'll lose a lot of money. So stay away from bitcoin. hey
8. SHA-256 algorithm
9. Bitcoin calculation requires the following parameters:
1. Version of block
2. Hash value of the previous block: prev_ Hash
3. The hash tree value of the transaction record to be written: Merkle_ Root
4. Update time: ntime
5. Current difficulty: nbits
the process of mining is to find x to make
sha256 (version + prev)_ hash + merkle_ root + ntime + nbits + x )) < Target
the range of X in the above formula is 0 ~ 2 ^ 32, which can be calculated according to the current difficulty. In addition to x, you can also try to change Merkle_ Root and ntime. Because of the hash feature, finding such an X can only be brute force search
once calculator a finds x, it can broadcast a new block, and other clients will verify whether the block published by calculator a is legal
if the published block is accepted, the first transaction in each block must be to send the newly generated 25 bitcoins to an address. Of course, calculator a will set this address to the address owned by calculator a to get the 25 bitcoins.
1. Version of block
2. Hash value of the previous block: prev_ Hash
3. The hash tree value of the transaction record to be written: Merkle_ Root
4. Update time: ntime
5. Current difficulty: nbits
the process of mining is to find x to make
sha256 (version + prev)_ hash + merkle_ root + ntime + nbits + x )) < Target
the range of X in the above formula is 0 ~ 2 ^ 32, which can be calculated according to the current difficulty. In addition to x, you can also try to change Merkle_ Root and ntime. Because of the hash feature, finding such an X can only be brute force search
once calculator a finds x, it can broadcast a new block, and other clients will verify whether the block published by calculator a is legal
if the published block is accepted, the first transaction in each block must be to send the newly generated 25 bitcoins to an address. Of course, calculator a will set this address to the address owned by calculator a to get the 25 bitcoins.
Hot content