Why the markandsweep GC exactly ? What about others GC's ? No wonder, there is no fast multiplication algorithm of integers in std/bigint. Nim-stint should be better, among the pure Nim's implementation, but is more cryptographic specific (I think it supports unsigned integers only).
- BigNum and BigInt timings on the Pollard Rho algorithm DougT
- BigNum and BigInt timings on the Pollard Rho algorithm planetis
- BigNum and BigInt timings on the Pollard Rho algorit... DougT
- BigNum and BigInt timings on the Pollard Rho alg... Hlaaftana
- BigNum and BigInt timings on the Pollard Rho... dlesnoff
- BigNum and BigInt timings on the Pollar... DougT
- BigNum and BigInt timings on the Po... shirleyquirk
- BigNum and BigInt timings on th... auxym
- BigNum and BigInt timings on th... DougT
- BigNum and BigInt timings on th... dlesnoff
- BigNum and BigInt timings on th... DougT
- BigNum and BigInt timings on th... DougT
- BigNum and BigInt timings on th... fsh
- BigNum and BigInt timings on th... mratsim
- BigNum and BigInt timings on th... fsh
