What does Zero Trust for a One-Commander Empire conclude, in numbers, about “Ransomware: Common-Cause Failure and the Ten-Second Stop”?

Answer: Chapter 6 shows that copies sharing a credential count as one, that a backup drilled once a year is broken at the moment of an incident with probability 0.7331, and that scripting the first three stop-bleed steps cuts 1,200 seconds to ten.

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.7331

interval hmean loss hworst loss h
10.51
63.06
2412.024
16884.0168
drill everyP(broken at incident)simulated
7 d0.03420.0338
30 d0.13610.1369
90 d0.34060.3375
365 d0.73310.7331
recovery time: online 1.84 h, offline 2.96 h

Key formula

\[1-\frac{1-e^{-\lambda D}}{\lambda D}.\]
Show the full program
# Chapter 6. p62: recovery point, recovery time and untested backups.
# Backups every Delta hours: an incident at a uniform time loses on
# average Delta / 2 hours of writes, at most Delta (recovery point).
# A backup job can break silently at rate lam per day (illustrative
# 0.01); a restore drill every D days finds the break. If the break is
# found only by a drill, the chance the backup is broken at a uniform
# incident time is 1 - (1 - e^(-lam D)) / (lam D).
# Recovery time = data size / throughput + verify + rebuild. 200 GB of
# data, online copy 200 MB/s, offline drive 40 MB/s, verify 0.5 h,
# rebuild 32 containers at 2 minutes each (all illustrative).
# Monte Carlo check of the broken share, 100,000 draws, seed 3621.
import math
import random

LAM = 0.01


def broken_share(D):
    x = LAM * D
    return 1.0 - (1.0 - math.exp(-x)) / x


def mc_broken(D, rng, n=100000):
    hits = 0
    for _ in range(n):
        t = rng.uniform(0.0, D)
        hits += 1 if rng.expovariate(LAM) < t else 0
    return hits / n


def rto_hours(mb_per_s):
    move = 200.0 * 1000.0 / mb_per_s / 3600.0
    return math.fsum([move, 0.5, 32 * 2.0 / 60.0])


if __name__ == "__main__":
    print("interval h   mean loss h   worst loss h")
    for delta in (1.0, 6.0, 24.0, 168.0):
        print("{:>10.0f} {:>13.1f} {:>14.0f}".format(delta, delta / 2.0,
                                                      delta))
    rng = random.Random(3621)
    print("drill every   P(broken at incident)   simulated")
    for D in (7, 30, 90, 365):
        print("{:>8} d {:>20.4f} {:>15.4f}".format(D, broken_share(D),
                                                    mc_broken(D, rng)))
    print("recovery time: online {:.2f} h, offline {:.2f} h".format(
        rto_hours(200.0), rto_hours(40.0)))

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 6: Ransomware: Common-Cause Failure and the Ten-Second Stop. 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