Average Error: 0.0 → 0.0

Time: 3.4s

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 r77966 = a;
        double r77967 = r77966 * r77966;
        double r77968 = b;
        double r77969 = r77968 * r77968;
        double r77970 = r77967 - r77969;
        return r77970;
}

↓

double f(double a, double b) {
        double r77971 = a;
        double r77972 = r77971 * r77971;
        double r77973 = b;
        double r77974 = r77973 * r77973;
        double r77975 = r77972 - r77974;
        return r77975;
}

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

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

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