JP2024035121A - Block synchronization method, blockchain system, device and storage medium - Google Patents

Abstract

A block synchronization method, a blockchain system, a device, and a storage medium are disclosed. A blockchain system includes a plurality of VPs and m NVP clusters, each NVP cluster includes a first NVP and at least one second NVP, and the first NVP is connected to a corresponding VP. an NVP for communicating with a first NVP, and transmits a first message conveying a block by each of the m VPs of the plurality of VPs to a first NVP in a corresponding NVP cluster; Upon receiving the message, it stores the block conveyed in the first message in the blockchain and sends the first message to the neighboring NVP. A VP can synchronize this block by each NVP by simply sending a first message carrying the block to the first NVP, thereby reducing the load on the VP and improving block consensus efficiency. do. [Selection diagram] Figure 2

Description

The present application relates to the field of blockchain technology, and in particular, to a block synchronization method, a blockchain system, a device, and a storage medium.

In some scenarios, a blockchain system includes multiple consensus nodes (Validating Peer, VP) and multiple non-consensus nodes (None-Validating Peer, NVP). VPs need to participate in the block consensus process, NVPs do not need to participate in the block consensus process, and NVPs need to synchronize blocks with VP consensus to maintain data integrity at the nodes. There is.

In related technology, each of a plurality of VPs may be directly communicably connected to a plurality of NVPs. After multiple VPs complete consensus on a block, they add the block to the blockchain. Any one VP can then directly send this block to multiple NVPs communicatively coupled to this VP to achieve synchronization of each of the multiple NVPs to this block.

However, in the above scheme, if the number of blocks that require consensus by the VP becomes more and more large and the number of NVPs communicatively connected to the VP continues to increase, the VP becomes very busy. This increases the load on VP and affects the block consensus efficiency.

The present application provides a block synchronization method, a blockchain system, a device, and a storage medium that can reduce the load on consensus nodes in a blockchain system and improve block consensus efficiency. The technical proposal is as follows.

According to a first aspect, there is provided a block synchronization method applied to a blockchain system, the blockchain system including a plurality of consensus nodes VP and m non-consensus node NVP clusters, The m VPs have a one-to-one correspondence with the m NVP clusters, each of the m NVP clusters including a first NVP and at least one second NVP; is an NVP that communicates with a corresponding VP and has a network path between the first NVP and each of the at least one second NVP, where m is a positive integer, and where the The method is

Each time said plurality of VPs complete consensus on a block and add said block to the blockchain, each of said m VPs sends a first message carrying said block to said block in the corresponding NVP cluster. sending to the first NVP;
When each NVP in each of the m NVP clusters receives the first message, it stores the block carried in the first message in the blockchain and transfers the first message to all other NVP clusters in the same NVP cluster. including sending to neighboring NVPs.

According to a second aspect, a blockchain system is provided, wherein the blockchain system includes a plurality of consensus node VPs and m non-consensus node NVP clusters, and m VPs of the plurality of VPs are , in one-to-one correspondence with the m NVP clusters, each of the m NVP clusters including a first NVP and at least one second NVP, and the first NVP has a corresponding VP an NVP in communication with a NVP, having a network path between each of the first NVP and the at least one second NVP, where m is a positive integer;
Each of the m VPs sends a first message carrying the block into the corresponding NVP cluster each time the plurality of VPs complete consensus for a block and add the block to the blockchain. to said first NVP of;
Each NVP in each of the m NVP clusters stores the block carried in the first message in a blockchain when the first message is received, and stores the block carried in the first message in the same NVP. Send to neighboring NVPs in the cluster.

According to a third aspect, there is provided a computer device including a memory, a processor, and a computer program stored in the memory and executable by the processor, and when the computer program is executed by the processor, the A block synchronization method is realized.

According to a fourth aspect, there is provided a computer readable storage medium having a computer program stored thereon, which when executed by a processor realizes the block synchronization method described above.

According to a fifth aspect, a computer program product is provided that includes instructions, and when the computer program product runs on a computer, the computer performs the steps of the block synchronization method.

1 is a schematic structural diagram of a blockchain system according to an embodiment of the present application; FIG. 3 is a flowchart of a block synchronization method according to an embodiment of the present application. 1 is a schematic diagram of a blockchain according to an embodiment of the present application; FIG. 2 is a schematic diagram of another blockchain according to an embodiment of the present application; FIG. 1 is a schematic structural diagram of a computer device according to an embodiment of the present application; FIG.

In order to make the objectives, technical solutions, and advantages of the present application more clear, embodiments of the present application will be described in further detail with reference to the drawings. It should be understood that references to "plurality" in this application refer to two or more. In the description of this application, unless otherwise specified, "/" represents or, for example, A/B can represent A or B, and "and/or" in the text describes the related relationship of related objects. For example, A and/or B means that A exists alone, A and B exist simultaneously, and B exists alone. Three cases can be expressed. In addition, in order to clearly explain the technical solution of the present application, characters such as "first" and "second" are used to distinguish the same or similar items that have basically the same function and operation. Those skilled in the art will understand that characters such as "first" and "second" do not limit the quantity and order of execution, and characters such as "first" and "second" do not necessarily limit that they are different. I can understand that this is not the case.

The block synchronization method according to the embodiments of the present application can be applied to an application scene of synchronizing blocks stored in VPs of a blockchain system to each NVP in an NVP cluster.

For example, in a consortium blockchain scenario, the consortium blockchain includes nodes of multiple prefecture agencies and city-based nodes belonging to several prefecture agencies. Nodes of multiple prefectural institutions (i.e., VPs) can participate in the block consensus process, and city-level nodes (i.e., NVPs) belonging to one prefectural institution do not need to participate in the block consensus process.

FIG. 1 is a schematic structural diagram of a blockchain system according to an embodiment of the present application.

Referring to FIG. 1, the blockchain system 100 is a system for performing data sharing between nodes, and includes a plurality of VPs 101 and m NVP clusters 102, and m Each of the NVP clusters 102 includes a plurality of NVPs 103, and m is a positive integer.

Multiple VPs 101 are nodes that need to participate in the block consensus process in the blockchain system. Each NVP 103 in each of the m NVP clusters 102 is a node that does not need to participate in the block consensus process.

The plurality of VPs 101 can receive input information during normal operation and maintain shared data within the blockchain system 100 based on the received input information. Information connections may exist between the plurality of VPs 101, and information may be transmitted between the plurality of VPs 101 via the information connections. For example, when any one VP 101 in the blockchain system 100 receives input information sent from a client, the other VP 101 in the blockchain system 100 acquires the input information based on a consensus algorithm, and is stored as data in the shared data.

In addition, m VPs 101 among the plurality of VPs 101 have a one-to-one correspondence with m NVP clusters 102, and for any one VP 101 among the m VPs 101, this VP 101 has a one-to-one correspondence with m NVP clusters 102. A corresponding one of the NVP clusters 102 can be communicated with. The plurality of VPs 101 in the blockchain system 100 may communicate with the corresponding NVP cluster 102 after storing the input information as data in the shared data, i.e., send the input information to the corresponding NVP cluster 102. , a plurality of NVPs 103 in the corresponding NVP cluster 102 store the input information as data in shared data.

Here, the VP 101 in the blockchain system 100 communicates with one NVP 103 in the corresponding NVP cluster 102, that is, the VP 101 in the blockchain system 100 sends a message only to one NVP 103 in the corresponding NVP cluster 102. Accordingly, the load on the multiple VPs 101 in the blockchain system 100 can be reduced, and the performance of the multiple VPs 101 in the blockchain system 100 can be improved.

To ensure the integrity of the shared data stored on each node in the blockchain system 100, the multiple NVPs 103 in each NVP cluster 102 need to synchronize the input data stored in the corresponding VP 101. .

The plurality of NVPs 103 in each NVP cluster 102 include a first NVP 103 and at least one second NVP 103, where the first NVP 103 is an NVP 103 that communicates with a corresponding VP 101 in the NVP cluster 102 in which it is located, i.e. , one VP 101 in the blockchain system 100 sends the input information to the first NVP 103 in the corresponding NVP cluster 102. A new NVP 103 can be added to each NVP cluster 102 arbitrarily, and this does not affect the ability of a VP 101 within the blockchain system 100 to send messages to the corresponding NVP cluster 102. The scalability of each NVP cluster 102 within is relatively high.

Additionally, a network path exists between each of the first NVP 103 and at least one second NVP 103. A network path is used to indicate a data transmission channel between multiple NVPs 103, through which a first NVP 103 may transmit data to at least one second NVP 103. There is a possibility that multiple NVPs 103 exist on the network path between two NVPs 103, and in this case, the two NVPs 103 can perform indirect communication. There may be no other NVP 103 in the network path between the two NVPs 103, ie, the two NVPs 103 can communicate directly, ie, the two NVPs 103 are adjacent NVPs 103.

After the first NVP 103 among the plurality of NVPs 103 receives the input information, the other second NVP 103 among the plurality of NVPs 103 also transmits the input information via the network path. Receive the input information. In this way, each of the plurality of NVPs 103 stores the input information as data in the shared data so that the data stored in all nodes in the blockchain system 100 match. That is, each node within blockchain system 100 stores the same blockchain.

Blockchain system 100 includes computer technologies such as distributed data storage, point-to-point transmission, consensus mechanisms, and encryption algorithms. The blockchain system 100 is a distributed shared ledger and database, and has characteristics such as decentralization, tamperability, suspension of the entire process, traceability, collective maintenance, and public transparency. These features ensure the blockchain's shared openness, real integrity and security reliability.

The plurality of VPs 101 and m NVP clusters 102 in the blockchain system 100 execute the block synchronization method described in the example of FIG. , shared data described above) to each NVP 103 in the NVP cluster 102.

FIG. 2 is a flowchart of a block synchronization method according to an embodiment of the present application. This method can be applied to blockchain systems. Referring to FIG. 2, the method includes the following steps.

Step 201: After the multiple VPs complete the consensus for one block and add this block to the blockchain, each of the m VPs of this multiple VP Send a first message carrying this block to the NVP.

The first NVP is the NVP that communicates with the corresponding VP in the same NVP cluster, and the first NVP exists only once in the same NVP cluster, i.e. Each of the VPs sends a first message carrying this block to one NVP in the corresponding NVP cluster.

The first message carries this block, and the first message is used to instruct the NVP that received the first message to store the block carried by the first message. Preferably, the first message may be a GOSSIP (Infectious Disease Protocol) message; of course, the first message may be other types of messages, and the embodiments herein do not limit this.

Since each NVP in each of the m NVP clusters in the blockchain system according to embodiments of the present application does not need to participate in the consensus process of a block, each of the m VPs does not need to participate in the consensus process of the block. A first message can be sent conveying this block to the corresponding NVP cluster to retrieve and store, thereby ensuring the integrity of the blockchain stored on each node in the blockchain system. be done.

In this case, the first NVP in the NVP cluster corresponding to each of this m VPs can receive the first message carrying this block, and the first NVP in the corresponding NVP cluster , this block can be stored. Furthermore, each of the m VPs only needs to send the first message to the first NVP in the corresponding NVP cluster, and does not need to send the first message to each NVP in the corresponding NVP cluster. do not have. This reduces the load on each VP.

Note that before each of these m VPs sends the first message carrying a block to the first NVP in the corresponding NVP cluster, The cluster may further select a primary NVP.

The primary NVP of one NVP cluster is used to communicate with the corresponding VP, i.e. the primary NVP is the first NVP, and other NVPs other than the primary NVP of one NVP cluster are the secondary NVPs. Yes, the secondary NVP of one NVP cluster is the second NVP. That is, one NVP cluster has one primary NVP and at least one secondary NVP.

Further, after any one NVP cluster in the m NVP clusters selects one primary NVP (i.e., the first NVP), the first NVP in this NVP cluster is assigned the first NVP to the corresponding VP. 1 notification message may be sent.

The first notification message is used to indicate that the NVP sending the first notification message has been elected as the primary NVP of the NVP cluster in which it is located. In this case, the NVP that sends the first notification message is the NVP that communicates with the corresponding VP in the NVP cluster in which it is located, and then the corresponding VP, after adding the block to the blockchain, sends the first notification message. The message may be sent to the NVP in this NVP cluster that is elected as the primary NVP (i.e., the first NVP), such that the corresponding VP sends the first message to the Guarantees that it can only send to the first NVP.

Preferably, any one NVP cluster among the m NVP clusters may select one primary NVP in a dynamic selection manner.

In this way, if the primary NVP selected in this NVP cluster goes down, one primary NVP will be elected anew, so that there is always one first NVP communicating with the corresponding VP in one NVP cluster. This ensures that NVP clusters are more active.
Specifically, the operation in which any one NVP cluster among these m NVP clusters selects one primary NVP using a dynamic selection method is realized by the following steps (1) to (4). be able to.

(1) After one NVP cluster is activated globally, each of the at least one NVP in this NVP cluster sends a second message carrying its node identifier to another NVP in the same NVP cluster. Broadcast.

The entire activation of one NVP cluster refers to the activation of each NVP among all the NVPs in this NVP cluster, that is, each NVP begins to enter an operational state.

The at least one NVP is the NVP within this NVP cluster that is claimed as the primary NVP after this entire NVP cluster is activated.

A node identifier of an NVP is used to uniquely identify this NVP; for example, a node identifier of an NVP can be a number, an IP (Internet Protocol) address, etc. of this NVP.

The second message carries a node identifier, and the second message is used to indicate that the NVP identified by the node identifier carried in the second message is requested as the primary NVP. Preferably, the second message may be a GOSSIP message; of course, the second message may be other types of messages, and the embodiments herein do not limit this.

After one NVP cluster is brought up globally, there may be no first NVP in this NVP cluster, i.e. if there is no NVP in this NVP cluster that communicates with the corresponding VP, then the corresponding After a VP adds a block to the blockchain, it does not know which NVP in this NVP cluster to send the first message carrying this block. Therefore, after this NVP cluster is activated as a whole, one primary NVP needs to be selected first, that is, get the first NVP in this NVP cluster. In this case, each NVP in the NVP cluster has the right to be applied as the primary NVP, so if any one NVP in this NVP cluster wants to be applied as the primary NVP, it can be applied as the primary NVP in this NVP cluster. A second message can be broadcast to this NVP cluster to request.

(2) Any one of the at least one NVP receives the second message broadcast by the other NVP at a first predetermined time after the second message is broadcast.

The first predetermined time period may be preconfigured, and the first predetermined time period may be such that any one NVP carries a second node identifier broadcast by each of the other NVPs. may be set to a large value to ensure that messages can be received. For example, the first predetermined time may be set to 5 minutes.

In this case, any one of the at least one NVP may receive a second message broadcast by another NVP after broadcasting the second message, thereby causing the NVP cluster to Know which of the NVPs will be applied as the primary NVP.

(3) any one of the at least one NVPs transmits its node identifier in a second message broadcast by another NVP received at the first predetermined time; can determine whether it has been selected as the primary NVP.

Specifically, any one of the at least one NVP transmits its node identifier to a second NVP broadcast to other NVPs received within a first predetermined time period according to a predetermined selection condition. By comparing with the node identifier carried by the message, it may determine whether it has been elected as the primary NVP.

The predetermined selection condition is a condition for determining whether or not it is possible to win the primary NVP. The predetermined selection conditions may be set in advance, and the predetermined selection conditions can be set by an engineer according to usage needs. For example, the predetermined selection condition may be that the NVP with the smallest node identifier in the NVP cluster is selected as the primary NVP. In another example, the predetermined selection condition may be that the NVP with the highest node identifier in the NVP cluster is elected as the primary NVP. Of course, the predetermined selection condition may be set as another condition for determining whether or not a candidate can be selected as the primary NVP, and the embodiments of the present application are not limited thereto.

For example, the predetermined selection condition is that the NVP with the smallest node identifier in the NVP cluster be selected as the primary NVP. The node identifier of one NVP is 04, and this NVP receives the second message broadcast by the three NVPs at the first predetermined time, and the node identifier of one NVP is 04. The node identifier carried in the second message broadcast by the second of these three NVPs is 05, and the node identifier carried in the second message broadcast by the second of these three NVPs is 06, and the node identifier carried in the second message broadcast by the second of these three NVPs is 06. The node identifier carried in the second message broadcast by the third NVP is 07. This NVP then compares its own node identifier (04) with the node identifiers (05, 06, 07) contained in the second message broadcast by this three NVPs that it received and It is determined whether or not satisfies a predetermined selection condition. Since its node identifier is smaller than any of the node identifiers carried in the second message broadcast by the three NVPs, this NVP decides that it can be elected as the primary NVP.

(4) If any one of the at least one NVP determines that it has been elected as the primary NVP, the second notification message is sent to other NVPs in the same NVP cluster every second predetermined time. If it is determined that the applicant cannot be selected as the primary NVP, the process of applying as the primary NVP ends.

The second predetermined time may be preconfigured, the second predetermined time being such as to ensure that the second notification message can be sent successively to other NVPs in the same NVP cluster. , may be set smaller so that other NVPs in the same NVP cluster always know which NVP is the primary NVP in the NVP cluster.

The second notification message is used to indicate that the NVP sending the second notification message has been elected as the primary NVP of the NVP cluster in which it is located, and the NVP receiving the second notification message is Used to indicate that it is a secondary NVP in an NVP cluster.
In this case, if any one of the at least one NVP determines that it has been elected as the primary NVP, it notifies another NVP in the same NVP cluster that it has been elected as the primary NVP. , a second notification message is sent to another NVP in the same NVP cluster, where the other NVP in the same NVP cluster is a secondary NVP. If it is determined that it cannot be selected as the primary NVP, it ends the operation of applying as the primary NVP, that is, it does not broadcast the second message and logs out of the current selection of the primary NVP. In this way, after one whole NVP cluster is activated, the primary NVP of this NVP cluster is selected for the first time.

Preferably, the second notification message may carry its own (ie, primary NVP) node identifier. In this case, if any one secondary NVP in this NVP cluster receives the second notification message, it compares its node identifier with the node identifier carried by the second notification message and Determine whether the NVP identified by the node identifier carried by the notification message can continue to be elected as the primary NVP, and if this secondary NVP is the NVP identified by the node identifier carried by the second notification message. If it determines that it cannot continue to be elected as the primary NVP, it sends a request message carrying its own node identifier to the current primary NVP (i.e., the NVP sending the second notification message) and elects the current primary NVP After receiving the request message sent by this secondary NVP, it compares its node identifier with the node identifier carried by the request message to determine whether it can continue to be elected as the primary NVP. , if the current primary NVP decides that it cannot continue to be elected as the primary NVP, it sends a decision message to this secondary NVP, and after this secondary NVP receives the decision message, it elects itself as the primary NVP. If so, broadcast a second notification message to other NVPs in this NVP cluster.

This request message is used to instruct the secondary NVP sending the request message to apply as the primary NVP. In the request message, the node identifier of the secondary NVP sending the request message is carried.

This decision message indicates that the current primary NVP has decided that it cannot continue to be elected as the primary NVP, and that the secondary NVP sending the request message can be elected as the primary NVP. do.

After one secondary NVP receives the second notification message, when it compares its own node identifier with the node identifier carried in the second notification message, the node identifier carried in the second notification message identifies may compare its own node identifier with the node identifier conveyed in the second notification message according to predetermined selection conditions to determine whether the NVP to be elected can continue to be elected as the primary NVP. Specifically, after this secondary NVP compares its own node identifier with the node identifier carried in the second notification message, the node identifier carried in the second notification message does not satisfy the predetermined selection condition. If it is determined that the NVP identified by the node identifier carried in the second notification message cannot continue to be elected as the primary NVP, the node identifier of this secondary NVP satisfies the predetermined selection condition. If it is determined not to, it may be determined that the NVP identified by the node identifier carried in the second notification message can continue to be elected as the primary NVP.

Similarly, after receiving the request message sent from this secondary NVP, the current primary NVP compares its own node identifier with the node identifier carried in the request message based on predetermined selection conditions and may continue to be elected as the primary NVP. Specifically, if the current primary NVP compares its own node identifier with the node identifier included in the request message and determines that the node identifier carried in the request message does not satisfy the predetermined selection condition, then can decide that it can continue to be elected as the primary NVP, and if it determines that its own node identifier does not satisfy the predetermined selection conditions, it can decide that it cannot continue to be elected as the primary NVP. .

In this case, this NVP cluster can select a primary NVP that meets the predetermined selection conditions, that is, can select an NVP that is more qualified to be elected as the primary NVP.

For example, the node identifier carried in the second notification message is 03, and the node identifier of one secondary NVP is 02. After one secondary NVP in the NVP cluster receives the second notification message, it compares its own node identifier (02) with the node identifier (03) carried in the second notification message and If the NVP identified by the node identifier (03) carried in the notification message (i.e., the current primary NVP) determines that it cannot continue to be elected primary NVP, then this NVP Send a request message carrying the current primary NVP. After receiving the request message, the current primary NVP compares its own node identifier (03) with the node identifier (02) carried in the request message and cannot continue to elect itself as the primary NVP. I decide. The current primary NVP then sends a decision message to this NVP to determine that it cannot continue to be elected as the primary NVP. After this NVP receives the decision message and determines that it has been elected as the primary NVP, it broadcasts a second notification message to the other NVPs in the NVP cluster and announces itself to the other NVPs in the NVP cluster. Notify that you have been elected as the primary NVP.

Note that if the primary NVP in one NVP cluster is in a down state, this NVP cluster needs to reselect a new primary NVP.

If the primary NVP of this NVP cluster is down, the primary NVP cannot communicate with the corresponding VP, i.e. the located NVP cluster cannot communicate with the corresponding VP, and the primary NVP is located Unable to communicate with other NVPs in the NVP cluster. Therefore, this NVP cluster needs to reselect a new primary NVP so as to maintain the communication connection between this NVP cluster and the corresponding VP, i.e., this NVP cluster must the communication connection between the primary and secondary NVPs within the NVP cluster.

Specifically, when the main NVP in one NVP cluster is down, the operation for this NVP cluster to reselect a new main NVP can be achieved by the following steps (1) to (5). .

(1) Any one secondary NVP in this NVP cluster broadcasts a second message to another NVP in the same NVP cluster if the second notification message is not received in a third predetermined time.

The third predetermined time period may be preconfigured, and the third predetermined time period is greater than or equal to the second predetermined time period, whereby this secondary NVP receives the second notification message sent by the primary NVP of the NVP cluster. have enough time to receive the item.

In this case, if this secondary NVP did not receive the second notification message in the third predetermined time, it means that the primary NVP of this NVP cluster did not send the second notification message in the second predetermined time. This indicates that the primary NVP of the NVP cluster in which it is located is likely to be down. In order to maintain communication connectivity between this NVP cluster and its corresponding VP, this secondary NVP sends a second message to another NVP in the same NVP cluster to apply as the primary NVP for this NVP cluster. Can be broadcast.

(2) If any one NVP in this NVP cluster receives a second message broadcast by this secondary NVP, it carries its own node identifier and the second message broadcast by this secondary NVP. When it is determined that this secondary NVP cannot be elected as the primary NVP after comparing the node identifiers that have been assigned, it broadcasts a second message to another NVP in the same NVP cluster.

After receiving the second message broadcast by this secondary NVP, one NVP compares its own node identifier with the node identifier carried in the second message according to predetermined selection conditions, It may be determined that the secondary NVP cannot be elected as the primary NVP. Specifically, one NVP compares its own node identifier with the node identifier carried in the second message, and then determines that the node identifier carried in the second message does not satisfy the predetermined selection condition. If it is determined that this secondary NVP cannot be elected as the primary NVP, and if it is determined that its own node identifier does not satisfy the predetermined selection conditions, it can be determined that this secondary NVP cannot be elected as the primary NVP. .

After this secondary NVP broadcasts the second message, any one of the other NVPs in this NVP cluster receives the second message broadcasted by this NVP. This NVP then compares its own node identifier with the node identifier included in the second message broadcast by this secondary NVP according to predetermined selection conditions, and determines whether it or this secondary NVP cannot be elected as the primary NVP. can be determined. If this secondary NVP determines that it cannot be elected as the primary NVP, it may broadcast a second message to other NVPs in the same NVP cluster to apply itself as the primary NVP. If it determines that it cannot be elected as the primary NVP, this NVP may terminate the operation of broadcasting the second message, ie log out the election of a new primary NVP in this NVP cluster.

(3) Any one NVP in this NVP cluster receives the second message broadcast by another NVP at a first predetermined time after the second message was most recently broadcast.

Any one NVP in this NVP cluster receives the second message broadcast by the other NVP after the second message was most recently broadcast, and determines which NVP in this NVP cluster is the primary NVP. You can find out if you have applied as a.

(4) Any one NVP in this NVP cluster compares its own node identifier with the node identifier carried in the second message broadcast by the other NVPs received at the first predetermined time. to determine whether or not it has been elected as the primary NVP.

Specifically, the operation of step (4) is such that any one of the at least one NVP has its own node identifier and the second node identifier broadcasted by another NVP received at the first predetermined time. The operation is similar to the operation of comparing the node identifier carried in the message No. 2 and determining whether the node itself has been elected as the primary NVP, and detailed explanation will be omitted here.

(5) If any one NVP in this NVP cluster determines that it has been elected as the primary NVP, it sends a second notification message to other NVPs in the same NVP cluster at second predetermined intervals. .

In this case, if any one NVP in this NVP cluster decides that it has been elected as the primary NVP, a second notification message is sent to the other NVPs in the same NVP cluster and It notifies other NVPs that it has been elected as the new primary NVP, and at this time, other NVPs in the same NVP cluster are secondary NVPs. In this way, if the primary NVP in one NVP cluster goes down, a new primary NVP is selected.

Step 202: Each NVP in each of the m NVP clusters, if it receives the first message, stores the block carried in the first message in the blockchain and stores the block carried in the first message in the same NVP cluster. Send to neighboring NVP.

Each NVP may store the block conveyed in the first message on the blockchain.

The first NVP in each of the m NVP clusters first receives the first message sent by the corresponding VP, and the first NVP transfers the block carried in the first message to its own block. The first message may be stored in a chain and sent to neighboring NVPs in the same NVP cluster. Then, any one of the NVPs adjacent to the first NVP in the same NVP cluster, after receiving the first message sent by the first NVP, blocks the block carried in the first message. may be stored on its own blockchain and the first message may be sent to neighboring NVPs in the same NVP cluster. Similarly, each NVP within the same NVP cluster stores the block carried in the first message on its blockchain and sends the first message to neighboring NVPs within the same NVP cluster.

Preferably, step 202 may be realized by the GOSSIP protocol. That is, after receiving the first message, the first NVP in each NVP cluster broadcasts the first message to each NVP in the located NVP cluster by using the GOSSIP protocol, so that Each NVP within the located NVP cluster stores the block conveyed in the first message on its own blockchain.

In this case, the first message is propagated by the GOSSIP protocol, and each NVP in each NVP cluster stores the blocks carried in the first message in its own blockchain, thereby adding them to the corresponding VP. synchronize the created blocks to each NVP in each NVP cluster.

Preferably, each NVP in each of the m NVP clusters has a node list that includes node identifiers of neighboring NVPs in the same NVP cluster.
The node list within one NVP is used to indicate the NVPs adjacent to this NVP, for example, the node identifier of one NVP is 02, and the node identifiers of NVPs adjacent to this NVP are 01, 03, and 04 can be seen from the node list within this NVP shown in Table 1 below.

In the embodiment of the present application, the node list of one NVP is exemplarily explained using Table 1 as an example, and Table 1 is not intended to limit the embodiment of the present application.

In this case, the operation in step 202 can be realized by the following steps (1) to (3).

(1) If any one NVP in each of the m NVP clusters receives the first message, the block conveyed in the first message is stored in its own blockchain.

In this case, after receiving the first message, one NVP first stores the block carried in the first message in its own blockchain, that is, the block added to the corresponding VP is transferred to this NVP. Synchronize with.

Preferably, the first message generated by the VP may further carry a message sequence number of the first message. In this case, when any one NVP in each of the m NVP clusters receives the first message, the message sequence number of the most recently received first message is set to the previous received history number. If the message sequence number of the most recently received first message is greater than the message sequence number of the last received history first message, then 1 message is stored in the blockchain, and if the message sequence number of the most recently received first message is less than or equal to the message sequence number of the last received history first message, then The first message received may be discarded.

The message sequence number of the first message is used to uniquely identify the first message, and the message sequence number of the first message generated by the VP is incremented.

The historical first message is the first message received by the NVP before the most recently received first message.

If the message sequence number of the most recently received first message by one NVP is greater than the message sequence number of the previous received historical first message, it means that the most recently received first message is Indicates that it was most recently generated by the corresponding VP, i.e. the block carried in the most recently received first message is the most recently added to the blockchain by the corresponding VP. . That is, the block conveyed in the most recently received first message is not stored in the blockchain of this NVP. In this way, this NVP can store the block conveyed in the first message on the blockchain and synchronize this block.

If the message sequence number of the most recently received first message by one NVP is less than or equal to the message sequence number of the most recently received past first message, then it is not the first message most recently generated by the corresponding VP, i.e. the blocks carried within the most recently received first message are likely to have been stored by this NVP's blockchain. Therefore, there is no need to store the block and therefore the most recently received first message may be discarded.

In this case, the block stored in the blockchain of any one NVP in each of the m NVP clusters each time is a block newly added to the corresponding VP. In this way, it can be guaranteed that the blocks stored in the blockchain of any one NVP in each of the m NVP clusters are not duplicated.

(2) If the first message received by any one NVP in each of the m NVP clusters is from the corresponding VP, the first message is updated to update the first message; The first message with the node identifiers added and updated is sent to the NVP identified by each node identifier in its node list.

The first message indicates that the NVP identified by the node identifier carried in the first message has received the first message, i.e., the NVP identified by the node identifier carried in the first message is used to indicate that the block carried in the first message has been stored on the blockchain.

This NVP adds its node identifier to the first message so that it updates the first message, so that the next NVP that receives the updated first message will know which NVP guarantee that you will know that your message has been received.

If the first message received by one NVP is from the corresponding VP, it indicates that this NVP is the first NVP, and in this case, other than this NVP in the located NVP cluster. It can be seen that another NVP has not received the first message, ie, an NVP adjacent to this NVP has not received the first message. Thereby, this NVP updates the first message and then sends the updated first message to the NVP identified by each node identifier in its own node list.

(3) If the first message received by any one NVP in each of m NVP clusters is from an NVP in the same NVP cluster, then the node identifier carried by the first message is NVP determined as the target node identifier, with its own node identifier appended to the first message to update the first message, and identified by each other node identifier in its own node list excluding the target node identifier The updated first message is then sent.

If the first message received by one NVP is from an NVP in the same NVP cluster, it indicates that this NVP is the second NVP. At this time, it can be seen that the first message is received by at least some NVPs (including the first NVP) in other NVPs other than this NVP in the located NVP cluster. Accordingly, the first message received by this NVP carries a node identifier (i.e., a target node identifier), and the NVP identified by the target node identifier is the NVP that received the first message. Therefore, this NVP may not send the updated first message to the NVP identified by the target node identifier. That is, after the first message is updated, this NVP may send the updated first message to the NVP identified by each other node identifier other than the target node identifier in its own node list. good.

In this way, each NVP in each of the m NVP clusters is guaranteed not to receive a duplicate first message, thereby ensuring that the blocks stored within each NVP's blockchain are not duplicated. be done.

Preferably, the node list of one NVP may further include output interfaces corresponding to node identifiers of adjacent NVPs.

This output interface is the network interface through which an NVP sends the first message when the NVP sends the first message to the NVP identified by the node identifier in the node list. For example, the node identifier of one NVP is 02, and the node identifiers of three adjacent NVPs including this NVP in the NVP's node list are 01, 03, and 04. The output interfaces corresponding to the node identifiers of three adjacent NVPs included in the node list are shown in Table 2 below.

In the embodiment of the present application, the node list of one NVP is exemplified by taking Table 2 as an example, and Table 2 does not limit the embodiment of the present application.

In this case, the act of sending an updated first message by one NVP to the NVP identified by each other node identifier other than the target node identifier in the NVP's node list means that this NVP Obtain the output interface corresponding to each other node identifier other than the target node identifier from the list, and for any one node identifier in each other node identifier other than the target node identifier in the node list of the NVP, this NVP , by sending the updated first message to the NVP identified by this node identifier by using the output interface corresponding to this node identifier.

In this way, each node identifier in the node list corresponds to one output interface, and any one NVP in each of the m NVP clusters has an adjacent The updated first message may be sent to the NVP. This makes it possible to avoid network congestion and improve message transmission speed.

Preferably, any one NVP in each of the m NVP clusters includes a first module and a second module, the first module configured to communicate with an adjacent NVP in the same NVP cluster. and further configured to communicate with the corresponding VP. The second module is configured to process the blocks conveyed in the first message.

In this case, the act of step 202 includes, if the first module receives the first message, transmits the block carried in the first message to the second module; After receiving a block sent by a module, it stores this block in its own lockchain, and if the first message received by the first module is from the corresponding VP, then the first message received by the first module is from the corresponding VP. The module updates the first message by adding the node identifier of the NVP to which the first module belongs to the first message, and identifies the updated first message by each node identifier in its node list. If the first message sent to the NVP and received by the first module is from an NVP in the same NVP cluster, the first module returns the node identifier carried in the first message. Add the node identifier of the NVP to which the first module belongs to the first message to determine the target node identifier and update the first message, and add the updated first message to the target in its own node list. It may also be to send to an NVP identified by a node identifier other than the node identifier.

In this way, the first module receives, updates and sends the first message, and the second module receives the block sent by the first module and adds the block to its own blockchain. Remember. In other words, the first module and the second module have their own division of labor, which can improve block synchronization efficiency.

Therein, the operations performed by the first module and the second module are such that the one NVP receives a first message and stores the block carried in the first message in the blockchain; The operation is similar to the operation of transmitting the first message to an adjacent NVP within the same NVP cluster, and detailed explanation will be omitted here.

Preferably, the VP corresponding to each of the m NVP clusters may generate a check message in a block consensus process, and the VP further sends this check message to the first NVP in the corresponding NVP cluster. good.

The check message is used to instruct NVP to check whether the block stored in its own blockchain is correct, and the check message includes a first target block identifier and a first target block identifier. A block hash value is conveyed. The first target block identifier is the block identifier of the block on which the VP performs the consensus process, and the first target block hash value is the block hash value of the block on which the VP performs the consensus process.

Preferably, the VP may generate a check message in the following two cases and send this check message to the first NVP in the corresponding NVP cluster.

In the first case, whenever a VP completes consensus for one block, it adds this block to the blockchain and sends the first message carrying this block to the first NVP in the corresponding NVP cluster. After sending, a check message may be sent to the first NVP in the corresponding NVP cluster, and the first target block identifier carried in the check message is the block identifier of this block, and the first target The block hash value is the block hash value of this block.

In this case, whenever the first message carrying this block is sent to the first NVP in the corresponding NVP cluster, a check message about this block is sent to the first NVP in the corresponding NVP cluster. Sent. This allows us to guarantee that each time each NVP in the corresponding NVP cluster stores one block, it receives a check message corresponding to this block, and each NVP stores each block stored in its own blockchain. It can guarantee that blocks can be inspected and ensure the accuracy of blocks stored on its own blockchain.

In the second case, the VP completed consensus for one block, added this block to the blockchain, and sent a first message carrying this block to the first NVP in the corresponding NVP cluster. Afterwards, if this block was generated after performing a block rollback operation, the VP may send a check message for this block to the first NVP in the corresponding NVP cluster. If this block has not been most recently generated after the block rollback operation was performed, the VP may not send a check message for the block to the first NVP in the corresponding NVP cluster.

The block identifier of the most recently generated block after the block rollback operation is performed is the same as the block identifier of the last generated block before the block rollback operation is performed, so VP By performing the operation, the VP sends the block with the same two block identifiers to the first NVP of the corresponding NVP cluster, and each NVP in the corresponding NVP cluster sends the block with the same two block identifiers to the first NVP of the corresponding NVP cluster. Upon receiving a block, each NVP does not know which block is the correct one, so each NVP's blockchain temporarily forks, i.e., the next block of one block in the blockchain. is divided into blocks where two block identifiers are the same. In this case, when the next block of the block identified by these two same block identifiers comes, in order to store the next block in the blockchain, the parent block hash value of the next block is added to the block hash of these two blocks. We need to compare the values to determine which of these two blocks is the parent block of the next block.

In this case, after the latest block is generated after the block rollback operation is performed, the VP may send a check message for this block to the first NVP in the corresponding NVP cluster. After receiving this check message, each NVP in the corresponding NVP cluster can check which of the blocks with the same two block identifiers stored in the blockchain is correct. This ensures the accuracy of blocks stored in the blockchain. Only when the latest block is generated after the block rollback operation is performed, the VP sends a check message to the first NVP in the corresponding NVP cluster, thus saving blockchain system resources. can.

Furthermore, after receiving the check message generated by the corresponding VP, any one NVP in each of the m NVP clusters can search for the first block in its own blockchain and its If the first block is found in the blockchain, the first block is removed from the blockchain when the block hash value of the first block is different from the first target block hash value.

The first block is the block whose block identifier is the same as the first target block identifier.

After one NVP receives the check message generated by the corresponding VP, it searches for the first block in its own blockchain, i.e., the block identifier in its own blockchain is the first target block identifier. Find blocks that are the same as . If the first block is retrieved in its own blockchain, compare the block hash value of the first block with the first target block hash value. If the block hash value of the first block is the same as the first target block hash value, it indicates that the first block is correct and no processing is required. If the block hash value of the first block is different from the first target block hash value, it indicates that the first block is different from the block corresponding to the first target block hash value, and the first block is incorrect. It can decide, i.e., it is likely to be a rolled back block, so it can delete the first block from its blockchain.

For example, after one VP completes consensus for a block with block identifier 50, a first message carrying a block with block identifier 50 is sent to the first NVP in the corresponding NVP cluster. Ru. However, after completing the consensus on this block, the VP performs a rollback on this block, and after performing the block rollback operation, this VP continues to generate blocks whose block identifier is 50, and this Complete consensus on the block. This VP then sends a first message carrying a newly generated block with block identifier 50 to the first NVP in the corresponding NVP cluster and sends a check message for this block. In this case, each NVP in the corresponding NVP cluster receives two blocks with block identifier 50, and accordingly, its own blockchain correspondingly stores two blocks with block identifier 50. However, at this time, the previously stored block whose block identifier is 50 can be deleted in response to this check message.

For example, FIG. 3 is a schematic diagram of blocks stored on NVP's blockchain. Referring to FIG. 3, FIG. 3 includes a blockchain 300 and a plurality of blocks 301 stored on the blockchain 300. The plurality of blocks 301 includes a block 301 with two block identifiers of 50, and the block 301 with two block identifiers of 50 causes a temporary branch in the blockchain 300. One NVP receives the check message sent by the corresponding VP, and the first target block identifier carried in this check message is 50. When this NVP searches for a block 301 whose block identifier is 50 from its own blockchain 300, it can detect two blocks 301 whose block identifiers are 50. Then, this NVP includes the block hash value of the block 301 whose block identifier is 50 that was stored earlier among the block 301 whose block identifier is 50, and the first target block included in this check message. If the hash value is determined to be different, this NVP can delete block 301 of its own blockchain 300 whose previously stored block identifier is 50, and thus this NVP's block Anything stored in the chain 300 is a correct block 301, and in this case, the blockchain 300 of this NVP is as shown in FIG. is also a valid block 301.

Having described in detail above the actions that each NVP in each of the m NVP clusters performs after receiving the first message, each NVP in each of the m NVP clusters By storing the transported blocks in its own blockchain, each NVP in each of the m NVP clusters ensures that blocks stored in multiple VPs are synchronized to its own blockchain. Realized.

Note that any one NVP in each of the m NVP clusters may not be able to receive blocks for a long time due to reasons such as network congestion or network partition. Synchronization is not possible. Below, we will explain in detail the operations that need to be performed in such cases to solve the problem of not being able to synchronize blocks due to the network.

Specifically, each NVP in each of the m NVP clusters transmits its blockchain state to other neighboring NVPs in the same NVP cluster every fourth predetermined time, and the blockchain state is transmitted to its own and the block identifier of the latest block in the blockchain, and any one NVP in each of the m NVP clusters converts the blockchain state sent from the received neighboring NVP into the target blockchain state. and if no block is received in the fifth predetermined time, if the block identifier of the latest block in its own blockchain is smaller than the block identifier in the target blockchain state, then the node identifier in the target blockchain state Obtain a block whose block identifier is larger than the block identifier of the latest block in its own blockchain from the target NVP's blockchain, and store the obtained block in its own blockchain.

The fourth predetermined time may be set in advance, or may be set by an engineer as necessary. For example, the fourth predetermined time period may be set to one minute.

The blockchain state of one NVP is used to indicate the status of the latest block stored on its own blockchain. The target blockchain state is the blockchain state that one NVP has received and sent by its neighboring NVPs, and if this NVP has multiple neighboring NVPs, then this NVP can receive multiple target blockchain states. can.

The fifth predetermined time may be preset, and the fifth predetermined time may be set large to ensure that blocks are received in sufficient time. For example, the fifth predetermined time period may be set to 2 minutes.

The target NVP is the NVP identified by the node identifier in the target blockchain state, among the multiple target blockchain states received by this NVP, whose block identifier is greater than the block identifier of the most recent block in this NVP's blockchain. .

Each NVP in each of the m NVP clusters sends its blockchain state to other neighboring NVPs in the same NVP cluster every fourth predetermined time, and each NVP sends its blockchain state to other neighboring NVPs in the neighboring NVP cluster. You can know the status of the latest stored block. If one NVP does not receive a block in the fifth predetermined time, indicating that this NVP has not received a block within a very long period of time, this NVP will In any one target blockchain state, it is possible to check whether there is a block identifier larger than the block identifier of the latest block in its own blockchain, and in multiple target blockchain states, one target If the block identifier in the blockchain state is greater than the block identifier of the most recent block in its own blockchain, then this NVP receives the block identifier from the target NVP's blockchain identified by the node identifier in this target blockchain state. It is possible to obtain a block that is larger than the block identifier of the latest block in the blockchain. After that, it is possible to store the acquired blocks on its own blockchain and achieve synchronization of blocks that are not stored on its own blockchain. If the block identifier in each target blockchain state among the plurality of target blockchain states is less than or equal to the block identifier of the latest block in its own blockchain, this NVP continues to wait to receive a block.

In this way, if one NVP does not receive a block for a long time, it can save system resources by directly retrieving a block from the adjacent target NVP's blockchain that is larger than the block identifier of the latest block in its own blockchain. can save time, save block synchronization time, and improve block synchronization efficiency.

Preferably, the blockchain state further includes a block hash value of the most recent block in the blockchain, where this NVP has a block identifier from the blockchain of the target NVP identified by the node identifier in the target blockchain state. The act of obtaining a block larger than the block identifier of the most recent block in its own blockchain causes this NVP to send a third message to the target NVP identified by the node identifier in the target blockchain state, and the target NVP When the third message is received, it retrieves the second block from its own blockchain, and when it retrieves the second block from its own blockchain, the block hash value of the second block becomes the second target block hash value. , all blocks whose block identifiers in their own blockchain are greater than the third target block identifier and less than or equal to the second target block identifier may be sent to this NVP.

Here, this target blockchain state is a target blockchain state whose block identifier is larger than the block identifier of the latest block in the blockchain of this NVP among the plurality of target blockchain states.

The third message is used to instruct the target NVP to send this NVP a block that is larger than the block identifier of the most recent block in this NVP's blockchain in its own blockchain. The third message carries a second target block identifier, a second target block hash value, and a third target block identifier. The second target block identifier is the block identifier in the target blockchain state, ie, the block identifier of one block that is not stored in the blockchain of this NVP. The second target block hash value is the block hash value in the target blockchain state, that is, the block hash value of one block that is not stored in the blockchain of this NVP. The third target block identifier is the block identifier of the latest block in this NVP's blockchain.

The second block is the block whose block identifier is the same as the second target block identifier.

In this case, after receiving the third message, the target NVP determines whether there is a block in its blockchain whose block identifier is the same as the second target block identifier (i.e., the second block). and if a second block is found to exist in its own blockchain, it compares the block hash value of the second block with the second target block hash value included in the third message. , if the block hash value of the second block is the same as the second target block hash value, it indicates that the second block is one of the blocks that is not stored within the blockchain of this NVP. , in this case, the block identifier in the target NVP's blockchain is greater than the block identifier of the most recent block in this NVP's blockchain (i.e., the third target block identifier), and the block identifier of the second block All blocks below the identifier (i.e., the second target block identifier) are blocks that are not stored within this NVP's blockchain. The target NVP may send to this NVP all blocks in its blockchain whose block identifier is greater than the third target block identifier and less than or equal to the second target block identifier. After receiving a block sent by a target NVP, this NVP can store the received block in its own blockchain and synchronize blocks that are not stored in its own blockchain, thereby Ensures that blocks stored on its own blockchain are the same as blocks stored on other NVP blockchains.

Preferably, during the execution of the blockchain system, one NVP may be added to any one NVP cluster among the m NVP clusters, and there is still no block in the blockchain of the added NVP. Since it may not be stored, the added NVP can synchronize all blocks stored on the blockchains of other NVPs in the NVP cluster in which it is located. In this case, the newly added NVP can perform the aforementioned steps of retrieving all blocks from the target NVP to synchronize the blocks stored on the blockchain of another NVP in the NVP cluster in which it is located. can.

The above describes in detail the operation in which any one NVP in each of m NVP clusters actively acquires a block that is not stored in its own blockchain from a target NVP. In our embodiment, when any one NVP in each of m NVP clusters discovers that some blocks in its own blockchain are missing, all the missing blocks are All missing blocks are actively retrieved from the target NVP to perform synchronization (i.e., point-to-point pull). In this way, system resources can be saved and block synchronization efficiency can be improved.

In the embodiment of the present application, the blockchain system includes a plurality of VPs and m NVP clusters, and m VPs of the plurality of VPs have a one-to-one correspondence with m NVP clusters, and m VPs have a one-to-one correspondence with m NVP clusters. Each of the NVP clusters includes a first NVP and at least one second NVP. The first NVP is an NVP that communicates with its corresponding VP and has a network path between the first NVP and each of the at least one second NVP, and thus is the first NVP in the NVP cluster. may communicate with the corresponding VP or with another NVP within the same NVP cluster. After multiple VPs complete consensus on a block and add this block to the blockchain, each of the m VPs sends the first message carrying this block to the first message in the corresponding NVP cluster. Send to NVP. If each NVP in each of the m NVP clusters receives the first message, the block carried by the first message is stored in the blockchain and the first message is sent to the neighboring NVP in the same NVP cluster. In this way, each NVP in each NVP cluster can synchronize this block. In this case, each of the m VPs can synchronize blocks by each NVP in the corresponding NVP cluster by simply sending a first message carrying the block to the first NVP in the corresponding NVP cluster. , thereby reducing the load on VP and improving block consensus efficiency.

FIG. 5 is a schematic structural diagram of a computer device according to an embodiment of the present application. As shown in FIG. 5, the computer device 5 includes a processor 50, a memory 51, and a computer program 52 stored in the memory 51 and executable by the processor 50, and when the processor 50 executes the computer program 52, the above-mentioned The steps of the block synchronization method in the embodiment are implemented.

The computing device 5 may be a server cluster including multiple servers, and the server cluster may be a blockchain system. As will be understood by those skilled in the art, FIG. 5 is only an example of a computer device 5 and is not limiting, and may include more or fewer parts than shown, or may include some parts. They may be combined or include different components, such as input/output devices, network access devices, and the like.

Processor 50 may be a central processing unit (CPU), or may include other general-purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), It may be a Field-Programmable Gate Array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc. A general purpose processor may be a microprocessor or any conventional processor.

Memory 51 may be an internal storage unit of computing device 5, such as a hard disk or memory of computing device 5, in some examples. In some other embodiments, the memory 51 is an external storage device of the computer device 5, such as a plug-in hard disk installed in the computer device 5, a Smart Media Card (SMC), a secure It may be a digital (Secure Digital, SD) card, a flash card, or the like. Furthermore, memory 51 may include both internal storage units of computing device 5 and external storage devices. Memory 51 is configured to store operating systems, application programs, boot loaders, data, other programs, and the like. Memory 51 may be configured to temporarily store data that has been or will be output.

Embodiments of the present application further provide a computer-readable storage medium on which a computer program is stored, which, when executed by a processor, can implement the steps in each of the method embodiments described above.

Embodiments of the present application provide a computer program product that, when executed on a computer, performs the steps of each of the method embodiments described above.

Based on this understanding, the present application provides that all or part of the flows in the above method embodiments can be accomplished by instructing the related hardware by a computer program, and the computer program The computer program, which can be stored on a readable storage medium and executed by a processor, can implement the steps of each of the method embodiments described above. A computer program includes computer program code, which may be in source code form, object code form, an executable file, some intermediate form, or the like. The computer readable medium may include at least any entity or device, recording medium, computer memory, ROM (Read-Only Memory), RAM (Random Access Memory) that can carry a computer program code to the imaging device/terminal device. ), CD-ROMs (Compact Disc Read-Only Memory, read-only optical discs), magnetic tapes, floppy disks, optical data storage devices, and the like. Computer-readable storage media referred to in this application may be non-volatile storage media, or in other words, non-transitory storage media.

It should be understood that all or part of the steps of the above embodiments may be implemented by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The computer instructions may be stored on the computer readable storage medium.

In the above embodiments, the emphasis of explanation in each embodiment is different from each other, and for parts that are not detailed or described in a certain embodiment, reference can be made to related explanations of other embodiments.

Those skilled in the art will appreciate that the example units and algorithm steps described in connection with the embodiments disclosed herein can be implemented by electronic hardware or a combination of computer software and electronic hardware. can do. Whether these functions are implemented in hardware or software depends on the particular application and design constraints of the proposed technology. A person skilled in the art may implement the described functionality using different methods for each particular application, and such implementation should be considered without going beyond the scope of the present application.

The above embodiments are only for explaining the technical solution of the present application, and are not intended to limit it. Although the present application has been described in detail with reference to the above embodiments, those skilled in the art can It is still possible to modify the technical solutions described in each of the above embodiments, or to make equivalent substitutions for some technical features therein, and these modifications or replacements are not equivalent to the corresponding technical solutions. It should be understood that without departing from the spirit and scope of the technical solutions of each embodiment of the present application, all of them should be included in the protection scope of the present application.

Claims (13)

A block synchronization method applied to a blockchain system, comprising:
The blockchain system includes a plurality of consensus node VPs and m non-consensus node NVP clusters, and m VPs of the plurality of VPs have a one-to-one correspondence with the m NVP clusters, Each of the m NVP clusters includes a first NVP and at least one second NVP, wherein the first NVP is an NVP that communicates with a corresponding VP, and where the first NVP and the at least has a network path between each of the one second NVP, where m is a positive integer;
The method includes:
Each time said plurality of VPs complete consensus for a block and add said block to the blockchain, each of said m VPs sends a first message carrying said block to the corresponding NVP cluster. transmitting to said first NVP within;
When each NVP in each of the m NVP clusters receives the first message, it stores the block carried in the first message in the blockchain and transfers the first message to all other NVP clusters in the same NVP cluster. including transmitting to an adjacent NVP;
A block synchronization method characterized by: before each of the m VPs sends the first message carrying the block to the first NVP in the corresponding NVP cluster;
The method includes:
Any one NVP cluster among the m NVP clusters selects a primary NVP by a dynamic selection method, and another NVP other than the primary NVP in the one NVP cluster is a secondary NVP, and the one a primary NVP within one NVP cluster is the first NVP, and a secondary NVP within the one NVP cluster is the second NVP;
The first NVP in the one NVP cluster sends a first notification message to the corresponding VP, and the first notification message is transmitted to the NVP in which the NVP sending the first notification message is located. further comprising: being used to indicate election as the primary NVP within the cluster;
2. The method according to claim 1, characterized in that: Any one NVP cluster among the m NVP clusters selects one primary NVP using a dynamic selection method.
After the one NVP cluster is activated globally, each of the at least one NVP in the one NVP cluster has a second NVP that carries its node identifier to another NVP in the one NVP cluster. broadcasting a message, the second message being used to indicate that the NVP identified by the node identifier carried in the second message applies as a primary NVP;
Any one of the at least one NVP is
receiving the second message broadcast by another NVP at a first predetermined time after the second message is broadcast;
Compare your own node identifier with the node identifier carried in the second message broadcast by the other NVPs received within the first predetermined period to determine whether you have been elected as the primary NVP. to determine,
Once it is determined that it has been elected as the primary NVP, a second notification message is sent to another NVP in the same NVP cluster every second predetermined time, said second notification message It is used to indicate that the NVP that sends the second notification message is elected as the primary NVP of the located NVP cluster, and that the NVP that receives the second notification message is the secondary NVP of the located NVP cluster. used to indicate, perform,
3. The method according to claim 2, characterized in that: The method includes:
If any one secondary NVP in the one NVP cluster does not receive the second notification message within a third predetermined time period, the second message is broadcast to another NVP in the same NVP cluster; the third predetermined time is longer than the second predetermined time;
When any one NVP in the one NVP cluster receives the second message broadcasted by the one secondary NVP, it sends its own node identifier and the second message broadcasted by the one secondary NVP. broadcasting the second message to other NVPs in the same NVP cluster if it is determined that the one secondary NVP cannot be elected as the primary NVP after comparing the carried node identifiers;
Any one NVP in the one NVP cluster is
the second message broadcast by another NVP is received at the first predetermined time after the second message was most recently broadcast;
Compares its own node identifier with the node identifier carried in the second message broadcast by the other NVP received at the first predetermined time to determine whether or not the node has been elected as the primary NVP. to decide,
When it is determined that the NVP is elected as the primary NVP, the second notification message is sent to other NVPs in the same NVP cluster at the second predetermined time intervals;
4. The method according to claim 3, characterized in that: the NVP has a node list, the node list including node identifiers of neighboring NVPs in the same NVP cluster;
When each NVP in each of the m NVP clusters receives the first message, it stores the block carried in the first message in the blockchain and transfers the first message to all other NVP clusters in the same NVP cluster. Sending to neighboring NVP is
Any one NVP in each of the m NVP clusters is
storing the block carried in the first message in its own blockchain when the first message is received;
if the received first message is from the corresponding VP, updating the first message by adding its own node identifier to the first message; and updating the first message by adding its own node identifier to the first message; to the NVP identified by each node identifier in the node list;
If the first message received is from an NVP within the same NVP cluster, the node identifier carried in the first message is determined as the target node identifier, and the first message is appended with its own node identifier. is added to update the first message, and the updated first message is sent to the NVP identified by each other node identifier other than the target node identifier in the node list. , execute,
including
2. The method according to claim 1, characterized in that: The first message generated by the VP further carries a message sequence number of the first message, and the message sequence number of the first message generated by the VP is incremented to Before the step of storing the block conveyed in the message on its own blockchain, the method includes:
When the first message is received, when the message sequence number of the most recently received first message is greater than the message sequence number of the previously received history first message, the first message further comprising: storing the block conveyed on its own blockchain;
6. The method according to claim 5, characterized in that: The method includes:
Any one NVP in each of the m NVP clusters is
receiving a check message generated by a corresponding VP, the check message carrying a first target block identifier and a first target block hash value;
searching for a first block in its blockchain that is a block whose block identifier is the same as said first target block identifier;
When the first block is detected in the own blockchain, if the block hash value of the first block is different from the first target block hash value, delete the first block from the own blockchain. to do, to carry out,
further including,
2. The method according to claim 1, characterized in that: The method includes:
Each NVP in each of the m NVP clusters sends a blockchain state to other neighboring NVPs in the same NVP cluster every fourth predetermined time, and the blockchain state is transmitted based on its own node identifier and Containing the block identifier of the most recent block in the blockchain;
Any one NVP in each of the m NVP clusters determines the blockchain state transmitted from the received neighboring NVP as a target blockchain state, and if the block is not received in a fifth predetermined time, If the block identifier of the latest block in the own blockchain is smaller than the block identifier in the target blockchain state, then the block identifier of the own block is removed from the target NVP's blockchain identified by the node identifier in the target blockchain state. further comprising: retrieving a block larger than the block identifier of the most recent block in the chain, and storing the retrieved block in the own blockchain;
2. The method according to claim 1, characterized in that: The blockchain state further includes a block hash value of the latest block in the blockchain, and the one NVP has a block identifier of its own from the blockchain of the target NVP identified by the node identifier in the target blockchain state. Obtaining a block that is larger than the block identifier of the latest block in the blockchain is
the one NVP sends a third message to the target NVP identified by a node identifier in the target blockchain state, the third message including a second target block identifier, a second target block hash value; , and a third target block identifier, wherein the second target block identifier is a block identifier in the target blockchain state, and the second target block hash value is a block hash value in the target blockchain state. and the third target block identifier is a block identifier of the latest block in the blockchain of the one NVP;
Upon receiving the third message, the target NVP retrieves a second block from its blockchain, the second block being a block whose block identifier is the same as the second target block identifier. If the block hash value of the second block is the same as the second target block hash value, then the block identifier in the own blockchain is the same as the second target block hash value. transmitting all blocks greater than three target block identifiers and less than or equal to the second target block identifier to the one NVP;
9. The method according to claim 8, characterized in that: the first message is an infectious disease protocol GOSSIP message;
2. The method according to claim 1, characterized in that: A blockchain system,
The blockchain system includes a plurality of consensus node VPs and m non-consensus node NVP clusters, and m VPs of the plurality of VPs have a one-to-one correspondence with the m NVP clusters, Each of the m NVP clusters includes a first NVP and at least one second NVP, wherein the first NVP is an NVP that communicates with a corresponding VP, and where the first NVP and the at least has a network path between each of the one second NVP, where m is a positive integer;
Each of the m VPs sends a first message carrying said block within the corresponding NVP cluster each time said plurality of VPs complete consensus for a block and add said block to the blockchain. to said first NVP of
Each NVP in each of the m NVP clusters stores the block carried in the first message in a blockchain if the first message is received, and stores the block carried in the first message in the same NVP. Send to neighboring NVPs in the cluster,
A blockchain system characterized by: A computer device,
A method according to any one of claims 1 to 10, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, when the computer program is executed by the processor. will be realized,
A computer device characterized by: A computer readable storage medium on which a computer program is stored,
When the computer program is executed by a processor, the method according to any one of claims 1 to 10 is implemented,
A computer-readable storage medium characterized by: