Average Error: 0.0 → 0.0

Time: 3.5s

Precision: 64

\[a \cdot a - b \cdot b\]

↓

\[a \cdot a - b \cdot b\]

a \cdot a - b \cdot b

↓

a \cdot a - b \cdot b

double f(double a, double b) {
        double r61722 = a;
        double r61723 = r61722 * r61722;
        double r61724 = b;
        double r61725 = r61724 * r61724;
        double r61726 = r61723 - r61725;
        return r61726;
}

↓

double f(double a, double b) {
        double r61727 = a;
        double r61728 = r61727 * r61727;
        double r61729 = b;
        double r61730 = r61729 * r61729;
        double r61731 = r61728 - r61730;
        return r61731;
}

Error

The X axis uses an exponential scale — Bits error versus `a`

Try it out

In
Out

Enter valid numbers for all inputs

Target

Original	0.0
Target	0.0
Herbie	0.0

\[\left(a + b\right) \cdot \left(a - b\right)\]

Derivation

Initial program 0.0
\[a \cdot a - b \cdot b\]
Final simplification0.0
\[\leadsto a \cdot a - b \cdot b\]

Reproduce

herbie shell --seed 2019291 
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

  :herbie-target
  (* (+ a b) (- a b))

  (- (* a a) (* b b)))