merkel

v1.0.0

  • Pages
  • Modules

    merkel v1.0.0 Merkel

    Essentially a driver module but allows for the decoupled addition of e.g. new tree types and/or other proof types.

    Link to this section Summary

    Functions

    audit(t, key)
    delete(t, key)
    insert(t, arg)
    keys(t)
    lookup(t, key)
    new()
    new(list)
    size(t)
    tree_hash(t)
    verify(proof, root_hash)

    Link to this section Functions

    Link to this function audit(t, key)
    audit(Merkel.BinaryHashTree.t(), Merkel.BinaryHashTree.key()) ::
      Merkel.Audit.t()
    Link to this function delete(t, key)
    delete(Merkel.BinaryHashTree.t(), Merkel.BinaryHashTree.key()) ::
      Merkel.BinaryHashTree.t()
    Link to this function insert(t, arg)
    insert(Merkel.BinaryHashTree.t(), Merkel.BinaryHashTree.pair()) ::
      Merkel.BinaryHashTree.t()
    Link to this function keys(t)
    keys(Merkel.BinaryHashTree.t()) :: list()
    Link to this function lookup(t, key)
    lookup(Merkel.BinaryHashTree.t(), Merkel.BinaryHashTree.key()) :: tuple()
    Link to this function new()
    Link to this function new(list)
    new(none() | [tuple()]) :: Merkel.BinaryHashTree.t()
    Link to this function size(t)
    size(Merkel.BinaryHashTree.t()) :: non_neg_integer()
    Link to this function tree_hash(t)
    tree_hash(Merkel.BinaryHashTree.t()) :: String.t()
    Link to this function verify(proof, root_hash)
    verify(Merkel.Audit.t(), String.t()) :: boolean()

    Built using ExDoc (v0.18.2), designed by Friedel Ziegelmayer.