WO2022134471A1 - Procédé et appareil de gestion de nœud de chaîne de blocs, dispositif informatique et support d'enregistrement - Google Patents

Procédé et appareil de gestion de nœud de chaîne de blocs, dispositif informatique et support d'enregistrement Download PDF

Info

Publication number
WO2022134471A1
WO2022134471A1 PCT/CN2021/097242 CN2021097242W WO2022134471A1 WO 2022134471 A1 WO2022134471 A1 WO 2022134471A1 CN 2021097242 W CN2021097242 W CN 2021097242W WO 2022134471 A1 WO2022134471 A1 WO 2022134471A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
blockchain network
current blockchain
nodes
target node
Prior art date
Application number
PCT/CN2021/097242
Other languages
English (en)
Chinese (zh)
Inventor
代健武
Original Assignee
平安科技（深圳）有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 平安科技（深圳）有限公司 filed Critical 平安科技（深圳）有限公司
Publication of WO2022134471A1 publication Critical patent/WO2022134471A1/fr

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/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1053—Group management mechanisms  with pre-configuration of logical or physical connections with a determined number of other peers
    • H04L67/1057—Group management mechanisms  with pre-configuration of logical or physical connections with a determined number of other peers involving pre-assessment of levels of reputation of peers
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—Queue scheduling characterised by scheduling criteria
    • H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
    • H04L47/6275—Queue scheduling characterised by scheduling criteria for service slots or service orders based on priority

Definitions

  • the present application relates to the field of blockchain technology, in particular to a management method, device, computer equipment and storage medium for blockchain nodes.
  • the newly added node can receive the same treatment as the node that joined earlier in the blockchain network, and for the unfair problem of the node that joins first, provide a A management method, apparatus, computer equipment and storage medium for a blockchain node.
  • a first aspect provides a method for managing blockchain nodes, including:
  • a node whose duration of joining the current blockchain network meets the preset conditions is selected as a target node, and the target node is given a first authority;
  • the first authority of the target node is updated to a second authority, wherein the authority level of the second authority is higher than that of the first authority permission level.
  • a second aspect provides a method and apparatus for managing a blockchain node, including:
  • the node access unit is used to traverse all the nodes in the current blockchain network to obtain the time information of the state change of each node;
  • the first authority granting unit is used to select a node whose duration of joining the current blockchain network satisfies a preset condition as a target node based on the duration of each node joining the current blockchain network, and assign the target node a first authority;
  • a node scoring unit used to obtain the historical behavior records of each target node in the current blockchain network, and determine the contribution value of the target node in the current blockchain network based on the historical behavior records;
  • the second authority granting unit is configured to update the first authority of the target node to a second authority based on the contribution value of each target node in the current blockchain network, wherein the authority level of the second authority A permission level higher than the first permission.
  • a third aspect provides a computer device, including a memory and a processor, where computer-readable instructions are stored in the memory, and when the computer-readable instructions are executed by the processor, cause the processor to perform the following steps:
  • a node whose duration of joining the current blockchain network meets the preset conditions is selected as a target node, and the target node is given a first authority;
  • the first authority of the target node is updated to a second authority, wherein the authority level of the second authority is higher than that of the first authority permission level.
  • a fourth aspect provides a storage medium storing computer-readable instructions, which, when executed by one or more processors, cause the one or more processors to perform the following steps:
  • a node whose duration of joining the current blockchain network meets the preset conditions is selected as a target node, and the target node is given a first authority;
  • the first authority of the target node is updated to a second authority, wherein the authority level of the second authority is higher than that of the first authority permission level.
  • the time information of the state change of each node is obtained, and based on the time information of the state change of each node, it is obtained that each node joins the current blockchain network.
  • a node whose duration of joining the current blockchain network meets the preset conditions is selected as the target node, and the target node is given the first authority;
  • obtain the historical behavior records of each of the target nodes in the current blockchain network and score the target nodes based on the historical behavior records;
  • a permission is updated to a second permission with a higher permission level.
  • this application selects a plurality of newly added nodes as target nodes according to the time when the node joins the current blockchain network, and conducts key observations, and only allocates lower authority (limited authority) to these newly joined target nodes. , and then gradually increase the authority of the target node with high contribution value according to the contribution value of these target nodes in the blockchain network (that is, the authority of the target node is updated from the first authority to the second authority), that is, based on the current blockchain network
  • the contribution value of the middle node realizes the effective management and assistance of the blockchain network.
  • scoring the performance of the target node as the basis for the redistribution of authority, that is, assigning higher authority to the node with higher contribution value.
  • the fine-grained management strategy of nodes in the blockchain network is realized, thereby improving the transaction enthusiasm of nodes.
  • FIG. 1 is a block diagram of the internal structure of a computer device in one embodiment
  • FIG. 2 is a flowchart of a method for managing a blockchain node in one embodiment
  • 3 is another flowchart of a method for managing a blockchain node in one embodiment
  • FIG. 4 is a structural block diagram of an apparatus for managing a blockchain node in an embodiment.
  • first, second, etc. used in this application may be used herein to describe various elements, but these elements are not limited by these terms. These terms are only used to distinguish a first element from another element. For example, a first right may be referred to as a second right, and similarly, a second right may be referred to as a second right, without departing from the scope of this application.
  • a computer device and a blockchain node are included.
  • the computer device is a configuration device, for example, a computer device such as a computer, and a dynamic configuration tool with node permissions is installed on the computer device.
  • the management request of the blockchain node can be sent to the computer device, and the computer device receives the management request of the blockchain node and dynamically manages the nodes of the blockchain.
  • the computer device may be a smart phone, a tablet computer, a notebook computer, a desktop computer, etc., but is not limited thereto.
  • FIG. 1 is a schematic diagram of the internal structure of a computer device in one embodiment.
  • the computer device includes a processor, non-volatile storage medium, memory, and a network interface connected by a system bus.
  • the non-volatile storage medium of the computer device stores an operating system, a database and computer-readable instructions
  • the database may store a sequence of control information.
  • the processor can realize a A management method of blockchain nodes.
  • the processor of the computer device is used to provide computing and control capabilities and support the operation of the entire computer device.
  • Computer-readable instructions may be stored in the memory of the computer device, and when the computer-readable instructions are executed by the processor, the processor may execute a method for managing a blockchain node.
  • the network interface of the computer equipment is used for communication with the terminal connection.
  • FIG. 1 is only a block diagram of a partial structure related to the solution of the present application, and does not constitute a limitation on the computer equipment to which the solution of the present application is applied. Include more or fewer components than shown in the figures, or combine certain components, or have a different arrangement of components.
  • a method for managing blockchain nodes is proposed, which may include the following steps:
  • Step 201 traverse all nodes in the current blockchain network to obtain time information of state changes of each node.
  • the current blockchain network may include, but is not limited to, a consortium chain, a public chain, a private chain, and the like.
  • the state of a node may include, but is not limited to, joining state, transaction state, pending invalidation state, and so on. All nodes in the current blockchain network are traversed according to a predetermined time interval to obtain the time information of the state change of each node.
  • the predetermined time interval may be, for example, one day (24h), that is, each node is traversed once at a fixed time point every day.
  • the state change time information of the node such as the time when the node joined the blockchain network.
  • Step 202 Based on the time information of the state change of each node, obtain the time length of each node joining the current blockchain network.
  • the time information (or node generation time) when each node joins the current blockchain network is extracted from the time information of the state change of each node, and the time when each node joins the current blockchain network is the same as the time when each node joins the current blockchain network.
  • the current system time of the management node in the blockchain network is compared (for example, differential processing or time distance calculation processing can be performed) to determine the length of time for all nodes in the current dynamic blockchain network to join the current blockchain network (all nodes The duration of the generation), so that the blockchain network joining time attribute of all nodes can be obtained, which is used to indicate the relationship between the node and the current blockchain network.
  • Step 203 Based on the duration of each node joining the current blockchain network, select a node whose duration of joining the current blockchain network meets a preset condition as a target node, and assign a first authority to the target node.
  • selecting a node whose duration of joining the current blockchain network satisfies a preset condition as a target node refers to selecting multiple newly added nodes (that is, nodes with a shorter duration of joining the current blockchain network) as the target node.
  • the first permission here can be a limited permission.
  • the first permission is the observer permission.
  • the observer permission only has the permission to read the ledger, part of the block transportation and basic data storage permission, but no more advanced permission.
  • the scope of permission is compared. narrow.
  • Step 204 Obtain the historical behavior records of each target node in the current blockchain network, and determine the contribution value of the target node in the current blockchain network based on the historical behavior records.
  • the historical behavior record of the target node in the current blockchain network may include, but is not limited to, how much load it has undertaken, how much data has been transmitted, how much storage capacity has been provided, and so on.
  • the method of determining the contribution value of the target node in the current blockchain network may include, but is not limited to, transmitting X blocks X/10 points for other nodes, and executing Y transaction queries (to share how much the blockchain network shares).
  • the query workload on the network Y/8 points, providing Z standard storage blocks for storing data such as shared ledgers on the blockchain network Z points, and then calculating the total score of all behavior records of the target node, the total score Corresponding to the contribution value of the target node in the current blockchain network, for example, the higher the total score of all behavior records of the target node, the greater the contribution value of the target node in the current blockchain network.
  • determining the contribution value of the target node in the current blockchain network based on the historical behavior record may include: assigning a positive or negative score to each historical behavior of each target node, accumulating all the history of each node The scoring result of the behavior obtains the scoring result of the target node, and the contribution value of the target node in the current blockchain network is determined according to the scoring result of the target node.
  • each target node has multiple historical behaviors, and each historical behavior is scored separately, and the final score of each node is the sum of the scores of all historical behavior records.
  • the negative score may include the target node's illegal transaction once -1, the target node's refusal to store the corresponding data once -2, the target node providing service timeout -1 and so on.
  • a step S7 is also included, and this step is used for eliminating the target node when the cumulative scoring result of the target node is lower than the minimum threshold.
  • the target node has fewer positive scores and more negative scores.
  • the final score is less than or equal to 0, the node is removed from the dynamic blockchain network.
  • this embodiment can also increase the minimum threshold, such as 5 points, etc., and the nodes below the minimum threshold will be eliminated. This method helps to urge each node member to actively participate in the operation of the blockchain network, and warns against misoperation Otherwise, the current blockchain network will be eliminated in the case of inaction, less action or wrong action, so that the managed blockchain network will have stronger vitality and vitality.
  • Step 205 Based on the contribution value of each target node in the current blockchain network, update the first authority of the target node to a second authority, wherein the authority level of the second authority is higher than the authority level of the first authority.
  • the scoring result of each target node is related to the historical behavior of the target node, and the historical behavior of the node can reflect the contribution value of the node to the current blockchain network, so based on the scoring results of each target node,
  • the first authority of the target node is updated to the second authority, that is, the corresponding authority of the target node is based on the contribution value of the target node to the current blockchain.
  • this application selects a plurality of newly added nodes as target nodes according to the time when the nodes join the current blockchain network, and is the object of key observation, and only allocates lower authority (limited authority) to these newly joined target nodes. Then, according to the contribution value of these target nodes in the blockchain network, the authority of the target node with high contribution value is gradually increased, that is, the effective management and assistance of the blockchain network is realized based on the contribution value of the nodes in the current blockchain network. , by scoring the performance of the target node as the basis for the redistribution of authority, the fine-grained management strategy of nodes in the blockchain network is realized.
  • step 201 in order to prevent the access to the node from affecting the normal operation of the node, in step 201, all nodes in the current blockchain network are traversed, which may specifically include:
  • Step 2011 Based on the running information of all nodes in the current blockchain network, set the priority of traversing nodes.
  • the operation information of the node may include, but is not limited to, whether the node is running, the load rate at runtime, and the like.
  • Step 2012 Access all nodes in the current blockchain network according to priority.
  • the priority setting rule can be: count the operation information of each node in each time period (including whether it is running, load rate at runtime, etc.) Set the priority, such as 1 point-2 points, A ⁇ C ⁇ E ⁇ G ⁇ B, 2 points-3 points C/G/B/E/A, ... and so on.
  • step 202 in order to discover nodes whose joining time information has been tampered with by the node itself, step 202 , based on the time information of the state changes of each node, obtain the time length of each node joining the current blockchain network, specifically Can include:
  • Step 2021 based on the time information of the state change of each node, extract the time information of the node joining the current blockchain network.
  • the time information of the state change of the node includes at least the time information of the state change of the node joining the blockchain network, so the time information of the node joining the current blockchain network can be extracted according to the time information of the state change of the node.
  • Step 2022 Perform randomness verification on the joining time information of the nodes, and mark the nodes whose joining time information has been tampered with dishonesty.
  • the randomness verification process may include, but is not limited to, collecting historical data on the chain of nodes adjacent to the node to be verified, and based on the node consensus technology, according to most or all of the nodes adjacent to the node to be verified.
  • the chain history data determines whether the node joining time information has been tampered with, which may specifically include: parsing the chain history data of the node adjacent to the node to be verified, and obtaining the join of the current node recorded by the adjacent node according to the analysis result of the chain history data.
  • Time consensus information if most of the joining time consensus information (for example, 95%) is the same as the node joining time, it proves that the node joining time is accurate; otherwise, it is determined that the node information has been tampered with. If it is found that the joining time information of a node has been tampered with by the node itself, the node will be marked.
  • Step 2023 Compare the joining time information of each node with the current system time of the management node in the current blockchain network, and determine the duration of the node joining the current blockchain network.
  • the scoring result of the node marked as dishonest in step 2022 is modified to zero to represent a punishment for dishonest nodes, in other implementations, it may also include: directly removing the dishonest node from the dynamic blockchain network, and restricting the node from being unable to join the current blockchain network for a period of time.
  • step 203 selecting a node whose duration of joining the current blockchain network satisfies a preset condition as a target node may include:
  • Step 2031 Sort all nodes in the current blockchain network based on the duration of each node joining the current blockchain network.
  • all nodes in the current blockchain network can be sorted based on the attribute of the time of joining the blockchain network.
  • the first sorting result of all nodes can be formed according to the joining time from long to short.
  • Step 2032 Select a preset number of nodes ranked at the beginning or end of the sorting result as the target node, or select a node in the sorting result whose duration of joining the current blockchain network is not greater than the preset time threshold as the target node. Wherein, the time for any target node to join the current blockchain network is less than the time for other nodes in the current blockchain network except the target node to join the current blockchain network.
  • selecting a preset number of nodes at the beginning or end of the sorting result as the target node may be to filter out a plurality of nodes with a shorter joining time from the first sorting result or the second sorting result For example, several nodes in the back can be screened out from the first sorting result or several nodes in the front can be screened out from the second sorting result. Focus on long nodes.
  • the node whose duration of joining the current blockchain network is not greater than the preset time threshold in the sorting result as the target node. It can be the node whose joining time is less than or equal to the threshold from the first sorting result or the second sorting result, that is, from the first sorting result or the second sorting result. After a node is found in the sorting result that is less than the threshold, the nodes behind the node in the first sorting result will be filtered out or the nodes in front of the node in the second sorting result will be filtered out. This method helps to improve The computing efficiency helps to realize the technical solution provided by this application more quickly when the blockchain network is complex and there is a lot of data.
  • step 2031 may further include sequentially numbering each node from small to large in the order of time from short to long, for example, starting from 1, 2, 3 .
  • Several nodes can be directly and quickly cut out according to the number, for example, 10 nodes (numbered 1-10) not greater than 10 can be directly screened out.
  • multiple nodes with a short joining time can be implemented in this way.
  • the fast and efficient determination of the algorithm has the outstanding advantages of simple algorithm implementation, small resource occupation, and very fast execution speed.
  • the management method of the blockchain nodes further includes:
  • Step 206 Receive a scoring request from other nodes other than the target node in the current blockchain network.
  • the nodes that are not screened in step 203 can send a scoring request.
  • the corresponding node that sent the scoring request can be included in the target node set, and the node that sent the scoring request can be included in the target node set.
  • a score is determined in step 204 together with other filtered target nodes, and then the requesting target node is assigned permissions according to the score.
  • Step 207 Use the node that issued the scoring request as the target node, and mark the node for scoring.
  • Step 208 Determine the candidate management node of the current blockchain network based on the number of times the target node is scored and marked and/or the authority change of the target node.
  • step 207 the node that sends out the scoring request is recorded and given an identifier A to it, and the authority changes of the nodes given the identifier A are monitored. If the set value is set, for example, it can be 8 times, then these nodes are used as elements in the candidate set of management nodes of the blockchain node. When it is necessary to determine the node for managing the whole or part of the blockchain network as the administrator, A suitable node may be selected as a management node from the candidate set of management nodes.
  • step 205 further includes a step of inspecting the behavior of each target node within a period of time after the current scoring, and then performing a second step on each target node according to the inspection result. Score to give each target node new permissions, and then return to step 1.
  • the investigated items may include but are not limited to how much load is borne, how much data is transmitted, how much storage capacity is provided, etc.
  • Each target node is directly scored based on the contribution made by the target node to the entire blockchain network within this time period, that is, the contribution degree, and in some embodiments, the contribution degree value can be directly used as the score value.
  • a management device for blockchain nodes which can effectively manage and assist the blockchain network based on the contribution value of the nodes in the blockchain network.
  • the device specifically Can include:
  • the node access unit 411 is used to traverse all the nodes in the current blockchain network to obtain the time information of the state change of each node;
  • the joining duration calculation unit 412 is used to obtain the duration of each node joining the current blockchain network based on the time information of the state change of each node;
  • the first authority granting unit 413 is configured to select a node whose duration of joining the current blockchain network satisfies a preset condition as a target node based on the duration of each node joining the current blockchain network, and assign a first authority to the target node;
  • the node scoring unit 414 is used to obtain the historical behavior records of each target node in the current blockchain network, and determine the contribution value of the target node in the current blockchain network based on the historical behavior records;
  • the second authority granting unit 415 is configured to update the first authority of the target node to a second authority based on the contribution value of each target node in the current blockchain network, wherein the authority of the second authority The level is higher than the permission level of the first permission.
  • a computer device includes a memory, a processor, and a computer program stored in the memory and running on the processor.
  • the processor executes the computer program, the following steps are implemented: All nodes in the chain network are traversed to obtain the time information of the state change of each node; based on the time information of the state change of each node, the duration of each node joining the current blockchain network is obtained; based on each node joining the current blockchain network Select the node whose duration of joining the current blockchain network meets the preset conditions as the target node, and assign the first authority to the target node; obtain the historical behavior records of each target node in the current blockchain network, based on historical behavior Record the scoring of the target node; based on the scoring results of each target node, update the first authority of the target node to the second authority.
  • the step of traversing all nodes in the current blockchain network performed by the processor includes: setting the priority of traversing nodes based on the running information of all nodes in the current blockchain network; level access to all nodes in the current blockchain network.
  • the step of obtaining the duration of each node joining the current blockchain network based on the time information of the state change of each node executed by the processor includes: based on the time information of the state change of each node, extracting the node to join the current blockchain network.
  • Time information of the blockchain network includes: random verification of the joining time information of nodes to identify whether the joining time information has been tampered with; dishonest marking of nodes whose joining time information has been tampered with; The joining time information of each node except the node marked with dishonesty is compared with the current system time of the management node in the current blockchain network to determine the duration of each node joining the current blockchain network.
  • the processor when the processor executes the computer-readable instructions, the processor further performs the following steps: if it is detected that the scoring result of any node in the current blockchain network is less than the preset score value and/or is marked as dishonest, then Nodes are culled from the current blockchain network.
  • the step of selecting a node whose duration of joining the current blockchain network satisfies a preset condition as the target node performed by the processor includes: based on the duration of each node joining the current blockchain network, determining the current blockchain network All nodes in the network are sorted; select the preset number of nodes at the beginning or end of the sorting result as the target node, or select the one that has been added to the current blockchain network in the sorting result and is not greater than the preset time threshold.
  • the node is the target node; wherein, the time for any target node to join the current blockchain network is less than the time for other nodes in the current blockchain network except the target node to join the current blockchain network.
  • the step of scoring the target node based on the historical behavior record performed by the processor includes: scoring each historical behavior of each target node as positive or negative, and accumulating the scoring results of all historical behaviors of each node Get the scoring result of the target node.
  • the processor when the processor executes the computer-readable instructions, the processor further performs the following steps: receiving a scoring request from other nodes other than the target node in the current blockchain network; taking the node that issued the scoring request as the target node, and assigning a score to the node Carry out scoring and marking; determine the candidate management node of the current blockchain network based on the number of times of scoring and marking of the target node for scoring and marking and/or changes in the authority of the target node.
  • a storage medium storing computer-readable instructions
  • the computer-readable instructions when executed by one or more processors, cause the one or more processors to perform the following steps: All nodes in the chain network are traversed to obtain the time information of the state change of each node; based on the time information of the state change of each node, the duration of each node joining the current blockchain network is obtained; based on each node joining the current blockchain network Select the node whose duration of joining the current blockchain network meets the preset conditions as the target node, and assign the first authority to the target node; obtain the historical behavior records of each target node in the current blockchain network, based on historical behavior Record the scoring of the target node; based on the scoring results of each target node, update the first authority of the target node to the second authority.
  • the step of traversing all nodes in the current blockchain network performed by the processor includes: setting the priority of traversing nodes based on the running information of all nodes in the current blockchain network; level access to all nodes in the current blockchain network.
  • the step of obtaining the time length of each node joining the current blockchain network based on the time information of the state change of each node includes: based on the time information of the state change of each node, extracting the time information of the node joining the current blockchain network Time information; verify the randomness of the joining time information of the nodes, and mark the nodes whose joining time information has been tampered with dishonesty; compare the joining time information of each node with the current system time of the management node in the current blockchain network , to determine the length of time that the node joins the current blockchain network.
  • the processor when the processor executes the computer-readable instructions, the processor further performs the following steps: if it is detected that the node in the current blockchain network satisfies the preset condition, the node is removed from the current blockchain network; wherein, the preset The set conditions include: the scoring result of the node is less than the preset score value and or the node is marked with dishonesty.
  • the step of selecting a node whose duration of joining the current blockchain network satisfies a preset condition as a target node includes:
  • Sort all nodes in the current blockchain network based on the length of time each node has joined the current blockchain network; select a preset number of nodes at the beginning or end of the sorting result as the target node, or, select sorting In the result, the node whose duration of joining the current blockchain network is not greater than the preset time threshold is the target node; among them, the duration of any target node joining the current blockchain network is shorter than that of other nodes except the target node in the current blockchain network The length of time to join the current blockchain network.
  • the step of scoring the target node based on the historical behavior records includes: scoring each historical behavior of each target node as positive or negative, and accumulating the scoring results of all historical behaviors of each node to obtain the score of the target node result.
  • the processor when the processor executes the computer-readable instructions, the processor further performs the following steps: receiving a scoring request from other nodes other than the target node in the current blockchain network; taking the node that issued the scoring request as the target node, and assigning a score to the node Carry out scoring and marking; determine the candidate management node of the current blockchain network based on the number of times of scoring and marking of the target node for scoring and marking and/or changes in the authority of the target node.
  • the realization of all or part of the processes in the methods of the above embodiments can be accomplished by instructing relevant hardware through a computer program, and the computer program can be stored in a computer-readable storage medium, and the program is During execution, it may include the processes of the embodiments of the above-mentioned methods.
  • the aforementioned storage medium may be a non-volatile storage medium such as a magnetic disk, an optical disc, a read-only memory (Read-Only Memory, ROM), or a volatile storage medium, namely a random access memory (Random Access Memory, RAM), etc.

Abstract

La présente demande concerne un procédé et un appareil de gestion de nœud de chaîne de blocs, un dispositif informatique et un support d'enregistrement. Le procédé comprend : la traversée de tous les nœuds dans un réseau de chaîne de blocs actuel pour obtenir des informations temporelles d'un changement d'état de chaque nœud; l'obtention, sur la base des informations temporelles du changement d'état de chaque nœud, de la durée de chaque nœud rejoignant un réseau de chaîne de blocs actuel; la sélection, sur la base de la durée de chaque nœud rejoignant le réseau de chaîne de blocs actuel, en tant que nœuds cibles, des nœuds qui ont rejoint le réseau de chaîne de blocs actuel pendant une durée satisfaisant une condition prédéfinie, et l'octroi aux nœuds cibles d'une première autorisation; l'obtention d'enregistrements de comportement passé de chaque nœud cible dans le réseau de chaîne de blocs actuel, et la notation des nœuds cibles sur la base des enregistrements de comportement passé; et la mise à jour de la première autorisation des nœuds cibles vers une seconde autorisation sur la base du résultat de notation de chaque nœud cible. Dans le présent procédé, la réattribution d'autorisations est basée sur la notation de chaque indicateur de performance des nœuds, de telle sorte qu'une stratégie de gestion affinée de nœuds dans un réseau de chaîne de blocs est obtenue.
PCT/CN2021/097242 2020-12-23 2021-05-31 Procédé et appareil de gestion de nœud de chaîne de blocs, dispositif informatique et support d'enregistrement WO2022134471A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202011537856.4 2020-12-23
CN202011537856.4A CN112738172B (zh) 2020-12-23 2020-12-23 区块链节点的管理方法、装置、计算机设备和存储介质

Publications (1)

Publication Number Publication Date
WO2022134471A1 true WO2022134471A1 (fr) 2022-06-30

Family

ID=75604762

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/097242 WO2022134471A1 (fr) 2020-12-23 2021-05-31 Procédé et appareil de gestion de nœud de chaîne de blocs, dispositif informatique et support d'enregistrement

Country Status (2)

Country Link
CN (1) CN112738172B (fr)
WO (1) WO2022134471A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116502865A (zh) * 2023-06-19 2023-07-28 江西财经大学 一种工业企业生产智能管理方法及系统

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112738172B (zh) * 2020-12-23 2022-03-08 平安科技（深圳）有限公司 区块链节点的管理方法、装置、计算机设备和存储介质
CN113259352A (zh) * 2021-05-13 2021-08-13 深圳壹账通智能科技有限公司 区块链节点安全监控方法、装置、计算机设备和存储介质
CN117201488A (zh) * 2022-05-31 2023-12-08 中国电信股份有限公司 基于区块链的节点管理方法、装置、设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102014135A (zh) * 2010-12-03 2011-04-13 北京航空航天大学 一种用于抵御p2p网络中自私行为的多层信任方法
CN110490593A (zh) * 2018-08-29 2019-11-22 华中科技大学 一种基于存储贡献值的区块链共识方法和系统
CN111818181A (zh) * 2020-08-31 2020-10-23 腾讯科技（深圳）有限公司 基于区块链的数据处理方法、装置及计算机可读存储介质
CN112738172A (zh) * 2020-12-23 2021-04-30 平安科技（深圳）有限公司 区块链节点的管理方法、装置、计算机设备和存储介质

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019124610A1 (fr) * 2017-12-21 2019-06-27 문인식 Procédé d'authentification utilisant une séparation, puis le stockage distribué et combinaison d'informations personnelles utilisant une chaîne de blocs
GB2579635A (en) * 2018-12-07 2020-07-01 Dragon Infosec Ltd A node testing method and apparatus for a blockchain system
CN110533286B (zh) * 2019-07-23 2023-04-18 平安科技（深圳）有限公司 基于区块链的联盟成员管理方法、装置以及计算机设备
CN110493323B (zh) * 2019-07-29 2020-12-01 华南理工大学 基于区块链的公平性文件分发方法、系统及存储介质
CN110427433B (zh) * 2019-08-08 2023-04-07 上海中通吉网络技术有限公司 一种区块链共识方法和存储介质
CN110502578A (zh) * 2019-08-16 2019-11-26 江苏链路区块链技术有限公司 一种快速数据上链的共识机制
CN110955721B (zh) * 2019-10-23 2022-12-06 金蝶软件（中国）有限公司 区块链节点状态维护方法、装置、计算机设备和存储介质
CN111127206B (zh) * 2019-12-25 2021-04-16 中国银联股份有限公司 一种基于智能合约的区块链数据访问控制方法及装置
CN112104517B (zh) * 2020-11-23 2021-02-05 腾讯科技（深圳）有限公司 一种基于区块链网络的数据处理方法及相关装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102014135A (zh) * 2010-12-03 2011-04-13 北京航空航天大学 一种用于抵御p2p网络中自私行为的多层信任方法
CN110490593A (zh) * 2018-08-29 2019-11-22 华中科技大学 一种基于存储贡献值的区块链共识方法和系统
CN111818181A (zh) * 2020-08-31 2020-10-23 腾讯科技（深圳）有限公司 基于区块链的数据处理方法、装置及计算机可读存储介质
CN112738172A (zh) * 2020-12-23 2021-04-30 平安科技（深圳）有限公司 区块链节点的管理方法、装置、计算机设备和存储介质

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116502865A (zh) * 2023-06-19 2023-07-28 江西财经大学 一种工业企业生产智能管理方法及系统

Also Published As

Publication number Publication date
CN112738172A (zh) 2021-04-30
CN112738172B (zh) 2022-03-08

Similar Documents

Publication Publication Date Title
WO2022134471A1 (fr) Procédé et appareil de gestion de nœud de chaîne de blocs, dispositif informatique et support d'enregistrement
CN110868440B (zh) 区块链公链
JP6560308B2 (ja) データ記憶サービスを実装するシステム及び方法
CN109218408B (zh) 区块链系统的共识机制实现方法、介质、计算机设备及区块链系统
CN106537345A (zh) 在多进程计算环境中精确跟踪内存使用
WO2016022720A2 (fr) Procédé et appareil d'identification d'un risque de transaction
CN106537350A (zh) 用于处理数据处理系统中的数据质量异常的方法
WO2022134466A1 (fr) Procédé de traitement de données et dispositif associé
CN111491002B (zh) 设备巡检方法、装置、被巡检设备、巡检服务器及系统
CN105426375A (zh) 一种关系网络的计算方法及装置
CN109460345B (zh) 实时数据的计算方法及系统
CN109033365B (zh) 一种数据处理方法及相关设备
CN107203623B (zh) 网络爬虫系统的负载均衡调节方法
CN111026709B (zh) 基于集群访问的数据处理方法及装置
CN110737673B (zh) 一种数据处理的方法及系统
CN114372060A (zh) 数据存储方法、装置、设备及存储介质
CN115329011A (zh) 数据模型的构建方法、数据查询的方法、装置及存储介质
CN107104829B (zh) 一种基于网络拓扑数据的物理设备匹配分配方法及装置
CN115756955A (zh) 一种数据备份、数据恢复的方法、装置及计算机设备
CN111427871B (zh) 数据处理方法、装置、设备
CN111221847B (zh) 监控数据存储方法、装置及计算机可读存储介质
CN112948469A (zh) 数据挖掘方法、装置、计算机设备及存储介质
CN112202581A (zh) 群组加入方法、装置以及电子设备
US8782364B2 (en) Determining availability of data elements in a storage system
US8407531B2 (en) Method of collecting and correlating locking data to determine ultimate holders in real time

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21908482

Country of ref document: EP

Kind code of ref document: A1