Average Error: 0.0 → 0.0
Time: 591.0ms
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 r152517 = x;
        double r152518 = r152517 * r152517;
        double r152519 = y;
        double r152520 = r152519 * r152519;
        double r152521 = r152518 + r152520;
        return r152521;
}
↓
double f(double x, double y) {
        double r152522 = x;
        double r152523 = r152522 * r152522;
        double r152524 = y;
        double r152525 = r152524 * r152524;
        double r152526 = r152523 + r152525;
        return r152526;
}

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