Block chain supervision system distributed authentication optimization method and system

Abstract

The invention provides a distributed authentication optimization method and system for a block chain supervision system. The method comprises the following steps: constructing an initial Laplacian matrix of a distributed authentication communication network structure; calculating a first algebraic connectivity corresponding to the initial Laplacian matrix; calculating an influence value of information communication after the new relay node is added to the distributed authentication communication network structure; and optimizing a distributed authentication communication network structure according to the influence value of the information communication. According to the distributed authentication optimization method for the block chain supervision system, after the whole supervision network is connected, the data communication efficiency among all nodes is the highest.

Description

Technical Field

[0001] The present invention relates to blockchain technology, and in particular to a distributed authentication optimization method and system for a blockchain supervision system. Background Art

[0002] When executing supervision instructions, the supervision system needs to authenticate the instructions to ensure the normal supervision operation process. In the blockchain supervision system, since the distributed supervision engine is deployed on each independent node, in order to improve the response speed of each engine, it is often not possible to adopt a centralized authentication mode, but a distributed authentication mode. However, the gradual increase in network nodes has led to the need for data communication between distributed authentication modules to ensure real-time update of authentication information.

[0003] However, there are often many different types of blockchains in the blockchain system, which makes it impossible for data to communicate directly. Therefore, it is necessary to introduce relay nodes to help achieve cross-chain communication. Figure 1 As shown in the figure, there are 3 supervision chains A (5 nodes), B (5 nodes), and C (6 nodes). There is a distributed authentication module on each node. They can communicate within their own chains, but cannot communicate between chains. Therefore, we need to introduce a relay node D1 to connect a node in A with a node in B, and use a relay node D2 to connect a node in B with a node in C, so that all distributed authentication modules can communicate. However, different connection methods make the data communication efficiency between nodes different, and it is necessary to select appropriate communication nodes for connection.

[0004] The above problems need to be solved urgently. Summary of the invention

[0005] Based on the above-mentioned problems existing in the prior art, the purpose of the embodiments of the present invention is to provide a distributed authentication optimization method and system for a blockchain supervision system, so that when the entire supervision network is connected, the data communication efficiency between all nodes is the highest.

[0006] The technical solution adopted by the present invention to solve its technical problem is: a distributed authentication optimization method for a blockchain supervision system, comprising: S1, constructing an initial Laplace matrix of a distributed authentication communication network structure;

[0007] S2, calculating the first algebraic connectivity corresponding to the initial Laplace matrix;

[0008] S3, calculating the impact value of adding a new relay node to the distributed authentication communication network structure;

[0009] S4, optimizing the distributed authentication communication network structure according to the impact value of the information communication.

[0010] Furthermore, in S2, the initial Laplace matrix for constructing the distributed authentication communication network structure includes:

[0011] Step S11, numbering all nodes in the distributed authentication communication network structure in sequence;

[0012] Step S12, constructing an adjacency matrix according to all direct communication relationships in the distributed authentication communication network structure;

[0013] Step S13, generating a degree matrix based on the adjacency matrix;

[0014] Step S14, calculating an initial Laplacian matrix according to the adjacency matrix and the degree matrix.

[0015] Further, the calculating of the initial Laplace matrix according to the adjacency matrix and the degree matrix includes: the calculation of the initial Laplace matrix is ​​performed based on the adjacency matrix and the degree matrix, and the calculation formula of the initial Laplace matrix is:

[0016] L=DW

[0017] Among them, L is the initial Laplace matrix, D is the degree matrix, and W is the adjacency matrix.

[0018] Further, in S2, the calculating the first algebraic connectivity corresponding to the initial Laplace matrix includes:

[0019] Step S21, performing eigenvalue decomposition on the initial Laplace matrix and sorting the eigenvalues ​​from small to large;

[0020] Step S22, taking the second smallest eigenvalue as the first algebraic connectivity λ of the distributed authentication communication network structure.

[0021] Further, in S3, the calculation of the impact value of adding a new relay node to the distributed authentication communication network structure on information communication includes:

[0022] Step S31, generating a first matrix for the distributed authentication communication network structure after adding a new relay node;

[0023] Step S32, calculating a new Laplace matrix according to the first matrix;

[0024] Step S33, calculating the second algebraic connectivity according to the new Laplace matrix;

[0025] Step S34, calculating the influence value of information communication according to the first algebraic connectivity and the second algebraic connectivity.

[0026] Further, in S4, the optimizing the distributed authentication communication network structure according to the impact value of the information communication includes:

[0027] Step S41, adding other relay nodes, and repeatedly calculating the impact value of the newly added relay nodes on the information communication of the distributed authentication communication network structure;

[0028] Step S42, sorting the influence values ​​corresponding to the newly added relay nodes, selecting the relay node with the largest influence value according to the number of relay nodes that can be added, and establishing a corresponding number of relay nodes as a distributed authentication network optimization structure.

[0029] Further, the influence values ​​corresponding to the newly added relay nodes are sorted, and according to the number of relay nodes that can be added, the relay node with the largest influence value is selected, and a corresponding number of relay nodes are established as a distributed authentication network optimization structure, including: presetting the number of relay nodes that can be added to be m, wherein the influence values ​​corresponding to the newly added relay nodes are expressed in order from small to large as v1≤v2≤...≤v m The number of edges can be increased to k, and the k relay nodes with the largest influence values ​​can be selected from right to left in turn to ensure that the k relay nodes that are most helpful in improving the efficiency of information communication are accurately selected to achieve the optimization of the distributed authentication network structure.

[0030] The present invention also provides a distributed authentication optimization system for a blockchain supervision system, the system comprising:

[0031] Matrix building module, used to build the Laplace matrix of distributed authentication communication network structure;

[0032] an algebraic connectivity calculation module, used to calculate a first algebraic connectivity corresponding to the initial Laplace matrix;

[0033] An impact value calculation module, used to calculate the impact value of information communication after adding a new relay node to the distributed authentication communication network structure;

[0034] The network structure optimization module is used to optimize the distributed authentication communication network structure according to the impact value of the information communication. The present invention also provides a computer-readable storage medium, in which one or more instructions are stored, and the one or more instructions execute the distributed authentication optimization method of the blockchain supervision system as described above.

[0035] The present invention also provides an electronic device, comprising: a memory and a processor; the memory stores at least one program instruction; the processor implements the above-mentioned distributed authentication optimization method of the blockchain supervision system by loading and executing the at least one program instruction.

[0036] The beneficial effects of the present invention are as follows: the distributed authentication optimization method of the blockchain supervision system provided by the present invention includes: constructing the initial Laplace matrix of the distributed authentication communication network structure; calculating the first algebraic connectivity corresponding to the initial Laplace matrix; calculating the impact value of information communication after adding a new relay node to the distributed authentication communication network structure; optimizing the distributed authentication communication network structure according to the impact value of the information communication. Ensure that multiple relay nodes that are most helpful in improving the efficiency of information communication are accurately selected, thereby realizing the optimization of the distributed authentication network structure; realize cross-chain communication by reasonably setting relay nodes, and scientifically optimize the network structure and resource allocation by calculating algebraic connectivity, etc., which can effectively improve the data communication efficiency between all nodes in the entire blockchain supervision system, ensure the smooth development of the supervision operation process and the efficient execution of related work such as authentication. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0038] Figure 1 It is a schematic diagram of introducing relay nodes to help achieve cross-chain communication provided by the background technology of the present invention.

[0039] Figure 2 It is a flow chart of the distributed authentication optimization method of the blockchain supervision system provided in Example 1 of the present invention.

[0040] Figure 3 It is a principle block diagram of the distributed authentication optimization system of the blockchain supervision system provided in the second embodiment of the present invention.

[0041] Figure 4 It is a partial block diagram of an electronic device provided in Embodiment 3 of the present invention. DETAILED DESCRIPTION

[0042] It should be mentioned before discussing the exemplary embodiments in more detail that some exemplary embodiments are described as processes or methods depicted as flow charts. Although the flow charts describe the operations as sequential processes, many of the operations therein can be implemented in parallel, concurrently or simultaneously. In addition, the order of the operations can be rearranged. The process can be terminated when its operation is completed, but can also have additional steps not included in the accompanying drawings. The process can correspond to a method, function, procedure, subroutine, subprogram, etc.

[0043] It should be understood that, although the terms "first", "second", etc. may be used herein to describe various units, these units should not be limited by these terms. These terms are used only to distinguish one unit from another unit. For example, without departing from the scope of the exemplary embodiments, the first unit may be referred to as the second unit, and similarly the second unit may be referred to as the first unit. The term "and / or" used herein includes any and all combinations of one or more of the listed associated items.

[0044] First embodiment:

[0045] The first embodiment of the present invention provides a distributed authentication optimization method for a blockchain regulatory system, including: constructing an initial Laplace matrix of a distributed authentication communication network structure; calculating the first algebraic connectivity corresponding to the initial Laplace matrix; calculating the impact value of information communication after adding a new relay node to the distributed authentication communication network structure; optimizing the distributed authentication communication network structure according to the impact value of the information communication. Ensure that multiple relay nodes that are most helpful in improving information communication efficiency are accurately selected, thereby optimizing the distributed authentication network structure; achieve cross-chain communication by reasonably setting relay nodes, and scientifically optimize the network structure and resource allocation by calculating algebraic connectivity, etc., which can effectively improve the data communication efficiency between all nodes in the entire blockchain regulatory system, ensure the smooth implementation of regulatory operation procedures and the efficient execution of related work such as authentication.

[0046] The following is a detailed description of the implementation details of the distributed authentication optimization method of the blockchain supervision system of this embodiment. The following content is only for the convenience of understanding the implementation details provided, and is not necessary for the implementation of this solution. The specific process of this embodiment is as follows Figure 1 As shown, this implementation is applied to a distributed authentication optimization system of a blockchain supervision system.

[0047] Step S1, constructing an initial Laplace matrix of a distributed authentication communication network structure.

[0048] Specifically, the construction of the initial Laplace matrix of the distributed authentication communication network structure includes the following steps:

[0049] Step S11, numbering all nodes in the distributed authentication communication network structure in sequence.

[0050] Specifically, all n nodes of the distributed authentication communication network structure are numbered from 1 to n. First, by numbering the nodes in the distributed authentication communication network, the network structure and its elements can be described, analyzed and managed clearly and conveniently; secondly, by assigning each node a unique number, the node can be accurately located, which is helpful for in-depth research on the connection relationship between nodes, data flow, and the operating characteristics of the entire network, laying the foundation for optimizing the authentication communication process and improving network efficiency.

[0051] Step S12: construct an adjacency matrix according to all direct communication relationships in the distributed authentication communication network structure.

[0052] Specifically, for a distributed authentication communication network structure containing n nodes, its adjacency matrix W is an n×n square matrix. The element values ​​in the adjacency matrix W reflect whether there is a direct communication relationship between the nodes. That is, if the i-th node and the j-th node in the distributed authentication communication network structure communicate directly, then W i,j =1, otherwise W i,j = 0. The adjacency matrix W can be used to intuitively see the connection status of the network, determine which nodes have direct communication relationships and serve as the basis for calculating the communication path.

[0053] Step S13, generating a degree matrix based on the adjacency matrix.

[0054] Specifically, since the distributed authentication communication network is composed of n nodes, its degree matrix D is an n×n square matrix. The diagonal elements of the degree matrix D are Off-diagonal elements D i,j = 0, where i∈(1, n), j∈(1, n). The diagonal elements of the degree matrix D i,i It represents the degree of node i, that is, the number of edges that are sent from node i and connected to it. The off-diagonal elements of the degree matrix D are usually 0, because the degree matrix focuses on the number of connected edges of each node itself, and there is no such corresponding relationship between it and other nodes, which is reflected in the off-diagonal position; through the elements on the diagonal of the degree matrix, we can intuitively see the connection status of each node in the entire distributed authentication communication network.

[0055] Step S14, calculating an initial Laplacian matrix according to the adjacency matrix and the degree matrix.

[0056] Specifically, the calculation of the initial Laplace matrix L is based on the adjacency matrix W and the degree matrix D. The calculation formula of the initial Laplace matrix L is:

[0057] L=DW

[0058] Among them, L is the initial Laplace matrix, D is the degree matrix, and W is the adjacency matrix.

[0059] The Laplace matrix L obtained by subtracting the adjacency matrix W from the degree matrix D can integrate the node connection degree information and the specific connection relationship information between nodes, thereby characterizing the structural characteristics of the distributed authentication communication network as a whole.

[0060] Step S2, calculating the first algebraic connectivity corresponding to the initial Laplacian matrix.

[0061] Specifically, the calculating the first algebraic connectivity corresponding to the initial Laplacian matrix comprises the following steps:

[0062] Step S21, performing eigenvalue decomposition on the initial Laplace matrix and sorting the eigenvalues ​​from small to large.

[0063] Specifically, the multiplication result of the initial Laplace matrix L and the eigenvector is equivalent to the multiplication result of the eigenvalue and the eigenvector, that is, L·ν=λ·ν, where ν is the eigenvector and λ is the eigenvalue. The results of eigendecomposition are sorted from small to large, and the eigenvalues ​​are λ1≤λ2≤…≤λ n .

[0064] Step S22, taking the second smallest eigenvalue as the first algebraic connectivity λ of the distributed authentication communication network structure.

[0065] Step S3, calculating the impact value of information communication after adding a new relay node to the distributed authentication communication network structure.

[0066] Specifically, the calculation of the impact value of adding a new relay node to the distributed authentication communication network structure on information communication includes the following steps:

[0067] Step S31, generating a first matrix for the distributed authentication communication network structure after adding a new relay node.

[0068] Specifically, for a new relay node, connecting node i and node j, that is, adding edge (i, j), define the first matrix as A, where A i,i =A j,j =1, A i,j =A j,i =-1, and the rest of the elements are 0.

[0069] Step S32: Calculate a new Laplacian matrix according to the first matrix.

[0070] Specifically, the new Laplace matrix calculation formula is:

[0071] L'=L+A

[0072] Among them, L' is the new Laplace matrix, L is the original Laplace matrix, and A is the first matrix.

[0073] Step S33, calculating the second algebraic connectivity according to the new Laplace matrix.

[0074] Specifically, the new Laplace matrix is ​​subjected to eigenvalue decomposition and the eigenvalues ​​are sorted from small to large, and the second smallest eigenvalue is taken as the second algebraic connectivity λ' of the distributed authentication communication network structure. The second algebraic connectivity λ' is calculated in the same way as the first algebraic connectivity λ, which will not be described in detail here.

[0075] Step S34, calculating the influence value of information communication according to the first algebraic connectivity and the second algebraic connectivity.

[0076] Specifically, the impact value of a new relay node on information communication is calculated according to the first algebraic connectivity λ and the second algebraic connectivity λ', which is v=λ'-λ.

[0077] Step S4, optimizing the distributed authentication communication network structure according to the impact value of the information communication.

[0078] Specifically, the optimization of the distributed authentication communication network structure according to the impact value of the information communication includes the following steps:

[0079] Step S41, adding other relay nodes, and repeating step S3 to calculate the impact value of the newly added relay nodes on the information communication of the distributed authentication communication network structure.

[0080] Specifically, other relay nodes are added, and step S3 is repeated one by one to calculate the impact value of the information communication of the distributed authentication communication network structure corresponding to the newly added relay nodes.

[0081] Step S42, sorting the influence values ​​corresponding to the newly added relay nodes, selecting the relay node with the largest influence value according to the number of relay nodes that can be added, and establishing a corresponding number of relay nodes as a distributed authentication network optimization structure.

[0082] Specifically, the preset number of relay nodes that can be added is m, wherein the influence values ​​corresponding to the newly added relay nodes are expressed in descending order as v1≤v2≤...≤v m The number of edges can be increased to k, and k relay nodes with the largest influence values ​​are selected from right to left in turn, ensuring that the k relay nodes that are most helpful in improving information communication efficiency are accurately selected, thereby optimizing the distributed authentication network structure.

[0083] The first embodiment of the present invention provides a distributed authentication optimization method for a blockchain supervision system, including: constructing an initial Laplace matrix of a distributed authentication communication network structure; calculating the first algebraic connectivity corresponding to the initial Laplace matrix; calculating the impact value of information communication after adding a new relay node to the distributed authentication communication network structure; optimizing the distributed authentication communication network structure according to the impact value of the information communication. Ensure that multiple relay nodes that are most helpful in improving information communication efficiency are accurately selected, thereby optimizing the distributed authentication network structure; achieve cross-chain communication by reasonably setting relay nodes, and scientifically optimize the network structure and resource allocation by calculating algebraic connectivity, etc., which can effectively improve the data communication efficiency between all nodes in the entire blockchain supervision system, ensure the smooth implementation of the supervision operation process and the efficient execution of related work such as authentication.

[0084] The step division of the above methods is only for the purpose of clear description. When implemented, they can be combined into one step or some steps can be split and decomposed into multiple steps. As long as they include the same logical relationship, they are all within the scope of protection of this patent; adding insignificant modifications to the algorithm or process or introducing insignificant designs without changing the core design of the algorithm and process are all within the scope of protection of this patent.

[0085] Second implementation method:

[0086] See also Figure 3 The second embodiment of the present invention provides a distributed authentication optimization system for a blockchain supervision system, including: a matrix construction module 201, an algebraic connectivity calculation module 202, an influence value calculation module 203, and a network structure optimization module 204.

[0087] Specifically, the matrix construction module 201 is used to construct the Laplace matrix of the distributed authentication communication network structure. The matrix construction module 201 includes a node numbering unit, which is used to sequentially number all nodes in the distributed authentication communication network structure; an adjacency matrix construction unit, which is used to construct an adjacency matrix according to all direct communication relationships in the distributed authentication communication network structure; a degree matrix generation unit, which is used to generate a degree matrix based on the adjacency matrix; and an initial Laplace matrix construction unit, which calculates an initial Laplace matrix according to the adjacency matrix and the degree matrix.

[0088] The algebraic connectivity calculation module 202 is used to calculate the first algebraic connectivity corresponding to the initial Laplace matrix. The algebraic connectivity calculation module 202 includes an eigenvalue decomposition unit, which is used to perform eigenvalue decomposition on the initial Laplace matrix and sort the eigenvalues ​​from small to large; and a first algebraic connectivity selection unit, which is used to take the second smallest eigenvalue as the first algebraic connectivity of the distributed authentication communication network structure.

[0089] The impact value calculation module 203 is used to calculate the impact value of information communication after adding a new relay node to the distributed authentication communication network structure. The impact value calculation module 203 includes a first matrix generation unit, which is used to generate a first matrix for the distributed authentication communication network structure after adding a new relay node; a new Laplace matrix calculation unit, which is used to calculate a new Laplace matrix based on the first matrix; a second algebraic connectivity calculation unit, which is used to calculate a second algebraic connectivity based on the new Laplace matrix; and an impact value generation unit, which is used to calculate the impact value of information communication based on the first algebraic connectivity and the second algebraic connectivity.

[0090] The network structure optimization module 204 is used to optimize the distributed authentication communication network structure according to the impact value of the information communication. The network structure optimization module 204 includes an impact value calculation unit, which is used to add other relay nodes and calculate the impact value of the newly added relay nodes on the information communication of the distributed authentication communication network structure; an optimization unit, which is used to sort the impact values ​​corresponding to the newly added relay nodes, select the relay node with the largest impact value according to the number of connection lines that can be added, and establish a corresponding number of relay nodes as the distributed authentication network optimization structure.

[0091] It is not difficult to find that this embodiment is a system embodiment corresponding to the first embodiment, and this embodiment can be implemented in conjunction with the first embodiment. The relevant technical details mentioned in the first embodiment are still valid in this embodiment, and in order to reduce repetition, they are not repeated here. Accordingly, the relevant technical details mentioned in this embodiment can also be applied in the first embodiment.

[0092] It is worth mentioning that all modules involved in this embodiment are logic modules. In practical applications, a logic unit can be a physical unit, a part of a physical unit, or a combination of multiple physical units. In addition, in order to highlight the innovative part of the present invention, this embodiment does not introduce units that are not closely related to solving the technical problem proposed by the present invention, but this does not mean that there are no other units in this embodiment.

[0093] Third embodiment:

[0094] A third embodiment of the present invention provides a network side server, such as Figure 4 As shown, it includes at least one processor 301; and a memory 302 that is communicatively connected to the at least one processor 301; wherein the memory 302 stores commands that can be executed by at least one processor 301, and the instructions are executed by at least one processor 301, so that at least one processor 301 can execute the above-mentioned data processing method.

[0095] The memory 302 and the processor 301 are connected in a bus manner, and the bus may include any number of interconnected buses and bridges, and the bus connects various circuits of one or more processors 301 and the memory 302 together. The bus can also connect various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and are therefore not further described herein. The bus interface provides an interface between the bus and the transceiver. The transceiver can be one element or multiple elements, such as multiple receivers and transmitters, providing a unit for communicating with various other devices on a transmission medium. The data processed by the processor 301 is transmitted on a wireless medium through an antenna, and further, the antenna also receives data and transmits the data to the processor 301.

[0096] The processor 301 is responsible for managing the bus and general processing, and can also provide various functions, including timing, peripheral interfaces, voltage regulation, power management and other control functions. The memory 302 can be used to store data used by the processor 301 when performing operations.

[0097] Fourth embodiment:

[0098] The fourth embodiment of the present invention provides a computer-readable storage medium storing a computer program. When the computer program is executed by a processor, the distributed authentication optimization method of the blockchain supervision system in the first embodiment is implemented.

[0099] That is, those skilled in the art can understand that all or part of the steps in the above-mentioned embodiment method can be completed by instructing the relevant hardware through a program, and the program is stored in a storage medium, including several instructions to enable a device (which can be a single-chip microcomputer, chip, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), disk or optical disk and other media that can store program codes.

[0100] The above is only an embodiment of the present invention. The common sense such as the known specific structure and characteristics in the scheme is not described in detail here. The ordinary technicians in the relevant field know all the common technical knowledge in the technical field of the invention before the application date or priority date, can obtain all the existing technologies in the field, and have the ability to apply the conventional experimental means before that date. The ordinary technicians in the relevant field can improve and implement this scheme in combination with their own abilities under the enlightenment given by this application. Some typical known structures or known methods should not become obstacles for ordinary technicians in the relevant field to implement this application. It should be pointed out that for those skilled in the art, without departing from the structure of the present invention, several deformations and improvements can be made, which should also be regarded as the protection scope of the present invention, which will not affect the effect of the implementation of the present invention and the practicality of the patent. The protection scope required by this application shall be based on the content of its claims, and the specific implementation methods and other records in the specification can be used to interpret the content of the claims.

[0101] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A distributed authentication optimization method for a blockchain supervision system, characterized in that: The method comprises: S1, constructs the initial Laplace matrix of the distributed authentication communication network structure; S2, calculating the first algebraic connectivity corresponding to the initial Laplace matrix; S3, calculating the impact value of adding a new relay node to the distributed authentication communication network structure; S4, optimizing the distributed authentication communication network structure according to the impact value of the information communication.

2. The distributed authentication optimization method of the blockchain supervision system according to claim 1, characterized in that: In S2, the initial Laplace matrix for constructing the distributed authentication communication network structure includes: Step S11, numbering all nodes in the distributed authentication communication network structure in sequence; Step S12, constructing an adjacency matrix according to all direct communication relationships in the distributed authentication communication network structure; Step S13, generating a degree matrix based on the adjacency matrix; Step S14, calculating an initial Laplacian matrix according to the adjacency matrix and the degree matrix.

3. The distributed authentication optimization method of the blockchain supervision system as claimed in claim 2 is characterized in that: The calculating of the initial Laplace matrix according to the adjacency matrix and the degree matrix includes: the calculation of the initial Laplace matrix is ​​performed based on the adjacency matrix and the degree matrix, and the calculation formula of the initial Laplace matrix is: L=DW Among them, L is the initial Laplace matrix, D is the degree matrix, and W is the adjacency matrix.

4. The distributed authentication optimization method of the blockchain supervision system according to claim 1, characterized in that: In S2, the calculating of the first algebraic connectivity corresponding to the initial Laplacian matrix includes: Step S21, performing eigenvalue decomposition on the initial Laplace matrix and sorting the eigenvalues ​​from small to large; Step S22, taking the second smallest eigenvalue as the first algebraic connectivity λ of the distributed authentication communication network structure.

5. The distributed authentication optimization method of the blockchain supervision system according to claim 1, characterized in that: In S3, the calculation of the impact value of adding a new relay node to the distributed authentication communication network structure on information communication includes: Step S31, generating a first matrix for the distributed authentication communication network structure after adding a new relay node; Step S32, calculating a new Laplace matrix according to the first matrix; Step S33, calculating the second algebraic connectivity according to the new Laplace matrix; Step S34, calculating the influence value of information communication according to the first algebraic connectivity and the second algebraic connectivity.

6. The distributed authentication optimization method for the blockchain supervision system according to claim 1, characterized in that: In S4, optimizing the distributed authentication communication network structure according to the impact value of the information communication includes: Step S41, adding other relay nodes, and repeatedly calculating the impact value of the newly added relay nodes on the information communication of the distributed authentication communication network structure; Step S42, sorting the influence values ​​corresponding to the newly added relay nodes, selecting the relay node with the largest influence value according to the number of relay nodes that can be added, and establishing a corresponding number of relay nodes as a distributed authentication network optimization structure.

7. The distributed authentication optimization method of the blockchain supervision system according to claim 6 is characterized in that: The influence values ​​corresponding to the newly added relay nodes are sorted, and according to the number of relay nodes that can be added, the relay node with the largest influence value is selected, and a corresponding number of relay nodes are established as a distributed authentication network optimization structure, including: presetting the number of relay nodes that can be added to be m, wherein the influence values ​​corresponding to the newly added relay nodes are expressed in order from small to large as v1≤v2≤...≤v m The number of edges can be increased to k, and the k relay nodes with the largest influence values ​​can be selected from right to left in turn to ensure that the k relay nodes that are most helpful in improving the efficiency of information communication are accurately selected to achieve the optimization of the distributed authentication network structure.

8. A distributed authentication optimization system for a blockchain supervision system, characterized in that: The system comprises: Matrix building module, used to build the Laplace matrix of distributed authentication communication network structure; an algebraic connectivity calculation module, used to calculate a first algebraic connectivity corresponding to the initial Laplace matrix; An impact value calculation module, used to calculate the impact value of information communication after adding a new relay node to the distributed authentication communication network structure; The network structure optimization module is used to optimize the distributed authentication communication network structure according to the impact value of the information communication.

9. A computer-readable storage medium, wherein one or more instructions are stored in the computer-readable storage medium, characterized in that: When executed, the one or more instructions implement the distributed authentication optimization method for the blockchain supervision system described in any one of claims 1 to 7.

10. An electronic device, characterized in that: include: Memory and processor; At least one program instruction is stored in the memory; The processor implements the distributed authentication optimization method for the blockchain supervision system according to any one of claims 1-7 by loading and executing the at least one program instruction.

Images