Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[x \cdot x + y \cdot y\]
↓
\[x \cdot x + y \cdot y\]
x \cdot x + y \cdot y
↓
x \cdot x + y \cdot y
double f(double x, double y) {
        double r97740 = x;
        double r97741 = r97740 * r97740;
        double r97742 = y;
        double r97743 = r97742 * r97742;
        double r97744 = r97741 + r97743;
        return r97744;
}
↓
double f(double x, double y) {
        double r97745 = x;
        double r97746 = r97745 * r97745;
        double r97747 = y;
        double r97748 = r97747 * r97747;
        double r97749 = r97746 + r97748;
        return r97749;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot x + y \cdot y\]

  2. Final simplification0.0

    \[\leadsto x \cdot x + y \cdot y\]

Reproduce

herbie shell --seed 1978988140 
(FPCore (x y)
  :name "Graphics.Rasterific.Linear:$cquadrance from Rasterific-0.6.1"
  :precision binary64
  (+ (* x x) (* y y)))