1. Home

Merkle tree wiki

General

A hash tree, also known as a Merkle tree, is a tree in which each leaf node is labeled with the cryptographic hash of a data block, and each non-leaf, or branch, node is labeled with the cryptographic hash of its child nodes' labels.

This Merkel tree function allows the user to specify certain behaviors.

Options available:

Choose encoding algorithm Specify tree creation and Unbalanced tree process type Initial branch encoding option This functionality will deliver the Merkle tree root hash of a data collection in the form of a slice of bytes ([][]byte)

Named after Ralph Merkle.