Average Error: 0.0 → 0.0
Time: 2.1s
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 r136696 = x;
        double r136697 = r136696 * r136696;
        double r136698 = y;
        double r136699 = r136698 * r136698;
        double r136700 = r136697 + r136699;
        return r136700;
}
↓
double f(double x, double y) {
        double r136701 = x;
        double r136702 = r136701 * r136701;
        double r136703 = y;
        double r136704 = r136703 * r136703;
        double r136705 = r136702 + r136704;
        return r136705;
}

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