You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
As discussed with @k06a , @abacabadabacaba , @SkidanovAlex , @bowenwang1996 we won't be able to submit every LightClientBlockView into Near2EthClient, because there are too many of them. Instead, we will be submitting it once every epoch. However, this means that if one wants to verify a proof towards certain transaction outcome they would need to submit a proof that chains through all blocks until the submitted block. Such chain would be too long to process, since we have ~43k blocks in epoch. Instead we decided to compute merkle tree of all blocks up to the current block and store its root in the block header.
The text was updated successfully, but these errors were encountered:
Setting estimate to 13 (~2 weeks) which is how @bowenwang1996 estimated the work. Also setting priority to P0 since this is blocking the rest of our work on the bridge, like making sure the Near2EthProver works correctly, and also our bridge work is P0.
Add block merkle root to block header so that we light client can verify transaction outcomes in blocks that are not known by the light client. Resolves#2632.
Test plan
----------
* Unit tests `test_merkle_tree` and `test_invalid_block_merkle_root`.
* Manually trigger nightly to see if anything breaks.
Supersedes the design proposed here: #2631
As discussed with @k06a , @abacabadabacaba , @SkidanovAlex , @bowenwang1996 we won't be able to submit every LightClientBlockView into Near2EthClient, because there are too many of them. Instead, we will be submitting it once every epoch. However, this means that if one wants to verify a proof towards certain transaction outcome they would need to submit a proof that chains through all blocks until the submitted block. Such chain would be too long to process, since we have ~43k blocks in epoch. Instead we decided to compute merkle tree of all blocks up to the current block and store its root in the block header.
The text was updated successfully, but these errors were encountered: