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.2.0.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 | aeson, base (>=4.10 && <5), base16-bytestring, bloomfilter, BoundedChan, bytestring, cmdargs, conduit, containers, cryptohash-sha256, data-default-class, deepseq, dfinity-radix-tree, ghc-prim, lens-simple, leveldb-haskell, lrucaching, mtl, resourcet, semigroups, serialise, text, unordered-containers [details] |
License | GPL-3.0-only |
Copyright | 2018 DFINITY Stiftung |
Author | Enzo Haussecker <enzo@dfinity.org> |
Maintainer | DFINITY USA Research <team@dfinity.org> |
Category | Blockchain, DFINITY, Database |
Home page | https://github.com/dfinity-lab/hs-radix-tree |
Bug tracker | https://github.com/dfinity-lab/hs-radix-tree/issues |
Uploaded | by EnzoHaussecker at 2018-07-22T04:53:06Z |
Distributions | |
Executables | dfinity-radix-tree-benchmarks, dfinity-radix-tree-unit-tests |
Downloads | 8123 total (38 in the last 30 days) |
Rating | 2.0 (votes: 1) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2018-07-22 [all 1 reports] |