Average Error: 0.0 → 0.0
Time: 4.0s
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 r130542 = x;
        double r130543 = r130542 * r130542;
        double r130544 = y;
        double r130545 = r130544 * r130544;
        double r130546 = r130543 + r130545;
        return r130546;
}
↓
double f(double x, double y) {
        double r130547 = x;
        double r130548 = r130547 * r130547;
        double r130549 = y;
        double r130550 = r130549 * r130549;
        double r130551 = r130548 + r130550;
        return r130551;
}

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