Blockchain consensus method based on device-independent quantum random beacon

Abstract

This invention proposes a blockchain consensus method based on device-independent quantum random number beacons. A blockchain sorting algorithm is used to rank the participating nodes. Each node sequentially requests a private device-independent quantum random number block from the beacon service network. The digital signature of the beacon is verified. Nodes that pass verification participate in the consensus process. According to an agreed-upon algorithm, the random number blocks allocated to each verified node are processed with a second hash value. Nodes whose results meet a threshold condition are selected as the chosen nodes to verify the authenticity and validity of the random number blocks of other nodes. If the verification passes, the consensus round is complete. The consensus mechanism based on device-independent random number beacons proposed in this invention has high security and fairness. Nodes can request private device-independent random number blocks through the beacon service network. The election process is low-power, more efficient, and easier for network expansion.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of blockchains, and particularly relates to a blockchain consensus method based on device-independent quantum random beacon services. BACKGROUND

[0002] A blockchain is a distributed ledger, and each transaction participant is a node of the blockchain network, each node has a complete copy of the public ledger, and the transaction history information is recorded on the ledger. Any node initiating a transaction needs to update the relevant information to the ledger of each node in the block network, so that all nodes can participate in the verification of the transaction.

[0003] The basic idea of the consensus mechanism is to temporarily select a node as a recording node each time, and other nodes verify whether each transaction recorded by the recording node is real and effective. Due to security issues, the blockchain design stipulates that a recording node needs to be selected each time, and the difference between the existing consensus mechanisms is mainly in the selection method of the recording node. An important feature of the consensus mechanism is fairness and decentralization that provides equal opportunities for all nodes, so as to protect the consensus nodes from attacks and prevent tampering with the total account.

[0004] In the existing blockchain system, the mainstream consensus mechanisms include proof of work (POW), proof of stake (POS), delegated proof of stake (DPOS), and Byzantine consensus algorithm (PBFT); each consensus mechanism has its advantages and disadvantages. For example, the POW mechanism requires a large amount of computing power and energy waste, and the block efficiency is low. The POS and DPOS mechanisms are not high in fairness. The PBFT has high implementation complexity and is not suitable for network expansion. With the development of blockchain technology, how to find a new consensus algorithm to ensure the fairness, security and efficiency of the consensus mechanism, and to benefit the network expansion, has become a problem to be solved. SUMMARY

[0005] The present application proposes a blockchain consensus mechanism based on device-independent quantum random beacon services. The device-independent quantum random number generator uses the unique properties of quantum physics to detect the Bell inequality without any assumptions about the device, and the quantum entangled state can be used as the most basic resource for generating quantum randomness to generate random numbers. The security of the device-independent quantum random number only depends on the violation of the Bell inequality, and the source and working principle of the device used are not required, so it is considered to be the most secure random number generation device.

[0006] Device-independent quantum random number beacon service sends newly generated blocks of uniformly random numbers to target users. Each block contains newly generated device-independent quantum random numbers, a timestamp, a digital signature from the beacon, and the hash value of the previous block, thus preventing tampering with the generated data. Legitimate users can obtain real-time generated random number blocks and related hash values, signatures, and other information through the beacon service network, and can also verify previous data. This invention, based on the unpredictable, immutable, and verifiable characteristics of the random number blocks generated by the beacon service network, proposes a novel consensus mechanism to select ledger nodes, ensuring the speed, efficiency, security, and fairness of the consensus algorithm.

[0007] A blockchain consensus method based on device-independent quantum random number beacons includes the following steps:

[0008] Step 1: Sort the nodes.

[0009] At the start of the consensus process, the nodes participating in the consensus are sorted according to their IDs using a blockchain sorting algorithm.

[0010] Step 2: Each node requests a private random number block in sequence.

[0011] Each node requests a private device-independent quantum random number block from the beacon service network according to the order of the sorted list. Each node obtains a different device-independent quantum random number block. The value of the device-independent quantum random number block includes: a newly generated device-independent quantum random number with uniform randomness, a timestamp, the digital signature of the beacon, and the hash value of the previous random number block.

[0012] Step 3: Each node verifies the random number block.

[0013] After receiving the device-independent quantum random number block, each node saves its own random number block without disclosing it to the outside world, and verifies the digital signature of the beacon. Nodes that pass the verification participate in this consensus process.

[0014] Step 4: Select the accounting node or witness node.

[0015] All nodes hash the transaction data of the previous block to obtain the first hash value. All nodes then combine the current transaction data with the first hash value to obtain a transaction data packet. This transaction data packet is then hashed to obtain the second hash value. Each node publishes its second hash value. Since the current transaction data recorded by each node is the same as the transaction data of the previous block, the second hash value obtained by each node should be the same, thus verifying the accuracy and consistency of the current transaction data recorded by each node.

[0016] The nodes that pass the verification, according to the algorithm agreed in advance, operate the random number blocks allocated to each node with the second hash value, and the nodes whose operation results meet the threshold condition are selected as the selected nodes;

[0017] Step five: verify the authenticity of the random number blocks of each node, the validity of the ledger nodes or the authentication nodes.

[0018] All nodes publish their allocated random number blocks, and according to the sorting list and the published random number blocks, the authenticity of the random number blocks of other nodes is verified according to the timestamp, digital signature, and hash value of the previous random number block carried by each random number block. If the authenticity of the random number blocks of each node is verified, it is further verified whether the operation result published by the selected node meets the threshold requirement. If it meets the threshold condition, the ledger node is determined to be a valid ledger node or authentication node, and the current round of consensus is completed.

[0019] Further, in step one, the Fisher-Yates shuffle algorithm is used to shuffle the order of all consensus nodes participating in the consensus, and a sorting list is given.

[0020] Further, through the sorting list, the blockchain nodes are randomly and equally probable sorted.

[0021] Further, in each round of consensus, the beacon service network only sends a random number block to each node once.

[0022] Further, in step four, the algorithm agreed in advance is: calculating the difference between the random number block and the new hash value; or the threshold condition is: selecting the node with the smallest or largest difference value as the ledger node.

[0023] Further, in step four, the algorithm agreed in advance is the difference value, sum value or other agreed algorithm. The threshold condition is used as a judgment condition for determining the ledger node in the future.

[0024] Further, in step five, if the verification is passed, it is further verified whether the operation result published by the ledger node meets the threshold requirement. If the verification is passed, the ledger node is determined to be a valid ledger node or authentication node.

[0025] Further, before a new round of consensus, all blockchain nodes access the beacon service network, the beacon service network performs identity authentication on each node, the beacon service network allocates a valid domain name to each node that passes the identity authentication, and each node can apply for a private device-independent quantum random number block from the beacon network in real time; at the same time, the node applies for the public key of the beacon from the beacon network.

[0026] Further, the public key is obtained through a secure encryption method.

[0027] Beneficial technical effects:

[0028] 1.The application proposes a blockchain consensus mechanism based on device-independent quantum random beacon service, through which a recording node or an authentication node can be selected.The random number block generated by the beacon service network contains device-independent quantum random number, timestamp, digital signature, and hash value of the previous random number.The device-independent quantum random number is considered to be the most secure random number, and has the characteristics of unpredictability, tamper resistance, and verifiability.The consensus mechanism based on the device-independent random beacon service proposed in the scheme has high security and fairness.

[0029] 2.All nodes in the blockchain access the beacon service network, and can apply for a private device-independent random number block through the beacon service network.

[0030] 3.The application selects the node that meets the preset condition in the witness node as the recording node or witness node through the device-independent quantum random number and transaction data, and the election process has low power consumption, is more efficient, and is more conducive to network expansion.

[0031] 4.The blockchain node can verify the digital signature to confirm whether to participate in the next round of consensus, and all nodes can verify the validity and authenticity of the random number of the recording node according to the sorting order and the random number block, further ensuring the security and fairness of the consensus process. BRIEF DESCRIPTION OF DRAWINGS

[0032] In order to more clearly illustrate the technical solutions in the embodiments of the application, the following will briefly introduce the drawings needed to be used in the embodiment description. Obviously, the drawings in the following description are only some embodiments of the application, and other drawings can also be obtained by those skilled in the art without creative labor on the basis of these drawings.

[0033] FIG. Figure 1 is a schematic diagram of the blockchain node access beacon service network architecture of the application;

[0034] FIG. Figure 2 is a specific step flow chart of the implementation process of the blockchain consensus mechanism of the application;

[0035] FIG. Figure 3 is a random number block data schematic diagram of the application. DETAILED DESCRIPTION

[0036] With reference to the accompanying drawings: clearly and fully describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all. Based on the embodiments in the present application, all other embodiments obtained by a person of ordinary skill in the art without creative labor fall within the scope of the present application.

[0037] The blockchain node access beacon service network architecture diagram is shown in Figure 1

[0038] Preparation before consensus: before a new round of consensus, all blockchain nodes access the beacon service network, the beacon service network authenticates the identity of each node, and the beacon service network allocates a legal domain name to each node that passes the identity authentication. Each node can apply for a private device-independent quantum random number block from the beacon network in real time. At the same time, the node applies for the public key of the beacon from the beacon network. Preferably, the public key can be obtained through a secure encryption method.

[0039] All nodes agree on the algorithm and related threshold conditions used in the consensus process. The algorithm can be a difference, a sum or other agreed algorithm. The threshold condition is used as a judgment condition for subsequent determination of the accounting node.

[0040] The specific step flow chart for the implementation process of the blockchain consensus mechanism includes the following steps: Figure 2

[0041] Step one: sort all consensus nodes. At the beginning of the consensus process, according to the ID of each node, use the blockchain sorting algorithm to sort each node participating in the consensus.

[0042] In the preferred embodiment, the Fisher-Yates shuffle algorithm is used to shuffle the order of all consensus nodes, and a sorted list is given.

[0043] Specifically, Fisher-Yates shuffle is a standard algorithm for generating a random permutation of a finite set. The random permutation generated by this algorithm is equiprobable and very efficient, and can be used for sorting of blockchain nodes. Through this sorting, the blockchain nodes can be randomly sorted and are equiprobable, ensuring the fairness of the sorting.

[0044] Step two: each node applies for a private device-independent quantum random number block from the beacon service network according to the order of the sorted list. Each node's random number block is different and is applied for by each blockchain node in order.

[0045] ​​Each random number block value contains: newly generated device-independent quantum random number with uniform randomness, time stamp, digital signature of beacon, and hash value of previous random number block. It should be noted that since the nodes are sorted in step one, the corresponding random number block is applied in the order of sorting, therefore, the next random number block will have the hash value of the previous random number block, and so on, just like a chain, and any node cannot fake the random number block. If the first node fakes the random number block, the second node will easily judge the faking behavior of the first node because the second node has the hash value of the first random number block issued by the beacon. Therefore, the hash value of the previous random number block is a very key verification parameter.

[0046] The random number block data format is as shown in Figure 3 but is not limited to Figure 3 shown. In each round of consensus, the beacon service network sends a random number block to each node only once.

[0047] Step three: Confirm the nodes participating in the consensus by verifying the digital signature in the random number block. After receiving the random number block, each node verifies the digital signature in the random number block to determine that the random number block is issued by the beacon service network, thereby verifying the legitimacy of the random number block of each node, and the nodes passing the verification participate in the consensus process.

[0048] Step four: Determine the accounting node or witness node. All nodes combine the current transaction data and the hash value of the transaction data of the previous block to calculate a new hash value, i.e. a hash value, and each node publishes the new hash value. Through the algorithm agreed in advance, the random number block assigned to the node is operated with the new hash value to obtain an operation result, and each node broadcasts the random number block and the operation result to other nodes. The node whose operation result meets the threshold condition can be a selected node.

[0049] In the preferred embodiment, the algorithm agreed in advance is: calculating the difference between the random number block and the new hash value; the threshold condition is: selecting the node with the smallest difference as the selected node.

[0050] Step five: Verify the authenticity of the random number block of each node and the effectiveness of the accounting node or authentication node.

[0051] All nodes publish the random number blocks allocated respectively, verify the authenticity of the random number blocks of other nodes according to the sorting and the published random number blocks, and according to the time stamp, the digital signature, the hash value of the previous random number block carried by each random number block, if the authenticity and validity of the random number blocks of the respective nodes are verified, further verify whether the operation result published by the selected node meets the threshold requirement, if the threshold condition is met, determine that the account node is a valid account node or an authentication node, and then the consensus of this round is completed.

[0052] The private quantum device independent random number blocks of each node are applied through the beacon service network, the nodes selected by the operation of the random number blocks and the transaction data are selected as the account nodes under the preset condition. Each random number block value includes: a newly generated random number block with uniform randomness, a time stamp, a digital signature of the beacon network, and a hash value of the previous random number block, so that the validity and authenticity of the random number blocks of each node can be verified between the nodes, and tampering of the random number blocks is avoided. Further, the security and fairness of the consensus mechanism are ensured.

[0053] In the above embodiments, all or part of them can be realized by software, hardware, firmware or any combination thereof. When realized by software, all or part of them can be realized in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, all or part of them produce the processes or functions described in the embodiments of the present application. The computer can be a general-purpose computer, a special-purpose computer, a computer network or other programmable devices. The computer instructions can be stored in a computer readable storage medium or transmitted by the computer readable storage medium. The computer readable storage medium can be any available medium accessible by a computer or a data storage device such as a server, data center, etc. integrated with one or more available media. The available media can be magnetic media (e.g., floppy disk, hard disk, magnetic tape), optical media (e.g., DVD), or semiconductor media (e.g., solid state disk (SSD)) and the like.

[0054] The above is only a specific embodiment of the present application, but the protection scope of the present application is not limited thereto. Any skilled person in the art can easily think of various equivalent modifications or replacements within the technical range disclosed in the present application, and these modifications or replacements should be covered in the protection scope of the present application. Therefore, the protection scope of the present application should be subject to the protection scope of the claims.

Claims

1. A blockchain consensus method based on device-independent quantum random beacon, characterized in that, The method comprises the following steps: Step one: at the beginning of the consensus process, sort the nodes participating in the consensus according to the ID of each node by using a blockchain sorting algorithm; Step two: each node sequentially applies to the beacon service network for obtaining a private device-independent quantum random number block, and each node obtains a different device-independent quantum random number block; the value of the device-independent quantum random number block comprises: a newly generated device-independent quantum random number with uniform randomness, a timestamp, a digital signature of the beacon, and a hash value of the previous random number block; Step three: after each node receives the device-independent quantum random number block, it saves its own random number block and does not publish it externally, and verifies the digital signature of the beacon. The nodes that pass the verification participate in the consensus process this time; Step four: all nodes take the hash value of the transaction data of the previous block to obtain a first hash value, and all nodes combine the current transaction data and the first hash value to obtain a set of transaction data packets. The hash value of the transaction data packet is taken to obtain a second hash value, and each node publishes the obtained second hash value; Since the current transaction data recorded by each node and the transaction data of the previous block are the same, the second hash value obtained by each node should be the same. The nodes that pass the verification perform an operation on the random number block assigned to each node and the second hash value according to an agreed algorithm, and the nodes whose operation results meet the threshold condition are selected as selected nodes; Step five: verify the authenticity of the random number block of each node, and the validity of the account node or the authentication node; All nodes publish their own assigned random number blocks, verify the authenticity of the random number blocks of other nodes according to the sorting and published random number blocks, and according to the timestamp, digital signature, and hash value of the previous random number block carried by each random number block. If the authenticity of the random number block of each node is verified, further verify whether the operation result published by the selected node meets the threshold condition. If it meets the threshold condition, the account node is determined to be a valid account node or authentication node, and the current consensus is completed. 2.The device-independent quantum random beacon based blockchain consensus method of claim 1, wherein, The Fisher-Yates shuffle algorithm is used to shuffle the order of all consensus nodes and give a sorting list. 3.The device-independent quantum random beacon based blockchain consensus method of claim 2, wherein, The blockchain nodes are randomly and equally probabilistically sorted by the sorting list. 4.The device-independent quantum random beacon based blockchain consensus method of claim 1, wherein, In each round of consensus, the beacon service network sends a random number block to each node only once. 5.The device-independent quantum random beacon based blockchain consensus method of claim 1, wherein, In step four, the agreed algorithm is to calculate the difference or sum of the random number block and the new hash value, and the threshold condition is used as a judgment condition for determining the account node or authentication node.

6. The device-independent quantum random beacon based on quantum beacon consensus method according to claim 5, characterized in that, In step five, if the verification is passed, further verify whether the operation result published by the account node or authentication node meets the threshold condition. If it is verified, the account node is determined to be a valid account node or authentication node.

7. The device-independent quantum random beacon based on quantum beacon method of consensus of blockchain according to claim 1, characterized in that, Before a new round of consensus, all blockchain nodes access a beacon service network, the beacon service network authenticates the identity of each node, the beacon service network allocates a legal domain name to each node passing the identity authentication, each node can apply for a private device-independent quantum random number block from the beacon service network in real time; at the same time, the node applies for the public key of the beacon from the beacon service network.

8. The device-independent quantum random beacon based on quantum beacon method of consensus of the blockchain of claim 7, wherein, The public key is obtained through a secure encryption method.

Images