package tezos-protocol-017-PtNairob
Tezos/Protocol: economic-protocol definition
Install
Dune Dependency
Authors
Maintainers
Sources
tezos-17.3.tar.gz
sha256=7062cd57addd452852598a2214ade393130efa087b99068d53713bdf912b3680
sha512=08e4091144a03ce3c107fb91a66501bd8b65ca3278917c455a2eaac6df3e108ade63f6ab8340a4bb152d60f404326e464d0ec95d26cafe8e82f870465d24a5fc
doc/src/tezos-protocol-017-PtNairob.raw/sc_rollup_inbox_merkelized_payload_hashes_repr.ml.html
Source file sc_rollup_inbox_merkelized_payload_hashes_repr.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259
(*****************************************************************************) (* *) (* Open Source License *) (* Copyright (c) 2022 Nomadic Labs <contact@nomadic-labs.com> *) (* 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. *) (* *) (*****************************************************************************) type error += (* `Permanent *) Merkelized_payload_hashes_proof_error of string let () = let open Data_encoding in register_error_kind `Permanent ~id:"internal.smart_rollup_merklized_payload_hashes_proof" ~title: "Internal error: error occurred during proof production or validation" ~description:"A merkelized payload hashes proof error." ~pp:(fun ppf e -> Format.fprintf ppf "Proof error: %s" e) (obj1 (req "error" (string Plain))) (function Merkelized_payload_hashes_proof_error e -> Some e | _ -> None) (fun e -> Merkelized_payload_hashes_proof_error e) module Skip_list_parameters = struct let basis = 4 end module Skip_list = Skip_list_repr.Make (Skip_list_parameters) (* 32 *) let hash_prefix = "\003\255\138\145\140" (* srib2(55) *) module Hash = struct let prefix = "srib2" let encoded_size = 55 module H = Blake2B.Make (Base58) (struct let name = "Smart_rollup_merkelized_payload_hashes_hash" let title = "The merkelized payload hashes' hash of the smart rollup inbox" let b58check_prefix = hash_prefix (* defaults to 32 *) let size = None end) include H let () = Base58.check_encoded_prefix b58check_encoding prefix encoded_size end type t = (Sc_rollup_inbox_message_repr.Hash.t, Hash.t) Skip_list.cell let equal = Skip_list.equal Hash.equal Sc_rollup_inbox_message_repr.Hash.equal let hash merkelized = let payload_hash = Skip_list.content merkelized in let back_pointers_hashes = Skip_list.back_pointers merkelized in Sc_rollup_inbox_message_repr.Hash.to_bytes payload_hash :: List.map Hash.to_bytes back_pointers_hashes |> Hash.hash_bytes let pp fmt merkelized = Format.fprintf fmt "@[<v>cell ptr: %a@,@[<v 2>cell content:@,%a@]@]" Hash.pp_short (hash merkelized) (Skip_list.pp ~pp_content:Sc_rollup_inbox_message_repr.Hash.pp_short ~pp_ptr:Hash.pp_short) merkelized let encoding = Skip_list.encoding Hash.encoding Sc_rollup_inbox_message_repr.Hash.encoding type merkelized_and_payload = { merkelized : t; payload : Sc_rollup_inbox_message_repr.serialized; } let equal_merkelized_and_payload {merkelized; payload} mp2 = equal merkelized mp2.merkelized && String.equal (payload :> string) (mp2.payload :> string) let pp_merkelized_and_payload fmt {merkelized; payload} = Format.fprintf fmt "@[<hv 2>merkelized:@,%a@,payload: %a@]" pp merkelized Format.pp_print_string (payload :> string) let merkelized_and_payload_encoding = let open Data_encoding in conv (fun {merkelized; payload} -> (merkelized, (payload :> string))) (fun (merkelized, payload) -> { merkelized; payload = Sc_rollup_inbox_message_repr.unsafe_of_string payload; }) (merge_objs encoding (obj1 (req "payload" (string Hex)))) module History = struct include Bounded_history_repr.Make (struct let name = "Smart_rollup_level_inbox_history" end) (Hash) (struct type nonrec t = merkelized_and_payload let pp = pp_merkelized_and_payload let equal = equal_merkelized_and_payload let encoding = merkelized_and_payload_encoding end) let no_history = empty ~capacity:0L end let remember history merkelized payload = let prev_cell_ptr = hash merkelized in History.remember prev_cell_ptr {merkelized; payload} history let genesis_no_history payload = let payload_hash = Sc_rollup_inbox_message_repr.hash_serialized_message payload in Skip_list.genesis payload_hash let genesis history payload = let open Result_syntax in let merkelized = genesis_no_history payload in let+ history = remember history merkelized payload in (history, merkelized) let add_payload_no_history prev_merkelized payload = let prev_merkelized_ptr = hash prev_merkelized in Skip_list.next ~prev_cell:prev_merkelized ~prev_cell_ptr:prev_merkelized_ptr (Sc_rollup_inbox_message_repr.hash_serialized_message payload) let add_payload history prev_merkelized payload = let open Result_syntax in let merkelized = add_payload_no_history prev_merkelized payload in let* history = remember history merkelized payload in return (history, merkelized) let get_payload_hash = Skip_list.content let get_index = Skip_list.index type proof = t list let pp_proof = Format.pp_print_list pp let proof_encoding = Data_encoding.list encoding let produce_proof history ~index merkelized = let open Option_syntax in let deref ptr = let* {merkelized; payload = _} = History.find ptr history in return merkelized in let current_ptr = hash merkelized in let lift_ptr = let rec aux acc = function | [] -> None | [last_ptr] -> let+ ({merkelized; _} as merkelized_and_payload) = History.find last_ptr history in (merkelized_and_payload, List.rev (merkelized :: acc)) | ptr :: rest -> let* merkelized = deref ptr in aux (merkelized :: acc) rest in aux [] in let* ptr_path = Skip_list.back_path ~deref ~cell_ptr:current_ptr ~target_index:index in lift_ptr ptr_path let verify_proof inclusion_proof = let open Result_syntax in let* cell = match inclusion_proof with | cell :: _ -> ok cell | [] -> error (Merkelized_payload_hashes_proof_error "proof is empty") in let rec aux (hash_map, ptr_list) = function | [] -> error (Merkelized_payload_hashes_proof_error "proof is empty") | [target] -> let target_ptr = hash target in let hash_map = Hash.Map.add target_ptr target hash_map in let ptr_list = List.rev (target_ptr :: ptr_list) in ok (hash_map, ptr_list, target, target_ptr) | merkelized :: tail -> let ptr = hash merkelized in aux (Hash.Map.add ptr merkelized hash_map, ptr :: ptr_list) tail in let* hash_map, ptr_list, target, target_ptr = aux (Hash.Map.empty, []) inclusion_proof in let deref ptr = Hash.Map.find ptr hash_map in let cell_ptr = hash cell in let* () = error_unless (Skip_list.valid_back_path ~equal_ptr:Hash.equal ~deref ~cell_ptr ~target_ptr ptr_list) (Merkelized_payload_hashes_proof_error "invalid proof") in return (target, cell) module Internal_for_tests = struct let find_predecessor_payload payloads_history ~index payloads = let open Option_syntax in let deref ptr = let* {merkelized; _} = History.find ptr payloads_history in return merkelized in let cell_ptr = hash payloads in Skip_list.find ~deref ~cell_ptr ~target_index:index let make_proof proof = proof end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>