plebeia

Functional storage using Merkle Patricia tree
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library plebeia
Module Plebeia . Fs . Make . Merkle_proof
type detail = Path.t * Segment.segment list * Node_type.node option
val encoding : Vc.t -> t Data_encoding.t
val pp : Stdlib.Format.formatter -> t -> unit
val make : Path.t list -> (t * detail list) Op.t

Build a Merkle proof of the given paths under the current cursor. It also returns the objects at the paths.

val check : Vc.t -> t -> ( Hash.Prefix.t * detail list, Error.t ) Stdlib.result

Compute the top hash of the given Merkle proof. It also returns the objects at the paths attached with the proof.