Physical Chemistry · Anno MMXXVI

Eliah

The Eckart tunnelling coefficient, computed accurately where the textbook formula fails, and checked against certified values
Sabrina Hackfort · Independent Researcher · ORCID 0009-0007-7458-2487
❦ ❦ ❦
And Elijah took his mantle, and wrapped it together, and smote the waters, and they were divided hither and thither, so that they two went over on dry ground. 2 Kings 2:8

A hydrogen atom does not always climb over the barrier of a chemical reaction. Often it passes through. The factor by which this changes the rate, the tunnelling coefficient κ, routinely enters rate calculations for hydrogen transfer, and its standard one-dimensional model is the Eckart barrier (Eckart 1930; Johnston and Heicklen 1962). The formula is exact and short, and many kinetics codes implement it. Implemented naively, it can fail in two regions, mostly without a warning. ELIAH computes κ correctly in both and is checked against 1197 values certified by ball arithmetic: the worst relative error is 4,5·10⁻¹⁴, thirteen significant digits.

Plate I

Through the Wall

A wave packet runs into an Eckart barrier. Practically none of it has enough energy to reach the top of the barrier. Watch the far side.

position →
time →
the barrier
reflected
tunnelled
 
Probability density of a Gaussian wave packet (ħ = m = 1, width σ = 15, starting at x = −100) meeting the barrier V₀/cosh²(x/a), over position (left to right) and time (back to front). It is the time-dependent Schrödinger equation itself, solved in your browser by the split-step Fourier method on 2048 grid points. The share of the packet that has more energy than the barrier top is shown; it is too small to matter, so what arrives on the far side has tunnelled. ELIAH’s number is its exact transmission probability P(E), averaged over the energies in the packet. Simulation and formula agree to about one part in ten thousand; the rest is the finite time step. Energy is given as a fraction of the barrier height V₀; α = 2πV₀/hν is the barrier parameter of Johnston and Heicklen, here α = πa√(2V₀) with V₀ = 1. Drag the plate to turn it.

Two Silent Failures

A common arrangement of the Eckart transmission probability (used, for example, in RMG-Py), with A and B from the energy and D from the barrier, is

P = 1 − (cosh(A − B) + cosh D) / (cosh(A + B) + cosh D)
It returns wrong numbers, not error messages
  1. Cancellation. Below about 10⁻¹⁶ the difference 1 − (…) is exactly zero in double precision. At low temperature these deep-tunnelling energies carry much of the thermal average, so κ comes out too small.
  2. Small barriers. When 4√(V₁V₂) < hν, the quantity 2πd is imaginary and cosh 2πd must become cos 2π|d| (Johnston and Heicklen 1962; Brown 1981). Taking the cosh of the absolute value instead makes κ too small, by up to 98 % on the certified grid and more for smaller barriers, often below one where the true κ exceeds one.

ELIAH evaluates the same probability without the subtraction, in logarithms and with the correct branch for D,

P = 2 sinh A sinh B / (cosh(A + B) + cosh D)

where cosh D becomes cos |D| for small barriers. There the denominator is written as a sum of two non-negative terms,

cosh(A + B) + cos |D| = 2 sinh²((A + B)/2) + 2 cos²(|D|/2),

so it cannot cancel either. ELIAH computes 1 − P directly where P is close to one and integrates the thermal average adaptively in t = √ε. Every result comes with ln κ, which stays finite where κ overflows, a quadrature error estimate, and a rigorous bound on the truncated tail.

Plate II

The Library, Live

This is ELIAH itself: the Rust library compiled to WebAssembly, 48 kilobytes, computing on this page. Beside it runs the textbook arrangement, integrated with an equally accurate quadrature, so that only the arithmetic of P differs. Choose a barrier.

Loading the library…
ELIAHtextbook arrangement
κ over temperature for the barrier you set. Where the two curves lie on each other, the textbook formula is fine; where they part, it is wrong. V₁ and V₂ are the barrier heights from the reactant and the product side, used as given (pass zero-point-corrected values for the usual model); ν‡ is the imaginary frequency, whose sign does not matter. The browser build is ELIAH 0.3.0: on all 1197 certified points it agrees with the certified values to 4,5·10⁻¹⁴ and with the native library to 7·10⁻¹⁵.
Plate III

The Certified Map

The reference values were computed with Arb ball arithmetic: each is an interval that provably contains the exact κ. They span barriers α from 0,5 to 100 on both sides and u* = hν/kBT from 0,05 to 30. Every layer below is one u*; low temperature is to the right of the slider.

 
both within 10⁻⁶ textbook fails: cancellation textbook fails: small-barrier branch
One square per certified point (α₁ ≤ α₂, since κ is symmetric); touch or hover one for its numbers. ELIAH meets every one of the 1197 values within 10⁻¹², the worst at 4,5·10⁻¹⁴. The textbook arrangement, recomputed with this page’s code in IEEE double precision, misses 219 of them by more than one part in a million: 102 in the small-barrier branch, where it fails at every temperature, and 117 from cancellation, from u* = 6 upward, which for ν‡ = 1000 cm⁻¹ means below 240 K. Run in Python, whose math.cosh raises an error on overflow instead of returning infinity, the same arrangement fails 256.

One Core, Every Language

The numerical core is written in Rust. Python needs no compiler: a pure-Python port gives bit-identical results on all certified points. The C interface serves C, Fortran and anything that can call C. A new header-only C++ layer turns its error codes into exceptions; it passes all 1197 certified points with GCC and with Clang.

pip3 install "git+https://github.com/sectio-aurea-q/eliah"
import eliah
# V₁, V₂ in J/mol, ν‡ in cm⁻¹ (sign ignored), T in K
print(eliah.kappa_si(160e3, 160e3, -1200.0, 200.0))
# 32639.069650545443
# barriers in k_BT, u = hν/k_BT
print(eliah.kappa(4.0, 4.0, 2.0))
# 1.2222728996934293

Tested Against Certified Values

TestPointsWorst relative error
Certified Arb grid, α 0,5–100, u* 0,05–301197 / 1197 within 10⁻¹²4,5·10⁻¹⁴
— of which in the small-barrier branch1027,8·10⁻¹⁶
Independent 50-digit reference, random, v up to 500303 / 303 within 10⁻¹³7,7·10⁻¹⁴
Independent 50-digit reference, v 10⁻⁴–5·10⁴, u 0,0035–300197 / 197 within 3·10⁻¹²2,2·10⁻¹²

The independent reference starts from the Eckart potential itself, with the closed-form P(E) checked against a direct numerical solution of the Schrödinger equation (agreement 4·10⁻¹³). On the certified grid the largest error, 4,5·10⁻¹⁴, is at κ ≈ 10⁹⁸. Beyond the grid it grows with α, to 2,2·10⁻¹² for α₁ ≈ 10⁶, α₂ ≈ 4·10⁷ (κ ≈ 1). Both come from rounding in large arguments.

Any implementation that can be called from Python can run the same test:

# conformance/conformance.py in the repository
# my_kappa(v1, v2, u): barriers in k_BT, u = hν/k_BT
from conformance import run
run(my_kappa, tol=1e-6)

Reported Upstream

The defects were reported to the maintainers of three open-source chemistry codes in October 2026; the TAMkin and pysisyphus reports already used this library, then called NETI, as the reference:

What It Does Not Claim

ELIAH is the one-dimensional Eckart model and nothing more: not multidimensional tunnelling, not instanton theory, not small-curvature tunnelling. It is validated against certified and independent high-precision values; a single call is not itself a certified computation, and a ball-arithmetic mode for per-call enclosures is planned. The certified grid covers 0,5 ≤ α ≤ 100 and 0,05 ≤ u* ≤ 30. Beyond it the evidence is the independent 50-digit reference, and the error grows slowly, to about 2·10⁻¹² for α up to 4·10⁷.

Use and Cite

Source, tests and the certified grid: github.com/sectio-aurea-q/eliah, under the Apache-2.0 licence. Cite it as doi:10.5281/zenodo.23485066. ELIAH is the reference behind the boundary of the Hackfort Equation. It is named after the prophet Elijah, who crossed the Jordan on dry ground; until version 0.3.0 it was called NETI, and the renaming changed no number.