CN111082990B - Block chain consensus method, device, equipment and storage medium - Google Patents
Block chain consensus method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN111082990B CN111082990B CN201911316800.3A CN201911316800A CN111082990B CN 111082990 B CN111082990 B CN 111082990B CN 201911316800 A CN201911316800 A CN 201911316800A CN 111082990 B CN111082990 B CN 111082990B
- Authority
- CN
- China
- Prior art keywords
- node
- election
- block
- target
- period
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- 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
- 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
Abstract
According to the block chain consensus method, the device, the equipment and the storage medium, any one election node votes for the block-out period, the number of votes invested in the block-out period is compared with other election nodes, the election node with the number of votes invested in the target block-out period meeting the preset conditions is used as the block-out node of the target block-out period, and therefore the voting is used for determining the block node.
Description
Technical Field
The present application relates to the field of electronic information, and in particular, to a block chain consensus method, apparatus, device, and storage medium.
Background
The blockchain is a distributed system, and as there is no central authority, the distributed nodes need to agree on whether the transaction is valid or not by means of a consensus algorithm, ensuring that all nodes comply with the rules of the agreement and ensuring that all transactions are performed in a reliable manner. Therefore, the consensus algorithm is the basis for all blockchains, which is used to maintain the integrity and security of the distributed system and constitutes the most important part of the blockchain platform. Proof of work volume (PoW) is the first cryptographic currency consensus algorithm to be created.
However, the existing consensus algorithm including the PoW algorithm needs higher computational power resources and a better network environment, and therefore, the resources consumed by the consensus algorithm are increasing along with the factors such as the increase of the number of nodes in the block chain and the extension of the block chain.
Disclosure of Invention
The application provides a block chain consensus method, a block chain consensus device, block chain consensus equipment and a block chain storage medium, and aims to solve the problem that resources consumed by a consensus algorithm are more.
In order to achieve the above object, the present application provides the following technical solutions:
a method for block chain consensus, comprising:
voting for a block output period by a target election node, wherein the number of votes invested by the target election node is not more than the total number of votes distributed to the target election node in the current voting period; the target election node is any one node in the election nodes;
and the target election node selects the block outlet node in the block outlet period from the election nodes by comparing the votes invested by the election nodes in the block outlet period.
Optionally, the total number of votes allocated to the target election node in the current voting period is determined according to the online duration and/or the contribution degree of the target election node.
Optionally, the process of comparing, by the target election node, the number of votes invested by any one of the election nodes in any one of the target block-out periods includes:
the target election node obtains a first ciphertext and a second ciphertext, the first ciphertext is obtained by using the ticket number and the random number which are input by the target election node in a target block output period to perform operation and encryption, and the second ciphertext is obtained by using the ticket number and the random number which are input by the first election node in the target block output period to perform operation and encryption; the first election node is any one of the election nodes; the target block output period is any one of the block output periods;
and the target election node compares a first numerical value and a second numerical value to obtain a comparison result, wherein the first numerical value is obtained by decrypting the first ciphertext, and the second numerical value is obtained by decrypting the second ciphertext.
Optionally, the target election node is an initiating node, the initiating node is a first node in an election node sequence, and the election node sequence is obtained by sequencing the election nodes according to the time of adding a block chain network into the election nodes;
the step of comparing the votes input by the election nodes in the block output period by the target election nodes comprises the following steps:
and the target election node generates a winning node through comparison with a second election node in the election node sequence, and triggers a comparison process, wherein in the comparison process, the winning node participating in comparison in each round is compared with the election node which does not participate in comparison in the election node sequence and is ranked most front, and a winning node participating in comparison in the next round is generated until all the election nodes participate in comparison.
Optionally, the determining, by the target election node, the block output node in the block output period by comparing the votes invested by the election nodes in the block output period includes:
and the target election nodes trigger a flow of comparing votes input by the election nodes in the block output period in the first block output period in the current voting period, and determine the block output nodes in each block output period.
Optionally, at least one of the following is also included:
if the number of the produced blocks in the current voting period is less than the preset number, the target election node re-determines the block outlet node of the current voting period;
and if the block output node of the target block output period does not output a block in the target block output period, the target election node prohibits the block output node from electing the block output node within a preset time length.
Optionally, the method further includes:
and the target election node acquires the time length of the voting period and the time length of the block outlet period released by the creation block.
An apparatus for block chain consensus, comprising:
the voting unit is used for voting in a block output period, and the number of votes invested by the target election nodes is not more than the total number of votes distributed to the target election nodes in the current voting period; the target election node is any one node in the election nodes;
and the block outlet node determining unit is used for selecting the block outlet node in the block outlet period from the election nodes by comparing the votes put into the election nodes in the block outlet period.
A consensus device for blockchains, comprising: a memory and a processor;
the memory is used for storing programs;
the processor is configured to execute the program to implement the steps of the block chain consensus method.
A storage medium having stored thereon a computer program which, when executed by a processor, carries out the steps of the block chain consensus method as described above.
According to the block chain consensus method, the device, the equipment and the storage medium, any one election node votes a block-out period, the number of votes put into the block-out period is compared with other election nodes, and the election node with the number of votes put into the target block-out period meeting the preset conditions is used as a block-out node of a target mark-out block period.
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 a flowchart of a block chain consensus method according to an embodiment of the present disclosure;
FIG. 2 is a flowchart illustrating a method for comparing votes between any two election nodes according to an embodiment of the present disclosure;
fig. 3 is a flowchart of another block chain consensus method disclosed in the embodiments of the present application;
fig. 4 is a schematic structural diagram of a block chain consensus device according to an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of a block chain consensus device according to an embodiment of the present disclosure.
Detailed Description
Generally, in the process of selecting a block node in an election manner, any node in a block chain may participate in competition, and any node in the block chain may participate in a consensus process of determining the block node. In the following flow, any node participating in the consensus process of determining a block node is taken as an execution subject, and a description is given.
The technical solutions in the embodiments of the present application will be described clearly and completely with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only some embodiments of the present application, and not all 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.
Fig. 1 is a block chain consensus method disclosed in an embodiment of the present application, including the following steps:
s101: and voting the block-out period by the target election node.
The target election node is any one of the election nodes. And the election nodes are nodes participating in block node competition.
The out-of-block period is contained in the voting period. In this embodiment, the voting period and the block output period are divided in advance according to the block output flow, and the number n of the block output periods and the time t of one block output period included in one voting period may be configured as needed. The node may check each out-of-block period based on the local time and the NTP service time. Optionally, the time length of the voting period and the time length of the block output period may be released to all nodes by the creation block, that is, the target election node obtains the time length of the voting period and the time length of the block output period of the creation block release.
It is possible to allocate the same number of votes to each node in advance in the current voting period.
Alternatively, in order to promote the building of each node on the block chain, the number of votes allocated to each node in the current voting period may be determined according to the online time and/or contribution degree of the node. Specifically, for any node, the longer the online time is, the more votes are allocated, the greater the contribution is, and the more votes are allocated. For a specific allocation algorithm, reference may be made to the prior art, and details are not described here.
The target election node can vote for any block-out period, and the number of votes invested in any block-out period is not more than the total number of votes distributed to the target election node in the current voting period. The number of votes invested in all the block-out periods is not more than the total number of votes distributed to the target election nodes in the current voting period.
S102: and selecting the block outlet node in the block outlet period from the election nodes by the target election nodes through comparing the votes put into the election nodes in the block outlet period.
In the embodiment of the present application, any one of the voting period is referred to as a target voting period. Optionally, the election node with the largest voting number in the target block output period may be used as the block output node of the target block output period, or the election node n bits before the voting number ranking in the target block output period may be used as the block output node of the target block output period, where n is an integer greater than or equal to 1.
As can be seen from the flow shown in fig. 1, the block chain consensus method described in this embodiment determines the block nodes by using a voting method, and compared with other existing consensus methods (such as workload certification), the number of votes only needs to be simply counted and compared, and no complex calculation is needed, so that less resources are occupied. And the definition of the number of votes in the block-out period ensures the accuracy and the fairness of consensus.
Further, in order to ensure the privacy of the election nodes, a secure multiparty computing technology may be adopted to implement the comparison of votes, and the process of comparing votes between any two election nodes is shown in fig. 2, and includes the following steps:
s201: and the target election node acquires the first ciphertext and the second ciphertext.
And the first ciphertext is obtained by using the vote number and the random number input by the target election node in the target block output period to perform operation and encryption. The second ciphertext is obtained by using the ticket number and the random number input by the first election node (namely any one other election node except the target election node) in the target block output period to perform operation and encryption.
Assuming that the number of votes put into the target election node in the target block-out period is a, the number of votes put into the first election node in the target block-out period is b, and the specific process of generating the first ciphertext and the second ciphertext is as follows:
a1: the first election node generates two random positive integers x and y, but is not disclosed.
In order to ensure that the number of votes will not be decrypted by the ciphertext, optionally, the random number may be selected to be a value that is larger than the possible number of votes.
A2: the target election node generates a pair of asymmetric keys, the voting number a of the target election node is encrypted by using a public key to obtain E (a), and the E (a) and the public key are published together.
A3: after the first election node obtains the data published by the target election node, the E (bx + y) is firstly calculated by using the public key of the target election node, and then the E (ax + y) = E (a) is calculated by using the homomorphic attribute of the Paillier algorithm * E (y) and both results are also published.
Of course, the execution bodies of the above steps may be interchanged, and are not limited herein, for example, the random number is generated by the target election node, the asymmetric key is generated by the first election node, and the vote number b of the first election node is encrypted, etc.
S202: and after the target election node obtains the data published by the first election node, decrypting the data to obtain a first numerical value and a second numerical value.
In the above example, the target election node uses the private key in the asymmetric key to solve the first value a = ax + y and the second value B = bx + y respectively.
S203: and comparing the sizes of A = ax + y and B = bx + y of the target election node to obtain a comparison result.
It can be seen that the target election node has no knowledge about x, y and B, but the comparison result of the number of votes can be obtained by comparing the sizes of a and B. Therefore, the safety is high.
It should be noted that the first election node may also obtain the first ciphertext and the second ciphertext, decrypt the first ciphertext and the second ciphertext to obtain the first value and the second value, and obtain the comparison result by comparing the first value and the second value.
Optionally, the node that obtains the first ciphertext and the second ciphertext may store both the first ciphertext and the second ciphertext in the block chain, so as to prevent cheating in the voting process.
The method for comparing the votes shown in fig. 2 does not need to disclose the votes of the election nodes, so that the leakage of the privacy information of the election nodes can be avoided.
Fig. 3 is a block chain consensus method according to another embodiment of the present disclosure, wherein the execution sequence of the steps is described in detail in this embodiment.
Fig. 3 includes the following steps:
s301: and the target election node acquires the identification of the election node.
The identification of each election node is positively correlated with the time for the election node to join the block chain, namely, the earlier the joining time is, the smaller the identification is.
In this embodiment, it is assumed that the target election node is the node with the smallest identifier. Identifying the smallest node as the originator of the vote performs the following steps:
s302: and triggering a flow of comparing the votes input by all the election nodes in each block output period by the target election node in the first block output period of the current voting period, and determining the block output nodes in each block output period.
Specifically, the target election node compares the votes of the target election node and the second election node in the first block outlet period to obtain a node with a larger number of votes, and the node is used as a reference node. And the second election node is a node which is next to the target node in the node sequence. The node sequence is obtained by sequencing all the election nodes from small to large according to the identification.
The step of obtaining the reference node may be regarded as a triggering step of a process of comparing the votes put into all the election nodes in each block output period.
After the reference node is obtained, the second election node is located at the next node (referred to as the current node for short) in the node sequence, and the node with more votes is obtained by comparing the votes of the reference node and the current node in the first block-out period and is used as the reference node.
And repeating the steps until all the election nodes are compared according to the sequence in the node sequence to obtain the block output node in the first block output period. For example, the election node with the largest number of votes may be used as the block output node.
And repeating the steps until the block output nodes in all the block output periods in the current election period are obtained.
As can be seen from the flow shown in fig. 3, the election node completes election of the block output node in each block output period in the first block output period of the current voting period, so that the block output continuity can be ensured with a relatively small algorithm cost (i.e., without a complex algorithm). And the voting nodes compare voting results according to the sequence and the rule, so that the comparison efficiency can be improved.
It should be noted that, in fig. 3, the election node sequences are obtained by sorting according to the order from small to large of the identifiers, and optionally, the election node sequences may also be obtained by sorting according to the order from large to small of the identifiers, which is not limited here. Whichever sorting method is used, in this embodiment, the first node in the election node sequence is taken as the initiating node. Optionally, the identifier may be inversely related to a time for joining the blockchain, and this embodiment is also not limited.
Further, after the block output nodes are determined, all the block output nodes output blocks in the corresponding block output period.
The target election node may further perform the following steps:
s303: and if the number of the blocks produced in the voting period is less than the preset number, the target election node re-determines the block outlet node of the current voting period.
S304: and if the block output node of the target block output period does not output a block in the target block output period, the target election node prohibits the block output node from electing the block node within a preset time length.
The preset duration may be a preset number of voting periods.
S305: and if the block provided by the block output node does not meet the preset condition, the target election node sends an illegal prompt.
Wherein the preset conditions include: the input of a block is the output of other blocks, and the output of a block is the input of other blocks.
S303-S305, can guarantee that the node of competing and choosing is to the legitimacy and the legitimacy of the node reach the consensus, help to improve the security of the block chain.
Fig. 4 is a block chain consensus apparatus according to an embodiment of the present disclosure, including:
the voting unit 401 is configured to vote for a block output period, where the number of votes invested by the target election node is not greater than the total number of votes allocated to the target election node in the current voting period; the target election node is any one node in the election nodes;
a block output node determining unit 402, configured to determine a block output node in the block output period by comparing votes input by the election nodes in the block output period.
Optionally, the total number of votes allocated to the target election node in the current voting period is determined according to the online duration and/or the contribution degree of the target election node.
Optionally, the block output node determining unit is configured to compare votes invested by any one of the other election nodes in any one block output period, and includes: the block outlet node determining unit is specifically configured to:
acquiring a first ciphertext and a second ciphertext, wherein the first ciphertext is obtained by using the ticket number and the random number input by the target election node in the target block output period to perform operation and encryption, and the second ciphertext is obtained by using the ticket number and the random number input by the first election node in the target block output period to perform operation and encryption; the first election node is any one of the election nodes; the target block output period is any one of the block output periods;
and comparing a first numerical value with a second numerical value to obtain a comparison result, wherein the first numerical value is a numerical value obtained by decrypting the first ciphertext, and the second numerical value is a numerical value obtained by decrypting the second ciphertext.
Optionally, the target election node is an initiating node, the initiating node is a first node in an election node sequence, and the election node sequence is obtained by sequencing the election nodes according to the time of adding a block chain network into the election nodes;
the step of comparing the votes invested by the election nodes in the block-out period by the block-out node determination unit comprises the following steps: and generating a winning node through comparison with a second election node in the election node sequence, and triggering a comparison process, wherein in the comparison process, the winning node participating in comparison in each round is compared with the election node which does not participate in comparison in the election node sequence and is ranked most front to generate a winning node participating in comparison in the next round until all the election nodes participate in comparison.
Optionally, the block output node determining unit is configured to determine the block output node in the block output period by comparing votes invested by the election nodes in the block output period, and includes:
the block output node determining unit is specifically configured to, in a first block output period in the current voting period, trigger a process of comparing the number of votes put into the block output period by the election node, and determine the block output node of each block output period.
Optionally, the apparatus further comprises at least one of:
the updating unit is used for re-determining the block outlet node of the current voting period when the number of the blocks produced in the current voting period is smaller than the preset number;
and the forbidding unit is used for forbidding the block node to race out the block node within the preset time length when the block node of the target block-out period does not play the block in the target block-out period.
Optionally, the apparatus further comprises:
and the time length obtaining unit is used for obtaining the time length of the voting period and the time length of the block generating period issued by the creating block.
The block chain consensus device can reduce the occupation and consumption of resources by consensus.
The embodiment of the present application further discloses a consensus device of a block chain, please refer to fig. 5, which shows a schematic structural diagram of the consensus device of the block chain, and the consensus device may include: at least one processor 501, at least one communication interface 502, at least one memory 503, and at least one communication bus 504;
in this embodiment, the number of the processor 501, the communication interface 502, the memory 503 and the communication bus 504 is at least one, and the processor 501, the communication interface 502 and the memory 503 complete communication with each other through the communication bus 504;
the processor 501 may be a central processing unit CPU, or an Application Specific Integrated Circuit ASIC (Application Specific Integrated Circuit), or one or more Integrated circuits configured to implement embodiments of the present invention, etc.;
the memory 503 may include a high-speed RAM memory, and may further include a non-volatile memory (non-volatile memory) or the like, such as at least one disk memory;
wherein the memory stores a program and the processor can call the program stored in the memory, the program for: the consensus method of the block chains is realized.
The functions described in the method of the embodiment of the present application, if implemented in the form of software functional units and sold or used as independent products, may be stored in a storage medium readable by a computing device. Based on such understanding, part of the contribution to the prior art of the embodiments of the present application or part of the technical solution may be embodied in the form of a software product stored in a storage medium and including several instructions for causing a computing device (which may be a personal computer, a server, a mobile computing device or a network device) to execute all or part of the steps of the method described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a portable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, an optical disk, or other various media capable of storing program codes.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method for block chain consensus, comprising:
the target election node votes for any block-out period, and the number of votes invested by the target election node is not more than the total number of votes distributed to the target election node in the current voting period; the target election node is any one node in the election nodes;
and the target election node selects the block outlet node in the block outlet period from the election nodes by comparing the votes invested by the election nodes in any one block outlet period.
2. The method according to claim 1, wherein the total number of votes allocated to the target election node by the current voting period is determined according to the online time and/or contribution degree of the target election node.
3. The method of claim 1, wherein the comparing of the votes invested by the target election node in any one block-out period by the election node comprises:
the target election node obtains a first ciphertext and a second ciphertext, the first ciphertext is obtained by using the ticket number and the random number which are input by the target election node in a target block output period to perform operation and encryption, and the second ciphertext is obtained by using the ticket number and the random number which are input by the first election node in the target block output period to perform operation and encryption; the first election node is any one of the election nodes; the target block output period is any one of the block output periods; the election node is any one election node;
and the target election node compares a first numerical value and a second numerical value to obtain a comparison result, wherein the first numerical value is obtained by decrypting the first ciphertext, and the second numerical value is obtained by decrypting the second ciphertext.
4. The method according to claim 1, wherein the target election node is an initiating node, the initiating node is a first node in an election node sequence, and the election node sequence is obtained by sequencing the election nodes according to the time of adding a block chain network into the election nodes;
the step of comparing the votes invested by the election nodes in the block-out period by the target election nodes comprises the following steps:
and the target election node generates a winning node through comparison with a second election node in the election node sequence, and triggers a comparison process, wherein in the comparison process, the winning node participating in comparison in each round is compared with the election node which does not participate in comparison in the election node sequence and is ranked most front, and a winning node participating in comparison in the next round is generated until all the election nodes participate in comparison.
5. The method of claim 1, wherein the target election node determines the out-of-block node in the out-of-block period by comparing votes invested by the election nodes in the out-of-block period, and the method comprises:
and the target election nodes trigger a flow of comparing votes input by the election nodes in the block output period in the first block output period in the current voting period, and determine the block output nodes in each block output period.
6. The method of claim 1, further comprising at least one of:
if the number of the produced blocks in the current voting period is less than the preset number, the target election node re-determines the block outlet node of the current voting period;
and if the block output node of the target block output period does not output a block in the target block output period, the target election node prohibits the block output node from electing the block output node within a preset time length.
7. The method of claim 1, further comprising:
and the target election node acquires the time length of the voting period and the time length of the block outlet period issued by the creation block.
8. An apparatus for block chain consensus, comprising:
the voting unit is used for voting any block-out period, and the number of votes invested by the target election node is not more than the total number of votes distributed to the target election node in the current voting period; the target election node is any one node in the election nodes;
and the block outlet node determining unit is used for comparing the votes input by the election nodes in any one block outlet period, and selecting the block outlet node in the block outlet period from the election nodes.
9. An apparatus for block chain consensus, comprising: a memory and a processor;
the memory is used for storing programs;
the processor is configured to execute the program to implement the steps of the block chain consensus method according to any one of claims 1 to 7.
10. A storage medium having stored thereon a computer program, characterized in that the computer program, when being executed by a processor, carries out the steps of the block chain consensus method according to one of the claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911316800.3A CN111082990B (en) | 2019-12-19 | 2019-12-19 | Block chain consensus method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911316800.3A CN111082990B (en) | 2019-12-19 | 2019-12-19 | Block chain consensus method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111082990A CN111082990A (en) | 2020-04-28 |
| CN111082990B true CN111082990B (en) | 2023-01-13 |
Family
ID=70315646
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911316800.3A Active CN111082990B (en) | 2019-12-19 | 2019-12-19 | Block chain consensus method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111082990B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111612445B (en) * | 2020-05-21 | 2021-08-20 | 腾讯科技（深圳）有限公司 | Data processing method, system, device and storage medium based on block chain |
| CN112788107A (en) * | 2020-12-29 | 2021-05-11 | 长威信息科技发展股份有限公司 | Method and system for secure multi-party computing and data sharing |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107301546B (en) * | 2017-05-03 | 2020-10-16 | 北京众享比特科技有限公司 | Random number generation and application method and device |
| CN107590738A (en) * | 2017-08-24 | 2018-01-16 | 阿里巴巴集团控股有限公司 | Processing method, device and the server of selection common recognition node |
| US11488433B2 (en) * | 2018-01-11 | 2022-11-01 | Mastercard International Incorporated | Method and system for public elections on a moderated blockchain |
| KR102250810B1 (en) * | 2018-03-23 | 2021-05-11 | 블록체인랩스 주식회사 | Blockchain system with consensus algorithm based on proof-of -transaction and method there of |
| CN109714404B (en) * | 2018-12-12 | 2021-04-06 | 中国联合网络通信集团有限公司 | Block chain consensus method and device based on Raft algorithm |
| CN109743173B (en) * | 2018-12-20 | 2021-07-20 | 弗洛格（武汉）信息科技有限公司 | Block out node determining method in block chain, block verification method and block chain system |
-
2019
- 2019-12-19 CN CN201911316800.3A patent/CN111082990B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN111082990A (en) | 2020-04-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7138726B2 (en) | Blockchain consensus methods, accounting nodes and nodes | |
| CN110213059B (en) | Random number generation method, random number generation device and storage medium | |
| CN110868441B (en) | Block chain public link maintenance method and device, node and block chain public link | |
| CN109360091B (en) | Random object selection method and device based on block chain | |
| EP4053711A1 (en) | Consensus method for blockchain, and consensus node, electronic device and storage medium | |
| CN109474423A (en) | Data encryption/decryption method, server and storage medium | |
| KR20190068042A (en) | Method and apparatus for generating blocks in node on a block-chain network | |
| CN111082990B (en) | Block chain consensus method, device, equipment and storage medium | |
| CN109359978B (en) | Intelligent contract trading method and system based on block chain network | |
| EP4006742A1 (en) | Fork processing method and blockchain node | |
| CN110222537B (en) | Verification method and device applied to block chain nodes | |
| CN111698088A (en) | Key alternation method, key alternation device, electronic equipment and medium | |
| Banerjee et al. | Maximizing welfare in social networks under a utility driven influence diffusion model | |
| CN109447803B (en) | Alliance chain accounting method, equipment, alliance chain and storage medium | |
| KR20220010533A (en) | Systems and methods for mining on proof-of-work blockchain networks | |
| CN113779606A (en) | Information verification method and system for reducing privacy disclosure risk | |
| CN110225044B (en) | Verification method and device on block chain | |
| Islam et al. | A comparative analysis of proof-of-authority consensus algorithms: Aura vs Clique | |
| CN110222538B (en) | Verification method and device related to block chain | |
| CN112202765A (en) | Block chain common identification block method and device based on trusted computing and related products | |
| CN110780848A (en) | Double-random generation method and supervision system based on block chain distributed random process | |
| CN109818915B (en) | Information processing method and device, server and readable storage medium | |
| CN115396443A (en) | Time factor-based alliance chain consensus method, device, equipment and storage medium | |
| CN112751675B (en) | Information monitoring method, system, equipment and storage medium based on block chain | |
| CN110224839B (en) | Verification method and device applied to block chain |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 401121 b7-7-2, Yuxing Plaza, No.5 Huangyang Road, Yubei District, Chongqing Applicant after: Chongqing duxiaoman Youyang Technology Co.,Ltd. Address before: 201800 room j1328, 3 / F, building 8, 55 Huiyuan Road, Jiading District, Shanghai Applicant before: SHANGHAI YOUYANG NEW MEDIA INFORMATION TECHNOLOGY Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20211220 Address after: 100193 Room 606, 6 / F, building 4, West District, courtyard 10, northwest Wangdong Road, Haidian District, Beijing Applicant after: Du Xiaoman Technology (Beijing) Co.,Ltd. Address before: 401121 b7-7-2, Yuxing Plaza, No.5 Huangyang Road, Yubei District, Chongqing Applicant before: Chongqing duxiaoman Youyang Technology Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |