Average Error: 0.0 → 0.0
Time: 1.6s
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 r220272 = x;
        double r220273 = r220272 * r220272;
        double r220274 = y;
        double r220275 = r220274 * r220274;
        double r220276 = r220273 + r220275;
        return r220276;
}
↓
double f(double x, double y) {
        double r220277 = x;
        double r220278 = r220277 * r220277;
        double r220279 = y;
        double r220280 = r220279 * r220279;
        double r220281 = r220278 + r220280;
        return r220281;
}

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