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 r111443 = x;
        double r111444 = r111443 * r111443;
        double r111445 = y;
        double r111446 = r111445 * r111445;
        double r111447 = r111444 + r111446;
        return r111447;
}
↓
double f(double x, double y) {
        double r111448 = x;
        double r111449 = r111448 * r111448;
        double r111450 = y;
        double r111451 = r111450 * r111450;
        double r111452 = r111449 + r111451;
        return r111452;
}

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