leanbridgetree 0.3.0

Space-efficient Merkle tree designed for linear appends with witnessing of marked leaves.
Documentation 
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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67

[[bench]]
harness = false
name = "leanbridgetree"
path = "benches/leanbridgetree.rs"

[dependencies.borsh]
default-features = false
optional = true
version = "1.5.7"

[dependencies.incrementalmerkletree]
default-features = false
version = "0.8"

[dependencies.proptest]
optional = true
version = "1"

[dependencies.slab]
default-features = false
version = "0.4.10"

[dependencies.thiserror]
optional = true
version = "2.0.12"

[dev-dependencies.bridgetree]
version = "0.7.0"

[dev-dependencies.criterion]
features = ["html_reports"]
version = "0.5"

[dev-dependencies.incrementalmerkletree-testing]
version = "=0.2.0-backcompat.0.8"

[dev-dependencies.proptest]
version = "1"

[features]
borsh = ["dep:borsh"]
default = ["std", "display-error"]
display-error = ["dep:thiserror"]
std = ["thiserror/std", "slab/std", "borsh/std"]
test-dependencies = ["proptest", "incrementalmerkletree/test-dependencies"]

[lib]
name = "leanbridgetree"
path = "src/lib.rs"

[package]
authors = ["Kris Nuttycombe <kris@nutty.land>", "Sean Bowe <ewillbefull@gmail.com>", "Heliax AG <hello@heliax.dev>"]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
categories = ["algorithms", "data-structures"]
description = "Space-efficient Merkle tree designed for linear appends with witnessing of marked leaves."
edition = "2024"
homepage = "https://github.com/namada-net/leanbridgetree"
license = "MIT OR Apache-2.0"
name = "leanbridgetree"
readme = "README.md"
repository = "https://github.com/namada-net/leanbridgetree"
version = "0.3.0"