Average Error: 0.0 → 0.0
Time: 7.6s
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 r192031 = x;
        double r192032 = r192031 * r192031;
        double r192033 = y;
        double r192034 = r192033 * r192033;
        double r192035 = r192032 + r192034;
        return r192035;
}

double f(double x, double y) {
        double r192036 = x;
        double r192037 = r192036 * r192036;
        double r192038 = y;
        double r192039 = r192038 * r192038;
        double r192040 = r192037 + r192039;
        return r192040;
}

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