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

ECCVM: properly handle transcript polynomial univariate evaluations #768

Closed
ledwards2225 opened this issue Nov 16, 2023 · 3 comments · Fixed by AztecProtocol/aztec-packages#8825
Assignees
Milestone

Comments

@ledwards2225
Copy link
Collaborator

The ECCVM needs to open the five ECC op transcript polynomials as univariates so consistency can be established in the Translator. This was overlooked in the original implementation. For now, we've introduced a new round to the ECCVM protocol that establishes a batched univariate opening claim for this purpose. This is inefficient in that it requires an entirely separate IPA opening protocol. Ideally we would find a way to batch everything into one IPA opening which may require shplonk.

Note: IPA cannot handle polynomials for which the latter half of the coefficients are 0. This arises in general for our transcript polynomials since the ECCVM has a large fixed size that may not be fully utilized. To get around this we simply batch the constant polynomial 1 in with the other 5. This is likely not a long term solution.

@maramihali
Copy link
Contributor

Benchmark for native IPA
image

@maramihali
Copy link
Contributor

Idea to avoid two IPA openings without reviving Shplonk: https://hackmd.io/_dcQgfPjTPutOopViZLv-Q

@maramihali
Copy link
Contributor

AztecProtocol/aztec-packages#7164 removes the need for a second opening but we still need the hack_polynomial for IPA to work.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging a pull request may close this issue.

3 participants