Average Error: 0.0 → 0.0
Time: 2.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 r115056 = x;
        double r115057 = r115056 * r115056;
        double r115058 = y;
        double r115059 = r115058 * r115058;
        double r115060 = r115057 + r115059;
        return r115060;
}
↓
double f(double x, double y) {
        double r115061 = x;
        double r115062 = r115061 * r115061;
        double r115063 = y;
        double r115064 = r115063 * r115063;
        double r115065 = r115062 + r115064;
        return r115065;
}

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