Average Error: 0.0 → 0.0
Time: 12.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 r200535 = x;
        double r200536 = r200535 * r200535;
        double r200537 = y;
        double r200538 = r200537 * r200537;
        double r200539 = r200536 + r200538;
        return r200539;
}
↓
double f(double x, double y) {
        double r200540 = x;
        double r200541 = r200540 * r200540;
        double r200542 = y;
        double r200543 = r200542 * r200542;
        double r200544 = r200541 + r200543;
        return r200544;
}

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)))