4127e96082
After replacing `quickcheck` with `proptest` in `zcash_history`, memory consumption of the property tests grew substantially as a consequence of sample generation exploring the upper bounds of sample ranges; previously, the large operation counts would have occurred only with low probability. However, the correctness of the operations on the `Tree` data structure should not depend upon the tree size, so it's fine to reduce the number of operations in order to bound the memory consumption. As the documentation on `Tree` notes, this data structure is not intended to be used stand-alone because doing so may result in unbounded memory use; the property tests were doing exactly this and so were producing this exact pathological memory behavior. |
||
|---|---|---|
| .. | ||
| examples | ||
| src | ||
| .gitignore | ||
| CHANGELOG.md | ||
| COPYRIGHT | ||
| Cargo.toml | ||
| LICENSE-APACHE | ||
| LICENSE-MIT | ||
| README.md | ||
README.md
zcash_history
Special implementation of Merkle mountain ranges (MMR) for Zcash!
The main design goals of this MMR implementation are
-
Allow zero-cache and avoid db callbacks. As it is implemented, calling side must just smartly pre-load MMR nodes from the database (about log2(tree length) for append, twice as much for deletion).
-
Reuse as much logic between rust and c++ clients and place it here and librustzcash.
-
Close to zero memory consumption.
License
zcash_history is distributed under the terms of both the MIT
license and the Apache License (Version 2.0), at your choice.
See LICENSE-APACHE, and LICENSE-MIT for details.
Contribution
Unless you explicitly state otherwise, any contribution intentionally submitted
for inclusion in zcash_history by you, as defined in the Apache-2.0 license, shall be
dual licensed as above, without any additional terms or conditions.