I doubt v8 has a unified position about "u64 worth the effort" esp. ppl who want to please Node.
Likely that more things need fixed-length modular math; hard to build on top of var-length bigints.
-
-
this feels like Int64 proposal. Z/nZ is often modulo specific
-
Mersenne primes require one handling, other numbers may need Montgomery or Barrett
-
*If* you're willing to write modulus-specific reductions, you can sometimes do it faster.
-
exactly! And we are willing to do it in many cases.
-
Every implementation would (optionally) special-case Curve25519. Good enough.
-
could you please elaborate on this? I’m not sure what you mean by this
-
When the modulus is Curve25519's, it would use special reduction, if it really cares.
-
I see. However with default BigInt implementation doing this may be troublesome
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.