Average Error: 0.0 → 0.0
Time: 656.0ms
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 r189871 = x;
        double r189872 = r189871 * r189871;
        double r189873 = y;
        double r189874 = r189873 * r189873;
        double r189875 = r189872 + r189874;
        return r189875;
}
↓
double f(double x, double y) {
        double r189876 = x;
        double r189877 = r189876 * r189876;
        double r189878 = y;
        double r189879 = r189878 * r189878;
        double r189880 = r189877 + r189879;
        return r189880;
}

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 2020049 
(FPCore (x y)
  :name "Graphics.Rasterific.Linear:$cquadrance from Rasterific-0.6.1"
  :precision binary64
  (+ (* x x) (* y y)))