Average Error: 0.0 → 0.0
Time: 1.3s
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 r114968 = x;
        double r114969 = r114968 * r114968;
        double r114970 = y;
        double r114971 = r114970 * r114970;
        double r114972 = r114969 + r114971;
        return r114972;
}
↓
double f(double x, double y) {
        double r114973 = x;
        double r114974 = r114973 * r114973;
        double r114975 = y;
        double r114976 = r114975 * r114975;
        double r114977 = r114974 + r114976;
        return r114977;
}

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