WO2020011182A1

WO2020011182A1 - Consensus method, device and system based on effective computation power contribution

Info

Publication number: WO2020011182A1
Application number: PCT/CN2019/095368
Authority: WO
Inventors: 傅志敬; 李升林; 孙立林
Original assignee: 云图有限公司
Priority date: 2018-07-10
Filing date: 2019-07-10
Publication date: 2020-01-16
Also published as: CN109165092B; CN109165092A

Abstract

A consensus method, device (42) and system based on effective computation power contribution. The method comprises receiving a computation task issued by a computation publisher (41) and a computation requirement corresponding to the computation task (101); creating a corresponding configuration of the computation task according to a computation requirement (102); acquiring the data needed by the computation task and compiling the computation task into a Boolean circuit (103); according to the Boolean circuit, the corresponding configuration of the computation task, and the data required for the computation task, forming a plurality of parallel computation tasks, and distributing the plurality of parallel computation tasks to a plurality of computation nodes (43) for computation (104); receiving a computation result and proof of computation created by the computation nodes (43) for the parallel computation tasks, and determining whether the computation result is valid according to the computation proof (105); if it is determined that the computation result is valid, determining a cumulative computation contribution value of the computation nodes (43) corresponding to the computation result, and allocating a preset reward for each computation node (43) according to the cumulative computation contribution value (106); receiving voting data regarding which the cumulative computation contribution value is taken by each computation node (43), and voting on candidate nodes (107); and using N preset candidate nodes that are the most voted for as N consensus nodes (108), wherein a practical Byzantine fault-tolerant algorithm is used to complete the consensus of block data among the N consensus nodes.

Description

Consensus method, device and system based on effective computing power contribution

Technical field

The present invention relates to the field of blockchain technology, and in particular, to a consensus method, device, and system based on effective computing power contributions.

Background technique

At present, blockchain technology is developing rapidly. For example, some current digital currencies (Bitcoin, Ethereum, etc.) all use blockchain technology. In the blockchain technology, a consensus mechanism is needed, that is, the verification and confirmation of the transaction is completed in a short time through the voting of special nodes; for a transaction, if several nodes with irrelevant interests can reach a consensus , It can be considered that the entire network can reach consensus on this.

At present, the blockchain, especially the public chain mainstream, still uses consensus such as Proof of Work (PoW), Proof of Stake (PoS), or Delegated Proof of Stake (DPoS). Mechanism or its variants, and consensus mechanisms such as PoW and PoS require hash mining, that is, use an exhaustive algorithm to calculate a qualified hash value. The role of mining is to compete for accounting rights, that is, Whoever mines first, who is responsible for packaging the transactions on the chain into blocks to get rewards. At present, all mainstream blockchain platforms basically use the method of local replay of the transaction process to verify the transaction, that is, when the node that has obtained the accounting right generates a block, it needs to execute the transaction based on the latest local ledger status and send the transaction itself. And the execution results are packaged into blocks, and the blocks are synchronized to other nodes. Other nodes need to re-execute the transaction based on their latest local ledger status. If the execution results are consistent with the results received in the block, they will be received. The obtained block is written on the local chain. As a result, all nodes need to perform transactions, which is called the local replay verification method of the transaction process. It can be seen that, on the one hand, this method wastes a lot of computing power, and on the other hand, it also makes the cycle of consensus reaching longer.

With the increase in the difficulty of digital currency mining, mining has become a heavy investment. Currently, there have been roles of professional miners, mines, and mining pools. Individual users can no longer mine with free equipment. According to the existing data, Bitcoin and Ethereum have more than 50% hash rate in the hands of the top four miners and the top three miners, respectively, forming an invisible power structure, which has deviated from the original intention of blockchain technology.

In order to overcome the above problems, the current technology generally uses EOS (Enterprise Operation System, a blockchain operating system designed for commercial distributed applications) and Cosmos (blockchain internet), which aims to solve many cryptocurrency issues Network) and other technologies: Among them, EOS uses the DPoS consensus mechanism to solve the problems of low consensus efficiency and wasted computing power. However, this technology simply removes the mining process, and the problem is that the rights are too concentrated, and the computing power of the existing mining machine cannot be used for useful calculations. Cosmos's consensus protocol Tendermint is actually an improved version of the classic Byzantine fault tolerance (BFT) algorithm. This technology can also solve the problems of low consensus efficiency and wasted computing power to a certain extent. The nodes that have voting rights determined in advance through the deposit are called validators. However, the disadvantage is that it cannot guarantee that the rights are excessively concentrated in the hands of the verifier, and it cannot use the existing mining machine's computing power to perform useful calculations.

Summary of the invention

Embodiments of the present invention provide a consensus method, device, and system based on effective computing power contributions to solve the problems of wasted computing power, low consensus efficiency, and excessive power concentration in the consensus mechanism in the current blockchain.

To achieve the above object, the present invention adopts the following technical solutions:

A consensus method based on effective computing power contributions, including:

Receiving a computing task issued by a computing publisher and a computing requirement corresponding to the computing task;

Performing a corresponding configuration of a computing task according to the computing requirements;

Acquiring data required for the computing task, and compiling the computing task into a Boolean circuit;

Forming a plurality of parallel computing tasks according to the Boolean circuit, a corresponding configuration of the computing task, and data required for the computing task, and distributing the multiple parallel computing tasks to multiple computing nodes for calculation;

Receiving a calculation result and a calculation certificate performed by the calculation node on the parallel computing task, and determining whether the calculation result is valid according to the calculation certificate;

After determining that the calculation result is valid, determining a cumulative calculation contribution value of a calculation node corresponding to the calculation result, and assigning a preset reward to each calculation node according to the accumulated calculation contribution value;

Receiving voting data of each computing node using the cumulative calculation contribution value, and voting on alternative nodes;

The N preset candidate nodes that get the most votes are taken as the N consensus nodes; among these N consensus nodes, a practical Byzantine fault tolerance algorithm is used to complete the consensus on the block data.

Specifically, the computing requirements corresponding to the computing tasks include a verifiable computing algorithm.

Specifically, performing a corresponding configuration of a computing task according to the computing requirements includes:

According to the verifiable computing algorithm included in the computing requirement, corresponding parameters of the verifiable computing algorithm are configured.

Specifically, acquiring data required for the computing task and compiling the computing task into a Boolean circuit includes:

The data required for the calculation task is obtained, and the calculation task is compiled into a Boolean circuit according to a preset compiler; the Boolean circuit includes a plurality of gate circuits, and each gate circuit has a corresponding consumption weight.

Specifically, according to the Boolean circuit, the corresponding configuration of the computing task, and the data required for the computing task, forming multiple parallel computing tasks, and distributing the multiple parallel computing tasks to multiple computing nodes for calculation, including:

Dividing the Boolean circuit into a plurality of Boolean sub-circuits, each of which includes one or more gate circuits;

Integrate corresponding parameters of verifiable computing algorithms, Boolean subcircuits, and data required for computing tasks into multiple parallel computing tasks;

Distributing the multiple parallel computing tasks to multiple computing nodes for calculation through a computing channel; wherein the same parallel computing task is distributed to multiple computing nodes simultaneously, and a preset computing redundancy is retained.

Specifically, receiving a calculation result and a calculation certificate performed by the computing node for the parallel computing task and determining whether the calculation result is valid according to the calculation certificate includes:

Receiving a calculation result obtained by the calculation node for the parallel calculation task and a calculation certificate obtained by performing a verifiable calculation according to a corresponding parameter of the verifiable calculation algorithm;

The actual workload of the calculation performed by the calculation node is determined according to the calculation certificate, and the calculation result is verified to be correct; the actual workload of the calculation performed by the calculation node includes the number of gate circuits that are actually correctly calculated.

Specifically, after determining that the calculation result is valid, determining a cumulative calculation contribution value of a calculation node corresponding to the calculation result, and assigning a preset reward to each calculation node according to the accumulated calculation contribution value, includes:

After determining the actual workload of the calculation performed by the calculation node and verifying that the calculation result is correct, the cumulative calculation contribution of the calculation node corresponding to the calculation result is determined according to the number of gate circuits that are actually calculated correctly and the consumption weight of each gate circuit. value;

Allocating a preset reward to each computing node according to the cumulative calculated contribution value; wherein the preset reward is directly proportional to the cumulative calculated contribution value.

Specifically, receiving the voting data of each computing node as the cumulative calculation contribution value and voting on the candidate nodes includes:

Receiving voting information of each computing node, and determining whether the voting is successful or not according to the voting information; the voting information includes the candidate node that was voted and the cumulative calculation contribution value information that was voted;

When the accumulated calculation contribution value owned by the calculation node satisfies the accumulated calculation contribution value information, determining that the voting is successful, and deducting the calculation contribution value corresponding to the successful voting from the calculation node after the end of the consensus period;

When the cumulative computing contribution value owned by the computing node does not satisfy the cumulative computing contribution value information, it is determined that the voting has failed.

Specifically, the preset N candidate nodes that get the most votes are taken as the N consensus nodes; among them, the N consensus nodes use a practical Byzantine fault tolerance algorithm to complete consensus on the block data, including:

The N preset candidate nodes that get the most votes are taken as N consensus nodes; among them, the N consensus nodes use a practical Byzantine fault tolerance algorithm to rotate out of the block and complete consensus on the block data; the N Consensus nodes are used to write the correct calculation results and corresponding cumulative calculation contribution values into the blocks of the blockchain network.

A consensus device based on effective computing power contributions, including:

A computing task and a demand receiving unit, configured to receive a computing task issued by a computing publisher and a computing requirement corresponding to the computing task;

A computing task configuration unit, configured to perform a corresponding configuration of a computing task according to the computing demand;

A Boolean circuit compiling unit, configured to obtain data required for the computing task and compile the computing task into a Boolean circuit;

A parallel computing task distribution unit, configured to form multiple parallel computing tasks according to the Boolean circuit, the corresponding configuration of the computing task, and data required by the computing task, and distribute the multiple parallel computing tasks to multiple computing nodes Calculation;

A calculation result and certificate receiving unit, configured to receive a calculation result and a calculation certificate performed by the computing node on the parallel computing task, and determine whether the calculation result is valid according to the calculation certificate;

A reward distribution unit, configured to determine a cumulative calculation contribution value of a computing node corresponding to the calculation result after determining that the calculation result is valid, and allocate a preset reward to each computing node according to the cumulative calculation contribution value;

A voting unit, configured to receive voting data of each computing node as a cumulative calculation contribution value, and vote on candidate nodes;

The consensus node determining unit is configured to use the preset N candidate nodes that have received the most votes as N consensus nodes. Among the N consensus nodes, a practical Byzantine fault tolerance algorithm is used to complete the consensus on the block data.

Specifically, the computing task corresponding to the computing task and the computing task in the demand receiving unit includes a verifiable computing algorithm.

In addition, the computing task configuration unit is specifically configured to:

In addition, the Boolean circuit compilation unit is specifically configured to:

In addition, the parallel computing task distribution unit is specifically configured to:

In addition, the calculation result and the certificate receiving unit are specifically used to:

In addition, the reward allocation unit is specifically configured to:

In addition, the voting unit is specifically configured to:

In addition, the consensus node determining unit is specifically configured to:

A consensus system based on effective computing power contributions, including: a calculation issuer, a consensus device based on effective computing power contributions, and multiple computing nodes;

The calculation issuer is configured to issue a calculation task and a calculation request corresponding to the calculation task to a consensus device based on an effective calculation power contribution;

The consensus device based on the contribution of effective computing power is configured to perform a corresponding configuration of a computing task according to the computing demand; acquire data required for the computing task, and compile the computing task into a Boolean circuit; according to the Boolean circuit The corresponding configuration of the computing task and the data required for the computing task form multiple parallel computing tasks, and distribute the multiple parallel computing tasks to multiple computing nodes;

The computing node is configured to calculate the parallel computing task, form a calculation result and a calculation certificate, and send the calculation result and the consensus device based on the effective computing power contribution;

The consensus device based on the effective computing power contribution is further configured to determine whether the calculation result is valid according to the calculation certificate; and after determining that the calculation result is valid, determine a cumulative calculation contribution value of a computing node corresponding to the calculation result, And assign preset rewards to each computing node according to the cumulative calculated contribution value; receive voting data of the cumulative computing contribution value of each computing node, and vote on alternative nodes; the preset N backups with the most votes will be obtained The nodes are selected as N consensus nodes; among them, the N consensus nodes adopt a practical Byzantine fault tolerance algorithm to complete consensus on the block data.

A consensus method, device, and system based on effective computing power contributions provided by embodiments of the present invention first receive a computing task issued by a computing publisher and a computing requirement corresponding to the computing task; and perform a corresponding computing task according to the computing requirement. Configuration; acquiring data required for the computing task and compiling the computing task into a Boolean circuit; forming a plurality of parallel computing tasks according to the corresponding configuration of the Boolean circuit, the computing task, and data required for the computing task, and Distributing the plurality of parallel computing tasks to a plurality of computing nodes for calculation; receiving a calculation result and a calculation certificate performed by the computing node on the parallel computing task, and determining whether the calculation result is based on the calculation certificate Valid; after determining that the calculation result is valid, determine the accumulated calculation contribution value of the calculation node corresponding to the calculation result, and assign a preset reward to each calculation node according to the accumulated calculation contribution value; receive each calculation node for the accumulated calculation Contribution value as voting data and voting on candidate nodes; Alternatively, the N most votes node set in advance as a consensus of N nodes; wherein, between the N nodes consensus Byzantine fault tolerance is the practical use of the consensus algorithm to complete the data block. It can be seen that the present invention is based on an effective proof-of-work algorithm, which separates consensus from calculation. The computing power is only used to perform the actual computing work and not used for mining, so that the waste of computing power existing in the consensus mechanism in the current blockchain can be solved. , Low consensus efficiency and overly concentrated power.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly explain the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings in the following description are merely These are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without paying creative labor.

FIG. 1 is a first flowchart of a consensus method based on effective computing power contribution provided by an embodiment of the present invention; FIG.

2 is a second flowchart of a consensus method based on effective computing power contribution provided by an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of a consensus device based on an effective computing power contribution according to an embodiment of the present invention; FIG.

4 is a schematic structural diagram of a consensus system based on effective computing power contribution provided by an embodiment of the present invention;

FIG. 5 is a schematic structural diagram of an electronic device in an embodiment of the present application.

detailed description

In the following, the technical solutions in the embodiments of the present invention will be clearly and completely described with reference to the drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by a person of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

As shown in FIG. 1, an embodiment of the present invention provides a consensus method based on effective computing power contributions, including:

Step 101: Receive a computing task issued by a computing publisher and a computing requirement corresponding to the computing task.

Step 102: Perform a corresponding configuration of a computing task according to the computing requirements.

Step 103: Obtain data required for the computing task, and compile the computing task into a Boolean circuit.

Step 104: Form a plurality of parallel computing tasks according to the Boolean circuit, a corresponding configuration of the computing task, and data required for the computing task, and distribute the plurality of parallel computing tasks to a plurality of computing nodes for calculation.

Step 105: Receive a calculation result and a calculation certificate performed by the calculation node on the parallel computing task, and determine whether the calculation result is valid according to the calculation certificate.

Step 106: After determining that the calculation result is valid, determine a cumulative calculation contribution value of a computing node corresponding to the calculation result, and allocate a preset reward to each computing node according to the accumulated calculation contribution value.

Step 107: Receive voting data of each computing node as a cumulative calculation contribution value, and vote on candidate nodes.

Step 108: Use the preset N candidate nodes that get the most votes as N consensus nodes.

Among them, the N consensus nodes use a practical Byzantine fault tolerance algorithm to complete consensus on the block data. Therefore, since N consensus nodes are selected, and the N consensus nodes use a practical Byzantine fault tolerance algorithm to complete consensus on the block data, the next step 101 can be performed after receiving the calculation task issued by the calculation publisher. Go to step 106. That is, after step 108, the process may return to step 101.

An embodiment of the present invention provides a consensus method based on the contribution of effective computing power, which is based on an effective proof-of-work algorithm to separate consensus from calculation. The computing power is only used to perform the actual computing work, not used for mining, and there is no calculation. The problem of wasting power. In addition, consensus nodes use a practical Byzantine fault-tolerant algorithm to complete consensus on block data. For complex calculations, the block directly contains the transaction results and their proofs. Verification nodes can perform fast and effective verification through cryptographic algorithms without the need for a calculation process. Local replay method to verify transactions, avoid waste of computing power, and at the same time improve the consensus efficiency of the blockchain as a whole, thereby improving the transaction throughput of the entire network. The invention can solve the problems of wasted computing power, low consensus efficiency and excessive power concentration in the current consensus mechanism in the blockchain.

In order to enable those skilled in the art to better understand the present invention, a more detailed embodiment is enumerated below. As shown in FIG. 2, the embodiment of the present invention provides a consensus method based on effective computing power contributions, including:

Step 201: Receive a computing task issued by a computing publisher and a computing requirement corresponding to the computing task.

Specifically, the computing requirement corresponding to the computing task includes a verifiable computing algorithm (Verifiable Compilation, VC for short).

Step 202: Configure corresponding parameters of the verifiable computing algorithm according to the verifiable computing algorithm included in the computing requirement.

Step 203: Obtain data required for the computing task, and compile the computing task into a Boolean circuit according to a preset compiler.

The calculation task can be compiled into a Boolean circuit here. The Boolean circuit includes multiple gate circuits, and each gate circuit has a corresponding consumption weight.

Step 204: The Boolean circuit is divided into multiple Boolean sub-circuits, and each Boolean sub-circuit includes one or more gate circuits.

Step 205: Integrate corresponding parameters of the verifiable computing algorithm, Boolean subcircuits, and data required for the computing task into multiple parallel computing tasks.

Step 206: Distribute the multiple parallel computing tasks to multiple computing nodes for calculation through a computing channel; the same parallel computing task is simultaneously distributed to multiple computing nodes, and a preset computing redundancy is retained.

Step 207: Receive a calculation result obtained by the calculation node for the parallel calculation task and a calculation certificate obtained by performing a verifiable calculation according to a corresponding parameter of the verifiable calculation algorithm.

Step 208: Determine the actual workload of the calculation performed by the computing node according to the calculation certificate, and verify whether the calculation result is correct; the actual workload of the calculation performed by the calculation node includes the number of gate circuits that are actually correctly calculated.

Step 209: After determining the actual workload of the computing node for calculation and verifying that the calculation result is correct, determine the calculation node corresponding to the calculation result according to the number of gate circuits that are actually calculated correctly and the consumption weight of each gate circuit. Cumulatively calculate the contribution value.

The cumulative calculation contribution value of the computing node may be a value obtained by summing the gate circuits that it actually calculates correctly according to the consumption weights.

Step 210: Assign preset rewards to each computing node according to the cumulative calculated contribution value; wherein the preset reward is proportional to the cumulative calculated contribution value.

Step 211: Receive voting information of each computing node, and determine whether the voting is successful according to the voting information.

The voting information includes voted candidate nodes and voted cumulative calculation contribution value information.

Here, in a time period, each computing node can be sorted according to the size of the cumulative calculation contribution value, and a computing node with a large cumulative calculation contribution value is used as an alternative node. For example, N computing nodes with a large cumulative calculation contribution value can be set in advance. As an alternative node.

After step 211, step 212 or step 213 is performed.

Step 212: When the cumulative calculated contribution value owned by the computing node satisfies the cumulative calculated contribution value information,

It is determined that the voting is successful, and after the end of the consensus period, the calculated contribution value corresponding to the successful voting is deducted from the computing node.

Step 213: When the accumulated calculated contribution value owned by the computing node does not satisfy the accumulated calculated contribution value information, determine that the voting has failed.

After step 212 and step 213, step 214 is performed.

Step 214: Use the preset N candidate nodes that get the most votes as N consensus nodes.

Among them, the N consensus nodes use a practical Byzantine fault tolerance algorithm to round out blocks and complete consensus on the block data; the N consensus nodes are used to write the correct calculation results and corresponding cumulative calculation contribution values Into the block of the blockchain network. Therefore, since N consensus nodes are selected and the N consensus nodes use a practical Byzantine fault tolerance algorithm to complete consensus on the block data, the next step 201 can be performed after receiving the calculation task issued by the calculation publisher. Go to step 213. That is, step 201 can be continued after step 214.

In addition, the revenue obtained by the consensus node that produced the block can be distributed to the computing node that voted according to the voting proportion. If a consensus node is found to be fraudulent, it may be disqualified from acting as a consensus node and deduct all accumulated calculated contribution values and certain funds. The election process is repeated in the next cycle.

When verifying the validity of the block, the system can adaptively configure the verification method according to the complexity of the contract. For simple contracts (contracts that do not involve parallel or outsourced calculations, that is, local node calculations are called simple contracts), nodes only need to recalculate the contracts and check whether the results are consistent. For complex contracts (parallel computing or outsourced computing, that is, contracts that require other nodes to assist in computing in addition to local nodes are called complex contracts), the system will distribute the functional calculations carried in the contract to multiple computing nodes. Each computing node feeds back the calculation results and calculation proof. Consensus nodes place the calculation results and calculation proofs in the blocks in the blockchain. Other nodes only need to verify the proof to determine the legitimacy of the block. When the contract is very complicated, parallel computing can greatly reduce the block verification time and improve performance.

An embodiment of the present invention provides a consensus method based on effective computing power contributions. First, a computing task issued by a computing publisher and a computing requirement corresponding to the computing task are received; a corresponding configuration of the computing task is performed according to the computing requirement; Describe the data required for the computing task, and compile the computing task into a Boolean circuit; form multiple parallel computing tasks according to the Boolean circuit, the corresponding configuration of the computing task, and the data required for the computing task, and convert the multiple Distribute parallel computing tasks to multiple computing nodes to perform calculations; receive calculation results and calculation certificates of the parallel computing tasks performed by the computing nodes, and determine whether the calculation results are valid according to the calculation certificates; After the calculation result is valid, determine the accumulated calculation contribution value of the calculation node corresponding to the calculation result, and assign a preset reward to each calculation node according to the accumulated calculation contribution value; and receive each calculation node as the accumulated calculation contribution value. Voting data, and voting on alternative nodes; will get the most votes Alternatively, the first set of N nodes as the nodes of N consensus, the consensus between the N nodes Byzantine fault tolerance is the practical use of the consensus algorithm to complete the data block. It can be seen that the present invention is based on an effective proof-of-work algorithm, which separates consensus from calculation. The computing power is only used to perform the actual computing work and not used for mining, so that the waste of computing power existing in the consensus mechanism in the current blockchain can be solved. , Low consensus efficiency and overly concentrated power. The invention can be applied to related products or services of the blockchain, including public chain products or products of the alliance chain.

Corresponding to the method embodiments shown in FIG. 1 and FIG. 2 described above, as shown in FIG. 3, an embodiment of the present invention further provides a consensus device based on effective computing power contributions, including:

The computing task and requirement receiving unit 31 is configured to receive a computing task issued by a computing issuer and a computing requirement corresponding to the computing task.

The computing task configuration unit 32 is configured to perform a corresponding configuration of a computing task according to the computing requirements.

The Boolean circuit compiling unit 33 is configured to acquire data required for the computing task and compile the computing task into a Boolean circuit.

A parallel computing task distribution unit 34 is configured to form a plurality of parallel computing tasks according to the Boolean circuits, corresponding configurations of the computing tasks, and data required by the computing tasks, and distribute the plurality of parallel computing tasks to multiple computing nodes. Calculations.

The calculation result and certificate receiving unit 35 is configured to receive a calculation result and a calculation certificate performed by the computing node on the parallel computing task, and determine whether the calculation result is valid according to the calculation certificate.

The reward distribution unit 36 is configured to determine a cumulative calculation contribution value of a computing node corresponding to the calculation result after determining that the calculation result is valid, and allocate a preset reward to each computing node according to the cumulative calculation contribution value.

The voting unit 37 is configured to receive voting data of each computing node as a cumulative calculation contribution value, and vote on candidate nodes.

The consensus node determining unit 38 is configured to use the preset N candidate nodes that have received the most votes as the N consensus nodes. Among the N consensus nodes, a practical Byzantine fault tolerance algorithm is used to complete the consensus on the block data.

Specifically, the computing task corresponding to the computing task in the computing task and the demand receiving unit 31 includes a verifiable computing algorithm.

In addition, the computing task configuration unit 32 is specifically configured to:

In addition, the Boolean circuit compiling unit 33 is specifically configured to:

In addition, the parallel computing task distribution unit 34 is specifically configured to:

The Boolean circuit is divided into a plurality of Boolean sub-circuits, and each Boolean sub-circuit includes one or more gate circuits.

Integrate the corresponding parameters of verifiable computing algorithms, Boolean subcircuits, and data required for computing tasks into multiple parallel computing tasks.

In addition, the calculation result and certification receiving unit 35 is specifically configured to:

Receiving a calculation result obtained by the computing node performing calculation on the parallel computing task and a calculation certificate obtained by performing verifiable calculation according to a corresponding parameter of the verifiable calculation algorithm.

In addition, the reward distribution unit 36 is specifically configured to:

After determining the actual workload of the calculation performed by the calculation node and verifying that the calculation result is correct, the cumulative calculation contribution of the calculation node corresponding to the calculation result is determined according to the number of gate circuits that are actually calculated correctly and the consumption weight of each gate circuit. value.

In addition, the voting unit 37 is specifically configured to:

Receive voting information of each computing node, and determine whether the voting is successful or not according to the voting information; the voting information includes the candidate node that was voted on and the cumulative calculation contribution value information that was voted on.

When the cumulative computing contribution value owned by the computing node satisfies the cumulative computing contribution value information, the voting is determined to be successful, and after the end of the consensus period, the computing contribution value corresponding to the successful voting is deducted from the computing node.

In addition, the consensus node determining unit 38 is specifically configured to:

An embodiment of the present invention provides a consensus device based on the contribution of effective computing power, which is based on an effective proof-of-work algorithm to separate consensus from calculation. The computing power is only used to perform the actual computing work and not used for mining, which can solve the problem. The current consensus mechanisms in blockchains have problems such as wasted computing power, low consensus efficiency, and excessive power concentration.

In addition, as shown in FIG. 4, an embodiment of the present invention further provides a consensus system based on effective computing power contributions, including: a calculation issuer 41, a consensus device 42 based on effective computing power contributions, and a plurality of computing nodes 43.

The calculation issuer 41 is configured to issue a calculation task and a calculation request corresponding to the calculation task to a consensus device 42 based on an effective calculation power contribution.

The consensus device 42 based on the effective computing power contribution is used to perform the corresponding configuration of the computing task according to the computing demand; obtain the data required for the computing task (available from a third-party system, on or off the blockchain) Required data), and compile the computing task into a Boolean circuit; according to the Boolean circuit, the corresponding configuration of the computing task, and the data required for the computing task, form a plurality of parallel computing tasks, and Computing tasks are distributed to multiple computing nodes 43.

The computing node 43 is configured to perform calculation on the parallel computing task, form a calculation result and a calculation certificate, and send the calculation result and the consensus device 42 based on the effective computing power contribution.

The consensus device 42 based on the effective computing power contribution is further configured to determine whether the calculation result is valid according to the calculation certificate; after determining that the calculation result is valid, determine a cumulative calculation contribution value of a computing node corresponding to the calculation result, And assign preset rewards to each computing node according to the cumulative calculated contribution value; receive voting data of each computing node 43 using the cumulative calculated contribution value, and vote on alternative nodes; the preset N number of most votes will be obtained The candidate nodes serve as N consensus nodes; among these N consensus nodes, a practical Byzantine fault tolerance algorithm is used to complete consensus on the block data.

An embodiment of the present invention provides a consensus system based on effective computing power contribution, which is based on an effective proof-of-work algorithm that separates consensus from calculation. The computing power is only used to perform the actual computing work and not used for mining, so it can be solved. The current consensus mechanisms in blockchains have problems such as wasted computing power, low consensus efficiency, and excessive power concentration.

An embodiment of the present application further provides a specific implementation of an electronic device capable of implementing all the steps in the consensus method based on the effective computing power contribution in the foregoing embodiment. The electronic device specifically includes the following content:

A processor, a memory, a communication interface, and a bus; wherein the processor, the memory, and the communication interface communicate with each other through the bus; the communication interface is used to implement related equipment Information transmission between them; the electronic device may be a desktop computer, a tablet computer, a mobile terminal, etc., and this embodiment is not limited thereto. In this embodiment, the electronic device may be implemented by referring to the embodiment of the embodiment for the consensus method based on effective computing power contribution and the embodiment of the consensus device based on effective computing power contribution, the contents of which are incorporated herein, The duplicates will not be repeated.

FIG. 5 is a schematic block diagram of a system configuration of an electronic device 600 according to an embodiment of the present application. As shown in FIG. 5, the electronic device 600 may include a central processing unit 100 and a memory 140; the memory 140 is coupled to the central processing unit 100. It is worth noting that this figure is exemplary; other types of structures can also be used to supplement or replace the structure to implement telecommunication functions or other functions.

In one embodiment, a consensus function based on effective computing power contributions may be integrated into the central processing unit 100. The central processing unit 100 may be configured to perform the following control:

As can be seen from the above description, the embodiment of the present application provides an electronic device that separates consensus from calculation based on an effective proof-of-work algorithm. The computing power is only used to perform the actual calculation work and not used for mining, thereby solving the current area. The consensus mechanism in the blockchain has the problems of wasted computing power, low consensus efficiency, and excessive power concentration.

In another embodiment, the consensus device based on the effective computing power contribution may be configured separately from the central processing unit 100. For example, the consensus device based on the effective computing power contribution may be configured as a chip connected to the central processing unit 100. Control to achieve a consensus function based on effective computing power contributions.

As shown in FIG. 5, the electronic device 600 may further include a communication module 110, an input unit 120, an audio processor 130, a display 160, and a power source 170. It is worth noting that the electronic device 600 does not necessarily include all the components shown in FIG. 5; in addition, the electronic device 600 may further include components not shown in FIG. 5, and reference may be made to the prior art.

As shown in FIG. 5, the central processing unit 100 is sometimes referred to as a controller or an operation control, and may include a microprocessor or other processor devices and / or logic devices. The central processing unit 100 receives input and controls each of the electronic devices 600. Operation of parts.

The memory 140 may be, for example, one or more of a buffer, a flash memory, a hard drive, a removable medium, a volatile memory, a non-volatile memory, or other suitable devices. The above-mentioned failure-related information can be stored, and in addition, a program for executing the related information can be stored. In addition, the central processing unit 100 may execute the program stored in the memory 140 to implement information storage or processing.

The input unit 120 provides input to the central processing unit 100. The input unit 120 is, for example, a key input or a touch input device. The power source 170 is used to provide power to the electronic device 600. The display 160 is used for displaying display objects such as images and characters. The display may be, for example, an LCD display, but is not limited thereto.

The memory 140 may be a solid-state memory, such as a read-only memory (ROM), a random access memory (RAM), a SIM card, and the like. It may also be a memory that holds information even when power is off, can be selectively erased, and is provided with more data. An example of this memory is sometimes called EPROM or the like. The memory 140 may also be some other type of device. The memory 140 includes a buffer memory 141 (sometimes referred to as a buffer). The memory 140 may include an application / function storage section 142 for storing application programs and function programs or a flow for performing operations of the electronic device 600 through the central processing unit 100.

The memory 140 may further include a data storage section 143 for storing data. The driver storage section 144 of the memory 140 may include various driver programs for the communication function of the electronic device and / or for performing other functions of the electronic device (such as a messaging application, an address book application, etc.).

The communication module 110 is a transmitter / receiver 110 that transmits and receives signals via the antenna 111. A communication module (transmitter / receiver) 110 is coupled to the central processing unit 100 to provide input signals and receive output signals, which may be the same as the case of a conventional mobile communication terminal.

Based on different communication technologies, multiple communication modules 110 may be provided in the same electronic device, such as a cellular network module, a Bluetooth module, and / or a wireless local area network module. The communication module (transmitter / receiver) 110 is also coupled to the speaker 131 and the microphone 132 via the audio processor 130 to provide audio output via the speaker 131 and to receive audio input from the microphone 132, thereby realizing general telecommunication functions. The audio processor 130 may include any suitable buffers, decoders, amplifiers, and the like. In addition, the audio processor is also coupled to the central processing unit 100, thereby enabling recording on the unit through the microphone 132, and enabling sounds stored on the unit to be played through the speaker 131.

An embodiment of the present application further provides a computer-readable storage medium capable of realizing all the steps in the consensus method based on effective computing power contribution in the foregoing embodiment. The computer-readable storage medium stores a computer program, the computer program When executed by a processor, all steps of the consensus method based on effective computing power contributions in the above embodiments are implemented. For example, when the processor executes the computer program, the following steps are implemented:

As can be seen from the above description, the embodiment of the present application provides a computer-readable storage medium that separates consensus from calculation based on an effective proof-of-work algorithm. The computing power is only used to perform the actual calculation work, not used for mining, so that Solve the problems of waste of computing power, low consensus efficiency, and excessive power concentration in the current consensus mechanism of the blockchain.

Those skilled in the art should understand that the embodiments of the present invention may be provided as a method, a system, or a computer program product. Therefore, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present invention may take the form of a computer program product implemented on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

The present invention is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present invention. It should be understood that each process and / or block in the flowcharts and / or block diagrams, and combinations of processes and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing device to produce a machine, so that the instructions generated by the processor of the computer or other programmable data processing device are used to generate instructions Means for implementing the functions specified in one or more flowcharts and / or one or more blocks of the block diagrams.

These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to work in a specific manner such that the instructions stored in the computer-readable memory produce a manufactured article including an instruction device, the instructions The device implements the functions specified in one or more flowcharts and / or one or more blocks of the block diagram.

These computer program instructions can also be loaded onto a computer or other programmable data processing device, so that a series of steps can be performed on the computer or other programmable device to produce a computer-implemented process, which can be executed on the computer or other programmable device. The instructions provide steps for implementing the functions specified in one or more flowcharts and / or one or more blocks of the block diagrams.

The principle and implementation of the present invention are explained by applying specific embodiments in the present invention. The description of the above embodiments is only used to help understand the method of the present invention and its core ideas; meanwhile, for a person of ordinary skill in the art, The idea of the invention will change in both the specific implementation and the scope of application. In summary, the content of this description should not be construed as a limitation on the present invention.

Claims

A consensus method based on effective computing power contributions is characterized by:

Receiving a computing task issued by a computing publisher and a computing requirement corresponding to the computing task;

Performing a corresponding configuration of a computing task according to the computing requirements;

Acquiring data required for the computing task, and compiling the computing task into a Boolean circuit;

Forming a plurality of parallel computing tasks according to the Boolean circuit, a corresponding configuration of the computing task, and data required for the computing task, and distributing the multiple parallel computing tasks to multiple computing nodes for calculation;

Receiving a calculation result and a calculation certificate performed by the calculation node on the parallel computing task, and determining whether the calculation result is valid according to the calculation certificate;

After determining that the calculation result is valid, determining a cumulative calculation contribution value of a calculation node corresponding to the calculation result, and assigning a preset reward to each calculation node according to the accumulated calculation contribution value;

Receiving voting data of each computing node using the cumulative calculation contribution value, and voting on alternative nodes;

The N preset candidate nodes that get the most votes are taken as the N consensus nodes; among these N consensus nodes, a practical Byzantine fault tolerance algorithm is used to complete the consensus on the block data.
The consensus method based on effective computing power contribution according to claim 1, wherein the computing requirements corresponding to the computing tasks include a verifiable computing algorithm.
The consensus method based on effective computing power contribution according to claim 2, characterized in that performing a corresponding configuration of a computing task according to the computing demand comprises:

According to the verifiable computing algorithm included in the computing requirement, corresponding parameters of the verifiable computing algorithm are configured.
The consensus method based on effective computing power contribution according to claim 3, wherein acquiring data required for the computing task and compiling the computing task into a Boolean circuit comprises:

The data required for the calculation task is obtained, and the calculation task is compiled into a Boolean circuit according to a preset compiler; the Boolean circuit includes a plurality of gate circuits, and each gate circuit has a corresponding consumption weight.
The consensus method based on effective computing power contribution according to claim 4, characterized in that a plurality of parallel computing tasks are formed according to the Boolean circuit, a corresponding configuration of the computing task, and data required for the computing task, and the Multiple parallel computing tasks are distributed to multiple computing nodes for computing, including:

Dividing the Boolean circuit into a plurality of Boolean sub-circuits, each of which includes one or more gate circuits;

Integrate corresponding parameters of verifiable computing algorithms, Boolean subcircuits, and data required for computing tasks into multiple parallel computing tasks;

Distributing the multiple parallel computing tasks to multiple computing nodes for calculation through a computing channel; wherein the same parallel computing task is distributed to multiple computing nodes simultaneously, and a preset computing redundancy is retained.
The consensus method based on effective computing power contribution according to claim 5, characterized in that: receiving a calculation result and a calculation certificate by the computing node for the parallel computing task, and determining the calculation according to the calculation certificate Whether the results are valid, including:

Receiving a calculation result obtained by the calculation node for the parallel calculation task and a calculation certificate obtained by performing a verifiable calculation according to a corresponding parameter of the verifiable calculation algorithm;

The actual workload of the calculation performed by the calculation node is determined according to the calculation certificate, and the calculation result is verified to be correct; the actual workload of the calculation performed by the calculation node includes the number of gate circuits that are actually correctly calculated.
The consensus method based on effective computing power contributions according to claim 6, characterized in that after determining that the calculation result is valid, determining a cumulative calculation contribution value of a computing node corresponding to the calculation result, and according to the accumulated calculation The contribution value is assigned to each computing node, including:

After determining the actual workload of the calculation performed by the calculation node and verifying that the calculation result is correct, the cumulative calculation contribution of the calculation node corresponding to the calculation result is determined according to the number of gate circuits that are actually calculated correctly and the consumption weight of each gate circuit. value;

Allocating a preset reward to each computing node according to the cumulative calculated contribution value; wherein the preset reward is directly proportional to the cumulative calculated contribution value.
The consensus method based on effective computing power contributions according to claim 7, characterized in that receiving voting data of each computing node as a cumulative calculation contribution value and voting on candidate nodes comprises:

Receiving voting information of each computing node, and determining whether the voting is successful or not according to the voting information; the voting information includes the candidate node that was voted and the cumulative calculation contribution value information that was voted;

When the accumulated calculation contribution value owned by the calculation node satisfies the accumulated calculation contribution value information, determining that the voting is successful, and deducting the calculation contribution value corresponding to the successful voting from the calculation node after the end of the consensus period;

When the cumulative computing contribution value owned by the computing node does not satisfy the cumulative computing contribution value information, it is determined that the voting has failed.
The consensus method based on effective computing power contribution according to claim 8, characterized in that the preset N candidate nodes that get the most votes are used as the N consensus nodes; wherein the N consensus nodes adopt Practical Byzantine fault-tolerant algorithms for consensus on block data include:

The N preset candidate nodes that get the most votes are taken as N consensus nodes; among them, the N consensus nodes use a practical Byzantine fault tolerance algorithm to rotate out of the block and complete consensus on the block data; the N Consensus nodes are used to write the correct calculation results and corresponding cumulative calculation contribution values into the blocks of the blockchain network.
A consensus device based on effective computing power contributions, which includes:

A computing task and a demand receiving unit, configured to receive a computing task issued by a computing publisher and a computing requirement corresponding to the computing task;

A computing task configuration unit, configured to perform a corresponding configuration of a computing task according to the computing demand;

A Boolean circuit compiling unit, configured to obtain data required for the computing task and compile the computing task into a Boolean circuit;

A parallel computing task distribution unit, configured to form multiple parallel computing tasks according to the Boolean circuit, the corresponding configuration of the computing task, and data required by the computing task, and distribute the multiple parallel computing tasks to multiple computing nodes Calculation;

A calculation result and certificate receiving unit, configured to receive a calculation result and a calculation certificate performed by the computing node on the parallel computing task, and determine whether the calculation result is valid according to the calculation certificate;

A reward distribution unit, configured to determine a cumulative calculation contribution value of a computing node corresponding to the calculation result after determining that the calculation result is valid, and allocate a preset reward to each computing node according to the cumulative calculation contribution value;

A voting unit, configured to receive voting data of each computing node as a cumulative calculation contribution value, and vote on candidate nodes;

The consensus node determining unit is configured to use the preset N candidate nodes that have received the most votes as N consensus nodes. Among the N consensus nodes, a practical Byzantine fault tolerance algorithm is used to complete the consensus on the block data.
The consensus device based on effective computing power contribution according to claim 10, wherein the computing task corresponding to the computing task and the computing task in the demand receiving unit includes a verifiable computing algorithm.
The consensus device based on effective computing power contribution according to claim 11, wherein the computing task configuration unit is specifically configured to:

According to the verifiable computing algorithm included in the computing requirement, corresponding parameters of the verifiable computing algorithm are configured.
The consensus device based on effective computing power contribution according to claim 12, wherein the Boolean circuit coding unit is specifically configured to:

The data required for the calculation task is obtained, and the calculation task is compiled into a Boolean circuit according to a preset compiler; the Boolean circuit includes a plurality of gate circuits, and each gate circuit has a corresponding consumption weight.
The consensus device based on effective computing power contribution according to claim 13, wherein the parallel computing task distribution unit is specifically configured to:

Dividing the Boolean circuit into a plurality of Boolean sub-circuits, each of which includes one or more gate circuits;

Integrate corresponding parameters of verifiable computing algorithms, Boolean subcircuits, and data required for computing tasks into multiple parallel computing tasks;

Distributing the multiple parallel computing tasks to multiple computing nodes for calculation through a computing channel; wherein the same parallel computing task is distributed to multiple computing nodes simultaneously, and a preset computing redundancy is retained.
The consensus device based on the effective computing power contribution according to claim 14, wherein the calculation result and the certificate receiving unit are specifically configured to:

Receiving a calculation result obtained by the calculation node for the parallel calculation task and a calculation certificate obtained by performing a verifiable calculation according to a corresponding parameter of the verifiable calculation algorithm;

The actual workload of the calculation performed by the calculation node is determined according to the calculation certificate, and the calculation result is verified to be correct; the actual workload of the calculation performed by the calculation node includes the number of gate circuits that are actually correctly calculated.
The consensus device based on effective computing power contribution according to claim 15, wherein the reward distribution unit is specifically configured to:

After determining the actual workload of the calculation performed by the calculation node and verifying that the calculation result is correct, the cumulative calculation contribution of the calculation node corresponding to the calculation result is determined according to the number of gate circuits that are actually calculated correctly and the consumption weight of each gate circuit. value;

Allocating a preset reward to each computing node according to the cumulative calculated contribution value; wherein the preset reward is directly proportional to the cumulative calculated contribution value.
The consensus device based on effective computing power contribution according to claim 16, wherein the voting unit is specifically configured to:

Receiving voting information of each computing node, and determining whether the voting is successful or not according to the voting information; the voting information includes the candidate node that was voted and the cumulative calculation contribution value information that was voted;

When the accumulated calculation contribution value owned by the calculation node satisfies the accumulated calculation contribution value information, determining that the voting is successful, and deducting the calculation contribution value corresponding to the successful voting from the calculation node after the end of the consensus period;

When the cumulative computing contribution value owned by the computing node does not satisfy the cumulative computing contribution value information, it is determined that the voting has failed.
The consensus device based on effective computing power contribution according to claim 17, wherein the consensus node determining unit is specifically configured to:

The N preset candidate nodes that get the most votes are taken as N consensus nodes; among them, the N consensus nodes use a practical Byzantine fault tolerance algorithm to rotate out of the block and complete consensus on the block data; the N Consensus nodes are used to write the correct calculation results and corresponding cumulative calculation contribution values into the blocks of the blockchain network.
A consensus system based on effective computing power contributions, which is characterized by comprising: a calculation issuer, a consensus device based on effective computing power contributions, and multiple computing nodes;

The calculation issuer is configured to issue a calculation task and a calculation request corresponding to the calculation task to a consensus device based on an effective calculation power contribution;

The consensus device based on the contribution of effective computing power is configured to perform a corresponding configuration of a computing task according to the computing demand; acquire data required for the computing task, and compile the computing task into a Boolean circuit; according to the Boolean circuit The corresponding configuration of the computing task and the data required for the computing task form multiple parallel computing tasks, and distribute the multiple parallel computing tasks to multiple computing nodes;

The computing node is configured to calculate the parallel computing task, form a calculation result and a calculation certificate, and send the calculation result and the consensus device based on the effective computing power contribution;

The consensus device based on the effective computing power contribution is further configured to determine whether the calculation result is valid according to the calculation certificate; and after determining that the calculation result is valid, determine a cumulative calculation contribution value of a computing node corresponding to the calculation result, And assign preset rewards to each computing node according to the cumulative calculated contribution value; receive voting data of the cumulative computing contribution value of each computing node, and vote on alternative nodes; the preset N backups with the most votes will be obtained The nodes are selected as N consensus nodes; among them, the N consensus nodes adopt a practical Byzantine fault tolerance algorithm to complete consensus on the block data.
An electronic device includes a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements the computer program according to any one of claims 1 to 9 when executing the computer program. The steps of the consensus method based on the contribution of effective computing power are described.
A computer-readable storage medium having stored thereon a computer program, characterized in that when the computer program is executed by a processor, the steps of implementing the consensus method based on the effective computing power contribution according to any one of claims 1 to 9 .