What does Zero Trust for a One-Commander Empire conclude, in numbers, about “Token Lifetime: the Exposure Window and the Ceiling on Loss”?
Answer: The second half of p42 uses a burst of 20 and a rate of 60 per hour. With a lifetime of one hour, the worst case is 80 requests and the average 50. With six hours, 380 and 195. With one day, 1,460 and 666. With one week, 10,100 and 2,668. With one year, 525,620 and 4,304.
Scope of the numbers: The book is defensive only and describes no attack, intrusion, bypass or evasion technique; all hosts, domains and tokens are synthetic, parameters are illustrative, and all calculations are generated by its programs. It is general business analysis, not a security audit or legal advice, and any production change requires human review and sign-off.
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: 10100, 1460, 195, 20, 2668, 380
| rotation scope d L* grid L* sqrt cost/yr never-rot | |
| manual broad | 200 34.6 29.6 274.9 720.0 |
| manual scoped | 20 239.8 93.6 69.4 72.0 |
| auto broad | 200 6.1 5.9 58.4 720.0 |
| auto scoped | 20 20.6 18.7 17.9 72.0 |
| request ceiling while usable, burst 20 + 60 per hour: | |
| lifetime | 1 h: worst case 80, mean 50 |
| lifetime | 6 h: worst case 380, mean 195 |
| lifetime | 24 h: worst case 1,460, mean 666 |
| lifetime | 168 h: worst case 10,100, mean 2,668 |
| lifetime | 8,760 h: worst case 525,620, mean 4,304 |
Key formula
Show the full program
# Chapter 4. p42: best token lifetime and the loss ceiling it buys.
# Yearly cost of one token with lifetime L hours:
# C(L) = c 8760 / L + lam d E[W](L),
# c = operator hours per rotation, lam = leaks per token-year, d = loss
# units per hour a leaked token stays usable, E[W] from p41 (exponential
# revocation, mean 72 h). For L much shorter than 72 h, E[W] ~ L / 2 and
# the optimum is the square-root rule L* = sqrt(2 c 8760 / (lam d)).
# Ceiling: a token limited to r requests per hour with burst b can make at
# most b + r W requests while usable (token bucket, chapter 5).
# All parameters illustrative; one loss unit = one operator hour.
import math
M, LAM = 72.0, 0.05
def window(L):
return M * (1.0 - M / L * (1.0 - math.exp(-L / M)))
def cost(L, c, d):
return math.fsum([c * 8760.0 / L, LAM * d * window(L)])
def best(c, d):
grid = [math.exp(i / 200.0) for i in range(0, 1821)]
return min(grid, key=lambda L: cost(L, c, d))
if __name__ == "__main__":
print("rotation scope d L* grid L* sqrt cost/yr never-rot")
for c, ctag in ((0.5, "manual"), (0.02, "auto")):
for d, dtag in ((200.0, "broad"), (20.0, "scoped")):
L = best(c, d)
root = math.sqrt(2.0 * c * 8760.0 / (LAM * d))
print("{:<9} {:<7} {:>4.0f} {:>8.1f} {:>8.1f} {:>8.1f} {:>9.1f}"
.format(ctag, dtag, d, L, root, cost(L, c, d),
LAM * d * M))
b, r = 20, 60
print("request ceiling while usable, burst {} + {} per hour:".format(
b, r))
for L in (1.0, 6.0, 24.0, 168.0, 8760.0):
print(" lifetime {:>6,.0f} h: worst case {:>8,.0f}, mean {:>7,.0f}"
.format(L, b + r * min(L, 8760.0), b + r * window(L)))Single source and citation
Fan, Y. (2026). Zero-Trust Cybersecurity for a One-Commander Silicon Empire: Origin Cloaking, Secret Hygiene and Anti-Scraper Defense (Version 1.0.0), Chapter 4: Token Lifetime: the Exposure Window and the Ceiling on Loss. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-336 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026336,
author = {Fan, Yafu},
title = {Zero-Trust Cybersecurity for a One-Commander Silicon Empire: Origin Cloaking, Secret Hygiene and Anti-Scraper Defense},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Attack Surface: Beyond the Ports, Credentials Are the Front Door
- Chapter 2 · Blast Radius: the Cage of Least Privilege
- Chapter 3 · Credential Hygiene: Format Checks and Revocation Lists
- Chapter 5 · Anti-Scraper Defence: Token Buckets and Trap Pages
- Chapter 6 · Ransomware: Common-Cause Failure and the Ten-Second Stop
- Chapter 7 · The Classics Examined: Sunzi and Kerckhoffs
- Chapter 8 · Closing the Loop: a Monthly Check-up and Pre-Registered Tests