CN111935251A

CN111935251A - Block chain network management method, network, device, equipment and storage medium

Info

Publication number: CN111935251A
Application number: CN202010739859.XA
Authority: CN
Inventors: 刘昱; 李成才; 高勇; 邓柯
Original assignee: Chengdu Quality Starker Technology Co Ltd
Current assignee: Chengdu Quality Starker Technology Co Ltd
Priority date: 2020-07-28
Filing date: 2020-07-28
Publication date: 2020-11-13
Anticipated expiration: 2040-07-28
Also published as: CN111935251B

Abstract

Embodiments of the present invention provide a method, a network, a device, an apparatus, and a storage medium for managing a blockchain network, which can avoid the problem of blockchain forking when a new node joins the blockchain network. The block chain network management method comprises the following steps: a first node in the block chain network receives a node adding task, wherein the node adding task carries version information of a new node; the first node responds to the node joining task and judges whether the version of the new node is lower than that of the block chain network or not according to the version information of the block chain network and the version information of the new node; and under the condition that the version of the new node is not lower than that of the blockchain network, the first node determines that the new node can join the blockchain network.

Description

Block chain network management method, network, device, equipment and storage medium

Technical Field

The present invention relates to the field of communications technologies, and in particular, to a method, a network, an apparatus, a device, and a storage medium for managing a blockchain network.

Background

The blockchain technique is built on a transport network (e.g., a peer-to-peer network), in which distributed nodes (referred to as nodes) verify and store data using a chained data structure and employ a distributed node consensus algorithm to generate and update the data.

Since the transport network is used to support the blockchain technique, the transport network may also be referred to as a blockchain network. A blockchain network typically includes a plurality of nodes, each of which has a node program running therein. In practice, the blockchain network relies on the operation of multiple node programs and communication between node programs to realize generation, verification, uplink storage and the like of blockchain data.

The blockchain network needs to be managed during operation. Wherein, the addition of new nodes is an important link during the management of the blockchain network. However, in the prior art, when a new node is added to the blockchain network, the problem of blockchain forking is easily caused. Therefore, a new node adding scheme capable of avoiding the block chain bifurcation problem is urgently needed.

Disclosure of Invention

Embodiments of the present invention provide a method, a network, an apparatus, a device, and a storage medium for managing a blockchain network, which can avoid the problem of blockchain forking when a new node joins the blockchain network. The specific technical scheme is as follows:

in a first aspect of the embodiments of the present invention, a method for managing a blockchain network is provided, where the method includes:

a first node in the block chain network receives a node adding task, wherein the node adding task carries version information of a new node;

the first node responds to the node joining task and judges whether the version of the new node is lower than that of the block chain network or not according to the version information of the block chain network and the version information of the new node;

and under the condition that the version of the new node is not lower than that of the blockchain network, the first node determines that the new node can join the blockchain network.

A second aspect of the embodiments of the present invention provides a blockchain network, where the blockchain network includes a plurality of nodes, where any node in the plurality of nodes is used to receive a node join task, and the node join task carries version information of a new node;

the node responds to the node joining task, and judges whether the version of the new node is lower than that of the block chain network or not according to the version information of the block chain network and the version information of the new node;

and under the condition that the version of the new node is not lower than that of the blockchain network, the node determines that the new node can join the blockchain network.

In a third aspect of the embodiments of the present invention, there is provided a device for managing a blockchain network, where the device is applied to any node in the blockchain network, and the device includes:

the task receiving module is used for receiving a node adding task, wherein the node adding task carries version information of a new node;

the version judgment module is used for responding to the node joining task and judging whether the version of the new node is lower than that of the block chain network or not according to the version information of the block chain network and the version information of the new node;

an allowance determination module, configured to determine that the new node may join the blockchain network if the version of the new node is not lower than the version of the blockchain network.

In a fourth aspect of the embodiments of the present invention, an electronic device is provided, which includes a processor, a communication interface, a memory, and a communication bus, where the processor and the communication interface complete communication between the memory and the processor through the communication bus;

the memory is used for storing a computer program;

the processor is configured to implement the method for managing the blockchain network according to any embodiment of the present invention when executing the program stored in the memory.

In a fourth aspect of the embodiments of the present invention, a computer-readable storage medium is provided, on which a computer program is stored, and the computer program, when executed by a processor, implements the method for managing a blockchain network provided in any of the embodiments of the present invention.

The invention introduces the concept of version for the blockchain network, and when a first node in the blockchain network receives a node joining task, the first node can compare the version information of a new node with the version information of the blockchain network to judge whether the version of the new node is lower than that of the blockchain network. If the version of the new node is not lower than that of the blockchain network, it indicates that the version of the new node is sufficiently new (i.e. the version of the new node is not lower), so the following situations do not occur after the new node joins the blockchain network: and the new node cannot normally process the transaction tasks which can be processed by other nodes due to the low version of the new node.

Because the situation can not occur after the new node is added into the block chain network, each node in the block chain network can obtain a normal processing result when processing the same transaction task, and the block chain bifurcation problem can be avoided. Therefore, in the invention, the first node determines that the new node can be added into the blockchain network only when the version of the new node is not lower than that of the blockchain network, and the problem of blockchain bifurcation can be avoided when the new node is added into the blockchain network.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below. It is obvious that the drawings in the following description are only some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.

Fig. 1 is a schematic diagram of a block chain network according to an embodiment of the present invention;

fig. 2 is a flowchart of a method for managing a blockchain network according to an embodiment of the present invention;

fig. 3 is a flowchart of a method for managing a blockchain network according to another embodiment of the present invention;

FIG. 4 is a diagram illustrating a transaction task execution process according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of a transaction task execution process according to another embodiment of the present invention;

fig. 6 is a schematic diagram illustrating a version updating process of a blockchain network according to an embodiment of the present invention;

fig. 7 is a block chain network management apparatus according to an embodiment of the present invention;

fig. 8 is a schematic diagram of an electronic device according to an embodiment of the invention.

Detailed Description

The technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. It is to be understood that the embodiments described are only a few embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

In the related art, a blockchain network generally includes a plurality of nodes, and each node has a node program running therein. The block chain network realizes generation, verification, uplink storage and the like of block data by means of operation of a plurality of node programs and communication among the node programs. The blockchain network needs to be managed during operation. Wherein, the addition of new nodes is an important link during the management of the blockchain network. However, in the prior art, when a new node is added to the blockchain network, the problem of blockchain forking is easily caused. Therefore, a new node adding scheme capable of avoiding the block chain bifurcation problem is urgently needed at present.

To this end, the present invention provides a blockchain network, as shown in fig. 1, the blockchain network includes N existing nodes, which are node 1 to node N, respectively. The node programs run by the N nodes are basically the same but the versions are not necessarily uniform. For convenience of understanding, for example, a part of the nodes run the node programs of the version 2.0, and another part of the nodes run the node programs of the version 3.0. The node program of the high version (3.0 version) can be downward compatible with the node program of the low version (2.0 version). In other words, the low-version node program can process the transaction task, and the high-version node program can process the transaction task. While a transaction task can be processed by a high-version node program, a transaction task cannot be processed by a low-version node program. For convenience of description, the "node program version of the node" will be simply referred to as "version of the node" hereinafter.

In the present invention, the blockchain network also has a concept of version, and the version of the blockchain network is used for characterizing: and the processing capacity of the blockchain network on the transaction task. The version of the blockchain network corresponds to the lowest node version in the blockchain network, and specifically, the version of the blockchain network is lower than or equal to the lowest node version in the blockchain network. For the sake of understanding, following the above example, since the version of a part of nodes in the blockchain network is 2.0 and the version of another part of nodes is 3.0, the version of the blockchain network is 2.0 or lower than 2.0.

Since the version of the present blockchain network corresponds to the version of the lowest node in the blockchain network, the version of the blockchain network specifically reflects: and processing capacity of the lowest node version in the blockchain network on the transaction task. The following of the present invention will describe how to update the version of the blockchain network, and the present invention is not described herein again.

As shown in fig. 1, when a new node (i.e., node N +1 in fig. 1) wants to join the blockchain network, a node joining task (such as a solid arrow shown in fig. 1) is sent to any node (hereinafter referred to as a second node) in the blockchain network, where the node joining task includes the following information:

(1) the information used for reflecting the node version of the new node is called as the version information of the new node in the invention;

(2) the information for distinguishing the identity of the new node is referred to as the node identifier of the new node in the invention.

As shown in fig. 1, after receiving a node join task sent by a new node, the second node sends the node join task to each node in the blockchain network (as shown by the solid arrow in fig. 1). In some embodiments, the second node also sends itself the node join task. And each node responds to the node joining task after receiving the node joining task sent by the second node. For convenience of description, taking a first node of a plurality of nodes as an example, the first node performs the following determination when a responding node joins a task:

(1) the first node judges whether the version of the new node is lower than that of the blockchain network or not according to the version information of the blockchain network and the version information of the new node;

(2) the first node also obtains a node statistical list, the node statistical list comprises node identifications of nodes existing in the block chain network, and the first node judges whether the node statistical list comprises the node identification of the new node.

And if the version of the new node is not lower than that of the blockchain network and the node statistical list does not contain the node identification of the new node, the first node determines that the new node can be added into the blockchain network. On the contrary, if the version of the new node is lower than that of the blockchain network or the node statistical list already contains the node identifier of the new node, the first node determines that the new node cannot join the blockchain network or determines that the new node does not join the blockchain network any more.

As shown in fig. 1, in the case that the first node determines that the new node can join the blockchain network, specifically, the first node sends a network change event (shown as a dotted arrow in fig. 1) to other nodes in the blockchain network, where the network change event includes: and the node adds the task identifier of the task and the node identifier of the new node. It should be noted that the first node is one of the nodes in the blockchain network, and the response mode of the other nodes in the blockchain network to the node joining task after receiving the node joining task is the same as the above response mode of the first node. To simplify the drawing, "network change event" is schematically represented as "event" in fig. 1.

As shown in fig. 1, the first node also receives a network change event, which may be sent by itself or sent by other nodes to the first node after completing the above two determinations. To simplify the drawing, specifically who sent the network change event to the first node is not shown in fig. 1. After receiving a network change event, the first node acquires a task identifier and a node identifier from the network change event, and performs the following judgment:

(1) judging whether the node corresponding to the task identifier is received previously to join the task;

(2) judging whether the node corresponding to the task identifier is successfully executed to join the task or not;

(3) and judging whether the node statistical list contains the node identification.

If the first node obtains the following judgment result: and if the node counting list does not contain the node identification, the first node records the node identification into the node counting list. Otherwise, the first node does not record the node identification in its node statistics list.

The first node is one of the nodes in the blockchain network, and the other nodes in the blockchain network respond to the network change event after receiving the network change event in the same manner as the first node. After the above interaction between the nodes in the blockchain network, the node identification of the new node is recorded in the node statistical list of each node, which is equivalent to the fact that each node adds the new node to achieve consensus, and is also equivalent to the fact that the new node is incorporated into the blockchain network.

During the implementation of the invention, a concept of version is introduced for the blockchain network, and when a first node in the blockchain network receives a node joining task, the first node compares the version information of the new node with the version information of the blockchain network to judge whether the version of the new node is lower than that of the blockchain network. If the version of the new node is not lower than that of the blockchain network, it indicates that the version of the new node is sufficiently new (i.e. the version of the new node is not lower), so the following situations do not occur after the new node joins the blockchain network: and the new node cannot normally process the transaction tasks which can be processed by other nodes due to the low version of the new node.

The situation can not occur after the new node is added into the blockchain network, so that the same processing result can be obtained when each node in the blockchain network processes the same transaction task, and the block chain bifurcation problem can be avoided. Therefore, in the invention, the first node determines that the new node can be added into the blockchain network only when the version of the new node is not lower than that of the blockchain network, and the problem of blockchain bifurcation can be avoided when the new node is added into the blockchain network.

It should be noted that the above description is provided as a preferred embodiment of the embodiments of the present invention. The present invention provides a method, a network, an apparatus, a device and a storage medium for managing a blockchain network according to the following embodiments. Some of the following embodiments include only some of the features of the preferred embodiments described above, and some of the following embodiments include all of the features of the preferred embodiments described above. In other words, the above-described preferred embodiments of the present invention, as an example, should not be construed as limiting the invention.

Referring to fig. 2, fig. 2 is a flowchart of a method for managing a blockchain network according to an embodiment of the present invention. As shown in fig. 2, the method comprises the steps of:

step S21: and a first node in the block chain network receives a node adding task, wherein the node adding task carries the version information of the new node.

Wherein the version information of the new node is information for reflecting the version of the new node. In some embodiments, the version information of the new node may be directly a version number of a node program of the new node, such as "2.0", "3.0", and the like.

In other embodiments, the version information of the new node may also be task version information of the node joining the task. In the invention, the node adding task is generated and sent by the new node, and the task version information of the node adding task corresponds to the node program version of the new node, so the task version information of the node adding task can reflect the node program of the new node. Thus, in these embodiments, the version information of the new node may replace the task version information of joining the task for the node.

In some embodiments, the node joining task received by the first node may be sent directly to the first node by the new node. Referring to the preferred embodiment, the new node in fig. 1 sends a node join request to the node 3, and if the node 3 is regarded as a first node, the node join task received by the first node is directly sent to the first node by the new node.

In other embodiments, the node joining task received by the first node may also be sent by the first node itself. Referring to the foregoing preferred embodiment, the new node in fig. 1 sends a node join request to the node 3, and after receiving a node join task sent by the new node, the node 3 sends the node join task to each node in the blockchain network. At the same time, node 3 also sends itself the node join task. If the node 3 is regarded as the first node, the node received by the first node joins the task, and the node can also be sent by the first node itself.

In some embodiments, the node joining task received by the first node may also be sent by a second node in the blockchain network. Referring to the foregoing preferred embodiment, the new node in fig. 1 sends a node join request to the node 3, and after receiving a node join task sent by the new node, the node 3 sends the node join task to each node in the blockchain network. And if the node 3 is regarded as a second node and the node 1 is regarded as a first node, the second node in the block chain network receives the node adding task sent by the new node, and sends the node adding task to each node in the block chain network. In this way, the first node acts as one of the nodes, and the node joining task received by the first node is sent by the second node in the blockchain network.

The present invention is intended to illustrate and demonstrate, by way of example, the various embodiments described above: the invention does not limit how the first node receives the node joining task.

Step S22: and the first node responds to the node joining task and judges whether the version of the new node is lower than that of the blockchain network or not according to the version information of the blockchain network and the version information of the new node.

Wherein the version information of the blockchain network may be trusted data stored on the blockchain. In some embodiments, when the first node responds that the node joins the task, the first node may query the blockchain to obtain the version information of the blockchain network, and at the same time, the first node may obtain the version information of the new node from the node joining the task. After inquiring the version information of the blockchain network and the version information of the new node, the first node compares the two version information to judge whether the version of the new node is lower than that of the blockchain network.

For convenience in understanding, it is assumed that the version information of the blockchain network queried by the first node is 2.0, and the version information of the new node acquired by the first node is 3.0, it is described that the version of the blockchain network is 2.0, the version of the new node is 3.0, and it is seen that the version of the new node is not lower than the version of the blockchain network.

Step S23: and under the condition that the version of the new node is not lower than that of the blockchain network, the first node determines that the new node can join the blockchain network.

Wherein the first node determines that the new node can join the blockchain network, it may be understood that the first node allows the new node to join the blockchain network.

In the present invention, if the version of the new node is not lower than the version of the blockchain network, it indicates that the version of the new node is sufficiently new (i.e. the version of the new node is not lower), so the following situations do not occur after the new node is added to the blockchain network: and the new node cannot normally process the transaction tasks which can be processed by other nodes due to the low version of the new node.

In addition, if the version of the new node is lower than that of the blockchain network, it indicates that the version of the new node is not new enough (i.e., the version of the new node is lower), and therefore the following situations may occur after the new node joins the blockchain network: and the new node cannot normally process the transaction tasks which can be processed by other nodes due to the low version of the new node.

Since the situation may occur after a new node is added into the blockchain network, when each node in the blockchain network processes the same transaction task, it cannot be ensured that each node obtains a normal processing result, and thus the block chain bifurcation problem is difficult to avoid. Thus, in the present invention, the first node determines that the new node cannot join the blockchain network in the case where the version of the new node is lower than the version of the blockchain network.

Referring to fig. 3, fig. 3 is a flowchart of a method for managing a blockchain network according to another embodiment of the present invention. As shown in fig. 3, the method comprises the steps of:

step S31: and the first node in the block chain network receives a node adding task, wherein the node adding task carries the version information of the new node and also carries the node identification of the new node. The node identifier is information for distinguishing the identity of the new node.

Step S32: and the first node responds to the node joining task and judges whether the version of the new node is lower than that of the blockchain network or not according to the version information of the blockchain network and the version information of the new node.

Some specific embodiments of step S31 and step S32 are described above, and the present invention is not described herein again.

Step S33-1: and the first node responds to the node joining task to obtain a node statistical list, wherein the node statistical list comprises node identifications of nodes existing in the block chain network.

In some embodiments, the node statistics list is a local list of the first node. In other words, the first node locally stores the node statistics list, and the first node can directly obtain the node statistics list from local. Similarly, each of the other nodes of the blockchain network also has a locally stored node statistics list.

In the invention, each node corresponds to a node identifier for distinguishing node identities. The node statistical list includes node identifiers of existing nodes of the block chain network. For ease of understanding, as shown in fig. 1, the blockchain network already includes nodes 1 to N, and the node statistics list includes node identifiers of the nodes 1 to N, respectively.

Step S33-2: and the first node judges whether the node statistical list contains the node identification of the new node.

The first node determines whether the new node is an existing node in the block chain network by judging whether the node statistical list contains the node identification of the new node or not, so that the network overhead of the block chain network, which is caused by the fact that the block chain network is disordered and the block chain network is unnecessarily increased due to the fact that node adding operation is executed on the existing node, is avoided.

In the present invention, the first node performs two determinations in response to the node joining task, one of which is the determination described in step S32, and the other of which is the determination described in step S33-2. When the first node executes the two judgments, the execution sequence of the two judgments is not limited.

Step S34: and under the condition that the version of the new node is not lower than that of the blockchain network and the node statistical list does not contain the node identification of the new node, the first node and other nodes in the blockchain network execute a preset consensus strategy so as to record the node identification of the new node into the node statistical list.

If the version of the new node is not lower than that of the blockchain network, the version of the new node is sufficiently new, and even if the new node is added into the blockchain network, the block chain bifurcation problem can be avoided. If the node statistical list does not contain the node identification of the new node, the new node is not the existing node of the block chain network, and no problem is caused when the adding operation is executed on the new node. Therefore, the first node determines that the new node can be added into the blockchain network only under the condition that the version of the new node is not lower than that of the blockchain network and the node statistical list does not contain the node identification of the new node. Otherwise, the first node determines that the new node cannot join the blockchain network.

When the first node determines that the new node can join the blockchain network, the first node and other nodes in the blockchain network execute a preset consensus strategy so as to record the node identification of the new node into a node statistical list.

In some embodiments of the present invention, the step of the first node executing the preset consensus policy with other nodes in the blockchain network may include the following sub-steps:

substep S34-1: the first node sends a network change event to other nodes in the block chain network, wherein the network change event comprises: and the node adds the task identifier of the task and the node identifier of the new node.

The task identifiers of the node joining tasks are information used for distinguishing the node joining tasks, and are similar to the serial numbers of the node joining tasks, and different node joining tasks respectively correspond to different task identifiers.

In the present invention, after the first node performs the above two determinations of step S32 and step S33-2, if the following determination results are obtained: and if the version of the new node is not lower than that of the blockchain network and the node statistical list does not contain the node identifier of the new node, the first node sends a network change event to other nodes in the blockchain network, and aims to add the new node into the event to be identified with other nodes.

Substep S34-2: the first node receives a network change event sent by the first node, or receives a network change event sent by other nodes in the block chain network; the first node acquires the task identifier and the node identifier from the network change event, and judges as follows: judging whether the node adding task corresponding to the task identifier is received previously, judging whether the node adding task corresponding to the task identifier is successfully executed, and judging whether the node statistical list comprises the node identifier; if the first node obtains the following judgment result: and if the first node has previously received the node joining task corresponding to the task identifier, has successfully executed the node joining task corresponding to the task identifier, and does not contain the node identifier in the node counting list, the first node records the node identifier in the node counting list.

As shown in the foregoing preferred embodiment, the first node also receives a network change event, which may be sent by the first node itself or sent by other nodes that have already completed the determination and obtained the determination result. The first node, in response to the network change event, performs the following determination:

(1) and judging whether the first node receives the node corresponding to the task identifier to join the task previously.

The first node performs this determination with the purpose of: verifying whether other nodes are doing bad. If the first node does not receive the node adding task corresponding to the task identification in advance, the first node indicates that at least one link in the whole node adding process is badly done. For example, a node may be rogue such that the first node has not previously received a node join task. Or, for example, a node acting wrongly, intentionally falsify a network change event. No matter what kind of attack is done, the blockchain network is proved to be attacked. Therefore, the first node can determine whether the blockchain network is attacked by performing the above determination. In short, if the first node does not receive the node joining task corresponding to the task identifier in advance, the first node does not record the node identifier into the node statistical list.

(2) And judging whether the first node per se successfully executes the node joining task corresponding to the task identifier.

Wherein, the first node successfully executing the node joining task means: after the first node performs the above two determinations of step S32 and step S33-2, the following determination results are obtained: the version of the new node is not lower than that of the block chain network, and the node statistical list does not contain the node identification of the new node. Otherwise, if the judgment result is not obtained, the first node is indicated to not successfully execute the node joining task.

The first node performs this determination with the purpose of: and exerting the decision-making power owned by the node in the task joining by the node. In the invention, when the first node receives the network change event sent by other nodes, the first node indicates that the other nodes have successfully executed the node joining task. And if the first node cannot successfully execute the node joining task, the first node and other nodes respectively obtain different execution results when respectively executing the node joining task. Therefore, the first node makes a corresponding response by judging whether the first node succeeds in joining the task by the node and according to the success or not of execution, thereby exerting the decision right of the first node in joining the task by the node. Specifically, if the first node fails to successfully perform the node join task, the first node will not post the node identification to its node statistics list.

It should be noted that, since each node in the blockchain network performs a response procedure of the first node to the node joining the task (as in the above steps S31, S32, S33-1, S33-2, and S34-1), each node sends a network change event to other nodes after obtaining the above determination result. Thus, the first node may receive the network change events sent by the multiple nodes in sequence. Assuming that the first node has already received the node joining task and has already successfully executed the node joining task when the first node receives the first network change event, the first node records the node identifier of the new node in its node statistics list. After the first node subsequently receives the second and third network change events …, etc., the first node no longer records the node identifier of the new node into the node statistics list because the node statistics list of the first node already contains the node identifier of the new node.

In short, the first node performs the above three determinations each time it receives a network change event. If and only if the judgment results of the three judgments are respectively: the first node receives the node adding task corresponding to the task identifier in advance, the first node successfully executes the node adding task corresponding to the task identifier, and the node counting list of the first node does not contain the node identifier, and the first node records the node identifier into the node counting list so as to update the node counting list.

It should be noted that, in the above embodiment, the process of the first node sending the network change event, receiving the network change event, performing the three determinations, and updating the node statistics list according to the determination result may be regarded as a consensus process between the first node and other nodes, that is, the consensus policy.

In the above embodiment, on one hand, by determining whether the version of the new node is lower than that of the blockchain network and limiting the addition of the new node according to the determination result, the problem of blockchain forking caused by the addition of the new node can be effectively avoided. On the other hand, whether the node identification of the new node is already contained in the node statistical list is judged to determine whether the new node is actually an existing node of the blockchain network, so that the situation that the blockchain network is disordered and the network overhead is increased unnecessarily due to repeated node adding operation on the existing node is avoided. In a third aspect, by executing the above consensus process, the new node joins the event to achieve consensus among the nodes, and further the node statistical lists of the nodes achieve data consensus.

In addition, each node of the blockchain network can execute a transaction task before the execution node joins the task, during the execution node joins the task, or after the execution node joins the task. Referring to fig. 4, fig. 4 is a schematic diagram of a transaction task execution process according to an embodiment of the present invention. As shown in fig. 4, the implementation includes the following steps:

step S41: the first node receives transaction tasks sent by other nodes in the block chain network, the transaction tasks carry node identifiers of the nodes sending the transaction tasks, and the transaction tasks are signed transaction tasks.

In some embodiments, the transaction task may be generated and sent by the client, and after receiving the transaction task sent by the client, a certain node in the blockchain network sends the transaction task to each node in the blockchain network. And the first node is used as one of the nodes and receives the transaction task sent by the node.

In other embodiments, the transaction task may also be automatically generated by the node in the blockchain network according to an initial procedure of the node, for example, the transaction task may be a heartbeat detection task periodically generated by the node. After a certain node automatically generates a transaction task, the transaction task is sent to the first node.

In the invention, the transaction task carries the node identification of the node sending the transaction task, and the transaction task is the signed transaction task. For understanding, it is assumed that the node 3 generates a transaction task, then the node 3 fills the node identifier of the node 3 in the transaction task, then the node 3 signs the transaction task by using its private key, and finally the node 3 sends the signed transaction task to the first node.

Step S42: and the first node acquires the node identification from the transaction task and judges whether the node statistical list contains the node identification.

In the invention, after the first node receives the transaction task, the first node responds to the transaction task, and extracts the node identification from the transaction task and judges whether the node identification is contained in the node statistical list or not. The first node determines whether the node sending the transaction task is an existing node in the blockchain network by performing the above determination.

Step S43: and under the condition that the node statistical list of the first node does not contain the node identifier, the first node does not execute the transaction task, or the execution result of the transaction task is represented as execution failure.

In the invention, if the node statistical list of the first node does not contain the node identifier, the node sending the transaction task is not an existing node in the blockchain network, and further the node is possibly harmful to the blockchain network. In this way, in the case that the node statistics list of the first node does not include the node identifier, the first node may not execute the transaction task, or may indicate the execution result of the transaction task as an execution failure.

Step S44: and under the condition that the node statistical list of the first node contains the node identification, the first node acquires a public key corresponding to the node identification and utilizes the public key to check and sign the transaction task.

In the invention, if the node statistical list of the first node contains the node identifier, the node sending the transaction task is the existing node in the block chain network. Therefore, the first node acquires the public key corresponding to the node identifier, namely the public key of the node, and verifies the signed transaction task by using the public key.

Step S45: and in the case of failing to pass the verification, the first node does not execute the transaction task or represents the execution result of the transaction task as execution failure.

In the invention, if the signed transaction task fails to pass the signature verification, the initiator of the transaction task is not corresponding to the node identifier in the transaction task. One possible reason is: the transaction initiator is a malicious node, fills in node identifiers of other nodes in the transaction task, and signs the transaction task by using the private key of the transaction initiator because the transaction initiator does not have the private key of the other nodes. As can be seen, if the signed transaction task fails to pass the signature verification, which indicates that the blockchain network is attacked, the first node may not execute the transaction task, or may represent the execution result of the transaction task as an execution failure.

In the invention, by executing the transaction task in the manner, the risk that the block chain network encounters network attack can be effectively reduced, and the safety of the block chain network in the service development period is improved.

Referring to fig. 5, fig. 5 is a schematic diagram of a transaction task execution process according to another embodiment of the present invention. As shown in fig. 5, the implementation includes the following steps:

step S51: the first node obtains a transaction task, and the transaction task carries task version information.

In the invention, the transaction task carries task version information, and the task version information is used for representing the version of the transaction task. Illustratively, the task version information may be in the form of a version number. For example, if the version number of a certain transaction task is 3.0, the task version information carried by the transaction task is "3.0". It should be noted that the present invention does not limit the specific form of the task version information.

In particular, the task version information corresponds to the node version of the node that initiated the transaction task. For the sake of understanding, it is assumed that a node program running in a certain node is of a 2.0 version, a transaction task initiated by the node is also of a 2.0 version, and task version information of the transaction task is correspondingly "2.0".

Step S52: and the first node judges whether the version of the transaction task is higher than that of the blockchain network or not according to the version information of the blockchain network and the task version information, wherein the version of the blockchain network corresponds to the version of the lowest node in the blockchain network.

As described in the foregoing preferred embodiment, the version of the blockchain network corresponds to the version of the lowest node in the blockchain network, specifically: the version of the blockchain network is not higher than the version of the lowest node in the blockchain network. In the invention, the version of the blockchain network reflects that: and (3) each node of the block chain network has the lowest processing capacity for the transaction task in the processing capacity for the transaction task.

After receiving the transaction task, the first node compares the version of the transaction task with the version of the blockchain network, so as to judge whether the node with the lowest processing capability in the blockchain network has the capability of processing the transaction task.

Step S53: the first node executes the transaction task if the version of the transaction task is not higher than the version of the blockchain network.

In the invention, if the version of the transaction task is not higher than that of the blockchain network, the version of the transaction task is not higher than that of the lowest node in the blockchain network, and further the node with the lowest processing capability in the blockchain network is described to have the capability of normally processing the transaction task. Therefore, a plurality of nodes in the block chain network can normally process the transaction task and obtain a normal processing result, and block chain branching can be avoided.

Therefore, in the invention, the first node executes the transaction task under the condition that the version of the transaction task is not higher than that of the blockchain network. Otherwise, the first node does not execute the transaction task, or the execution result of the transaction task is represented as execution failure.

In addition, in consideration of the fact that the node joining task in the foregoing embodiment is a task generated and sent by a new node, the node joining task may also carry task version information. For convenience of understanding, it is assumed that the version of the node program in the new node is 3.0, the task version of the node joining task generated by the new node is 3.0, and the task version information carried in the node joining task is correspondingly "3.0".

After receiving the node join task, the first node in the blockchain network may respond to the node join task in the manner of the above steps S51 to S53, and thus may cause a problem that the new node cannot join the network. For example, the version of the node program in the new node is 3.0, the task version information carried in the node joining task is correspondingly "3.0", and the version of the blockchain network is 2.0. At this time, the version of the new node is not lower than that of the blockchain network, and according to the node joining method embodiment (corresponding to fig. 2), the new node is allowed to join the blockchain network. However, according to the aforementioned transaction execution embodiment (corresponding to fig. 5), the first node does not execute the node join task, or directly indicates the node join task as an execution failure. It can be seen that the two embodiments conflict here.

In some embodiments of the present invention, to resolve the conflict, a node in the blockchain network may regard a node joining task as a special task, and when the node receives the node joining task, the node may respond to the node joining task by default regardless of a high-low relationship between a node joining task version and a blockchain network version. In other words, the first node responds to the node joining the task when the version of the node joining the task is higher than, lower than or equal to the version of the blockchain network.

In addition, each node of the blockchain network can also execute the version updating task of the blockchain network before the execution node joins the task, during the execution node joins the task, or after the execution node joins the task. Referring to fig. 6, fig. 6 is a schematic diagram illustrating a version updating process of a blockchain network according to an embodiment of the present invention. As shown in fig. 6, the update process includes the following steps:

step S61: and the third node in the block chain network acquires the version information of each node in the block chain network.

Wherein the third node may be any node in a blockchain network. In some embodiments, the third node may be a master node selected by each node in the blockchain network through a consensus algorithm.

In a specific implementation, the third node may periodically send the version information obtaining request to each node in the blockchain network, for example, send the version information obtaining request to each node in the blockchain network once every 6 hours. Each node responds to the version information acquisition request and returns the version information of the node to the third node.

Step S62: and the third node judges whether the version of each node is higher than that of the blockchain network or not according to the obtained version information and the version information of the blockchain network.

In concrete implementation, after obtaining the version information of each node in the current period, the third node judges whether the version of each node is higher than that of the block chain network. For convenience of understanding, it is assumed that in the current cycle, version information of a part of nodes is "2.0", version information of another part of nodes is "3.0", and version information of the blockchain network is "1.0", and then versions of the nodes are all higher than that of the blockchain network.

Or if the version information of a part of nodes is "2.0", the version information of another part of nodes is "3.0", and the version information of the blockchain network is "2.0" in the current period, the versions of the nodes are not all higher than the version of the blockchain network.

Or, assuming that the version information of all nodes is "3.0" and the version information of the blockchain network is "2.0" in the current period, the version of each node is higher than that of the blockchain network.

Step S63: and under the condition that the version of each node is higher than the version of the blockchain network, controlling the version information of the blockchain network to be updated, so that the updated version information corresponds to the lowest node version in the blockchain network.

In the invention, if the version of each node is higher than that of the blockchain network, the version information of the blockchain network is more old, and needs to be updated, so that the updated version information corresponds to the lowest node version in the blockchain network.

In some embodiments, in order to control version information update of the blockchain network, the third node may encapsulate version information of each node into a version update task. And the third node sends the version updating task to each node of the block chain network. After each node receives the version updating task, the version information of each node is obtained from the version updating task, and the obtained version information is compared with the version information of the block chain network, so that the version of each node is judged to be higher than that of the block chain network. If the version of each node is higher than that of the blockchain network, the node updates the version information of the blockchain network, so that the updated version information of the blockchain network is the same as the version information of the lowest node version in the blockchain network. And finally, each node identifies the updated block chain network version information.

Based on the same inventive concept, the embodiment of the invention also provides a block chain network management device. Referring to fig. 7, fig. 7 is a schematic diagram of a device for managing a blockchain network according to an embodiment of the present invention, the device being applied to any node in the blockchain network. As shown in fig. 7, the apparatus includes:

the task receiving module 71 is configured to receive a node joining task, where the node joining task carries version information of a new node;

a version determining module 72, configured to respond to the node joining task, and determine whether the version of the new node is lower than the version of the blockchain network according to the version information of the blockchain network and the version information of the new node;

an allowance determination module 73, configured to determine that the new node may join the blockchain network if the version of the new node is not lower than the version of the blockchain network.

Optionally, the node joining task also carries a node identifier of the new node, and the apparatus further includes: a statistical list obtaining module and a statistical list judging module;

the statistical list obtaining module is configured to obtain a node statistical list in response to the node joining task, where the node statistical list includes a node identifier of an existing node in the block chain network;

the statistical list judging module is used for judging whether the node statistical list contains the node identification of the new node;

the permission determination module is specifically configured to: and under the condition that the version of the new node is not lower than that of the blockchain network and the node statistical list does not contain the node identification of the new node, executing a preset consensus strategy with other nodes in the blockchain network so as to record the node identification of the new node into the node statistical list.

Optionally, the node joining task is that the new node is sent to a second node in the blockchain network, and then the second node broadcasts to the blockchain network management device.

Optionally, when the permission determining module executes a preset consensus policy with other nodes in the blockchain network, the permission determining module is specifically configured to:

sending a network change event to other nodes in the blockchain network, wherein the network change event comprises: the node adds the task identifier of the task and the node identifier of the new node;

receiving a network change event sent by the node itself or receiving a network change event sent by other nodes in the block chain network; acquiring a task identifier and a node identifier from the network change event, and judging as follows: judging whether the node adding task corresponding to the task identifier is received previously, judging whether the node adding task corresponding to the task identifier is successfully executed, and judging whether the node statistical list comprises the node identifier; if the following judgment result is obtained: and if the node counting list does not contain the node identification, the node identification is recorded in the node counting list.

Optionally, the apparatus further comprises: a first execution module of a transaction task;

the first transaction task execution module is used for receiving transaction tasks sent by other nodes in the block chain network, wherein the transaction tasks carry node identifiers of the nodes sending the transaction tasks, and the transaction tasks are signed transaction tasks; acquiring a node identifier from the transaction task, and judging whether a node statistical list contains the node identifier; under the condition that the node statistical list does not contain the node identifier, the transaction task is not executed, or the execution result of the transaction task is represented as execution failure; and under the condition that the node statistical list contains the node identification, acquiring a public key corresponding to the node identification, and checking the signature of the transaction task by using the public key, and under the condition that the signature is not checked, not executing the transaction task or representing the execution result of the transaction task as execution failure.

Optionally, the apparatus further comprises: a transaction task second execution module;

the transaction task second execution module is used for acquiring a transaction task, and the transaction task carries task version information; judging whether the version of the transaction task is higher than that of the blockchain network or not according to the version information of the blockchain network and the task version information, wherein the version of the blockchain network corresponds to the version of the lowest node in the blockchain network; executing the transaction task if the version of the transaction task is not higher than the version of the blockchain network.

Optionally, the node joining task is generated and sent by the new node, and the node joining task carries task version information; and under the condition that the version of the node joining task is higher than, lower than or equal to that of the blockchain network, the second execution module of the transaction task responds to the node joining task.

For the device embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.

Based on the same inventive concept, an embodiment of the present invention further provides an electronic device, as shown in fig. 8, including a processor 801, a communication interface 802, a memory 803, and a communication bus 804, where the processor 801, the communication interface 802, and the memory 803 complete communication with each other through the communication bus 804.

The memory 803 is used for storing computer programs;

the processor 801 is configured to, when executing the program stored in the memory 803, implement the following steps:

Alternatively, the processor 801 is configured to implement the steps of the blockchain network management method provided by the above other method embodiments of the present invention when executing the program stored in the memory 803.

The communication bus mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.

The communication interface is used for communication between the electronic equipment and other equipment.

The Memory may include a Random Access Memory (RAM) or a non-volatile Memory (non-volatile Memory), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.

The Processor may be a general-purpose Processor, and includes a Central Processing Unit (CPU), a Network Processor (NP), and the like; the Integrated Circuit may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, a discrete Gate or transistor logic device, or a discrete hardware component.

In another embodiment of the present invention, there is also provided a computer-readable storage medium having stored therein instructions, which when executed on a computer, cause the computer to execute the method for managing a blockchain network according to any one of the above embodiments.

In yet another embodiment of the present invention, there is also provided a computer program product containing instructions which, when run on a computer, cause the computer to perform the method for blockchain network management as described in any of the above embodiments.

In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may 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. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.

It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.

All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.

The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.

Claims

1. A method for block chain network management, the method comprising:

2. The method according to claim 1, wherein the node join task further carries a node identifier of the new node, and the method further comprises:

the first node responds to the node joining task and obtains a node statistical list, wherein the node statistical list comprises node identifications of nodes existing in the block chain network;

the first node judges whether the node statistical list contains the node identification of the new node or not;

the determining, by the first node, that the new node can join the blockchain network in the case that the version of the new node is not lower than the version of the blockchain network includes:

and under the condition that the version of the new node is not lower than that of the blockchain network and the node statistical list does not contain the node identification of the new node, the first node and other nodes in the blockchain network execute a preset consensus strategy so as to record the node identification of the new node into the node statistical list.

3. The method of claim 2, wherein prior to the first node in the blockchain network receiving a node join task, the method further comprises:

a second node in the block chain network receives the node joining task sent by the new node;

and the second node sends the node joining task to each node in the block chain network, and the first node is one of the nodes.

4. The method of claim 3, wherein the first node and other nodes in the blockchain network implement a predetermined consensus policy comprising:

the first node sends a network change event to other nodes in the block chain network, wherein the network change event comprises: the node adds the task identifier of the task and the node identifier of the new node;

the first node receives a network change event sent by the first node, or receives a network change event sent by other nodes in the block chain network; the first node acquires the task identifier and the node identifier from the network change event, and judges as follows: judging whether the node adding task corresponding to the task identifier is received previously, judging whether the node adding task corresponding to the task identifier is successfully executed, and judging whether the node statistical list comprises the node identifier; if the first node obtains the following judgment result: and if the first node has previously received the node joining task corresponding to the task identifier, has successfully executed the node joining task corresponding to the task identifier, and does not contain the node identifier in the node counting list, the first node records the node identifier in the node counting list.

5. The method of claim 2, further comprising:

the first node receives transaction tasks sent by other nodes in the block chain network, wherein the transaction tasks carry node identifiers of the nodes sending the transaction tasks, and the transaction tasks are signed transaction tasks;

the first node acquires a node identifier from the transaction task and judges whether a node statistical list of the first node comprises the node identifier;

under the condition that the node statistical list of the first node does not contain the node identifier, the first node does not execute the transaction task, or the execution result of the transaction task is represented as execution failure;

under the condition that the node statistical list of the first node contains the node identification, the first node acquires a public key corresponding to the node identification and utilizes the public key to check and sign the transaction task;

and in the case of failing to pass the verification, the first node does not execute the transaction task or represents the execution result of the transaction task as execution failure.

6. The method of any of claims 1 to 5, further comprising:

the first node acquires a transaction task, wherein the transaction task carries task version information;

the first node judges whether the version of the transaction task is higher than that of the blockchain network or not according to the version information of the blockchain network and the task version information, wherein the version of the blockchain network corresponds to the version of the lowest node in the blockchain network;

the first node executes the transaction task if the version of the transaction task is not higher than the version of the blockchain network.

7. The method according to claim 6, wherein the node joining task is generated and sent by the new node, and the node joining task carries task version information;

and under the condition that the version of the node joining task is higher than, lower than or equal to that of the block chain network, the first node responds to the node joining task.

8. The method of any of claims 1 to 5, further comprising:

a third node in the block chain network acquires version information of each node in the block chain network;

the third node judges whether the version of each node is higher than that of the block chain network or not according to the obtained version information and the version information of the block chain network;

and under the condition that the version of each node is higher than the version of the blockchain network, controlling the version information of the blockchain network to be updated, so that the updated version information corresponds to the lowest node version in the blockchain network.

9. A block chain network is characterized in that the block chain network comprises a plurality of nodes, wherein any node in the plurality of nodes is used for receiving a node joining task, and the node joining task carries version information of a new node;

10. A device for managing a blockchain network, the device being applied to any node in the blockchain network, the device comprising:

11. An electronic device is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing mutual communication by the memory through the communication bus;

the memory is used for storing a computer program;

the processor, when executing a program stored in the memory, is adapted to perform the method steps of any of claims 1-8.

12. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method steps of any one of claims 1 to 8.