Average Error: 0.0 → 0.0

Time: 1.0s

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 r91212 = a;
        double r91213 = r91212 * r91212;
        double r91214 = b;
        double r91215 = r91214 * r91214;
        double r91216 = r91213 - r91215;
        return r91216;
}

↓

double f(double a, double b) {
        double r91217 = a;
        double r91218 = r91217 * r91217;
        double r91219 = b;
        double r91220 = r91219 * r91219;
        double r91221 = r91218 - r91220;
        return r91221;
}

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 2019318 
(FPCore (a b)
  :name "Difference of squares"
  :precision binary64

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

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