Average Error: 0.0 → 0.0
Time: 1.5s
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 r189243 = x;
        double r189244 = r189243 * r189243;
        double r189245 = y;
        double r189246 = r189245 * r189245;
        double r189247 = r189244 + r189246;
        return r189247;
}
↓
double f(double x, double y) {
        double r189248 = x;
        double r189249 = r189248 * r189248;
        double r189250 = y;
        double r189251 = r189250 * r189250;
        double r189252 = r189249 + r189251;
        return r189252;
}

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