@farcaster to [email protected] • 1 month agoHow hard can generating 1024-bit primes really be?glitchcomet.commessage-square11arrow-up116arrow-down11
arrow-up115arrow-down1external-linkHow hard can generating 1024-bit primes really be?glitchcomet.com@farcaster to [email protected] • 1 month agomessage-square11
minus-square@farcasterOPlink1•1 month agoI doubt doing it in software like that outperforms sqrtss/sqrtsd. Modern CPUs can do the conversions and the floating point sqrt in approximately 20-30 cycles total. That’s comparable to one integer division. But I wouldn’t mind being proven wrong.
minus-squareBazebaralinkfedilink2•1 month agoInteger sqrt can be used for integers with any length, not only for integers fit into f64
I doubt doing it in software like that outperforms sqrtss/sqrtsd. Modern CPUs can do the conversions and the floating point sqrt in approximately 20-30 cycles total. That’s comparable to one integer division. But I wouldn’t mind being proven wrong.
Integer sqrt can be used for integers with any length, not only for integers fit into f64