Average Error: 0.0 → 0.0
Time: 3.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 r230322 = x;
        double r230323 = r230322 * r230322;
        double r230324 = y;
        double r230325 = r230324 * r230324;
        double r230326 = r230323 + r230325;
        return r230326;
}

double f(double x, double y) {
        double r230327 = x;
        double r230328 = r230327 * r230327;
        double r230329 = y;
        double r230330 = r230329 * r230329;
        double r230331 = r230328 + r230330;
        return r230331;
}

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