IntervalMatrices use Rump algorithm to matrix multiplication This brings time to Qint'*Qint down to ~40s which is 5-8 × slower than Q'*Q (for size n=2^13). The naive version is ~100 × slower than Q'*Q even for n = 2^10.