package octez-libs
Install
Dune Dependency
Authors
Maintainers
Sources
sha256=c6df840ebbf115e454db949028c595bec558a59a66cade73b52a6d099d6fa4d4
sha512=d8aee903b9fe130d73176bc8ec38b78c9ff65317da3cb4f3415f09af0c625b4384e7498201fdb61aa39086a7d5d409d0ab3423f9bc3ab989a680cf444a79bc13
doc/tezos_context_disk/Tezos_context_disk/Context_binary/Proof/Stream/index.html
Module Proof.Stream
Stream proofs represent an explicit traversal of a Merle tree proof. Every element (a node, a value, or a shallow pointer) met is first "compressed" by shallowing its children and then recorded in the proof.
As stream proofs directly encode the recursive construction of the Merkle root hash is slightly simpler to implement: verifier simply need to hash the compressed elements lazily, without any memory or choice.
Moreover, the minimality of stream proofs is trivial to check. Once the computation has consumed the compressed elements required, it is sufficient to check that no more compressed elements remain in the proof.
However, as the compressed elements contain all the hashes of their shallow children, the size of stream proofs is larger (at least double in size in practice) than tree proofs, which only contains the hash for intermediate shallow pointers.
type elt = | Value of bytes| Node of (string * [ `Value of Tezos_base.TzPervasives.Context_hash.t | `Node of Tezos_base.TzPervasives.Context_hash.t ]) list| Inode of Tezos_base.TzPervasives.Context_hash.t Tezos_context_sigs__Context.Proof_types.inode| Inode_extender of Tezos_base.TzPervasives.Context_hash.t Tezos_context_sigs__Context.Proof_types.inode_extender
The type for elements of stream proofs.
Value v is a proof that the next element read in the store is the value v.
Node n is a proof that the next element read in the store is the node n.
Inode i is a proof that the next element read in the store is the inode i.
Inode_extender e is a proof that the next element read in the store is the node extender e.
type t = unit -> elt Tezos_base.TzPervasives.Seq.nodeThe type for stream proofs.
The sequence e_1 ... e_n proves that the e_1, ..., e_n are read in the store in sequence.