Average Error: 0.0 → 0.0
Time: 4.5s
Precision: 64
\[x \cdot x + y \cdot y\]
\[\mathsf{hypot}\left(y, x\right) \cdot \mathsf{hypot}\left(y, x\right)\]
x \cdot x + y \cdot y
\mathsf{hypot}\left(y, x\right) \cdot \mathsf{hypot}\left(y, x\right)
double f(double x, double y) {
        double r200004 = x;
        double r200005 = r200004 * r200004;
        double r200006 = y;
        double r200007 = r200006 * r200006;
        double r200008 = r200005 + r200007;
        return r200008;
}

double f(double x, double y) {
        double r200009 = y;
        double r200010 = x;
        double r200011 = hypot(r200009, r200010);
        double r200012 = r200011 * r200011;
        return r200012;
}

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. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{fma}\left(x, x, y \cdot y\right)}\]
  3. Using strategy rm
  4. Applied add-sqr-sqrt0.0

    \[\leadsto \color{blue}{\sqrt{\mathsf{fma}\left(x, x, y \cdot y\right)} \cdot \sqrt{\mathsf{fma}\left(x, x, y \cdot y\right)}}\]
  5. Simplified0.0

    \[\leadsto \color{blue}{\mathsf{hypot}\left(y, x\right)} \cdot \sqrt{\mathsf{fma}\left(x, x, y \cdot y\right)}\]
  6. Simplified0.0

    \[\leadsto \mathsf{hypot}\left(y, x\right) \cdot \color{blue}{\mathsf{hypot}\left(y, x\right)}\]
  7. Final simplification0.0

    \[\leadsto \mathsf{hypot}\left(y, x\right) \cdot \mathsf{hypot}\left(y, x\right)\]

Reproduce

herbie shell --seed 2020047 +o rules:numerics
(FPCore (x y)
  :name "Graphics.Rasterific.Linear:$cquadrance from Rasterific-0.6.1"
  :precision binary64
  (+ (* x x) (* y y)))