Conversation
Codecov Report
@@ Coverage Diff @@
## master #146 +/- ##
===========================================
- Coverage 83.97% 58.92% -25.05%
===========================================
Files 11 11
Lines 443 616 +173
Branches 43 61 +18
===========================================
- Hits 372 363 -9
- Misses 69 253 +184
+ Partials 2 0 -2 |
This file contains hidden or 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
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.
This replaces
2 ^ Ewith1 << Eas suggested in ipsilon/evmone#233.Three versions have been tried
Comparing master with v1:
The group
exponentiation/Nis random base by random exponent with N bits exponentiation. Not sure why they have become faster.Fortunately, the version 1 is also faster than v2 and v3, so this one is going to be merged.
Comparing v1 to v2:
Comparing v1 to v3: