System and method for ending view change protocol

Patent metadata

Field	Value
Publication number	US-11057504-B2
Application number	US-201916497543-A
Country	US
Kind code	B2
Filing date	Mar 18, 2019
Priority date	Mar 18, 2019
Publication date	Jul 6, 2021
Grant date	Jul 6, 2021

Abstract

Methods, systems, and apparatus, including computer programs encoded on computer storage media, for performing view change. One of the methods is to be implemented on a blockchain maintained by a number (N) of nodes and performed by a first node of the N nodes that is in a view change protocol. The method includes: obtaining, respectively from at least Q second nodes of the N nodes, at least Q first messages each comprising (1) a consistent current view known to the second node indicating a primary node designated among the N nodes and (2) a consistent current sequence number known to the second node, the current sequence number associated with a latest transaction or a latest block, wherein the current sequence number is larger than a first sequence number known to the first node; and responsive to obtaining the at least Q first messages, ending the view change protocol.

First claim

The invention claimed is:

1. A computer-implemented view change method to be implemented on a blockchain maintained by a number (N) of nodes, the method performed by a first node of the N nodes that is in a view change protocol, the method comprising:
obtaining, respectively from at least Q second nodes of the N nodes, at least Q first messages each comprising (1) a consistent current view known to the second node indicating a primary node designated among the N nodes and (2) a consistent current sequence number known to the second node, the current sequence number associated with a latest block or a latest transaction committed by the second node, wherein the current sequence number is larger than a first sequence number known to the first node, Q (quorum) is (N+F+1)/2 rounded up to the nearest integer, and F is (N−1)/3 rounded down to the nearest integer; and
responsive to obtaining the at least Q first messages, ending the view change protocol.

2. The method of claim 1 , wherein obtaining the at least Q first messages comprises:
obtaining, respectively from the at least Q second nodes, at least Q commit messages indicating that the at least Q second nodes agree upon a next block to add to the blockchain, the Q commit messages respectively comprising the Q first messages.

3. The method of claim 1 , wherein obtaining the at least Q first messages comprises:
obtaining, respectively from the at least Q second nodes, at least Q commit messages indicating that the at least Q second nodes agree upon a next block to add to the blockchain, the Q first messages respectively appended to the Q commit messages.

4. The method of claim 1 , wherein:
the current sequence number comprises a height of a second copy of the blockchain maintained by the second node; and
the first sequence number comprises a height of a first copy of the blockchain maintained by the first node.

5. The method of claim 1 , wherein:
the current sequence number comprises a sequence number of the latest transaction committed by the second node; and
the first sequence number comprises a sequence number of a latest transaction committed by the first node.

6. The method of claim 1 , wherein:
the first message comprises a digital signature certifying the current view and the current sequence number both known to the second node.

7. The method of claim 1 , wherein:
the first message further comprises a digest of the latest block or the latest transaction; and
the digest comprises a hash value of the latest block or the latest transaction.

8. The method of claim 7 , wherein:
the digest comprises a Merkle root of the latest block known to the second node but unknown to the first node.

9. The method of claim 1 , wherein:
the N nodes form a Practical Byzantine Fault Tolerance (PBFT) network, in which one of the N nodes acts as the primary node and the other (N−1) nodes act as backup nodes;
the current sequence number known to the at least Q second nodes is (n+1);
the first sequence number known to the first node is n;
the current view for the at least Q second nodes is v; and
when in the view change protocol, the first node has a first view larger than v.

10. A view change system for maintaining a blockchain, wherein a number (N) of nodes maintain the blockchain, the system acting as a first node of the N nodes that is in a view change protocol, the system comprising one or more processors and one or more non-transitory computer-readable memories coupled to the one or more processors and configured with instructions executable by the one or more processors to cause the system to perform operations comprising:
obtaining, respectively from at least Q second nodes of the N nodes, at least Q first messages each comprising (1) a consistent current view known to the second node indicating a primary node designated among the N nodes and (2) a consistent current sequence number known to the second node, the current sequence number associated with a latest block or a latest transaction committed by the second node, wherein the current sequence number is larger than a first sequence number known to the first node, Q (quorum) is (N+F+1)/2 rounded up to the nearest integer, and F is (N−1)/3 rounded down to the nearest integer; and
responsive to obtaining the at least Q first messages, ending the view change protocol.

11. The system of claim 10 , wherein obtaining the at least Q first messages comprises:
obtaining, respectively from the at least Q second nodes, at least Q commit messages indicating that the at least Q second nodes agree upon a next block to add to the blockchain, the Q commit messages respectively comprising the Q first messages.

12. The system of claim 10 , wherein obtaining the at least Q first messages comprises:
obtaining, respectively from the at least Q second nodes, at least Q commit messages indicating that the at least Q second nodes agree upon a next block to add to the blockchain, the Q first messages respectively appended to the Q commit messages.

13. The system of claim 10 , wherein:
the current sequence number comprises a height of a second copy of the blockchain maintained by the second node; and
the first sequence number comprises a height of a first copy of the blockchain maintained by the first node.

14. The system of claim 10 , wherein:
the current sequence number comprises a sequence number of the latest transaction committed by the second node; and
the first sequence number comprises a sequence number of a latest transaction committed by the first node.

15. A non-transitory computer-readable storage medium for maintaining a blockchain, wherein a number (N) of nodes maintain the blockchain, the storage medium being associated with a first node of the N nodes that is in a view change protocol, the storage medium configured with instructions executable by one or more processors to cause the one or more processors to perform operations comprising:
obtaining, respectively from at least Q second nodes of the N nodes, at least Q first messages each comprising (1) a consistent current view known to the second node indicating a primary node designated among the N nodes and (2) a consistent current sequence number known to the second node, the current sequence number associated with a latest block or a latest transaction committed by the second node, wherein the current sequence number is larger than a first sequence number known to the first node, Q (quorum) is (N+F+1)/2 rounded up to the nearest integer, and F is (N−1)/3 rounded down to the nearest integer; and
responsive to obtaining the at least Q first messages, ending the view change protocol.

16. The storage medium of claim 15 , wherein obtaining the at least Q first messages comprises:
obtaining, respectively from the at least Q second nodes, at least Q commit messages indicating that the at least Q second nodes agree upon a next block to add to the blockchain, the Q commit messages respectively comprising the Q first messages.

17. The storage medium of claim 15 , wherein obtaining the at least Q first messages comprises:
obtaining, respectively from the at least Q second nodes, at least Q commit messages indicating that the at least Q second nodes agree upon a next block to add to the blockchain, the Q first messages respectively appended to the Q commit messages.

18. The storage medium of claim 15 , wherein:
the current sequence number comprises a height of a second copy of the blockchain maintained by the second node; and
the first sequence number comprises a height of a first copy of

Assignees

• Advanced New Technologies Co Ltd

Inventors

• Yang Dayi

Classifications

• H04L9/50

  using hash chains, e.g. blockchains or hash trees · CPC title

• G06Q20/00

  Payment architectures, schemes or protocols (apparatus for performing or posting payment transactions G07F7/08, G07F19/00; electronic cash registers G07G1/12) · CPC title

• H04L69/40 Primary

  for recovering from a failure of a protocol instance or entity, e.g. service redundancy protocols, protocol state redundancy or protocol service redirection (management of faults, events, alarms or notifications in data switching networks H04L41/06) · CPC title

• G06F2201/82

  Solving problems relating to consistency · CPC title

• G06F16/1824

  implemented using Network-attached Storage [NAS] architecture (distributed or networked storage systems G06F3/067; protocols for distributed storage of data in a network H04L67/1097) · CPC title