tendermint

mirrors/tendermint

Fork 0

mirror of https://github.com/tendermint/tendermint.git synced 2026-09-07 08:37:01 +00:00

Files

T

History

Jae KwonandAnton Kaliaev 580c3db8f9 Hashable -> Hasher; SimpleMap upgrade; No "SimpleHashFromBinary" (#128 )

* Update SimpleMap to hash both keys and values for benefit; Hashable is Hasher; Don't assume go-wire

2018-02-02 12:51:30 +04:00

README.md

simple merkle tree

2017-04-21 15:33:25 -04:00

simple_map_test.go

Hashable -> Hasher; SimpleMap upgrade; No "SimpleHashFromBinary" (#128 )

2018-02-02 12:51:30 +04:00

simple_map.go

Hashable -> Hasher; SimpleMap upgrade; No "SimpleHashFromBinary" (#128 )

2018-02-02 12:51:30 +04:00

simple_proof.go

Hashable -> Hasher; SimpleMap upgrade; No "SimpleHashFromBinary" (#128 )

2018-02-02 12:51:30 +04:00

simple_tree_test.go

Hashable -> Hasher; SimpleMap upgrade; No "SimpleHashFromBinary" (#128 )

2018-02-02 12:51:30 +04:00

simple_tree.go

Hashable -> Hasher; SimpleMap upgrade; No "SimpleHashFromBinary" (#128 )

2018-02-02 12:51:30 +04:00

types.go

Hashable -> Hasher; SimpleMap upgrade; No "SimpleHashFromBinary" (#128 )

2018-02-02 12:51:30 +04:00

README.md

Simple Merkle Tree

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.