Module 1-Inputs.Transition_frontier

The transition frontier is the data structure for tracking active forks * at the "frontier" of the blockchain being constructed by the network. * It includes support for extensions (incremental views on top of this * data structure), persistence (saving/loading the data structure * to/from disk), and various queries.

module Breadcrumb = Frontier_base.Breadcrumb
module Diff = Frontier_base.Diff
module Extensions = Extensions
module Persistent_root = Persistent_root
module Persistent_frontier = Persistent_frontier
module Root_data = Frontier_base.Root_data
module Catchup_tree = Transition_frontier.Catchup_tree
module Full_catchup_tree = Transition_frontier.Full_catchup_tree
module Catchup_hash_tree = Transition_frontier.Catchup_hash_tree
module type CONTEXT = sig ... end
include Frontier_base.Frontier_intf.S
type t
val max_length : t -> int
val consensus_local_state : t -> Consensus.Data.Local_state.t
val all_breadcrumbs : t -> Frontier_base.Breadcrumb.t list
val root_length : t -> int
val best_tip : t -> Frontier_base.Breadcrumb.t
val best_tip_path : ?max_length:int -> t -> Frontier_base.Breadcrumb.t list
val path_map : ?max_length:int -> t -> Frontier_base.Breadcrumb.t -> f:( Frontier_base.Breadcrumb.t -> 'a ) -> 'a list
val find_protocol_state : t -> Mina_base.State_hash.t -> Mina_state.Protocol_state.value option
val successor_hashes : t -> Mina_base.State_hash.t -> Mina_base.State_hash.t list
val successor_hashes_rec : t -> Mina_base.State_hash.t -> Mina_base.State_hash.t list
val iter : t -> f:( Frontier_base.Breadcrumb.t -> unit ) -> unit
val best_tip_path_length_exn : t -> int
val visualize_to_string : t -> string
val visualize : filename:string -> t -> unit
val precomputed_values : t -> Precomputed_values.t
val genesis_constants : t -> Genesis_constants.t
type Structured_log_events.t +=
| Added_breadcrumb_user_commands
val added_breadcrumb_user_commands_structured_events_id : Structured_log_events.id
val added_breadcrumb_user_commands_structured_events_repr : Structured_log_events.repr
type Structured_log_events.t +=
| Applying_diffs of {
diffs : Yojson.Safe.t list;
}
val applying_diffs_structured_events_id : Structured_log_events.id
val applying_diffs_structured_events_repr : Structured_log_events.repr
type Structured_log_events.t +=
| Persisted_frontier_loaded
val persisted_frontier_loaded_structured_events_id : Structured_log_events.id
val persisted_frontier_loaded_structured_events_repr : Structured_log_events.repr
val max_catchup_chunk_length : int
val catchup_tree : t -> Catchup_tree.t
val global_max_length : Genesis_constants.t -> int
val load : ?retry_with_fresh_db:bool -> context:(module CONTEXT) -> verifier:Verifier.t -> consensus_local_state:Consensus.Data.Local_state.t -> persistent_root:Persistent_root.t -> persistent_frontier:Persistent_frontier.t -> catchup_mode:[ `Normal | `Super ] -> unit -> ( t, [ `Failure of string | `Bootstrap_required | `Persistent_frontier_malformed | `Snarked_ledger_mismatch ] ) Async_kernel.Deferred.Result.t
val close : loc:string -> t -> unit Async_kernel.Deferred.t
val closed : t -> unit Async_kernel.Deferred.t
val add_breadcrumb_exn : t -> Breadcrumb.t -> unit Async_kernel.Deferred.t
val persistent_root : t -> Persistent_root.t
val persistent_frontier : t -> Persistent_frontier.t
val root_snarked_ledger : t -> Mina_ledger.Ledger.Db.t
val extensions : t -> Extensions.t
val genesis_state_hash : t -> Mina_base.State_hash.t
val rejected_blocks : (Mina_base.State_hash.t * Network_peer.Envelope.Sender.t * Block_time.t * [ `Invalid_proof | `Invalid_delta_transition_chain_proof | `Too_early | `Too_late | `Invalid_genesis_protocol_state | `Invalid_protocol_version | `Mismatched_protocol_version ]) Core.Queue.t
val validated_blocks : (Mina_base.State_hash.t * Network_peer.Envelope.Sender.t * Block_time.t) Core.Queue.t
module For_tests : sig ... end