Added test with multiple MPTs in the same storage space. #3007
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
In this test we create 201 addresses and for each address we create a tree and fill it with random data. In the end of the test we check that all the extracted paths for each key/value pair correctly reaches the associated Merkle root for the tree.
HristoStaykov
requested review from
nkgeorgiev,
teoparvanov,
cloudnoize and
eyalrund
teoparvanov
approved these changes
May 5, 2023
cloudnoize
approved these changes
May 12, 2023
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
In this test we create 201 addresses and for each address we create a tree and fill it with random data. In the end of the test we check that all the extracted paths for each key/value pair correctly reaches the associated Merkle root for the tree.
In this test we create 201 addresses and for each address we create a tree and fill it with random data. In the end of the test we check that all the extracted paths for each key/value pair correctly reaches the associated Merkle root for the tree.
This test is intentionally not part of the CI. It is meant to be part of a periodic job.
Test passes successfully.