imt

Documentation

Overview

Package imt provides an Incremental Merkle Tree

Index

• Constants
• func BranchRoot(item []byte, branch [TreeDepth][]byte, index uint32) ([]byte, error)
• func ZeroHashes() [][]byte
• type Tree
  • func InitializeTree(branch [][]byte, count uint32) *Tree
  • func (t *Tree) Count() uint32
  • func (t *Tree) GetProofForNextIndex() (proof [TreeDepth][32]byte)
  • func (t *Tree) Insert(node []byte) error
  • func (t *Tree) Print()
  • func (t *Tree) Root() []byte
  • func (t *Tree) RootWithContext(zeroes [][]byte) []byte
  • func (t *Tree) SetCount(count uint32)

Constants

const (
	TreeDepth = 32
	MaxLeaves = ^uint32(0)
)

Functions

func BranchRoot

func BranchRoot(item []byte, branch [TreeDepth][]byte, index uint32) ([]byte, error)

BranchRoot calculates and returns the merkle root for the given leaf item, a merkle branch, and the index of item in the tree

func ZeroHashes

func ZeroHashes() [][]byte

ZeroHashes returns the array of TreeDepth zero hashes

Types

type Tree

type Tree struct {
	Branch [TreeDepth][]byte
	// contains filtered or unexported fields
}

func InitializeTree

func InitializeTree(branch [][]byte, count uint32) *Tree

func (*Tree) Count

func (t *Tree) Count() uint32

Count returns the number of inserts performed on the Tree

func (*Tree) GetProofForNextIndex

func (t *Tree) GetProofForNextIndex() (proof [TreeDepth][32]byte)

GetProofForNextIndex returns the proof for the next index.

func (*Tree) Insert

func (t *Tree) Insert(node []byte) error

Insert inserts node into the Merkle Tree

func (*Tree) Print

func (t *Tree) Print()

Print dumps the tree (for debugging)

func (*Tree) Root

func (t *Tree) Root() []byte

Root calculates and returns Tree's current root

func (*Tree) RootWithContext

func (t *Tree) RootWithContext(zeroes [][]byte) []byte

RootWithCtx calculates and returns Tree's current root given array of zeroes

func (*Tree) SetCount

func (t *Tree) SetCount(count uint32)

Set the count . (Used when restoring from genesis state)