The goal of this RIP is to provide low level specification for arbitrary cross-chain calls, to be maximally on chain, and to provide a proof system with minimal trust assumptions
Discussion
Andreas Freund raised the question regarding the max time duration to fulfil a call, especially for time-sensitive txns, and another question regarding the time frame of finalityDelaySeconds.
Elizas Tazartes raised the question regarding the relationship of storage proof & state root, and what exactly the storage proof tries to prove.
Another suggestion on the finality delay is to include values boundaries as an indication to the wallets.
Areas need further exploration: Standardization of the pieces needed for the proofs
Unified way of exposing a trusted L1 block hash/ state root on L2
Standardize where state roots live on L1
Common way of describing pending vs finalized state roots on L1