Skip to content

maximize the usage of S::BaseField to have smaller proof and better performance #50

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.

Sign up for GitHub

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

Jump to bottom
Open
kunxian-xia opened this issue Dec 3, 2024 · 0 comments · May be fixed by #52
Open

maximize the usage of S::BaseField to have smaller proof and better performance #50

kunxian-xia opened this issue Dec 3, 2024 · 0 comments · May be fixed by #52
Assignees
@kunxian-xia

Comments

@kunxian-xia
Copy link
Collaborator

The arithmetic between two base field elements b op b (where op can addition, subtraction, multiplication) is much faster than e op e. This fact also applies in e op b.

Currently, PR #17 uses degree 2 extension field of goldilocks ScalarExt2 to store the R1CS matrices which implies the phase 1 sumcheck is done over the extension field. This is not optimal.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@kunxian-xia kunxian-xia

Labels
None yet
Projects
Ceno - Recursion
Status: In Progress
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

Feat: define objects over base fields scroll-tech/ceno-recursion
1 participant
@kunxian-xia