Supporting distributed ledgers in a micro-services environment

Patent metadata

Field	Value
Publication number	US-10601900-B2
Application number	US-201715604045-A
Country	US
Kind code	B2
Filing date	May 24, 2017
Priority date	May 24, 2017
Publication date	Mar 24, 2020
Grant date	Mar 24, 2020

Abstract

Implementations of the disclosure provide an apparatus comprises: a memory to store a set of blocks of a distributed ledger; and a processing device, operatively coupled to the memory, to: receive, from a node device, a message comprising a first number of blocks of the distributed ledger that have been processed by the node device. A number of blocks to be skipped are determined. The number is equal to a difference between the first number of blocks and a second number of blocks of the distributed ledger that have been processed by the apparatus. One or more blocks of the determined number of blocks that have been processed by the node device but have not been processed by the apparatus are utilized to update the set of blocks of the distributed ledger. Thereupon, the one or more blocks that are utilized by the apparatus to update the distributed ledger are skipped for processing.

First claim

What is claimed is:

1. An apparatus comprising:
a memory to store a set of blocks of a distributed ledger; and
a processing device, operatively coupled to the memory, to:
receive, from a node device, a message comprising a first number of blocks of the distributed ledger that have been processed by the node device;
responsive to determining that the node device has processed a most number of blocks of the distributed ledger relative to one or more other node devices, determine a number of blocks to be skipped in a queue of blocks for the distributed ledger, wherein the number of blocks to be skipped comprises a difference between the first number of blocks of the distributed ledger that have been processed by the node device and a second number of blocks of the distributed ledger that have been processed by the processing device, wherein the difference between the first number of blocks and the second number of blocks satisfies a threshold value;
utilize one or more blocks that correspond to the determined number of blocks to be skipped to update the set of blocks of the distributed ledger, wherein the one or more blocks have been processed by the node device; and
skip another one or more blocks in the queue of blocks corresponding to the one or more blocks that are utilized to update the set of blocks of the distributed ledger, wherein the processing device to skip the another one or more blocks further comprises the processing device to skip generating a hash value for block data of the another one or more blocks in the queue of blocks and to continue generating a hash value for block data of one or more blocks in the queue of blocks that are subsequent to the another one or more blocks in the queue of blocks.

2. The apparatus of claim 1 , wherein the processing device is further to copy the one or more blocks that correspond to the determined number of blocks to be skipped from the node device.

3. The apparatus of claim 1 , wherein the processing device is further to receive a publication of a number of blocks processed by each node device of a plurality of node devices, the node device being a part of the plurality of node devices.

4. The apparatus of claim 3 , wherein the processing device is further to select at least one node device of the plurality of node devices in view of the publication, wherein the selected at least one node device has processed a greater number of blocks of the distributed ledger than other node devices of the plurality of node devices.

5. The apparatus of claim 1 , wherein the processing device is further to append the one or more blocks that correspond to the determined number of blocks to the set of blocks of the distributed ledger.

6. A method comprising:
receiving, from a node device, a message comprising a first number of blocks of a distributed ledger that have been processed by the node device;
responsive to determining that the node device has processed a most number of blocks of the distributed ledger relative to one or more other node devices, determining, by a processing device, a number of blocks to be skipped in a queue of blocks for the distributed ledger, wherein the number of blocks to be skipped comprises a difference between the first number of blocks of the distributed ledger that have been processed by the node device and a second number of blocks of the distributed ledger that have been processed by the processing device, wherein the difference between the first number of blocks and the second number of blocks satisfies a threshold value;
utilizing, by the processing device, one or more blocks that correspond to the determined number of blocks to be skipped to update a set of blocks of the distributed ledger, wherein the one or more blocks have been processed by the node device; and
skipping, by the processing device, another one or more blocks in the queue of blocks corresponding to the one or more blocks that are utilized to update the set of blocks of the distributed ledger, wherein the skipping further comprises skipping to generate a hash value for block data of the another one or more blocks in the queue of blocks and continuing to generate a hash value for block data of one or more blocks in the queue of blocks that are subsequent to the another one or more blocks in the queue of blocks.

7. The method of claim 6 , further comprising copying the one or more blocks that correspond to the determined number of blocks to be skipped from the node device.

8. The method of claim 6 , further comprising receiving a publication of a number of blocks processed by each node device of a plurality of node devices, the node device being a part of the plurality of node devices.

9. The method of claim 8 , further comprising selecting at least one node device of the plurality of node devices in view of the publication, wherein the selected at least one node device has processed a greater number of blocks of the distributed ledger than other node devices of the plurality of node devices.

10. The method of claim 6 , further comprising appending the one or more blocks that correspond to the determined number of blocks to the set of blocks of the distributed ledger.

11. A non-transitory computer-readable storage medium comprising executable instructions that when executed, by a processing device, cause the processing device to:
receive, from a node device, a message comprising a first number of blocks of a distributed ledger that have been processed by the node device;
responsive to determining that the node device has processed a most number of blocks of the distributed ledger relative to one or more other node devices, determine, by the processing device, a number of blocks to be skipped in a queue of blocks for the distributed ledger, wherein the number of blocks to be skipped comprises a difference between the first number of blocks of the distributed ledger that have been processed by the node device and a second number of blocks of the distributed ledger that have been processed by the processing device, wherein the difference between the first number of blocks and the second number of blocks satisfies a threshold value;
utilize one or more blocks that correspond to the determined number of blocks to be skipped to update a set of blocks of the distributed ledger, wherein the one or more blocks have been processed by the node device; and
skip another one or more blocks in the queue of blocks corresponding to the one or more blocks that are utilized to update the set of blocks of the distributed ledger, wherein the processing device to skip the another one or more blocks further comprises the processing device to skip generating a hash value for block data of the another one or more blocks in the queue of blocks and to continue generating a hash value for block data of one or more blocks in the queue of blocks that are subsequent to the another one or more blocks in the queue of blocks.

12. The non-transitory computer-readable storage medium of claim 11 , wherein the processing device is further to copy the one or more blocks that correspond to the determined number of blocks to be skipped from the node device.

13. The non-transitory computer-readable storage medium of claim 11 , wherein the processing device is further to receive a publication of a number of blocks processed by each node device of a plurality of node devices, the node device being a part of the plurality of node devices.

14. The non-transitory computer-readable storage medium of claim 13 , wherein the processing device is further to select at least one node device of the plurality of node devices in view of the publication, where

Assignees

• Red Hat Inc

Inventors

• Chen Huamin
• Vyas Jay

Classifications

• G06Q20/0655

  e-cash managed centrally · CPC title

• H04L9/3239

  involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD · CPC title

• G06F9/45533

  Hypervisors; Virtual machine monitors · CPC title

• G06Q20/0658

  e-cash managed locally · CPC title

• G06Q2220/00

  Business processing using cryptography · CPC title