-
Notifications
You must be signed in to change notification settings - Fork 124
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 Integer Rings in RNS Representation #787
Conversation
4187f2d
to
583c14d
Compare
547c8b8
to
c3e66ee
Compare
Co-authored-by: Leon Hibnik <[email protected]>
fix: allow sumcheck tests to run without cuda backend
Running over the MLE polynomials in a serial order. Parallelizing the sum of the MLE polynomials over multiple threads.
Co-authored-by: Leon Hibnik <[email protected]>
c309b1e
to
cb20581
Compare
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
some comments inside
} | ||
|
||
// Arithmetic Operators | ||
friend HOST_DEVICE_INLINE IntegerRingRns operator+(const IntegerRingRns& a, const IntegerRingRns& b) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
a general comment: do we need to add compound assignments. we also don't have it for Fields
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
We could, I am not sure it's more efficient but we could when we need it
This PR introduces a template class for integer rings in the Residue Number System (RNS) representation. Instead of storing an integer modulo a composite modulus q = p1 * p2 * ... * pn, this implementation represents the integer as a tuple (x mod p1, x mod p2, ..., x mod pn), where each component resides in a different field.
Future PRs:
cuda-backend-branch: yshekel/ring_rns