dfinity-radix-tree: A generic data integrity layer.
This library allows you to construct a Merkle tree on top of any underlying key–value database. It works by organizing your key–value pairs into a binary radix tree, which is well suited for storing large dictionaries of fairly random keys, and is optimized for storing keys of the same length.
[Skip to Readme]
Downloads
- dfinity-radix-tree-0.6.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Versions [RSS] | 0.0.0, 0.1.0, 0.1.1, 0.2.0, 0.2.1, 0.3.0, 0.3.1, 0.4.0, 0.5.0, 0.5.1, 0.5.2, 0.6.0, 0.6.1, 0.6.2, 0.6.3 |
---|---|
Change log | CHANGELOG.md |
Dependencies | base (>=4.10 && <5), base16-bytestring, BoundedChan, bytestring, concurrent-extra, conduit, containers, cryptonite, data-default-class, deepseq, dfinity-radix-tree, directory, dlist, hashtables, lens-simple, leveldb-haskell, lrucaching, memory, mtl, reducers, resourcet, serialise, temporary, transformers [details] |
License | BSD-3-Clause |
Copyright | 2018-2019 DFINITY Stiftung |
Author | Enzo Haussecker <enzo@dfinity.org>, Remy Goldschmidt <remy@dfinity.org>, Armando Ramirez <armando@dfinity.org> |
Maintainer | Enzo Haussecker <enzo@dfinity.org>, Remy Goldschmidt <remy@dfinity.org>, Armando Ramirez <armando@dfinity.org> |
Category | Blockchain, DFINITY, Database |
Home page | https://dfinity.org |
Uploaded | by EnzoHaussecker at 2019-03-14T07:50:50Z |
Distributions | |
Executables | dfinity-radix-tree-example |
Downloads | 8235 total (25 in the last 30 days) |
Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
Your Rating | |
Status | Docs not available [build log] All reported builds failed as of 2019-03-14 [all 2 reports] |