Now that we are aware, we'll discuss the topic (incl. considering Node.js concerns/requests) for next @TC39. 4/4
-
-
just agreed: try BigInt (name & suffix TBD, but L suffix is out) as alternative to Int64,
@littledan among champions.2 replies 3 retweets 6 likes -
Replying to @BrendanEich @bmeurer and
Maybe consider making the primitive be fixed-modulus finite commutative rings ℤ/nℤ instead.
1 reply 0 retweets 0 likes -
Replying to @BRIAN_____ @BrendanEich and
Likely that more things need fixed-length modular math; hard to build on top of var-length bigints.
1 reply 0 retweets 0 likes -
Replying to @BRIAN_____ @BrendanEich and
this feels like Int64 proposal. Z/nZ is often modulo specific
1 reply 0 retweets 1 like -
Replying to @indutny @BRIAN_____ and
Mersenne primes require one handling, other numbers may need Montgomery or Barrett
4 replies 1 retweet 1 like -
Replying to @indutny @BrendanEich and
*If* you're willing to write modulus-specific reductions, you can sometimes do it faster.
1 reply 0 retweets 0 likes -
Replying to @BRIAN_____ @BrendanEich and
exactly! And we are willing to do it in many cases.
1 reply 0 retweets 0 likes -
Replying to @indutny @BrendanEich and
Every implementation would (optionally) special-case Curve25519. Good enough.
1 reply 0 retweets 0 likes -
Replying to @BRIAN_____ @BrendanEich and
could you please elaborate on this? I’m not sure what you mean by this
2 replies 0 retweets 0 likes
When the modulus is Curve25519's, it would use special reduction, if it really cares.
-
-
Replying to @BRIAN_____ @BrendanEich and
I see. However with default BigInt implementation doing this may be troublesome
0 replies 0 retweets 0 likesThanks. Twitter will use this to make your timeline better. UndoUndo
-
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.