I just read David's paper on floating-point accumulation networks. It's fantastic work: he's developed a new abstraction of floating-point numbers that allows him to verify error bounds for sequences of TwoSum-like operations, and then used that abstraction to design new, faster double-double addition algorithms. Since I already had a Apple M1 simulator on hand, I figured I'd give his algorithms a spin. About my simulator I guess I was a big glib when describing my simulator earlier. Let me g...
