[1]https://www.explainxkcd.com/wiki/index.php/2205:_Types_of_Ap...
340,282,366,920,938,463,463,374,607,431,768,211,456
...rrright.
Actually let me line up the https://en.wikipedia.org/wiki/Orders_of_magnitude_(data)
340,282,366,920,938,463,463,374,607,431,768,211,456
.. ?? YB ZB EB PB TB GB MB KB
(There's no meaningful notation of size here - the denotations are just to show just how much data you can fit in 128 bits of space.)Blinks a few times
Ultimately fails to mentally grasp and make useful sense of the number due to its sheer size
As an aside, apparently DNA can store a few TB/PB (I don't remember which). The age of optimizing for individual bytes as a routine part of "good programming" is definitely over, I guess. (I realize this discussion is about address space and not capacity, but still)
wouldn't 64bit (16 Exabytes theoretical max) already allow for this? are there any projects in that direction?
Furthermore, the upside is only at best 2x. It's likely to be worse, because you're still going to be throttled by waiting for memory loads and stores. Knowing that we have 2 64-bit adders available to us to use each cycle, we can still do 128-bit additions at full throughput, although it requires slightly more latency for the carry propagation.
Hardware quad-precision floating point is a more useful scalar 128-bit value to support.
Even though it is a big int problem, floating point is used. Their are integer FFT algoritms that are usable (NTTs), but they are much slower than floating point FFTs on modern CPUs.
Power9 has for a few years.