A blockchain consensus algorithm based on signature authentication for mapped addresses

Abstract

This invention discloses a blockchain consensus algorithm based on signature authentication and mapped addresses. It includes various block nodes and a server, with each block node communicating with each other or with the server. In use, signature authentication is used to authenticate each node, improving node security and facilitating data transmission. The initiating block node uses mapping technology and a hash algorithm to encode and generate a brief description of the address and account information. The mapping technology only transmits the account address, reducing transmission time and storage redundancy among other block nodes. The server randomly selects the authentication block node, which also needs to perform identity authentication before accessing the initiating block node to authenticate account information, thus improving security.

Description

Technical Field

[0001] This invention belongs to the field of blockchain consensus technology, specifically relating to a blockchain consensus algorithm based on signature authentication for mapped addresses. Background Technology

[0002] Blockchain technology is an advanced database mechanism that allows information to be shared transparently within enterprise networks. A blockchain database stores data in blocks, which are then linked together on a chain. Data is consistent over time because you cannot delete or modify a link in the chain without network consensus. Therefore, you can use blockchain technology to create an immutable ledger to track orders, payments, accounts, and other transactions. Built-in mechanisms prevent unauthorized transaction entries and create consistency across a shared view of these transactions.

[0003] Blockchain technology has the following main functions:

[0004] Decentralization

[0005] Decentralization in blockchain refers to the transfer of control and decision-making power from centralized entities (individuals, organizations, or groups) to a distributed network. Decentralized blockchain networks use transparency to reduce the need for trust among participants. These networks also prevent participants from exerting power or control over each other in ways that weaken network functionality.

[0006] Immutability

[0007] Immutability means that certain content cannot be changed or altered. Once a participant records a transaction in the shared ledger, no other participant can tamper with that transaction. If a transaction record contains an error, you must add a new transaction to correct the error, and both transactions are visible throughout the network.

[0008] consensus

[0009] The blockchain system will establish rules regarding consensus among participants on recording transactions. A new transaction can only be recorded when a majority of participants in the network agree.

[0010] Consensus algorithms can be understood as a series of processes and rules developed to achieve distributed consensus protocols. When nodes distributed in different regions negotiate and interact according to these rules, they can eventually reach a consensus on one or more issues, thus achieving consistency among different nodes in a distributed system. However, various blockchain consensus algorithms on the market still have various problems.

[0011] The IIFT blockchain consensus algorithm, as disclosed in the authorization announcement number CN109903155A, effectively avoids the "rich man rule" problem of POS or DPOS, effectively encourages the enthusiasm of nodes to participate, effectively avoids the risk of chain forks, and greatly reduces network overhead. However, it does not solve the problem that existing blockchain consensus algorithms cannot effectively implement authentication processing of data information accounts and first map the account data information to prevent storage redundancy among nodes. Therefore, we propose a blockchain consensus algorithm based on signature authentication and address mapping. Summary of the Invention

[0012] The purpose of this invention is to provide a blockchain consensus algorithm based on signature authentication and mapped addresses to solve the problems mentioned in the background art.

[0013] To achieve the above objectives, the present invention provides the following technical solution: a blockchain consensus algorithm based on signature authentication for mapped addresses, comprising various block nodes and a server, wherein each block node is interconnected with the others or interconnected with the server.

[0014] Each block node sends data information to the server based on its own account information. When sending data information to the server, each block node first performs calculations on its own data system, encodes and organizes its own account summary information using a hash algorithm, and then uploads the address location of each block node's account information using mapping technology. During the upload, the summary information encoded by the hash algorithm is also carried along. After the data information is transmitted to the server, the server decodes and identifies the data information. Then, the server will activate each block node in the blockchain to obtain and verify the data information.

[0015] The server randomly selects the block node as the authentication block node and appoints the block node that sent the account information as the initiating block node. The server authenticates the account information of the initiating block node by randomly selecting the authentication block node. Specifically, the initiating block node maps its account address information to the server. Then, the server selects the authentication block node. Upon receiving the activation information, the authentication block node performs real-name authentication of both the server and the initiating block node through a signature. After authentication, the authentication block node accesses the initiating block node through the server, carrying its own signature information. This allows for access to the initiating block node's account information via the mapped address, enabling calculation and verification of the account information. During authentication, the authentication block node outputs an authentication result based on its calculation process, including authentication success and authentication failure. The system verifies the account information of the initiating block node based on the authentication results. Specifically, when the number of unqualified authentication entries reaches one-third of the total data of the certified block nodes, the account information of the initiating block node is re-examined to ensure accuracy. After successful authentication, the initiating block node uploads its account information to the server, allowing the server to distribute the information to all block nodes, maintaining consistency in the blockchain. Furthermore, when a certified block node is launched, anomalies are received using a Byzantine fault-tolerant consensus algorithm. This algorithm tolerates no more than one-third of the nodes being abnormal. If more than one-third of the certified block nodes are abnormal, the server cancels the selection of the current certified block node and re-selects one. This process is repeated multiple times until the number of abnormal certified block nodes is less than one-third.

[0016] Preferably, when the initiating block node sends the account information to the server, it generates a digital string for its own information through a signature authentication algorithm. The digital string is also a valid proof of the authenticity of the account information sent by the initiating block node. The digital signature is an alphanumeric string obtained by processing the information to be transmitted through a one-way function to authenticate the source of the information and verify whether the information has changed during the transmission process.

[0017] Preferably, the signature authentication algorithm includes Rabin signature, DSS signature, or RSA signature;

[0018] The calculation process for the RSA signature is as follows:

[0019] Generate signature and verification parameters:

[0020] Step 1: Select two large prime numbers p and q for the initiating block node, and calculate n=pq and Φ(n) = (P-1)(q-1);

[0021] Step 2: Find e and d such that gcd(e, Φ(n)) = 1 and ed ≡ l (mod Φ(n));

[0022] Step 3: Publicly verify the parameters {n, e}, and initiate the block node to store {p, q, d, Φ(n)} as secret signature parameters;

[0023] Step 4: Select a general hash function h();

[0024] Signature Algorithm:

[0025] Step 1: The initiating block node encodes the file m (including recipient, content, signer, date, etc.) to be signed and maps it to h(m);

[0026] Step 2, Calculation

[0027] ,

[0028] Step 3: Set {m, S} A (m)} is sent to file recipient B or arbitrator T (A represents the initiating block node, B represents the file recipient, and T represents the arbitrator);

[0029] Verification algorithm:

[0030] B (or T) test:

[0031] ,

[0032] If the document is valid, accept it and sign it; otherwise, refuse to accept it or declare it invalid.

[0033] Preferably, the signature authentication algorithm is sent and received in the following manner:

[0034] send:

[0035] The initiating block node starts from the first character of message packet M and checks the i-th character of M:

[0036] When the i-th bit of M is 0, take the i-th bit of the key; when the i-th bit of M is 1, take the (i+1)-th bit of the key.

[0037] Once all messages have been checked, the selected n key bits form the final signature.

[0038] take over:

[0039] The recipient verifies the signature, checking message M sequentially starting from the first character;

[0040] When the i-th bit of M is 0, the i-th group of information in the signature is the i-th bit of the key; when the i-th bit of M is 1, the i-th group of information in the signature is the (i+1)-th bit of the key.

[0041] Once all messages have been verified, n keys are obtained. Since the initiating block node sends verification information c, the obtained n keys are used to verify the verification information, thereby confirming whether the message was sent by the initiating block node.

[0042] Preferably, the random selection employs authorization proof, which is an algorithm that predefines the proposed nodes and has minimal randomness because the nodes are pre-authorized and known, bringing many centralized characteristics to the blockchain.

[0043] Preferably, the hash algorithm is:

[0044] Given a string S = s1s2s3s4...sn, let idx(x) = x−′a′+1. Of course, directly using (int)x is also the same.

[0045] This method utilizes the natural overflow of the unsigned long long data structure: that is, when the stored data exceeds the storage range of unsigned long long, it will automatically increment by 2. 64 Therefore, we don't need to use modulo other prime numbers to guarantee uniqueness;

[0046] Hash formula:

[0047] unsigned long long Hash[n];

[0048] hash[i]=hash[i−1]*p+idx(s[i]);

[0049] If the hash value of a string |S|=n is known, hash[i], 1≤i≤n, and the corresponding hash value of its substring s[l...r], 1≤l≤r≤n is:

[0050] hash=(hash[r]−hash[l−1]*p r-l+1 mod2 64 .

[0051] Preferably, the address information mapping is used to generate the account information of the initiating block node by hashing, and then transmit the address information to the server. The server then identifies and analyzes the address information and maps it to the certified block node, so that the certified block node can easily access the account information of the initiating block node.

[0052] Preferably, the Byzantine fault-tolerant consensus algorithm determines that nodes that generate erroneous blocks within a specified time will be identified as malicious nodes, and malicious nodes will be punished by the security committee at the end of the ledger information period; nodes that do not generate blocks within a specified time will be identified as faulty nodes, and faulty nodes will be replaced by ready nodes at the end of the ledger information period.

[0053] Preferably, the Byzantine fault-tolerant consensus algorithm only needs to guarantee the following for faulty nodes:

[0054] ,

[0055] Where f is the number of malicious nodes and k is the total number of nodes in the system, the system can ensure security and vitality under the premise of fault tolerance.

[0056] Preferably, when the server receives the total hash value of the account information sent by the initiating block node, it activates the smart contract for the blockchain signature information. Activating the smart contract first verifies the signature information of each node, and then performs statistical counting on the certified block nodes to facilitate statistical processing of faulty nodes.

[0057] Compared with the prior art, the beneficial effects of the present invention are:

[0058] This invention uses signature authentication to authenticate each node, improving node security and facilitating data transmission. The initiating block node uses mapping technology and hash algorithms to encode and generate a summary of the address and account information. The mapping technology only transmits the account address, reducing transmission time and storage redundancy among other block nodes. The server randomly selects the authentication block node, which also needs to undergo identity authentication before accessing the initiating block node is granted, thus authenticating the account information and improving security. Attached Figure Description

[0059] Figure 1 This is a schematic diagram of the system steps of the present invention. Detailed Implementation

[0060] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0061] Please see Figure 1 The present invention provides a technical solution: a blockchain consensus algorithm based on signature authentication for mapped addresses, including various block nodes and a server, wherein each block node is connected to each other or to the server.

[0062] Each block node sends data information to the server based on its own account information. When sending data information to the server, each block node first performs calculations on its own data system, encodes and organizes its own account summary information using a hash algorithm, and then uploads the address location of each block node's account information using mapping technology. During the upload, the summary information encoded by the hash algorithm is also carried along. After the data information is transmitted to the server, the server decodes and identifies the data information. Then, the server will activate each block node in the blockchain to obtain and verify the data information.

[0063] The server randomly selects the block node as the authentication block node and appoints the block node that sent the account information as the initiating block node. The server authenticates the account information of the initiating block node by randomly selecting the authentication block node. Specifically, the initiating block node maps its account address information to the server. Then, the server selects the authentication block node. Upon receiving the activation information, the authentication block node performs real-name authentication of both the server and the initiating block node through a signature. After authentication, the authentication block node accesses the initiating block node through the server, carrying its own signature information. This allows for access to the initiating block node's account information via the mapped address, enabling calculation and verification of the account information. During authentication, the authentication block node outputs an authentication result based on its calculation process, including authentication success and authentication failure. The system verifies the account information of the initiating block node based on the authentication results. Specifically, when the number of unqualified authentication entries reaches one-third of the total data of the certified block nodes, the account information of the initiating block node is re-examined to ensure accuracy. After successful authentication, the initiating block node uploads its account information to the server, allowing the server to distribute the information to all block nodes, maintaining consistency in the blockchain. Furthermore, when a certified block node is launched, anomalies are received using a Byzantine fault-tolerant consensus algorithm. This algorithm tolerates no more than one-third of the nodes being abnormal. If more than one-third of the certified block nodes are abnormal, the server cancels the selection of the current certified block node and re-selects one. This process is repeated multiple times until the number of abnormal certified block nodes is less than one-third.

[0064] In order to achieve signature authentication of blockchain nodes, in this embodiment, preferably, when the initiating block node sends the account information to the server, it generates a digital string for its own information through a signature authentication algorithm. The digital string is also a valid proof of the authenticity of the account information sent by the initiating block node. The digital signature is an alphanumeric string obtained by processing the information to be transmitted through a one-way function to authenticate the source of the information and verify whether the information has changed during the transmission process.

[0065] In order to perform computational processing on signature authentication, in this embodiment, preferably, the signature authentication algorithm includes Rabin signature, DSS signature, or RSA signature;

[0066] The calculation process for the RSA signature is as follows:

[0067] Generate signature and verification parameters:

[0068] Step 1: Select two large prime numbers p and q for the initiating block node, and calculate n=pq and Φ(n) = (P-1)(q-1);

[0069] Step 2: Find e and d such that gcd(e, Φ(n)) = 1 and ed ≡ l (mod Φ(n));

[0070] Step 3: Publicly verify the parameters {n, e}, and initiate the block node to store {p, q, d, Φ(n)} as secret signature parameters;

[0071] Step 4: Select a general hash function h();

[0072] Signature Algorithm:

[0073] Step 1: The initiating block node encodes the file m (including recipient, content, signer, date, etc.) to be signed and maps it to h(m);

[0074] Step 2, Calculation

[0075] ,

[0076] Step 3: Set {m, S} A (m)} is sent to file recipient B or arbitrator T (A represents the initiating block node, B represents the file recipient, and T represents the arbitrator);

[0077] Verification algorithm:

[0078] B (or T) test:

[0079] ,

[0080] If the document is valid, accept it and sign it; otherwise, refuse to accept it or declare it invalid.

[0081] To enable the sending and receiving of signature authentication algorithms, in this embodiment, the preferred method for sending and receiving the signature authentication algorithms is as follows:

[0082] send:

[0083] The initiating block node starts from the first character of message packet M and checks the i-th character of M:

[0084] When the i-th bit of M is 0, take the i-th bit of the key; when the i-th bit of M is 1, take the (i+1)-th bit of the key.

[0085] Once all messages have been checked, the selected n key bits form the final signature.

[0086] take over:

[0087] The recipient verifies the signature, checking message M sequentially starting from the first character;

[0088] When the i-th bit of M is 0, the i-th group of information in the signature is the i-th bit of the key; when the i-th bit of M is 1, the i-th group of information in the signature is the (i+1)-th bit of the key.

[0089] Once all messages have been verified, n keys are obtained. Since the initiating block node sends verification information c, the obtained n keys are used to verify the verification information, thereby confirming whether the message was sent by the initiating block node.

[0090] In order to achieve random selection of certified block nodes, in this embodiment, preferably, the random selection adopts authorization proof, which is an algorithm that predefines the suggested nodes and has minimal randomness. Because the nodes are pre-authorized and known, it brings many centralized characteristics to the blockchain.

[0091] To enable effective editing of account information, in this embodiment, the preferred method is the hash algorithm:

[0092] Given a string S = s1s2s3s4...sn, let idx(x) = x−′a′+1, and map the letters a and b to 1-26, or directly use the ASCII code value (int)x of the characters;

[0093] This method utilizes the natural overflow of the unsigned long long data structure: that is, when the stored data exceeds the storage range of unsigned long long, it will automatically increment by 2. 64 Therefore, we don't need to use modulo other prime numbers to guarantee uniqueness;

[0094] Hash formula:

[0095] unsigned long long Hash[n];

[0096] hash[i]=hash[i−1]*p+idx(s[i]);

[0097] If the hash value of a string |S|=n is known, hash[i], 1≤i≤n, and the corresponding hash value of its substring s[l...r], 1≤l≤r≤n is:

[0098] hash=(hash[r]−hash[l−1]*p r-l+1 mod2 64 .

[0099] To enable the server to analyze and process address information and facilitate access to account information, in this embodiment, preferably, the address information mapping is used to generate a hash algorithm encoding of the account information of the initiating block node, and then transmit the address information to the server. The server then identifies and analyzes the address information and maps it to the authentication block node, making it easier for the authentication block node to access the account information of the initiating block node.

[0100] In order to perform maintenance on faulty nodes, in this embodiment, preferably, the Byzantine fault-tolerant consensus algorithm determines that nodes that generate erroneous blocks within a specified time will be identified as malicious nodes, and malicious nodes will be punished by the security committee at the end of the ledger information period; nodes that do not generate blocks within a specified time will be identified as faulty nodes, and faulty nodes will be replaced by ready nodes at the end of the ledger information period.

[0101] In order to implement error processing for the Byzantine fault-tolerant consensus algorithm, in this embodiment, preferably, the Byzantine fault-tolerant consensus algorithm only needs to ensure the following error nodes:

[0102] ,

[0103] Where f is the number of malicious nodes and k is the total number of nodes in the system, the system can ensure security and vitality under the premise of fault tolerance.

[0104] In order to authenticate the signature information and facilitate statistical processing of the authenticated block nodes, in this embodiment, preferably, the server activates the smart contract for the blockchain signature information when it receives the total hash value of the account information sent by the initiating block node; the activated smart contract first verifies the signature information of each node, and then performs statistical counting on the authenticated block nodes, which facilitates statistical processing of faulty nodes.

[0105] The working principle and usage process of this invention: Each block node sends data information to the server based on its own account information. When sending data information to the server, each block node first performs calculation processing on its own data system, encodes and organizes its own account summary information through a hash algorithm, and then uploads the address location of each block node's account information through mapping technology. During the upload, the summary information encoded by the hash algorithm is also carried along. After the data information is transmitted to the server, the server decodes and identifies the data information. Then, the server will activate each block node in the blockchain to obtain and verify the data information.

[0106] The server randomly selects block nodes as authentication block nodes and appoints the block node that sends the account information as the initiating block node. The server authenticates the account information of the initiating block node by randomly selecting authentication block nodes. That is, the initiating block node maps the account address information to the server, and then the server selects authentication block nodes. When the authentication block node receives the pull-up information, it performs real-name authentication processing on the server and the initiating block node through signature. After the authentication block node completes the authentication, it accesses the initiating block node through the server with its own signature information to access the account information of the initiating block node according to the mapped address, realizes the calculation processing of the account information of the initiating block node, and realizes the verification of the account information. When the authentication block node performs authentication, it outputs the authentication result according to its own calculation process. The authentication result includes authentication successful and authentication unsuccessful.

[0107] Although embodiments of the invention have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made to these embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the appended claims and their equivalents.

Claims

1. A blockchain consensus algorithm based on signature authentication for mapped addresses, comprising various block nodes and servers, characterized in that: Each of the aforementioned block nodes is either connected to each other or connected to the server. Each block node sends data information to the server based on its own account information. When sending data information to the server, each block node first performs calculations on its own data system, encodes and organizes its own account summary information using a hash algorithm, and then uploads the address location of each block node's account information using mapping technology. During the upload, the summary information encoded by the hash algorithm is also carried along. After the data information is transmitted to the server, the server decodes and identifies the data information. Then, the server will activate each block node in the blockchain to obtain and verify the data information. The server randomly selects the block node as the authentication block node and appoints the block node that sent the account information as the initiating block node. The server authenticates the account information of the initiating block node by randomly selecting the authentication block node; that is, the initiating block node maps its account address information to the server. Then, the server selects the authentication block node, and when the authentication block node receives the activation information, it performs real-name authentication of both the server and the initiating block node through a signature. After authentication, the authentication block node accesses the initiating block node through the server, carrying its own signature information, to access the initiating block node's account information via the mapped address. This allows for calculation and verification of the account information. During authentication, the authentication block node outputs an authentication result based on its calculation process, including authentication successful and authentication unsuccessful. The authentication process is as follows: The initiating block node's account information is verified based on the authentication results. Specifically, if the number of unqualified authentication entries reaches one-third of the total data of the authenticated block nodes, the initiating block node's account information is re-examined to ensure accuracy. After successful authentication, the initiating block node uploads its account information to the server, allowing the server to distribute it to all block nodes, maintaining consistency in the blockchain. Furthermore, when an authenticated block node is launched, anomalies are received using a Byzantine fault-tolerant consensus algorithm. This algorithm tolerates no more than one-third of the nodes being abnormal. If more than one-third of the authenticated block nodes are abnormal, the server cancels the selection of the current authenticated block node and begins a new selection process. This process is repeated multiple times until the number of abnormal entries in the selected authenticated block nodes is less than one-third.

2. The blockchain consensus algorithm based on signature authentication and mapped addresses according to claim 1, characterized in that: When the initiating block node sends the account information to the server, it generates a digital string for its own information through a signature authentication algorithm. The digital string is also a valid proof of the authenticity of the account information sent by the initiating block node. The digital signature is an alphanumeric string obtained by processing the information to be transmitted through a one-way function to authenticate the source of the information and verify whether the information has changed during the transmission process.

3. The blockchain consensus algorithm based on signature authentication mapping address according to claim 2, characterized in that: The signature authentication algorithm includes Rabin signature, DSS signature, or RSA signature; The calculation process for the RSA signature is as follows: Generate signature and verification parameters: Step 1: Select two large prime numbers p and q for the initiating block node, and calculate n = pq and Φ(n) = (p-1)(q-1); Step 2: Find e and d such that gcd(e, Φ(n)) = 1 and ed ≡ 1 (mod Φ(n)); Step 3: Publicly verify the parameters {n, e}, and initiate the block node to store {p, q, d, Φ(n)} as secret signature parameters; Step 4: Select a general hash function h(); Signature Algorithm: Step 1: The initiating block node encodes the file m to be signed, including the recipient, content, signer, and date, and maps it to h(m). Step 2, Calculation ， Step 3: Set {m, S} A (m)} is sent to file recipient B or arbitrator T, where A represents the initiating block node, B represents the file recipient, and T represents the arbitrator; Verification algorithm: B or T test: ， If the document is valid, accept it and sign it; otherwise, refuse to accept it or declare it invalid.

4. The blockchain consensus algorithm based on signature authentication and mapped addresses according to claim 3, characterized in that: The signature authentication algorithm is sent and received in the following ways: send: The initiating block node starts from the first character of message packet M and checks the i-th character of M: When the i-th bit of M is 0, take the i-th bit of the key; when the i-th bit of M is 1, take the (i+1)-th bit of the key. Once all messages have been checked, the selected n key bits form the final signature. take over: The recipient verifies the signature, checking message M sequentially starting from the first character; When the i-th bit of M is 0, the i-th group of information in the signature is the i-th bit of the key; when the i-th bit of M is 1, the i-th group of information in the signature is the (i+1)-th bit of the key. Once all messages have been verified, n keys are obtained. Since the initiating block node sends verification information c, the obtained n keys are used to verify the verification information, thereby confirming whether the message was sent by the initiating block node.

5. The blockchain consensus algorithm based on signature authentication mapping address according to claim 1, characterized in that: The random selection employs authorization proof, which is an algorithm that predefines the proposed nodes and has minimal randomness because the nodes are pre-authorized and known, bringing many centralized characteristics to the blockchain.

6. The blockchain consensus algorithm based on signature authentication mapping address according to claim 1, characterized in that: The hash algorithm: Given a string S = s1s2s3s4...sn, let idx(x) = x−′a′+1. Of course, directly using (int)x is also the same. This method utilizes the natural overflow of the unsigned long long data structure: that is, when the stored data exceeds the storage range of unsigned long long, it will automatically increment by 2. 64 Therefore, we don't need to use modulo other prime numbers to guarantee uniqueness; Hash formula: unsigned long long Hash[n]; hash[i]=hash[i−1]*p+idx(s[i]); If the hash value of a string |S|=n is known, hash[i], 1≤i≤n, and the corresponding hash value of its substring s[l...r], 1≤l≤r≤n is: hash=(hash[r]−hash[l−1]∗p r-l+1 )mod2 64 。 7. The blockchain consensus algorithm based on signature authentication and mapped addresses according to claim 1, characterized in that: The address information mapping is used to generate the account information of the initiating block node by hashing, and then transmit the address information to the server. The server then identifies and analyzes the address information and maps it to the certified block node, so that the certified block node can easily access the account information of the initiating block node.

8. The blockchain consensus algorithm based on signature authentication for mapped addresses according to claim 1, characterized in that: The Byzantine fault-tolerant consensus algorithm states that nodes that generate erroneous blocks within a specified time will be identified as malicious nodes, and malicious nodes will be punished by the security committee at the end of the ledger information cycle. Block nodes that fail to produce blocks within the specified time will be identified as faulty nodes, and faulty nodes will be replaced by ready nodes at the end of the accounting information cycle.

9. A blockchain consensus algorithm based on signature authentication for mapped addresses according to claim 1, characterized in that: The Byzantine fault-tolerant consensus algorithm only needs to guarantee the following for faulty nodes: ， Where f is the number of malicious nodes and k is the total number of nodes in the system, the system can ensure security and vitality under the premise of fault tolerance.

10. A blockchain consensus algorithm based on signature authentication for mapped addresses according to claim 1, characterized in that: When the server receives the total hash value of the account information sent by the initiating block node, it activates the smart contract for the blockchain signature information. Activating the smart contract first verifies the signature information of each node, and then performs statistical counting on the certified block nodes to facilitate statistical processing of faulty nodes.

Images