What does Zero Trust for a One-Commander Empire conclude, in numbers, about “The Classics Examined: Sunzi and Kerckhoffs”?

Answer: Three example rows follow. With an attack probability of 0.02, hoping costs 2.0 in expectation and preparing 5.2, so not preparing is cheaper; yet the chance of at least one attack within ten years is already 0.1829. With an attack probability of 0.10, hoping costs 10.0 and preparing 6.0, and the chance of at least one attack within ten years is 0.6513. With an attack probability of 0.30, the two cost 30.0 and 8.0, and the ten-year chance is 0.9718.

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: 0.02, 0.10, 0.1829, 0.30, 0.6513, 0.9718

break-even attack probability a*0.0556
worst regret: hope 85.0, ready 5.0
a0.02: hope 2.0, ready 5.2; P(>=1 in 10 y) 0.1829
a0.10: hope 10.0, ready 6.0; P(>=1 in 10 y) 0.6513
a0.30: hope 30.0, ready 8.0; P(>=1 in 10 y) 0.9718
one attempt passes all three layers0.006
10 attempts: P(breach) 0.0584
100 attempts: P(breach) 0.4522
1,000 attempts: P(breach) 0.9976
Show the full program
# Chapter 7. p72: "do not rely on their not coming; rely on being ready".
# Two policies under an unknown yearly attack probability a:
#   hope     no preparation cost; loss 100 if attacked;
#   ready    cost 5 a year; loss bounded at 10 if attacked.
# Expected yearly cost: hope 100 a, ready 5 + 10 a; break-even a* = 5/90.
# Regret = cost minus the better policy's cost at that a; the policy
# with the smaller worst-case regret is the minimax-regret choice.
# Second clause, "rely on being unassailable": with three independent
# layers failing per attempt with 0.1, 0.2, 0.3, one attempt gets through
# with 0.006; over n attempts the chance of at least one breach is
# 1 - (1 - 0.006)^n. All numbers illustrative.
import math

if __name__ == "__main__":
    a_star = 5.0 / 90.0
    print("break-even attack probability a* = {:.4f}".format(a_star))
    grid = [i / 1000.0 for i in range(1001)]
    reg_h = max(100.0 * a - min(100.0 * a, 5.0 + 10.0 * a) for a in grid)
    reg_r = max(5.0 + 10.0 * a - min(100.0 * a, 5.0 + 10.0 * a)
                for a in grid)
    print("worst regret: hope {:.1f}, ready {:.1f}".format(reg_h, reg_r))
    for a in (0.02, 0.1, 0.3):
        print("a = {:.2f}: hope {:>5.1f}, ready {:>5.1f}; P(>=1 in 10 y) "
              "{:.4f}".format(a, 100.0 * a, 5.0 + 10.0 * a,
                              1.0 - (1.0 - a) ** 10))
    p = math.prod([0.1, 0.2, 0.3])
    print("one attempt passes all three layers: {:.3f}".format(p))
    for n in (10, 100, 1000):
        print("  {:>5,} attempts: P(breach) {:.4f}".format(
            n, 1.0 - (1.0 - p) ** n))

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 7: The Classics Examined: Sunzi and Kerckhoffs. 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