@[email protected] to Rust • 2 months agoHow hard can generating 1024-bit primes really be?glitchcomet.commessage-square11fedilinkarrow-up117arrow-down11
arrow-up116arrow-down1external-linkHow hard can generating 1024-bit primes really be?glitchcomet.com@[email protected] to Rust • 2 months agomessage-square11fedilink
minus-square@[email protected]OPlinkfedilink1•2 months 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-squareBazebaralink2•2 months 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