Peer node recovery via approximate hash verification
AssigneeInternational Business Machines Corporation
InventorPraveen Jayachandran
Life of this patent
Estimating the term…
Abstract
An example operation may include one or more of receiving, from a blockchain peer node, a sequence of blocks stored in a hash-linked chain of blocks on a distributed ledger, where each block in the sequence of blocks includes a reduced-step hash of block content from a previous block in the sequence, performing an approximate hash verification on the reduced-step hashes stored among the sequence of blocks, and determining whether the sequence of blocks has been tampered with based on the approximate hash verification on the reduced-step hashes.
Claims17
A computing system comprising:
- a network interface configured to receive, from a blockchain peer node, a sequence of blocks stored in a hash-linked chain of blocks on a distributed ledger, where each block in the sequence of blocks is linked to a previous block in the sequence via execution of a reduced-step hash operation on a header of block content from the previous block in the sequence in comparison to a full-step hash verification which uses more hash operations;
- and
- a processor configured to perform an approximate hash verification on the reduced-step hashes stored among the sequence of blocks, and determine whether the sequence of blocks has been tampered with based on the approximate hash verification.
A method comprising:
- receiving, from a blockchain peer node, a sequence of blocks stored in a hash-linked chain of blocks on a distributed ledger, where each block in the sequence of blocks is linked to a previous block in the sequence via execution of a reduced-step hash operation on a header of block content from the previous block in the sequence in comparison to a full-step hash verification which uses more hash operations;
- performing an approximate hash verification on the reduced-step hashes stored among the sequence of blocks;
- and
- determining whether the sequence of blocks has been tampered with based on the approximate hash verification.
A non-transitory computer readable medium comprising instructions, that when read by a processor, cause the processor to perform a method comprising:
- receiving, from a blockchain peer node, a sequence of blocks stored in a hash-linked chain of blocks on a distributed ledger, where each block in the sequence of blocks is linked to a previous block in the sequence via execution of a reduced-step hash operation on a header of block content from the previous block in the sequence in comparison to a full-step hash verification which uses more hash operations;
- performing an approximate hash verification on the reduced-step hashes stored among the sequence of blocks;
- and
- determining whether the sequence of blocks has been tampered with based on the approximate hash verification.
A computing system comprising:
- a storage device configured to store a hash-linked sequence of blocks via a blockchain ledger, wherein each block in the sequence of blocks is linked to a previous block in the sequence via execution of a reduced-step hash operation on a header of block content from the previous block in the sequence in comparison to a full-step hash verification which uses more hash operations;
- and
- a processor configured to receive a request from a failed peer node for a sequence of blocks from among the stored hash-linked chain of blocks, and transmit the sequence of blocks which are linked together via reduced-step hash content to the failed peer node.
Dependencies are inferred from the claim text.