News for hackers. Stuff that matters.
Re:How hard can generating 1024-bit primes be? by AceJohnny2 on Friday May 03, 2024 @10:45PM (#40254405)
> I would add some notion of expanding multiplication.

C type promotion is complicated enough!

Intrinsics expose this adequately, don't you think?

Re:How hard can generating 1024-bit primes be? by jcalvinowens on Saturday May 04, 2024 @12:17AM (#40254767)
I want an explicit operation that gives the upper and lower half of the result separately. This is ugly, but like:

  hi, lo = val1 *** val2;
It isn't necessarily intrinsically supported on all platforms: int128 is not part of the original standard. Sometimes long long is the same width as long.

I think the concept generalizes to non-binary and non-twos-complement CPUs easily enough.