>>3
With addition, adding the operands with the smallest exponents (closest to zero) first gives the closest to correct results. With multiplication, no idea, I just observed that changing some of the operands around sometimes changes the result, but a full reversal of 5 operands had no effect so it isn't the same as with addition. (And no, it's not a case of overflow/underflow.)
I was originally trying to create my own floating point library, but I realized that I can't make it fast enough so I decided just to extend the FPU's, as that's fast but not precise, so I'll just make it precise while trying to keep it fast. Problem is, it's hard to work with something so inconsistent it doesn't even obey the basic laws of arithmetic.