mirror of
https://github.com/tendermint/tendermint.git
synced 2026-09-20 23:14:37 +00:00
Cuong Manh LeandGitHub
a9fc0c32b2
So we can reduce pressure on runtime for checking that slice has enough capacity before appending.
31 lines
654 B
Go
31 lines
654 B
Go
package merkle
|
|
|
|
import (
|
|
"github.com/tendermint/tendermint/crypto/tmhash"
|
|
)
|
|
|
|
// TODO: make these have a large predefined capacity
|
|
var (
|
|
leafPrefix = []byte{0}
|
|
innerPrefix = []byte{1}
|
|
)
|
|
|
|
// returns tmhash(<empty>)
|
|
func emptyHash() []byte {
|
|
return tmhash.Sum([]byte{})
|
|
}
|
|
|
|
// returns tmhash(0x00 || leaf)
|
|
func leafHash(leaf []byte) []byte {
|
|
return tmhash.Sum(append(leafPrefix, leaf...))
|
|
}
|
|
|
|
// returns tmhash(0x01 || left || right)
|
|
func innerHash(left []byte, right []byte) []byte {
|
|
data := make([]byte, len(innerPrefix)+len(left)+len(right))
|
|
n := copy(data, innerPrefix)
|
|
n += copy(data[n:], left)
|
|
copy(data[n:], right)
|
|
return tmhash.Sum(data)
|
|
}
|