CN113162971A - Block link point management method, device, computer and readable storage medium - Google Patents
Block link point management method, device, computer and readable storage medium Download PDFInfo
- Publication number
- CN113162971A CN113162971A CN202110189183.6A CN202110189183A CN113162971A CN 113162971 A CN113162971 A CN 113162971A CN 202110189183 A CN202110189183 A CN 202110189183A CN 113162971 A CN113162971 A CN 113162971A
- Authority
- CN
- China
- Prior art keywords
- node
- consensus
- network
- target
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the application discloses a block link point management method, a block link point management device, a computer and a readable storage medium, wherein the method comprises the following steps: acquiring at least two network nodes in a block chain network, and acquiring a consensus weight of each network node from a full node table; acquiring at least two consensus nodes from at least two network nodes based on the consensus weight of each network node; detecting the connection state of at least two consensus nodes, recording the consensus nodes with the connection state being the disconnection state as consensus nodes to be connected, acquiring the node address information of the consensus nodes to be connected from the whole node table, and establishing network connection among the consensus nodes to be connected based on the node address information to obtain a consensus network; and when a network quitting request of the network node to be processed is obtained, returning the consensus weight of the network node to be processed, and deleting the network node to be processed in the whole node table. By adopting the method and the device, the flexibility of network node management in the block chain network can be improved.
Description
The present application is a divisional application of chinese patent application filed on 3/12/2020, having application number 202011397915.2 and having application name "block link point management method, apparatus, computer, and readable storage medium", the entire contents of which are incorporated herein by reference.
Technical Field
The present application relates to the field of block chain technologies, and in particular, to a method and an apparatus for managing block chain nodes, a computer, and a persistent storage medium.
Background
With the increasing maturity of blockchain technology, combined with the characteristics of decentralization of blockchains, the application of blockchains is becoming more and more widespread. The block chain network has more than one network node, and the network nodes forming the block chain network may change, and particularly, the probability that the network nodes forming the consensus network change is high. At present, when a network node is added to a blockchain network, the network node is added to the blockchain network by deploying the network connection of the network node, when the network node in the blockchain network changes, the existing network connection needs to be deleted, and the updated network connection between the network nodes is reestablished, so that the configuration of the network node is relatively fixed, the deployment of the blockchain network is relatively difficult, more resources are consumed in the updating process of the blockchain network, and the flexibility of network node management in the blockchain network is reduced.
Disclosure of Invention
The embodiment of the application provides a method and a device for managing block chain nodes, computer equipment and a storage medium, which can improve the flexibility of network node management in a block chain network.
An embodiment of the present application provides a block link point management method, including:
acquiring at least two network nodes in a block chain network, and acquiring a consensus weight of each network node from a full node table;
acquiring at least two consensus nodes from at least two network nodes based on the consensus weight of each network node;
detecting the connection state of at least two consensus nodes, recording the consensus nodes with the connection state being the disconnection state as consensus nodes to be connected, acquiring the node address information of the consensus nodes to be connected from the whole node table, and establishing network connection among the consensus nodes to be connected based on the node address information to obtain a consensus network;
when a network quitting request of a network node to be processed is obtained, acquiring a consensus weight of the network node to be processed from the whole node table, sending the consensus weight of the network node to be processed to the network node to be processed, deleting the network node to be processed in the whole node table, and updating the consensus network if the network node to be processed initiating the network quitting request belongs to the consensus network; the network node to be processed belongs to at least two network nodes.
The full node table comprises an identity label and a consensus weight of each network node;
acquiring at least two network nodes in a block chain network, and acquiring a consensus weight of each network node from a full node table, wherein the consensus weight comprises the following steps:
acquiring at least two network nodes in a block chain network, acquiring an identity label of each network node from a full node table, and acquiring network nodes with identity labels being consensus labels from the at least two network nodes to obtain candidate consensus nodes;
acquiring consensus weights of the candidate consensus nodes from the full node table;
acquiring at least two consensus nodes from at least two network nodes based on the consensus weight of each network node, comprising:
acquiring the number of consensus nodes, and determining N consensus nodes from the candidate consensus nodes based on the consensus weights of the candidate consensus nodes and the number of the consensus nodes; the number of the consensus nodes is used for representing the number of the consensus nodes forming the consensus network, and N is the number of the consensus nodes.
Wherein, based on the consensus weight of each network node, obtaining at least two consensus nodes from at least two network nodes comprises:
acquiring the number of consensus nodes, sequencing at least two network nodes based on the consensus weight of each network node, and acquiring N consensus nodes from the at least two network nodes according to a sequencing result; the number of the consensus nodes is used for representing the number of the consensus nodes forming the consensus network, and N is the number of the consensus nodes.
Wherein the full node table comprises an identity label of each network node;
detecting the connection state of at least two consensus nodes, and recording the consensus node with the connection state being the disconnection state as a consensus node to be connected, comprising:
acquiring identity labels corresponding to the N consensus nodes from the full node table, and determining the connection state of the consensus nodes of which the identity labels are not the consensus labels as a connection disconnection state;
and recording the consensus node with the connection state being the disconnection state as the consensus node to be connected.
Wherein, the method also comprises:
acquiring a history consensus node with an identity label as a consensus label from a full node table;
and if the historical consensus nodes do not belong to the N consensus nodes, disconnecting the network connection of the historical consensus nodes, updating the identity labels of the historical consensus nodes in the whole node table to be data labels, detecting the connection state of at least two consensus nodes, and recording the consensus nodes with the connection state being in the connection disconnection state as the consensus nodes to be connected.
Wherein, the method also comprises:
acquiring node identifications of at least two consensus nodes from the full node table, and generating a consensus node table according to the node identifications of the at least two consensus nodes;
and generating a consensus network block according to the consensus node table, if the consensus passes through the consensus network block, adding the consensus network block into the node management block chain, and executing the step of detecting the connection state of at least two consensus nodes.
Wherein, the method also comprises:
acquiring the virtual mortgage interest and the historical consensus times of the network nodes, and determining the consensus weight of the network nodes according to the virtual mortgage interest and the historical consensus times;
and if the consensus weight passes the consensus, adding the consensus weight into the node management block chain, and adding the association relation between the consensus weight and the network node into the whole node table.
Wherein, the method also comprises:
acquiring a node network access request sent by a target network node; the node network access request comprises a target node identification, a target identity label and target node address information of a target network node;
verifying the target network node according to the target node identification and the target node address information, and if the target node address information of the target network node is legal, acquiring a target identity tag;
performing consensus on the target identity tag, if the consensus passes, generating a node information block according to the target node identifier, the target identity tag and the target node address information, and adding the node information block into a node management block chain;
and adding the target node identification, the target identity label and the target node address information into the full node table.
Wherein, the consensus is carried out on the target identity label, and the consensus comprises the following steps:
if the target identity label is a consensus label, acquiring a target virtual mortgage right of the target identity label;
acquiring a common identification interest threshold, if the target virtual mortgage interest is smaller than the common identification interest threshold, determining that the common identification of the target identity label fails, and sending a label abnormal message to a target network node;
and if the target virtual mortgage interest is greater than or equal to the consensus interest threshold, generating a target consensus weight of the target network node according to the target virtual mortgage interest, and determining that the target identity tag is agreed.
The full node table also comprises a node signature of each network node;
the method further comprises the following steps:
if an abnormal node is detected from at least two network nodes, acquiring a public key of the abnormal node;
adopting a public key of the abnormal node to check and sign the node signature corresponding to the abnormal node in the whole node table, and if the check and sign pass, sending a node confirmation message to the abnormal node; the node confirmation message is used for acquiring abnormal data from the abnormal node;
and if the node signature of the abnormal node fails to pass the verification, disconnecting the network connection with the abnormal node, and deleting the data associated with the abnormal node from the whole node table.
An aspect of an embodiment of the present application provides a block link point management device, where the block link point management device includes:
the weight acquisition module is used for acquiring at least two network nodes in the block chain network and acquiring the consensus weight of each network node from the whole node table;
the node selection module is used for acquiring at least two consensus nodes from at least two network nodes based on the consensus weight of each network node;
the connection establishing module is used for detecting the connection state of at least two consensus nodes, recording the consensus nodes with the connection state being the disconnection state as the consensus nodes to be connected, acquiring the node address information of the consensus nodes to be connected from the whole node table, and establishing network connection among the consensus nodes to be connected based on the node address information to obtain a consensus network;
the node network quitting module is used for acquiring the consensus weight of the network node to be processed from the whole node table when the network quitting request of the network node to be processed is acquired, sending the consensus weight of the network node to be processed to the network node to be processed, deleting the network node to be processed in the whole node table, and updating the consensus network if the network node to be processed initiating the network quitting request belongs to the consensus network; the network node to be processed belongs to at least two network nodes.
The full node table comprises an identity label and a consensus weight of each network node;
the weight obtaining module comprises:
the system comprises a label acquisition unit, a node selection unit and a node selection unit, wherein the label acquisition unit is used for acquiring at least two network nodes in a block chain network, acquiring an identity label of each network node from a full node table, and acquiring a network node of which the identity label is a consensus label from the at least two network nodes to obtain candidate consensus nodes;
the weight obtaining unit is used for obtaining the consensus weight of the candidate consensus node from the whole node table;
the node selection module is specifically configured to:
acquiring the number of consensus nodes, and determining N consensus nodes from the candidate consensus nodes based on the consensus weights of the candidate consensus nodes and the number of the consensus nodes; the number of the consensus nodes is used for representing the number of the consensus nodes forming the consensus network, and N is the number of the consensus nodes.
Wherein, the node selection module is specifically configured to:
acquiring the number of consensus nodes, sequencing at least two network nodes based on the consensus weight of each network node, and acquiring N consensus nodes from the at least two network nodes according to a sequencing result; the number of the consensus nodes is used for representing the number of the consensus nodes forming the consensus network, and N is the number of the consensus nodes.
Wherein the full node table comprises an identity label of each network node;
in the aspect of detecting the connection state of at least two consensus nodes and recording the consensus node with the connection state being the disconnection state as a consensus node to be connected, the connection establishing module comprises:
the state determining unit is used for acquiring the identity labels corresponding to the N consensus nodes from the full node table and determining the connection state of the consensus nodes of which the identity labels are not the consensus labels as the disconnection state;
and the consensus determining unit is used for recording the consensus node with the connection state being the disconnection state as the consensus node to be connected.
Wherein, the device still includes:
the history acquisition module is used for acquiring a history consensus node with an identity label as a consensus label from the whole node table;
and the label updating module is used for disconnecting the network connection of the history consensus nodes if the history consensus nodes do not belong to the N consensus nodes, updating the identity labels of the history consensus nodes in the whole node table into data labels, detecting the connection state of at least two consensus nodes, and recording the consensus nodes with the connection state being in the connection disconnection state as the consensus nodes to be connected.
Wherein, the device still includes:
the table generation module is used for acquiring node identifications of at least two consensus nodes from the whole node table and generating a consensus node table according to the node identifications of the at least two consensus nodes;
and the data storage module is used for generating a consensus network block according to the consensus node table, adding the consensus network block into the node management block chain if the consensus passes through the consensus network block, and executing the step of detecting the connection state of at least two consensus nodes.
Wherein, the device still includes:
the weight determining module is used for acquiring the virtual mortgage interest and the historical consensus times of the network nodes and determining the consensus weight of the network nodes according to the virtual mortgage interest and the historical consensus times;
and the data uplink module is used for adding the consensus weight into the node management block chain and adding the association relation between the consensus weight and the network node into the whole node table if the consensus on the consensus weight passes.
Wherein, the device still includes:
the request acquisition module is used for acquiring a node network access request sent by a target network node; the node network access request comprises a target node identification, a target identity label and target node address information of a target network node;
the node verification module is used for verifying the target network node according to the target node identification and the target node address information, and acquiring a target identity tag if the target node address information of the target network node is legal;
the label verification module is used for carrying out consensus on the target identity label, if the consensus passes, generating a node information block according to the target node identifier, the target identity label and the target node address information, and adding the node information block into the node management block chain;
and the node adding module is used for adding the target node identification, the target identity label and the target node address information into the full node table.
Wherein, in the aspect of consensus on the target identity label, the label verification module comprises:
the right and interest obtaining unit is used for obtaining the target virtual mortgage right and interest of the target identity label if the target identity label is the consensus label;
the message sending unit is used for acquiring a common identification right gain threshold value, determining that common identification of the target identity label fails if the target virtual mortgage right gain is smaller than the common identification right gain threshold value, and sending a label abnormal message to the target network node;
and the verification passing unit is used for generating a target consensus weight of the target network node according to the target virtual mortgage right interest and determining that the target identity label is agreed and passed if the target virtual mortgage right interest is greater than or equal to the consensus right interest threshold.
The full node table also comprises a node signature of each network node;
the device also includes:
the public key acquisition module is used for acquiring a public key of an abnormal node if the abnormal node is detected from at least two network nodes;
the node signature verification module is used for verifying the signature of the node corresponding to the abnormal node in the whole node table by adopting the public key of the abnormal node, and if the signature verification passes, sending a node confirmation message to the abnormal node; the node confirmation message is used for acquiring abnormal data from the abnormal node;
the node signature checking module is also used for disconnecting the network connection with the abnormal node and deleting the data associated with the abnormal node from the whole node table if the node signature of the abnormal node fails to pass the signature checking module.
One aspect of the embodiments of the present application provides a computer device, including a processor, a memory, and an input/output interface;
the processor is respectively connected to the memory and the input/output interface, where the input/output interface is used for data interaction of each network node in a block chain, the memory is used for storing a program code, and the processor is used for calling the program code to execute the block chain link point management method implemented in one aspect of the embodiment of the present application.
An aspect of the present embodiment provides a computer-readable storage medium, where a computer program is stored, where the computer program includes program instructions, and when the program instructions are executed by a processor, the method for managing block link nodes implemented in the aspect of the present embodiment is performed.
An aspect of an embodiment of the present application provides a computer program product or a computer program, which includes computer instructions stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions to cause the computer device to perform the method provided in the various alternatives in one aspect of the embodiments of the application.
The embodiment of the application has the following beneficial effects:
the method comprises the steps that the common identification weight of each network node is obtained from a full node table by obtaining at least two network nodes in a block chain network; acquiring at least two consensus nodes from at least two network nodes based on the consensus weight of each network node; detecting the connection state of at least two consensus nodes, recording the consensus node with the connection state being the disconnection state as a consensus node to be connected, acquiring the node address information of the consensus node to be connected from the whole node table, and establishing network connection between the consensus node to be connected and the node address information to obtain a consensus network; when a network quitting request of a network node to be processed is obtained, acquiring a consensus weight of the network node to be processed from the whole node table, sending the consensus weight of the network node to be processed to the network node to be processed, deleting the network node to be processed in the whole node table, and updating the consensus network if the network node to be processed initiating the network quitting request belongs to the consensus network; the network node to be processed belongs to at least two network nodes. Through the process, the full node table is introduced into the blockchain network, node information (such as consensus weight) of each network node in the blockchain network and the like are stored in the full node table, when each network node in the blockchain network changes, data of the changed network node can be directly obtained from the full node table, the consensus network is established based on the full node table, the node information of each network node does not need to be counted again, deployment of the blockchain network does not need to be realized again, time and resources consumed by updating the blockchain network when the blockchain network changes are reduced, and flexibility of network node management in the blockchain network is improved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is an alternative schematic diagram of a block structure provided in the present application;
fig. 2 is a schematic diagram of a network architecture for block link node management according to an embodiment of the present application;
fig. 3 is a schematic diagram of a block link point management scenario provided in an embodiment of the present application;
fig. 4 is a flowchart of a block link point management method according to an embodiment of the present disclosure;
fig. 5 is a schematic diagram of a consensus network determination provided in an embodiment of the present application;
fig. 6 is a schematic diagram of another consensus network determination provided in an embodiment of the present application;
fig. 7 is a schematic diagram of a block link point management device according to an embodiment of the present disclosure;
fig. 8 is a schematic structural diagram of a computer device according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The embodiment of the application can store and transmit data and the like generated in the network nodes (such as common nodes or common network nodes and the like) mentioned in the application based on a cloud technology, and is suitable for the field of data transmission in big data. For example, a cloud storage technology is adopted to store data generated in the application, and a data transmission technology in the cloud technology is adopted to realize data interaction between network nodes.
The Cloud technology (Cloud technology) is a hosting technology for unifying series resources such as hardware, software, network and the like in a wide area network or a local area network to realize calculation, storage, processing and sharing of data.
Cloud technology (Cloud technology) is based on a general term of network technology, information technology, integration technology, management platform technology, application technology and the like applied in a Cloud computing business model, can form a resource pool, is used as required, and is flexible and convenient. Cloud computing technology will become an important support. Background services of the technical network system require a large amount of computing and storage resources, such as video websites, picture-like websites and more web portals. With the high development and application of the internet industry, each article may have its own identification mark and needs to be transmitted to a background system for logic processing, data in different levels are processed separately, and various industrial data need strong system background support and can only be realized through cloud computing.
In the present application, a large number of network nodes may exist in a blockchain network, each network node may generate or store a large amount of data, and many data interactions may also occur between the network nodes, so in the present application, a big data technology may be used to manage data generated in the present application, such as data transmission, data storage, or data update.
The Big data (Big data) refers to a data set which cannot be captured, managed and processed by a conventional software tool within a certain time range, and is a massive, high-growth-rate and diversified information asset which can have stronger decision-making power, insight discovery power and flow optimization capability only by a new processing mode. With the advent of the cloud era, big data has attracted more and more attention, and the big data needs special technology to effectively process a large amount of data within a tolerance elapsed time. The method is suitable for the technology of big data, and comprises a large-scale parallel processing database, data mining, a distributed file system, a distributed database, a cloud computing platform, the Internet and an extensible storage system. When a plurality of block chains exist in the block chain network, or more blocks exist in the block chains, the scheme of the application can be realized, the condition of generating a large amount of data can occur, a big data technology can be adopted, and the realization efficiency of the scheme of the application is improved.
The blockchain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism and an encryption algorithm. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product services layer, and an application services layer. And the Block chain comprises a series of blocks (blocks) which are mutually connected according to the generated chronological order, new blocks cannot be removed once being added into the Block chain, and recorded data submitted by nodes in the Block chain system are recorded in the blocks.
Referring to fig. 1, fig. 1 is an optional schematic diagram of a Block Structure (Block Structure) provided in this embodiment of the present application, where each Block includes a hash value of a transaction record (hash value of the Block) stored in the Block and a hash value of a previous Block, and the blocks are connected by the hash value to form a Block chain. In addition, the block may further include information such as a time stamp when the block is generated or a block height of the block. As shown in fig. 1, a block 1 includes a block header and a block body, a block body of the block 1 may store transaction data 1, and a block header of the block 1 may include a previous block hash and a present block hash, where the previous block hash is a hash of a previous block of the block 1, for example, in fig. 1, the block 1 is a first block in the block chain, and then the previous block hash in the block 1 may be null. The block 2 includes transaction data 2 in its block body, and the block header of block 2 includes the previous block hash and the present block hash, where the previous block hash is the hash of the previous block (block 1) of block 2. The block 3 includes transaction data 3 in its block body, and the block header of block 3 includes the previous hash of the block and the hash of the block, where the previous hash of the block is the hash of the block (i.e., block 2) before block 3.
In this embodiment, the blockchain network includes at least two network nodes, and each network node may have a network connection therebetween and may perform data interaction based on the network connection. Each of the at least two network nodes may carry a different identity tag, such as a consensus tag, a data tag, or a lightweight tag. Referring to fig. 2, fig. 2 is a schematic diagram of a network architecture for block link node management according to an embodiment of the present disclosure. As shown in fig. 2, when a network node 201 is added to a blockchain network, data of the network node 201 is added to a full node table, wherein the data of the network node 201 can be recorded as node information of the network node 201. The node information may include a node identifier of the network node 201, and optionally, the node information may further include an identity tag of the network node 201. When the network node 201 is added to the full node table, the identity tag sent by the network node 201 may be added to the full node table, and if the identity tag sent by the network node 201 is null, the identity tag of the network node 201 may be defaulted to be a data tag or a lightweight tag. The data labels are used for indicating that the corresponding network nodes have the authority of acquiring the transaction blocks in the block chain network but do not have the consensus authority of the transaction blocks; the lightweight label is used for indicating that the corresponding network node has the authority of acquiring part of transaction blocks in the block chain network and does not have the consensus authority.
When a new consensus period starts, node information of each network node in the full node table in the blockchain network can be acquired, each network node is selected based on the node information, and the consensus nodes forming the consensus network 202 in the new consensus period are determined, wherein the consensus nodes include a consensus node 2021, a consensus node 2022, a consensus node 2023 and the like, each consensus node belongs to a corresponding network node in the full node table, and the consensus network is a part of the blockchain network. Specifically, the total node table includes consensus weights of the network nodes, and based on the consensus weights, the probability that each network node is taken as a consensus node can be obtained, so that at least two consensus nodes can be obtained from at least two network nodes, and the consensus network is formed by the at least two consensus nodes. Further, the full node table may further include node address information of each network node, and network connection between each consensus node may be established based on the node address information, so as to obtain a consensus network. In the full node table, the consensus weight, the node address information and the like of the network node can be recorded as the node information of the network node, that is, the node information of each network node in the blockchain network is stored in the full node table, and a consensus network can be selected, network connection can be established, data interaction can be performed or the like based on the node information of each network node, so that when the network node in the blockchain network changes, the blockchain network can be updated directly based on the full node table, time and resources consumed in the updating process of the blockchain network are reduced, and the flexibility of network node management of the blockchain network is improved.
The above network node may be a server or a terminal device, or a system composed of a server and a terminal device, where the above mentioned terminal device may be an electronic device, including but not limited to a mobile phone, a tablet computer, a desktop computer, a notebook computer, a palmtop computer, a wearable device (e.g., a smart watch, a smart bracelet, etc.), an Augmented Reality/Virtual Reality (AR/VR) device, a helmet display, a smart speaker, a digital camera, a camera, and other Mobile Internet Devices (MID) with network access capability. The above-mentioned server may be an independent physical server, a server cluster or a distributed system formed by a plurality of physical servers, or a cloud server providing basic cloud computing services such as a cloud service, a cloud database, cloud computing, a cloud function, cloud storage, a Network service, cloud communication, a middleware service, a domain name service, a security service, a Content Delivery Network (CDN), a big data and artificial intelligence platform, and the like.
Specifically, referring to fig. 3, fig. 3 is a schematic diagram of a block link node management scenario provided in an embodiment of the present application. As shown in fig. 3, when the network node 301 is added to the blockchain network, node information of the network node 301 is obtained, which includes a node identifier, an identity tag, and the like of the network node 301, where the node identifier may be an Internet Protocol (ip) address, a device identifier, or another unique identifier of the network node 301. The computer device adds the node information of the network node 301 to the full node table 303 and adds the network node 301 to the blockchain network 302, wherein if the identity tag of the network node 301 is empty, the identity tag of the network node 301 may be defaulted to a data tag or a lightweight tag. Wherein, the full node table can be referred to the following table 1:
TABLE 1
When a new consensus period starts or a consensus network changes, the computer device may determine the number of consensus nodes, obtain a consensus weight of each network node from the full node table, and select at least two consensus nodes according to the consensus weight of each network node, where the number of the consensus nodes included in the at least two consensus nodes is the number of the consensus nodes. The node information of the at least two common nodes is added to the common node table 304, or the node names and the node identifications of the at least two common nodes are added to the common node table 304. That is, the common node table 304 may include the node name and the node identifier of each common node, or may further include the identity tag and the common weight of each common node. When the node information of the consensus node included in the consensus node table 304 includes a node name and a node identifier, the consensus node table 304 may be as shown in table 2 below:
TABLE 2
Node name | Node identification |
Network node A | 192.154.26.31 |
|
153.241.54.152 |
... | ... |
When at least two consensus nodes are selected, the node information of the at least two consensus nodes is obtained from the whole node table, the identity label in the node information of each consensus node in the whole node table is updated to be the consensus label, the consensus node of which the identity label before updating is not the consensus label is taken as the consensus node to be connected, and network connection between the consensus node to be connected and other consensus nodes is established to form the consensus network 305. At this time, data interaction can be performed among the consensus nodes (e.g., the consensus node 3051, the consensus node 3052, the consensus node 3053, the consensus node 3054, etc.) in the consensus network 305, and the obtained transaction blocks can be consensus.
Further, please refer to fig. 4, fig. 4 is a flowchart of a block link point management method according to an embodiment of the present disclosure. As shown in fig. 4, the execution subject of the method may be any network node in a blockchain network, and the execution subject is denoted as a computer device, and the process of the blockchain nexus management method includes the following steps:
step S401, at least two network nodes in the block chain network are obtained, and the consensus weight of each network node is obtained from the whole node table.
In this embodiment of the application, the computer device may obtain at least two network nodes in the blockchain network in response to the update request for the consensus network, and obtain the consensus weight of each network node from the full node table. The consensus network has a consensus period, the consensus period is used for representing an update time period of the consensus network, when one consensus period ends, a new consensus period is started, and an update request for the consensus network is generated, optionally, the consensus period can be detected based on an intelligent contract, when the new consensus period starts, the intelligent contract is triggered, and the update request for the consensus network is obtained based on the intelligent contract; alternatively, when there is a change in the consensus node in the consensus network (e.g., a network exit of the consensus node, a change in information of the consensus node, or the like), an update request for the consensus network is generated. In other words, when the consensus network changes, an update request for the consensus network is generated. For example, assuming the consensus period is expressed in terms of a block height range, when generating a block corresponding to the starting block height in the block height range, triggering an intelligent contract, obtaining a full node table based on the intelligent contract, obtaining a consensus weight for each network node from the full node table, e.g., the block height ranging from block height 10 to block height 40, i.e., the starting block height is block height 10 and the ending block height is block height 40, an intelligent contract is invoked to monitor block generation in the blockchain network, after a block with a block height of 9 is added to the node management block chain, acquiring a consensus period corresponding to a block height range with a starting block height of 10 based on an intelligent contract, and acquiring at least two network nodes in the consensus period, and acquiring the consensus weight of each network node from the full node table. After one consensus period is finished, the new consensus network is directly deployed, the deployment process of the consensus network is not required to be triggered when the new consensus period is started, the transition time of the consensus period can be shortened, the smoothness of consensus network switching is improved, and the switching efficiency of the consensus network can be improved.
The node information may include a consensus weight of the corresponding network node, and optionally, the node information may further include a node name, a node identifier, an identity tag, or node address information of the corresponding network node. In determining consensus nodes that form a consensus network, in one case, the computer device may obtain at least two consensus nodes from the at least two network nodes, and the computer device may obtain a consensus weight for each network node from the full node table; in another case, the computer device may determine at least two consensus nodes based on the identity label of each network node, and specifically, the computer device may obtain at least two network nodes in the blockchain network, obtain the identity label of each network node from the full node table, obtain a network node whose identity label is a consensus label from the at least two network nodes, obtain candidate consensus nodes, and obtain a consensus weight of the candidate consensus nodes from the full node table.
Step S402, at least two consensus nodes are obtained from at least two network nodes based on the consensus weight of each network node.
In this embodiment of the application, in step S401, when obtaining at least two consensus nodes from at least two network nodes, the computer device may obtain the number of the consensus nodes, rank the at least two network nodes based on the consensus weight of each network node, and obtain N consensus nodes from the at least two network nodes according to a ranking result; the number of the consensus nodes is used for representing the number of the consensus nodes forming the consensus network, and N is the number of the consensus nodes.
In step S401, when the computer device determines at least two consensus nodes based on the identity label of each network node, the computer device may obtain the number of the consensus nodes, and determine N consensus nodes from the candidate consensus nodes based on the consensus weights and the number of the consensus nodes of the candidate consensus nodes; the number of the consensus nodes is used for representing the number of the consensus nodes forming the consensus network, and N is the number of the consensus nodes. Optionally, if the number of candidate consensus nodes is less than the number of consensus nodes, network nodes whose identity labels are not consensus labels may be obtained from the full node table and recorded as standby nodes, consensus weights corresponding to the standby nodes are obtained from the full node table, M consensus nodes are obtained from the standby nodes based on the consensus weights of the standby nodes, M is a positive integer, and the sum of M and the number of candidate consensus nodes is the number of consensus nodes.
The number of the common nodes may be a default number of nodes, or may be generated according to the number of nodes of at least two network nodes, or may be generated according to the number of blocks included in the blockchain network and the number of at least two network nodes, and the like, which is not limited herein. For example, the node number and the node selection ratio of at least two network nodes are obtained, the number of the consensus nodes is determined based on the node selection ratio and the node number of the at least two network nodes, and the number of the consensus nodes is determined to be 8 assuming that the node number of the at least two network nodes is 80 and the node selection ratio is 0.1.
For example, when the number of consensus nodes is a default number of nodes, the number of consensus nodes may be submitted by a manager, for example, refer to fig. 5, where fig. 5 is a schematic diagram of a consensus network determination provided in this embodiment of the present application. As shown in fig. 5, in response to the commit operation for the number of common nodes, the computer device obtains the number of common nodes and a node management period, which are input in the number obtaining page 501, where the node management period is used to indicate a common period associated with the corresponding number of common nodes. For example, if the node management period is from the consensus period 5 to the consensus period 10 and the number of the consensus nodes is 7, the number of the consensus nodes is 7 when the consensus period 5 starts; alternatively, the node management period may be represented by a block height range, for example, the node management period is from 10 to 40 block heights, and the number of common nodes is 7, which means that 7 common nodes are required to share the blocks corresponding to 10 to 40 block heights. Further, an intelligent contract 502 may be generated according to the number of the consensus nodes and the node management period, a contract block 503 may be generated according to the intelligent contract 502, the contract block 503 may be consensus-recognized, and if the consensus passes, the contract block 503 may be added to the node management block chain 504. When a target node management cycle is started, an intelligent contract is triggered, a target contract block 505 associated with the target node management cycle is acquired from a node management block chain 504 by using the intelligent contract, and the number of common nodes is determined based on the target contract block 505. At least two consensus nodes 507, including a consensus node 5071, a consensus node 5072, a consensus node 5073, a consensus node 5074, etc., are obtained from the at least two network nodes 506 based on the consensus weight and the number of consensus nodes for each network node.
For example, see fig. 6 for steps S401 to S402, where fig. 6 is a schematic diagram of another consensus network determination provided in this embodiment of the present application. As shown in fig. 6, in the first case, the computer device acquires at least two network nodes 601, acquires a consensus weight for each network node from the full node table, and acquires at least two consensus nodes 602 from the at least two network nodes 601 based on the consensus weights. In the second case, the computer device may obtain a network node whose identity label is a consensus label from the full node table as the candidate consensus node 603, obtain a consensus weight of the candidate consensus node 603 from the full node table, and obtain at least two consensus nodes 602 from the candidate consensus nodes 603 based on the consensus weight. It is assumed that the at least two consensus nodes 602 include a consensus node 6021, a consensus node 6022, a consensus node 6023, a consensus node 6024, and the like.
Step S403, detecting the connection state of at least two consensus nodes, recording the consensus node with the connection state being the disconnection state as the consensus node to be connected, acquiring the node address information of the consensus node to be connected from the whole node table, and establishing network connection between the consensus nodes to be connected based on the node address information to obtain the consensus network.
In the embodiment of the application, the computer equipment acquires the identity labels corresponding to the N consensus nodes from the full node table, and determines the connection state of the consensus nodes of which the identity labels are not the consensus labels as the disconnection state; and recording the consensus node with the connection state being the disconnection state as the consensus node to be connected. Optionally, the computer device may obtain the historical consensus network, determine a connection state of a consensus node not belonging to the historical consensus network among the N consensus nodes as a disconnection state, and record the consensus node in the disconnection state as a to-be-connected consensus node.
Further, when the computer device obtains at least two consensus nodes from the at least two network nodes, the computer device may obtain a historical consensus node whose identity label is a consensus label from the full node table. If the historical consensus node does not belong to the N consensus nodes, the historical consensus node is shown not to participate in the consensus process, the network connection of the historical consensus node is disconnected, the identity labels of the historical consensus nodes in the whole node table are updated to be data labels, the connection states of at least two consensus nodes are detected, and the consensus node with the connection state being in the connection disconnection state is marked as a consensus node to be connected. Specifically, when the network connection of the history consensus node is disconnected, the computer device may obtain the node address information of the history consensus node from the full node table, and send a network disconnection request to the history consensus node based on the node address information, so as to disconnect the network connection with the history consensus node. Optionally, if the computer device belongs to the historical consensus node, the computer device obtains node address information corresponding to the N consensus nodes from the full node table, and sends a network disconnection request to the corresponding consensus nodes based on the node address information, so as to disconnect the network connection with the N consensus nodes.
Further, node address information of the consensus nodes to be connected is obtained from the whole node table, and network connection is established between the consensus nodes to be connected based on the node address information, so that the consensus network is obtained. As shown in fig. 6, assuming that the at least two common knowledge nodes include the common knowledge node 6021, the common knowledge node 6022, the common knowledge node 6023, the common knowledge node 6024 and the like, the computer device acquires the all-node table 604, acquires the node address information of the other common knowledge node from the all-node table 604, establishes a network connection with the other common knowledge node based on the node address information, assumes that the computer device is the common knowledge node 6022, the computer device acquires the node address information of the common knowledge node 6021 from the all-node table 604, transmits a network connection request to the common knowledge node 6021 based on the node address information of the common knowledge node 6021, the common knowledge node 6021 receives the network connection request, transmits a network connection confirmation message to the computer device, establishes a network connection between the computer device and the common knowledge node 6021 based on the network connection confirmation message, and, can establish a network connection with the common knowledge node to be connected (such as the common knowledge node 6023 or the common knowledge node 6024), resulting in a consensus network 605.
Further, the computer device may obtain node identifiers of at least two common nodes from the full node table, generate a common node table according to the node identifiers of the at least two common nodes, and optionally, add common weights of the common nodes to the common node table. The computer equipment generates a consensus network block according to the consensus node table, if the consensus of the consensus network block passes, the consensus network block is added into a node management block chain, at least two consensus nodes are determined to form a consensus network, the connection states of the at least two consensus nodes are detected, network connection between the consensus nodes is established based on the connection states, and the consensus network is generated.
Further, the generation process of the full node table may be as follows:
taking a network node as an example, the computer device may obtain a node network access request sent by a target network node; the node network access request comprises a target node identification, a target identity label and target node address information of a target network node. The computer device may verify the target network node according to the target node identifier and the target node address information, for example, send a node confirmation request to the target network node based on the target node address information, and determine that the target node address information of the target network node is valid if the node confirmation message sent by the target network node is obtained; and if the node confirmation message sent by the target network node is not obtained by the computer equipment after the node confirmation request is sent and the message feedback duration passes, determining that the target node address information of the target network node is illegal.
If the target node address information of the target network node is illegal, the node access request of the target network node is refused, and the node address information abnormal message is sent to the target network node. If the target node address information of the target network node is legal, acquiring a target identity label; the computer equipment performs consensus on the target identity label, if the consensus passes, a node information block is generated according to the target node identifier, the target identity label and the target node address information, and the node information block is added into the node management block chain; and adding the target node identification, the target identity label and the target node address information into the full node table. Optionally, the node network access request may further include a target node signature of the target network node, the computer device may obtain a public key of the target network node, check the target node signature using the public key of the target network node, if the check passes and the target identity tag is identified together, generate a node information block according to the target node identifier, the target identity tag, the target node address information, and the target node signature, and add the node information block to the node management block chain; if the target node address information of the target network node is illegal, or the target identity label is not known or the target node signature is not verified, rejecting the node access request of the target network node, and sending an abnormal message to the target network node, for example, when the target node address information of the target network node is illegal, the abnormal message is a node address information abnormal message; when the target identity label consensus does not pass, the abnormal message is a label abnormal message; when the signature verification of the target node fails, the exception message is a signature exception message and the like.
When the target identity label is subjected to consensus, the computer equipment can acquire the target identity label, and if the target identity label is a consensus label, the target virtual mortgage right of the target identity label is acquired; acquiring a common identification interest threshold, if the target virtual mortgage interest is smaller than the common identification interest threshold, determining that the common identification of the target identity label fails, and sending a label abnormal message to a target network node; and if the target virtual mortgage interest is greater than or equal to the consensus interest threshold, generating a target consensus weight of the target network node according to the target virtual mortgage interest, and determining that the target identity tag is agreed. Optionally, the computer device may obtain a node cluster to which the target network node belongs, and perform consensus on the target identity tag based on the node cluster, where if the node cluster is the first node cluster, the target identity tag may be a consensus tag, a data tag, or a lightweight tag; if the node cluster is a second node cluster, the target identity tag may be a data tag or a lightweight tag; if the node cluster is a third node cluster, the target identity label may be a lightweight label. When the target identity label is identified in a consensus manner, the node cluster to which the target network node belongs can be obtained, and if the node cluster to which the target network node belongs is matched with the target identity label, the target identity label is determined to pass the consensus; and if the node cluster to which the target network node belongs is not matched with the target identity label, determining that the consensus on the target identity label fails, and sending a label abnormal message to the target network node. The management authority of the network node in the first node cluster is greater than that of the network node in the second node cluster, and the management authority of the network node in the second node cluster is greater than that of the network node in the third node cluster.
The target network node may obtain target node information, where the target node information may include any one or at least two of a target node identifier, target node address information, a target identity tag, a target consensus weight, and the like, and the target network node may sign the target node information by using a private key of the target network node to generate a target node signature. Specifically, the target identity tag of the target network node may be obtained, if the target identity tag is in a light weight range, the target identity tag of the target network node is determined as the light weight tag, and if the target identity tag is in a data weight range, the target identity tag of the target network node is determined as the data tag.
Specifically, taking a network node as an example, the computer device may obtain a virtual mortgage right and a historical consensus number of the network node, and determine the consensus weight of the network node according to the virtual mortgage right and the historical consensus number, for example, the consensus weight of the network node may be obtained by processing the virtual mortgage right and the historical consensus number based on a weight algorithm. Optionally, the computer device may further obtain a virtual mortgage right of the network node, a historical consensus number, a random number, and the like to determine a consensus weight of the network node, where the virtual mortgage right may be a virtual asset provided by the network node, and the historical consensus number may be a number of times that the network node participates in consensus, or a number of cycles of a consensus period in which the network node participates, and the like. The random number may be generated according to a system network time, a maximum block height in the node management block chain, or a hash value of a block in the node management block chain.
Optionally, a mortgage account exists in the block chain network, and the virtual asset can be acquired from an account of the network node, added to the mortgage account, and used as a virtual mortgage right of the corresponding network node; or, the virtual asset may be cached, and after the network node is verified, the virtual asset is added to the mortgage account, and if the network node is not verified, the virtual asset is returned to the account of the corresponding network node.
Step S404, when a network quit request of the network node to be processed is obtained, acquiring the consensus weight of the network node to be processed from the whole node table, sending the consensus weight of the network node to be processed to the network node to be processed, and deleting the network node to be processed in the whole node table.
In this embodiment of the present application, if a to-be-processed network node initiating a network logout request belongs to a consensus network, the consensus network is updated, where deleting the to-be-processed network node in the full node table means deleting all data (i.e., node information of the to-be-processed network node) of the to-be-processed network node in the full node table. Specifically, the computer device may obtain the identity tag of the to-be-processed network node from the full node table based on the network logout request, and if the identity tag of the to-be-processed network node is the consensus tag, trigger an update request for the consensus network, and execute the above steps S401 to S403 to update the consensus network; or, the network node to be processed is searched from the consensus node table, and if the network node to be processed is found in the consensus node table, an update request for the consensus network is triggered, and the processes in steps S401 to S403 are executed to update the consensus network. When an update request for a consensus network is triggered, or the identity tag of the to-be-processed network node is not a consensus tag, or the to-be-processed network node does not exist in the consensus node table, the computer device may obtain a consensus weight of the to-be-processed network node from the full node table, where the consensus weight of the to-be-processed network node includes a virtual mortgage interest of the to-be-processed network node, and send the virtual mortgage interest to the to-be-processed network node. And if the virtual mortgage interest is a virtual asset, sending the virtual asset to an account of the network node to be processed. Further, the data related to the network node to be processed (i.e., the node information of the network node to be processed) in the full node table is deleted. Wherein the network node to be processed belongs to at least two network nodes. Optionally, the data related to the network node to be processed in the full node table may be deleted first, and then it is detected whether the network node to be processed belongs to the consensus network, and if the network node to be processed belongs to the consensus network, an update request for the consensus network is triggered to update the consensus network.
When a network quitting request of a network node to be processed is obtained, the computer equipment can carry out identity authentication on the network node sending the network quitting request, if the identity authentication on the network node sending the network quitting request is passed, the network node sending the network quitting request is the network node requested by the network quitting request, the consensus weight of the network node to be processed is obtained from the whole node table, the consensus weight of the network node to be processed is sent to the network node to be processed, and the network node to be processed in the whole node table is deleted. For example, the network node a sends a network logout request, where the network logout request is used to indicate that the network node B wants to logout from the blockchain network, and when the computer device obtains the network logout request sent by the network node a, the computer device performs identity authentication on the network node a, and finds that the network node a requests to logout of other network nodes, it may be determined that the identity authentication on the network node a does not pass, and optionally, a node exception message may be sent to the network node a.
Wherein the full node table includes a node signature of each network node. Further, if an abnormal node is detected from at least two network nodes, a public key of the abnormal node is acquired. Adopting a public key of the abnormal node to check and sign a node signature corresponding to the abnormal node in the whole node table, if the node signature passes the check and sign, indicating that the abnormal node is not replaced, and sending a node confirmation message to the abnormal node, wherein the node confirmation message is used for acquiring abnormal data from the abnormal node; if the node signature of the abnormal node fails to pass the verification, the abnormal node is not the original network node in the whole node table, or the identity of the abnormal node is unknown, the network connection with the abnormal node is disconnected, and the data (namely the node information of the abnormal node) related to the abnormal node is deleted from the whole node table.
The method comprises the steps that the common identification weight of each network node is obtained from a full node table by obtaining at least two network nodes in a block chain network; acquiring at least two consensus nodes from at least two network nodes based on the consensus weight of each network node; detecting the connection state of at least two consensus nodes, recording the consensus nodes with the connection state being the disconnection state as consensus nodes to be connected, acquiring the node address information of the consensus nodes to be connected from the whole node table, and establishing network connection among the consensus nodes to be connected based on the node address information to obtain a consensus network. Through the process, the full node table is introduced into the blockchain network, node information (such as consensus weight) of each network node in the blockchain network and the like are stored in the full node table, when each network node in the blockchain network changes, data of the changed network node can be directly obtained from the full node table, the consensus network is established based on the full node table, the node information of each network node does not need to be counted again, deployment of the blockchain network does not need to be realized again, time and resources consumed by updating the blockchain network when the blockchain network changes are reduced, and flexibility of network node management in the blockchain network is improved.
Further, referring to fig. 7, fig. 7 is a schematic diagram of a block link point management device according to an embodiment of the present disclosure. The above block link point management device may be a computer program (including program code) running in a computer device, for example, the block link point management device is an application software; the apparatus may be used to perform the corresponding steps in the methods provided by the embodiments of the present application. As shown in fig. 7, the block link point management device 700 may be used in the computer device in the embodiment corresponding to fig. 4, specifically, the block link point management device 700 may include: the system comprises a weight acquisition module 11, a node selection module 12, a connection establishment module 13 and a node logout module 14.
The weight obtaining module 11 is configured to obtain at least two network nodes in a block chain network, and obtain a consensus weight of each network node from a full node table;
the node selection module 12 is configured to obtain at least two consensus nodes from the at least two network nodes based on the consensus weight of each network node;
the connection establishing module 13 is configured to detect connection states of at least two consensus nodes, record a consensus node with a connection state being a disconnection state as a to-be-connected consensus node, acquire node address information of the to-be-connected consensus node from the full node table, and establish network connection between the to-be-connected consensus nodes based on the node address information to obtain a consensus network;
the node network quitting module 14 is configured to, when a network quitting request of a network node to be processed is obtained, obtain a consensus weight of the network node to be processed from the full node table, send the consensus weight of the network node to be processed to the network node to be processed, delete the network node to be processed in the full node table, and update the consensus network if the network node to be processed initiating the network quitting request belongs to the consensus network; the network node to be processed belongs to at least two network nodes.
The full node table comprises an identity label and a consensus weight of each network node;
the weight obtaining module 11 includes:
a tag obtaining unit 111, configured to obtain at least two network nodes in a blockchain network, obtain an identity tag of each network node from a full node table, and obtain a network node whose identity tag is a consensus tag from the at least two network nodes, so as to obtain a candidate consensus node;
a weight obtaining unit 112, configured to obtain a consensus weight of the candidate consensus node from the full node table;
the node selection module 12 is specifically configured to:
acquiring the number of consensus nodes, and determining N consensus nodes from the candidate consensus nodes based on the consensus weights of the candidate consensus nodes and the number of the consensus nodes; the number of the consensus nodes is used for representing the number of the consensus nodes forming the consensus network, and N is the number of the consensus nodes.
The node selection module 12 is specifically configured to:
acquiring the number of consensus nodes, sequencing at least two network nodes based on the consensus weight of each network node, and acquiring N consensus nodes from the at least two network nodes according to a sequencing result; the number of the consensus nodes is used for representing the number of the consensus nodes forming the consensus network, and N is the number of the consensus nodes.
Wherein the full node table comprises an identity label of each network node;
in detecting the connection status of at least two consensus nodes, and recording the consensus node with the connection status being the disconnection status as the consensus node to be connected, the connection establishing module 13 includes:
a state determining unit 131, configured to obtain identity tags corresponding to the N consensus nodes from the full node table, and determine a connection state of a consensus node of which an identity tag is not a consensus tag as a connection disconnection state;
a consensus determining unit 132, configured to record the consensus node with the connection status being the disconnection status as the consensus node to be connected.
Wherein, the apparatus 700 further comprises:
a history obtaining module 15, configured to obtain a history consensus node with an identity label as a consensus label from the whole node table;
and the label updating module 16 is configured to disconnect the network connection of the history consensus nodes if the history consensus nodes do not belong to the N consensus nodes, update the identity labels of the history consensus nodes in the whole node table to be data labels, perform the steps of detecting the connection states of at least two consensus nodes, and record the consensus nodes with the connection states being the connection disconnection states as the consensus nodes to be connected.
Wherein, the apparatus 700 further comprises:
the table generating module 17 is configured to obtain node identifiers of at least two consensus nodes from the full node table, and generate a consensus node table according to the node identifiers of the at least two consensus nodes;
and a data storage module 18, configured to generate a consensus network block according to the consensus node table, and if the consensus passes through the consensus network block, add the consensus network block to the node management block chain, and perform a step of detecting a connection state of at least two consensus nodes.
Wherein, the apparatus 700 further comprises:
the weight determining module 19 is configured to obtain a virtual mortgage right and historical consensus times of the network nodes, and determine a consensus weight of the network nodes according to the virtual mortgage right and the historical consensus times;
and a data uplink module 20, configured to add the consensus weight to the node management block chain if the consensus on the consensus weight passes, and add the association relationship between the consensus weight and the network node to the full node table.
Wherein, the apparatus 700 further comprises:
a request obtaining module 21, configured to obtain a node network access request sent by a target network node; the node network access request comprises a target node identification, a target identity label and target node address information of a target network node;
the node verification module 22 is configured to verify the target network node according to the target node identifier and the target node address information, and if the target node address information of the target network node is legal, obtain a target identity tag;
the tag verification module 23 is configured to perform consensus on the target identity tag, and if the consensus passes, generate a node information block according to the target node identifier, the target identity tag, and the target node address information, and add the node information block to the node management block chain;
and the node adding module 24 is configured to add the target node identifier, the target identity tag, and the target node address information into the full node table.
In terms of consensus on the target identity tag, the tag verification module 23 includes:
a right obtaining unit 231, configured to obtain a target virtual mortgage right of the target identity tag if the target identity tag is a consensus tag;
a message sending unit 232, configured to obtain a consensus interest threshold, determine that the consensus on the target identity tag fails if the target virtual mortgage interest is smaller than the consensus interest threshold, and send a tag exception message to the target network node;
and a verification passing unit 233, configured to generate a target consensus weight of the target network node according to the target virtual mortgage right if the target virtual mortgage right is greater than or equal to the consensus right threshold, and determine that the target identity tag is agreed.
The full node table also comprises a node signature of each network node;
the apparatus 700 further comprises:
a public key obtaining module 25, configured to obtain a public key of an abnormal node if the abnormal node is detected from at least two network nodes;
the node signature verification module 26 is configured to verify a signature of a node corresponding to the abnormal node in the whole node table by using the public key of the abnormal node, and send a node confirmation message to the abnormal node if the signature passes; the node confirmation message is used for acquiring abnormal data from the abnormal node;
the node signature verification module 26 is further configured to disconnect the network connection with the abnormal node and delete the data associated with the abnormal node from the full node table if the node signature verification of the abnormal node fails.
The embodiment of the present application describes a block chain node management device, which uses any one of at least two network nodes to manage the network nodes in the block chain network, including generation of a consensus network, storage of node information, and the like, and introduces a full node table in the block chain network, where the full node table stores node information (such as consensus weight) of each network node in the block chain network, and the like, and when each network node in the block chain network changes, the data of the changed network node can be directly obtained from the full node table, and the consensus network is established based on the full node table, without re-counting the node information of each network node, without re-implementing deployment of the block chain network, and reducing time and resources consumed for updating the block chain network when the block chain network changes, flexibility in managing network nodes in a blockchain network is improved.
Referring to fig. 8, fig. 8 is a schematic structural diagram of a computer device according to an embodiment of the present application. As shown in fig. 8, the computer device 800 in the embodiment of the present application may include: one or more processors 801, a memory 802, and an input-output interface 803. The processor 801, the memory 802, and the input/output interface 803 are connected by a bus 804. The memory 802 is used for storing a computer program, which includes program instructions, and the input/output interface 803 is used for data interaction between each network node in the block chain; the processor 801 is configured to execute program instructions stored in the memory 802 to perform the following operations:
acquiring at least two network nodes in a block chain network, and acquiring a consensus weight of each network node from a full node table;
acquiring at least two consensus nodes from at least two network nodes based on the consensus weight of each network node;
detecting the connection state of at least two consensus nodes, recording the consensus nodes with the connection state being the disconnection state as consensus nodes to be connected, acquiring the node address information of the consensus nodes to be connected from the whole node table, and establishing network connection among the consensus nodes to be connected based on the node address information to obtain a consensus network;
when a network quitting request of a network node to be processed is obtained, acquiring a consensus weight of the network node to be processed from the whole node table, sending the consensus weight of the network node to be processed to the network node to be processed, deleting the network node to be processed in the whole node table, and updating the consensus network if the network node to be processed initiating the network quitting request belongs to the consensus network; the network node to be processed belongs to at least two network nodes.
In some possible embodiments, the processor 801 may be a Central Processing Unit (CPU), and the processor may be other general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf programmable gate array (FPGA) or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The memory 802 may include both read-only memory and random-access memory, and provides instructions and data to the processor 801 and the input/output interface 803. A portion of the memory 802 may also include non-volatile random access memory. For example, the memory 802 may also store device type information.
In a specific implementation, the computer may execute the implementation manners provided in the steps in fig. 4 through the built-in functional modules, which may specifically refer to the implementation manners provided in the steps in fig. 4, and details are not described herein again.
The embodiment of the present application provides a computer device, including: the processor, the input/output interface and the memory, the processor obtains the computer instructions in the memory, and executes the steps of the method shown in fig. 4 to perform the block link node management operation. With computer instructions in the memory, the processor performs the steps of: acquiring at least two network nodes in a block chain network, and acquiring a consensus weight of each network node from a full node table; acquiring at least two consensus nodes from at least two network nodes based on the consensus weight of each network node; detecting the connection state of at least two consensus nodes, recording the consensus nodes with the connection state being the disconnection state as consensus nodes to be connected, acquiring the node address information of the consensus nodes to be connected from the whole node table, and establishing network connection among the consensus nodes to be connected based on the node address information to obtain a consensus network. Through the process, the full node table is introduced into the blockchain network, node information (such as consensus weight) of each network node in the blockchain network and the like are stored in the full node table, when each network node in the blockchain network changes, data of the changed network node can be directly obtained from the full node table, the consensus network is established based on the full node table, the node information of each network node does not need to be counted again, deployment of the blockchain network does not need to be realized again, time and resources consumed by updating the blockchain network when the blockchain network changes are reduced, and flexibility of network node management in the blockchain network is improved.
An embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, where the computer program includes program instructions, and when the program instructions are executed by the processor, the block link point management method provided in each step in fig. 4 may be implemented, which specifically refers to the implementation manner provided in each step in fig. 4, and is not described herein again. In addition, the beneficial effects of the same method are not described in detail. For technical details not disclosed in embodiments of the computer-readable storage medium referred to in the present application, reference is made to the description of embodiments of the method of the present application. By way of example, program instructions may be deployed to be executed on one computer device or on multiple computer devices at one site or distributed across multiple sites and interconnected by a communication network, which may comprise a blockchain network.
The computer-readable storage medium may be the block link node management apparatus provided in any of the foregoing embodiments or an internal storage unit of the computer, such as a hard disk or a memory of the computer. The computer readable storage medium may also be an external storage device of the computer, such as a plug-in hard disk, a Smart Memory Card (SMC), a Secure Digital (SD) card, a flash memory card (flash card), and the like, provided on the computer. Further, the computer-readable storage medium may also include both an internal storage unit and an external storage device of the computer. The computer-readable storage medium is used for storing the computer program and other programs and data required by the computer. The computer readable storage medium may also be used to temporarily store data that has been output or is to be output.
Embodiments of the present application also provide a computer program product or computer program comprising computer instructions stored in a computer-readable storage medium. A processor of the computer device reads the computer instructions from the computer-readable storage medium, and executes the computer instructions, so that the computer device executes the method provided in the various optional manners in fig. 4, thereby implementing management of network nodes in the blockchain network, including generation of a consensus network, management of node information of the network nodes, and the like, wherein a full node table is introduced into the blockchain network, and node information (such as consensus weights) of each network node in the blockchain network is stored in the full node table, and when each network node in the blockchain network changes, data of the changed network node can be directly obtained from the full node table, a consensus network is established based on the full node table without newly counting the node information of each network node, and deployment of the blockchain network is not required to be newly implemented, the time and resources consumed by updating the blockchain network when the blockchain network changes are reduced, and the flexibility of network node management in the blockchain network is improved.
The terms "first," "second," and the like in the description and in the claims and drawings of the embodiments of the present application are used for distinguishing between different objects and not for describing a particular order. Furthermore, the terms "comprises" and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, apparatus, product, or apparatus that comprises a list of steps or elements is not limited to the listed steps or modules, but may alternatively include other steps or modules not listed or inherent to such process, method, apparatus, product, or apparatus.
Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
The method and the related apparatus provided by the embodiments of the present application are described with reference to the flowchart and/or the structural diagram of the method provided by the embodiments of the present application, and each flow and/or block of the flowchart and/or the structural diagram of the method, and the combination of the flow and/or block in the flowchart and/or the block diagram can be specifically implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block or blocks of the block diagram. These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block or blocks of the block diagram. These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block or blocks.
The above disclosure is only for the purpose of illustrating the preferred embodiments of the present application and is not to be construed as limiting the scope of the present application, so that the present application is not limited thereto, and all equivalent variations and modifications can be made to the present application.
Claims (15)
1. A block link point management method, the method comprising:
acquiring a node network access request sent by a target network node; the node network access request comprises a target node identification, a target identity label and target node address information of the target network node;
verifying the target network node according to the target node identification and the target node address information, and if the target node address information of the target network node is legal, acquiring the target identity tag;
performing consensus on the target identity tags, if the consensus passes, acquiring target virtual mortgage rights of the target network nodes, generating target consensus weights of the target network nodes according to the target virtual mortgage rights, and adding the target node identifiers, the target identity tags, the target node address information and the target consensus weights into a whole node table; the full node table comprises at least two network nodes, the at least two network nodes comprise the target network node, and the full node table comprises node identifications, identity labels, node address information and consensus weights respectively corresponding to the at least two network nodes; the consensus weights respectively corresponding to at least two network nodes in the full node table are basis for determining at least two consensus nodes from the at least two network nodes, and the node address information of the at least two consensus nodes is used for enabling the at least two consensus nodes to form a consensus network.
2. The method of claim 1, wherein said verifying the target network node based on the target node identification and the target node address information comprises:
sending a node confirmation request to the target network node based on the target node address information, and if a node confirmation message sent by the target network node is obtained, determining that the target node address information of the target network node is legal;
and if the node confirmation message sent by the target network node is not acquired after the node confirmation request is sent for a message feedback time length, determining that the target node address information of the target network node is illegal.
3. The method of claim 1, wherein the method further comprises:
and if the target node address information of the target network node is illegal, rejecting a node access request of the target network node and sending a node address information abnormal message to the target network node.
4. The method of claim 1, wherein the node network entry request further comprises a target node signature of the target network node;
the consensus on the target identity tag is performed, and if the consensus passes, the target virtual mortgage right of the target network node is obtained, including:
and identifying the target identity label in common, acquiring a public key of the target network node, adopting the public key of the target network node to check the signature of the target node, and if the signature passes through the check and the identification of the target identity label passes in common, acquiring the target virtual mortgage right of the target network node.
5. The method of claim 1, wherein the consensus on the target identity tag comprises:
acquiring the target identity label, and if the target identity label is a consensus label, acquiring a target virtual mortgage right of the target identity label;
acquiring a consensus right interest threshold, if the target virtual mortgage right interest is smaller than the consensus right interest threshold, determining that the target identity label consensus fails, and sending a label abnormal message to the target network node;
and if the target virtual mortgage interest is larger than or equal to the consensus interest threshold, determining that the target identity tag passes consensus.
6. The method of claim 1, wherein the consensus on the target identity tag comprises:
acquiring a node cluster to which the target network node belongs, and determining that the target identity label is commonly identified and passed if the node cluster to which the target network node belongs is matched with the target identity label;
and if the node cluster to which the target network node belongs is not matched with the target identity label, determining that the consensus on the target identity label fails, and sending a label abnormal message to the target network node.
7. The method of claim 1, wherein the method further comprises:
acquiring at least two network nodes in a block chain network, and acquiring a consensus weight of each network node from the full node table;
acquiring at least two consensus nodes from the at least two network nodes based on the consensus weight of each network node;
detecting the connection state of the at least two consensus nodes, recording the consensus node with the connection state being the disconnection state as a consensus node to be connected, acquiring the node address information of the consensus node to be connected from the whole node table, and establishing network connection between the consensus nodes to be connected based on the node address information to obtain a consensus network.
8. The method of claim 7, wherein obtaining at least two network nodes in the blockchain network, the consensus weight for each network node from the full node table comprises:
acquiring at least two network nodes in a block chain network, acquiring an identity label of each network node from the full node table, and acquiring the network nodes of which the identity labels are consensus labels from the at least two network nodes to obtain candidate consensus nodes;
acquiring consensus weights of the candidate consensus nodes from the full node table;
the obtaining at least two consensus nodes from the at least two network nodes based on the consensus weight of each network node comprises:
acquiring the number of consensus nodes, and determining N consensus nodes from the candidate consensus nodes based on the consensus weights of the candidate consensus nodes and the number of the consensus nodes; the number of the consensus nodes is used for representing the number of the consensus nodes forming the consensus network, and N is the number of the consensus nodes.
9. The method of claim 8, wherein the method further comprises:
and acquiring the node quantity and the node selection proportion of the at least two network nodes, and determining the consensus node quantity based on the node selection proportion and the node quantity of the at least two network nodes.
10. The method of claim 7, wherein the obtaining at least two consensus nodes from the at least two network nodes based on the consensus weight for each network node comprises:
acquiring the number of consensus nodes, sequencing the at least two network nodes based on the consensus weight of each network node, and acquiring N consensus nodes from the at least two network nodes according to a sequencing result; the number of the consensus nodes is used for representing the number of the consensus nodes forming the consensus network, and N is the number of the consensus nodes.
11. The method according to claim 10, wherein the detecting the connection status of the at least two consensus nodes, and the registering node with the connection status of the disconnection status as the consensus node to be connected comprises:
acquiring identity labels corresponding to the N consensus nodes from the full node table, and determining the connection state of the consensus nodes of which the identity labels are not the consensus labels as a connection disconnection state;
and recording the common identification node with the connection state being the disconnection state as a common identification node to be connected.
12. The method of claim 7, wherein the method further comprises:
acquiring node identifications of the at least two consensus nodes, and generating a consensus node table according to the node identifications of the at least two consensus nodes; the consensus node table is used for representing composition information of the consensus network;
and generating a consensus network block according to the consensus node table, if the consensus passes through the consensus network block, adding the consensus network block into a node management block chain, determining that the at least two consensus nodes can form a consensus network, and executing the step of detecting the connection state of the at least two consensus nodes.
13. The method of claim 12, wherein the method further comprises:
when a network quitting request of a network node to be processed is obtained, acquiring a consensus weight of the network node to be processed from the full node table, sending a virtual mortgage interest in the consensus weight of the network node to be processed to the network node to be processed, and deleting the network node to be processed in the full node table;
searching the network node to be processed from the consensus node table, if the network node to be processed is searched in the consensus node table, determining that the network node to be processed initiating the network quitting request belongs to the consensus network, and updating the consensus network; the network node to be processed belongs to the at least two network nodes.
14. A computer device comprising a processor, a memory, an input output interface;
the processor is connected to the memory and the input/output interface, respectively, wherein the input/output interface is used for data interaction between network nodes in a block chain, the memory is used for storing program codes, and the processor is used for calling the program codes to execute the method of any one of claims 1 to 13.
15. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program comprising program instructions which, when executed by a processor, perform the method of any of claims 1-13.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110189183.6A CN113162971B (en) | 2020-12-03 | 2020-12-03 | Block link point management method, device, computer and readable storage medium |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202110189183.6A CN113162971B (en) | 2020-12-03 | 2020-12-03 | Block link point management method, device, computer and readable storage medium |
CN202011397915.2A CN112200680B (en) | 2020-12-03 | 2020-12-03 | Block link point management method, device, computer and readable storage medium |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202011397915.2A Division CN112200680B (en) | 2020-12-03 | 2020-12-03 | Block link point management method, device, computer and readable storage medium |
Publications (2)
Publication Number | Publication Date |
---|---|
CN113162971A true CN113162971A (en) | 2021-07-23 |
CN113162971B CN113162971B (en) | 2022-07-22 |
Family
ID=74033819
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202110189183.6A Active CN113162971B (en) | 2020-12-03 | 2020-12-03 | Block link point management method, device, computer and readable storage medium |
CN202011397915.2A Active CN112200680B (en) | 2020-12-03 | 2020-12-03 | Block link point management method, device, computer and readable storage medium |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202011397915.2A Active CN112200680B (en) | 2020-12-03 | 2020-12-03 | Block link point management method, device, computer and readable storage medium |
Country Status (1)
Country | Link |
---|---|
CN (2) | CN113162971B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114884977A (en) * | 2022-05-09 | 2022-08-09 | 深圳嘉业产业发展有限公司 | Data sharing method and system based on block chain |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115378803B (en) * | 2022-04-13 | 2023-12-12 | 网易(杭州)网络有限公司 | Log management method, device, blockchain node and storage medium |
Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN109559120A (en) * | 2018-12-03 | 2019-04-02 | 国网电子商务有限公司 | Block chain common recognition method, system, storage medium and electronic equipment based on weight |
WO2020011284A2 (en) * | 2019-09-05 | 2020-01-16 | Alibaba Group Holding Limited | System and method for adding node in blockchain network |
WO2020011283A2 (en) * | 2019-09-05 | 2020-01-16 | Alibaba Group Holding Limited | System and method for deleting node in blockchain network |
CN110708171A (en) * | 2019-12-13 | 2020-01-17 | 腾讯科技(深圳)有限公司 | Block chain consensus voting method, device, equipment and storage medium |
WO2020088110A1 (en) * | 2018-10-31 | 2020-05-07 | 阿里巴巴集团控股有限公司 | Blockchain-based node management method and device |
CN111291060A (en) * | 2020-01-14 | 2020-06-16 | 腾讯科技(深圳)有限公司 | Method, device and computer readable medium for managing block chain nodes |
CN111383021A (en) * | 2020-05-29 | 2020-07-07 | 腾讯科技(深圳)有限公司 | Node management method, device, equipment and medium based on block chain network |
WO2020143183A1 (en) * | 2019-01-11 | 2020-07-16 | 平安科技(深圳)有限公司 | Blockchain consensus method based on delegated proof of stake, and related device |
CN111444210A (en) * | 2020-03-26 | 2020-07-24 | 腾讯科技(深圳)有限公司 | Block chain consensus node management method, device, equipment and storage medium |
CN111464353A (en) * | 2020-03-31 | 2020-07-28 | 财付通支付科技有限公司 | Block link point management method, device, computer and readable storage medium |
CN111786812A (en) * | 2020-05-27 | 2020-10-16 | 金蝶软件(中国)有限公司 | Node management method, node management device, computer equipment and storage medium |
Family Cites Families (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10304143B2 (en) * | 2016-05-05 | 2019-05-28 | Lance Timothy Kasper | Consensus system for manipulation resistant digital record keeping |
CN107171829B (en) * | 2017-04-24 | 2019-12-24 | 杭州趣链科技有限公司 | Dynamic node management method realized based on BFT consensus algorithm |
US10764031B2 (en) * | 2017-12-07 | 2020-09-01 | International Business Machines Corporation | Blockchain system for pattern recognition |
CN108712276A (en) * | 2018-04-19 | 2018-10-26 | 上海分布信息科技有限公司 | Common recognition network management, device, equipment and storage medium based on block chain technology |
CN111461885B (en) * | 2020-03-31 | 2024-03-19 | 财付通支付科技有限公司 | Consensus network management method, device, computer and readable storage medium |
CN111654415B (en) * | 2020-05-28 | 2021-09-10 | 腾讯科技(深圳)有限公司 | Block chain based information processing method, device, equipment and readable storage medium |
-
2020
- 2020-12-03 CN CN202110189183.6A patent/CN113162971B/en active Active
- 2020-12-03 CN CN202011397915.2A patent/CN112200680B/en active Active
Patent Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2020088110A1 (en) * | 2018-10-31 | 2020-05-07 | 阿里巴巴集团控股有限公司 | Blockchain-based node management method and device |
CN109559120A (en) * | 2018-12-03 | 2019-04-02 | 国网电子商务有限公司 | Block chain common recognition method, system, storage medium and electronic equipment based on weight |
WO2020143183A1 (en) * | 2019-01-11 | 2020-07-16 | 平安科技(深圳)有限公司 | Blockchain consensus method based on delegated proof of stake, and related device |
WO2020011284A2 (en) * | 2019-09-05 | 2020-01-16 | Alibaba Group Holding Limited | System and method for adding node in blockchain network |
WO2020011283A2 (en) * | 2019-09-05 | 2020-01-16 | Alibaba Group Holding Limited | System and method for deleting node in blockchain network |
CN110708171A (en) * | 2019-12-13 | 2020-01-17 | 腾讯科技(深圳)有限公司 | Block chain consensus voting method, device, equipment and storage medium |
CN111291060A (en) * | 2020-01-14 | 2020-06-16 | 腾讯科技(深圳)有限公司 | Method, device and computer readable medium for managing block chain nodes |
CN111444210A (en) * | 2020-03-26 | 2020-07-24 | 腾讯科技(深圳)有限公司 | Block chain consensus node management method, device, equipment and storage medium |
CN111464353A (en) * | 2020-03-31 | 2020-07-28 | 财付通支付科技有限公司 | Block link point management method, device, computer and readable storage medium |
CN111786812A (en) * | 2020-05-27 | 2020-10-16 | 金蝶软件(中国)有限公司 | Node management method, node management device, computer equipment and storage medium |
CN111383021A (en) * | 2020-05-29 | 2020-07-07 | 腾讯科技(深圳)有限公司 | Node management method, device, equipment and medium based on block chain network |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114884977A (en) * | 2022-05-09 | 2022-08-09 | 深圳嘉业产业发展有限公司 | Data sharing method and system based on block chain |
Also Published As
Publication number | Publication date |
---|---|
CN113162971B (en) | 2022-07-22 |
CN112200680A (en) | 2021-01-08 |
CN112200680B (en) | 2021-03-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112104665B (en) | Block chain-based identity authentication method and device, computer and storage medium | |
CN111291060B (en) | Method, device and computer readable medium for managing blockchain nodes | |
CN110730225A (en) | Data processing method of Internet of things based on block chain, Internet of things and storage medium | |
CN111885050B (en) | Data storage method and device based on block chain network, related equipment and medium | |
CN111464353B (en) | Block link point management method, device, computer and readable storage medium | |
CN111523890A (en) | Data processing method and device based on block chain, storage medium and equipment | |
CN110266872B (en) | Address book data management and control method and device, cloud address book system, computer equipment and computer readable storage medium | |
CN111639309B (en) | Data processing method and device, node equipment and storage medium | |
CN113162971B (en) | Block link point management method, device, computer and readable storage medium | |
CN111476572A (en) | Data processing method and device based on block chain, storage medium and equipment | |
CN110599144B (en) | Network access method and device for blockchain nodes | |
CN111488372A (en) | Data processing method, device and storage medium | |
CN111597567A (en) | Data processing method, data processing device, node equipment and storage medium | |
CN110866265A (en) | Data storage method, device and storage medium based on block chain | |
CN111260475A (en) | Data processing method, block chain node point equipment and storage medium | |
CN111597537B (en) | Block chain network-based certificate issuing method, related equipment and medium | |
CN111367923A (en) | Data processing method, data processing device, node equipment and storage medium | |
CN113505260A (en) | Face recognition method and device, computer readable medium and electronic equipment | |
CN113409047B (en) | Data processing method, device and equipment based on block chain and readable storage medium | |
CN112069529B (en) | Block chain-based volume management method and device, computer and storage medium | |
CN112417052B (en) | Data synchronization method, device, equipment and storage medium in block chain network | |
CN113129002A (en) | Data processing method and equipment | |
CN116980412A (en) | Block chain-based data processing method, equipment and readable storage medium | |
CN116070191A (en) | Information processing method and device, storage medium, and program product | |
CN111008251B (en) | Data processing method and device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 40048726 Country of ref document: HK |
|
GR01 | Patent grant | ||
GR01 | Patent grant |