Repository navigation
Conversation
share and recover reduced mod q after every scalar product, one 64-bit division per term per coefficient. the terms are bounded, so they now accumulate in i64 and reduce once.
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.
Shamir
shareandrecoverreduced mod q after every multiply-add. Now the powers of the evaluation point are precomputed, products are summed in i64 and reduced once per coefficient. Same results, no new dependencies.Single thread, 16 servers, 100 clients:
share1.38 → 0.84 ms,recover194 → 60 µs.Stacked on #18 (the profile harness fix) only for the benchmark; the library change is independent of it.