CN112883338A - Lottery drawing method based on random shuffling algorithm with weight and application - Google Patents
Lottery drawing method based on random shuffling algorithm with weight and application Download PDFInfo
- Publication number
- CN112883338A CN112883338A CN202110226844.8A CN202110226844A CN112883338A CN 112883338 A CN112883338 A CN 112883338A CN 202110226844 A CN202110226844 A CN 202110226844A CN 112883338 A CN112883338 A CN 112883338A
- Authority
- CN
- China
- Prior art keywords
- hash
- node
- random shuffling
- random
- list
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 57
- 230000008569 process Effects 0.000 claims abstract description 20
- 238000012795 verification Methods 0.000 claims abstract description 13
- FFBHFFJDDLITSX-UHFFFAOYSA-N benzyl N-[2-hydroxy-4-(3-oxomorpholin-4-yl)phenyl]carbamate Chemical compound OC1=C(NC(=O)OCC2=CC=CC=C2)C=CC(=C1)N1CCOCC1=O FFBHFFJDDLITSX-UHFFFAOYSA-N 0.000 claims description 3
- 238000012545 processing Methods 0.000 claims description 2
- 238000012163 sequencing technique Methods 0.000 claims description 2
- 230000006870 function Effects 0.000 description 31
- 230000007246 mechanism Effects 0.000 description 8
- 238000004364 calculation method Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000000605 extraction Methods 0.000 description 2
- 241001481828 Glyptocephalus cynoglossus Species 0.000 description 1
- 238000007792 addition Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000003111 delayed effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000013467 fragmentation Methods 0.000 description 1
- 238000006062 fragmentation reaction Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 208000011580 syndromic disease Diseases 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6209—Protecting access to data via a platform, e.g. using keys or access control rules to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Mathematical Optimization (AREA)
- Mathematical Analysis (AREA)
- Computer Hardware Design (AREA)
- General Health & Medical Sciences (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Computational Mathematics (AREA)
- Bioethics (AREA)
- Computer Security & Cryptography (AREA)
- Evolutionary Biology (AREA)
- Bioinformatics & Computational Biology (AREA)
- Operations Research (AREA)
- Probability & Statistics with Applications (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Algebra (AREA)
- Life Sciences & Earth Sciences (AREA)
- Databases & Information Systems (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Time Recorders, Dirve Recorders, Access Control (AREA)
Abstract
The invention discloses a drawing method based on weighted random shuffling algorithm and application thereof, the method comprises two parts of drawing process and verification process, the shuffling method is provided for determining block chaining block exit sequence, if the commonly identified node can not exit the block, the node arranged at the second position exits the block, and the like; and moreover, a random shuffling function with weight is adopted, so that the output priority sequence probability is ensured to be in direct proportion to the held rights and interests. The drawing method can be used for leader node election and committee node election. The invention can realize the block-out consensus in the asynchronous network, does not need multiple rounds of consensus, greatly reduces the requirement on network synchronization, can resist Sybil attack and greatly improves the safety.
Description
Technical Field
The invention relates to a lottery method, in particular to a lottery method based on a random shuffling algorithm with weights and application thereof.
Background
The blockchain is another internet revolution following big data and artificial intelligence, and integrates a plurality of technologies such as distributed computing, encryption technology and provable security. The block chain technology provides a feasible scheme for a decentralization system. One of the core steps in the blockchain is the consensus of how to determine which miner's block is received on the chain in the case where multiple miners generate blocks.
Bitcoin is the first widely used blockchain system, which employs a PoW consensus mechanism. In the PoW consensus mechanism, the power is the determining factor for the block, i.e. the fastest node, whose block is easier to uplink and receive a reward. Under the system, because only one node outbound block is received on the chain at a time, other computational power is wasted, and therefore, the PoS system is proposed and received by the block chain system.
In the PoS regime, the probability of a node out of a block is related to some resource it occupies, which may be a token it holds, an owned memory, or a storage resource. Compared with PoW, the bifurcation of PoS can not occur, a large amount of calculation is not needed, and the energy is saved.
However, in order to prevent the witch attack, PoS requires that the probability of obtaining a block by a node is proportional to the resource held by the node, and has no relation to splitting and merging of the node. In an actual system, a PoS + PoW consensus mechanism is often adopted, namely, a certain amount of calculation is still needed for a block-out node, but the calculation amount is much smaller than that of the traditional PoW system. In the PoS framework, the core problem is how to design an efficient and fair consensus algorithm.
To address the above core problems, the prior art provides an Algorand consensus mechanism, which is a lottery algorithm based on a Verifiable Random Function (VRF) and can fairly determine a winning node, thereby identifying a block node. However, the method has a certain requirement on network synchronization, that is, a network node is required to be delayed, a block output node can be kept online for a period of time, if the network cannot be synchronized, consensus fails, a viewchange (transition waiting) is entered, and a next round of consensus is waited. In addition, the traditional consensus method based on the random shuffling algorithm lacks security certification and has potential safety hazards.
Disclosure of Invention
In order to solve the defects of the technology, the invention provides a lottery method based on a random shuffling algorithm with weights and application thereof.
In order to solve the technical problems, the invention adopts the technical scheme that: a drawing method based on weighted random shuffling algorithm comprises two parts of drawing process and verification process;
the drawing process comprises the following steps:
s1: splicing character strings;
s2: the spliced character string and the private key sk of the current useriGenerating a hash value hash using a verifiable random function as an inputiAnd corresponding proof ofi；
S3: calculating a hash value of each numerical value in the specified range by using a hash function; let the specified range be 1-wi，wiThe shares held for node i, i.e. corresponding weights wi(ii) a Taking the hash value with the maximum priority as tauiThe corresponding numerical value is recorded as pii；
S4: randomly shuffling by using a random shuffling function with weight to generate a priority list;
s5: randomly permuting the default list with a weighted random shuffling function;
s6: the current user places the user at the highest priority position of the generated list to obtain the listi；
S7: broadcast hashi、proofi、τi、πi、listi；
The authentication process comprises the steps of:
s8: verifying piiWhether or not it is in the range of 1 to wiWithin the range;
s9: verification hashiWhether it is currently generated by the user;
s10: verification of tauiWhether or not to equal hashiAnd piiThe hash value after splicing;
s11: take the smallest difference T between the verified and the random number riCorresponding listiObtaining a drawing list;
s12: if the node i is on-line, i is the node which wins the drawing, otherwise listiThe node at the second position is the winning node, and the analogy is repeated, and the winning node can be obtained without multiple rounds of consensus.
Further, the splicing mode of the character string is as follows: the character strings magic and nonce are spliced into a character string m, that is, m ═ magic | nonce, wherein magic is a fixed character string and nonce is a variable character string.
Further, in S3, the hash function used is the hash function SM 3.
Further, in S3, for 1-wiEach value s in the range is calculated by using a hash function SM3, and the hash value corresponding to the value s is represented by SM3(hashi | s), namely, hashiHash value after splicing with s; tau isiThe corresponding hash value is SM3 (hash)i|πi) (ii) a And | represents splicing, i.e. splicing two data before and after | into a whole.
Further, in S5, random permutation is a process of randomly disordering the user order, and includes two steps of initialization and sorting.
Further, the initialization process is as follows: let N nodes in the network, which are respectively marked as 1, 2,. and N, initialize an array a [ M ]]Wherein, in the step (A),
for variables 1. ltoreq. i. ltoreq.N, variables 1. ltoreq. j. ltoreq.wiAnd k, k is any variable, and the following operations are carried out:
wherein, wkA weight of k;
the sequencing processing procedure comprises the following steps:
1) generating a random number r for the current value i, and exchanging the values of ai and ar;
2) the logarithmic value i is from 1 to M, the above process 1) is performed;
3) removing the repeated elements in the array a [ M ], and only keeping the first appearing element for the repeated elements;
3) the array a [ N ] finally generated is the result after random shuffling.
Further, in S9, the verifiable random function, the user' S public key and proof are usediCarry out verification。
A lottery method based on weighted random shuffling algorithm comprises the following steps: and the node with the drawing success is made to be a leader node, so that the random shuffling algorithm based on the weight is directly applied to leader election.
The drawing method based on weighted random shuffling algorithm sets the first m nodes in drawing as the winning nodes, and makes the weighted random shuffling algorithm be directly applied to committee node election, wherein the number of the committee nodes is m.
The invention discloses a lottery method based on weighted random shuffling algorithm, which optimizes the randomness of priority, can quickly realize block consensus in an asynchronous network, can quickly determine the next block-out node without multiple rounds of consensus after the current block-out node has a fault, and solves the problem that the traditional consensus method has high requirement on network synchronism; and moreover, by adopting a random shuffling function with weight, the output priority sequence can be ensured to be changed to be in direct proportion to the ownership benefit, so that Sybil attack can be resisted, and the safety is ensured.
Detailed Description
The following embodiments are further illustrative of the present invention.
First, the terms appearing herein are explained:
PoW: proof of work, Proof of computing power;
PoS: proof of Proof, warranty;
ViewChange: a mechanism after conversion waiting and consensus failure waits for the next consensus;
VRF: a random function may be verified;
l: representing splicing, namely splicing two data before and after the data I; since a character string can be represented as a number by an ASCII code, | can represent concatenation of both numbers and character strings;
hash (·): the hash function adopts SM3 function, which is the commercial hash function standard and ISO standard in China;
SM3 (): hash values calculated with SM3 function;
epoch: the stage of the current consensus;
wi: the share occupied by node i.
The invention discloses a drawing method based on a random shuffling algorithm with weights, which comprises a drawing process and a verification process; first, a value having a small difference from a specific random book is specified to have a higher priority. For example, in the priority comparison example of the numerical value A and the numerical value B, the random number r is firstly specified, if A-r | < | B-r |, the priority of B is called to be greater than A, otherwise, the priority of A is called to be greater than B;
for the drawing process, the method comprises the following steps:
s1: splicing character strings; the character string splicing is to splice the character strings magic and nonce into a character string m, namely m ═ magic | nonce, wherein magic is a fixed character string, such as a character string of "leader" in electronic election; the nonce is a variable string, such as the number of common identification rounds and the value of epoch in common identification, and may be the hash value of the last winning node in electronic election. The character string splicing mode is not unique, any character string splicing mode can be adopted theoretically, and all nodes only need to be ensured to adopt the same character string splicing mode. As in committee node elections, magic may use a "committee" string and a "block" string in block consensus.
S2: the character string m obtained by splicing and the private key sk of the current useriGenerating a hash value hash using a verifiable random function as an inputiAnd corresponding proof ofi；
The verifiable random function generates a hash value and a proof from the input and the user's private key, which hash value can be verified by other nodes in the network with the user's public key and proof.
S3: calculating a hash value of each numerical value in the specified range by using a hash function; let the specified range be 1-wi，wiThe shares held for node i, i.e. corresponding weights wi(ii) a Taking the hash value with the maximum priority as tauiThe corresponding numerical value is recorded as pii；
The method adopts a hash function SM3 for calculation; for example, taking the value s as an example, for 1-wiFor each value s in the range, the SM3 (hash) is calculated using a hash function SM3iIs), i.e. hashiHash value after splicing with s; taking the hash value with the maximum priority as tauiThe corresponding numerical value is recorded as piiThen τ isi＝SM3(hashi|πi) (ii) a Wherein, | represents splicing, i.e., splicing two data before and after | into one.
S4: randomly shuffling by using a random shuffling function with weight to generate a priority list;
s5: randomly permuting the default list with a weighted random shuffling function;
the random shuffling function is a process of randomly disordering the sequence of a user, namely random replacement, and the patent provides the random shuffling function with weight. Suppose there are N nodes in the network, denoted as 1, 2,. and N, and the share held by node i is wiI.e. corresponding weight is wi(1 ≦ i ≦ N), then the weighted random shuffling function is as follows:
the first step is as follows: initialization
Initializing array a [ M ]]Wherein, in the step (A),
for variables 1. ltoreq. i. ltoreq.N, variables 1. ltoreq. j. ltoreq.wiAnd k, k is any variable, and the following operations are carried out:
wherein, wkA weight of k;
the second step is that: sorting
1) Generating a random number r for the current value i, and exchanging the values of ai and ar;
2) the logarithmic value i is from 1 to M, the above process 1) is performed;
3) removing the repeated elements in the array a [ M ], and only keeping the first appearing element for the repeated elements;
3) the array a [ N ] finally generated is the result after random shuffling.
S6: the current user places the user at the highest priority position of the generated list to obtain the listi；
S7: broadcast hashi、proofi、τi、πi、listi；
The verification process comprises the following steps:
s8: verifying piiWhether or not it is in the range of 1 to wiWithin the range;
s9: using verifiable random functions, the user's public key and proofiVerifying the hashiWhether it is currently generated by the user;
s10: verification of tauiWhether or not to equal hashiAnd piiConcatenated hash values, i.e. verification τiWhether equal to SM3 (hash)i|πi)；
S11: take the smallest difference T between the verified and the random number riCorresponding listiObtaining a drawing list;
s12: if the node i is on-line, i is the node which wins the drawing, otherwise listiThe node at the second position is the winning node, and the analogy is repeated, and the winning node can be obtained without multiple rounds of consensus.
The drawing method based on the weighted random shuffling algorithm disclosed by the invention can be applied to leader election and committee node election.
(1) In order to improve the speed of consensus, many block chains based on PoS mechanism now use a fragmentation network, in which leader node election and committee node election are applied. And the extraction winning algorithm is a leader node, so that the extraction method can be directly applied to leader election.
(2) Committee node election is a special leader node election mechanism. In committee node elections, multiple winning nodes are elected instead of one winning node. The first m nodes in the drawing may be set as the winning nodes, and thus the drawing algorithm of the present invention may be applied to committee node elections, where the number of committee nodes is m.
In summary, the invention discloses a random shuffling algorithm based drawing method with weights, which is used for determining a block chain block outlet sequence.
Meanwhile, a random shuffling function with weight is adopted, so that the output priority sequence probability is ensured to be in direct proportion to the held rights and interests. The method specifically comprises the following steps:
the probability of each node winning is proportional to its share, which has been demonstrated by Micali et al in the A1gorand consensus mechanism, i.e., the draw algorithm based on Verifiable Random Functions (VRFs).
In the random shuffling function, the probability that the element in the array is arranged at the highest position is in direct proportion to the number of the element; the elements in the array are node numbers. Since the number of node sequence numbers appearing in the initialization is the share of the node, the probability of the node ranking at the highest bit is proportional to the share of the node. Similarly, the probability of ranking second is proportional to the share held by the remaining nodes. By analogy, we can get the syndrome.
Since the probability of node winning and the ordering of each node in the output list of the shuffling function are both proportional to the shares held by the node, it can be demonstrated that the priority order of the final output is proportional to the shares held by the node.
Compared with the prior art, the drawing method based on the weighted random shuffling algorithm has the following advantages:
(1) the method can solve the common identification problem in the asynchronous network, if the common identified node can not identify the block, the node arranged at the second position identifies the block, and so on, thereby greatly reducing the requirement on network synchronization. Meanwhile, the method does not need to know share information of the whole network, and communication expense can be reduced in a changed network. In the Algorand drawing scheme, each node needs to know the necessity of its share and the share of the whole network when executing the drawing algorithm, and in a changing network, the share of the whole network may change, which requires the share information of the communication node. In the present invention, the nodes only need to know their share, but not the share information of the whole network, so that this communication cost can be avoided.
(2) The random shuffling function with the weight can ensure that the probability of obtaining the priority is in direct proportion to the held rights and interests, so that the Sybil attack resistance can be proved, and the safety is effectively improved.
The above embodiments are not intended to limit the present invention, and the present invention is not limited to the above examples, and those skilled in the art may make variations, modifications, additions or substitutions within the technical scope of the present invention.
Claims (9)
1. A lottery method based on a random shuffling algorithm with weights is characterized in that: the method comprises two parts, namely a drawing process and a verification process;
the drawing process comprises the following steps:
s1: splicing character strings;
s2: the spliced character string and the private key sk of the current useriGenerating a hash value hash using a verifiable random function as an inputiAnd corresponding proof ofi；
S3: calculating a hash value of each numerical value in the specified range by using a hash function; let the specified range be 1-wi，wiThe shares held for node i, i.e. corresponding weights wi(ii) a Taking the hash value with the maximum priority as tauiThe corresponding numerical value is recorded as pii；
S4: randomly shuffling by using a random shuffling function with weight to generate a priority list;
s5: randomly permuting the default list with a weighted random shuffling function;
s6: the current user places the user at the highest priority position of the generated list to obtain the listi；
S7: broadcast hashi、proofi、τi、πi、listi；
The authentication process comprises the steps of:
s8: verifying piiWhether or not it is in the range of 1 to wiWithin the range;
s9: verification hashiWhether it is currently generated by the user;
s10: verification of tauiWhether or not to equal hashiAnd piiThe hash value after splicing;
s11: take the smallest difference T between the verified and the random number riCorresponding listiObtaining a drawing list;
s12: if the node i is on-line, i is the node which wins the drawing, otherwise listiThe node at the second position is the winning node, and the analogy is repeated, and the winning node can be obtained without multiple rounds of consensus.
2. The drawing method based on weighted random shuffling algorithm as claimed in claim 1, wherein: the splicing mode of the character strings is as follows: the character strings magic and nonce are spliced into a character string m, that is, m ═ magic | nonce, wherein magic is a fixed character string and nonce is a variable character string.
3. The drawing method based on weighted random shuffling algorithm as claimed in claim 2, wherein: in S3, the hash function used is the hash function SM 3.
4. The drawing method based on weighted random shuffling algorithm as claimed in claim 3, wherein: in S3, for 1-wiEach value s in the range is calculated by a hash function SM3, and the hash value corresponding to the value s is SM3 (hash)iIs) representation, i.e. hashiHash value after splicing with s; tau isiThe corresponding hash value is SM3 (hash)i|πi) (ii) a And | represents splicing, namely splicing two data before and after.
5. The method of claim 4 wherein the drawing is based on weighted random shuffling algorithm, wherein: in S5, random permutation is a process of randomly disordering the user order, and includes two steps of initialization and sorting.
6. The method of claim 5 for drawing lots based on weighted random shuffling algorithm, wherein: the initialization process comprises the following steps: let N nodes in the network, which are respectively marked as 1, 2,. and N, initialize an array a [ M ]]Wherein, in the step (A),
for variables 1. ltoreq. i. ltoreq.N, variables 1. ltoreq. j. ltoreq.wiAnd k, k is any variable, and the following operations are carried out:
wherein, wkA weight of k;
the sequencing processing process comprises the following steps:
1) generating a random number r for the current value i, and exchanging the values of ai and ar;
2) the logarithmic value i is from 1 to M, the above process 1) is performed;
3) removing the repeated elements in the array a [ M ], and only keeping the first appearing element for the repeated elements;
3) the array a [ N ] finally generated is the result after random shuffling.
7. The method of claim 6, wherein the random shuffling algorithm with weights is based on a lot of drawing lots, and the method comprises the following steps: in S9, the verifiable random function, the user' S public key and proof are usediAnd (6) carrying out verification.
8. A method of drawing a lot based on weighted random shuffling algorithm as claimed in any of claims 1-7, characterized in that: and the node with the drawing success is made to be a leader node, so that the random shuffling algorithm based on the weight is directly applied to leader election.
9. A method of drawing a lot based on weighted random shuffling algorithm as claimed in any of claims 1-7, characterized in that: the first m nodes in the drawing are set as the winning nodes, so that the random shuffling algorithm based on the weighting is directly applied to committee node election, wherein the number of the committee nodes is m.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110226844.8A CN112883338B (en) | 2021-03-01 | 2021-03-01 | Drawing method based on weighted random shuffling algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110226844.8A CN112883338B (en) | 2021-03-01 | 2021-03-01 | Drawing method based on weighted random shuffling algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112883338A true CN112883338A (en) | 2021-06-01 |
| CN112883338B CN112883338B (en) | 2024-03-22 |
Family
ID=76055133
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110226844.8A Active CN112883338B (en) | 2021-03-01 | 2021-03-01 | Drawing method based on weighted random shuffling algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112883338B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115664716A (en) * | 2022-09-27 | 2023-01-31 | 北京航空航天大学 | Multi-chain leader covert allocation method and device based on replacement proof |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108614748A (en) * | 2018-04-19 | 2018-10-02 | 上海分布信息科技有限公司 | A kind of method of Byzantine failure tolerance and its economic governing system of logical card |
| CN109842606A (en) * | 2018-02-24 | 2019-06-04 | 中国科学院计算技术研究所 | Block chain common recognition algorithm and system based on consistency hash algorithm |
| CN110535629A (en) * | 2019-09-20 | 2019-12-03 | 北京欧凯联创网络科技有限公司 | A kind of block that goes out under the conditions of asynchronous network is known together method |
| CN111049653A (en) * | 2018-10-12 | 2020-04-21 | 北京邦天信息技术有限公司 | Drawing method for electing consensus node |
-
2021
- 2021-03-01 CN CN202110226844.8A patent/CN112883338B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109842606A (en) * | 2018-02-24 | 2019-06-04 | 中国科学院计算技术研究所 | Block chain common recognition algorithm and system based on consistency hash algorithm |
| CN108614748A (en) * | 2018-04-19 | 2018-10-02 | 上海分布信息科技有限公司 | A kind of method of Byzantine failure tolerance and its economic governing system of logical card |
| CN111049653A (en) * | 2018-10-12 | 2020-04-21 | 北京邦天信息技术有限公司 | Drawing method for electing consensus node |
| CN110535629A (en) * | 2019-09-20 | 2019-12-03 | 北京欧凯联创网络科技有限公司 | A kind of block that goes out under the conditions of asynchronous network is known together method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115664716A (en) * | 2022-09-27 | 2023-01-31 | 北京航空航天大学 | Multi-chain leader covert allocation method and device based on replacement proof |
| CN115664716B (en) * | 2022-09-27 | 2024-05-03 | 北京航空航天大学 | Hidden distribution method and device for multi-chain leader based on replacement proof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112883338B (en) | 2024-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108768660B (en) | Internet of things equipment identity authentication method based on physical unclonable function | |
| KR102409819B1 (en) | Distributed transaction propagation and verification system | |
| JP7053677B2 (en) | Computer implementation systems and methods for managing transactions in blockchain networks | |
| US11985225B2 (en) | Computer-implemented systems and methods for using veiled values in blockchain | |
| KR20190067581A (en) | Apparatus and method for distributed processing of blockchain transactions | |
| CN113407640B (en) | Cross-chain method and system based on multi-chain NFT (network File transfer) | |
| JP4902144B2 (en) | callsign | |
| Schröder et al. | Verifiable data streaming | |
| KR20190093012A (en) | The method for block generation and validation in block-chain system | |
| Conti et al. | Blockchain trilemma solver algorand has dilemma over undecidable messages | |
| CN112789825A (en) | Computer-implemented system and method for transferring access to digital resources | |
| Ramezan et al. | Analysis of proof-of-work-based blockchains under an adaptive double-spend attack | |
| Sun et al. | Rtchain: A reputation system with transaction and consensus incentives for e-commerce blockchain | |
| Manimaran et al. | Blockchain-based smart contract for e-bidding system | |
| CN110445603A (en) | A kind of decentralization random digit generation method | |
| Zaman et al. | Proof of sincerity: A new lightweight consensus approach for mobile blockchains | |
| CN112883338A (en) | Lottery drawing method based on random shuffling algorithm with weight and application | |
| CN115147111A (en) | Key generation method and device, electronic device and storage medium | |
| CN110535629B (en) | Block-out consensus method under asynchronous network condition | |
| WO2021016546A1 (en) | Unity protocol consensus | |
| CN110889793A (en) | Block chain-based digital lottery issuing method and block chain link points | |
| CN115766742A (en) | Block chain consensus method, system, device and computer readable storage medium | |
| KR102023430B1 (en) | Probability fair game methode and system bisised on on line | |
| KR102023427B1 (en) | Probability fair game methode and system bisised on on line | |
| CN112422589A (en) | Domain name system request identification method, storage medium and electronic device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20220210 Address after: P.O. Box 31119, grant house, Furong Road, 802 Xiwan Road, Grand Cayman, Cayman Islands Applicant after: Okoser Holdings Address before: 100089 4001, floor 4, building 3, 8 Chuangye Road, Haidian District, Beijing Applicant before: Beijing Oukai Lianchuang Network Technology Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |