WO2022127122A1 - Dynamic configuration method and apparatus for node permissions in blockchain network - Google Patents

Abstract

The present application relates to a dynamic configuration method and apparatus for node permissions in a blockchain network, a computer device and a storage medium. The method comprises: randomly selecting a node from among all nodes of a current blockchain as a reference node, and constructing a first state tree of the reference node; constructing a second state tree for each of the other nodes except for the reference node in the current blockchain; constructing a third state tree on the basis of each second state tree and the first state tree, wherein the third state tree is used to describe the correlation degree between the second state trees and the first state tree; setting credit rating scores for the other nodes on the basis of the third state tree and a preset credit rating score of the reference node; and setting permissions for each node on the basis of the credit rating scores of each node of the current blockchain. The method above can effectively solve the subjective and centralized problems in existing blockchain technical solutions of difficulties in reasonably allocating permissions for each node and manual management means.

Description

Dynamic configuration method and device for node authority in blockchain network

This application claims the priority of the Chinese patent application filed on December 15, 2020 with the application number 202011473967.3 and the application title is "Method and Device for Dynamically Configuring Node Rights in Blockchain Networks", the entire contents of which are approved by Reference is incorporated in this application.

technical field

The present application relates to the field of blockchain technology, and in particular, to a method, device, computer equipment and storage medium for dynamically configuring node authority in a blockchain network.

Background technique

At present, the functional rights of each node on the blockchain are often the same, which is not fair enough for nodes that make more contributions to the blockchain network. Moreover, each node in the blockchain network often requires manual participation in the main management, including the management of decision-making transactions such as node deletion and node addition. However, for node users, it is often difficult for people to trust their fairness, rationality and security when setting up administrators. And in fact, its subjectivization and centralization are often difficult to achieve true fairness, and different human administrators with different experience, experience, gender, etc. may give different results for the same situation.

Therefore, there is an urgent need for a solution that can realize node authority distribution and overcome the problems of centralization and subjectivity in current blockchain management.

technical problem

Based on this, it is necessary to solve the problem that technicians need to manually write a large amount of code when performing dynamic configuration of node permissions in the blockchain network, and the workload is large, thereby reducing the efficiency of testing, and to provide a blockchain network. A method, apparatus, computer device and storage medium for dynamic configuration of node authority.

technical solutions

A first aspect provides a method for dynamically configuring node permissions in a blockchain network, including:

Randomly select a node from all nodes in the current blockchain as a reference node, and construct a first state tree of the reference node;

respectively constructing the second state tree of each other node except the reference node in the current blockchain;

constructing a third state tree based on each of the second state tree and the first state tree, wherein the third state tree is used to describe the degree of association between the second state tree and the first state tree;

Based on the third state tree and the preset credit rating score of the reference node, configure a credit rating score for each of the other nodes, respectively;

Based on the credit rating scores of each of the nodes in the current blockchain, permissions are configured for each of the nodes respectively.

In one of the embodiments, the constructing the first state tree of the reference node includes:

acquiring first related information of the reference node, and an importance value of the first related information;

Based on the importance level value of the first related information, the first related information is stored in the first state tree.

In one of the embodiments, the step of constructing the second state tree of each other node other than the reference node in the current blockchain includes:

Obtain the resource idle value of the other node;

Based on the resource idle values of the other nodes, generating an access sequence table of all the other nodes according to a preset rule;

Access the other nodes one by one based on the access sequence table to obtain second related information of each of the other nodes;

The second state tree of each of the other nodes is constructed based on the second related information of each of the other nodes.

In one of the embodiments, the constructing a third state tree based on each of the second state tree and the first state tree includes:

generating a base tree without data, wherein the base tree, the first state tree and the second state tree have the same structure;

Traverse the first state tree and the second state tree respectively, and perform the same-level magnification processing on the first element on the first state tree and the second element on the second state tree, wherein the The position of the first element on the first state tree is the same as the position of the second element on the second state tree;

Comparing the enlarged first element and the enlarged second element to obtain the degree of association between the first element and the second element;

Filling the basic tree with the degree of association between the first element and the second element to obtain the third state tree.

In one of the embodiments, configuring permissions for each node respectively includes:

The permissions are dynamically configured for each node according to the state of the pre-divided time period.

In one embodiment, after configuring permissions for each node based on the credit rating score of each node in the current blockchain network, the method further includes:

Based on the credit rating scores of all nodes in the current blockchain, the time for the next permission configuration is calculated.

In one embodiment, the time for calculating the next permission configuration based on the credit rating scores of all nodes in the current blockchain includes:

Based on the evenness of the credit rating scores of all nodes in the current blockchain, the length of the next dynamic configuration time is calculated, wherein the size of the evenness is described by the size of the standard deviation of the credit rating scores.

A second aspect provides a device for dynamically configuring node permissions in a blockchain network, including:

a first state tree construction unit, configured to randomly select a node from all the nodes of the current blockchain as a reference node, and construct a first state tree of the reference node;

The second state tree construction unit is used to respectively construct the second state tree of each other node other than the reference node in the current blockchain;

A third state tree construction unit, configured to construct a third state tree based on each of the second state tree and the first state tree, wherein the third state tree is used to describe the second state tree and the first state tree The relevance of the state tree;

a credit rating unit, configured to respectively configure a credit rating score for each of the other nodes based on the third state tree and the preset credit rating score of the reference node;

The authority configuration unit is used to configure authority for each of the nodes respectively based on the credit rating score of each of the nodes in the current blockchain.

A third aspect provides a computer device, including a memory and a processor, wherein the memory stores computer-readable instructions, and when the computer-readable instructions are executed by the processor, the processor causes the processor to execute the above-mentioned Steps of a dynamic configuration method for node permissions in a blockchain network.

A fourth aspect provides a storage medium storing computer-readable instructions. When the computer-readable instructions are executed by one or more processors, the one or more processors cause the one or more processors to execute the above-mentioned nodes in the blockchain network. The steps of the dynamic configuration method of permissions.

beneficial effect

The method, device, computer equipment and storage medium for dynamic configuration of node authority in the above-mentioned blockchain network, first, randomly select a node from all nodes in the current blockchain as a reference node, and construct the first state of the reference node Then, respectively constructing the second state tree of each other node except the reference node in the current blockchain; and respectively constructing the second state tree of each other node except the reference node in the current blockchain; Then, based on the third state tree and the preset credit rating score of the reference node, respectively configure a credit rating score for each of the other nodes; finally, based on the credit rating score of each of the nodes in the current blockchain, Configure permissions for each of the nodes separately. This realizes the automatic and non-manual dynamic setting of reasonable permissions for each node, thereby solving the problems of centralization and subjectivity in the current blockchain management.

Description of drawings

1 is a block diagram of the internal structure of a computer device in one embodiment;

2 is a flowchart of a method for dynamically configuring node permissions in a blockchain network in one embodiment;

3 is another flowchart of a method for dynamically configuring node permissions in a blockchain network in one embodiment;

FIG. 4 is a structural block diagram of an apparatus for dynamically configuring node authority in a blockchain network in one embodiment.

Embodiments of the present invention

In order to make the purpose, technical solutions and advantages of the present application more clearly understood, the present application will be described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application, but not to limit the present application.

It will be understood that the terms "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, without departing from the scope of this application, a dynamic configuration script for node permissions in a first blockchain network may be referred to as a dynamic configuration script for node permissions in a second blockchain network, and similarly, The dynamic configuration script of the node authority in the second blockchain network may be referred to as the dynamic configuration script of the node authority in the second blockchain network.

In an implementation environment of a method for dynamically configuring node permissions in a blockchain network provided in one embodiment, a computer device and a node (eg, server) of the blockchain 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. When configuration is required, a dynamic configuration request for node permissions in the blockchain network can be sent to the computer device, and the computer device receives the dynamic configuration request for node permissions in the blockchain network, dynamically configures the nodes of the blockchain, and obtains Dynamic configuration results of node permissions in a blockchain network.

It should be noted that the computer device may be a smart phone, a tablet computer, a notebook computer, a desktop computer, etc., but is not limited thereto. The computer equipment and the terminal may be connected through Bluetooth, USB (Universal Serial Bus, Universal Serial Bus) or other communication connection methods, which are not limited in this application.

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. Wherein, the non-volatile storage medium of the computer device stores an operating system, a database and computer-readable instructions, and the database may store a sequence of control information. When the computer-readable instructions are executed by the processor, the processor can realize a A dynamic configuration method for node permissions in a blockchain network. 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 dynamically configuring node authority in a blockchain network. The network interface of the computer equipment is used for communication with the terminal connection. Those skilled in the art can understand that the structure shown in 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.

As shown in Figure 2, in one embodiment, a method for dynamically configuring node permissions in a blockchain network is proposed, which may specifically include the following steps:

Step 201: Randomly select a node from all nodes in the current blockchain as a reference node, and construct a first state tree of the reference node.

Among them, all the nodes of the current blockchain can be Q1, Q2, ... Qn, n represents the number of nodes, and the randomly selected node can be Qi, i=1, 2, 3, ... n, for example.

In this step, the construction of the first state tree is to store the relevant information (ie, the first relevant information) of the reference node based on the state tree. The degree value stores the first related information of the reference node sequentially from top to bottom.

In some embodiments, the construction of the first state tree of the reference node in the above step 201 may include:

Step 201a: Obtain the first related information of the reference node and the importance level value of the first related information.

Among them, the relevant information of the benchmark node may include but not limited to the number of transaction submissions, the number of transaction queries performed, the number of transaction endorsements, how many transaction endorsements are the same as the final result, the size of the computing power, and the storage space shared by the blockchain network. Size, how many blocks are output to help other blocks synchronize, time to join the current blockchain network, historical credit score records, the number of nodes that communicate with the node, the activity of the node, the load rate of the node, etc. Wait.

The important value of the first relevant information can be set based on experience or the business performed (such as stock trading business). For example, the relevant information of the benchmark node includes the number of transaction submissions, the number of executed transaction queries, the number of transaction endorsements, the number of times of joining the current blockchain network The order of the important values of the first related information may be that the related information of the reference node includes the number of transaction submissions>the number of transaction endorsements>the time of joining the current blockchain network>the number of executed transaction queries.

Step 201b, based on the importance value of the first related information, store the first related information in the first state tree.

Among them, top and bottom refer to the node positions in the state tree, that is, the top is the parent node, and the bottom is the child node. in a state tree. Specifically, related information with high importance and high importance (high importance value) in the first state tree can often be the parent node of related information with relatively low importance and low importance (low importance value), and the information with the lowest importance is basically distributed. on leaf nodes.

Further, in some embodiments, the current blockchain may include, but is not limited to, a consortium chain, a public chain, or a private chain, and the like.

Step 202: Construct the second state tree of each other node except the reference node in the current blockchain, respectively.

Among them, each node in other nodes other than the reference node in the current blockchain corresponds to a second state tree, that is, all nodes in the current blockchain correspond to a state tree, that is, the number of all state trees The sum of (all second state trees and one first state tree) is the sum of the number of nodes in the current blockchain.

In this step, the construction of the second state tree is to store the related information (ie, the second related information) of other nodes based on the state tree. The second state tree of each other node is constructed with reference to the structure of the first root node, that is, the structure of each second state tree is exactly the same as that of the second state tree. For example, the second state tree is also used to store the second related information of the reference node in order from top to bottom according to the importance value of the second related information of other nodes.

Of course, the relevant information (i.e. the second relevant information) of other nodes (i.e. nodes other than the reference node in the current blockchain) also includes but is not limited to the number of transaction submissions, the number of transaction queries performed, the number of transaction endorsements, and the number of transactions. The endorsement is the same as the final result, the size of the computing power, the size of the storage space shared by the blockchain network, how many blocks are output to help other blocks synchronize, the time of joining the current blockchain network, the historical credit evaluation score record, and the The number of nodes that the node communicates with, the activity of the node, the load rate of the node, and so on.

Of course, the construction process of any second state tree is the same as the construction process of the first state tree, that is, first, the importance of any other node-related information is sorted; then, the nodes are related in descending order of importance. The information is stored in the second state tree from top to bottom, so that the second state tree of the ordered tree structure can be generated.

In some embodiments, in the above step 202, the second state tree of each other node other than the reference node in the current blockchain is respectively constructed, which may include:

Step 202a: Obtain resource idle values of other nodes.

Among them, other nodes refer to all nodes other than the reference node in the current blockchain. The resources of the nodes are the network resources of the blockchain, which can include computing resources and storage resources. The resource idle value refers to the unused computing resources and storage resources.

Step 202b: Based on the resource idle values of other nodes, generate access sequence tables of all other nodes according to preset rules.

The preset rule is to generate an access sequence table of nodes in descending order of resource idle value, that is, a node with a large resource idle value in the access sequence table is ranked first, and a node with a small resource idle value is ranked at the back.

It can be understood that, by accessing each other node, the related information (ie the second related information) of the other node is obtained, and before accessing each other node, the resource idle value of the other node is obtained first. In this step, the step of obtaining the idle value of node resources may be performed once before accessing all other nodes, and then an access sequence table may be obtained. Of course, it is also possible to obtain the resource idle value of other nodes that have not been visited at a predetermined time interval, and then, it is also possible to generate an access sequence table according to the currently obtained resource idle value of other nodes. During the process of accessing the node and obtaining the second related information of the other node, at least two sequential access sequence tables will be generated.

Step 202c: Access other nodes one by one based on the access sequence table to obtain second related information of each other node.

It can be understood that, by referring to the relevant information (first relevant information) of the reference node, relevant information (second relevant information) of other nodes is obtained, that is, the type of the second relevant information of other nodes and the first relevant information of the reference node. The types of relevant information are the same. For example, if the relevant information of the benchmark node (the first relevant information) is the number of transaction submissions, the number of transaction queries performed, the number of transaction endorsements, how many transaction endorsements are the same as the final result, and the computing power size, then the related information (second related information) of other nodes is also the number of transaction submissions, the number of transaction queries performed, the number of transaction endorsements, how many transaction endorsements are the same as the final result, and the size of the computing power.

Step 202d, constructing a second state tree of each other node based on the second related information of each other node.

In this embodiment, the corresponding nodes are accessed one by one according to the order of the nodes in the access sequence table to obtain the node-related information, and the nodes with more redundant resources are preferentially accessed, which helps to provide the corresponding access process faster. Historical records provide the longest possible preparation time for nodes with relatively insufficient resources, thereby increasing the speed of access to all other nodes.

Step 203: Build a third state tree based on each of the second state trees and the first state tree, where the third state tree is used to describe the degree of association between the second state tree and the first state tree.

It can be understood that the third state tree is used to describe the degree of association between the first state tree and the second state tree, and essentially describes the degree of association between each other node and the reference node. The degree of association is specifically the third state tree corresponding to the second state tree, or each other node other than the reference node of the blockchain corresponds to a third state tree one by one. The third state tree also has the same structure as the first state tree and the second state tree.

Further, the first element on the first state tree and the second element on the second state tree at the same position, where an element on the first state tree and the second state tree refers to a piece of related information of the node , that is, the number of pieces of first related information (related information) of the reference node may be m, and the first state tree has m elements. The calculation process of the degree of association between the first state tree and the second state tree may include, but is not limited to: performing the same-level amplification process on the first element and the second element respectively, and the same-level amplification process may include, for example, cubic calculation, exponential power Calculation, etc., and then compare the amplified results, for example, it can be a difference comparison or a quotient comparison, so as to obtain the degree of correlation between the first element and the second element. After all elements are all calculated above, it can be completed. Complements to all values on the third state tree.

In some embodiments, in the above step 203, based on each second state tree and the first state tree, a third state tree is constructed, which may include:

Step 203a, constructing a basic tree without data, wherein the basic tree, the first state tree and the second state tree have the same structure.

It can be understood that the same structure of the basic tree, the first state tree and the second state tree means that the number of branches of the state tree and the relationship between the parent node and the child node are the same.

Step 203b, traverse the first state tree and the second state tree respectively, and perform the same-level magnification processing on the first element on the first state tree and the second element on the second state tree, wherein the first element is in the first state tree. The position on the state tree is the same as the position of the second element on the second state tree.

Among them, the first state tree and the second state tree are traversed respectively, and the first element on the first state tree and the second element on the second state tree at the same position are respectively subjected to the same-level amplification process. In the embodiment, the same-level amplification method may include, but is not limited to, performing cubic calculation, exponential power calculation, etc., and compare the two, and the comparison method may include, but is not limited to, performing division or subtraction calculation processing.

Step 203c: Compare the enlarged first element with the enlarged second element to obtain the degree of association between the first element and the second element.

Among them, comparing the amplified results, the comparison method may include but not limited to performing division or subtraction calculation processing, for example, it may be a difference comparison or a quotient comparison, so as to obtain the degree of association between the first element and the second element, Then, data for filling the corresponding position elements of the basic tree is obtained.

Step 203d: Fill the basic tree with the degree of association between the first element and the second element to obtain a third state tree.

It can be understood that, after all the above-mentioned calculations are performed on all elements, the addition of all the values on the third state tree can be completed. The two are compared, and the comparison method may include, but is not limited to, dividing or subtracting, so as to obtain data for filling corresponding position elements of the basic tree. For example, A represents the first element, B represents the second element, the element used to fill the corresponding position of the basic tree in this application is C=A ³ ÷ B ³ ; for another example, the element used to fill the corresponding position of the basic tree C=e ^A − e ^B and so on. Of course, the value filled in the corresponding positions of the first state tree and the second state tree on the basic tree is the degree of association between the first element and the second element. That is, the position of the first element in the first state tree is the same as the position of the second element in the second state tree, and the position of the association degree in the third state tree is the same as that of the first element in the first state tree. It is in the same position in the state tree.

Step 204: Based on the third state tree and the preset credit rating score of the reference node, configure a credit rating score for each other node, respectively.

The other nodes refer to nodes other than the reference node in the current blockchain, and the reference node has a pre-configured credit rating score according to the relevant information stored in the first state tree. Each other node also has a credit rating score, the difference is that the configuration credit rating score of each other node is obtained based on the third state tree and the preset credit rating score of the benchmark node. The third state tree reflects the comparison result of the second element (second related information) of the second state tree (other nodes) and the first element (first related information) of the first state tree (reference node). For example, the configuration credit rating score of other nodes can be: on the basis of the score of the benchmark node, the credit rating score is calculated for other nodes according to the set rules, specific example 1: the number of transactions of other nodes (a certain element, that is, the second element) is based on the score of the benchmark node when the number of transactions of the benchmark node (an element of the second state tree, that is, the first element) is 50 times more than the comparison result of the first element and the second element) Add 5 points as the credit rating score of the target node; specific example 2: When the storage capacity is 1G less than that of the base node, reduce 1 point based on the score of the benchmark node and use it as the credit rating score of the target node.

In this embodiment, the credit rating score of the reference node can be used as a benchmark, and the third state tree corresponding to each other node can be used as a comparison standard, and further credit rating scores can be configured for other nodes based on the credit rating score of the benchmark node. Therefore, the present embodiment can determine the credit rating scores of other nodes on the basis of the reference node.

Step 205: Based on the credit rating scores of each node of the current blockchain, configure permissions for each node respectively.

In this step, the authority is dynamically configured for each node according to the state of the pre-divided time period.

The specified time period may include when the blockchain network is not busy, such as but not limited to the time period when the node transaction rate is the least, the time period when the entire blockchain is transporting the least blocks, etc.

In some embodiments, the authority of the node may include, but is not limited to, the read authority of the ledger, the write authority of the ledger, the block transmission authority, the block storage authority, the transaction endorsement authority, the transaction submission authority, etc.; wherein, the ledger, for example, can be It is Hyperledger (Fabric).

In this embodiment, the above steps 201 to 205 may be dynamically executed processes. Step 201 may be returned to restart a new round of dynamic permission configuration after a preset time period after the current process ends. In the permission configuration scheme, the number of permission configurations and the level of permission configuration can be determined according to the credit rating score. For example, for a node whose credit rating score exceeds the first set value, almost or even all permissions can be assigned to it. It can include high-level permissions, and for nodes with low credit rating scores, the number of permissions that may be obtained is not large, and the level of permissions generally obtained will be relatively low; and the permissions provided by this embodiment are fully automated, objective, and decentralized. , there will be no problem of human subjectivity, it is trustworthy for users, and the automatic configuration scheme runs continuously with the continuous work of the blockchain, and the authority of the node can be increased or decreased with the change of the working status of each node and the degree of dedication and other conditions .

In some modified implementations of the embodiments of the present application, as shown in FIG. 3 , after the above step 205 , the method further includes: step 206 : Calculate the time for the next permission configuration based on the credit rating scores of all nodes in the current blockchain .

Among them, based on the credit rating scores of all nodes in the current blockchain, the time (length of time) for the next permission configuration is calculated. For example, when the uniformity value is small, the next dynamic configuration is performed after the first duration, and when the uniformity value is large, the next dynamic configuration of permissions is performed after the second duration, where the first duration < the second duration, the first duration For example, it may be 3 days, and the second duration may be, for example, 7 days or 10 days.

Further, in some embodiments, the evenness calculation method is preferably standard deviation result calculation, that is, the size of the evenness is described by the size of the standard deviation.

S ² =[(X1-X) ² +(X2-X) ² …+(Xn-X) ² ]/n

Among them, S represents the standard deviation, X1...Xn represents the credit rating score of each node, X=(X1+ X2+...+ Xn)/n represents the average value of the credit rating scores of all nodes, and n represents the current blockchain network. The total number.

As shown in FIG. 4 , in one embodiment, a device for dynamically configuring node permissions in a blockchain network is provided, and the device for dynamically configuring node permissions in the blockchain network may include:

The first state tree construction unit 411 is used to randomly select a node from all the nodes of the current blockchain as the reference node, and construct the first state tree of the reference node;

The second state tree construction unit 412 is used to respectively construct the second state tree of each other node except the reference node in the current blockchain;

The third state tree construction unit 413 is configured to construct a third state tree based on each second state tree and the first state tree, wherein the third state tree is used to describe the degree of association between the second state tree and the first state tree;

A credit rating unit 414, configured to configure a credit rating score for each other node based on the third state tree and the preset credit rating score of the reference node;

The authority configuration unit 415 is configured to respectively configure authority for each node based on the credit rating score of each node in the current blockchain.

In one embodiment, a computer device is proposed. The computer device includes a memory, a processor, and a computer program stored in the memory and running on the processor. When the processor executes the computer program, the following steps are implemented: One of the nodes in the chain is randomly selected as the reference node, and the first state tree of the reference node is constructed; the second state tree of each other node except the reference node in the current blockchain is respectively constructed; based on each second state tree and The first state tree is used to construct a third state tree, wherein the third state tree is used to describe the degree of association between the second state tree and the first state tree; Other nodes are configured with credit rating scores; based on the credit rating scores of each node in the current blockchain, permissions are configured for each node respectively.

In one embodiment, the construction of the first state tree of the reference node by the processor includes: acquiring first related information of the reference node, and an importance level value of the first related information; based on the importance level value of the first related information , and store the first related information in the first state tree.

In one embodiment, constructing the second state tree of each other node except the reference node in the current blockchain, executed by the processor, includes: acquiring the resource idle value of other nodes; based on the resource idle value of other nodes, according to The preset rules generate the access sequence table of all other nodes; access other nodes one by one based on the access sequence table to obtain the second related information of each other node; based on the second related information of each other node, construct the first related information of each other node. Two-state tree.

In one embodiment, the processing performed by the processor to construct the third state tree based on each of the second state tree and the first state tree includes: constructing a base tree without data, wherein the base tree, the first state tree and the second state tree The structure of the state tree is the same; the first state tree and the second state tree are traversed respectively, and the first element on the first state tree and the second element on the second state tree are respectively amplified at the same level. The position on the first state tree is the same as the position of the second element on the second state tree; compare the enlarged first element and the enlarged second element, and obtain the difference between the first element and the second element The degree of association between the first element and the second element is filled into the basic tree to obtain the third state tree.

In one embodiment, what the processor executes to dynamically configure permissions for each node, respectively, includes: dynamically configuring permissions for each node according to the state of a pre-divided time period.

In one embodiment, when the processor executes the computer-readable instructions, the processor further performs the following steps: calculating the time for the next permission configuration based on the credit rating scores of all nodes in the current blockchain.

In one embodiment, a storage medium is provided that stores computer-readable instructions that, when executed by one or more processors, cause the one or more processors to perform the following steps: One of the nodes in the chain is randomly selected as the reference node, and the first state tree of the reference node is constructed; the second state tree of each other node except the reference node in the current blockchain is respectively constructed; based on each second state tree and The first state tree is used to construct a third state tree, wherein the third state tree is used to describe the degree of association between the second state tree and the first state tree; Other nodes are configured with credit rating scores; based on the credit rating scores of each node in the current blockchain, permissions are configured for each node respectively.

Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be implemented by instructing relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage In the medium, when the computer program is executed, it may include the processes of the above-mentioned method embodiments. Wherein, any reference to memory, storage, database or other medium provided in this application and used in the embodiments may include non-volatile and/or volatile memory. Nonvolatile memory may include read only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double-rate SDRAM (SSRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

It should be noted that, herein, the terms "comprising", "comprising" or any other variation thereof are intended to encompass non-exclusive inclusion, such that a process, device, article or method comprising a series of elements includes not only those elements, It also includes other elements not expressly listed or inherent to such a process, apparatus, article or method. Without further limitation, an element qualified by the phrase "comprising a..." does not preclude the presence of additional identical elements in the process, apparatus, article, or method that includes the element.

The above are only the preferred embodiments of the present application, and are not intended to limit the scope of the patent of the present application. Any equivalent structure or equivalent process transformation made by using the contents of the description and drawings of the present application, or directly or indirectly applied to other related The technical field is similarly included in the scope of patent protection of this application.

Claims (20)

1. A method for dynamically configuring node permissions in a blockchain network, comprising:

   Randomly select a node from all nodes in the current blockchain as a reference node, and construct a first state tree of the reference node;

   respectively constructing the second state tree of each other node except the reference node in the current blockchain;

   constructing a third state tree based on each of the second state tree and the first state tree, wherein the third state tree is used to describe the degree of association between the second state tree and the first state tree;

   Based on the third state tree and the preset credit rating score of the reference node, configure a credit rating score for each of the other nodes, respectively;

   Based on the credit rating scores of each of the nodes in the current blockchain, permissions are configured for each of the nodes respectively.
2. The method for dynamically configuring node authority in a blockchain network according to claim 1, wherein the constructing the first state tree of the reference node comprises:

   acquiring first related information of the reference node, and an importance value of the first related information;

   Based on the importance level value of the first related information, the first related information is stored in the first state tree.
3. The method for dynamically configuring node authority in a blockchain network as claimed in claim 1, wherein said constructing the second state tree of each other node other than the reference node in the current blockchain respectively comprises:

   Obtain the resource idle value of the other node;

   Based on the resource idle values of the other nodes, generating an access sequence table of all the other nodes according to a preset rule;

   Access the other nodes one by one based on the access sequence table to obtain second related information of each of the other nodes;

   The second state tree of each of the other nodes is constructed based on the second related information of each of the other nodes.
4. The method for dynamically configuring node authority in a blockchain network according to claim 1, wherein the constructing a third state tree based on each of the second state tree and the first state tree comprises:

   generating a base tree without data, wherein the base tree, the first state tree and the second state tree have the same structure;

   Traverse the first state tree and the second state tree respectively, and perform the same-level magnification processing on the first element on the first state tree and the second element on the second state tree, wherein the The position of the first element on the first state tree is the same as the position of the second element on the second state tree;

   Comparing the enlarged first element and the enlarged second element to obtain the degree of association between the first element and the second element;

   Filling the basic tree with the degree of association between the first element and the second element to obtain the third state tree.
5. The method for dynamically configuring node permissions in a blockchain network according to claim 1, wherein the configuring permissions for each node respectively includes:

   The permissions are dynamically configured for each node according to the state of the pre-divided time period.
6. The method for dynamically configuring node authority in a blockchain network according to claim 1, wherein, after configuring the authority for each node based on the credit rating score of each node in the current blockchain network, the method further comprises:

   Based on the credit rating scores of all nodes in the current blockchain, the time for the next permission configuration is calculated.
7. The method for dynamically configuring node authority in a blockchain network according to claim 2, wherein the calculation of the time for the next authority configuration based on the credit rating scores of all nodes in the current blockchain includes:

   Based on the uniformity of the credit rating scores of all nodes in the current blockchain, the length of the next dynamic configuration time is calculated, wherein the uniformity is described by the size of the standard deviation of the credit rating scores.
8. A device for dynamically configuring node authority in a blockchain network, comprising:

   a first state tree construction unit, configured to randomly select a node from all the nodes of the current blockchain as a reference node, and construct a first state tree of the reference node;

   The second state tree construction unit is used to respectively construct the second state tree of each other node other than the reference node in the current blockchain;

   A third state tree construction unit, configured to construct a third state tree based on each of the second state tree and the first state tree, wherein the third state tree is used to describe the second state tree and the first state tree The relevance of the state tree;

   a credit rating unit, configured to respectively configure a credit rating score for each of the other nodes based on the third state tree and the preset credit rating score of the reference node;

   The authority configuration unit is used to configure authority for each of the nodes respectively based on the credit rating score of each of the nodes in the current blockchain.
9. A computer device, wherein the electronic device includes a memory, a processor, and computer-readable instructions stored in the memory and executable on the processor, when the processor executes the computer-readable instructions Perform the following steps:

   Randomly select a node from all nodes in the current blockchain as a reference node, and construct a first state tree of the reference node;

   respectively constructing the second state tree of each other node except the reference node in the current blockchain;

   constructing a third state tree based on each of the second state tree and the first state tree, wherein the third state tree is used to describe the degree of association between the second state tree and the first state tree;

   Based on the third state tree and the preset credit rating score of the reference node, configure a credit rating score for each of the other nodes, respectively;

   Based on the credit rating scores of each of the nodes in the current blockchain, permissions are configured for each of the nodes respectively.
10. The computer device according to claim 9, wherein the constructing the first state tree of the reference node comprises:

    acquiring first related information of the reference node, and an importance value of the first related information;

    Based on the importance level value of the first related information, the first related information is stored in the first state tree.
11. The computer device according to claim 9, wherein said constructing the second state tree of each other node other than the reference node in the current blockchain, comprising:

    Obtain the resource idle value of the other node;

    Based on the resource idle values of the other nodes, generating an access sequence table of all the other nodes according to a preset rule;

    Access the other nodes one by one based on the access sequence table to obtain second related information of each of the other nodes;

    The second state tree of each of the other nodes is constructed based on the second related information of each of the other nodes.
12. The computer device of claim 9, wherein the building a third state tree based on each of the second state tree and the first state tree comprises:

    generating a base tree without data, wherein the base tree, the first state tree and the second state tree have the same structure;

    Traverse the first state tree and the second state tree respectively, and perform the same-level magnification processing on the first element on the first state tree and the second element on the second state tree, wherein the The position of the first element on the first state tree is the same as the position of the second element on the second state tree;

    Comparing the enlarged first element and the enlarged second element to obtain the degree of association between the first element and the second element;

    Filling the basic tree with the degree of association between the first element and the second element to obtain the third state tree.
13. The computer device according to claim 9, wherein the configuring permissions for each node respectively comprises:

    The permissions are dynamically configured for each node according to the state of the pre-divided time period.
14. The computer device according to claim 9, wherein after the authority is configured for each node based on the credit rating score of each node of the current blockchain network, the processor also executes the computer-readable instruction when executing the computer-readable instruction. Perform the following steps:

    Based on the credit rating scores of all nodes in the current blockchain, the time for the next permission configuration is calculated.
15. The computer device according to claim 10, wherein the time for calculating the next permission configuration based on the credit rating scores of all nodes in the current blockchain includes:

    Based on the uniformity of the credit rating scores of all nodes in the current blockchain, the length of the next dynamic configuration time is calculated, wherein the uniformity is described by the size of the standard deviation of the credit rating scores.
16. A computer-readable storage medium, wherein the computer-readable storage medium stores at least one instruction, and when the at least one instruction is executed by a processor, the following steps are performed when implemented:

    Randomly select a node from all nodes in the current blockchain as a reference node, and construct a first state tree of the reference node;

    respectively constructing the second state tree of each other node except the reference node in the current blockchain;

    constructing a third state tree based on each of the second state tree and the first state tree, wherein the third state tree is used to describe the degree of association between the second state tree and the first state tree;

    Based on the third state tree and the preset credit rating score of the reference node, configure a credit rating score for each of the other nodes, respectively;

    Based on the credit rating scores of each of the nodes in the current blockchain, permissions are configured for each of the nodes respectively.
17. The computer-readable storage medium of claim 16, wherein the constructing the first state tree of the reference node comprises:

    acquiring first related information of the reference node, and an importance value of the first related information;

    Based on the importance level value of the first related information, the first related information is stored in the first state tree.
18. The computer-readable storage medium according to claim 16, wherein said constructing the second state tree of each other node other than the reference node in the current blockchain, comprising:

    Obtain the resource idle value of the other node;

    Based on the resource idle values of the other nodes, generating an access sequence table of all the other nodes according to a preset rule;

    Access the other nodes one by one based on the access sequence table to obtain second related information of each of the other nodes;

    The second state tree of each of the other nodes is constructed based on the second related information of each of the other nodes.
19. The computer-readable storage medium of claim 16, wherein the building a third state tree based on each of the second state tree and the first state tree comprises:

    generating a base tree without data, wherein the base tree, the first state tree and the second state tree have the same structure;

    Traverse the first state tree and the second state tree respectively, and perform the same-level magnification processing on the first element on the first state tree and the second element on the second state tree, wherein the The position of the first element on the first state tree is the same as the position of the second element on the second state tree;

    Comparing the enlarged first element and the enlarged second element to obtain the degree of association between the first element and the second element;

    Filling the basic tree with the degree of association between the first element and the second element to obtain the third state tree.
20. The computer-readable storage medium according to claim 16, wherein the configuring permissions for each node respectively comprises:

    The permissions are dynamically configured for each node according to the state of the pre-divided time period.