Average Error: 0.0 → 0.0
Time: 1.5s
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 r166282 = x;
        double r166283 = r166282 * r166282;
        double r166284 = y;
        double r166285 = r166284 * r166284;
        double r166286 = r166283 + r166285;
        return r166286;
}
↓
double f(double x, double y) {
        double r166287 = x;
        double r166288 = r166287 * r166287;
        double r166289 = y;
        double r166290 = r166289 * r166289;
        double r166291 = r166288 + r166290;
        return r166291;
}

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