package tezos-protocol-013-PtJakart
Tezos protocol 013-PtJakart package
Install
Dune Dependency
Authors
Maintainers
Sources
tezos-octez-v20.1.tag.bz2
sha256=ddfb5076eeb0b32ac21c1eed44e8fc86a6743ef18ab23fff02d36e365bb73d61
sha512=d22a827df5146e0aa274df48bc2150b098177ff7e5eab52c6109e867eb0a1f0ec63e6bfbb0e3645a6c2112de3877c91a17df32ccbff301891ce4ba630c997a65
doc/src/tezos_raw_protocol_013_PtJakart/sc_rollup_PVM_sem.ml.html
Source file sc_rollup_PVM_sem.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
(*****************************************************************************) (* *) (* Open Source License *) (* Copyright (c) 2021 Nomadic Labs <contact@nomadic-labs.com> *) (* Copyright (c) 2022 Trili Tech, <contact@trili.tech> *) (* *) (* 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. *) (* *) (*****************************************************************************) (** This module introduces the semantics of Proof-generating Virtual Machines. A PVM defines an operational semantics for some computational model. The specificity of PVMs, in comparison with standard virtual machines, is their ability to generate and to validate a *compact* proof that a given atomic execution step turned a given state into another one. In the smart-contract rollups, PVMs are used for two purposes: - They allow for the externalization of rollup execution by completely specifying the operational semantics of a given rollup. This standardization of the semantics gives a unique and executable source of truth about the interpretation of smart-contract rollup inboxes, seen as a transformation of a rollup state. - They allow for the validation or refutation of a claim that the processing of some messages led to a given new rollup state (given an actual source of truth about the nature of these messages). *) open Alpha_context open Sc_rollup (** An input to a PVM is the [message_counter] element of an inbox at a given [inbox_level] and contains a given [payload]. *) type input = { inbox_level : Raw_level.t; message_counter : Z.t; payload : string; } module type S = sig (** The state of the PVM denotes a state of the rollup. *) type state (** During interactive rejection games, a player may need to provide a proof that a given execution step is valid. *) type proof val proof_encoding : proof Data_encoding.t (** A state is initialized in a given context. *) type context (** A commitment hash characterized the contents of the state. *) type hash = State_hash.t (** [proof_start_state proof] returns the initial state hash of the [proof] execution step. *) val proof_start_state : proof -> hash (** [proof_stop_state proof] returns the final state hash of the [proof] execution step. *) val proof_stop_state : proof -> hash (** [state_hash state] returns a compressed representation of [state]. *) val state_hash : state -> hash Lwt.t (** [initial_state context] is the state of the PVM before booting. It must be such that [state_hash state = Commitment_hash.zero]. Any [context] should be enough to create an initial state. *) val initial_state : context -> string -> state Lwt.t (** [is_input_state state] returns [Some (level, counter)] if [state] is waiting for the input message that comes next to the message numbered [counter] in the inbox of a given [level]. *) val is_input_state : state -> (Raw_level.t * Z.t) option Lwt.t (** [set_input level n msg state] sets [msg] in [state] as the next message to be processed. This input message is assumed to be the number [n] in the inbox messages at the given [level]. The input message must be the message next to the previous message processed by the rollup. *) val set_input : input -> state -> state Lwt.t (** [eval s0] returns a state [s1] resulting from the execution of an atomic step of the rollup at state [s0]. *) val eval : state -> state Lwt.t (** [verify_proof input proof] returns [true] iff the [proof] is valid. If the state is an input state, [input] is the hash of the input message externally provided to the evaluation function. *) val verify_proof : input:input option -> proof -> bool Lwt.t end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>