Module Tx_rollup.P

val compression_bound : unit Types.P.Bounded.t list -> Z.t
val compress : unit Types.P.Bounded.t list -> Z.t
val scalar_of_account : Types.P.account -> Plompiler.S.t
val scalar_of_leaf : Types.P.leaf -> Hash.scalar
val default_leaf : int -> Types.P.leaf
val empty_ticket_tree : int -> Types.P.leaf array * Types.P.Merkle.tree
val default_account : int -> Types.P.account * Types.P.leaf array * Types.P.Merkle.tree
val random_ticket_tree : int -> Types.P.Merkle.tree * Types.P.leaf array
val random_account : Types.P.Schnorr.sk array -> int -> Types.P.account * Types.P.leaf array * Types.P.Merkle.tree
val random_state : Types.P.Schnorr.sk array -> unit -> Types.P.state
val empty_state : unit -> Types.P.state
val make_state : (Types.P.Schnorr.pk * Z.t * Constants.balance Types.P.ticket array) list -> Types.P.state
val coerce : 'a Types.P.Bounded.t -> Z.t
val get_validity : Types.P.tx_storage option -> bool
val preprocess_private_batch : Types.P.state -> Types.P.tx list -> Types.P.mavryk_zkru -> Types.P.state * Types.P.transfer list * Types.P.transfer_storage list * Epoxy_tx__Constants.amount Types.P.Bounded.t
type generate_op_result = {
  1. tx : Types.P.tx;
  2. tx_s : Types.P.tx_storage;
  3. fee : Constants.fee Types.P.Bounded.t;
  4. hash : Plompiler.S.t;
  5. exit_validity : bool;
}
val generate_transaction : ?src_pos:Z.t -> ?dst_pos:Z.t -> ?amount:Constants.amount Types.P.ticket -> ?fee:Z.t -> ?cnt:Z.t -> ?valid:bool -> ?unsafe:bool -> sks:Types.P.Schnorr.sk array -> Types.P.state -> generate_op_result * Types.P.state
val generate_transactions : ?src_pos:Z.t -> ?dst_pos:Z.t -> ?amount:Constants.amount Types.P.ticket -> ?fee:Z.t -> ?cnt:Z.t -> ?valid:bool -> ?unsafe:bool -> nb_batches:int -> batch_size:int -> sks:Types.P.Schnorr.sk array -> Types.P.state -> (generate_op_result list * Types.P.state) list