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
Currently we are using the 0xPARC implementation(link) for 512bit / 256bit operations (used in mulmod circuit). (link)
This is an implementation of the euclidean division algorithm(pdf), the bit length is not limited, and it is a generalized version.
Since we only need it for 512bit / 256bit operations, we want a more readable implementation for just those cases.
The text was updated successfully, but these errors were encountered:
Currently we are using the 0xPARC implementation(link) for 512bit / 256bit operations (used in mulmod circuit). (link)
This is an implementation of the euclidean division algorithm(pdf), the bit length is not limited, and it is a generalized version.
Since we only need it for 512bit / 256bit operations, we want a more readable implementation for just those cases.
The text was updated successfully, but these errors were encountered: