Byzantine fault-tolerant consensus method and a terminal applied to a coalition chain
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A consensus and alliance technology, applied in the field of blockchain, can solve the problem of low consensus performance of alliance chain, and achieve the effect of improving consensus efficiency and ensuring security.
Active Publication Date: 2019-01-08
福建福链科技有限公司
View PDF3 Cites 21 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0004] The technical problem to be solved by the present invention is: the present invention provides a Byzantine fault-tolerant consensus method and terminal applied to the alliance chain, which solves the problem of low consensus performance of the existing alliance chain
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0091] Please refer to figure 1 , Embodiment 1 of the present invention is:
[0092] The present invention provides a Byzantine fault-tolerant consensus method applied to alliance chains, comprising the following steps:
[0093] S1: During each round of consensus, according to the private key stored on each consensus node to be selected, the serial number of each consensus node to be selected, the number of the current view and the area generated by the alliance chain in the previous round of consensus The hash value corresponding to the block is calculated to obtain the hash value corresponding to each candidate node;
[0094] The hash value corresponding to the block generated in the previous round of consensus process is the hash value corresponding to the consensus node in the previous round of consensus process.
[0095] Wherein, the S1 is specifically:
[0096] Calculate the hash value corresponding to each node to be selected by preset the first formula;
[0097] Th...
Embodiment 2
[0124] Please refer to figure 2 , the second embodiment of the present invention is:
[0125] The present invention provides a Byzantine fault-tolerant consensus terminal applied to the consortium chain, including a memory 1, a processor 2, and a computer program stored on the memory 1 and operable on the processor 2, and the processor 2 executes the computer program The following steps are implemented in the program:
[0126] S1: During each round of consensus, according to the private key stored on each consensus node to be selected, the serial number of each consensus node to be selected, the number of the current view and the area generated by the alliance chain in the previous round of consensus The hash value corresponding to the block is calculated to obtain the hash value corresponding to each candidate node;
[0127] Wherein, the S1 is specifically:
[0128] Calculate the hash value corresponding to each node to be selected by preset the first formula;
[0129] T...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
PUM
Login to view more
Abstract
The invention provides a Byzantine fault-tolerant consensus method and a terminal applied to a coalition chain. The method comprises the steps of in each round of consensus process, according to the private key, serial number, current view and the hash value corresponding to the block generated in the previous round of consensus process, calculating the hash value corresponding to each selected consensus node, thereby the unique first consensus node is selected; And generating proposal information through the first consensus node and sending the proposal information to each consensus node to be selected respectively; according to the verification passing information corresponding to the proposal information sent by the selected consensus node, generating the identification information andtransmitting the identification information to each selected consensus node respectively; and if the number of verification passing information corresponding to the identification information receivedby the first consensus node exceeds the preset number, executing the next round of consensus. By adopting the scheme, the invention not only improves the consensus performance of the alliance chain,but also ensures the safety of the alliance chain.
Description
technical field [0001] The invention relates to the technical field of block chains, in particular to a Byzantine fault-tolerant consensus method and terminal applied to alliance chains. Background technique [0002] An important parameter of the VBFT consensus algorithm adopted by Ontology is the PoS (Proof of Stake, PoS) table of the consensus network nodes. During the operation of the VBFT algorithm (Verifiable Random Function Byzantine Fault Tolerance, verifiable random function Byzantine fault tolerance algorithm), all nodes randomly select nodes participating in each round of consensus according to the current consensus PoS table, and the randomly selected nodes complete the corresponding round of consensus Work. [0003] The VBFT algorithm can be considered as an improvement of the traditional BFT algorithm (Byzantine Fault Tolerance, Byzantine Fault Tolerance Algorithm) in the direction of verifiable randomness. In the VBFT algorithm, firstly, based on the verifiab...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to view more 
Login to view more