Average Error: 0.0 → 0.0

Time: 15.8s

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 r74138 = a;
        double r74139 = r74138 * r74138;
        double r74140 = b;
        double r74141 = r74140 * r74140;
        double r74142 = r74139 - r74141;
        return r74142;
}

↓

double f(double a, double b) {
        double r74143 = a;
        double r74144 = r74143 * r74143;
        double r74145 = b;
        double r74146 = r74145 * r74145;
        double r74147 = r74144 - r74146;
        return r74147;
}

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

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

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