Difference of squares

Percentage Accurate: 93.7% → 96.8%

Time: 4.7s

Alternatives: 4

Speedup: 0.5×

• 43.7% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ a \cdot a - b \cdot b \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (- (* a a) (* b b)))

C

double code(double a, double b) {
	return (a * a) - (b * b);
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (a * a) - (b * b)
end function

Java

public static double code(double a, double b) {
	return (a * a) - (b * b);
}

Python

def code(a, b):
	return (a * a) - (b * b)

Julia

function code(a, b)
	return Float64(Float64(a * a) - Float64(b * b))
end

MATLAB

function tmp = code(a, b)
	tmp = (a * a) - (b * b);
end

Wolfram

code[a_, b_] := N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision]

Initial Program: 93.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ a \cdot a - b \cdot b \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (- (* a a) (* b b)))

C

double code(double a, double b) {
	return (a * a) - (b * b);
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (a * a) - (b * b)
end function

Java

public static double code(double a, double b) {
	return (a * a) - (b * b);
}

Python

def code(a, b):
	return (a * a) - (b * b)

Julia

function code(a, b)
	return Float64(Float64(a * a) - Float64(b * b))
end

MATLAB

function tmp = code(a, b)
	tmp = (a * a) - (b * b);
end

Wolfram

code[a_, b_] := N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision]

Alternative 1: 96.8% accurate, 0.1× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(a, a, b \cdot \left(-b\right)\right) \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (fma a a (* b (- b))))

C

double code(double a, double b) {
	return fma(a, a, (b * -b));
}

Julia

function code(a, b)
	return fma(a, a, Float64(b * Float64(-b)))
end

Wolfram

code[a_, b_] := N[(a * a + N[(b * (-b)), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 93.0%

   \[a \cdot a - b \cdot b \]
2. Step-by-step derivation

   1. sqr-neg 93.0%

      \[\leadsto a \cdot a - \color{blue}{\left(-b\right) \cdot \left(-b\right)} \]

   2. cancel-sign-sub 93.0%

      \[\leadsto \color{blue}{a \cdot a + b \cdot \left(-b\right)} \]

   3. fma-define 97.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(a, a, b \cdot \left(-b\right)\right)} \]

3. Simplified 97.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(a, a, b \cdot \left(-b\right)\right)} \]
4. Add Preprocessing
5. Add Preprocessing

Alternative 2: 96.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 2 \cdot 10^{+279}:\\ \;\;\;\;a \cdot a - b \cdot b\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(-b\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b)
 :precision binary64
 (if (<= (* b b) 2e+279) (- (* a a) (* b b)) (* b (- b))))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 2e+279) {
		tmp = (a * a) - (b * b);
	} else {
		tmp = b * -b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b * b) <= 2d+279) then
        tmp = (a * a) - (b * b)
    else
        tmp = b * -b
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((b * b) <= 2e+279) {
		tmp = (a * a) - (b * b);
	} else {
		tmp = b * -b;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (b * b) <= 2e+279:
		tmp = (a * a) - (b * b)
	else:
		tmp = b * -b
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 2e+279)
		tmp = Float64(Float64(a * a) - Float64(b * b));
	else
		tmp = Float64(b * Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((b * b) <= 2e+279)
		tmp = (a * a) - (b * b);
	else
		tmp = b * -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e+279], N[(N[(a * a), $MachinePrecision] - N[(b * b), $MachinePrecision]), $MachinePrecision], N[(b * (-b)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000012e279

   1. Initial program 100.0%

      \[a \cdot a - b \cdot b \]
   2. Add Preprocessing

   if 2.00000000000000012e279 < (*.f64 b b)

   1. Initial program 73.1%

      \[a \cdot a - b \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0 91.0%

      \[\leadsto \color{blue}{-1 \cdot {b}^{2}} \]
   4. Step-by-step derivation

      1. neg-mul-1 91.0%

         \[\leadsto \color{blue}{-{b}^{2}} \]

   5. Simplified 91.0%

      \[\leadsto \color{blue}{-{b}^{2}} \]
   6. Step-by-step derivation

      1. unpow2 91.0%

         \[\leadsto -\color{blue}{b \cdot b} \]

      2. distribute-lft-neg-in 91.0%

         \[\leadsto \color{blue}{\left(-b\right) \cdot b} \]

   7. Applied egg-rr 91.0%

      \[\leadsto \color{blue}{\left(-b\right) \cdot b} \]
3. Recombined 2 regimes into one program.

4. Final simplification 97.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot b \leq 2 \cdot 10^{+279}:\\ \;\;\;\;a \cdot a - b \cdot b\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(-b\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 77.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;b \cdot b \leq 2 \cdot 10^{-43}:\\ \;\;\;\;a \cdot a\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(-b\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (if (<= (* b b) 2e-43) (* a a) (* b (- b))))

C

double code(double a, double b) {
	double tmp;
	if ((b * b) <= 2e-43) {
		tmp = a * a;
	} else {
		tmp = b * -b;
	}
	return tmp;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    real(8) :: tmp
    if ((b * b) <= 2d-43) then
        tmp = a * a
    else
        tmp = b * -b
    end if
    code = tmp
end function

Java

public static double code(double a, double b) {
	double tmp;
	if ((b * b) <= 2e-43) {
		tmp = a * a;
	} else {
		tmp = b * -b;
	}
	return tmp;
}

Python

def code(a, b):
	tmp = 0
	if (b * b) <= 2e-43:
		tmp = a * a
	else:
		tmp = b * -b
	return tmp

Julia

function code(a, b)
	tmp = 0.0
	if (Float64(b * b) <= 2e-43)
		tmp = Float64(a * a);
	else
		tmp = Float64(b * Float64(-b));
	end
	return tmp
end

MATLAB

function tmp_2 = code(a, b)
	tmp = 0.0;
	if ((b * b) <= 2e-43)
		tmp = a * a;
	else
		tmp = b * -b;
	end
	tmp_2 = tmp;
end

Wolfram

code[a_, b_] := If[LessEqual[N[(b * b), $MachinePrecision], 2e-43], N[(a * a), $MachinePrecision], N[(b * (-b)), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 b b) < 2.00000000000000015e-43

   1. Initial program 100.0%

      \[a \cdot a - b \cdot b \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. difference-of-squares 100.0%

         \[\leadsto \color{blue}{\left(a + b\right) \cdot \left(a - b\right)} \]

      2. sub-neg 100.0%

         \[\leadsto \left(a + b\right) \cdot \color{blue}{\left(a + \left(-b\right)\right)} \]

      3. add-sqr-sqrt 46.6%

         \[\leadsto \left(a + b\right) \cdot \left(a + \color{blue}{\sqrt{-b} \cdot \sqrt{-b}}\right) \]

      4. sqrt-unprod 92.8%

         \[\leadsto \left(a + b\right) \cdot \left(a + \color{blue}{\sqrt{\left(-b\right) \cdot \left(-b\right)}}\right) \]

      5. sqr-neg 92.8%

         \[\leadsto \left(a + b\right) \cdot \left(a + \sqrt{\color{blue}{b \cdot b}}\right) \]

      6. sqrt-prod 46.2%

         \[\leadsto \left(a + b\right) \cdot \left(a + \color{blue}{\sqrt{b} \cdot \sqrt{b}}\right) \]

      7. add-sqr-sqrt 87.9%

         \[\leadsto \left(a + b\right) \cdot \left(a + \color{blue}{b}\right) \]

   4. Applied egg-rr 87.9%

      \[\leadsto \color{blue}{\left(a + b\right) \cdot \left(a + b\right)} \]

   5. Taylor expanded in a around inf 88.1%

      \[\leadsto \left(a + b\right) \cdot \color{blue}{a} \]

   6. Taylor expanded in a around inf 88.7%

      \[\leadsto \color{blue}{a} \cdot a \]

   if 2.00000000000000015e-43 < (*.f64 b b)

   1. Initial program 87.0%

      \[a \cdot a - b \cdot b \]
   2. Add Preprocessing

   3. Taylor expanded in a around 0 81.5%

      \[\leadsto \color{blue}{-1 \cdot {b}^{2}} \]
   4. Step-by-step derivation

      1. neg-mul-1 81.5%

         \[\leadsto \color{blue}{-{b}^{2}} \]

   5. Simplified 81.5%

      \[\leadsto \color{blue}{-{b}^{2}} \]
   6. Step-by-step derivation

      1. unpow2 81.5%

         \[\leadsto -\color{blue}{b \cdot b} \]

      2. distribute-lft-neg-in 81.5%

         \[\leadsto \color{blue}{\left(-b\right) \cdot b} \]

   7. Applied egg-rr 81.5%

      \[\leadsto \color{blue}{\left(-b\right) \cdot b} \]
3. Recombined 2 regimes into one program.

4. Final simplification 84.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;b \cdot b \leq 2 \cdot 10^{-43}:\\ \;\;\;\;a \cdot a\\ \mathbf{else}:\\ \;\;\;\;b \cdot \left(-b\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 54.4% accurate, 2.3× speedup

Math

\[\begin{array}{l} \\ a \cdot a \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (* a a))

C

double code(double a, double b) {
	return a * a;
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = a * a
end function

Java

public static double code(double a, double b) {
	return a * a;
}

Python

def code(a, b):
	return a * a

Julia

function code(a, b)
	return Float64(a * a)
end

MATLAB

function tmp = code(a, b)
	tmp = a * a;
end

Wolfram

code[a_, b_] := N[(a * a), $MachinePrecision]

Derivation

1. Initial program 93.0%

   \[a \cdot a - b \cdot b \]
2. Add Preprocessing
3. Step-by-step derivation

   1. difference-of-squares 100.0%

      \[\leadsto \color{blue}{\left(a + b\right) \cdot \left(a - b\right)} \]

   2. sub-neg 100.0%

      \[\leadsto \left(a + b\right) \cdot \color{blue}{\left(a + \left(-b\right)\right)} \]

   3. add-sqr-sqrt 45.2%

      \[\leadsto \left(a + b\right) \cdot \left(a + \color{blue}{\sqrt{-b} \cdot \sqrt{-b}}\right) \]

   4. sqrt-unprod 72.0%

      \[\leadsto \left(a + b\right) \cdot \left(a + \color{blue}{\sqrt{\left(-b\right) \cdot \left(-b\right)}}\right) \]

   5. sqr-neg 72.0%

      \[\leadsto \left(a + b\right) \cdot \left(a + \sqrt{\color{blue}{b \cdot b}}\right) \]

   6. sqrt-prod 27.5%

      \[\leadsto \left(a + b\right) \cdot \left(a + \color{blue}{\sqrt{b} \cdot \sqrt{b}}\right) \]

   7. add-sqr-sqrt 50.3%

      \[\leadsto \left(a + b\right) \cdot \left(a + \color{blue}{b}\right) \]

4. Applied egg-rr 50.3%

   \[\leadsto \color{blue}{\left(a + b\right) \cdot \left(a + b\right)} \]

5. Taylor expanded in a around inf 55.6%

   \[\leadsto \left(a + b\right) \cdot \color{blue}{a} \]

6. Taylor expanded in a around inf 51.2%

   \[\leadsto \color{blue}{a} \cdot a \]
7. Add Preprocessing

Developer Target 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(a + b\right) \cdot \left(a - b\right) \end{array} \]

FPCore

(FPCore (a b) :precision binary64 (* (+ a b) (- a b)))

C

double code(double a, double b) {
	return (a + b) * (a - b);
}

Fortran

real(8) function code(a, b)
    real(8), intent (in) :: a
    real(8), intent (in) :: b
    code = (a + b) * (a - b)
end function

Java

public static double code(double a, double b) {
	return (a + b) * (a - b);
}

Python

def code(a, b):
	return (a + b) * (a - b)

Julia

function code(a, b)
	return Float64(Float64(a + b) * Float64(a - b))
end

MATLAB

function tmp = code(a, b)
	tmp = (a + b) * (a - b);
end

Wolfram

code[a_, b_] := N[(N[(a + b), $MachinePrecision] * N[(a - b), $MachinePrecision]), $MachinePrecision]

Reproduce

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

  :alt
  (! :herbie-platform default (* (+ a b) (- a b)))

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