Browse Prior Art Database

Two-level hash tree for fast block verification

IP.com Disclosure Number: IPCOM000253151D
Publication Date: 2018-Mar-08
Document File: 2 page(s) / 46K

Publishing Venue

The IP.com Prior Art Database

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 78% of the total text.

Two-level hash tree for fast block verification

Blockchain platforms store committed transactions using a sequence of blocks. Each block can contain several transactions, and the reason for the grouping is based on the time required to reach a consensus in a decentralized way. Each block is linked to the previous using an associated hash. The data structure is usually split into a block header and the actual data (i.e., transactions). The block header just containing the root of a hash tree (a.k.a., Merkle tree), is calculated from the transactions included in the block and the hash of the previous block. A Nonce calculator is used when Proof of Work is used, and a timestamp may be included.

The hash tree calculated from the transactions enables the creation of the block header. Storing the root of the tree enables verification of whether a given transaction was included in a block. Block headers can be verified by means of signatures (permissioned blockchain), but this kind of verification is not useful for verifying the validity of the sequence of blocks; it cannot be used to verify block N is before block N+k in the sequence of blocks.

The novel contribution is a method to apply a two-level hash tree for fast block verification.

Figure: Novel solution

In the very same way transactions are validated by means of the hash tree generated from transactions, block can be validated by the hash tree generated from the blocks.

The hash tree of the upper level is increasingly creat...