Combination of stir statements with dft #399
Draft
Conversation
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
1 participant
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.
Currently we combine stir variables in very straight forward way
sum(pow(z_i) * alpha^i).However, as #303 suggests special structure of stir variables
z_i = w^(idx_i)allows us to compute the combination with FFT. Concretelytruncate(fft(sparse), 1<<num_variables)) == sum(pow(z_i) * alpha^i)where we setsparse[idx_i] = alpha^i.However as it is implemented it does not bring performance gain since domain size where we sample stir indexes is larger than running sumcheck polynomial. But it seems like with a pruned fft implementation it would be slightly faster than straight forward combination.