maphasher

package

v1.2.1 Latest Latest Go to latest Published: Aug 16, 2018 License: Apache-2.0 Imports: 5 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/bartle-stripe/trillian

Links

Open Source Insights

Documentation ¶

Overview ¶

Package maphasher provides hashing for maps.

Index ¶

Variables
func New(h crypto.Hash) hashers.MapHasher
type MapHasher

Constants ¶

This section is empty.

Variables ¶

View Source

var Default = New(crypto.SHA256)

Default is a SHA256 based MapHasher for maps.

Functions ¶

func New ¶

func New(h crypto.Hash) hashers.MapHasher

New creates a new merkle.MapHasher using the passed in hash function.

Types ¶

type MapHasher ¶

type MapHasher struct {
	crypto.Hash
	// contains filtered or unexported fields
}

MapHasher implements a sparse merkle tree hashing algorithm. For testing only. It matches the test vectors generated by other sparse map implementations, but it does not offer the full N bit security of the underlying hash function.

func (*MapHasher) BitLen ¶

func (m *MapHasher) BitLen() int

BitLen returns the number of bits in the hash function.

func (*MapHasher) HashChildren ¶

func (m *MapHasher) HashChildren(l, r []byte) []byte

HashChildren returns the internal Merkle tree node hash of the the two child nodes l and r. The hashed structure is NodeHashPrefix||l||r.

func (*MapHasher) HashEmpty ¶

func (m *MapHasher) HashEmpty(treeID int64, index []byte, height int) []byte

HashEmpty returns the hash of an empty branch at a given depth. A depth of 0 indicates the hash of an empty leaf. Empty branches within the tree are plain interior nodes e1 = H(e0, e0) etc.

func (*MapHasher) HashLeaf ¶

func (m *MapHasher) HashLeaf(treeID int64, index []byte, leaf []byte) ([]byte, error)

HashLeaf returns the Merkle tree leaf hash of the data passed in through leaf. The hashed structure is leafHashPrefix||leaf.

func (*MapHasher) String ¶

func (m *MapHasher) String() string

String returns a string representation for debugging.

Source Files ¶

View all Source files

maphasher.go

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL