From 83000940dae4f7be6fe8f11fc0fafc3753398808 Mon Sep 17 00:00:00 2001 From: Bobbin Threadbare Date: Thu, 19 Oct 2023 12:22:07 -0700 Subject: [PATCH] chore: update main readme --- CHANGELOG.md | 5 ++++- README.md | 1 + 2 files changed, 5 insertions(+), 1 deletion(-) diff --git a/CHANGELOG.md b/CHANGELOG.md index 356099c..67e7568 100644 --- a/CHANGELOG.md +++ b/CHANGELOG.md @@ -1,3 +1,7 @@ +## 0.8.0 (TBD) + +* Implemented the `PartialMmr` data structure (#195). + ## 0.7.1 (2023-10-10) * Fixed RPO Falcon signature build on Windows. @@ -12,7 +16,6 @@ * Implemented benchmarking for `TieredSmt` (#182). * Added more leaf traversal methods for `MerkleStore` (#185). * Added SVE acceleration for RPO hash function (#189). -* Implemented the `PartialMmr` datastructure (#195). ## 0.6.0 (2023-06-25) diff --git a/README.md b/README.md index 7ec16b2..4f4a492 100644 --- a/README.md +++ b/README.md @@ -16,6 +16,7 @@ For performance benchmarks of these hash functions and their comparison to other * `MerkleTree`: a regular fully-balanced binary Merkle tree. The depth of this tree can be at most 64. * `Mmr`: a Merkle mountain range structure designed to function as an append-only log. * `PartialMerkleTree`: a partial view of a Merkle tree where some sub-trees may not be known. This is similar to a collection of Merkle paths all resolving to the same root. The length of the paths can be at most 64. +* `PartialMmr`: a partial view of a Merkle mountain range structure. * `SimpleSmt`: a Sparse Merkle Tree (with no compaction), mapping 64-bit keys to 4-element values. * `TieredSmt`: a Sparse Merkle tree (with compaction), mapping 4-element keys to 4-element values.