Average Error: 0.0 → 0.0
Time: 2.8s
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 r193249 = x;
        double r193250 = r193249 * r193249;
        double r193251 = y;
        double r193252 = r193251 * r193251;
        double r193253 = r193250 + r193252;
        return r193253;
}
↓
double f(double x, double y) {
        double r193254 = x;
        double r193255 = r193254 * r193254;
        double r193256 = y;
        double r193257 = r193256 * r193256;
        double r193258 = r193255 + r193257;
        return r193258;
}

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