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

Fast Mersennes Prime Field #540

Open

1 of 3 tasks

MauroToscano opened this issue Sep 4, 2023 · 0 comments

Labels

collaborator-friendly

Collaborator

MauroToscano commented Sep 4, 2023 •

edited

Loading

Implement the 32 bit Mersennes Prime Field, F = 2^31 - 1, with an efficient backend. Bench it against the same field implemented with montgomery backend
Add a differential fuzzer against a Montgomery implementation
Implement the degree 4 field extension

It's recommended for new collaborators to only do the first task, since the code has no examples of field extensions for FRI

The last task needs discussion on how would be the best approach to implement it, API wise.

For references, see:

Reed-solomon over circle fields
Plonky 3 implementation

MauroToscano added the collaborator-friendly label

PatStiles mentioned this issue

feat(field): add mersenne31 prime field #565

Closed

3 tasks

PatStiles mentioned this issue

Feat(field): add mersenne31 field #623

Closed

13 tasks

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment