Skip to content
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

Need to generate alphas for each subrelation #772

Closed
maramihali opened this issue Nov 17, 2023 · 0 comments · Fixed by AztecProtocol/aztec-packages#3657
Closed

Need to generate alphas for each subrelation #772

maramihali opened this issue Nov 17, 2023 · 0 comments · Fixed by AztecProtocol/aztec-packages#3657
Assignees
Milestone

Comments

@maramihali
Copy link
Contributor

For simplicity we now use a unique alpha (subrelation batching challenge) per instance but will not raise it up to NUM_SUBRELATION - 1 power . This is sowe don't blow up the degree of combiner and compilation time. The plan is to generate one alpha per subrelation so batching those only takes the degree of the combiner from dk to (d + k)*d

@maramihali maramihali added this to the Protogalaxy milestone Nov 17, 2023
codygunton pushed a commit to AztecProtocol/aztec-packages that referenced this issue Jan 11, 2024
This PR introduces the Protogalaxy decider, now having a complete proof
of concept of the folding protocol for Ultra instances. To enable this,
sumcheck has been modified to work with the same power polynomial as in
protogalaxy paper and can be initialised with a custom `target_sum`.
Moreover, we now use different batching challenges for each subrelation
in sumcheck, essential to ensure a reasonable degree of the combiner
polynomial.

Additional: Minor bug fixed in the computation of \vec{\beta*}. 

Resolves AztecProtocol/barretenberg#772.
Resolves AztecProtocol/barretenberg#691.
AztecBot pushed a commit that referenced this issue Jan 12, 2024
This PR introduces the Protogalaxy decider, now having a complete proof
of concept of the folding protocol for Ultra instances. To enable this,
sumcheck has been modified to work with the same power polynomial as in
protogalaxy paper and can be initialised with a custom `target_sum`.
Moreover, we now use different batching challenges for each subrelation
in sumcheck, essential to ensure a reasonable degree of the combiner
polynomial.

Additional: Minor bug fixed in the computation of \vec{\beta*}. 

Resolves #772.
Resolves #691.
michaelelliot pushed a commit to Swoir/noir_rs that referenced this issue Feb 28, 2024
)

This PR introduces the Protogalaxy decider, now having a complete proof
of concept of the folding protocol for Ultra instances. To enable this,
sumcheck has been modified to work with the same power polynomial as in
protogalaxy paper and can be initialised with a custom `target_sum`.
Moreover, we now use different batching challenges for each subrelation
in sumcheck, essential to ensure a reasonable degree of the combiner
polynomial.

Additional: Minor bug fixed in the computation of \vec{\beta*}. 

Resolves AztecProtocol/barretenberg#772.
Resolves AztecProtocol/barretenberg#691.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging a pull request may close this issue.

1 participant