package tezos-protocol-013-PtJakart
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Tezos/Protocol: economic-protocol definition
Install
dune-project
Dependency
Authors
Maintainers
Sources
tezos-16.0.tar.gz
sha256=ad9e08819871c75ba6f4530b125f7d157799398e4d77a1e6bfea9d91ff37ff55
sha512=c5dc4d40cc09bc6980fbbdb5c2e105bf4252cf9cfcb2b49660b0ebe4dc789f6709ec3b3bf2f87d81580d3eed9521eeb1c960f24d9b14eb0285aaba1f84d10a9b
doc/tezos-protocol-013-PtJakart.raw/Tezos_raw_protocol_013_PtJakart/Sc_rollup_repr/Commitment/index.html
Module Sc_rollup_repr.CommitmentSource
A commitment represents a claim about the state of the Inbox and PVM at some Inbox level.
More formally, a commitment is a claim that:
- assuming the PVM and Inbox are in a state implied by
predecessor - the PVM consumes
number_of_messagesmessages tagged withinbox_levelfrom the Inbox - the PVM advances to the state
compressed_stateovernumber_of_ticksticks
Commitments are disjoint. The next correct commitment is a function of the previous machine state and Inbox.
number_of_messages and inbox_level can be proven/disproven by Merkle proofs on the Inbox state.
compressed_state and number_of_ticks can be proven/disproven by PVM execution, or equivalently, by an interactive proof game between conflicting parties, such that a correct executor always wins the game.
Source
type t = {compressed_state : State_hash.t;inbox_level : Raw_level_repr.t;predecessor : Commitment_hash.t;number_of_messages : Number_of_messages.t;number_of_ticks : Number_of_ticks.t;
} sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>