Average Error: 0.0 → 0.0
Time: 1.4s
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 r136682 = x;
        double r136683 = r136682 * r136682;
        double r136684 = y;
        double r136685 = r136684 * r136684;
        double r136686 = r136683 + r136685;
        return r136686;
}
↓
double f(double x, double y) {
        double r136687 = x;
        double r136688 = r136687 * r136687;
        double r136689 = y;
        double r136690 = r136689 * r136689;
        double r136691 = r136688 + r136690;
        return r136691;
}

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)))