Summary

Types

t()

Creates a new internal node. Children is a tuple of size spec.splay, each element of which is either a binary or another node.

new_empty(spec)

Creates a new internal node, all children of which are empty.

Produces a proof for leaf #cursor of node, taking the form of a nested tuple, as described in proof.ex

@type t() :: %CommitmentTree.Node{children: tuple(), hash: binary()}

@spec from_noun(Noun.t()) :: {:ok, t()} | :error

@spec new(CommitmentTree.Spec.t(), tuple()) :: t()

Creates a new internal node. Children is a tuple of size spec.splay, each element of which is either a binary or another node.

@spec new_empty(CommitmentTree.Spec.t()) :: t()

Creates a new internal node, all children of which are empty.

@spec prove(CommitmentTree.Spec.t(), t(), integer()) :: tuple()

Produces a proof for leaf #cursor of node, taking the form of a nested tuple, as described in proof.ex