CommitmentTree (Anoma v0.29.0)

A simple commitment tree.

Currently stores all commitments forever, and stores the full tree in memory, pending future more sophisticated retention policies. Does not yet store any anchors itself for the same reason--this is a complex policy level decision.

Has a fixed depth.

Fiats that empty subtrees have a hash of 0 for simplicity.

Summary

Types

t()

Functions

add(tree, cms)

Adds commitments to the commitment tree, and returns the new tree and the anchor. TODO handle the tree's filling up

init_storage(mnesia_table)
new(spec, table)

Creates a new CommitmentTree struct.

prove(tree, i)

Types

Link to this type

t()

@type t() :: %CommitmentTree{
  root: CommitmentTree.Node.t(),
  size: integer(),
  spec: CommitmentTree.Spec.t(),
  table: term()
}

Functions

Link to this function

add(tree, cms)

@spec add(t(), [binary()]) :: tuple()

Adds commitments to the commitment tree, and returns the new tree and the anchor. TODO handle the tree's filling up

Link to this function

init_storage(mnesia_table)

@spec init_storage(atom()) :: {:atomic, :ok} | {:aborted, reason :: term()}
Link to this function

new(spec, table)

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

Creates a new CommitmentTree struct.

Link to this function

prove(tree, i)

@spec prove(t(), integer()) :: CommitmentTree.Proof.t()