Source file sc_rollup_costs.ml

(*****************************************************************************)
(*                                                                           *)
(* Open Source License                                                       *)
(* Copyright (c) 2022 Trili Tech, <contact@trili.tech>                       *)
(* Copyright (c) 2023 DaiLambda, Inc., <contact@dailambda.jp>                *)
(*                                                                           *)
(* Permission is hereby granted, free of charge, to any person obtaining a   *)
(* copy of this software and associated documentation files (the "Software"),*)
(* to deal in the Software without restriction, including without limitation *)
(* the rights to use, copy, modify, merge, publish, distribute, sublicense,  *)
(* and/or sell copies of the Software, and to permit persons to whom the     *)
(* Software is furnished to do so, subject to the following conditions:      *)
(*                                                                           *)
(* The above copyright notice and this permission notice shall be included   *)
(* in all copies or substantial portions of the Software.                    *)
(*                                                                           *)
(* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR*)
(* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,  *)
(* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL   *)
(* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER*)
(* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING   *)
(* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER       *)
(* DEALINGS IN THE SOFTWARE.                                                 *)
(*                                                                           *)
(*****************************************************************************)

include Sc_rollup_costs_generated

module Constants = struct
  (* equal to Michelson_v1_gas.Cost_of.Unparsing.contract_optimized *)
  let cost_decoding_contract_optimized = S.safe_int 70

  (* equal to Michelson_v1_gas.Cost_of.Unparsing.key_hash_optimized *)
  let cost_decoding_key_hash_optimized = S.safe_int 70

  (* Set to the cost of encoding a pkh defined in {!Michelson_v1_gas} divided
     by the number of characters of a pkh, with the result rounded up, i.e.
     70/20 + 1.
     To be updated when benchmarking is completed. *)
  let cost_encode_string_per_byte = S.safe_int 4

  (* Cost of serializing a state hash. *)
  let cost_serialize_state_hash =
    let len = S.safe_int State_hash.size in
    S.Syntax.(cost_encode_string_per_byte * len)

  (* Cost of serializing a commitment hash. *)
  let cost_serialize_commitment_hash =
    let len = S.safe_int Sc_rollup_commitment_repr.Hash.size in
    S.Syntax.(cost_encode_string_per_byte * len)

  (* Cost of serializing a commitment. The cost of serializing the level and
     number of ticks (both int32) is negligible. *)
  let cost_serialize_commitment =
    S.Syntax.(cost_serialize_state_hash + cost_serialize_commitment_hash)

  (* Cost of serializing an operation hash. *)
  let cost_serialize_operation_hash =
    let len = S.safe_int Operation_hash.size in
    S.Syntax.(cost_encode_string_per_byte * len)

  (* Cost of serializing a nonce. The cost of serializing the index (an int32)
     is negligible. *)
  let cost_serialize_nonce = cost_serialize_operation_hash
end

(* Reusing model from {!Ticket_costs.has_tickets_of_ty_cost}. *)
let is_valid_parameters_ty_cost ~ty_size =
  let open S.Syntax in
  let fixed_cost = S.safe_int 10 in
  let coeff = S.safe_int 6 in
  fixed_cost + (coeff * ty_size)

let cost_serialize_internal_inbox_message
    (internal_inbox_message :
      Sc_rollup_inbox_message_repr.internal_inbox_message) =
  match internal_inbox_message with
  | Transfer {payload; sender = _; source = _; destination = _} ->
      let lexpr = Script_repr.lazy_expr payload in
      let expr_cost = Script_repr.force_bytes_cost lexpr in
      S.Syntax.(
        expr_cost + Constants.cost_decoding_contract_optimized
        + Constants.cost_decoding_key_hash_optimized)
  | Start_of_level -> Saturation_repr.zero
  | End_of_level -> Saturation_repr.zero
  | Protocol_migration _ -> Saturation_repr.zero
  | Info_per_level _ -> Saturation_repr.zero

let cost_deserialize_output_proof ~bytes_len =
  cost_Sc_rollup_deserialize_output_proof_benchmark bytes_len

let cost_serialize_external_inbox_message ~bytes_len =
  let len = S.safe_int bytes_len in
  S.Syntax.(Constants.cost_encode_string_per_byte * len)

(* Equal to Michelson_v1_gas.Cost_of.Interpreter.blake2b. *)
let cost_hash_bytes ~bytes_len =
  let open S.Syntax in
  let v0 = S.safe_int bytes_len in
  S.safe_int 430 + v0 + (v0 lsr 3)

let cost_compare = Michelson_v1_gas_costs.cost_N_ICompare

let cost_search_in_tick_list len tick_size =
  let open S.Syntax in
  S.safe_int len * cost_compare tick_size tick_size

let cost_check_dissection ~number_of_states ~tick_size ~hash_size =
  let open S.Syntax in
  cost_search_in_tick_list number_of_states tick_size
  + (S.safe_int 2 * cost_compare hash_size hash_size)

let cost_add_message ~current_index ~msg_len =
  let open S.Syntax in
  let hash_cell_cost =
    Skip_list_costs.model_hash_cell_computed_backpointers_count
      ~index:current_index
  in
  let hash_content_cost = cost_hash_bytes ~bytes_len:msg_len in
  let next_cell_cost =
    Skip_list_costs.model_next ~length:(Z.succ current_index)
  in
  hash_cell_cost + hash_content_cost + next_cell_cost

let cost_verify_output_proof ~bytes_len =
  cost_Sc_rollup_verify_output_proof_benchmark bytes_len

let cost_install_boot_sector_in_wasm_pvm ~boot_sector_size_in_bytes =
  cost_Sc_rollup_install_boot_sector_benchmark boot_sector_size_in_bytes