Anton Kaliaev d470945503 | 6 years ago | |
---|---|---|
.. | ||
README.md | 7 years ago | |
compile.sh | 6 years ago | |
doc.go | 6 years ago | |
hash.go | 6 years ago | |
merkle.pb.go | 6 years ago | |
merkle.proto | 6 years ago | |
proof.go | 6 years ago | |
proof_key_path.go | 6 years ago | |
proof_key_path_test.go | 6 years ago | |
proof_simple_value.go | 6 years ago | |
proof_test.go | 6 years ago | |
rfc6962_test.go | 6 years ago | |
simple_map.go | 6 years ago | |
simple_map_test.go | 6 years ago | |
simple_proof.go | 6 years ago | |
simple_tree.go | 6 years ago | |
simple_tree_test.go | 6 years ago | |
types.go | 6 years ago | |
wire.go | 6 years ago |
For smaller static data structures that don't require immutable snapshots or mutability; for instance the transactions and validation signatures of a block can be hashed using this simple merkle tree logic.