package plebeia

  1. Overview
  2. Docs

1 Plebeia

Implementation of space-efficient binary Patricia trees in OCaml. The implementation is geared for used in Tezos, though it is rather generic. A stop-and-copy GC is provided. This implementation aims to maximize correctness and cares second about efficiency.

module Internal : sig ... end

2 Internal implementation

2 Standard APIs, module interfaces are restricted.

Base

module Error : module type of struct include Error end

1 Open type for error descriptions

module Result : module type of struct include Result end

1 Result monad

module Value : module type of struct include Value end

Module encapsulating the values inserted in the Patricia tree.

Core

module Segment : sig ... end

A segment represents a path from the root of a tree to a leaf or to the root of a sub-tree.

Hash

module Hash : module type of Hash

1 The first half 224bit/28byte part of node hash.

High level

module Hashcons : sig ... end
module Vc : module type of struct include Vc end
module Roots : module type of struct include Roots end

1 Root hash table

Helper

module Stat : sig ... end

Experimental

module Merkle_proof : module type of struct include Merkle_proof end

Calculate Merckle Proofs

OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct