Class CompactDeepSparseMerkleSubTree<K, V>

This is used to compute new roots for state transitions based on sideNodes.

Type Parameters

  • K

  • V

Hierarchy

Constructors

Properties

config: {
    hashKey: boolean;
    hashValue: boolean;
}

Type declaration

  • hashKey: boolean
  • hashValue: boolean
keyType: Provable<K>
root: Field
store: Store<V>
th: TreeHasher<K, V>
valueType: Provable<V>

Methods

  • Update a new value for a key in the tree and return the new root of the tree.

    Returns

    {Promise}

    Memberof

    CompactSparseMerkleTree

    Parameters

    • key: K
    • Optional value: V

    Returns Promise<Field>

  • Update multiple leaves and return the new root of the tree.

    Returns

    {Promise}

    Memberof

    CompactSparseMerkleTree

    Parameters

    • kvs: {
          key: K;
          value?: V;
      }[]

    Returns Promise<Field>

  • Import a compacted sparse merkle tree

    Static

    Returns

    {Promise<CompactSparseMerkleTree<K, V>>}

    Memberof

    CompactSparseMerkleTree

    Type Parameters

    • K

    • V

    Parameters

    • store: Store<V>
    • keyType: Provable<K>
    • valueType: Provable<V>
    • Optional options: {
          hashKey?: boolean;
          hashValue?: boolean;
          hasher?: Hasher;
      } = ...
      • Optional hashKey?: boolean
      • Optional hashValue?: boolean
      • Optional hasher?: Hasher

    Returns Promise<CompactSparseMerkleTree<K, V>>

Generated using TypeDoc