WO2022027531A1

WO2022027531A1 - Blockchain construction method and system, and storage medium, computer device and application

Info

Publication number: WO2022027531A1
Application number: PCT/CN2020/107592
Authority: WO
Inventors: 李兴华; 王运帷; 李小强; 胡中元; 任彦冰; 王航
Original assignee: 西安电子科技大学
Priority date: 2020-08-03
Filing date: 2020-08-07
Publication date: 2022-02-10
Also published as: CN112118124A; CN112118124B

Abstract

A blockchain construction method and system, and a storage medium, a computer device and an application. The method comprises: at the beginning of blockchain establishment, dividing a network into Q domains, specifying one leader node for each domain to participate in blockchain consensus, and the remaining nodes in the domain passively synchronizing a block on which consensus is achieved by the leader node (S101); and on the basis of a Raft consensus protocol of a verifiable random function, while generating a new block in each round, an accounting node of the present round randomly selecting an accounting node of the next round (S102). In the consensus process, the accounting of the next round is not generated by means of competition (such as a classic Pow consensus mechanism), but is randomly generated by an accounting node of the previous round and is publicly verifiable, so that the efficiency and security of consensus are improved. An accounting node of each round dynamically changes and has identity information hidden, so that the accounting node is prevented from being maliciously attacked, and the security and robustness of a blockchain system are ensured.

Description

Blockchain construction method, system, storage medium, computer equipment and application

technical field

The invention belongs to the technical field of blockchain application, and in particular relates to a blockchain construction method, system, storage medium, computer equipment and application.

Background technique

At present, blockchain is a new decentralized infrastructure and distributed computing paradigm that has gradually emerged with the increasing popularity of digital cryptocurrencies such as Bitcoin. of great attention and widespread concern. Although there are various blockchains, they still cannot meet the needs of enterprise business systems. Specifically, the consensus protocol is the core of the blockchain database. The existing consensus protocols are mainly divided into two categories: one is the consensus protocol in the public environment, such as POW represented by the Bitcoin blockchain and Ethereum represented by POS, they use the competitive mining resistance mechanism to realize the selection of accounting nodes in an untrusted public network environment. However, its consensus efficiency is poor, and it is difficult to meet high real-time and high concurrent data processing services. The other type is consensus protocols in private environments, such as PBFT and Raft, whose core idea is to use a rotating or voting mechanism to achieve the alternation of accounting nodes in a fully trusted environment. Compared with the consensus in the public network environment, although they significantly improve the consensus efficiency, because the billing node of each round will be disclosed in advance, it is easy to be attacked in a non-completely trusted environment, resulting in block generation failure.

To sum up, the existing blockchain consensus protocols are difficult to take into account performance and security, and cannot meet the needs of efficient and secure real-world scenarios. Or provide efficient consensus among fully trusted nodes. However, in the enterprise internal network where the nodes are relatively credible, there is a lack of a consensus protocol that takes both performance and security into consideration. In existing blockchains, the above-mentioned consensus protocols have high computational energy consumption, low consensus efficiency, and poor robustness and security.

Through the above analysis, the problems and defects of the existing technology are: the current blockchain has a consensus protocol that consumes a lot of energy for calculation, low consensus efficiency, and poor robustness and security.

The difficulty of solving the above problems and defects is as follows: From the above analysis, it can be seen that the main defect of the existing consensus protocol is that it is difficult to balance security and efficiency. It is worth noting that compared with the public chain, the performance of the consensus protocol in the private environment is improved by an order of magnitude, which is closer to the goal of the present invention. However, the existing private chain consensus itself has weak security and is too dependent on the external environment, that is, it needs to be deployed in a completely secure environment, which is difficult to fully satisfy in reality. Therefore, the present invention needs to improve the security of the consensus protocol in the existing private environment, and the key difficulty lies in how to protect its identity while determining a new round of bookkeeping master nodes, and avoid being locked in advance by malicious attacks for damage.

The significance of solving the above problems and defects is: using verifiable random functions to enhance the security of the private environment Raft consensus protocol, while retaining its high efficiency characteristics, it also takes into account security considerations. It realizes the efficient and safe selection of accounting nodes of distributed database system in an incomplete trusted environment, and can well provide support for real blockchain business scenarios.

SUMMARY OF THE INVENTION

In view of the problems existing in the prior art, the present invention provides a blockchain construction method, system, storage medium, computer equipment and application.

The present invention is implemented in this way, a method for constructing a blockchain, the method for constructing a blockchain includes:

The initial configuration of the blockchain. At the beginning of the establishment of the blockchain, CA first divides the network into Q domains, and assigns a leader node to each domain to participate in the construction of the blockchain. When a node joins the blockchain network , register the identity information at the CA; when a node exits, the CA also needs to cancel its identity information;

Based on the Raft consensus protocol based on verifiable random function, when a new block is generated in each round, the billing node of the round randomly selects the billing node of the next round.

Further, the initial configuration of the blockchain construction method specifically includes the following steps:

Step 1: At the beginning of the establishment of the blockchain, the CA first divides the network into Q domains, and assigns a leader node to participate in the consensus for each domain to participate in the consensus of the blockchain system;

Step 2, generate a genesis block, namely Block ₀ ;

Step 3: When a node joins the blockchain network, firstly register the identity information at the CA and obtain the issued public key certificate as the admission certificate for its participation in the blockchain network; at the same time, it is necessary to specify the domain to which the joining node belongs. ;

Step 4: When a node exits, the CA also needs to revoke its public key certificate.

Further, in the step 1, the CA first divides the network into Q domains, and assigns a leader node for each domain whose number is from 1 to Q, as follows:

(1) CA assigns each node in the network to different domains;

(2) Each domain selects a master node to communicate with other master nodes in the blockchain network.

Further, the generation of the creation block in the step 2 specifically includes:

(1) The hash R_Hash of the previous blockchain, this field is initially empty in Block ₀ ;

(2) The number Num of the current block, in Block ₀ , the field is initially number 0;

(3) Initialize the Tamp field in Block ₀ , and fill the current timestamp s into the Tamp field;

(4) The public key certificate Cu_Cert of the accounting node in this round, in Block ₀ , this field is the public key certificate of the CA;

(5) The information Pr_P of the accounting node in this round, this field is initialized to be empty in Block ₀ ;

(6) Store the CA's public key certificate Cert ₀ and the initial Q node certificates Cert_1...Cert_Q participating in the blockchain consensus into the block body;

(7) Calculate the hash root P_Hash, and fill the hash root P_Hash of the Block ₀ block body with the hash value of the current calculation;

(8) The secret information Nx_P* of the accounting node in the next round, in Block ₀ , this field is filled with the default value generated by the CA, that is, the information of the next packing node;

(9) The signature Sig of this round of bookkeeping nodes to the entire block information, in Block ₀ , this field is the CA's signature to the entire block information;

(10) Generate an initial block Block ₀ .

Further, the Raft efficient and secure consensus protocol based on a verifiable random function includes the following steps:

Step 1, the node decrypts the Nx_P* field of the block, obtains the information proving the packaging node of this round, and determines whether it is a packaging node;

Step 2, randomly select the next round of billing node j, and the block generated by node i is Block _n ;

Step 3, start to generate block Block _n , node i broadcasts the generated new block Block _n to the rest of the nodes, and then he waits for feedback from other nodes, only if it receives more than one-third of the number of consensus nodes in the entire blockchain network The second is to write the block into the local blockchain;

In step 4, other nodes verify the block Block _n . After the verification is passed, each master node redistributes the verified block Block _n to each non-participating consensus node in its management domain.

Further, randomly selecting the billing node j of the next round in the second step includes the following steps:

(1) Execute the key generation function Key_Gen: (Sk, Pk)=Key_Gen(r). For any random input, generate the VRF private key Sk and the public key Pk corresponding to the private key Sk;

(2) VRF calculation function VRF_Hash: Y=VRF_Hash(Sk, M), for the input message M, the VRF prover uses its private key Sk to calculate the VRF hash as the output random number Y;

(3) VRF proof function VRF_Proof: P=VRF_Proof(Sk, M). For the input message M and the private key Sk, the prover calculates the VRF proof P;

(4) Hash mapping the random number Y to calculate the next packing node j;

In the third step, the block Block _n is generated, and the node i broadcasts the generated new block Block _n to the rest of the nodes, and then he waits for feedback from other nodes, and only receives more than one-third of the number of consensus nodes in the entire blockchain network. The second is to write the block to the local blockchain, including the following steps:

(1) Obtain Y _n-1 and P _n-1 , Mn _-1 , Pk _n- _{1 in the Nx_P* field in Block n-} 1 and fill in the Pr_P field of Block _n ;

(2) Fill in the Cu_Cert field in the Block _n block header with own public key certificate Cert_i;

(3) Encrypt the calculated Y, P, M, and Pk with the public key of the next packing node and fill in the Nx_P* field in the Block _n block header;

(4) Write the transaction information into the block body, calculate the current hash value P_Hash, and fill in the P_Hash field in the block Block _n ;

(5) Calculate the signature message Sig=Sign(SK _i ,H(P_Hash||Num||Tamp||Cu_Cert||Pr_P||R_Hash||Nx_P ^* )), where Sign(.) represents the signature algorithm, fill in the area sig field in block Block _n . P_Hash is the hash value of the current block, R_Hash is the hash value of the previous block, Tamp refers to the current timestamp, and Num refers to the current block height;

(6) Generate block Block _n , node i broadcasts the generated new block Block _n to the rest of the nodes, and then he waits for feedback from other nodes, only if it receives more than two-thirds of the number of consensus nodes in the entire blockchain network Only write the block to the local blockchain;

In the fourth step, other nodes verify the block Block _n , and each master node redistributes the verified block Block _n to each non-consensus node in its management domain, including the following steps:

(1) The node receiving Block _n first verifies the hash chain relationship before and after, and then verifies whether the signature field Sig in the block header is established;

(2) After the verification is passed, the node extracts the values Y, P, M, Pk in the Pr_P field in the received block Block _n ;

(3) The node runs the VRF verification function VRF_Verify: True/False=VRF_Verify(Pk,M,Y,P), the verifier inputs the VRF prover's public key Pk, the message M, and the VRF output random value Y and the proof P are performed verify. The output is False/True. If it is proved that P is generated according to M and Y can be deduced by P, then the verification passes and the output is True; otherwise, the verification fails and the output is False, and it is verified whether Y can be mapped to the current packaging node. If it can be mapped to, the verification is passed. , otherwise the verification fails;

(4) After the verification is passed, the master node writes the block into the local blockchain, and each master node redistributes the verified block Block _n to each non-participating consensus node in its management domain. The current packaging node feeds back an acceptance message;

Another object of the present invention is to provide a computer device, the computer device includes a memory and a processor, the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the following step:

Based on the Raft consensus protocol based on verifiable random function, when a new block is generated in each round, the billing node of this round randomly selects the billing node of the next round.

Another object of the present invention is to provide a computer-readable storage medium, which stores a computer program, and when the computer program is executed by a processor, causes the processor to perform the following steps:

Another object of the present invention is to provide a blockchain construction system for implementing the blockchain construction method, the blockchain construction system comprising:

The initial configuration module of the blockchain is used to divide the network into Q domains at the beginning of the establishment of the blockchain. Each domain designates a leader node to participate in the blockchain consensus, and the remaining nodes in the domain passively synchronize the blocks after the leader node consensus. ;

The Raft consensus protocol building block is used for the Raft consensus protocol based on a verifiable random function: when a new block is generated in each round, the billing node of the round randomly selects the billing node of the next round.

Another object of the present invention is to provide a blockchain system equipped with the blockchain construction system.

Combining all the above technical solutions, the advantages and positive effects of the present invention are: at the beginning of the establishment of the blockchain, the CA first divides the network into Q domains, and assigns a leader node for each domain to participate in the area. Blockchain consensus. When a node joins the blockchain network, the identity information is first registered at the CA. When a node exits, the CA also needs to revoke its identity information. In the consensus process, by using a verifiable random function, while generating a new block in each round, the billing node of the round randomly selects the billing node of the next round. It realizes the efficient and safe selection of blockchain accounting nodes in an incompletely trusted environment.

The consensus method of the present invention:

(1) The proposed consensus protocol, in the process of random determination of accounting nodes, uses public key encryption to select the identity information of the next round of consensus nodes, which ensures that the confidentiality of the identity of the next round of consensus nodes is avoided from being destroyed in advance, and improves the Security and robustness of consensus protocols. It avoids the problem that the identity of the accounting node based on the sequential rotation mechanism (such as PBFT) and the voting mechanism (such as Raft) consensus protocol is open and vulnerable.

(2) The proposed consensus method uses a verifiable random function to randomly determine the billing node selection process, which ensures that the next round of billing is not generated by competition, but randomly generated and disclosed by the previous round of billing nodes. Verifiable, thus avoiding the problems of high energy consumption and low consensus efficiency in consensus protocols based on competitive accounting mechanisms (such as classic PoW, PoS consensus mechanisms).

The present invention applies the verifiable random function to the blockchain, and realizes that the security and efficiency problems brought by the Raft consensus of the traditional blockchain can be solved with the minimum performance overhead between incompletely trusted nodes. The invention improves the traditional Raft consensus protocol by using a verifiable random function, realizes the efficient and safe selection of billing nodes in the blockchain system in an incompletely trusted environment, and satisfies the need for massive users and high concurrent services to the blockchain system data. Efficient and secure synchronization requirements.

Description of drawings

In order to explain the technical solutions of the embodiments of the present application more clearly, the following will briefly introduce the drawings that need to be used in the embodiments of the present application. Obviously, the drawings described below are only some embodiments of the present application. For those of ordinary skill in the art, other drawings can also be obtained from these drawings without creative effort.

FIG. 1 is a flowchart of a blockchain construction method provided by an embodiment of the present invention.

2 is a schematic structural diagram of a blockchain construction system provided by an embodiment of the present invention;

In Figure 2: 1. The initial configuration module of the blockchain; 2. The building module of the Raft consensus protocol.

FIG. 3 is an overall architecture diagram of an implementation provided by an embodiment of the present invention.

FIG. 4 is a diagram of a Raft consensus protocol based on a verifiable random function implemented by an embodiment of the present invention.

FIG. 5 is a structural diagram of a founding block of an implementation provided by an embodiment of the present invention.

FIG. 6 is a block chain data structure diagram of an implementation provided by an embodiment of the present invention.

FIG. 7 is a sub-flow chart of blockchain initialization provided by an embodiment of the present invention.

FIG. 8 is a sub-flow chart of constructing a Raft efficient and secure consensus protocol based on a verifiable random function provided by an embodiment of the present invention.

FIG. 9 is a schematic diagram of the relationship between concurrency and time provided by an embodiment of the present invention.

FIG. 10 is a schematic diagram of the relationship between the number of nodes and time according to an embodiment of the present invention.

detailed description

In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention, but not to limit the present invention.

In view of the problems existing in the prior art, the present invention provides a method, system, storage medium, computer equipment and application for building a blockchain. The present invention is described in detail below with reference to the accompanying drawings.

As shown in Figure 1, the blockchain construction method provided by the present invention includes the following steps:

An efficient and secure blockchain construction method based on a verifiable random function and Raft according to an embodiment of the present invention includes the following steps:

S101: At the beginning of the establishment of the blockchain, the network is divided into Q domains, each domain designates a leader node to participate in the blockchain consensus, and the remaining nodes in the domain passively synchronize the blocks after the leader node consensus;

S102: Raft consensus protocol based on a verifiable random function: while generating a new block in each round, the billing node of the round randomly selects the billing node of the next round.

Those skilled in the art of the blockchain construction method provided by the present invention may also implement other steps. The blockchain construction method provided by the present invention in FIG. 1 is only a specific example.

As shown in Figure 2, the blockchain construction system provided by the present invention includes:

Blockchain initial configuration module 1 is used to divide the network into Q domains at the beginning of the establishment of the blockchain, each domain designates a leader node to participate in the blockchain consensus, and the remaining nodes in the domain passively synchronize the area after the leader node consensus piece.

Raft consensus protocol building module 2 is used for Raft consensus protocol based on verifiable random function: while generating a new block in each round, the billing node of this round randomly selects the billing node of the next round.

The technical solutions of the present invention will be further described below with reference to the accompanying drawings.

As shown in Figure 7, the steps of the initial configuration of the blockchain of the present invention are as follows:

Step 1, CA divides the network into Q domains;

CA assigns each node in the network to different domains, respectively labeled 1 to Q. Each domain selects a master node for communicating with other master nodes in the blockchain network to reach a consensus. The labels of each master node are also 1 to Q, and each master node registers its identity at the CA;

Step 2, generate a genesis block (ie Block ₀ );

The structure of the founding block is shown in Figure 6: R_Hash represents the hash of the previous block, and this field is initially empty in Block ₀ . Num represents the number of the current block. In Block ₀ , this field is initially numbered 0. The Tamp field represents a timestamp, and in Block ₀ , the Tamp field is initially the current timestamp. Cu_Cert represents the public key certificate of the accounting node in this round. In Block ₀ , this field is the public key certificate of the CA. The Pr_P field represents the information of the current round of billing nodes, which is initialized to be empty in Block ₀ ; P_Hash represents the hash root of the block body, which is filled with the currently calculated hash value in Block ₀ ; Nx_P* represents the next The information of the round accounting node. In Block ₀ , this field is filled with the default value generated by the CA, that is, the information of the next packaging node; Sig represents the signature of the entire block information by the accounting node in this round. In Block ₀ , this field is The CA's signature for the entire block information. Store the CA's public key certificate Cert ₀ and the initial Q node certificates Cert_1...Cert_Q participating in the blockchain consensus into the block body;

Step 3, when a new node joins the blockchain network, register the identity information at the CA;

Step 4: When a node exits, the CA also needs to revoke its identity information;

As shown in Figure 6, the present invention constructs a Raft efficient and secure consensus protocol based on a verifiable random function as follows:

Step 1, the node decrypts the Nx_P* field of the block, and obtains the information that proves the packaging node of this round;

Step 2, determine whether you are a packaged node, if so, go to Step 3;

Step 3, and randomly select the accounting node j of the next round, if the block generated by node i is Block _n ;

3a) Billing node i in the nth round of consensus will use the following three functions in the verifiable random function:

(1) Key generation function Key_Gen: (Sk, Pk)=Key_Gen(r). For any random input, the VRF private key Sk and the public key Pk corresponding to the private key Sk are generated. In the VRF based on the RSA public key algorithm, a pair of RSA public and private key pairs are generated; in the VRF based on elliptic curve cryptography, a pair of elliptic curve public and private key pairs are generated.

(2) VRF calculation function VRF_Hash: Y=VRF_Hash(Sk, M). For the input message M, the VRF prover uses its private key Sk to calculate the VRF hash as the output random number Y. Since the ideal hash function value range is discrete, given different inputs, the output of the hash function is randomly distributed in the range of the value range. The hash method is used in the VRF calculation process, and the calculated value is random.

(3) VRF proof function VRF_Proof: P=VRF_Proof(Sk, M). For the input message M and the private key Sk, the prover calculates the VRF proof P, and outputs the input data M and VRF Y, and the public key Pk of the VRF prover , the VRF proof P is sent to the verifier.

to generate public and private keys and random numbers. Here, a data shared in the network (using the current height n-1 of the blockchain) and its own private key Sk _i are used as input to calculate the output random number Y _n =VRF_Hash(Sk _i , n-1) and Proof of VRF P _n =VRF_Proof(Sk _i , n-1);

3b) Calculate the accounting node number t=Y _n %Q for n+1 rounds of consensus, and generate a random number Y _n to prove that P _n and the next round of accounting node number t are respectively the public key PK _{t of node t} Encryption yields _Yn ^* =Enc( _Yn , _PKt ), _Pn ^* =Enc( _Pn ,PKt), _t ^* =Enc( _t ,PKt). where Enc(.) represents the public key encryption algorithm, and Q is the number of consensus nodes;

Step 4, the consensus node i of the current round of bookkeeping collects the transaction information generated by each consensus node in the current period of time, and starts to generate the block Block _n ;

Node i first obtains Y _n-1 and P _n-1 , t, P _k in the Nx_P* field in the block header of Block _n-1 , and then converts Y _n-1 and P _n-1 , t, P _k Fill in the Pr_P field of Block _n . Then it fills its own public key certificate Cert_i into the field Cu_Cert in the block header of Block _n , and B fills the calculated Y _n ^* , P _n ^* , t ^* , and P _k into the Nx_P* field in the block _n block header. Then use the Merkle tree to calculate the value of P_Hash. Finally calculate the signature message Sig=Sign(SK _i , H(P_Hash||Num||Tamp||Cu_Cert||Pr_P||R_Hash||Nx_P ^* )), wherein Sign(.) represents the signature algorithm;

Step 5: Node i broadcasts the generated new block Block _n to the remaining Q-1 nodes, and then waits for feedback from other nodes, counts the number of received nodes, and only receives more than the consensus in the entire blockchain network. Only two-thirds of the number of nodes write blocks into the local blockchain;

Step 6: Receive other nodes of Block _n , verify the hash chain relationship before and after, and then verify whether the signature field Sig in the block header is valid to ensure the integrity of the block;

Step 7: Obtain Y _n-1 and P _n-1 , t, P _k in the Pr_P field in the block header of Block _n , and verify the authenticity of the identity information;

Calculate whether t is equal to Y _n-1 %Q, and if so, run the verification function VRF_Verify in the verifiable random function: True/False=VRF_Verify(P _k , n-1, Y _n-1 , P _n-1 ), The verifier inputs the public key P _k of the VRF prover, the message n-1, and the random value Y _n-1 and the proof P _n-1 output by the VRF for verification. The output is False/True. If it is proved that P _n-1 is generated according to n-1 and Y _n- _{1 can be deduced from P n-} 1, the output is True if the verification passes, otherwise the verification fails and the output is False;

Step 8: If all the verifications pass, the node sends an acceptance message true to the current packaging node, otherwise it sends a non-acceptance message false and writes the block Block _n to the local blockchain.

The invention proposes an efficient and secure blockchain construction method based on verifiable random function and Raft. By combining the verifiable random function and Raft consensus protocol, an efficient and secure blockchain system accounting node is constructed in an incompletely trusted environment. The security selection mechanism solves the problem that the security and efficiency of the traditional blockchain consensus protocol are difficult to balance.

Proof part (specific examples/experiments/simulations/positive experimental data that can prove the inventiveness of the present invention, etc.)

Table 1 Comparison of different consensus mechanisms

The present invention compares the consensus protocol with the traditional classical consensus as shown in Table 1. The consensus protocol of the present invention realizes an efficient and safe selection mechanism for the accounting nodes of the blockchain system in an incompletely trusted environment, and solves the problem that the security and efficiency of the traditional blockchain consensus protocol are difficult to balance.

In the experiment that concurrency affects performance, we deployed three virtual machines (8 cores and 8G) on the server to test the insertion of 20,000 pieces of data, and tested the relationship between concurrency and time. Basically, write performance is affected by concurrency. The effect is negligible, as shown in Figure 9.

In the experiment that the number of nodes affects performance, we deployed three virtual machines (8 cores 8G), six virtual machines (8 cores 8G), nine virtual machines (8 cores 8G), and twelve virtual machines on the server. The test of inserting 20,000 pieces of data was carried out on fifteen virtual machines (8 cores and 8G) and fifteen virtual machines (8 cores and 8G) respectively, and the relationship between the number of nodes and time was tested. As shown in Figure 10.

In the description of the present invention, unless otherwise stated, "plurality" means two or more; the terms "upper", "lower", "left", "right", "inner", "outer" The orientation or positional relationship indicated by , "front end", "rear end", "head", "tail", etc. are based on the orientation or positional relationship shown in the accompanying drawings, and are only for the convenience of describing the present invention and simplifying the description, not An indication or implication that the referred device or element must have a particular orientation, be constructed and operate in a particular orientation, is not to be construed as a limitation of the invention. Furthermore, the terms "first," "second," "third," etc. are used for descriptive purposes only and should not be construed to indicate or imply relative importance.

It should be noted that the embodiments of the present invention may be implemented by hardware, software, or a combination of software and hardware. The hardware portion may be implemented using special purpose logic; the software portion may be stored in memory and executed by a suitable instruction execution system, such as a microprocessor or specially designed hardware. Those of ordinary skill in the art will appreciate that the apparatus and methods described above may be implemented using computer-executable instructions and/or embodied in processor control code, for example on a carrier medium such as a disk, CD or DVD-ROM, such as a read-only memory Such code is provided on a programmable memory (firmware) or a data carrier such as an optical or electronic signal carrier. The device of the present invention and its modules can be implemented by hardware circuits such as very large scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, etc., or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., It can also be implemented by software executed by various types of processors, or by a combination of the above-mentioned hardware circuits and software, such as firmware.

The above are only specific embodiments of the present invention, but the protection scope of the present invention is not limited to this. Any person skilled in the art is within the technical scope disclosed by the present invention, and all within the spirit and principle of the present invention Any modifications, equivalent replacements and improvements made within the scope of the present invention should be included within the protection scope of the present invention.

Claims

A blockchain construction method, characterized in that the blockchain construction method comprises:

The initial configuration of the blockchain. At the beginning of the establishment of the blockchain, CA first divides the network into Q domains, and assigns a leader node to each domain to participate in the construction of the blockchain. When a node joins the blockchain network , register the identity information at the CA; when a node exits, the CA also needs to cancel its identity information;

Based on the Raft consensus protocol based on verifiable random function, when a new block is generated in each round, the billing node of the round randomly selects the billing node of the next round.
The blockchain construction method according to claim 1, wherein the initial configuration of the blockchain construction method specifically comprises the following steps:

Step 1: At the beginning of the establishment of the blockchain, the CA first divides the network into Q domains, and assigns a leader node to participate in the consensus for each domain to participate in the consensus of the blockchain system;

Step 2, generate a genesis block, namely Block 0 ;

Step 3: When a node joins the blockchain network, firstly register the identity information at the CA and obtain the issued public key certificate as the admission certificate for its participation in the blockchain network; at the same time, it is necessary to specify the domain to which the joining node belongs. ;

Step 4: When a node exits, the CA also needs to revoke its public key certificate.
The blockchain construction method according to claim 2, wherein in step 1, the CA first divides the network into Q domains, and assigns a leader node for each domain whose number is from 1 to Q, as follows Steps to proceed:

(1) CA assigns each node in the network to different domains;

(2) Each domain selects a master node to communicate with other master nodes in the blockchain network.
The method for constructing a blockchain according to claim 2, wherein generating the genesis block in the step 2 specifically includes:

(1) The hash R_Hash of the previous blockchain, this field is initially empty in Block 0 ;

(2) The number Num of the current block, in Block 0 , the field is initially number 0;

(3) Initialize the Tamp field in Block 0 , and fill the current timestamp s into the Tamp field;

(4) The public key certificate Cu_Cert of the accounting node in this round, in Block 0 , this field is the public key certificate of the CA;

(5) The information Pr_P of the accounting node in this round, this field is initialized to be empty in Block 0 ;

(6) Store the CA's public key certificate Cert 0 and the initial Q node certificates Cert_1...Cert_Q participating in the blockchain consensus into the block body;

(7) Calculate the hash root P_Hash, and fill the hash root P_Hash of the Block 0 block body with the hash value of the current calculation;

(8) The secret information Nx_P* of the accounting node in the next round, in Block 0 , this field is filled with the default value generated by the CA, that is, the information of the next packing node;

(9) The signature Sig of this round of bookkeeping nodes to the entire block information, in Block 0 , this field is the CA's signature to the entire block information;

(10) Generate an initial block Block 0 .
The blockchain construction method according to claim 1, wherein the Raft efficient and secure consensus protocol based on a verifiable random function comprises the following steps:

Step 1, the node decrypts the Nx_P* field of the block, obtains the information proving the packaging node of this round, and determines whether it is a packaging node;

Step 2, randomly select the next round of billing node j, and the block generated by node i is Block n ;

Step 3, start to generate block Block n , node i broadcasts the generated new block Block n to the rest of the nodes, and then he waits for feedback from other nodes, only if it receives more than one-third of the number of consensus nodes in the entire blockchain network The second is to write the block into the local blockchain;

In step 4, other nodes verify the block Block n . After the verification is passed, each master node redistributes the verified block Block n to each non-participating consensus node in its management domain.
The blockchain construction method according to claim 5, wherein in the step 2, randomly selecting the accounting node j of the next round comprises the following steps:

(1) Execute the key generation function Key_Gen: (Sk, Pk)=Key_Gen(r). For any random input, generate the VRF private key Sk and the public key Pk corresponding to the private key Sk;

(2) VRF calculation function VRF_Hash: Y=VRF_Hash(Sk, M), for the input message M, the VRF prover uses its private key Sk to calculate the VRF hash as the output random number Y;

(3) VRF proof function VRF_Proof: P=VRF_Proof(Sk, M). For the input message M and the private key Sk, the prover calculates the VRF proof P;

(4) Hash mapping the random number Y to calculate the next packing node j;

In the third step, the block Block n is generated, and the node i broadcasts the generated new block Block n to the rest of the nodes, and then he waits for feedback from other nodes, and only receives more than one-third of the number of consensus nodes in the entire blockchain network. The second is to write the block to the local blockchain, including the following steps:

(1) Obtain Y n-1 and P n-1 , Mn -1 , Pk n- 1 in the Nx_P* field in Block n- 1 and fill in the Pr_P field of Block n ;

(2) Fill in the Cu_Cert field in the Block n block header with own public key certificate Cert_i;

(3) Encrypt the calculated Y, P, M, and Pk with the public key of the next packing node and fill in the Nx_P* field in the Block n block header;

(4) Write the transaction information into the block body, calculate the current hash value P_Hash, and fill in the P_Hash field in the block Block n ;

(5) Calculate the signature message Sig=Sign(SK i ,H(P_Hash||Num||Tamp||Cu_Cert||Pr_P||R_Hash||Nx_P * )), where Sign(.) represents the signature algorithm, fill in the area In the sig field of Block n , P_Hash is the hash value of the current block, R_Hash is the hash value of the previous block, Tamp refers to the current timestamp, and Num refers to the current block height;

(6) Generate block Block n , node i broadcasts the generated new block Block n to the rest of the nodes, and then he waits for feedback from other nodes, only if it receives more than two-thirds of the number of consensus nodes in the entire blockchain network Only write the block to the local blockchain;

In the fourth step, other nodes verify the block Block n , and each master node redistributes the verified block Block n to each non-consensus node in its management domain, including the following steps:

(1) The node receiving Block n first verifies the hash chain relationship before and after, and then verifies whether the signature field Sig in the block header is established;

(2) After the verification is passed, the node extracts the values Y, P, M, Pk in the Pr_P field in the received block Block n ;

(3) The node runs the VRF verification function VRF_Verify: True/False=VRF_Verify(Pk,M,Y,P), the verifier inputs the VRF prover's public key Pk, the message M, and the VRF output random value Y and the proof P are performed Verification, the output is False/True, if it is proved that P is generated according to M, and Y can be deduced from P, then the verification passes and the output is True, otherwise the verification fails and the output is False, and it is verified whether Y can be mapped to the current packaging node , if it can be mapped to, the verification passes, otherwise the verification fails;

(4) After the verification is passed, the master node writes the block into the local blockchain, and each master node redistributes the verified block Block n to each non-participating consensus node in its management domain. The current packaging node returns an acceptance message.
A computer device, characterized in that the computer device includes a memory and a processor, the memory stores a computer program, and when the computer program is executed by the processor, the processor is caused to perform the following steps:

The initial configuration of the blockchain. At the beginning of the establishment of the blockchain, CA first divides the network into Q domains, and assigns a leader node to each domain to participate in the construction of the blockchain. When a node joins the blockchain network , register the identity information at the CA; when a node exits, the CA also needs to cancel its identity information;

Based on the Raft consensus protocol based on verifiable random function, when a new block is generated in each round, the billing node of this round randomly selects the billing node of the next round.
A computer-readable storage medium storing a computer program, when the computer program is executed by a processor, the processor causes the processor to perform the following steps:

The initial configuration of the blockchain, at the beginning of the establishment of the blockchain, CA first divides the network into Q domains, and assigns a leader node to each domain to participate in the construction of the blockchain. When a node joins the blockchain network , register the identity information at the CA; when a node exits, the CA also needs to cancel its identity information;

Based on the Raft consensus protocol based on verifiable random function, when a new block is generated in each round, the billing node of the round randomly selects the billing node of the next round.
A blockchain construction system for implementing the blockchain construction method according to any one of claims 1 to 6, wherein the blockchain construction system comprises:

The initial configuration module of the blockchain is used to divide the network into Q domains at the beginning of the establishment of the blockchain. Each domain designates a leader node to participate in the blockchain consensus, and the remaining nodes in the domain passively synchronize the blocks after the leader node consensus. ;

The Raft consensus protocol building block is used for the Raft consensus protocol based on a verifiable random function: when a new block is generated in each round, the billing node of the round randomly selects the billing node of the next round.
A blockchain system, characterized in that the blockchain system is equipped with the blockchain construction system of claim 9 .