-
### Summary
RM-3.5.4(9) imposes a symmetric base range for signed integer types. I would like to remove the need for a symmetric base range because it imposes the use of larger types to perform ari…
-
I was wondering if lazy reductions are possible to speed up the EC operations.
This is as far as I can tell relevant for affine, Jacobian and projective formulas, where intermediate terms are comp…
-
Some details of the cryptographic defaults used in the main library used to encrypt the election should be available for transparency and clarity.
The following parameters should have a link to whe…
-
The current version of packDecimal shows a 3x slowdown compared to the version in the benchmark. This is due to the `n0 > fromIntegral (maxBound :: Word64)` guard in `numDecimalDigits`. This must be c…
-
dpp, bitmasking and several sections are not available can u tell me how caan i acess them thanks a lot
-
If you look below, there is a `dup _ < [ fixnum-shift ] [ fixnum-shift ] if`. Seems like we shouldn't do that check if we're gonna do the same thing in each branch, or there is a bug somehow:
``` fa…
-
# Addition of a correct modulus operator
The current remainder operator `%` can be surprising in that the sign of the result follows the sign of the dividend, so does not output periodic results fo…
-
In this, we are given two variables a and b, will perform operations like additions, multiplication, divisions, subtraction, and power of that two numbers with modular operation having numbers as 1
-
I just stumbled across this project and was interested to test it out and compare performance with GMP. I am writing software to factor Mersenne numbers, and my use case deals mostly with 1 to 2 limb…
-
Currently, if you shift with a comptime-known RHS, everything is easy peasy lemonboy squeezy:
```zig
const std = @import("std");
test "comptime known rhs shift" {
var x: u32 = 0b11110000;
…