1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
Source: tendermint-go-merkle
Section: devel
Priority: extra
Maintainer: Debian Go Packaging Team <pkg-go-maintainers@lists.alioth.debian.org>
Uploaders:
Alessio Treglia <alessio@debian.org>
Build-Depends:
debhelper (>= 9),
dh-golang,
golang-any,
golang-github-tendermint-go-common-dev,
golang-github-tendermint-go-db-dev,
golang-github-tendermint-go-wire-dev,
golang-golang-x-crypto-dev
Standards-Version: 3.9.8
Homepage: https://github.com/tendermint/go-merkle
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-go/packages/tendermint-go-merkle.git
Vcs-Git: https://anonscm.debian.org/git/pkg-go/packages/tendermint-go-merkle.git
XS-Go-Import-Path: github.com/tendermint/go-merkle
Package: golang-github-tendermint-go-merkle-dev
Architecture: all
Depends:
golang-github-tendermint-go-common-dev,
golang-github-tendermint-go-db-dev,
golang-github-tendermint-go-wire-dev,
golang-golang-x-crypto-dev,
${misc:Depends},
${shlibs:Depends}
Description: Merkle-ized data structures with proofs
This package provides two types of merkle trees:
* IAVL+ Tree: A snapshottable (immutable) AVL+ tree for persistent
data
* A simple merkle tree for static dataIAVL+ tree; the purpose of
this data structure is to provide persistent storage for
key-value pairs (say to store account balances) such that a
deterministic merkle root hash can be computed. The tree is
balanced using a variant of the AVL algortihm so that all
operations are O(log(n)).
.
This package provides a library used by Tendermint Core.
.
Tendermint Core is Byzantine Fault Tolerant (BFT) middleware
that takes a state transition machine, written in any
programming language, and replicates it on many machines.
|
