coniks

package

v1.6.0 Latest Latest Go to latest Published: Jan 11, 2024 License: Apache-2.0 Imports: 6 Imported by: 49

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

Package coniks provides CONIKS hashing for maps.

This section is empty.

View Source

var (

	// Default is the standard CONIKS hasher.
	Default = New(crypto.SHA512_256)
)

Domain separation prefixes

This section is empty.

type Hasher struct {
	crypto.Hash
}

Hasher implements the sparse merkle tree hashing algorithm specified in the CONIKS paper.

func New(h crypto.Hash) *Hasher

New creates a new hashers.TreeHasher using the passed in hash function.

func (m *Hasher) BitLen() int

BitLen returns the number of bits in the hash function.

func (m *Hasher) EmptyRoot() []byte

EmptyRoot returns the root of an empty tree.

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

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

func (m *Hasher) HashEmpty(treeID int64, root node.ID) []byte

HashEmpty returns the hash of an empty subtree with the given root.

func (m *Hasher) HashLeaf(treeID int64, id node.ID, leaf []byte) []byte

HashLeaf calculate the merkle tree leaf value: H(Identifier || treeID || depth || index || dataHash)