CommitmentTree.Proof (Anoma v0.29.0)

I represent a compact proof that a particular element is contained within the commitment tree.

Summary

Types

@type t() :: %CommitmentTree.Proof{path: integer(), proof: tuple()}

Functions

Link to this function

new(path, proof)

@spec new(integer(), tuple()) :: t()
Link to this function

verify(spec, proof, anchor, commitment)

@spec verify(
  CommitmentTree.Spec.t(),
  t(),
  binary(),
  binary()
) :: boolean()
Link to this function

verifyx(spec, depth, path, proof, cm)

@spec verifyx(
  CommitmentTree.Spec.t(),
  integer(),
  integer(),
  tuple(),
  binary()
) :: {binary(), boolean()}