Rust f64::acosh

Percentage Accurate: 51.1% → 99.8%

Time: 5.2s

Alternatives: 4

Speedup: 2.0×

Specification

\[x \geq 1\]

Math

\[\begin{array}{l} \\ \cosh^{-1} x \end{array} \]

FPCore

(FPCore (x) :precision binary64 (acosh x))

C

double code(double x) {
	return acosh(x);
}

Python

def code(x):
	return math.acosh(x)

Julia

function code(x)
	return acosh(x)
end

MATLAB

function tmp = code(x)
	tmp = acosh(x);
end

Wolfram

code[x_] := N[ArcCosh[x], $MachinePrecision]

Initial Program: 51.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \log \left(x + \sqrt{x \cdot x - 1}\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (log (+ x (sqrt (- (* x x) 1.0)))))

C

double code(double x) {
	return log((x + sqrt(((x * x) - 1.0))));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = log((x + sqrt(((x * x) - 1.0d0))))
end function

Java

public static double code(double x) {
	return Math.log((x + Math.sqrt(((x * x) - 1.0))));
}

Python

def code(x):
	return math.log((x + math.sqrt(((x * x) - 1.0))))

Julia

function code(x)
	return log(Float64(x + sqrt(Float64(Float64(x * x) - 1.0))))
end

MATLAB

function tmp = code(x)
	tmp = log((x + sqrt(((x * x) - 1.0))));
end

Wolfram

code[x_] := N[Log[N[(x + N[Sqrt[N[(N[(x * x), $MachinePrecision] - 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Alternative 1: 99.8% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := x + \sqrt{x \cdot x + -1}\\ \mathbf{if}\;t\_0 \leq 10^{+92}:\\ \;\;\;\;\log t\_0\\ \mathbf{else}:\\ \;\;\;\;\log 2 + \log x\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (+ x (sqrt (+ (* x x) -1.0)))))
   (if (<= t_0 1e+92) (log t_0) (+ (log 2.0) (log x)))))

C

double code(double x) {
	double t_0 = x + sqrt(((x * x) + -1.0));
	double tmp;
	if (t_0 <= 1e+92) {
		tmp = log(t_0);
	} else {
		tmp = log(2.0) + log(x);
	}
	return tmp;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = x + sqrt(((x * x) + (-1.0d0)))
    if (t_0 <= 1d+92) then
        tmp = log(t_0)
    else
        tmp = log(2.0d0) + log(x)
    end if
    code = tmp
end function

Java

public static double code(double x) {
	double t_0 = x + Math.sqrt(((x * x) + -1.0));
	double tmp;
	if (t_0 <= 1e+92) {
		tmp = Math.log(t_0);
	} else {
		tmp = Math.log(2.0) + Math.log(x);
	}
	return tmp;
}

Python

def code(x):
	t_0 = x + math.sqrt(((x * x) + -1.0))
	tmp = 0
	if t_0 <= 1e+92:
		tmp = math.log(t_0)
	else:
		tmp = math.log(2.0) + math.log(x)
	return tmp

Julia

function code(x)
	t_0 = Float64(x + sqrt(Float64(Float64(x * x) + -1.0)))
	tmp = 0.0
	if (t_0 <= 1e+92)
		tmp = log(t_0);
	else
		tmp = Float64(log(2.0) + log(x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x)
	t_0 = x + sqrt(((x * x) + -1.0));
	tmp = 0.0;
	if (t_0 <= 1e+92)
		tmp = log(t_0);
	else
		tmp = log(2.0) + log(x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_] := Block[{t$95$0 = N[(x + N[Sqrt[N[(N[(x * x), $MachinePrecision] + -1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, 1e+92], N[Log[t$95$0], $MachinePrecision], N[(N[Log[2.0], $MachinePrecision] + N[Log[x], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x (sqrt.f64 (-.f64 (*.f64 x x) 1))) < 1e92

   1. Initial program 100.0%

      \[\log \left(x + \sqrt{x \cdot x - 1}\right) \]
   2. Add Preprocessing

   if 1e92 < (+.f64 x (sqrt.f64 (-.f64 (*.f64 x x) 1)))

   1. Initial program 30.9%

      \[\log \left(x + \sqrt{x \cdot x - 1}\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 99.7%

      \[\leadsto \color{blue}{\log 2 + -1 \cdot \log \left(\frac{1}{x}\right)} \]
   4. Step-by-step derivation

      1. mul-1-neg 99.7%

         \[\leadsto \log 2 + \color{blue}{\left(-\log \left(\frac{1}{x}\right)\right)} \]

      2. log-rec 99.7%

         \[\leadsto \log 2 + \left(-\color{blue}{\left(-\log x\right)}\right) \]

      3. remove-double-neg 99.7%

         \[\leadsto \log 2 + \color{blue}{\log x} \]

   5. Simplified 99.7%

      \[\leadsto \color{blue}{\log 2 + \log x} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + \sqrt{x \cdot x + -1} \leq 10^{+92}:\\ \;\;\;\;\log \left(x + \sqrt{x \cdot x + -1}\right)\\ \mathbf{else}:\\ \;\;\;\;\log 2 + \log x\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 99.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \log 2 + \log x \end{array} \]

FPCore

(FPCore (x) :precision binary64 (+ (log 2.0) (log x)))

C

double code(double x) {
	return log(2.0) + log(x);
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = log(2.0d0) + log(x)
end function

Java

public static double code(double x) {
	return Math.log(2.0) + Math.log(x);
}

Python

def code(x):
	return math.log(2.0) + math.log(x)

Julia

function code(x)
	return Float64(log(2.0) + log(x))
end

MATLAB

function tmp = code(x)
	tmp = log(2.0) + log(x);
end

Wolfram

code[x_] := N[(N[Log[2.0], $MachinePrecision] + N[Log[x], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 51.9%

   \[\log \left(x + \sqrt{x \cdot x - 1}\right) \]
2. Add Preprocessing

3. Taylor expanded in x around inf 98.1%

   \[\leadsto \color{blue}{\log 2 + -1 \cdot \log \left(\frac{1}{x}\right)} \]
4. Step-by-step derivation

   1. mul-1-neg 98.1%

      \[\leadsto \log 2 + \color{blue}{\left(-\log \left(\frac{1}{x}\right)\right)} \]

   2. log-rec 98.1%

      \[\leadsto \log 2 + \left(-\color{blue}{\left(-\log x\right)}\right) \]

   3. remove-double-neg 98.1%

      \[\leadsto \log 2 + \color{blue}{\log x} \]

5. Simplified 98.1%

   \[\leadsto \color{blue}{\log 2 + \log x} \]

6. Final simplification 98.1%

   \[\leadsto \log 2 + \log x \]
7. Add Preprocessing

Alternative 3: 99.2% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \log \left(x + x\right) \end{array} \]

FPCore

(FPCore (x) :precision binary64 (log (+ x x)))

C

double code(double x) {
	return log((x + x));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = log((x + x))
end function

Java

public static double code(double x) {
	return Math.log((x + x));
}

Python

def code(x):
	return math.log((x + x))

Julia

function code(x)
	return log(Float64(x + x))
end

MATLAB

function tmp = code(x)
	tmp = log((x + x));
end

Wolfram

code[x_] := N[Log[N[(x + x), $MachinePrecision]], $MachinePrecision]

Derivation

1. Initial program 51.9%

   \[\log \left(x + \sqrt{x \cdot x - 1}\right) \]
2. Add Preprocessing

3. Taylor expanded in x around inf 98.1%

   \[\leadsto \log \left(x + \color{blue}{x}\right) \]

4. Final simplification 98.1%

   \[\leadsto \log \left(x + x\right) \]
5. Add Preprocessing

Alternative 4: 3.1% accurate, 207.0× speedup

Math

\[\begin{array}{l} \\ 0 \end{array} \]

FPCore

(FPCore (x) :precision binary64 0.0)

C

double code(double x) {
	return 0.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = 0.0d0
end function

Java

public static double code(double x) {
	return 0.0;
}

Python

def code(x):
	return 0.0

Julia

function code(x)
	return 0.0
end

MATLAB

function tmp = code(x)
	tmp = 0.0;
end

Wolfram

code[x_] := 0.0

Derivation

1. Initial program 51.9%

   \[\log \left(x + \sqrt{x \cdot x - 1}\right) \]
2. Add Preprocessing

3. Taylor expanded in x around inf 98.1%

   \[\leadsto \log \left(x + \color{blue}{x}\right) \]
4. Step-by-step derivation

   1. add-sqr-sqrt 98.0%

      \[\leadsto \log \color{blue}{\left(\sqrt{x + x} \cdot \sqrt{x + x}\right)} \]

   2. log-prod 98.0%

      \[\leadsto \color{blue}{\log \left(\sqrt{x + x}\right) + \log \left(\sqrt{x + x}\right)} \]

5. Applied egg-rr 0.0%

   \[\leadsto \color{blue}{\log \left(\frac{0}{0}\right) + \log \left(\frac{0}{0}\right)} \]

7. Simplified 3.1%

   \[\leadsto \color{blue}{0} \]

8. Final simplification 3.1%

   \[\leadsto 0 \]
9. Add Preprocessing

Developer target: 99.9% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \log \left(x + \sqrt{x - 1} \cdot \sqrt{x + 1}\right) \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (log (+ x (* (sqrt (- x 1.0)) (sqrt (+ x 1.0))))))

C

double code(double x) {
	return log((x + (sqrt((x - 1.0)) * sqrt((x + 1.0)))));
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = log((x + (sqrt((x - 1.0d0)) * sqrt((x + 1.0d0)))))
end function

Java

public static double code(double x) {
	return Math.log((x + (Math.sqrt((x - 1.0)) * Math.sqrt((x + 1.0)))));
}

Python

def code(x):
	return math.log((x + (math.sqrt((x - 1.0)) * math.sqrt((x + 1.0)))))

Julia

function code(x)
	return log(Float64(x + Float64(sqrt(Float64(x - 1.0)) * sqrt(Float64(x + 1.0)))))
end

MATLAB

function tmp = code(x)
	tmp = log((x + (sqrt((x - 1.0)) * sqrt((x + 1.0)))));
end

Wolfram

code[x_] := N[Log[N[(x + N[(N[Sqrt[N[(x - 1.0), $MachinePrecision]], $MachinePrecision] * N[Sqrt[N[(x + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]

Reproduce

herbie shell --seed 2024076 
(FPCore (x)
  :name "Rust f64::acosh"
  :precision binary64
  :pre (>= x 1.0)

  :alt
  (log (+ x (* (sqrt (- x 1.0)) (sqrt (+ x 1.0)))))

  (log (+ x (sqrt (- (* x x) 1.0)))))