BLOCKCHAIN VERIFICATION USING NON-CONSECUTIVE BLOCKS
An example operation may include one or more of receiving a request to store a data block on a hash-linked chain of data blocks, dynamically selecting a subset of non-consecutive data blocks which have been previously stored within the hash-linked chain of data blocks, generating a linking hash base...
Saved in:
Main Author | |
---|---|
Format | Patent |
Language | English |
Published |
03.12.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | An example operation may include one or more of receiving a request to store a data block on a hash-linked chain of data blocks, dynamically selecting a subset of non-consecutive data blocks which have been previously stored within the hash-linked chain of data blocks, generating a linking hash based on a hash value of the data block to be stored and an accumulation of hash values from the subset of non-consecutive data blocks, and adding the data block to the hash-linked chain of data blocks, wherein the added data block includes the linking hash stored therein. |
---|---|
Bibliography: | Application Number: US201916429723 |