-
Notifications
You must be signed in to change notification settings - Fork 6
docs: E2E test plan for BN Verification plugin #908
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: main
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looking good, I think you noted one form might be going so the test plan might simplify even more correct?
|
||
- **Naive Tree Hasher:** calculates the root hash of the merkle trees in a synchronous manner and using a simple recursive algorithm. | ||
|
||
- **Concurrent Tree Hasher:** calculates the root hash of the merkle trees in an asynchronous manner using a thread pool to parallelize the calculation as the blocks items are received and leafs are appended to the "merkle tree". |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Q: Is it important to note the logic of parallelization here in case it informs testing approach or is that an implementation not necessary?
|
||
## Test Scenarios | ||
|
||
| Test Case ID | Test Name | Scenario Description | Expected Behaviour | Input | Output | Implemented (Y/N) | |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Note Test Case ID
should be a unique string of sort, as a we want to note it in the code so that an E2E test can be mapped back to the plan
Codecov ReportAll modified and coverable lines are covered by tests ✅ @@ Coverage Diff @@
## main #908 +/- ##
=========================================
Coverage 88.40% 88.40%
Complexity 723 723
=========================================
Files 132 132
Lines 3096 3096
Branches 230 230
=========================================
Hits 2737 2737
Misses 292 292
Partials 67 67 🚀 New features to boost your workflow:
|
Reviewer Notes
Fixes #907