Alex,
Which applications are you referring to that require the variables to have a dynamic range of 600 orders of magnitude? I keep asking people to send me examples of any applications for which a 32-bit standard posit (with 512-bit quire, around 157
decimals of accuracy) is insufficient but 64-bit floats do fine, and I'm not seeing them. I'm sure there are some, but I don't think they're common.
You seem to be dismissing the dynamic range of the quire, saying it is specialized. It's actually quite general. The quire can be used to accomplish high-precision plus, minus, times, divide, square root, etc. using unevaluated sums (similar to
double-word precision libraries, but not limited to double). This is well documented by Kulisch.
When I see the reasons programmers use 64-bit floats, it almost always is to preserve accuracy when accumulating large sums, or minimize cumulative rounding in solving large linear systems, or evaluate polynomials to high accuracy even when near
a root where Horner's rule is numerically ill-behaved. The quire solves all of those problems easily. How are those calculations "exotic"? Have you actually tried using the quire data type?
Assertions about one approach being inferior or superior or "a joke" need to be supported with examples and experiments, in scientific discussions.