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

Implement 64 bits goldilocks #393

Closed
2 tasks done
diegokingston opened this issue May 29, 2023 · 1 comment
Closed
2 tasks done

Implement 64 bits goldilocks #393

diegokingston opened this issue May 29, 2023 · 1 comment

Comments

@diegokingston
Copy link
Contributor

diegokingston commented May 29, 2023

Implement the 64 bits Goldilocks, with $F = 2^64 - 2^32 + 1$

This shouldn't be done with the MontgomeryBackend, and instead should be optimized. NTT shouldn't be implemented before defining how it will be handled with extension fields.

  • Implement Goldilocks Field with the specific backend
  • Implement degree 2 extension

For reference code:

Plonky 3
Risc Zero

@diegokingston diegokingston converted this from a draft issue May 29, 2023
@MauroToscano MauroToscano changed the title Implement specific arithmetic for mini-goldilocks prime Implement 64 bits goldilocks Sep 4, 2023
@MauroToscano MauroToscano moved this from To Do Now to To Do Later in LambdaWorks Sep 6, 2023
@MauroToscano
Copy link
Collaborator

Done

@github-project-automation github-project-automation bot moved this from To Do Later to Done in LambdaWorks Jan 25, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
Status: Done
Development

No branches or pull requests

2 participants