| Alternative 1 | |
|---|---|
| Accuracy | 96.9% |
| Cost | 6784 |
\[\mathsf{fma}\left(a, a, b \cdot \left(-b\right)\right)
\]

(FPCore (a b) :precision binary64 (- (* a a) (* b b)))
(FPCore (a b) :precision binary64 (fma a a (* b (- b))))
double code(double a, double b) {
return (a * a) - (b * b);
}
double code(double a, double b) {
return fma(a, a, (b * -b));
}
function code(a, b) return Float64(Float64(a * a) - Float64(b * b)) end
function code(a, b) return fma(a, a, Float64(b * Float64(-b))) end
code[a_, b_] := N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision]
code[a_, b_] := N[(a * a + N[(b * (-b)), $MachinePrecision]), $MachinePrecision]
a \cdot a - b \cdot b
\mathsf{fma}\left(a, a, b \cdot \left(-b\right)\right)
Herbie found 4 alternatives:
| Alternative | Accuracy | Speedup |
|---|
| Original | 93.8% |
|---|---|
| Target | 100.0% |
| Herbie | 96.9% |
Initial program 92.6%
Simplified98.0%
[Start]92.6% | \[ a \cdot a - b \cdot b
\] |
|---|---|
fma-neg [=>]98.0% | \[ \color{blue}{\mathsf{fma}\left(a, a, -b \cdot b\right)}
\] |
distribute-rgt-neg-in [=>]98.0% | \[ \mathsf{fma}\left(a, a, \color{blue}{b \cdot \left(-b\right)}\right)
\] |
Final simplification98.0%
| Alternative 1 | |
|---|---|
| Accuracy | 96.9% |
| Cost | 6784 |
| Alternative 2 | |
|---|---|
| Accuracy | 96.2% |
| Cost | 708 |
| Alternative 3 | |
|---|---|
| Accuracy | 77.7% |
| Cost | 521 |
| Alternative 4 | |
|---|---|
| Accuracy | 53.3% |
| Cost | 192 |
herbie shell --seed 2023245
(FPCore (a b)
:name "Difference of squares"
:precision binary64
:herbie-target
(* (+ a b) (- a b))
(- (* a a) (* b b)))