A hash tree or Merkle tree is a tree in which every non-leaf node is labelled with the hash of the labels or values (in case of leaves) of its child nodes. Hash trees are useful because they allow efficient and secure verification of the contents of large data structures.
Current section
11 Versions
Jump to
Current section
11 Versions
Versions
January 30, 2020
April 19, 2019
April 18, 2019
March 06, 2019
March 06, 2019
February 19, 2018
January 27, 2018
October 01, 2017
May 24, 2016
May 20, 2016
May 19, 2016
| Version | Publish Date | Note | Actions |
|---|---|---|---|
| 2.0.0 | January 30, 2020 |
|
|
| 1.6.1 | April 19, 2019 |
|
|
| 1.6.0 | April 18, 2019 |
|
|
| 1.5.0 | March 06, 2019 |
|
|
| 1.4.0 | March 06, 2019 |
|
|
| 1.3.0 | February 19, 2018 |
|
|
| 1.2.1 | January 27, 2018 |
|
|
| 1.2.0 | October 01, 2017 |
|
|
| 1.1.1 | May 24, 2016 |
|
|
| 1.1.0 | May 20, 2016 |
|
|
| 1.0.0 | May 19, 2016 |
|
