What does Attention Residue and Sprint Scheduling conclude, in numbers, about “Sprint Length: Alertness Decay, Switching Cost and Where Ninety Minutes Came From”?

Answer: Chapter 3 solves for the optimal sprint length, set by the alertness decay constant and the switching cost and close to the square root of twice their product; across more than two thousand parameter combinations a fixed ninety minutes is near the optimum in a share of only 0.450.

Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. This is not medical, sleep, nutritional or mental-health advice, and it claims no health effect.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.450

A. linear decay, beta per minute
betaCL_optE_optE90/Eopt
0.004335.80.8570.926
0.004855.70.7770.969
0.0041572.90.7080.992
0.008324.50.8040.771
0.008837.40.7010.839
0.0081548.00.6160.891
B. grid of 2,360 cells (half-life x cost)
90 min within 2 % of optimum: exp 0.450, linear 0.410
optimal length (exp): p10 42.0median 112.1p90 194.9
Show the full program
# Chapter 3. p32: linear decay, and where a fixed 90 minutes is near-best
# Linear alertness a(t) = max(0, 1 - beta t). Efficiency
#   E(L) = (L - beta L^2 / 2) / (L + C)  for L <= 1 / beta,
# optimum L* = -C + sqrt(C^2 + 2 C / beta) (closed form).
# Region scan: half-life h = 20..600 min (exponential lam = h / ln 2;
# linear beta = 0.5 / h, same half-way point) and C = 1..40 min.
# Count grid cells where a fixed 90-minute sprint reaches >= 98 % of E*.
import math


def eff_lin(L, beta, c):
    L = min(L, 1.0 / beta)
    return (L - beta * L * L / 2.0) / (L + c)


def best_lin(beta, c):
    return min(-c + math.sqrt(c * c + 2.0 * c / beta), 1.0 / beta)


def eff_exp(L, lam, c):
    return lam * (1.0 - math.exp(-L / lam)) / (L + c)


def best_exp(lam, c):
    lo, hi = 1e-6, 50.0 * lam
    for _ in range(100):
        mid = 0.5 * (lo + hi)
        if math.exp(mid / lam) - 1.0 - (mid + c) / lam < 0.0:
            lo = mid
        else:
            hi = mid
    return 0.5 * (lo + hi)


print("A. linear decay, beta per minute")
print(" beta     C   L_opt  E_opt  E90/Eopt")
for beta in (0.004, 0.008):
    for c in (3.0, 8.0, 15.0):
        L = best_lin(beta, c)
        e = eff_lin(L, beta, c)
        print("{:>6.3f} {:>4.0f} {:>7.1f} {:>6.3f} {:>9.3f}".format(
            beta, c, L, e, eff_lin(90.0, beta, c) / e))

halves = [20.0 + 10.0 * i for i in range(59)]
costs = [float(c) for c in range(1, 41)]
hit_exp = 0
hit_lin = 0
lens = []
for h in halves:
    lam, beta = h / math.log(2.0), 0.5 / h
    for c in costs:
        le = best_exp(lam, c)
        lens.append(le)
        if eff_exp(90.0, lam, c) >= 0.98 * eff_exp(le, lam, c):
            hit_exp = hit_exp + 1
        ll = best_lin(beta, c)
        if eff_lin(90.0, beta, c) >= 0.98 * eff_lin(ll, beta, c):
            hit_lin = hit_lin + 1
cells = len(halves) * len(costs)
lens.sort()
print("B. grid of {:,} cells (half-life x cost)".format(cells))
print("   90 min within 2 % of optimum: exp {:.3f}, linear {:.3f}".format(
    hit_exp / cells, hit_lin / cells))
print("   optimal length (exp): p10 {:.1f}  median {:.1f}  p90 {:.1f}".format(
    lens[cells // 10], lens[cells // 2], lens[9 * cells // 10]))

Single source and citation

Fan, Y. (2026). Eliminating Attention Residue in Multi-Arena Command, Ultradian Energy Pacing and Rapid Context-Switching Protocols (Version 1.0.0), Chapter 3: Sprint Length: Alertness Decay, Switching Cost and Where Ninety Minutes Came From. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-362 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026362,
  author    = {Fan, Yafu},
  title     = {Eliminating Attention Residue in Multi-Arena Command, Ultradian Energy Pacing and Rapid Context-Switching Protocols},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book