Proof
Last updated
Last updated
The round to which the light block header belongs.
Proof of a light block header.
The index of the light block header in the vector commitment tree
The encoded proof.
^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$
Represents the depth of the tree that is being proven, i.e. the number of edges from a leaf to the root.