Rust f64::acosh

Percentage Accurate: 51.3% → 99.6%
Time: 4.0s
Alternatives: 3
Speedup: 2.0×

Specification

?
\[x \geq 1\]
\[\begin{array}{l} \\ \cosh^{-1} x \end{array} \]
(FPCore (x) :precision binary64 (acosh x))
double code(double x) {
	return acosh(x);
}
def code(x):
	return math.acosh(x)
function code(x)
	return acosh(x)
end
function tmp = code(x)
	tmp = acosh(x);
end
code[x_] := N[ArcCosh[x], $MachinePrecision]
\begin{array}{l}

\\
\cosh^{-1} x
\end{array}

Sampling outcomes in binary64 precision:

Local Percentage Accuracy vs ?

The average percentage accuracy by input value. Horizontal axis shows value of an input variable; the variable is choosen in the title. Vertical axis is accuracy; higher is better. Red represent the original program, while blue represents Herbie's suggestion. These can be toggled with buttons below the plot. The line is an average while dots represent individual samples.

Accuracy vs Speed?

Herbie found 3 alternatives:

AlternativeAccuracySpeedup
The accuracy (vertical axis) and speed (horizontal axis) of each alternatives. Up and to the right is better. The red square shows the initial program, and each blue circle shows an alternative.The line shows the best available speed-accuracy tradeoffs.

Initial Program: 51.3% accurate, 1.0× speedup?

\[\begin{array}{l} \\ \log \left(x + \sqrt{x \cdot x - 1}\right) \end{array} \]
(FPCore (x) :precision binary64 (log (+ x (sqrt (- (* x x) 1.0)))))
double code(double x) {
	return log((x + sqrt(((x * x) - 1.0))));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = log((x + sqrt(((x * x) - 1.0d0))))
end function
public static double code(double x) {
	return Math.log((x + Math.sqrt(((x * x) - 1.0))));
}
def code(x):
	return math.log((x + math.sqrt(((x * x) - 1.0))))
function code(x)
	return log(Float64(x + sqrt(Float64(Float64(x * x) - 1.0))))
end
function tmp = code(x)
	tmp = log((x + sqrt(((x * x) - 1.0))));
end
code[x_] := N[Log[N[(x + N[Sqrt[N[(N[(x * x), $MachinePrecision] - 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}

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

Alternative 1: 99.6% accurate, 1.8× speedup?

\[\begin{array}{l} \\ \log \left(x \cdot 2 + \frac{-0.5 + \frac{-0.125}{x \cdot x}}{x}\right) \end{array} \]
(FPCore (x)
 :precision binary64
 (log (+ (* x 2.0) (/ (+ -0.5 (/ -0.125 (* x x))) x))))
double code(double x) {
	return log(((x * 2.0) + ((-0.5 + (-0.125 / (x * x))) / x)));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = log(((x * 2.0d0) + (((-0.5d0) + ((-0.125d0) / (x * x))) / x)))
end function
public static double code(double x) {
	return Math.log(((x * 2.0) + ((-0.5 + (-0.125 / (x * x))) / x)));
}
def code(x):
	return math.log(((x * 2.0) + ((-0.5 + (-0.125 / (x * x))) / x)))
function code(x)
	return log(Float64(Float64(x * 2.0) + Float64(Float64(-0.5 + Float64(-0.125 / Float64(x * x))) / x)))
end
function tmp = code(x)
	tmp = log(((x * 2.0) + ((-0.5 + (-0.125 / (x * x))) / x)));
end
code[x_] := N[Log[N[(N[(x * 2.0), $MachinePrecision] + N[(N[(-0.5 + N[(-0.125 / N[(x * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision] / x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}

\\
\log \left(x \cdot 2 + \frac{-0.5 + \frac{-0.125}{x \cdot x}}{x}\right)
\end{array}
Derivation
  1. Initial program 53.5%

    \[\log \left(x + \sqrt{x \cdot x - 1}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in x around inf

    \[\leadsto \mathsf{log.f64}\left(\color{blue}{\left(x \cdot \left(2 + -1 \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{{x}^{2}}\right)\right)}\right) \]
  4. Step-by-step derivation
    1. distribute-rgt-inN/A

      \[\leadsto \mathsf{log.f64}\left(\left(2 \cdot x + \left(-1 \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{{x}^{2}}\right) \cdot x\right)\right) \]
    2. +-lowering-+.f64N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\left(2 \cdot x\right), \left(\left(-1 \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{{x}^{2}}\right) \cdot x\right)\right)\right) \]
    3. *-commutativeN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\left(x \cdot 2\right), \left(\left(-1 \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{{x}^{2}}\right) \cdot x\right)\right)\right) \]
    4. *-lowering-*.f64N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(\left(-1 \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{{x}^{2}}\right) \cdot x\right)\right)\right) \]
    5. *-commutativeN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(x \cdot \left(-1 \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{{x}^{2}}\right)\right)\right)\right) \]
    6. mul-1-negN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(x \cdot \left(\mathsf{neg}\left(\frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{{x}^{2}}\right)\right)\right)\right)\right) \]
    7. distribute-neg-frac2N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(x \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{\mathsf{neg}\left({x}^{2}\right)}\right)\right)\right) \]
    8. associate-*r/N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(\frac{x \cdot \left(\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}\right)}{\mathsf{neg}\left({x}^{2}\right)}\right)\right)\right) \]
    9. unpow2N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(\frac{x \cdot \left(\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}\right)}{\mathsf{neg}\left(x \cdot x\right)}\right)\right)\right) \]
    10. distribute-rgt-neg-inN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(\frac{x \cdot \left(\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}\right)}{x \cdot \left(\mathsf{neg}\left(x\right)\right)}\right)\right)\right) \]
    11. mul-1-negN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(\frac{x \cdot \left(\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}\right)}{x \cdot \left(-1 \cdot x\right)}\right)\right)\right) \]
    12. times-fracN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(\frac{x}{x} \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{-1 \cdot x}\right)\right)\right) \]
    13. *-inversesN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(1 \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{-1 \cdot x}\right)\right)\right) \]
    14. mul-1-negN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(1 \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{\mathsf{neg}\left(x\right)}\right)\right)\right) \]
    15. distribute-neg-frac2N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(1 \cdot \left(\mathsf{neg}\left(\frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{x}\right)\right)\right)\right)\right) \]
    16. distribute-rgt-neg-outN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{*.f64}\left(x, 2\right), \left(\mathsf{neg}\left(1 \cdot \frac{\frac{1}{2} + \frac{1}{8} \cdot \frac{1}{{x}^{2}}}{x}\right)\right)\right)\right) \]
  5. Simplified100.0%

    \[\leadsto \log \color{blue}{\left(x \cdot 2 + \frac{-0.5 + \frac{-0.125}{x \cdot x}}{x}\right)} \]
  6. Add Preprocessing

Alternative 2: 99.5% accurate, 1.9× speedup?

\[\begin{array}{l} \\ \log \left(x + \left(x + \frac{-0.5}{x}\right)\right) \end{array} \]
(FPCore (x) :precision binary64 (log (+ x (+ x (/ -0.5 x)))))
double code(double x) {
	return log((x + (x + (-0.5 / x))));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = log((x + (x + ((-0.5d0) / x))))
end function
public static double code(double x) {
	return Math.log((x + (x + (-0.5 / x))));
}
def code(x):
	return math.log((x + (x + (-0.5 / x))))
function code(x)
	return log(Float64(x + Float64(x + Float64(-0.5 / x))))
end
function tmp = code(x)
	tmp = log((x + (x + (-0.5 / x))));
end
code[x_] := N[Log[N[(x + N[(x + N[(-0.5 / x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}

\\
\log \left(x + \left(x + \frac{-0.5}{x}\right)\right)
\end{array}
Derivation
  1. Initial program 53.5%

    \[\log \left(x + \sqrt{x \cdot x - 1}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in x around inf

    \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \color{blue}{\left(x \cdot \left(1 - \frac{1}{2} \cdot \frac{1}{{x}^{2}}\right)\right)}\right)\right) \]
  4. Step-by-step derivation
    1. sub-negN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \left(x \cdot \left(1 + \left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{{x}^{2}}\right)\right)\right)\right)\right)\right) \]
    2. distribute-lft-inN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \left(x \cdot 1 + x \cdot \left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{{x}^{2}}\right)\right)\right)\right)\right) \]
    3. *-rgt-identityN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \left(x + x \cdot \left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{{x}^{2}}\right)\right)\right)\right)\right) \]
    4. +-lowering-+.f64N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(x \cdot \left(\mathsf{neg}\left(\frac{1}{2} \cdot \frac{1}{{x}^{2}}\right)\right)\right)\right)\right)\right) \]
    5. associate-*r/N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(x \cdot \left(\mathsf{neg}\left(\frac{\frac{1}{2} \cdot 1}{{x}^{2}}\right)\right)\right)\right)\right)\right) \]
    6. metadata-evalN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(x \cdot \left(\mathsf{neg}\left(\frac{\frac{1}{2}}{{x}^{2}}\right)\right)\right)\right)\right)\right) \]
    7. distribute-neg-fracN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(x \cdot \frac{\mathsf{neg}\left(\frac{1}{2}\right)}{{x}^{2}}\right)\right)\right)\right) \]
    8. metadata-evalN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(x \cdot \frac{\frac{-1}{2}}{{x}^{2}}\right)\right)\right)\right) \]
    9. associate-*r/N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(\frac{x \cdot \frac{-1}{2}}{{x}^{2}}\right)\right)\right)\right) \]
    10. unpow2N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(\frac{x \cdot \frac{-1}{2}}{x \cdot x}\right)\right)\right)\right) \]
    11. times-fracN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(\frac{x}{x} \cdot \frac{\frac{-1}{2}}{x}\right)\right)\right)\right) \]
    12. *-inversesN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(1 \cdot \frac{\frac{-1}{2}}{x}\right)\right)\right)\right) \]
    13. metadata-evalN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(1 \cdot \frac{\mathsf{neg}\left(\frac{1}{2}\right)}{x}\right)\right)\right)\right) \]
    14. distribute-neg-fracN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \left(1 \cdot \left(\mathsf{neg}\left(\frac{\frac{1}{2}}{x}\right)\right)\right)\right)\right)\right) \]
    15. *-lowering-*.f64N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(1, \left(\mathsf{neg}\left(\frac{\frac{1}{2}}{x}\right)\right)\right)\right)\right)\right) \]
    16. distribute-neg-fracN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(1, \left(\frac{\mathsf{neg}\left(\frac{1}{2}\right)}{x}\right)\right)\right)\right)\right) \]
    17. metadata-evalN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(1, \left(\frac{\frac{-1}{2}}{x}\right)\right)\right)\right)\right) \]
    18. /-lowering-/.f6499.9%

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \mathsf{+.f64}\left(x, \mathsf{*.f64}\left(1, \mathsf{/.f64}\left(\frac{-1}{2}, x\right)\right)\right)\right)\right) \]
  5. Simplified99.9%

    \[\leadsto \log \left(x + \color{blue}{\left(x + 1 \cdot \frac{-0.5}{x}\right)}\right) \]
  6. Step-by-step derivation
    1. +-commutativeN/A

      \[\leadsto \mathsf{log.f64}\left(\left(\left(x + 1 \cdot \frac{\frac{-1}{2}}{x}\right) + x\right)\right) \]
    2. +-lowering-+.f64N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\left(x + 1 \cdot \frac{\frac{-1}{2}}{x}\right), x\right)\right) \]
    3. +-lowering-+.f64N/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{+.f64}\left(x, \left(1 \cdot \frac{\frac{-1}{2}}{x}\right)\right), x\right)\right) \]
    4. *-lft-identityN/A

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{+.f64}\left(x, \left(\frac{\frac{-1}{2}}{x}\right)\right), x\right)\right) \]
    5. /-lowering-/.f6499.9%

      \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(\mathsf{+.f64}\left(x, \mathsf{/.f64}\left(\frac{-1}{2}, x\right)\right), x\right)\right) \]
  7. Applied egg-rr99.9%

    \[\leadsto \log \color{blue}{\left(\left(x + \frac{-0.5}{x}\right) + x\right)} \]
  8. Final simplification99.9%

    \[\leadsto \log \left(x + \left(x + \frac{-0.5}{x}\right)\right) \]
  9. Add Preprocessing

Alternative 3: 99.0% accurate, 2.0× speedup?

\[\begin{array}{l} \\ \log \left(x + x\right) \end{array} \]
(FPCore (x) :precision binary64 (log (+ x x)))
double code(double x) {
	return log((x + x));
}
real(8) function code(x)
    real(8), intent (in) :: x
    code = log((x + x))
end function
public static double code(double x) {
	return Math.log((x + x));
}
def code(x):
	return math.log((x + x))
function code(x)
	return log(Float64(x + x))
end
function tmp = code(x)
	tmp = log((x + x));
end
code[x_] := N[Log[N[(x + x), $MachinePrecision]], $MachinePrecision]
\begin{array}{l}

\\
\log \left(x + x\right)
\end{array}
Derivation
  1. Initial program 53.5%

    \[\log \left(x + \sqrt{x \cdot x - 1}\right) \]
  2. Add Preprocessing
  3. Taylor expanded in x around inf

    \[\leadsto \mathsf{log.f64}\left(\mathsf{+.f64}\left(x, \color{blue}{x}\right)\right) \]
  4. Step-by-step derivation
    1. Simplified99.5%

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

    Developer Target 1: 99.9% accurate, 0.7× speedup?

    \[\begin{array}{l} \\ \log \left(x + \sqrt{x - 1} \cdot \sqrt{x + 1}\right) \end{array} \]
    (FPCore (x)
     :precision binary64
     (log (+ x (* (sqrt (- x 1.0)) (sqrt (+ x 1.0))))))
    double code(double x) {
    	return log((x + (sqrt((x - 1.0)) * sqrt((x + 1.0)))));
    }
    
    real(8) function code(x)
        real(8), intent (in) :: x
        code = log((x + (sqrt((x - 1.0d0)) * sqrt((x + 1.0d0)))))
    end function
    
    public static double code(double x) {
    	return Math.log((x + (Math.sqrt((x - 1.0)) * Math.sqrt((x + 1.0)))));
    }
    
    def code(x):
    	return math.log((x + (math.sqrt((x - 1.0)) * math.sqrt((x + 1.0)))))
    
    function code(x)
    	return log(Float64(x + Float64(sqrt(Float64(x - 1.0)) * sqrt(Float64(x + 1.0)))))
    end
    
    function tmp = code(x)
    	tmp = log((x + (sqrt((x - 1.0)) * sqrt((x + 1.0)))));
    end
    
    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]
    
    \begin{array}{l}
    
    \\
    \log \left(x + \sqrt{x - 1} \cdot \sqrt{x + 1}\right)
    \end{array}
    

    Reproduce

    ?
    herbie shell --seed 2024139 
    (FPCore (x)
      :name "Rust f64::acosh"
      :precision binary64
      :pre (>= x 1.0)
    
      :alt
      (! :herbie-platform default (log (+ x (* (sqrt (- x 1)) (sqrt (+ x 1))))))
    
      (log (+ x (sqrt (- (* x x) 1.0)))))