Average Error: 0.0 → 0.0
Time: 1.9s
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 r180942 = x;
        double r180943 = r180942 * r180942;
        double r180944 = y;
        double r180945 = r180944 * r180944;
        double r180946 = r180943 + r180945;
        return r180946;
}
↓
double f(double x, double y) {
        double r180947 = x;
        double r180948 = r180947 * r180947;
        double r180949 = y;
        double r180950 = r180949 * r180949;
        double r180951 = r180948 + r180950;
        return r180951;
}

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