The type for compressed and partial Merkle tree proofs.
Tree proofs do not provide any guarantee with the ordering of computations. For instance, if two effects commute, they won't be distinguishable by this kind of proofs.
Blinded_node h
is a shallow pointer to a node having hash h
.
Node ls
is a "flat" node containing the list of files ls
. The length of ls
depends on the backend. For instance, it can be unbounded for most of the backends, while it is at most Conf.stable_hash
entries for irmin-pack
.
Inode i
is an optimized representation of a node as a tree. Pointers in that trees would refer to blinded nodes, nodes or to other inodes. E.g. Blinded content nor contents is not expected to appear directly in an inodes.
Blinded_contents (h, m)
is a shallow pointer to contents having hash h
and metadata m
.
Contents c
is the contents c
.