16
How hard can generating 1024-bit primes really be? (glitchcomet.com)
submitted 6 months ago by farcaster@lemmy.world to c/rust@programming.dev
11 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[-] farcaster@lemmy.world 1 points 6 months ago

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.

[-] blazebra@programming.dev 2 points 6 months ago

Integer sqrt can be used for integers with any length, not only for integers fit into f64

this post was submitted on 04 May 2024
16 points (94.4% liked)

Rust

5938 readers
1 users here now

Welcome to the Rust community! This is a place to discuss about the Rust programming language.

Wormhole

!performance@programming.dev

Credits

  • The icon is a modified version of the official rust logo (changing the colors to a gradient and black background)

founded 1 year ago
MODERATORS
snowe@programming.dev
Ategon@programming.dev
EdTheLegendary@programming.dev
kahnclusions@programming.dev
torcherist@programming.dev