Consensus node selection method

By monitoring nodes to monitor and record the attributes and interaction records of candidate nodes, calculate comprehensive weights, and optimize the selection of consensus nodes, the problems of low consensus efficiency and security risks in regional chain technology are solved, and an efficient and secure regional chain network is realized.

CN119030979APending Publication Date: 2024-11-26SHANGHAI NONFERROUS METALS TRADING CENTER CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411247349.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-06
Publication Date
2024-11-26

AI Technical Summary

Technical Problem

The existing regional chain technology does not consider the relationship between node performance and Internet of Things application scenarios and environmental in the process of selecting consensus nodes, resulting in low consensus efficiency and security risks, and fails to meet the efficiency and security requirements of financial technology.

Method used

By monitoring nodes, they monitor and record the static and dynamic attributes of candidate nodes, as well as the interactive attributes with other nodes, calculate the comprehensive weight, form a comprehensive node evaluation table, verify and synchronize, ensure the node's ability to fulfill its responsibilities, and optimize the consensus node selection process.

Benefits of technology

It improves the reliability and security of the regional chain network, ensures the node's responsibilities fulfillment capabilities, improves consensus efficiency and security, and is suitable for financial technology applications.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119030979A_ABST
    Figure CN119030979A_ABST
Patent Text Reader

Abstract

The invention discloses a consensus node selection method, and belongs to the technical field of regional chains. The method comprises the following steps: dividing monitoring nodes; before and after each round of consensus, the monitoring node detects and records the non-interaction attributes of the candidate nodes in the network, and receives and updates the interaction attributes generated when other candidate nodes in the network interact with the current candidate node at the same time; after calculation according to the weight, each monitoring node broadcasts the calculated comprehensive weight to a pre-selected master node, and the master node summarizes the comprehensive weight to obtain a node comprehensive evaluation table; the master node sends the node comprehensive evaluation table to other candidate nodes for verification and synchronization; if the verification is passed, the consensus monitoring evaluation result of the round is directly broadcasted to the whole network; and if the verification fails, the main node sends a node replacement request to the alternative cluster node. According to the invention, the reliability of the regional chain network is ensured to a certain extent.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the field of regional chain technology, and more specifically, relates to a method for selecting a consensus node. Background Art

[0002] In recent years, the application of blockchain technology in the financial field and its influence on financial technology have been increasing. Introducing blockchain technology in the field of supply chain finance and building a technologically innovative supply chain finance system can improve the overall efficiency and quality of supply chain finance and enhance system security.

[0003] Regional blockchain technology is a new application based on the basic Internet protocol. By decentralizing the data distributed ledger, it gets rid of the traditional database technology's dependence on the central processor and records all transaction data or project changes between users in the cloud system openly and transparently.

[0004] However, at present, regional chains only consider the computing performance of the nodes themselves in the process of selecting consensus nodes, without further considering the relationship between the node's own performance and the IoT application scenarios and the environment in which it is located. There are problems such as low consensus efficiency and security risks.

[0005] Therefore, how to focus on the selection of regional chain consensus and accounting nodes to achieve the requirements of regional chain efficiency, security, and applicability to financial technology is a technical problem that needs to be urgently solved in this field. Summary of the invention

[0006] In view of the problem of poor reliability of regional chain networks in the prior art, the present invention provides a method for selecting consensus nodes. By utilizing monitoring nodes to monitor and record the attributes of the nodes themselves in the network and the historical records of interactions between the nodes and other nodes, the comprehensive weight of the nodes is calculated, and then whether the nodes have the ability to perform their responsibilities is judged, the specification of interactive nodes is completed, and the reliability of the regional chain network is guaranteed to a certain extent.

[0007] To solve the above problems, the present invention adopts the following technical solutions.

[0008] A method for selecting a consensus node, the method comprising:

[0009] Divide monitoring nodes;

[0010] Before and after each round of consensus, the monitoring node detects and records the non-interactive attributes of the candidate nodes in the network, and receives and updates the interactive attributes generated when other candidate nodes in the network interact with the current candidate node;

[0011] After weight calculation, each monitoring node broadcasts the calculated comprehensive weight to the pre-selected master node, which summarizes it to obtain a node comprehensive evaluation table;

[0012] The master node sends the node comprehensive evaluation table to other candidate nodes for verification and synchronization; if the verification passes, the monitoring and evaluation results of this round of consensus are directly broadcast to the entire network; if the verification fails, the master node sends a node replacement request to the candidate cluster node; where:

[0013] The non-interactive attributes of the candidate node include static attributes and dynamic attributes, wherein the static attributes are used to characterize the basic ability of the node to perform its responsibilities, and the dynamic attributes are used to characterize the behavior state of the node when performing its responsibilities;

[0014] The interaction attribute is used to characterize the evaluation result of the honesty when the node interacts with other nodes.

[0015] Preferably, after the master node sends a node replacement request to the candidate cluster node, if the replaced node is a Byzantine node, a random selection is performed among the remaining candidate cluster nodes and the nodes are monitored by the monitoring node again.

[0016] Preferably, the monitoring nodes are divided, which specifically includes:

[0017] Get the comprehensive evaluation table of the initialization nodes;

[0018] According to the initialized node comprehensive evaluation table, all nodes are sorted from large to small according to the comprehensive weight, and the top-ranked nodes are used as monitoring nodes; among them:

[0019] The node comprehensive evaluation table initialized shall be based on the node comprehensive evaluation table finally updated by the last master node;

[0020] Each time a monitoring node is selected, the monitoring nodes are divided into two groups, namely, positive and negative monitoring committees; the remaining nodes except the committee nodes are used as common nodes, and the master node is selected from the committee nodes.

[0021] Preferably, after weight calculation, each monitoring node broadcasts the calculated comprehensive weight to a pre-selected master node, which specifically includes:

[0022] Calculate the values ​​of the corresponding indicators of static attributes, dynamic attributes and interactive attributes respectively;

[0023] The optimized analytic hierarchy process is used to calculate the weight of each indicator;

[0024] Calculate the comprehensive weight of the node.

[0025] Preferably, the static attribute, the dynamic attribute and the interactive attribute include a plurality of primary indicators and secondary indicators, and each primary indicator corresponds to a plurality of secondary indicators;

[0026] The first-level indicators include basic capability evaluation indicators corresponding to the static attributes of the node, behavior status evaluation indicators corresponding to the dynamic attributes of the node, and indirect evaluation indicators corresponding to the node interaction attributes when other nodes perform their responsibilities on the current node;

[0027] The secondary indicators corresponding to the basic capability evaluation indicators include pledge ratio, memory capacity, hard disk storage capacity, number of processor cores, and number of CUDA cores;

[0028] The secondary indicators corresponding to the behavior status evaluation indicators include consensus completion rate, reliability ratio, network connectivity rate, online time, and network delay;

[0029] The secondary indicators corresponding to the indirect evaluation indicators include honesty.

[0030] Preferably, the values ​​of the indicators corresponding to the static attributes, dynamic attributes and interactive attributes are calculated respectively, which specifically includes:

[0031]

[0032] In the above formula, i is used to represent the current node, j represents the number of nodes that have reached consensus with the current node i within a period of time, and R i、 S i、 C i Respectively represent basic ability evaluation indicators, behavior status evaluation indicators, and indirect evaluation indicators; M 1i ~M 5i Respectively represent the node's pledge ratio, memory capacity, hard disk storage capacity, number of processor cores, and number of CUDA cores; N 1i~ N 5i They respectively represent the consensus completion rate, reliability ratio, network connectivity rate, online time, and network delay of the node. k0~K9 can be obtained based on expert scores.

[0033] Preferably, the weight of each indicator is calculated by using optimized hierarchical analysis method, which specifically includes:

[0034] Establishing a hierarchical analysis structure model; the hierarchical analysis structure model includes three layers, namely, a solution layer, a benchmark layer, and a target layer; the benchmark layer includes the first-level index and the second-level index; the benchmark layer is set to have a weight factor sum of 1;

[0035] The judgment matrix was constructed using the 1-9 scale method;

[0036] Perform data normalization processing on the judgment matrix of static attributes and the judgment matrix of dynamic attributes;

[0037] The consistency verification is performed and the eigenvector corresponding to the maximum eigenroot is used as the weight of each index.

[0038] Preferably, the comprehensive weight of the node is calculated, which specifically includes:

[0039] Assume the comprehensive responsibility evaluation value of node i is T i , then:

[0040] T i =αR i +βS i +γC i (α+β+γ=1);

[0041] T i ∈[0,1], i={0,1,2,3,...,N-1};

[0042] Among them, α, β, and γ are evaluation weight factors, and N is the number of common nodes.

[0043] Preferably, before the master node sends the node comprehensive evaluation table to other candidate nodes for verification and synchronization, it is also necessary to generate the sequence information and signature information of the node on the node comprehensive evaluation table;

[0044] When the master node sends the node comprehensive evaluation table to other candidate nodes for verification and synchronization, if the candidate node verifies the signature information and the received sequence information is equal to the sequence information recorded locally, it returns the verification success;

[0045] If the number of verification-passed messages received by the master node is greater than two-thirds of the number of verification messages, the verification is considered to be successful.

[0046] Compared with the prior art, the present invention has the following beneficial effects:

[0047] The present application provides a consensus node selection method, which utilizes monitoring nodes to monitor and record the properties of the nodes themselves in the network and the historical records of the interactions between the nodes and other nodes, calculates the comprehensive weight of the nodes, and then judges whether the nodes have the ability to fulfill their responsibilities, completes the specification of the interactive nodes, and ensures the reliability of the regional chain network to a certain extent. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] Figure 1 This is a flowchart of a method for selecting a consensus node in one specific implementation of the present application. DETAILED DESCRIPTION

[0049] The following specific embodiments illustrate the implementation of the present application, and those skilled in the art can easily understand other advantages and effects of the present application from the contents disclosed in this specification. Although the description of the present application will be introduced in conjunction with some embodiments, this does not mean that the features of this application are limited to the implementation. On the contrary, the purpose of introducing the application in conjunction with the implementation is to cover other options or modifications that may be extended based on the claims of the present application. In order to provide a deep understanding of the present application, the following description will include many specific details. The present application can also be implemented without using these details. In addition, in order to avoid confusion or blurring the focus of the present application, some specific details will be omitted in the description. It should be noted that the embodiments in the present application and the features in the embodiments can be combined with each other without conflict.

[0050] It should be noted that in this specification, similar reference numerals and letters denote similar items in the following drawings, and therefore, once an item is defined in one drawing, it does not need to be further defined and explained in the subsequent drawings.

[0051] The terms “first” and “second” are used for descriptive purposes only and should not be understood as indicating or implying relative importance.

[0052] In the description of this application, it should be noted that, unless otherwise clearly specified and limited, the terms "installed", "connected", and "connected" should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection, or it can be indirectly connected through an intermediate medium, or it can be the internal communication of two components. For ordinary technicians in this field, the specific meanings of the above terms in this application can be understood according to specific circumstances.

[0053] In the description of the present application, it should be understood that "electrical connection" in the present application can be understood as physical contact and electrical conduction between components; it can also be understood as a form in which different components in a circuit structure are connected through physical lines such as printed circuit board (PCB) copper foil or wires that can transmit electrical signals.

[0054] like Figure 1 As shown, as one of the specific implementations of the present application, a method for selecting a consensus node is provided, the method comprising:

[0055] Step S1, dividing monitoring nodes;

[0056] Step S2: Before and after each round of consensus, the monitoring node detects and records the non-interactive attributes of the candidate nodes in the network, and receives and updates the interactive attributes generated when other candidate nodes in the network interact with the current candidate node;

[0057] Step S3: After weight calculation, each monitoring node broadcasts the calculated comprehensive weight to the pre-selected master node, which summarizes the weights to obtain a node comprehensive evaluation table;

[0058] Step S4: The master node sends the node comprehensive evaluation table to other candidate nodes for verification and synchronization; if the verification passes, the monitoring evaluation results of this round of consensus are directly broadcast to the entire network; if the verification fails, the master node sends a node replacement request to the candidate cluster node.

[0059] By using monitoring nodes to monitor and record the properties of the nodes themselves in the network and the historical records of interactions between the nodes and other nodes, the comprehensive weight of the nodes is calculated, and then a judgment is made on whether the nodes have the ability to fulfill their responsibilities. The specification of the interactive nodes is completed, which ensures the reliability of the regional chain network to a certain extent.

[0060] Preferably, after the master node sends a node replacement request to the candidate cluster node, if the replaced node is a Byzantine node, a random selection is performed among the remaining candidate cluster nodes and the nodes are monitored by the monitoring node again.

[0061] In a preferred implementation, in step S1, dividing the monitoring nodes specifically includes:

[0062] Get the comprehensive evaluation table of initialization nodes;

[0063] According to the initialized node comprehensive evaluation table, all nodes are sorted from large to small according to the comprehensive weight, and the top-ranked nodes are used as monitoring nodes; among them:

[0064] The node comprehensive evaluation table initialized shall be based on the node comprehensive evaluation table finally updated by the last master node;

[0065] Each time a monitoring node is selected, the monitoring nodes are divided into two groups, namely, positive and negative monitoring committees; the remaining nodes except the committee nodes are used as common nodes, and the master node is selected from the committee nodes.

[0066] In each round of consensus, the monitoring node can detect the non-interactive attribute index values ​​of all nodes, and at the same time receive and update the interactive attribute index values ​​of the current node sent by other nodes. Finally, the interactive attribute index values ​​of each monitored node and the interactive attribute index values ​​are calculated by weight to generate a node comprehensive evaluation table and send it to the master node. In this case, before each round of consensus, the current monitoring node can obtain an initialized node comprehensive evaluation table.

[0067] In a preferred embodiment, in step S2, before and after each round of consensus, the monitoring node detects and records the non-interactive attributes of the candidate node itself in the network, and at the same time receives and updates the interactive attributes generated when other candidate nodes in the network interact with the current candidate node; the non-interactive attributes of the candidate node include static attributes and dynamic attributes, the static attributes are used to characterize the basic ability of the node to fulfill its responsibilities, and the dynamic attributes are used to characterize the behavioral state of the node when fulfilling its responsibilities; the interactive attributes are used to characterize the evaluation results of the honesty when the node interacts with other nodes.

[0068] In a preferred implementation, in step S3, after weight calculation, each monitoring node broadcasts the calculated comprehensive weight to a pre-selected master node, which specifically includes:

[0069] Step S31, respectively calculating the values ​​of the indicators corresponding to the static attributes, dynamic attributes and interactive attributes;

[0070] Step S32, using optimized analytic hierarchy process to calculate the weight of each indicator;

[0071] Step S33: Calculate and obtain the comprehensive weight of the node.

[0072] In step S31, the static attribute, the dynamic attribute and the interactive attribute include a plurality of primary indicators and secondary indicators, and each primary indicator corresponds to a plurality of secondary indicators.

[0073] The first-level indicators include basic capability evaluation indicators corresponding to the static attributes of the node, behavioral status evaluation indicators corresponding to the dynamic attributes of the node, and indirect evaluation indicators corresponding to the node interaction attributes when other nodes perform their responsibilities for the current node.

[0074] The secondary indicators corresponding to the basic capability evaluation indicators include pledge ratio, memory capacity, hard disk storage capacity, number of processor cores, and number of CUDA cores.

[0075] The secondary indicators corresponding to the behavior status evaluation indicators include consensus completion rate, reliability ratio, network connectivity rate, online time, and network delay.

[0076] The secondary indicators corresponding to the indirect evaluation indicators include honesty.

[0077] When calculating the values ​​of the indicators corresponding to the static attributes, dynamic attributes and interactive attributes, it specifically includes:

[0078]

[0079] In the above formula, i is used to represent the current node, j represents the number of nodes that have reached consensus with the current node i within a period of time, and R i、 Si、 C i Respectively represent basic ability evaluation indicators, behavior status evaluation indicators, and indirect evaluation indicators; M 1i ~M 5i Respectively represent the node's pledge ratio, memory capacity, hard disk storage capacity, number of processor cores, and number of CUDA cores; N 1i~ N 5i They respectively represent the consensus completion rate, reliability ratio, network connectivity rate, online time, and network delay of the node. k0~K9 can be obtained based on expert scores.

[0080] In step S32, the weight of each indicator can be calculated by using the optimized hierarchical analysis method; which specifically includes:

[0081] Step S321, establishing a hierarchical analysis structure model; the hierarchical analysis structure model includes three layers, namely, a solution layer, a reference layer, and a target layer; the reference layer includes the first-level index and the second-level index; the reference layer is set to have a weight factor sum of 1;

[0082] Step S322, constructing a judgment matrix using a 1-9 scaling method;

[0083] Step S323, performing data normalization processing on the judgment matrix of static attributes and the judgment matrix of dynamic attributes;

[0084] Step S324: perform consistency verification, and use the eigenvector corresponding to the obtained maximum eigenroot as the weight of each indicator.

[0085] In step S33, the comprehensive weight of the node is calculated, which specifically includes:

[0086] Assume the comprehensive responsibility evaluation value of node i is T i , then:

[0087] T i =αR i +βS i +γC i (α+β+γ=1);

[0088] T i ∈[0,1], i={0,1,2,3,...,N-1};

[0089] Among them, α, β, and γ are evaluation weight factors, and N is the number of common nodes.

[0090] According to the above scheme, it can be seen that the evaluation of the node by the comprehensive weight in this application is not limited to its single feature, but pays more attention to the overall performance of each feature together and the correlation between them.

[0091] Unlike the traditional reputation-based evaluation method, when this method is used to select candidate nodes, the monitoring results of candidate nodes need to be regularly updated dynamically across the entire network. Every time a Byzantine node is monitored, the node needs to be replaced to ensure the stability and security of the network.

[0092] In a preferred implementation, in order to prevent malicious nodes from continuously transmitting similar data to other nodes, resulting in the final voting result being determined by those malicious nodes, in step S4, before the master node sends the node comprehensive evaluation table to other candidate nodes for verification and synchronization, it is also necessary to generate the node's sequence information and signature information on the node comprehensive evaluation table. In one example, the message sent by the master node also includes at least the generated sequence, the hash value of the sequence, the timestamp, the signature, etc.

[0093] The verification process is:

[0094] When the master node sends the node comprehensive evaluation table to other candidate nodes for verification and synchronization, if the candidate node verifies the signature information and the received sequence information is equal to the sequence information recorded locally, it returns the verification success;

[0095] If the number of verification-passed messages received by the master node is greater than two-thirds of the number of verification messages, the verification is considered to be successful.

[0096] In a more specific example, when other nodes receive a new broadcast message, they first check the signature, and each signed message is only allowed to be received once; if a duplicate signature is received, the timestamp is first verified. If the timestamp cannot be verified, a repair and correction proof message is sent; if the proof message is not returned or the returned proof message fails to be verified, a discard packet is directly broadcast to all nodes;

[0097] After each node receives the sequence broadcast by all nodes, it broadcasts a message including its own signature and the hash values ​​of all sequences;

[0098] When each node verifies its identity, it first verifies whether the received sequence information is equal to the sequence information recorded locally. If they are equal, it returns the verification success to the master node, returns the sequence with the correct hash value and its own signature; if they are not equal, no message is returned.

[0099] This strategy of directly discarding verification failures can further ensure the security and reliability of the system.

[0100] Furthermore, when verification fails, that is, when there is no more than two-thirds of the votes, the master node will send a request to the backup node to obtain the backup and send the missing part. At the same time, the identity of the node corresponding to the missing part will be downgraded, and then enter the next round of consensus.

[0101] In the above process, if the master node sends a node replacement request to the candidate cluster node, if the replaced node is a Byzantine node, it will be randomly selected from the remaining candidate cluster nodes and will be monitored by the monitoring node again.

[0102] The examples described in the present invention are merely descriptions of the preferred implementation modes of the present invention, and are not intended to limit the concept and scope of the present invention. Without departing from the design concept of the present invention, various modifications and improvements made to the technical solutions of the present invention by engineers and technicians in this field should all fall within the protection scope of the present invention.

Claims

1. The method for selecting a consensus node is characterized by: The method comprises: Divide monitoring nodes; Before and after each round of consensus, the monitoring node detects and records the non-interactive attributes of the candidate nodes in the network, and receives and updates the interactive attributes generated when other candidate nodes in the network interact with the current candidate node; After weight calculation, each monitoring node broadcasts the calculated comprehensive weight to the pre-selected master node, which summarizes it to obtain a node comprehensive evaluation table; The master node sends the node comprehensive evaluation table to other candidate nodes for verification and synchronization; if the verification passes, the monitoring and evaluation results of this round of consensus are directly broadcast to the entire network; if the verification fails, the master node sends a node replacement request to the candidate cluster node; where: The non-interactive attributes of the candidate node include static attributes and dynamic attributes, wherein the static attributes are used to characterize the basic ability of the node to perform its responsibilities, and the dynamic attributes are used to characterize the behavior state of the node when performing its responsibilities; The interaction attribute is used to characterize the evaluation result of the honesty when the node interacts with other nodes.

2. The method for selecting a consensus node according to claim 1, characterized in that: After the master node sends a node replacement request to the candidate cluster node, if the replaced node is a Byzantine node, it is randomly selected from the remaining candidate cluster nodes and is monitored by the monitoring node again.

3. The method for selecting a consensus node according to claim 1, characterized in that: Divide the monitoring nodes, which specifically include: Get the comprehensive evaluation table of the initialization nodes; According to the initialized node comprehensive evaluation table, all nodes are sorted from large to small according to the comprehensive weight, and the top-ranked nodes are used as monitoring nodes; among them: The node comprehensive evaluation table initialized shall be based on the node comprehensive evaluation table finally updated by the last master node; Each time a monitoring node is selected, the monitoring nodes are divided into two groups, namely, positive and negative monitoring committees; the remaining nodes except the committee nodes are used as common nodes, and the master node is selected from the committee nodes.

4. The method for selecting a consensus node according to claim 1, characterized in that: After weight calculation, each monitoring node broadcasts the calculated comprehensive weight to the pre-selected master node, which specifically includes: Calculate the values ​​of the corresponding indicators of static attributes, dynamic attributes and interactive attributes respectively; The optimized analytic hierarchy process is used to calculate the weight of each indicator; Calculate the comprehensive weight of the node.

5. The method for selecting a consensus node according to claim 4, characterized in that: The static attribute, the dynamic attribute and the interactive attribute include a plurality of primary indicators and secondary indicators, and each primary indicator corresponds to a plurality of secondary indicators; The first-level indicators include basic capability evaluation indicators corresponding to the static attributes of the node, behavior status evaluation indicators corresponding to the dynamic attributes of the node, and indirect evaluation indicators corresponding to the node interaction attributes when other nodes perform their responsibilities on the current node; The secondary indicators corresponding to the basic capability evaluation indicators include pledge ratio, memory capacity, hard disk storage capacity, number of processor cores, and number of CUDA cores; The secondary indicators corresponding to the behavior status evaluation indicators include consensus completion rate, reliability ratio, network connectivity rate, online time, and network delay; The secondary indicators corresponding to the indirect evaluation indicators include honesty.

6. The method for selecting a consensus node according to claim 5, characterized in that: Calculate the values ​​of the corresponding indicators of static attributes, dynamic attributes and interactive attributes respectively, including: In the above formula, i is used to represent the current node, j represents the number of nodes that have reached consensus with the current node i within a period of time, and R i、 S i、 C i Respectively represent basic ability evaluation indicators, behavior status evaluation indicators, and indirect evaluation indicators; M 1i ~M 5i Respectively represent the node's pledge ratio, memory capacity, hard disk storage capacity, number of processor cores, and number of CUDA cores; N 1i~ N 5i They respectively represent the consensus completion rate, reliability ratio, network connectivity rate, online time, and network delay of the node. k0~K9 can be obtained based on expert scores.

7. The method for selecting a consensus node according to claim 5, characterized in that: The optimized analytic hierarchy process is used to calculate the weight of each indicator; Specifically include: Establishing a hierarchical analysis structure model; the hierarchical analysis structure model includes three layers, namely, a solution layer, a benchmark layer, and a target layer; the benchmark layer includes the first-level index and the second-level index; the benchmark layer is set to have a weight factor sum of 1; The judgment matrix was constructed using the 1-9 scale method; Perform data normalization processing on the judgment matrix of static attributes and the judgment matrix of dynamic attributes; The consistency verification is performed and the eigenvector corresponding to the maximum eigenroot is used as the weight of each index.

8. The method for selecting a consensus node according to claim 5, characterized in that: The comprehensive weight of the node is calculated, which specifically includes: Assume the comprehensive responsibility evaluation value of node i is T i , then: T i =αR i +βS i +γC i (a+b+c=1); T i ∈[0,1],i={0,1,2,3,...,N-1}; Among them, α, β, and γ are evaluation weight factors, and N is the number of common nodes.

9. The method for selecting a consensus node according to claim 1, characterized in that: Before the master node sends the node comprehensive evaluation table to other candidate nodes for verification and synchronization, it is also necessary to generate the node sequence information and signature information on the node comprehensive evaluation table; When the master node sends the node comprehensive evaluation table to other candidate nodes for verification and synchronization, if the candidate node verifies the signature information and the received sequence information is equal to the sequence information recorded locally, it returns the verification success; If the number of verification-passed messages received by the master node is greater than two-thirds of the number of verification messages, the verification is considered to be successful.