Rust f64::asinh

Percentage Accurate: 29.4% → 98.8%

Time: 12.1s

Alternatives: 13

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: 29.4% 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: 98.8% 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 := \sqrt{\mathsf{fma}\left(x, x, 1\right)}\\ t_2 := \left|x\right| - t\_1\\ \mathbf{if}\;t\_0 \leq -20:\\ \;\;\;\;\mathsf{copysign}\left(\log \left(\left|x\right| - x\right), x\right)\\ \mathbf{elif}\;t\_0 \leq 10:\\ \;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(\mathsf{fma}\left(\left|x\right|, t\_2, x \cdot x\right)\right) - \log \left(\frac{\mathsf{fma}\left(x, x, \mathsf{fma}\left(\left|x\right|, t\_2, 1\right)\right)}{\left|x\right| + t\_1}\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 (sqrt (fma x x 1.0)))
        (t_2 (- (fabs x) t_1)))
   (if (<= t_0 -20.0)
     (copysign (log (- (fabs x) x)) x)
     (if (<= t_0 10.0)
       (copysign
        (-
         (log1p (fma (fabs x) t_2 (* x x)))
         (log (/ (fma x x (fma (fabs x) t_2 1.0)) (+ (fabs x) t_1))))
        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 = sqrt(fma(x, x, 1.0));
	double t_2 = fabs(x) - t_1;
	double tmp;
	if (t_0 <= -20.0) {
		tmp = copysign(log((fabs(x) - x)), x);
	} else if (t_0 <= 10.0) {
		tmp = copysign((log1p(fma(fabs(x), t_2, (x * x))) - log((fma(x, x, fma(fabs(x), t_2, 1.0)) / (fabs(x) + t_1)))), 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 = sqrt(fma(x, x, 1.0))
	t_2 = Float64(abs(x) - t_1)
	tmp = 0.0
	if (t_0 <= -20.0)
		tmp = copysign(log(Float64(abs(x) - x)), x);
	elseif (t_0 <= 10.0)
		tmp = copysign(Float64(log1p(fma(abs(x), t_2, Float64(x * x))) - log(Float64(fma(x, x, fma(abs(x), t_2, 1.0)) / Float64(abs(x) + t_1)))), 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[Sqrt[N[(x * x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Abs[x], $MachinePrecision] - t$95$1), $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, 10.0], N[With[{TMP1 = Abs[N[(N[Log[1 + N[(N[Abs[x], $MachinePrecision] * t$95$2 + N[(x * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] - N[Log[N[(N[(x * x + N[(N[Abs[x], $MachinePrecision] * t$95$2 + 1.0), $MachinePrecision]), $MachinePrecision] / N[(N[Abs[x], $MachinePrecision] + t$95$1), $MachinePrecision]), $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 51.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. Applied rewrites 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) < 10

   1. Initial program 12.5%

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

   4. Applied rewrites 98.6%

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

      1. lift-+.f64 N/A

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

      2. lift-log1p.f64 N/A

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

      3. lift-log.f64 N/A

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

      4. sum-log N/A

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

   6. Applied rewrites 98.6%

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

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

   1. Initial program 54.0%

      \[\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. Applied rewrites 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. Add Preprocessing

Alternative 2: 98.8% 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 := \sqrt{\mathsf{fma}\left(x, x, 1\right)}\\ t_2 := \left|x\right| - t\_1\\ \mathbf{if}\;t\_0 \leq -20:\\ \;\;\;\;\mathsf{copysign}\left(\log \left(\left|x\right| - x\right), x\right)\\ \mathbf{elif}\;t\_0 \leq 10:\\ \;\;\;\;\mathsf{copysign}\left(\mathsf{log1p}\left(\mathsf{fma}\left(x, x, \left|x\right| \cdot t\_2\right)\right) + \log \left(\frac{\left|x\right| + t\_1}{\mathsf{fma}\left(\left|x\right|, t\_2, \mathsf{fma}\left(x, x, 1\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 (sqrt (fma x x 1.0)))
        (t_2 (- (fabs x) t_1)))
   (if (<= t_0 -20.0)
     (copysign (log (- (fabs x) x)) x)
     (if (<= t_0 10.0)
       (copysign
        (+
         (log1p (fma x x (* (fabs x) t_2)))
         (log (/ (+ (fabs x) t_1) (fma (fabs x) t_2 (fma x x 1.0)))))
        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 = sqrt(fma(x, x, 1.0));
	double t_2 = fabs(x) - t_1;
	double tmp;
	if (t_0 <= -20.0) {
		tmp = copysign(log((fabs(x) - x)), x);
	} else if (t_0 <= 10.0) {
		tmp = copysign((log1p(fma(x, x, (fabs(x) * t_2))) + log(((fabs(x) + t_1) / fma(fabs(x), t_2, fma(x, x, 1.0))))), 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 = sqrt(fma(x, x, 1.0))
	t_2 = Float64(abs(x) - t_1)
	tmp = 0.0
	if (t_0 <= -20.0)
		tmp = copysign(log(Float64(abs(x) - x)), x);
	elseif (t_0 <= 10.0)
		tmp = copysign(Float64(log1p(fma(x, x, Float64(abs(x) * t_2))) + log(Float64(Float64(abs(x) + t_1) / fma(abs(x), t_2, fma(x, x, 1.0))))), 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[Sqrt[N[(x * x + 1.0), $MachinePrecision]], $MachinePrecision]}, Block[{t$95$2 = N[(N[Abs[x], $MachinePrecision] - t$95$1), $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, 10.0], N[With[{TMP1 = Abs[N[(N[Log[1 + N[(x * x + N[(N[Abs[x], $MachinePrecision] * t$95$2), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] + N[Log[N[(N[(N[Abs[x], $MachinePrecision] + t$95$1), $MachinePrecision] / N[(N[Abs[x], $MachinePrecision] * t$95$2 + N[(x * x + 1.0), $MachinePrecision]), $MachinePrecision]), $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 48.7%

      \[\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.9

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

   5. Applied rewrites 99.9%

      \[\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) < 10

   1. Initial program 10.3%

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

   4. Applied rewrites 97.9%

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

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

   1. Initial program 50.0%

      \[\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 99.8

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

   5. Applied rewrites 99.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: 100.0% 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 2024228 
(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))