mtree

Documentation

Overview

Copyright IBM Corp. All Rights Reserved. SPDX-License-Identifier: Apache-2.0

Copyright IBM Corp. All Rights Reserved. SPDX-License-Identifier: Apache-2.0

Copyright IBM Corp. All Rights Reserved. SPDX-License-Identifier: Apache-2.0

Copyright IBM Corp. All Rights Reserved. SPDX-License-Identifier: Apache-2.0

Index

• type Node
  • func BuildTreeForBlockTx(block *types.Block) (*Node, error)
  • func (n *Node) Hash() []byte
  • func (n *Node) Left() *Node
  • func (n *Node) Proof(leafIndex int) ([][]byte, error)
  • func (n *Node) Right() *Node
  • func (n *Node) Sibling() *Node

Types

type Node

type Node struct {
	// contains filtered or unexported fields
}

Node struct keep data for Merkle tree node. For now, it is binary Merkle tree

func BuildTreeForBlockTx

func BuildTreeForBlockTx(block *types.Block) (*Node, error)

BuildTreeForBlockTx builds Merkle tree from block transactions.

func (*Node) Hash

func (n *Node) Hash() []byte

Hash returns node hash, for leaf node it is hash of associated data object, for not leaf - it calculated for children hashes

func (*Node) Left

func (n *Node) Left() *Node

Left returns left child node for node, if exists

func (*Node) Proof

func (n *Node) Proof(leafIndex int) ([][]byte, error)

Proof calculate intermediate hashes between leaf with given index and root (caller node)

func (*Node) Right

func (n *Node) Right() *Node

Right returns right child node for node, if exists

func (*Node) Sibling

func (n *Node) Sibling() *Node

Sibling returns node sibling - node that has same parent as caller, if exists.