CN110324421B - Information processing method and block chain node equipment - Google Patents
Information processing method and block chain node equipment Download PDFInfo
- Publication number
- CN110324421B CN110324421B CN201910594208.3A CN201910594208A CN110324421B CN 110324421 B CN110324421 B CN 110324421B CN 201910594208 A CN201910594208 A CN 201910594208A CN 110324421 B CN110324421 B CN 110324421B
- Authority
- CN
- China
- Prior art keywords
- node
- information
- nodes
- voting
- request message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application discloses an information processing method and block chain link point equipment, which are used for punishing illegal nodes and improving the working efficiency of a block chain system. The block chain system comprises a plurality of nodes, and the method comprises the following steps: a first node receives first information from a second node, wherein the first information is used for alliance with at least one node in a block chain system, and the grade of the first node is higher than that of the second node; the first node responds to the first information and determines a coalition result according to a preset rule; when the result of the alliance passes, the first node stores the first information in a target block in the block chain system; and when the alliance result does not pass, the first node sends second information to the second node and broadcasts the second information, wherein the second information is used for warning the first node that the preset rule is violated.
Description
Technical Field
The present application relates to the field of block chain technologies, and in particular, to an information processing method and a block chain node device.
Background
Block chains are widely used as a novel application model of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanism, encryption algorithm, and the like.
And the block chain system executes corresponding transactions according to different constraint rules, so that different transactions are processed, and corresponding functions are realized. The blockchain system can be composed of a plurality of node devices, each node device can utilize the blocks to store data, and the blocks are combined into a chain data structure in a sequential connection mode according to the time sequence, so that distributed transaction data are formed in the blockchain system.
In the process of generating the block by the node device, each node device generates the block and verifies the new block through a consensus mechanism. When the new block passes the verification, the node devices can be considered to have consensus and store the new block. If the recognition is not achieved, the operation can be quitted or stopped, for example. However, if a node device itself cannot achieve consensus due to violation and other node devices do not know the cause, a new block is still generated, and when the number of the node devices violating the block chain system is large, the operation efficiency of the block chain system is low.
Disclosure of Invention
The embodiment of the application provides an information processing method and block chain node equipment, which are used for punishing an illegal node and improving the working efficiency of a block chain system.
In a first aspect, an embodiment of the present application provides an information processing method applied to a blockchain system, where the blockchain system includes a plurality of nodes, the plurality of nodes are divided into a plurality of levels, and the levels are, in order from high to low, level 1 to level N, a node of any level i has at least one node of level i +1 that is subordinate to the node, all nodes of level i +1 that are subordinate to the node of level i maintain a blockchain transaction of level i together, N is a positive integer greater than or equal to 2, and i is a positive integer from 1 to N-1, and the method includes:
a first node receives first information from a second node, wherein the first information is used for alliance with at least one node in the block chain system, and the grade of the first node is higher than that of the second node;
the first node responds to the first information and determines a coalition result according to a preset rule;
when the federation result passes, the first node stores the first information in a target block in the blockchain system;
and when the federation result does not pass, the first node sends second information to the second node and broadcasts the second information, wherein the second information is used for warning the second node to violate the preset rule.
In a possible implementation manner, the preset rule includes at least two sub-rules, and the determining, by the first node, the federation result according to the preset rule in response to the first information includes:
and if the first node determines that the first information violates any one of the at least two sub-rules, determining that the federation result does not pass.
In a possible embodiment, when the federation result does not pass, the first node sends second information to the second node and broadcasts the second information, including:
the first node judges whether the second node violates the preset rule for the first time;
if the first node determines that the second node violates the preset rule for the first time, the second node sends the second information to the second node and broadcasts the second information;
otherwise, the first node judges whether the second node violates the preset rule for the second time;
if the first node determines that the second node violates the preset rule for the second time, third information is sent to the second node and is broadcasted, wherein the third information is used for warning that the second node violates the preset rule, the third information comprises first sub information, and the first sub information is used for indicating warning level.
In a possible implementation manner, if the first node determines that the second node does not violate the preset rule for the second time, the method further includes:
the first node judges whether the second node violates the preset rule for the third time;
if the first node determines that the second node violates the preset rule for the third time, sending a first voting request message to all nodes in the blockchain system, wherein the first voting request message is used for requesting to vote for the naming of the second node;
the first node receives first voting information from all the nodes, wherein the first voting information is used for indicating a name removal result;
and the first node carries out name removal on the second node according to the received first voting information.
In a possible implementation manner, the first node performs naming-off on the second node according to the received first voting information, including:
and if the name removal result indicated by the first voting information is that at least 50% of all the nodes agree to name removal, the first node removes the name of the second node.
In one possible embodiment, the method further comprises:
the first node receives a first request message from the second node, wherein the first request message is used for requesting correction or complaint of the first information;
the first node sends a second voting request message to a plurality of nodes, wherein the second voting request message is used for requesting the plurality of nodes to vote for correction or complaint of the second node;
and the first node receives second voting information sent by the plurality of nodes and determines whether to restore the second node to a normal node or not, wherein if the second voting information indicates that at least 60% of the child nodes in the plurality of nodes agree to correction or complaint of the second node, the first node determines to restore the second node to the normal node.
In one possible embodiment, the method further comprises:
the first node sends a third voting request message to all nodes in the blockchain system, wherein the third voting request message is used for requesting all nodes to vote on correction or complaint of the second node;
and the first node receives third voting information sent by all the nodes and determines whether to restore the second node to a normal node or not, wherein if the third voting information indicates that at least 2/3 sub-nodes in all the nodes agree to correction or complaint of the second node, the first node determines to restore the second node to the normal node.
In one possible embodiment, the method further comprises:
the first node receives a second request message from the second node, wherein the second request message is used for applying for rejoining the block chain system;
the first node sends a fourth voting request message to all the nodes, wherein the fourth voting request message is used for requesting all the nodes to vote for rejoining the second node;
and the first node receives and determines whether to join the second node to the blockchain system again according to fourth voting information from all the nodes, wherein if the fourth voting information indicates that at least 2/3 child nodes in all the nodes approve the joining of the second node again, the first node determines to join the second node to the blockchain system again.
In one possible embodiment, the method further comprises:
the first node sends public information in the block chain system, wherein the public information is used for indicating the default processing result of the second node.
In one possible embodiment, the method further comprises:
the first node stores a breach processing result of the second node, wherein the breach processing result comprises a breach cause.
In a second aspect, an embodiment of the present application provides a block chain node device, where the block chain node device is located in a block chain system, the block chain system includes a plurality of nodes, the plurality of nodes are divided into a plurality of levels, which are sequentially level 1 to level N from high to low, a node of any level i has at least one level i +1 node that belongs to the node, all the level i +1 nodes that belong to the level i share a block transaction of the level i, N is a positive integer greater than or equal to 2, and i is a positive integer from 1 to N-1, and the block chain node device includes:
a receiving unit, configured to receive first information from a second node, where the first information is used for federation with at least one node in the blockchain system, and a rank of the first node is higher than a rank of the second node;
the determining unit is used for responding to the first information and determining a coalition result according to a preset rule;
a storage unit, configured to, when the federation result passes, the first node stores the first information in a target block in the blockchain system;
and a sending unit, configured to send, by the first node, second information to the second node when the federation result does not pass, and broadcast the second information, where the second information is used to warn the first node that the preset rule is violated.
In a third aspect, embodiments of the present application provide a computer-readable storage medium storing a computer program executable by a computer device, wherein the program, when executed on the computer device, causes the computer device to perform the steps of the method according to any one of the first aspect.
In this embodiment, for a certain node in the blockchain system, when the node initiates a federation operation for generating the first information, the decision node may make a decision for the first information of the node, so that, when the first information of the node is violated, the node is warned and all nodes in the blockchain system are notified, that is, a plurality of nodes are not required to generate a new block, and the work efficiency of the blockchain system is improved.
Drawings
Fig. 1 is a schematic structural diagram of a blockchain system according to an embodiment of the present disclosure;
fig. 2 is a schematic flowchart of an information processing method according to an embodiment of the present application;
fig. 3 is a schematic flowchart of an information processing method according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a block link point device according to an embodiment of the present disclosure.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more clearly and completely understood, the technical solutions in the embodiments of the present application will be described below in conjunction with the accompanying drawings in the embodiments of the present application.
Currently, in the blockchain system, when a certain node cannot achieve consensus due to violation and other nodes do not know the cause, a new block is still generated, and when the number of the violated nodes in the blockchain system is large, the work efficiency of the blockchain system is low.
In view of this, the information processing method provided in the embodiment of the present application is applied to a blockchain system, and for a certain node in the blockchain system, when the node initiates a federation operation for generating first information, where the first information may be regarded as federation data, a decision node may make a decision for the first information of the node, so that, when the first information of the node has a violation, the node is warned, that is, the node with the violation can be punished, and all nodes in the blockchain system are notified, that is, a plurality of nodes are not required to generate a new block, thereby improving the working efficiency of the blockchain system.
The embodiments of the joining method and apparatus based on the blockchain system provided in the embodiments of the present application are described in detail below with reference to the accompanying drawings.
First, an application scenario, i.e., a blockchain system, used in the embodiments of the present application is introduced. The block chain system comprises a plurality of nodes, wherein the nodes are divided into a plurality of levels from 1 to N in sequence from high to low, and N is a positive integer greater than or equal to 2. The node may be various types of computer devices, for example, a personal computer, a server, a terminal device such as a mobile phone, and the like, which is not limited in this embodiment of the present application.
Specifically, referring to fig. 1, the nodes are servers, and a plurality of servers may be configured to form the same blockchain, that is, the plurality of servers form a blockchain system, and each server is a node in the blockchain system. The plurality of nodes are divided into two levels, namely a level 1 and a level 2, and each level comprises a plurality of nodes. Node 1 of level 1 has two level 2 nodes 3 and 4 that are subordinate to the node 1; node 2 of level 1 has three level 2 nodes 5, 6 and 7 that are subordinate to node 2. It should be noted that the number of nodes in each level may be set according to actual requirements, and the embodiment of the present application is not limited.
The node of any level i has at least one level i +1 node which is subordinate to the node, and all the level i +1 nodes which are subordinate to the level i node commonly maintain the block transaction of the level i, wherein i is a positive integer from 1 to N-1. The common maintenance here refers to a case where a plurality of nodes participate in transaction maintenance of a specific node in common, for example, a transaction is an affiliate transaction, a new block is added to a specific affiliate transaction of a certain node, and synchronization is performed on the new block.
Illustratively, as shown in FIG. 1, level 1 node 1 and level 2 nodes 3 and 4 collectively maintain level 2 interaction data. Interactive data here refers to the possible data involved in a block transaction by a node. In the following description, the nodes are taken as enterprise roles for example.
Referring to fig. 2, an embodiment of the present invention provides an information processing method based on a blockchain system, which can be applied to the blockchain system shown in fig. 1.
In step S201, a first node receives first information from a second node, where the first information is used for federating with at least one node in a blockchain system, and a rank of the first node is higher than a rank of the second node.
Where multiple nodes in a blockchain system may all receive interaction data for an ongoing transaction, but because each node is used differently, each node may process the interaction data differently. For convenience of the following description, a node of level 1 in the blockchain system shown in fig. 1 will be referred to as a first node, and a node of level 2 will be referred to as a second node. The first node may be a plurality of nodes, and in the following description, the first node is described in terms of one of the first nodes.
In the embodiment of the present application, for example, when a user needs to submit a federation transaction, the first information may be generated based on a federation target of the user in the blockchain system, and may be understood as federation data. For example, the user enters a join operation in the blockchain system. The blockchain system detects an input affiliation operation, and may generate first information in response to the affiliation operation. The first information may include a franchise affair, qualification information, historical item information, and the like.
When a user initiates a alliance request on any node in the blockchain system, for example, a second node, the second node acquires the first information. The first node, which is a node evaluating whether the federation request of the second node is legitimate, may receive first information from the second node to determine whether the federation request of the second node is legitimate.
And S202, the first node responds to the first information and determines a coalition result according to a preset rule.
In the embodiment of the present application, a franchise rule, i.e., a rule according to which whether to pass franchise or not is determined, may be agreed in advance, and is hereinafter referred to as a preset rule. The preset rule may be set according to, for example, qualification information of the node conducting the franchise-planned transaction, capability information of the franchise-planned transaction, historical behavior of the node, and the like.
For example, the preset rule may be the following rules:
1) and a certain node violates the national laws and regulations and is put into a case by public security organs and criminal operations, and the node can be removed.
2) And the basic principle of the link rule of the malicious damage of a certain node can be used for eliminating the node.
3) A node may be dismissed if it is demonstrated that it has no investment or development capabilities.
4) For example, for referral services, the node bypasses the introducer's private order, or the node can be removed without acknowledging or rewarding the referral. The private receipt includes both a private receipt of a certain node (user) and a private receipt of an employee involved in a certain node (e.g., an enterprise).
5) And a project to be launched is packaged in a certain node transition mode, other node members are deceived to jointly launch the project, the condition is proved to be true, and the node can be removed. For example, a node may be removed from a planned company for the purpose of FA, or may be privately colluded with another node member, or may be unfair to another node member such as a planned company or a node for joint raising of price, rebate transaction, or the like, or may be damaged by the benefit and reputation of the alliance.
6) And a certain node participates in the activity, the public train expense is not objected to, the expense is waited for after participation, and the node can be removed after the collection is waited for.
7) And when a certain node steals other node technical patents, the certain node maliciously robs other node service resources, maliciously digs other node core backbones, maliciously attacks other node reputations, causes loss to other nodes and can remove the node.
The above lists 7 preset rules, and certainly, according to actual needs, more corresponding preset rules may be specified, which is not limited in the embodiment of the present application.
And the first node responds to the first information and judges whether the second node allows the second node to be joined according to the first information and a preset rule.
Specifically, the first information may include basic information of the second node, for example, registration information of the second node, historical item information of the second node, historical behavior information of the second node, and the like. The first node judges whether the first information violates a preset rule or not, and if the first information violates any preset rule, the first node determines that the second node is not allowed to be joined.
Step S203, when the federation result passes, the first node stores the first information in the target block in the block chain system.
And step S204, when the alliance result is not passed, the first node sends second information to the second node and broadcasts the second information, wherein the second information is used for warning the first node that the preset rule is violated.
Specifically, referring to fig. 3, a process flow for determining the alliance of the second node for the first node is shown.
Step S301, the first node determines whether the second node violates a preset rule for the first time.
Step S302, if the first node determines that the second node violates the preset rule for the first time, the first node sends the second information to the second node, and broadcasts the second information.
The second information is used for warning the second node of violation of the preset rule. The broadcasting of the first information means that the first node broadcasts the second information to all nodes of the blockchain system to inform other nodes that the second node violates a preset rule, so that the other nodes do not need to generate a new block according to the first information of the second node, and the processing efficiency of the blockchain system is improved.
In contrast, in step S303, the first node determines that the second node does not violate the preset rule for the first time, and then the first node may continue to determine whether the second node violates the preset rule for the second time.
Step S304, if the first node determines that the second node violates the preset rule for the second time, the first node may send the third information to the second node and broadcast the third information.
The third information is for warning the second node of violation of the preset rule, similar to the second information, and is different from the second information in that the third information may include first sub-information for indicating a warning level. That is, the third information may be the second information carrying a warning flag, which may indicate a warning level. Illustratively, the warning marks are distinguished by colors, the different colors correspond to different warning levels, if the warning marks are red, the warning levels are first levels, and if the warning marks are yellow, the warning levels are second levels, wherein the first levels are higher than the second levels, so that other nodes can conveniently decide the alliance of the second node. Alternatively, this condition may alert the second node to correct in time, or else will remain in an alert state and even be removed.
After the second node receives the third information sent by the first node, the second node may determine whether to correct the first information or to complain so as to strive for continued alliance.
In step S3041, the second node sends a first request message to the first node, so that the first node receives the first request message from the second node.
Wherein, the first request message is used for requesting to correct or complain the first information;
in step S3042, the first node sends a first voting request message to a plurality of nodes, for requesting the plurality of nodes to vote for correction or complaint of the second node.
Wherein the plurality of nodes may be nodes of the same level and role as the first node. The plurality of nodes vote for correction or complaint of the second node, respectively, and send the voting results to the first node.
In step S3043, the first node receives the first voting information sent by the plurality of nodes, and determines whether to restore the second node to a normal node according to the first voting information.
Each node sends first voting information to the first node, and the first node can comprehensively receive second voting information indicating the number of nodes agreeing to correction or complaint of the second node, so that whether the second node is recovered to be a normal node or not is determined according to the proportion of the number of the nodes in the plurality of nodes. Illustratively, the first node determines to restore the second node to a normal node if the first voting information indicates that at least 60% of the child nodes in the plurality of nodes agree to a correction or complaint of the second node.
Conversely, if the first voting information indicates that at least 60% of the child nodes in the plurality of nodes disagree with the correction or complaint of the second node, then the first node may solicit the opinion of all nodes in the overall blockchain system in an effort to override the alert status indication for the second node.
Specifically, in step S3044, the first node sends the second voting request message to all nodes in the blockchain system, so that all nodes receive the second voting request message.
And the second voting request message is used for requesting all the nodes to vote for correction or complaint of the second node. And all the nodes vote for the correction or complaint of the second node respectively and send the voting result to the first node.
In step S3045, the first node receives and determines whether to restore the second node to the normal node according to the second voting information sent by all the nodes.
Each node sends second voting information to the first node, and the first node can comprehensively receive the second voting information and indicate the number of nodes agreeing to correction or complaint of the second node, so that whether the second node is recovered to be a normal node or not is determined according to the proportion of the number of the nodes in all the nodes. Illustratively, the first node determines to restore the second node to a normal node if the second voting information indicates that at least 2/3 child nodes of the plurality of nodes agree to a correction or complaint of the second node. Otherwise, the alert status indication to the second node is retained.
In some embodiments, if the first node determines that the second node does not violate the preset rule for the second time, the first node may continue to determine whether the second node violates the preset rule for the third time in step S305.
Step S306, if the first node determines that the second node violates the preset rule for the third time, the first node sends a third voting request message to all nodes in the blockchain system. And the third voting request message is used for requesting to vote for the second node's rename.
And step S307, voting by all the nodes to determine whether the second node is agreed to be named.
Step S308, all nodes send the third voting information to the first node, so that the first node receives the third voting information.
The first voting information is used for indicating a result of the name removal;
and step S309, the first node carries out name removal on the second node according to the received third voting information.
And if the third voting information indicates that the second node agrees to the division name result, the first node performs division name on the second node if at least 50% of all the nodes agree to the division name result. It can be seen that, if there is a node in violation, the embodiment of the present application may perform a name removal on the node, that is, punish the node in violation. In this way, since the name of the offending node can be removed, for a decision maker or all nodes in the system, the interference of the offending node to other nodes is also reduced.
In the embodiment of the application, any node receives the broadcast sent by the first node, and can synchronously record the first information of the second node, or only record the information violating the preset rule in the first information, so that the information can be publicly inquired at the later stage, and a basis is provided for evaluating the subsequent behavior of the second node. Still alternatively, the first node may send public information in the blockchain system, where the public information may be used to indicate a result of the breach processing of the second node, and the result of the breach processing may include a cause of the breach, so that the first node and other nodes may both synchronously record the result of the breach processing and provide a basis for evaluating subsequent behaviors of the second node.
In some embodiments, the second node, although named after, may later apply for a re-blockchain system to participate in subsequent alliances. For fairness, the blockchain system may specify that a node is not allowed to join again for a predetermined duration after being de-named. For example, the blockchain system specifies that a nominated node must not be allowed to reapply for joining within a year.
Of course, the second node may apply for joining, and the first node may decide whether to allow the second node to join.
Specifically, the second node may send a second request message to the first node, so that the first node receives the second request message, and the second request message is used for applying for rejoining the blockchain system. Thereafter, the first node may send a fourth voting request message to all nodes to request all nodes to vote for the second node's rejoin. After receiving the fourth voting request message, all the nodes vote for the rejoining of the second node, and feed back fourth voting information to the first node, so that the first node determines whether to rejoin the second node to the block chain system according to the fourth voting information.
If the fourth voting information indicates that at least 2/3 child nodes of all nodes agree to rejoin the second node, then the first node determines to rejoin the second node in the blockchain system. Otherwise, the first node refuses the second node to join again.
In addition, in some embodiments, the second node may also automatically quit the blockchain system, which may be embodied in that the second node does not participate in the joining for a long time, for example, for 1 year, and after being reminded and disclosed, does not participate in the joining at a later stage or does not feed back the instruction information of whether to quit. Or the second node actively applies for voluntary exit.
In summary, the information processing method based on the blockchain system provided in the embodiments of the present application provides a new method for handling an illegal behavior of a node on a chain, that is, when a node initiates a federation throwing operation, a decision node may make a decision for federation throwing data corresponding to the federation throwing operation of the node, so that the node is warned and all nodes in the blockchain system are notified when the federation throwing data of the node is violated, that is, a plurality of nodes are not required to generate a new block, thereby improving the work efficiency of the blockchain system.
The device provided by the embodiment of the application is described in the following with the accompanying drawings of the specification.
Referring to fig. 4, based on the same inventive concept, an embodiment of the present application provides a block link node device, for example, the first node described above, where the node device includes a receiving unit 401, a determining unit 402, a storing unit 403, and a sending unit 404. The receiving unit 401 may be configured to receive first information from a second node, where the first information is used for federation with at least one node in the blockchain system, and a rank of the first node is higher than a rank of the second node; the determining unit 402 may be configured to respond to the first information and determine a federation result according to a preset rule; the storage unit 403 may be configured to, when the federation result passes, the first node stores the first information in a target block in the blockchain system; the sending unit 404 may be configured to, when the federation result fails, send, by the first node, second information to the second node, and broadcast the second information, where the second information is used to alert the first node that the preset rule is violated.
In a possible implementation manner, the preset rule includes at least two sub-rules, and the determining unit 402 is specifically configured to:
and if the first node determines that the first information violates any one of the at least two sub-rules, determining that the federation result is not passed.
In a possible implementation manner, the determining unit 402 is specifically configured to:
the first node judges whether the second node violates a preset rule for the first time;
if the first node determines that the second node violates the preset rule for the first time, sending second information to the second node, and broadcasting the second information;
otherwise, the first node judges whether the second node violates the preset rule for the second time;
and if the first node determines that the second node violates the preset rule for the second time, sending second information to the second node, and broadcasting third information, wherein the third information is used for warning that the second node violates the preset rule, the second information comprises first sub information, and the first sub information is used for indicating the warning level.
In a possible implementation, the determining unit 402 is further configured to:
if the first node determines that the second node does not violate the preset rule for the second time, judging whether the second node violates the preset rule for the third time;
if the first node determines that the second node violates the preset rule for the third time, sending a first voting request message to all nodes in the block chain system, wherein the first voting request message is used for requesting to vote for the name removal of the second node;
receiving first voting information from all nodes, wherein the first voting information is used for indicating a result of the name removal;
and according to the received first voting information, the second node is named.
In a possible implementation manner, the determining unit 402 is specifically configured to:
and if the name removal result indicated by the first voting information is that at least 50% of all the nodes agree to name removal, the first node removes the name of the second node.
In a possible implementation, the determining unit 402 is further configured to:
the first node receives a first request message from a second node, wherein the first request message is used for requesting to correct or appeal the first information;
the first node sends a second voting request message to the plurality of nodes, wherein the second voting request message is used for requesting the plurality of nodes to vote for correction or complaint of the second node;
and the first node receives second voting information sent by the plurality of nodes and determines whether to restore the second node to a normal node or not, wherein if the second voting information indicates that at least 60% of the child nodes in the plurality of nodes agree to correction or complaint of the second node, the first node determines to restore the second node to the normal node.
In a possible implementation, the determining unit 402 is further configured to:
the first node sends a third voting request message to all nodes in the blockchain system, wherein the third voting request message is used for requesting all nodes to vote for correction or complaint of the second node;
and the first node receives and determines whether to restore the second node to the normal node according to third voting information sent by all the nodes, wherein if the third voting information indicates that at least 2/3 child nodes in all the nodes agree to correction or complaint of the second node, the first node determines to restore the second node to the normal node.
In a possible implementation, the determining unit 402 is further configured to:
the first node receives a second request message from a second node, wherein the second request message is used for applying for rejoining the block chain system;
the first node sends a fourth voting request message to all nodes, wherein the fourth voting request message is used for requesting all nodes to vote for rejoining the second node;
the first node receives and determines whether to rejoin the second node in the blockchain system according to fourth voting information from all the nodes, wherein if the fourth voting information indicates that at least 2/3 child nodes of all the nodes approve the rejoining of the second node, the first node determines to rejoin the second node in the blockchain system.
In a possible implementation, the determining unit 402 is further configured to:
the first node sends public information in the block chain system, wherein the public information is used for indicating the default processing result of the second node.
In a possible implementation, the storage unit 403 is further configured to:
the first node stores a breach processing result of the second node, wherein the breach processing result comprises a breach cause.
The embodiments of the present application also provide a computer readable storage medium, which stores a computer program executable by a computer device, and when the program runs on the computer device, the computer device is caused to execute the steps of the block chain system-based alliance method provided in the embodiments of the present application.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Claims (10)
1. An information processing method is applied to a blockchain system, the blockchain system comprises a plurality of nodes, the plurality of nodes are divided into a plurality of levels, the levels are from level 1 to level N from high to low, a node of any level i has at least one node of level i +1, the node of all levels i +1 belonging to the node of the level i commonly maintains blocky transactions of the level i, N is a positive integer greater than or equal to 2, and i is a positive integer from 1 to N-1, and the method comprises the following steps:
a first node receives first information from a second node, wherein the first information is used for alliance with at least one node in the block chain system, and the grade of the first node is higher than that of the second node;
the first node responds to the first information and determines a coalition result according to a preset rule;
when the federation result passes, the first node stores the first information in a target block in the blockchain system;
and when the federation result does not pass, the first node sends second information to the second node and broadcasts the second information, wherein the second information is used for warning the second node to violate the preset rule.
2. The method of claim 1, wherein the predetermined rule comprises at least two sub-rules, and wherein the determining, by the first node, the federation result in response to the first information and according to the predetermined rule comprises:
and if the first node determines that the first information violates any one of the at least two sub-rules, determining that the federation result does not pass.
3. The method of claim 2, wherein the first node sending second information to the second node and broadcasting the second information when the federation result does not pass, comprising:
the first node judges whether the second node violates the preset rule for the first time;
if the first node determines that the second node violates the preset rule for the first time, the second node sends the second information to the second node and broadcasts the second information;
otherwise, the first node judges whether the second node violates the preset rule for the second time;
if the first node determines that the second node violates the preset rule for the second time, third information is sent to the second node and is broadcasted, wherein the third information is used for warning that the second node violates the preset rule, the third information comprises first sub information, and the first sub information is used for indicating warning level.
4. The method of claim 3, wherein if the first node determines that the second node does not violate the predetermined rule a second time, the method further comprises:
the first node judges whether the second node violates the preset rule for the third time;
if the first node determines that the second node violates the preset rule for the third time, sending a first voting request message to all nodes in the blockchain system, wherein the first voting request message is used for requesting to vote for the naming of the second node;
the first node receives first voting information from all the nodes, wherein the first voting information is used for indicating a name removal result;
and the first node carries out name removal on the second node according to the received first voting information.
5. The method of claim 4, wherein the first node performing a de-naming for the second node according to the received first voting information comprises:
and if the name removal result indicated by the first voting information is that at least 50% of all the nodes agree to name removal, the first node removes the name of the second node.
6. The method of any of claims 1-5, wherein the method further comprises:
the first node receives a first request message from the second node, wherein the first request message is used for requesting correction or complaint of the first information;
the first node sends a second voting request message to a plurality of nodes, wherein the second voting request message is used for requesting the plurality of nodes to vote for correction or complaint of the second node;
and the first node receives second voting information sent by the plurality of nodes and determines whether to restore the second node to a normal node or not, wherein if the second voting information indicates that at least 60% of the child nodes in the plurality of nodes agree to correction or complaint of the second node, the first node determines to restore the second node to the normal node.
7. The method of claim 6, wherein the method further comprises:
the first node sends a third voting request message to all nodes in the blockchain system, wherein the third voting request message is used for requesting all nodes to vote on correction or complaint of the second node;
and the first node receives third voting information sent by all the nodes and determines whether to restore the second node to a normal node or not, wherein if the third voting information indicates that at least 2/3 sub-nodes in all the nodes agree to correction or complaint of the second node, the first node determines to restore the second node to the normal node.
8. The method of claim 6, wherein the method further comprises:
the first node receives a second request message from the second node, wherein the second request message is used for applying for rejoining the block chain system;
the first node sends a fourth voting request message to all the nodes, wherein the fourth voting request message is used for requesting all the nodes to vote for rejoining the second node;
and the first node receives and determines whether to join the second node to the blockchain system again according to fourth voting information from all the nodes, wherein if the fourth voting information indicates that at least 2/3 child nodes in all the nodes approve the joining of the second node again, the first node determines to join the second node to the blockchain system again.
9. A blockchain node device located in a blockchain system, wherein the blockchain node device includes a plurality of nodes, the plurality of nodes are divided into a plurality of levels, from high to low, the levels are level 1 to level N, a node of any level i has at least one node of level i +1, the nodes of all levels i +1 belonging to the node of level i commonly maintain a blockchain transaction of level i, N is a positive integer greater than or equal to 2, i is a positive integer from 1 to N-1, the blockchain node device is the first node according to any one of claims 1 to 8, and the blockchain node device includes:
a receiving unit, configured to receive first information from a second node, where the first information is used for federation with at least one node in the blockchain system, and a rank of the first node is higher than a rank of the second node;
the determining unit is used for responding to the first information and determining a coalition result according to a preset rule;
a storage unit, configured to, when the federation result passes, the first node stores the first information in a target block in the blockchain system;
and a sending unit, configured to send, by the first node, second information to the second node when the federation result does not pass, and broadcast the second information, where the second information is used to warn the first node that the preset rule is violated.
10. A computer-readable storage medium, having stored thereon a computer program executable by a computer device, for causing the computer device to perform the steps of the method of any one of claims 1 to 8, when the program is run on the computer device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910594208.3A CN110324421B (en) | 2019-07-03 | 2019-07-03 | Information processing method and block chain node equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910594208.3A CN110324421B (en) | 2019-07-03 | 2019-07-03 | Information processing method and block chain node equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110324421A CN110324421A (en) | 2019-10-11 |
| CN110324421B true CN110324421B (en) | 2021-08-27 |
Family
ID=68122564
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910594208.3A Active CN110324421B (en) | 2019-07-03 | 2019-07-03 | Information processing method and block chain node equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110324421B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113239407B (en) * | 2021-04-13 | 2022-06-21 | 北京邮电大学 | Block chain decision point selection method and device, electronic equipment and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107025602A (en) * | 2017-02-24 | 2017-08-08 | 杭州象链网络技术有限公司 | A kind of financial asset transaction system construction method based on alliance's chain |
| CN107122958A (en) * | 2017-04-27 | 2017-09-01 | 电子科技大学 | A kind of electronics contract frame system based on block chain |
| CN108615153A (en) * | 2018-04-28 | 2018-10-02 | 百度在线网络技术（北京）有限公司 | Processing method, device, system, equipment and the storage medium of block chain data |
| CN108848080A (en) * | 2018-06-01 | 2018-11-20 | 深圳崀途科技有限公司 | Data-sharing systems based on the storage verification of alliance's chain |
| CN109218348A (en) * | 2017-06-29 | 2019-01-15 | 华为技术有限公司 | The determination method and node device of block in a kind of block chain |
| CN109347877A (en) * | 2018-11-30 | 2019-02-15 | 广州知弘科技有限公司 | Block chain structure storage controlling method |
| CN109379266A (en) * | 2018-09-29 | 2019-02-22 | 湖南智慧政务区块链科技有限公司 | A kind of multilayer government affairs block chain network construction method and its system based on Star Network |
| CN109525633A (en) * | 2018-10-08 | 2019-03-26 | 上海点融信息科技有限责任公司 | Block chain network, the message transmission based on block chain network, message receival method |
| CN109922039A (en) * | 2019-01-14 | 2019-06-21 | 湘潭大学 | A kind of identity management method of half centralization based on block chain technology |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10447478B2 (en) * | 2016-06-06 | 2019-10-15 | Microsoft Technology Licensing, Llc | Cryptographic applications for a blockchain system |
-
2019
- 2019-07-03 CN CN201910594208.3A patent/CN110324421B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107025602A (en) * | 2017-02-24 | 2017-08-08 | 杭州象链网络技术有限公司 | A kind of financial asset transaction system construction method based on alliance's chain |
| CN107122958A (en) * | 2017-04-27 | 2017-09-01 | 电子科技大学 | A kind of electronics contract frame system based on block chain |
| CN109218348A (en) * | 2017-06-29 | 2019-01-15 | 华为技术有限公司 | The determination method and node device of block in a kind of block chain |
| CN108615153A (en) * | 2018-04-28 | 2018-10-02 | 百度在线网络技术（北京）有限公司 | Processing method, device, system, equipment and the storage medium of block chain data |
| CN108848080A (en) * | 2018-06-01 | 2018-11-20 | 深圳崀途科技有限公司 | Data-sharing systems based on the storage verification of alliance's chain |
| CN109379266A (en) * | 2018-09-29 | 2019-02-22 | 湖南智慧政务区块链科技有限公司 | A kind of multilayer government affairs block chain network construction method and its system based on Star Network |
| CN109525633A (en) * | 2018-10-08 | 2019-03-26 | 上海点融信息科技有限责任公司 | Block chain network, the message transmission based on block chain network, message receival method |
| CN109347877A (en) * | 2018-11-30 | 2019-02-15 | 广州知弘科技有限公司 | Block chain structure storage controlling method |
| CN109922039A (en) * | 2019-01-14 | 2019-06-21 | 湘潭大学 | A kind of identity management method of half centralization based on block chain technology |
Non-Patent Citations (3)
| Title |
|---|
| LibRSM：基于联盟链的数字图书馆信息资源安全共享模型;沈凯旋;《国家图书馆学刊》;20190415;全文 * |
| Medical Chain：联盟式医疗区块链系统;张超;《自动化学报》;20190104;全文 * |
| 一种适用于联盟链的共识机制;曹兆磊;《网络空间安全》;20190125;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110324421A (en) | 2019-10-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112150284B (en) | Blockchain heterogeneous chain cross-chain transaction method | |
| CN108269090B (en) | Consensus method and device for block chain system based on non-negotiation random drawing | |
| CN109447795B (en) | Byzantine consensus method supporting rapid achievement of final confirmation | |
| CN111741114A (en) | System, method and equipment capable of monitoring cross-chain interaction based on block chain | |
| CN110751544A (en) | Bidding information, supervision information and bid evaluation information processing method, terminal and system | |
| CN111614708B (en) | Transaction system based on block chain | |
| CN113645278B (en) | Cross-chain message transmission method, device and storage medium of block chain | |
| CN109981690B (en) | Anti-tamper timing data secret transmission method based on block chain intelligent contract | |
| CN113783899B (en) | Node exit method and blockchain system | |
| CN112749968B (en) | Service data recording method and device based on block chain | |
| CN112492016B (en) | Cross-process extensible consensus method and system | |
| Vizier et al. | Comchain: Bridging the gap between public and consortium blockchains | |
| CN114218612A (en) | Consensus method suitable for high-frequency trading scene of alliance chain | |
| CN110324421B (en) | Information processing method and block chain node equipment | |
| CN114362996B (en) | Dynamic cross-link message forwarding method and system | |
| CN113419769B (en) | Application software management method and device | |
| CN116244725A (en) | File processing method and device based on block chain, equipment and file contribution system | |
| CN112511312B (en) | Assembled consensus method and system | |
| CN108470268A (en) | A kind of bidding expert selection method and system | |
| CN114707663B (en) | Distributed machine learning method, device, electronic equipment and storage medium | |
| CN115879869A (en) | Pledge goods delivery method and pledge goods delivery device based on block chain | |
| CN114785801A (en) | P2P engine for dynamically constructing distributed privacy network topology | |
| CN113919511A (en) | Federal learning method and device | |
| CN114520733B (en) | Method and device for transmitting data and processing trusted authentication and electronic equipment | |
| CN115186285B (en) | Parameter aggregation method and device for federal learning |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |