14 Matching Annotations
  1. Jun 2019
    1. History Verification

      Def not required but a diagram idea for this section could show the process of repeatedly applying a list of proof elements to the state.

    1. all transactions that produced the state update

      A bit nit picky but considering we may need other data to calculate the SUs, maybe we could say:

      all inputs which can be used to compute the state update. This often includes transactions & auxiliary data.

    2. an `implicit`_ or `explicit`_ range

      Maybe we could add a glossary section

    1. Users will usually first interact with a plasma chain by depositing their assets into a plasma deposit contract

      Not to be pedantic but ideally people will either be sent PETH or exchange ETH for PETH using a swap predicate lol

    1. Public Variables

      Note that these variables will likely be set inside of the constructor of a "deposit contract factory" so that we can save on gas cost, so the constant modifier may not be used in practice.

    1. Background

      We could consider beginning this section by talking about how this is a general purpose block structure. Something like the following:

      While Plasma Cashflow uses a Merkle Interval Tree, other constructions may use alternative block formats. In order to generalize the plasma block structure, we can break it into two layers:

      1. an asset ID tree which specifies the particular asset (which may use an alternative format to cashflow); and
      2. our plasma cashflow specific block structure, a merkle interval tree.

      This structure allows operators to commit blocks for multiple plasma chains, as well as aggregate blocks from multiple operators into the same commitment.

      Additionally, even within our plasma cashflow construction we can make use of the asset ID by giving each it's own chain......[etc]

    1. easily executable

      Maybe instead this could be "easily enforceable on Ethereum"? Somehow communicating the fact that we not only have a state transition model, but we have a general state transition adjudication model?

      State transitions:
      f(s_0, i_0) = s_1
      f(s_1, i_1) = s_2
      ...
      
      Enforcement:
      verify( f(s_0, i_0) == s_1 )
      

      Maybe we could add something along the lines of:

      We define a system in which a "trusted" state execution layer (Ethereum) may enforce the validity of secondary (L2) state execution, in constant time & memory.

    2. playform

      platform?

    1. Plasma Group

      Consider removing "Plasma Group" or changing to "PG" for a title that's a little less wordy?

  2. May 2019