farcaster@lemmy.world to Rust@programming.dev · 2 months agoHow hard can generating 1024-bit primes really be?glitchcomet.comexternal-linkmessage-square11fedilinkarrow-up117cross-posted to: hackernews@lemmy.smeargle.fans
arrow-up117external-linkHow hard can generating 1024-bit primes really be?glitchcomet.comfarcaster@lemmy.world to Rust@programming.dev · 2 months agomessage-square11fedilinkcross-posted to: hackernews@lemmy.smeargle.fans
minus-squarefarcaster@lemmy.worldOPlinkfedilinkarrow-up1·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-squareBazebara@programming.devlinkfedilinkarrow-up2·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