Rust f64::asinh

Percentage Accurate: 30.7% → 99.0%

Time: 10.9s

Alternatives: 7

Speedup: 1.1×

Specification

Math

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

FPCore

(FPCore (x) :precision binary64 (asinh x))

C

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

Python

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

Julia

function code(x)
	return asinh(x)
end

MATLAB

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

Wolfram

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

Initial Program: 30.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right) \end{array} \]

FPCore

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

C

double code(double x) {
	return copysign(log((fabs(x) + sqrt(((x * x) + 1.0)))), x);
}

Java

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

Python

def code(x):
	return math.copysign(math.log((math.fabs(x) + math.sqrt(((x * x) + 1.0)))), x)

Julia

function code(x)
	return copysign(log(Float64(abs(x) + sqrt(Float64(Float64(x * x) + 1.0)))), x)
end

MATLAB

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

Wolfram

code[x_] := N[With[{TMP1 = Abs[N[Log[N[(N[Abs[x], $MachinePrecision] + N[Sqrt[N[(N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]

Alternative 1: 99.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right)\\ t_1 := \left|x\right| + 1\\ \mathbf{if}\;t\_0 \leq -20:\\ \;\;\;\;\mathsf{copysign}\left(\log \left(\left|x\right| - x\right), x\right)\\ \mathbf{elif}\;t\_0 \leq 0.1:\\ \;\;\;\;\mathsf{copysign}\left(\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x \cdot x, \frac{\mathsf{fma}\left(-0.041666666666666664, \frac{3}{t\_1}, -0.125\right)}{t\_1}, \frac{0.5}{t\_1}\right), \mathsf{log1p}\left(\left|x\right|\right)\right), x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{copysign}\left(\log \left(x + \left|x\right|\right), x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (copysign (log (+ (fabs x) (sqrt (+ (* x x) 1.0)))) x))
        (t_1 (+ (fabs x) 1.0)))
   (if (<= t_0 -20.0)
     (copysign (log (- (fabs x) x)) x)
     (if (<= t_0 0.1)
       (copysign
        (fma
         (* x x)
         (fma
          (* x x)
          (/ (fma -0.041666666666666664 (/ 3.0 t_1) -0.125) t_1)
          (/ 0.5 t_1))
         (log1p (fabs x)))
        x)
       (copysign (log (+ x (fabs x))) x)))))

C

double code(double x) {
	double t_0 = copysign(log((fabs(x) + sqrt(((x * x) + 1.0)))), x);
	double t_1 = fabs(x) + 1.0;
	double tmp;
	if (t_0 <= -20.0) {
		tmp = copysign(log((fabs(x) - x)), x);
	} else if (t_0 <= 0.1) {
		tmp = copysign(fma((x * x), fma((x * x), (fma(-0.041666666666666664, (3.0 / t_1), -0.125) / t_1), (0.5 / t_1)), log1p(fabs(x))), x);
	} else {
		tmp = copysign(log((x + fabs(x))), x);
	}
	return tmp;
}

Julia

function code(x)
	t_0 = copysign(log(Float64(abs(x) + sqrt(Float64(Float64(x * x) + 1.0)))), x)
	t_1 = Float64(abs(x) + 1.0)
	tmp = 0.0
	if (t_0 <= -20.0)
		tmp = copysign(log(Float64(abs(x) - x)), x);
	elseif (t_0 <= 0.1)
		tmp = copysign(fma(Float64(x * x), fma(Float64(x * x), Float64(fma(-0.041666666666666664, Float64(3.0 / t_1), -0.125) / t_1), Float64(0.5 / t_1)), log1p(abs(x))), x);
	else
		tmp = copysign(log(Float64(x + abs(x))), x);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[With[{TMP1 = Abs[N[Log[N[(N[Abs[x], $MachinePrecision] + N[Sqrt[N[(N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]}, Block[{t$95$1 = N[(N[Abs[x], $MachinePrecision] + 1.0), $MachinePrecision]}, If[LessEqual[t$95$0, -20.0], N[With[{TMP1 = Abs[N[Log[N[(N[Abs[x], $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[t$95$0, 0.1], N[With[{TMP1 = Abs[N[(N[(x * x), $MachinePrecision] * N[(N[(x * x), $MachinePrecision] * N[(N[(-0.041666666666666664 * N[(3.0 / t$95$1), $MachinePrecision] + -0.125), $MachinePrecision] / t$95$1), $MachinePrecision] + N[(0.5 / t$95$1), $MachinePrecision]), $MachinePrecision] + N[Log[1 + N[Abs[x], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x + N[Abs[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]]]

Derivation

1. Split input into 3 regimes

2. if (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x) < -20

   1. Initial program 42.6%

      \[\mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(1 + -1 \cdot \frac{\left|x\right|}{x}\right)\right)\right)}, x\right) \]

      2. +-commutative N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\mathsf{neg}\left(x \cdot \color{blue}{\left(-1 \cdot \frac{\left|x\right|}{x} + 1\right)}\right)\right), x\right) \]

      3. distribute-lft-in N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\mathsf{neg}\left(\color{blue}{\left(x \cdot \left(-1 \cdot \frac{\left|x\right|}{x}\right) + x \cdot 1\right)}\right)\right), x\right) \]

      4. *-rgt-identity N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\mathsf{neg}\left(\left(x \cdot \left(-1 \cdot \frac{\left|x\right|}{x}\right) + \color{blue}{x}\right)\right)\right), x\right) \]

      5. distribute-neg-in N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\left(\mathsf{neg}\left(x \cdot \left(-1 \cdot \frac{\left|x\right|}{x}\right)\right)\right) + \left(\mathsf{neg}\left(x\right)\right)\right)}, x\right) \]

      6. mul-1-neg N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left(\mathsf{neg}\left(x \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{\left|x\right|}{x}\right)\right)}\right)\right) + \left(\mathsf{neg}\left(x\right)\right)\right), x\right) \]

      7. distribute-rgt-neg-out N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(x \cdot \frac{\left|x\right|}{x}\right)\right)}\right)\right) + \left(\mathsf{neg}\left(x\right)\right)\right), x\right) \]

      8. remove-double-neg N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{x \cdot \frac{\left|x\right|}{x}} + \left(\mathsf{neg}\left(x\right)\right)\right), x\right) \]

      9. sub-neg N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(x \cdot \frac{\left|x\right|}{x} - x\right)}, x\right) \]

      10. associate-*r/ N/A

          \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\frac{x \cdot \left|x\right|}{x}} - x\right), x\right) \]

      11. *-commutative N/A

          \[\leadsto \mathsf{copysign}\left(\log \left(\frac{\color{blue}{\left|x\right| \cdot x}}{x} - x\right), x\right) \]

      12. associate-/l* N/A

          \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\left|x\right| \cdot \frac{x}{x}} - x\right), x\right) \]

      13. *-inverses N/A

          \[\leadsto \mathsf{copysign}\left(\log \left(\left|x\right| \cdot \color{blue}{1} - x\right), x\right) \]

      14. *-rgt-identity N/A

          \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\left|x\right|} - x\right), x\right) \]

      15. lower--.f64 N/A

          \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\left|x\right| - x\right)}, x\right) \]

      16. lower-fabs.f64 100.0

          \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\left|x\right|} - x\right), x\right) \]

   5. Simplified 100.0%

      \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\left|x\right| - x\right)}, x\right) \]

   if -20 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x) < 0.10000000000000001

   1. Initial program 8.2%

      \[\mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \mathsf{copysign}\left(\color{blue}{\log \left(1 + \left|x\right|\right) + {x}^{2} \cdot \left(\frac{-1}{24} \cdot \left({x}^{2} \cdot \left(3 \cdot \frac{1}{1 + \left|x\right|} + 3 \cdot \frac{1}{{\left(1 + \left|x\right|\right)}^{2}}\right)\right) + \frac{1}{2} \cdot \frac{1}{1 + \left|x\right|}\right)}, x\right) \]
   4. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \mathsf{copysign}\left(\color{blue}{{x}^{2} \cdot \left(\frac{-1}{24} \cdot \left({x}^{2} \cdot \left(3 \cdot \frac{1}{1 + \left|x\right|} + 3 \cdot \frac{1}{{\left(1 + \left|x\right|\right)}^{2}}\right)\right) + \frac{1}{2} \cdot \frac{1}{1 + \left|x\right|}\right) + \log \left(1 + \left|x\right|\right)}, x\right) \]

      2. unpow2 N/A

         \[\leadsto \mathsf{copysign}\left(\color{blue}{\left(x \cdot x\right)} \cdot \left(\frac{-1}{24} \cdot \left({x}^{2} \cdot \left(3 \cdot \frac{1}{1 + \left|x\right|} + 3 \cdot \frac{1}{{\left(1 + \left|x\right|\right)}^{2}}\right)\right) + \frac{1}{2} \cdot \frac{1}{1 + \left|x\right|}\right) + \log \left(1 + \left|x\right|\right), x\right) \]

      3. associate-*l* N/A

         \[\leadsto \mathsf{copysign}\left(\color{blue}{x \cdot \left(x \cdot \left(\frac{-1}{24} \cdot \left({x}^{2} \cdot \left(3 \cdot \frac{1}{1 + \left|x\right|} + 3 \cdot \frac{1}{{\left(1 + \left|x\right|\right)}^{2}}\right)\right) + \frac{1}{2} \cdot \frac{1}{1 + \left|x\right|}\right)\right)} + \log \left(1 + \left|x\right|\right), x\right) \]

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\color{blue}{\mathsf{fma}\left(x, x \cdot \left(\frac{-1}{24} \cdot \left({x}^{2} \cdot \left(3 \cdot \frac{1}{1 + \left|x\right|} + 3 \cdot \frac{1}{{\left(1 + \left|x\right|\right)}^{2}}\right)\right) + \frac{1}{2} \cdot \frac{1}{1 + \left|x\right|}\right), \log \left(1 + \left|x\right|\right)\right)}, x\right) \]

   5. Simplified 99.7%

      \[\leadsto \mathsf{copysign}\left(\color{blue}{\mathsf{fma}\left(x, x \cdot \mathsf{fma}\left(-0.041666666666666664, \frac{x \cdot x}{1 + \left|x\right|} \cdot \left(3 + \frac{3}{1 + \left|x\right|}\right), \frac{0.5}{1 + \left|x\right|}\right), \mathsf{log1p}\left(\left|x\right|\right)\right)}, x\right) \]

   6. Taylor expanded in x around 0

      \[\leadsto \color{blue}{\mathsf{copysign}\left(\log \left(1 + \left|x\right|\right) + {x}^{2} \cdot \left(\frac{-1}{24} \cdot \frac{{x}^{2} \cdot \left(3 + 3 \cdot \frac{1}{1 + \left|x\right|}\right)}{1 + \left|x\right|} + \frac{1}{2} \cdot \frac{1}{1 + \left|x\right|}\right), x\right)} \]
   7. Step-by-step derivation

      1. lower-copysign.f64 N/A

         \[\leadsto \color{blue}{\mathsf{copysign}\left(\log \left(1 + \left|x\right|\right) + {x}^{2} \cdot \left(\frac{-1}{24} \cdot \frac{{x}^{2} \cdot \left(3 + 3 \cdot \frac{1}{1 + \left|x\right|}\right)}{1 + \left|x\right|} + \frac{1}{2} \cdot \frac{1}{1 + \left|x\right|}\right), x\right)} \]

   8. Simplified 99.7%

      \[\leadsto \color{blue}{\mathsf{copysign}\left(\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x \cdot x, \frac{\mathsf{fma}\left(-0.041666666666666664, \frac{3}{1 + \left|x\right|}, -0.125\right)}{1 + \left|x\right|}, \frac{0.5}{1 + \left|x\right|}\right), \mathsf{log1p}\left(\left|x\right|\right)\right), x\right)} \]

   if 0.10000000000000001 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x)

   1. Initial program 52.4%

      \[\mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. distribute-rgt-in N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(1 \cdot x + \frac{\left|x\right|}{x} \cdot x\right)}, x\right) \]

      2. *-lft-identity N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{x} + \frac{\left|x\right|}{x} \cdot x\right), x\right) \]

      3. associate-*l/ N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(x + \color{blue}{\frac{\left|x\right| \cdot x}{x}}\right), x\right) \]

      4. associate-/l* N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(x + \color{blue}{\left|x\right| \cdot \frac{x}{x}}\right), x\right) \]

      5. *-inverses N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(x + \left|x\right| \cdot \color{blue}{1}\right), x\right) \]

      6. *-rgt-identity N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(x + \color{blue}{\left|x\right|}\right), x\right) \]

      7. lower-+.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(x + \left|x\right|\right)}, x\right) \]

      8. lower-fabs.f64 100.0

         \[\leadsto \mathsf{copysign}\left(\log \left(x + \color{blue}{\left|x\right|}\right), x\right) \]

   5. Simplified 100.0%

      \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(x + \left|x\right|\right)}, x\right) \]
3. Recombined 3 regimes into one program.

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;\mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right) \leq -20:\\ \;\;\;\;\mathsf{copysign}\left(\log \left(\left|x\right| - x\right), x\right)\\ \mathbf{elif}\;\mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right) \leq 0.1:\\ \;\;\;\;\mathsf{copysign}\left(\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(x \cdot x, \frac{\mathsf{fma}\left(-0.041666666666666664, \frac{3}{\left|x\right| + 1}, -0.125\right)}{\left|x\right| + 1}, \frac{0.5}{\left|x\right| + 1}\right), \mathsf{log1p}\left(\left|x\right|\right)\right), x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{copysign}\left(\log \left(x + \left|x\right|\right), x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 98.9% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right)\\ \mathbf{if}\;t\_0 \leq -20:\\ \;\;\;\;\mathsf{copysign}\left(\log \left(\left|x\right| - x\right), x\right)\\ \mathbf{elif}\;t\_0 \leq 0.1:\\ \;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(\mathsf{fma}\left(x, x \cdot 0.5, \left|x\right|\right)\right), x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{copysign}\left(\log \left(x + \left|x\right|\right), x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (copysign (log (+ (fabs x) (sqrt (+ (* x x) 1.0)))) x)))
   (if (<= t_0 -20.0)
     (copysign (log (- (fabs x) x)) x)
     (if (<= t_0 0.1)
       (copysign (log1p (fma x (* x 0.5) (fabs x))) x)
       (copysign (log (+ x (fabs x))) x)))))

C

double code(double x) {
	double t_0 = copysign(log((fabs(x) + sqrt(((x * x) + 1.0)))), x);
	double tmp;
	if (t_0 <= -20.0) {
		tmp = copysign(log((fabs(x) - x)), x);
	} else if (t_0 <= 0.1) {
		tmp = copysign(log1p(fma(x, (x * 0.5), fabs(x))), x);
	} else {
		tmp = copysign(log((x + fabs(x))), x);
	}
	return tmp;
}

Julia

function code(x)
	t_0 = copysign(log(Float64(abs(x) + sqrt(Float64(Float64(x * x) + 1.0)))), x)
	tmp = 0.0
	if (t_0 <= -20.0)
		tmp = copysign(log(Float64(abs(x) - x)), x);
	elseif (t_0 <= 0.1)
		tmp = copysign(log1p(fma(x, Float64(x * 0.5), abs(x))), x);
	else
		tmp = copysign(log(Float64(x + abs(x))), x);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[With[{TMP1 = Abs[N[Log[N[(N[Abs[x], $MachinePrecision] + N[Sqrt[N[(N[(x * x), $MachinePrecision] + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]}, If[LessEqual[t$95$0, -20.0], N[With[{TMP1 = Abs[N[Log[N[(N[Abs[x], $MachinePrecision] - x), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], If[LessEqual[t$95$0, 0.1], N[With[{TMP1 = Abs[N[Log[1 + N[(x * N[(x * 0.5), $MachinePrecision] + N[Abs[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision], N[With[{TMP1 = Abs[N[Log[N[(x + N[Abs[x], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]]]

Derivation

1. Split input into 3 regimes

2. if (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x) < -20

   1. Initial program 50.9%

      \[\mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around -inf

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

      1. mul-1-neg N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\mathsf{neg}\left(x \cdot \left(1 + -1 \cdot \frac{\left|x\right|}{x}\right)\right)\right)}, x\right) \]

      2. +-commutative N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\mathsf{neg}\left(x \cdot \color{blue}{\left(-1 \cdot \frac{\left|x\right|}{x} + 1\right)}\right)\right), x\right) \]

      3. distribute-lft-in N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\mathsf{neg}\left(\color{blue}{\left(x \cdot \left(-1 \cdot \frac{\left|x\right|}{x}\right) + x \cdot 1\right)}\right)\right), x\right) \]

      4. *-rgt-identity N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\mathsf{neg}\left(\left(x \cdot \left(-1 \cdot \frac{\left|x\right|}{x}\right) + \color{blue}{x}\right)\right)\right), x\right) \]

      5. distribute-neg-in N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\left(\mathsf{neg}\left(x \cdot \left(-1 \cdot \frac{\left|x\right|}{x}\right)\right)\right) + \left(\mathsf{neg}\left(x\right)\right)\right)}, x\right) \]

      6. mul-1-neg N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left(\mathsf{neg}\left(x \cdot \color{blue}{\left(\mathsf{neg}\left(\frac{\left|x\right|}{x}\right)\right)}\right)\right) + \left(\mathsf{neg}\left(x\right)\right)\right), x\right) \]

      7. distribute-rgt-neg-out N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(x \cdot \frac{\left|x\right|}{x}\right)\right)}\right)\right) + \left(\mathsf{neg}\left(x\right)\right)\right), x\right) \]

      8. remove-double-neg N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{x \cdot \frac{\left|x\right|}{x}} + \left(\mathsf{neg}\left(x\right)\right)\right), x\right) \]

      9. sub-neg N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(x \cdot \frac{\left|x\right|}{x} - x\right)}, x\right) \]

      10. associate-*r/ N/A

          \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\frac{x \cdot \left|x\right|}{x}} - x\right), x\right) \]

      11. *-commutative N/A

          \[\leadsto \mathsf{copysign}\left(\log \left(\frac{\color{blue}{\left|x\right| \cdot x}}{x} - x\right), x\right) \]

      12. associate-/l* N/A

          \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\left|x\right| \cdot \frac{x}{x}} - x\right), x\right) \]

      13. *-inverses N/A

          \[\leadsto \mathsf{copysign}\left(\log \left(\left|x\right| \cdot \color{blue}{1} - x\right), x\right) \]

      14. *-rgt-identity N/A

          \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\left|x\right|} - x\right), x\right) \]

      15. lower--.f64 N/A

          \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\left|x\right| - x\right)}, x\right) \]

      16. lower-fabs.f64 99.8

          \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\left|x\right|} - x\right), x\right) \]

   5. Simplified 99.8%

      \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\left|x\right| - x\right)}, x\right) \]

   if -20 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x) < 0.10000000000000001

   1. Initial program 9.6%

      \[\mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right) \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-fabs.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\left|x\right|} + \sqrt{x \cdot x + 1}\right), x\right) \]

      2. lift-*.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{\color{blue}{x \cdot x} + 1}\right), x\right) \]

      3. lift-+.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{\color{blue}{x \cdot x + 1}}\right), x\right) \]

      4. lift-sqrt.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left|x\right| + \color{blue}{\sqrt{x \cdot x + 1}}\right), x\right) \]

      5. +-commutative N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\sqrt{x \cdot x + 1} + \left|x\right|\right)}, x\right) \]

      6. lower-+.f64 9.6

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\sqrt{x \cdot x + 1} + \left|x\right|\right)}, x\right) \]

      7. lift-+.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\sqrt{\color{blue}{x \cdot x + 1}} + \left|x\right|\right), x\right) \]

      8. lift-*.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\sqrt{\color{blue}{x \cdot x} + 1} + \left|x\right|\right), x\right) \]

      9. lower-fma.f64 9.6

         \[\leadsto \mathsf{copysign}\left(\log \left(\sqrt{\color{blue}{\mathsf{fma}\left(x, x, 1\right)}} + \left|x\right|\right), x\right) \]

   4. Applied egg-rr 9.6%

      \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(\sqrt{\mathsf{fma}\left(x, x, 1\right)} + \left|x\right|\right)}, x\right) \]

   5. Taylor expanded in x around 0

      \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\left(1 + \frac{1}{2} \cdot {x}^{2}\right)} + \left|x\right|\right), x\right) \]
   6. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\left(\frac{1}{2} \cdot {x}^{2} + 1\right)} + \left|x\right|\right), x\right) \]

      2. unpow2 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left(\frac{1}{2} \cdot \color{blue}{\left(x \cdot x\right)} + 1\right) + \left|x\right|\right), x\right) \]

      3. associate-*r* N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left(\color{blue}{\left(\frac{1}{2} \cdot x\right) \cdot x} + 1\right) + \left|x\right|\right), x\right) \]

      4. *-commutative N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left(\color{blue}{x \cdot \left(\frac{1}{2} \cdot x\right)} + 1\right) + \left|x\right|\right), x\right) \]

      5. lower-fma.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\mathsf{fma}\left(x, \frac{1}{2} \cdot x, 1\right)} + \left|x\right|\right), x\right) \]

      6. *-commutative N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\mathsf{fma}\left(x, \color{blue}{x \cdot \frac{1}{2}}, 1\right) + \left|x\right|\right), x\right) \]

      7. lower-*.f64 8.3

         \[\leadsto \mathsf{copysign}\left(\log \left(\mathsf{fma}\left(x, \color{blue}{x \cdot 0.5}, 1\right) + \left|x\right|\right), x\right) \]

   7. Simplified 8.3%

      \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\mathsf{fma}\left(x, x \cdot 0.5, 1\right)} + \left|x\right|\right), x\right) \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left(x \cdot \color{blue}{\left(x \cdot \frac{1}{2}\right)} + 1\right) + \left|x\right|\right), x\right) \]

      2. lift-*.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left(\color{blue}{x \cdot \left(x \cdot \frac{1}{2}\right)} + 1\right) + \left|x\right|\right), x\right) \]

      3. +-commutative N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{\left(1 + x \cdot \left(x \cdot \frac{1}{2}\right)\right)} + \left|x\right|\right), x\right) \]

      4. lift-fabs.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\left(1 + x \cdot \left(x \cdot \frac{1}{2}\right)\right) + \color{blue}{\left|x\right|}\right), x\right) \]

      5. associate-+l+ N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(1 + \left(x \cdot \left(x \cdot \frac{1}{2}\right) + \left|x\right|\right)\right)}, x\right) \]

      6. lower-log1p.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\color{blue}{\mathsf{log1p}\left(x \cdot \left(x \cdot \frac{1}{2}\right) + \left|x\right|\right)}, x\right) \]

      7. lift-*.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\mathsf{log1p}\left(\color{blue}{x \cdot \left(x \cdot \frac{1}{2}\right)} + \left|x\right|\right), x\right) \]

      8. lower-fma.f64 98.5

         \[\leadsto \mathsf{copysign}\left(\mathsf{log1p}\left(\color{blue}{\mathsf{fma}\left(x, x \cdot 0.5, \left|x\right|\right)}\right), x\right) \]

   9. Applied egg-rr 98.5%

      \[\leadsto \mathsf{copysign}\left(\color{blue}{\mathsf{log1p}\left(\mathsf{fma}\left(x, x \cdot 0.5, \left|x\right|\right)\right)}, x\right) \]

   if 0.10000000000000001 < (copysign.f64 (log.f64 (+.f64 (fabs.f64 x) (sqrt.f64 (+.f64 (*.f64 x x) #s(literal 1 binary64))))) x)

   1. Initial program 51.8%

      \[\mathsf{copysign}\left(\log \left(\left|x\right| + \sqrt{x \cdot x + 1}\right), x\right) \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. distribute-rgt-in N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(1 \cdot x + \frac{\left|x\right|}{x} \cdot x\right)}, x\right) \]

      2. *-lft-identity N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(\color{blue}{x} + \frac{\left|x\right|}{x} \cdot x\right), x\right) \]

      3. associate-*l/ N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(x + \color{blue}{\frac{\left|x\right| \cdot x}{x}}\right), x\right) \]

      4. associate-/l* N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(x + \color{blue}{\left|x\right| \cdot \frac{x}{x}}\right), x\right) \]

      5. *-inverses N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(x + \left|x\right| \cdot \color{blue}{1}\right), x\right) \]

      6. *-rgt-identity N/A

         \[\leadsto \mathsf{copysign}\left(\log \left(x + \color{blue}{\left|x\right|}\right), x\right) \]

      7. lower-+.f64 N/A

         \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(x + \left|x\right|\right)}, x\right) \]

      8. lower-fabs.f64 98.8

         \[\leadsto \mathsf{copysign}\left(\log \left(x + \color{blue}{\left|x\right|}\right), x\right) \]

   5. Simplified 98.8%

      \[\leadsto \mathsf{copysign}\left(\log \color{blue}{\left(x + \left|x\right|\right)}, x\right) \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Developer Target 1: 99.9% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \frac{1}{\left|x\right|}\\ \mathsf{copysign}\left(\mathsf{log1p}\left(\left|x\right| + \frac{\left|x\right|}{\mathsf{hypot}\left(1, t\_0\right) + t\_0}\right), x\right) \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (/ 1.0 (fabs x))))
   (copysign (log1p (+ (fabs x) (/ (fabs x) (+ (hypot 1.0 t_0) t_0)))) x)))

C

double code(double x) {
	double t_0 = 1.0 / fabs(x);
	return copysign(log1p((fabs(x) + (fabs(x) / (hypot(1.0, t_0) + t_0)))), x);
}

Java

public static double code(double x) {
	double t_0 = 1.0 / Math.abs(x);
	return Math.copySign(Math.log1p((Math.abs(x) + (Math.abs(x) / (Math.hypot(1.0, t_0) + t_0)))), x);
}

Python

def code(x):
	t_0 = 1.0 / math.fabs(x)
	return math.copysign(math.log1p((math.fabs(x) + (math.fabs(x) / (math.hypot(1.0, t_0) + t_0)))), x)

Julia

function code(x)
	t_0 = Float64(1.0 / abs(x))
	return copysign(log1p(Float64(abs(x) + Float64(abs(x) / Float64(hypot(1.0, t_0) + t_0)))), x)
end

Wolfram

code[x_] := Block[{t$95$0 = N[(1.0 / N[Abs[x], $MachinePrecision]), $MachinePrecision]}, N[With[{TMP1 = Abs[N[Log[1 + N[(N[Abs[x], $MachinePrecision] + N[(N[Abs[x], $MachinePrecision] / N[(N[Sqrt[1.0 ^ 2 + t$95$0 ^ 2], $MachinePrecision] + t$95$0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]], TMP2 = Sign[x]}, TMP1 * If[TMP2 == 0, 1, TMP2]], $MachinePrecision]]

Reproduce

herbie shell --seed 2024218 
(FPCore (x)
  :name "Rust f64::asinh"
  :precision binary64

  :alt
  (! :herbie-platform default (let* ((ax (fabs x)) (ix (/ 1 ax))) (copysign (log1p (+ ax (/ ax (+ (hypot 1 ix) ix)))) x)))

  (copysign (log (+ (fabs x) (sqrt (+ (* x x) 1.0)))) x))