Merkle proof
Hashed only nodes are represented by Hash h.
module Tree : sig ... endProof tree packed with the paths proven in it
val encoding : Context.t -> t Data_encoding.tEncoding of t. The Disk nodes are loaded from ctxt on demand.
val pp : Stdlib.Format.formatter -> t -> unitval make :
Context.t ->
Node_type.t ->
Path.t list ->
t * (Path.t * Node_type.t option) listmake ctxt n paths returns the packed Merkle proof of paths of node n under context ctxt and the nodes found (or not found) at paths.
The proof may contain Disk nodes which require ctxt to be loaded. Use encoding to load all the nodes
n must point to a Bud, otherwise the function fails.val check : Hash.Hasher.t -> t -> Hash.t * (Path.t * Node_type.t option) listcheck hasher t returns the top Merkle hash of the proof tree of t and returns the nodes found at the t.paths.
It may raise Invalid_argument when t contains Disk nodes.