CN109981586B - Node marking method and device - Google Patents
Node marking method and device Download PDFInfo
- Publication number
- CN109981586B CN109981586B CN201910144643.6A CN201910144643A CN109981586B CN 109981586 B CN109981586 B CN 109981586B CN 201910144643 A CN201910144643 A CN 201910144643A CN 109981586 B CN109981586 B CN 109981586B
- Authority
- CN
- China
- Prior art keywords
- type
- node
- permit
- target node
- computing
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Signal Processing (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Computer Networks & Wireless Communication (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Computing Systems (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Economics (AREA)
- Marketing (AREA)
- General Engineering & Computer Science (AREA)
- Technology Law (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer And Data Communications (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The application discloses a node marking method, which is used for solving the problem that when a task is performed in a block chain network according to the prior art, whether the computing capacity of a node meets the task requirement cannot be judged visually, so that the task distribution efficiency is low. The method comprises the following steps: acquiring node information representing the computing capacity of a target node in a block chain network; sending a type evidence collection to the target node; the type pass set is composed of at least one type pass; authorizing the target node to have the type permit corresponding to the computing capability of the target node in the type permit set according to the node information and the preset corresponding relation between the type permit and the computing capability; and the type permit authorized to be provided by the target node is used as a basis for distributing the calculation task for the target node. The application also discloses a node marking device.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to a node marking method and apparatus.
Background
With the rise of bitcoin in recent years, the blockchain technology has gradually started to attract attention. A blockchain is a point-to-point electronic ledger that is essentially a decentralized distributed database that holds historical transaction data and is shared by nodes, i.e., devices in the blockchain that participate in processing traffic, via a distributed consensus protocol. Once the data enters the blockchain, each node on the blockchain can receive the data and perform point-to-point transaction, coordination and cooperation.
The peer-to-peer electronic ledger is comprised of blocks that are comprised of transactions. Each transaction is a data structure encoding a transfer of control of a digital asset between participants in a blockchain system, and each transaction includes at least one input and at least one output. Each block contains a hash of the previous block so that the blocks become linked together to create a permanent, unalterable record of all transactions that have been written to the block chain since the start of the block chain.
During the process of recording the transaction, each node in the blockchain network often takes on different tasks, for example, some nodes may perform the block-out task as the block-out node, and some nodes may perform the task of verifying the transaction as the verification node. Because the out-blocking task needs strong computing power support, the node executing the out-blocking task is often required to have strong computing power, and the node executing the verification task does not have high requirement on computing power.
It follows that in existing blockchain networks, the computational power requirements of the nodes are different for different tasks.
In the prior art, when a node needs to be selected from a blockchain network to execute a task, the node meeting the computing capability requirement corresponding to the task can be determined only in a node computing capability competition mode. Because the competition of the computing capacity of the nodes requires that each node firstly solves a complex workload proving function and judges according to the time consumed by each node for solving the workload proving function, more time is required to be spent on selecting the nodes when task allocation is carried out, and thus the task allocation efficiency is low.
Disclosure of Invention
The embodiment of the application provides a node marking method, which is used for solving the problem that when a task is performed in a block chain network according to the prior art, whether the computing capacity of a node meets the task requirement cannot be judged visually, so that the task distribution efficiency is low.
The embodiment of the application further provides a node marking device, which is used for solving the problem that when a task is performed in a block chain network according to the prior art, whether the computing capacity of the node meets the task requirement cannot be judged intuitively, so that the task allocation efficiency is low.
The embodiment of the application adopts the following technical scheme:
a node marking method, comprising: acquiring node information representing the computing capacity of a target node in a block chain network; sending a type evidence collection to the target node; the type pass set is composed of at least one type pass; authorizing the target node to have the type permit corresponding to the computing capability of the target node in the type permit set according to the node information and the preset corresponding relation between the type permit and the computing capability; and the type permit authorized to be provided by the target node is used as a basis for distributing the calculation task for the target node.
A node marking method, comprising: acquiring node information representing the computing capacity of a target node in a block chain network; authorizing the target node to have type permit corresponding to the computing capability according to the node information and the preset corresponding relation between the type permit and the computing capability; and the type permit authorized to be provided by the target node is used as a basis for distributing the calculation task for the target node.
A tag revocation method, comprising:
determining type evidence possessed by the target node; and sending a revocation instruction carrying the type permit information to the target node according to the determined type permit, and revoking the authorization of the type permit corresponding to the revocation instruction in the type set.
A node marking method, comprising: a node in a block chain network receives a type evidence collection; the type pass set is composed of at least one type pass; receiving a type pass-certificate authorization instruction; the type certification passing authorization instruction carries type certification passing information corresponding to the computing capacity; and according to type certification information which is carried in the type certification authorization instruction and corresponds to the computing capacity, modifying the initial value of a specific field in the type certification corresponding to the type certification authorization instruction in the type set into a preset value.
A task allocation method, comprising: determining the node computing capacity required by the computing task to be distributed;
determining a type permit corresponding to the determined node computing capability according to a preset corresponding relation between the type permit and the computing capability and the determined node computing capability; and selecting the nodes with the type permit from the block chain network to distribute the computing task according to the determined type permit.
A node marking apparatus comprising: the information acquisition unit is used for acquiring node information representing the calculation capacity of a target node in the block chain network; the evidence obtaining unit is used for obtaining a type evidence obtaining set of the target node; the type pass set is composed of at least one type pass; the authorization unit is used for authorizing the target node to have the type permit corresponding to the computing capability of the target node in the type permit set according to the node information and the preset corresponding relation between the type permit and the computing capability; and the type permit authorized to be provided by the target node is used as a basis for distributing the calculation task for the target node.
A node marking apparatus comprising: the node information acquisition unit is used for acquiring node information representing the calculation capacity of a target node in the block chain network; the certification authorization unit is used for authorizing the target node to have the type certification corresponding to the computing capability according to the node information and the preset corresponding relation between the type certification and the computing capability; and the type permit authorized to be provided by the target node is used as a basis for distributing the calculation task for the target node.
A tag revocation apparatus, comprising: the evidence obtaining determining unit is used for determining type evidence obtained by the target node; and the authorization canceling unit is used for sending a canceling instruction carrying the type certification information to the target node according to the determined type certification and canceling the authorization of the type certification corresponding to the canceling instruction in the type set.
A node marking apparatus comprising: the system comprises a receiving unit of the evidence collection, a receiving unit of the type evidence collection and a processing unit of the type evidence collection; the type pass set is composed of at least one type pass; the instruction receiving unit is used for receiving the type certification authorization instruction; the type certification passing authorization instruction carries type certification passing information corresponding to the computing capacity; and the modification unit is used for modifying the initial value of the specific field in the type permit corresponding to the type permit authorization instruction in the type set into a preset value according to the type permit information corresponding to the computing capacity and carried in the type permit authorization instruction.
A task assigning apparatus comprising: the computing capacity determining unit is used for determining the computing capacity of the nodes required by the computing tasks to be distributed; the type certification confirming unit is used for confirming the type certification corresponding to the confirmed node calculating capacity according to the preset corresponding relation between the type certification and the calculating capacity and the confirmed node calculating capacity; and the task allocation unit is used for selecting a node with the type permit from the block chain network to allocate the computing task according to the determined type permit.
The embodiment of the application adopts at least one technical scheme which can achieve the following beneficial effects:
by adopting the node marking method provided by the embodiment of the application, before task allocation is carried out, the node information representing the computing capacity of a target node in a block chain network can be obtained, a type permit set formed by at least one type permit is sent to the target node, further, the computing capacity of the target node can be determined according to the pre-obtained node information representing the computing capacity, the target node is authorized to have the type permit corresponding to the computing capacity of the target node in the type permit set according to the preset corresponding relation between the type permit and the computing capacity, and the computing capacity of the target node is represented through the type permit authorized to be possessed by the target node. When the nodes are subjected to task allocation, the computing capacity of the nodes can be determined intuitively according to the type evidence authorized and possessed by the nodes, so that the task allocation can be performed according to the computing capacity of the nodes, and the problem that in the prior art, the nodes meeting the computing capacity requirement corresponding to the tasks need to be determined in a node computing capacity competition mode, and the task allocation efficiency is low is solved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a schematic flowchart illustrating a specific process of a node marking method according to an embodiment of the present application;
fig. 2 is a schematic flowchart illustrating a specific process of a method for revoking a mark according to an embodiment of the present application;
fig. 3 is a schematic flowchart of another node marking method according to an embodiment of the present application;
fig. 4 is a schematic specific flowchart of another node marking method according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a node marking apparatus according to an embodiment of the present disclosure;
fig. 6 is a schematic structural diagram of another node marking apparatus according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of another node marking apparatus according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of a task allocation apparatus according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some 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 technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
The node marking method provided by the embodiment of the application is used for solving the problem that when a task is performed in a block chain network according to the prior art, whether the computing capacity of the node meets the task requirement or not can not be judged visually, so that the task distribution efficiency is low.
In the node marking method provided by the embodiment of the application, an execution main body of the method can be a server, for example, a payment server, a game server, a shopping server and the like constructed based on a block chain; the execution subject of the method may be each node registered in the blockchain network, or the like. The execution subject is not limited to the present application, and for convenience of description, the execution subject is taken as an example of a node registered in the blockchain network in the embodiments of the present invention.
The specific implementation flow diagram of the method is shown in fig. 1, and mainly comprises the following steps:
the technical solution provided by the present application is mainly to mark nodes in a Block Chain network, so to facilitate understanding of the present solution, a Block Chain (Block Chain) in the embodiment of the present application is first briefly introduced below, where the Block Chain is a distributed storage data structure composed of all Block Chain nodes of an access server, and the Block Chain network includes a plurality of blocks (blocks) in which a plurality of pieces of transaction record data are recorded. The user terminal containing the client can be registered as a block chain node in a block chain network, and forms a Peer-to-Peer (P2P) network with other block chain nodes accessed to a block chain server, transaction record data recorded in a block can be stored in the P2P network, and any one or more block chain nodes of the P2P network are broken down, so that the block chain data cannot be lost, and the block chain data has strong security and can be ensured to be permanently stored and not to be tampered. When a block is mined by block chain nodes and verified by other block chain nodes, transaction record data recorded on the block is persisted into the block chain data, and all the block chain nodes accessed into the block chain server store the transaction record data in the block; the blocks are added to the blockchain data one by one in a persistence time sequence, each block except the first block in the blockchain data is linked to the previous block, so that the blockchain data forms a blockchain of the blocks, and the blocks cannot be modified after the blocks are persisted to the blockchain data.
In the blockchain network, whenever a transaction is newly generated, the transaction record of the transaction is recorded in a block, and the blockchain nodes in the blockchain network determine which blockchain node "excavates" the block by competing to complete a mathematical problem based on the hash algorithm, and the blockchain node of the excavated block is called an out-block node. After a new block is mined, other blockchain nodes in the blockchain network verify each new transaction record recorded in the block, and add the transaction record in the block to the blockchain network after the verification is passed.
As can be seen from the above description, the out-blocking nodes in the blockchain network are generated by competing for the computational power of the nodes, and the computational power of the nodes in the blockchain network is called computational power (also called hash rate) and is a measure of the processing power of the nodes in the blockchain network. I.e. the speed at which the hash function output is calculated for the Computer (CPU) corresponding to the node in the blockchain network. Therefore, in a blockchain network, a user terminal that is a block node (or can participate in competing for the block node) is often required to have a strong computing power. Thus, the block nodes in the current blockchain network are usually generated by selecting the block link points corresponding to specific ues, and these specific ues are usually called mining machines (currently, mining machines are generally composed of computers and a graphics card matrix, and compete to generate the block nodes by the computing power provided by the graphics card matrix). When registering a blockchain node on a blockchain network, the specific user terminals often register the ID of the node according to a specific naming mode, so that in the embodiment of the present application, the computing capability corresponding to the node can be determined by the ID of the blockchain node. Therefore, in step 11, the ID of the blockchain node can be obtained as the node information characterizing the computing capability of the target node in the blockchain network.
For example, when a specific user terminal as an mining machine registers a blockchain node on a blockchain network, the ID of each registered node starts with AA, and the node ID obtained by performing step 11 to characterize the computing capability of the node starts with AA, it can be determined that the node has a high computing capability.
wherein, the type evidence collection is composed of at least one type evidence.
The certificate can be understood as a negotiable encrypted digital rights certificate. There are three main factors for general syndrome, one is absent and the other is not. The first is that the digital rights certificate, i.e. the warrant must be a digital form of rights certificate, which must represent a right, an Intrinsic and Intrinsic value (Intrinsic value); secondly, encryption, namely the authenticity, tamper resistance, privacy protection and other capabilities of the certificate of pass are guaranteed by cryptography, and each certificate of pass is a right protected by cryptography, and the protection is firmer and more reliable than the protection provided by any law, authority and gun; third, it is negotiable, that is, the certificate must be able to flow in a network so that it can be verified anytime and anywhere.
In the embodiment of the present application, the blockchain network server may issue a manageable Token as a type permit reflecting the type of blockchain link point. In the embodiment of the present application, Token issued by the blockchain network server is a unique number in the blockchain network, and is also an indivisible minimum individual that can be issued and transferred in the blockchain network. Since at least two types of block chain link points exist in the block chain network, in order to visually reflect the node types corresponding to the block chain nodes through the type permit Token, in one embodiment, the different Token can be distinguished through the difference of the IDs of the tokens corresponding to the different node types.
It should be noted that, in the embodiment of the present application, in order to implement issuing of the type permit, the blockchain network server often needs to determine a node (for convenience of description, this node is hereinafter referred to as a permit issuing node) for issuing the type permit in the blockchain network, and give a management authority of the permit to the permit issuing node, that is, the permit issuing node can authorize and cancel the type permit.
In a blockchain network, due to the difference in computing power of blockchain nodes, tasks allocated to different nodes are often different. For example, the task of mining newly generated blocks is often performed by a high-computing-capacity block-out node, and the task of verifying transaction records in the mined blocks is often performed by a verification node. Therefore, in the existing block chain network, different block chain nodes are divided into different types of nodes according to different assumed tasks.
Different types of block links often have different functions, for example, the block-out node is responsible for mining a newly generated block, and the verification node is responsible for verifying the transaction record in the mined block. Therefore, in the embodiment of the present application, the type of the block link point and the user terminal corresponding to the block link point may also be determined according to the function of the block link node.
After determining the selection range of the nodes in the above manner, the blockchain network server may select a plurality of nodes from the range, and perform type marking on the selected nodes according to the marking manner provided by the present application. For example, the division is performed according to the dimension of the task performed by the node, and the block link points may be divided into: the three types of the out-blocking node, the verification node and the registration node.
After all the terminal devices complete the registration operation in the blockchain network, the terminal devices can be called registration nodes in the blockchain network, and the registration nodes can be subsequently distributed with different tasks according to different computing capacities; the verification node is generally a full node having complete data of the blockchain network, and can verify transaction data in the blockchain network. The block-out node has strong computing power and is used for mining the newly generated transaction block.
Since the types of the blockchain nodes may be distinguished by different types of credentials in the type credential set in the embodiment of the present application, the type credential set in the embodiment of the present application may include at least one of the following types of credentials:
type 1: go out piece node certificate
The out-of-block node credential corresponds to a first computing capability.
Type 2: verifying the node certification;
the verification node is certified to correspond to the second computing capacity.
Type 3: registering node certification;
the registered node credential corresponds to the third computing capability.
According to the requirement of the blockchain network on the computing capacity of the node during use, in the embodiment of the present application, it is only required to ensure that the first computing capacity is greater than the second computing capacity and the third computing capacity, and the size relationship between the second computing capacity and the third computing capacity is not limited here.
In this embodiment, the certification issuing node may combine the ID of the block chain node and the ID of a certain type of certification to be issued, and use a public key to obtain Token assigned to the block chain link point through a one-way cryptographic hash algorithm, as the type certification issued by the block chain node.
For example, a type permit is issued to a blockchain node by a permit issuing node, and the ID of the blockchain node is: 12, the IDs of the three types of certificates to be distributed are respectively, registration node certificate: aa, verifying node certification: "Bb", the node certificate of the block is issued: "Cc", the public key is K. The certification issuing node can generate a Token which is issued to the block chain node 12 and used for representing the certification of the registration node according to the '12', 'Aa' and K; generating a Token which is issued to the blockchain node 12 and used for representing the certification of the verification node according to the '12', 'Bb' and K; and generating Token which is issued to the blockchain node 12 and used for showing the block node certificate according to the '12', 'Cc' and the K, and further completing the type certificate issue for the blockchain node 12.
In one embodiment, the Algorithm for generating Token representing type pass from the public key may be Secure Hash Algorithm (SHA) or raw Integrity check Message Digest (RIPEMD), and especially SHA256 Algorithm and RIPEMD160 may be used.
In addition, it should be noted that, in the embodiment of the present application, the execution sequence of step 11 and step 12 is not limited, and step 11 may be executed first, and then step 12 may be executed; or step 12 may be executed first and then step 11 may be executed; it is even possible to perform step 11 and step 12 simultaneously.
And step 13, authorizing the target node to have the type permit corresponding to the computing capability of the target node in the type permit set according to the node information acquired by executing the step 11 and the preset corresponding relation between the type permit and the computing capability.
And the type evidence which the target node is authorized to have is used as a basis when the target node is allocated with the computing task.
It should be noted that, since the type certification set composed of multiple types of certificates is sent to the target node by executing step 12, therefore, in order to determine the computing power corresponding to the target node according to the type certificates in the type certificate set, in one embodiment, after determining the computing capability of the node by performing step 11, the credential issuance node may authorize a type credential corresponding to the determined computing capability in a type credential set of the target node to mark the type credential, and then subsequently, when task allocation is carried out, the computing capacity of the target node can be determined according to the computing capacity corresponding to the authorized type permit in the type permit set of the target node, and then the function of carrying out task allocation according to the computing capacity of the target node is realized.
In the embodiment of the present application, there is a specific field in Token as type credential to indicate whether the Token is authorized by the credential issuing node. Specifically, in one embodiment, whether the type credential is authorized can be indicated by an assignment of the specific field in Token. For example, the specific fields in Token as type pass are: "adcvv: 0 ″, where the value "0" assigned to the field is an initial value of the field, and it can be indicated that the type pass is not authorized by the initial value, and when the type pass needs to be authorized, the initial value assigned to the specific field can be modified, for example, the initial value "0" is adjusted to a predetermined value "1", and then the specific field in Token, which is the type pass, is: "adcvv: 1 ", this type of evidence is authorized.
In an implementation manner, in an embodiment of the present application, a type permit corresponding to a computing capability of a target node in a type set carried by the target node may be authorized by the following method: and sending a type certification authorization instruction carrying type certification information corresponding to the computing capacity to the target node, so that the target node responds to the type certification authorization instruction and modifies the initial value of a specific field in the type certification corresponding to the computing capacity in the type set to a preset value.
In addition, the embodiment of the application also provides a task allocation method, which is used for solving the problem that when the task is performed in the block chain network according to the prior art, whether the node computing capacity meets the task requirement or not can not be judged visually, so that the task allocation efficiency is low.
The task allocation method mainly comprises the following steps:
step a: determining the node computing capacity required by the computing task to be distributed;
step b: determining a type permit corresponding to the determined node computing capability according to a preset corresponding relation between the type permit and the computing capability and the determined node computing capability;
step c: and selecting the nodes with the type permit from the block chain network to distribute the computing task according to the determined type permit.
By adopting the node marking method provided by the embodiment of the application, before task allocation is carried out, the node information representing the computing capacity of a target node in a block chain network can be obtained, a type permit set formed by at least one type permit is sent to the target node, further, the computing capacity of the target node can be determined according to the pre-obtained node information representing the computing capacity, the target node is authorized to have the type permit corresponding to the computing capacity of the target node in the type permit set according to the preset corresponding relation between the type permit and the computing capacity, and the computing capacity of the target node is represented through the type permit authorized to be possessed by the target node. When the nodes are subjected to task allocation, the computing capacity of the nodes can be determined intuitively according to the type evidence authorized and possessed by the nodes, so that the task allocation can be performed according to the computing capacity of the nodes, and the problem that in the prior art, the nodes meeting the computing capacity requirement corresponding to the tasks need to be determined in a node computing capacity competition mode, and the task allocation efficiency is low is solved.
In addition, the embodiment of the application also provides a marking revocation method based on the node marking method, which is used for revoking the authorization of the node by the method.
The specific implementation flow diagram of the method is shown in fig. 2, and mainly comprises the following steps:
step 21: determining type evidence possessed by the target node;
generally, after a block chain node completes a current task, a block chain network server will recover the block chain node to an initial state, that is, revoke the authorization of a certain type of certificate in the node. Therefore, in this case, the blockchain network server may monitor the task currently executed by the block link point that has been subjected to the type marking, and when it is monitored that the currently executed task is finished, perform permission revocation on the authorized type permit carried by the block link point. In this case the credential issuing node may first determine the type of credential that the node to revoke the rights possesses.
Step 22: and sending a revocation instruction carrying the type permit information to the target node according to the determined type permit, and revoking the authorization of the type permit corresponding to the revocation instruction in the type set.
In an embodiment, the credential issuance node may send a revocation instruction carrying the type credential information determined by performing step 21 to the target node, so that the target node modifies a predetermined value of a specific field in the type credential corresponding to the revocation instruction in the type set to an initial value in response to the revocation instruction, so as to revoke the authorization of the type credential.
Example 2
The node marking method provided by the embodiment of the application is used for solving the problem that when a task is performed in a block chain network according to the prior art, whether the computing capacity of the node meets the task requirement or not can not be judged visually, so that the task distribution efficiency is low.
In the node marking method provided by the embodiment of the application, an execution main body of the method can be a server, for example, a payment server, a game server, a shopping server and the like constructed based on a block chain; the execution subject of the method may be each node registered in the blockchain network, or the like. The execution subject is not limited to the present application, and for convenience of description, the execution subject is taken as an example of a node registered in the blockchain network in the embodiments of the present invention.
The specific implementation flow diagram of the method is shown in fig. 3, and mainly comprises the following steps:
in the prior art, out-of-block nodes in a blockchain network are generated by competing for the computational power of the nodes, and the computational power of the nodes in the blockchain network is called computational power (also called hash rate) and is a measurement unit representing the processing power of the nodes in the blockchain network. I.e. the speed at which the hash function output is calculated for the Computer (CPU) corresponding to the node in the blockchain network. Therefore, in a blockchain network, a user terminal that is a block node (or can participate in competing for the block node) is often required to have a strong computing power. Thus, the block nodes in the current blockchain network are usually generated by selecting the block link points corresponding to specific ues, and these specific ues are usually called mining machines (currently, mining machines are generally composed of computers and a graphics card matrix, and compete to generate the block nodes by the computing power provided by the graphics card matrix). When registering a blockchain node on a blockchain network, the specific user terminals often register the ID of the node according to a specific naming mode, so that in the embodiment of the present application, the computing capability corresponding to the node can be determined by the ID of the blockchain node. Therefore, in step 11, the ID of the blockchain node can be obtained as the node information characterizing the computing capability of the target node in the blockchain network.
For example, when a specific user terminal as an mining machine registers a blockchain node on a blockchain network, the ID of each registered node starts with AA, and the node ID obtained by performing step 11 to characterize the computing capability of the node starts with AA, it can be determined that the node has a high computing capability.
Specifically, the type permit set can be sent to the target node; the type pass set is composed of at least one type pass; and authorizing the target node to have the type permit corresponding to the computing capability of the target node in the type permit set according to the node information and the preset corresponding relation between the type permit and the computing capability.
By adopting the node marking method provided by the embodiment of the application, before task allocation is carried out, the node information representing the computing capacity of a target node in a block chain network can be obtained, a type permit set formed by at least one type permit is sent to the target node, further, the computing capacity of the target node can be determined according to the pre-obtained node information representing the computing capacity, the target node is authorized to have the type permit corresponding to the computing capacity of the target node in the type permit set according to the preset corresponding relation between the type permit and the computing capacity, and the computing capacity of the target node is represented through the type permit authorized to be possessed by the target node. When the nodes are subjected to task allocation, the computing capacity of the nodes can be determined intuitively according to the type evidence authorized and possessed by the nodes, so that the task allocation can be performed according to the computing capacity of the nodes, and the problem that in the prior art, the nodes meeting the computing capacity requirement corresponding to the tasks need to be determined in a node computing capacity competition mode, and the task allocation efficiency is low is solved.
Example 3
The node marking method provided by the embodiment of the application is used for solving the problem that when a task is performed in a block chain network according to the prior art, whether the computing capacity of the node meets the task requirement or not can not be judged visually, so that the task distribution efficiency is low.
In the node marking method provided by the embodiment of the application, an execution main body of the method can be a server, for example, a payment server, a game server, a shopping server and the like constructed based on a block chain; the execution subject of the method may be each node registered in the blockchain network, or the like. The execution subject is not limited to the present application, and for convenience of description, the execution subject is taken as an example of a node registered in the blockchain network in the embodiments of the present invention.
The specific implementation flow diagram of the method is shown in fig. 4, and mainly comprises the following steps:
step 41: receiving a type pass-certificate set;
wherein, the type general evidence collection is composed of at least one type general evidence.
In the embodiment of the present application, the type permit set may include at least one of the following types:
type 1: go out piece node certificate
The out-of-block node credential corresponds to a first computing capability.
Type 2: verifying the node certification;
the verification node is certified to correspond to the second computing capacity.
Type 3: registering node certification;
the registered node credential corresponds to the third computing capability.
According to the requirement of the blockchain network on the computing capacity of the node during use, in the embodiment of the present application, it is only required to ensure that the first computing capacity is greater than the second computing capacity and the third computing capacity, and the size relationship between the second computing capacity and the third computing capacity is not limited here.
Step 42: receiving a type pass-certificate authorization instruction;
the type certification passing authorization instruction carries type certification passing information corresponding to the computing capacity.
Step 43: and according to the type certification information corresponding to the computing capacity and carried in the type certification authorization instruction received by executing the step 42, modifying the initial value of the specific field in the type certification corresponding to the type certification authorization instruction in the type set to a preset value.
By adopting the node marking method provided by the embodiment of the application, before task allocation is carried out, the node information representing the computing capacity of a target node in a block chain network can be obtained, a type permit set formed by at least one type permit is sent to the target node, further, the computing capacity of the target node can be determined according to the pre-obtained node information representing the computing capacity, the target node is authorized to have the type permit corresponding to the computing capacity of the target node in the type permit set according to the preset corresponding relation between the type permit and the computing capacity, and the computing capacity of the target node is represented through the type permit authorized to be possessed by the target node. When the nodes are subjected to task allocation, the computing capacity of the nodes can be determined intuitively according to the type evidence authorized and possessed by the nodes, so that the task allocation can be performed according to the computing capacity of the nodes, and the problem that in the prior art, the nodes meeting the computing capacity requirement corresponding to the tasks need to be determined in a node computing capacity competition mode, and the task allocation efficiency is low is solved.
Example 4
The embodiment of the application provides a node marking device, which is used for solving the problem that when a task is performed in a block chain network according to the prior art, whether the computing capacity of a node meets the task requirement cannot be judged visually, so that the task distribution efficiency is low. The specific structural diagram of the device is shown in fig. 5, and the device comprises: an information acquisition unit 51, a credential sending unit 52, and an authorization unit 53.
The information acquiring unit 51 is configured to acquire node information representing a computing capability of a target node in a blockchain network;
a credential sending unit 52, configured to send a type credential set to the target node; the type pass set is composed of at least one type pass;
an authorizing unit 53, configured to authorize the target node to have a type permit corresponding to the computing capability of the target node in the type permit set according to the node information and a preset corresponding relationship between a type permit and the computing capability; and the type permit authorized to be provided by the target node is used as a basis for distributing the calculation task for the target node.
In one embodiment, the authorization unit 53 is specifically configured to:
and sending a type certification authorization instruction carrying type certification information corresponding to the computing capacity to the target node, so that the target node responds to the type certification authorization instruction and modifies the initial value of a specific field in the type certification corresponding to the computing capacity in the type set to a preset value.
In one embodiment, the set of type passes includes at least one of the following types of passes:
a block node corresponding to the first computing capacity is certified;
the verification node corresponding to the second computing capacity is certified;
a registered node corresponding to the third computing power is certified;
wherein the first computing capacity is greater than the second computing capacity and the third computing capacity.
In addition, the embodiment of the application also provides a mark revocation device, which is used for revoking the node authorization. The method comprises the following steps: a certification confirming unit and an authorization canceling unit.
The system comprises a certification passing determining unit, a certification receiving unit and a certification sending unit, wherein the certification passing determining unit is used for determining type certification passing of a target node;
and the authorization canceling unit is used for sending a canceling instruction carrying the type certification information to the target node according to the determined type certification and canceling the authorization of the type certification corresponding to the canceling instruction in the type set.
In one embodiment, the authorization revocation unit is specifically configured to: and sending a revocation instruction carrying the type permit information to the target node, so that the target node responds to the revocation instruction and modifies a preset value of a specific field in the type permit corresponding to the revocation instruction in the type set into an initial value.
By adopting the node marking device provided by the embodiment of the application, before task allocation is carried out, the node information representing the computing capacity of a target node in a block chain network can be obtained, a type permit set formed by at least one type permit is sent to the target node, further, the computing capacity of the target node can be determined according to the pre-obtained node information representing the computing capacity, the target node is authorized to have the type permit corresponding to the computing capacity of the target node in the type permit set according to the preset corresponding relation between the type permit and the computing capacity, and the computing capacity of the target node is represented through the type permit authorized to be possessed by the target node. When the nodes are subjected to task allocation, the computing capacity of the nodes can be determined intuitively according to the type evidence authorized and possessed by the nodes, so that the task allocation can be performed according to the computing capacity of the nodes, and the problem that in the prior art, the nodes meeting the computing capacity requirement corresponding to the tasks need to be determined in a node computing capacity competition mode, and the task allocation efficiency is low is solved.
Example 5
The embodiment of the application provides a node marking device, which is used for solving the problem that when a task is performed in a block chain network according to the prior art, whether the computing capacity of a node meets the task requirement cannot be judged visually, so that the task distribution efficiency is low. The specific structural diagram of the device is shown in fig. 6, and the device comprises: a node information acquisition unit 61 and a certification authority unit 62.
The node information acquiring unit 61 is configured to acquire node information representing computing capability of a target node in a block chain network;
a pass-certificate authorizing unit 62, configured to authorize the target node to have a type pass-certificate corresponding to the computing capability according to the node information and a preset corresponding relationship between the type pass-certificate and the computing capability; and the type permit authorized to be provided by the target node is used as a basis for distributing the calculation task for the target node.
In one embodiment, the certification authority unit 62 is specifically configured to: sending a type evidence collection to the target node; the type pass set is composed of at least one type pass; and authorizing the target node to have the type permit corresponding to the computing capability of the target node in the type permit set according to the node information and the preset corresponding relation between the type permit and the computing capability.
By adopting the node marking device provided by the embodiment of the application, before task allocation is carried out, the node information representing the computing capacity of a target node in a block chain network can be obtained, a type permit set formed by at least one type permit is sent to the target node, further, the computing capacity of the target node can be determined according to the pre-obtained node information representing the computing capacity, the target node is authorized to have the type permit corresponding to the computing capacity of the target node in the type permit set according to the preset corresponding relation between the type permit and the computing capacity, and the computing capacity of the target node is represented through the type permit authorized to be possessed by the target node. When the nodes are subjected to task allocation, the computing capacity of the nodes can be determined intuitively according to the type evidence authorized and possessed by the nodes, so that the task allocation can be performed according to the computing capacity of the nodes, and the problem that in the prior art, the nodes meeting the computing capacity requirement corresponding to the tasks need to be determined in a node computing capacity competition mode, and the task allocation efficiency is low is solved.
Example 6
The embodiment of the application provides a node marking device, which is used for solving the problem that when a task is performed in a block chain network according to the prior art, whether the computing capacity of a node meets the task requirement cannot be judged visually, so that the task distribution efficiency is low. The specific structural diagram of the device is shown in fig. 7, and the device comprises: a credential set receiving unit 71, an instruction receiving unit 72, and a modification unit 73.
Wherein, the passport collection receiving unit 71 is configured to receive a type passport collection; the type pass set is composed of at least one type pass;
an instruction receiving unit 72, configured to receive a type certification authorization instruction; the type certification passing authorization instruction carries type certification passing information corresponding to the computing capacity;
and a modifying unit 73, configured to modify, according to type certification information corresponding to the computing capability and carried in the type certification authorization instruction, an initial value of a specific field in the type certification corresponding to the type certification authorization instruction in the type set to a predetermined value.
By adopting the node marking device provided by the embodiment of the application, before task allocation is carried out, the node information representing the computing capacity of a target node in a block chain network can be obtained, a type permit set formed by at least one type permit is sent to the target node, further, the computing capacity of the target node can be determined according to the pre-obtained node information representing the computing capacity, the target node is authorized to have the type permit corresponding to the computing capacity of the target node in the type permit set according to the preset corresponding relation between the type permit and the computing capacity, and the computing capacity of the target node is represented through the type permit authorized to be possessed by the target node. When the nodes are subjected to task allocation, the computing capacity of the nodes can be determined intuitively according to the type evidence authorized and possessed by the nodes, so that the task allocation can be performed according to the computing capacity of the nodes, and the problem that in the prior art, the nodes meeting the computing capacity requirement corresponding to the tasks need to be determined in a node computing capacity competition mode, and the task allocation efficiency is low is solved.
Example 7
The task allocation device provided by the embodiment of the application is used for solving the problem that when a task is performed in a block chain network according to the prior art, whether the computing capacity of a node meets the task requirement cannot be judged visually, so that the task allocation efficiency is low. The specific structural diagram of the device is shown in fig. 8, and the device comprises: a computing power determining unit 81, a type certification determining unit 82, and a task assigning unit 83.
The computing capacity determining unit 81 is configured to determine a node computing capacity required by a computing task to be allocated;
a type certification confirming unit 82, configured to confirm a type certification corresponding to the determined node computing capability according to a preset corresponding relationship between the type certification and the computing capability and the determined node computing capability;
and the task allocation unit 83 is configured to select a node with the type permit from the blockchain network according to the determined type permit to perform allocation of the computation task.
In one embodiment, the authorization revocation unit 72 is specifically configured to: and sending a revocation instruction carrying the type permit information to the target node, so that the target node responds to the revocation instruction and modifies a preset value of a specific field in the type permit corresponding to the revocation instruction in the type set into an initial value.
By adopting the task allocation device provided by the embodiment of the application, before task allocation is performed, node information representing the computing capacity of a target node in a block chain network can be obtained, a type permit set formed by at least one type permit is sent to the target node, further, the computing capacity of the target node can be determined according to the pre-obtained node information representing the computing capacity, the target node is authorized to have the type permit corresponding to the computing capacity of the target node in the type permit set according to the preset corresponding relation between the type permit and the computing capacity, and the computing capacity of the target node is represented through the type permit authorized to be possessed by the target node. When the nodes are subjected to task allocation, the computing capacity of the nodes can be determined intuitively according to the type evidence authorized and possessed by the nodes, so that the task allocation can be performed according to the computing capacity of the nodes, and the problem that in the prior art, the nodes meeting the computing capacity requirement corresponding to the tasks need to be determined in a node computing capacity competition mode, and the task allocation efficiency is low is solved.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be 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 diagram block or blocks.
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 diagram block or blocks.
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 diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (12)
1. A node marking method, comprising:
acquiring node information representing the computing capacity of a target node in a block chain network;
sending a type evidence collection to the target node; the type pass set is composed of at least one type pass; the certification issuing node combines the ID of the block chain node and the ID of a certain type of certification to be issued, and obtains Token distributed for the block chain link point through a one-way encryption hash algorithm by using a public key, and the Token is used as the type certification issued by the block chain link point;
authorizing the target node to have the type permit corresponding to the computing capability of the target node in the type permit set according to the node information and the preset corresponding relation between the type permit and the computing capability; the type permit authorized by the target node is used as a basis for distributing the calculation task to the target node; wherein, a specific field in Token as type pass is used to indicate whether the Token is authorized by a pass issuing node, and the assignment of the specific field in Token is used to indicate whether the type pass is authorized;
a node in a block chain network receives a type evidence collection;
receiving a type pass-certificate authorization instruction; the type certification passing authorization instruction carries type certification passing information corresponding to the computing capacity;
and according to type pass information which is carried in the type pass authorization instruction and corresponds to the computing capacity, modifying the initial value of a specific field in the type pass corresponding to the type pass authorization instruction in the type pass set into a preset value.
2. The method according to claim 1, wherein authorizing the target node to have the type permit corresponding to the computing capability of the target node in the type permit set according to the node information and a preset corresponding relationship between the type permit and the computing capability specifically includes:
and sending a type certification authorization instruction carrying type certification information corresponding to the computing capacity to the target node, so that the target node responds to the type certification authorization instruction and modifies the initial value of a specific field in the type certification corresponding to the computing capacity in the type certification set to a preset value.
3. The method of claim 1, wherein the set of type passes comprises at least one of the following types of passes:
a block node corresponding to the first computing capacity is certified;
the verification node corresponding to the second computing capacity is certified;
a registered node corresponding to the third computing power is certified;
wherein the first computing capacity is greater than the second computing capacity and the third computing capacity.
4. A label revocation method based on the node label method according to any one of claims 1 to 3, comprising:
determining type evidence possessed by the target node;
and sending a revocation instruction carrying the type pass information to the target node according to the determined type pass, and revoking the authorization of the type pass corresponding to the revocation instruction in the type pass set.
5. The method according to claim 4, wherein sending a revoke instruction carrying the type credential information to the target node, revoking authorization of the type credential corresponding to the revoke instruction in the type credential set specifically includes:
and sending a revocation instruction carrying the type permit information to the target node, so that the target node responds to the revocation instruction and modifies a preset value of a specific field in the type permit corresponding to the revocation instruction in the type permit set into an initial value.
6. A task allocation method based on the node marking method according to any one of claims 1 to 3, comprising:
determining the node computing capacity required by the computing task to be distributed;
determining a type permit corresponding to the determined node computing capability according to a preset corresponding relation between the type permit and the computing capability and the determined node computing capability;
and selecting the nodes with the type permit from the block chain network to distribute the computing task according to the determined type permit.
7. A node marking apparatus, comprising:
the information acquisition unit is used for acquiring node information representing the calculation capacity of a target node in the block chain network;
the evidence obtaining unit is used for obtaining a type evidence obtaining set of the target node; the type pass set is composed of at least one type pass; the certification issuing node combines the ID of the block chain node and the ID of a certain type of certification to be issued, and obtains Token distributed for the block chain link point through a one-way encryption hash algorithm by using a public key, and the Token is used as the type certification issued by the block chain link point;
the authorization unit is used for authorizing the target node to have the type permit corresponding to the computing capability of the target node in the type permit set according to the node information and the preset corresponding relation between the type permit and the computing capability; the type permit authorized by the target node is used as a basis for distributing the calculation task to the target node; wherein, a specific field in Token as type pass is used to indicate whether the Token is authorized by a pass issuing node, and the assignment of the specific field in Token is used to indicate whether the type pass is authorized;
the system comprises a receiving unit of the evidence collection, a receiving unit of the type evidence collection and a processing unit of the type evidence collection; the type pass set is composed of at least one type pass;
the instruction receiving unit is used for receiving the type certification authorization instruction; the type certification passing authorization instruction carries type certification passing information corresponding to the computing capacity;
and the modification unit is used for modifying the initial value of the specific field in the type permit corresponding to the type permit authorization instruction in the type permit set into a preset value according to the type permit information corresponding to the computing capacity and carried in the type permit authorization instruction.
8. The apparatus according to claim 7, wherein the authorization unit is specifically configured to:
and sending a type certification authorization instruction carrying type certification information corresponding to the computing capacity to the target node, so that the target node responds to the type certification authorization instruction and modifies the initial value of a specific field in the type certification corresponding to the computing capacity in the type certification set to a preset value.
9. The apparatus of claim 7, wherein the set of type passes comprises at least one of the following type passes:
a block node corresponding to the first computing capacity is certified;
the verification node corresponding to the second computing capacity is certified;
a registered node corresponding to the third computing power is certified;
wherein the first computing capacity is greater than the second computing capacity and the third computing capacity.
10. A node marking apparatus as claimed in any one of claims 7 to 9, wherein the apparatus comprises:
the evidence obtaining determining unit is used for determining type evidence obtained by the target node;
and the authorization canceling unit is used for sending a canceling instruction carrying the type permit information to the target node according to the determined type permit, and canceling the authorization of the type permit corresponding to the canceling instruction in the type permit set.
11. The apparatus according to claim 10, wherein the authorization revocation unit is specifically configured to:
and sending a revocation instruction carrying the type permit information to the target node, so that the target node responds to the revocation instruction and modifies a preset value of a specific field in the type permit corresponding to the revocation instruction in the type permit set into an initial value.
12. A task assigning device based on the node marking device according to any one of claims 7 to 9, comprising:
the computing capacity determining unit is used for determining the computing capacity of the nodes required by the computing tasks to be distributed;
the type certification confirming unit is used for confirming the type certification corresponding to the confirmed node calculating capacity according to the preset corresponding relation between the type certification and the calculating capacity and the confirmed node calculating capacity;
and the task allocation unit is used for selecting a node with the type permit from the block chain network to allocate the computing task according to the determined type permit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910144643.6A CN109981586B (en) | 2019-02-27 | 2019-02-27 | Node marking method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910144643.6A CN109981586B (en) | 2019-02-27 | 2019-02-27 | Node marking method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109981586A CN109981586A (en) | 2019-07-05 |
| CN109981586B true CN109981586B (en) | 2021-09-07 |
Family
ID=67077411
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910144643.6A Active CN109981586B (en) | 2019-02-27 | 2019-02-27 | Node marking method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109981586B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110489488B (en) * | 2019-08-21 | 2021-06-15 | 腾讯科技（深圳）有限公司 | Data processing method and device |
| CN111078797B (en) * | 2019-12-26 | 2022-12-13 | 卓尔智联(武汉)研究院有限公司 | Method and device for distributing certificates, computer equipment and storage medium |
| CN112351026B (en) * | 2020-11-03 | 2022-04-22 | 平安科技（深圳）有限公司 | Block chain network node authority distribution method and device, computer equipment and medium |
| CN117692151B (en) * | 2024-02-02 | 2024-05-31 | 杭州天谷信息科技有限公司 | Service network-based certificate revocation method and communication method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108122165A (en) * | 2017-12-15 | 2018-06-05 | 北京中电普华信息技术有限公司 | A kind of block chain common recognition method and system |
| CN108459829A (en) * | 2018-04-12 | 2018-08-28 | 厦门集微科技有限公司 | A kind of date storage method, device and computer storage media |
| CN108616596A (en) * | 2018-05-09 | 2018-10-02 | 南京邮电大学 | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive |
| CN108881459A (en) * | 2018-07-02 | 2018-11-23 | 甘肃山呼信息技术有限公司 | A kind of public block catenary system of Highly Scalable towards practical application |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070154016A1 (en) * | 2006-01-05 | 2007-07-05 | Nakhjiri Madjid F | Token-based distributed generation of security keying material |
| US9697534B2 (en) * | 2013-06-19 | 2017-07-04 | Google Inc. | Attribution marketing recommendations |
| CN108696356B (en) * | 2017-04-05 | 2020-08-18 | ***通信有限公司研究院 | Block chain-based digital certificate deleting method, device and system |
-
2019
- 2019-02-27 CN CN201910144643.6A patent/CN109981586B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108122165A (en) * | 2017-12-15 | 2018-06-05 | 北京中电普华信息技术有限公司 | A kind of block chain common recognition method and system |
| CN108459829A (en) * | 2018-04-12 | 2018-08-28 | 厦门集微科技有限公司 | A kind of date storage method, device and computer storage media |
| CN108616596A (en) * | 2018-05-09 | 2018-10-02 | 南京邮电大学 | It is adaptively known together method based on the block chain that dynamic authorization and network environment perceive |
| CN108881459A (en) * | 2018-07-02 | 2018-11-23 | 甘肃山呼信息技术有限公司 | A kind of public block catenary system of Highly Scalable towards practical application |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109981586A (en) | 2019-07-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109327528B (en) | Node management method and device based on block chain | |
| CN109981586B (en) | Node marking method and device | |
| US11799637B2 (en) | Methods and systems for blockchain-implemented event-lock encryption | |
| CN110046996B (en) | Data processing method and device | |
| CN109584066B (en) | Privacy transaction based on block chain and application method and device thereof | |
| CN107770115B (en) | Method and system for distributing digital content in a peer-to-peer network | |
| CN110800250B (en) | Controlled release of encrypted private keys | |
| WO2020080145A1 (en) | Content contract system, content contract method, rights holder terminal, alienee terminal, content accumulation server, rights holder program, alienee program, control program, and content accumulation program | |
| CN108924130B (en) | Block data verification method, device, equipment and storage medium | |
| WO2018158936A1 (en) | Block chain management device, block chain management method and program | |
| EP3454238A1 (en) | Registration and authorization method, device and system | |
| CN109614813B (en) | Privacy transaction method and device based on block chain and application method and device thereof | |
| KR20180112027A (en) | Copyright management method and system | |
| KR20180115779A (en) | How to Implement a Block Chain for Controlling and Distributing Digital Content | |
| CN113256297B (en) | Data processing method, device and equipment based on block chain and readable storage medium | |
| CN113656780B (en) | Cross-chain access control method and device | |
| CN114240433A (en) | Data processing method and system based on block chain | |
| CN115796871A (en) | Resource data processing method and device based on block chain and server | |
| CN110990790A (en) | Data processing method and equipment | |
| CN110910110A (en) | Data processing method and device and computer storage medium | |
| CN113869901B (en) | Key generation method, key generation device, computer-readable storage medium and computer equipment | |
| CN114900334A (en) | NFT authority control method, system, computer readable storage medium and terminal device | |
| CN115314491B (en) | Directory service method and system for directory server cluster based on distributed structure | |
| CN117061089B (en) | Voting management method, device, equipment and storage medium | |
| CN110544167B (en) | Data processing method, server and storage medium of alliance chain based on CPK |
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 | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Liu Tao Inventor before: Zhu Zhenlong Inventor before: Zou Jie Inventor before: Liu Jian Inventor before: Liu Tao |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |