The EMCHS heuristic prime gap bound

Let $p_n$ denote the $n$th prime, and let $\delta$ and $\epsilon$ be parameters in the ranges considered by the Enhanced Multidimensional Chaotic Heuristic Sieve (EMCHS), including $\delta=0$ or $0.3$ and small positive values such as $\epsilon=0.1$. Heuristic prime gap bound. Under the EMCHS model,

$$\liminf_{n\to\infty}(p_{n+1}-p_n)\leq \exp(2\delta-\epsilon)\,\ln\!\bigl(e^{2/\delta}\bigr).$$

For $\delta=0.3$ and $\epsilon=0.1$, the source gives the numerical consequence $\liminf(p_{n+1}-p_n)\leq 11$ and suggests that a gap of $8$ is attainable. These are explicitly heuristic estimates, not unconditional theorems, and the displayed formula is singular at $\delta=0$ unless an interpretation or limiting convention is supplied.