Peer node recovery via approximate hash verification

1. A computing system, comprising:

a processor that, when executing instructions stored in a memory, is configured to:

receive a sequence of blocks from a blockchain peer node, wherein each block in the sequence of blocks is linked to a previous block in the sequence of blocks based on and execution of a reduced-step hash operation on a header of a block content of the previous block in the sequence of blocks, wherein the reduced-step hash operation comprises fewer hash operations than does a full-step hash verification that is generated by continuing to execute the reduced-step hash operation an additional predetermined number of times; and

verify that a reduced-step hash of the header is included in a respective block based on an approximate hash verification.

2. The computing system of claim 1 , wherein the processor is further configured to:

transmit a request for the sequence of blocks to the blockchain peer node in response to a crash at a failed blockchain peer node.

3. The computing system of claim 1 , wherein the processor is further configured to:

transmit a request for the sequence of blocks to the blockchain peer node in response to a recovery operation at another blockchain peer node.

4. The computing system of claim 1 , wherein the processor is further configured to:

receive a second version of the sequence of blocks from a second blockchain peer node,

wherein each block in the second version of the sequence of blocks includes a full-step hash of block content from the previous block in the sequence.

5. The computing system of claim 4 , wherein the processor is further configured to:

verify the sequence of blocks based on the second version of the sequence of blocks.

6. The computing system of claim 1 , wherein the sequence of blocks is stored on a hash-linked chain of blocks on a distributed ledger.

7. The computing system of claim 1 , wherein the processor configured to:

perform the approximate hash verification on the reduced-step hash; and

determine whether the sequence of blocks has been tampered with based on the approximate hash verification.

8. A method comprising:

receiving by a processor a sequence of blocks from a blockchain peer node, wherein each block in the sequence of blocks is linked to a previous block in the sequence of blocks based on and execution of a reduced-step hash operation on a header of a block content of the previous block in the sequence of blocks, wherein the reduced-step hash operation comprises fewer hash operations than does a full-step hash verification that is generated by continuing to execute the reduced-step hash operation an additional predetermined number of times;

verifying by the processor that a reduced-step hash of the header is included in a respective block based on an approximate hash verification.

9. The method of claim 8 , comprising:

transmitting a request for the sequence of blocks to the blockchain peer node in response to a crash at a failed blockchain peer node.

10. The method of claim 8 , comprising:

transmitting a request for the sequence of blocks to the blockchain peer node in response to a recovery operation at another blockchain peer node.

11. The method of claim 8 , comprising:

receiving a second version of the sequence of blocks from a second blockchain peer node,

wherein each block in the second version of the sequence of blocks includes a full-step hash of block content from the previous block in the sequence.

12. The method of claim 11 , comprising:

verifying the sequence of blocks based on the second version of the sequence of blocks.

13. The method of claim 8 , wherein the sequence of blocks is stored on a hash-linked chain of blocks on a distributed ledger.

14. The method of claim 8 , comprising:

performing the approximate hash verification on the reduced-step hash; and

determining whether the sequence of blocks has been tampered with based on the approximate hash verification.

15. A non-transitory computer-readable medium comprising instructions that, when executed by a processor, cause the processor to perform:

receiving a sequence of blocks from a blockchain peer node, wherein each block in the sequence of blocks is linked to a previous block in the sequence of blocks based on and execution of a reduced-step hash operation on a header of a block content of the previous block in the sequence of blocks, wherein the reduced-step hash operation comprises fewer hash operations than does a full-step hash verification that is generated by continuing to execute the reduced-step hash operation an additional predetermined number of times;

verifying that a reduced-step hash of the header is included in a respective block based on an approximate hash verification.

16. The computer-readable medium of claim 15 , wherein the instructions further cause the processor to perform:

transmitting a request for the sequence of blocks to the blockchain peer node in response to a crash at a failed blockchain peer node.

17. The computer-readable medium of claim 15 , wherein the instructions further cause the processor to perform:

transmitting a request for the sequence of blocks to the blockchain peer node in response to a recovery operation at another blockchain peer node.

18. The computer-readable medium of claim 15 , wherein the instructions further cause the processor to perform:

receiving a second version of the sequence of blocks from a second blockchain peer node,

wherein each block in the second version of the sequence of blocks includes a full-step hash of block content from the previous block in the sequence.

19. The computer-readable medium of claim 18 , wherein the instructions further cause the processor to perform:

verifying the sequence of blocks based on the second version of the sequence of blocks.

20. The computer-readable medium of claim 15 , wherein the sequence of blocks is stored on a hash-linked chain of blocks on a distributed ledger.