You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on May 27, 2020. It is now read-only.
The stark code currently uses an implicit representation of polynomials (working with the FFT). This is good for efficiency reasons, but obscures how a computation turns into a polynomial turns into a stark. Refactoring to make the polynomial explicit will help the transition towards full ZK-STARK support
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
The stark code currently uses an implicit representation of polynomials (working with the FFT). This is good for efficiency reasons, but obscures how a computation turns into a polynomial turns into a stark. Refactoring to make the polynomial explicit will help the transition towards full ZK-STARK support
The text was updated successfully, but these errors were encountered: