As one example, FP is prone to a huge loss of precision from subtraction. Let X be huge and E be tiny, then (X+E)-X could be nowhere near E. Linear algebra rou

As one example, FP is prone to a huge loss of precision from subtraction. Let X be huge and E be tiny, then (X+E)-X could be nowhere near E. Linear algebra routines usually have a severe trade-off between speed and accounting for those sorts of errors (such accounting is usually implemented as some kind of search for the best order to do a set of operations), when they can even be handled. If your inputs are nice enough (which is often the case) then it could very well be that none of the above matters and you can go full speed ahead with the fastest and most error prone solutions, but feasibly I could see something like this allowing you to detect early on which snippets might need extra attention due to the nature of typical inputs in those locations.