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 r177165 = x;
        double r177166 = r177165 * r177165;
        double r177167 = y;
        double r177168 = r177167 * r177167;
        double r177169 = r177166 + r177168;
        return r177169;
}
↓
double f(double x, double y) {
        double r177170 = x;
        double r177171 = r177170 * r177170;
        double r177172 = y;
        double r177173 = r177172 * r177172;
        double r177174 = r177171 + r177173;
        return r177174;
}

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