3 ms·
So this may be dumb, but as far as I can tell this is comparing a 64bit double to a different data type that uses many more bits -- the example implementation u
by olliej 10y ago
So this may be dumb, but as far as I can tell this is comparing a 64bit double to a different data type that uses many more bits -- the example implementation uses an additional 9 bytes (ignoring padding/alignment etc). Of course that has better precision - it has literally more than doubled the size of the representation. I am on phone (so actual code review will take time), but I'm not convinced that you can get rid of those extra bits.
That said the absence of -0 is actually a problem for some math - you need it for some operations to come out correctly given that you are using a finitely bound representation.
I'd love to see a clearer paper comparing precision, etc with equal size constraints.