Module Tests.Coda_worker_testnet

module Api : sig ... end
val start_prefix_check : Logger.t -> (Coda_worker.Connection.t * 'a * 'b) Core.Array.t -> [< `Transition of int * ('c * 'd) ] Pipe_lib.Linear_pipe.Reader.t -> Api.t -> acceptable_delay:Core.Time.Span.t -> unit Async_kernel__Deferred.t

the prefix check keeps track of the "best path" for each worker. the best path being the list of state hashes from the root to the best tip. the check is satisfied as long as the paths are not disjoint, ie, overlap on some node (in the worst case, this will be the root).

the check will time out and fail if c-1 slots pass without a new block.

type user_cmd_status = {
snapshots : int option array;
passed_root : bool array;
result : unit Async.Ivar.t;
}
val start_payment_check : Logger.t -> [< `Root of int * Mina_lib.Root_diff.t ] Pipe_lib.Linear_pipe.Reader.t -> Api.t -> unit
val events : precomputed_values:Genesis_proof.Inputs.t -> (Coda_worker.Connection.t * Async.Process.t * Coda_worker.Input.t) Core.Array.t -> (int * Coda_worker.Input.t * ( unit -> 'a ) * ( unit -> unit )) Pipe_lib.Linear_pipe.Reader.t -> [> `Transition of int * Coda_worker.T.state_hashes ] Pipe_lib.Linear_pipe.Reader.t * [> `Root of int * Mina_lib.Root_diff.t ] Pipe_lib.Linear_pipe.Reader.t
val start_checks : Logger.t -> Coda_process.t array -> (int * Coda_worker.Input.t * ( unit -> 'a ) * ( unit -> unit )) Pipe_lib.Linear_pipe.Reader.t -> Api.t -> acceptable_delay:Core.Time.Span.t -> unit Async_kernel__Deferred.t
val test : ?archive_process_location:( int -> Core.Host_and_port.t option ) -> ?is_archive_rocksdb:( int -> bool ) -> name:string -> Logger.t -> int -> ( int -> int option ) -> ( int -> Signature_lib.Public_key.Compressed.Stable.Latest.t option ) -> Cli_lib.Arg_type.Work_selection_method.Stable.Latest.t -> max_concurrent_connections:int option -> precomputed_values:Genesis_proof.Inputs.t -> Api.t Async_kernel__Deferred.t
module Delegation : sig ... end
module Payments : sig ... end
module Restarts : sig ... end