What does Zero-Touch Sites, Payment Anti-Fraud and Cashflow Queues conclude, in numbers, about “Availability: Shared Kernels, Standby Nodes and Blue-Green Draining”?
Answer: Chapter 5 shows that a standby node and canary releases cut the time all 30 sites are down together to 6.53 minutes a year, and that the drain time of a blue-green switch is set by the longest streamed requests.
Scope of the numbers: Marked boxes separate evidence, 16 runnable Python programs, historical sources and hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 6.53
node availability: 0.99900 architecture down min/site/yr all-30-down min/yr SOLO 545.60 545.60 EACH 526.27 0.00 PAIR 24.53 24.53 PAIR+canary 7.13 6.53 bad-deploy minutes on a shared kernel: 20.0 Reading: a passive standby removes almost all hardware downtime, leaving bad deploys as the main risk of a shared kernel - they take every site down together. A one-site canary cuts that tenfold. Thirty separate nodes avoid joint outages but each site is down far longer than with the pair.
Show the full program
# Chapter 5. [p09] Availability: one shared kernel or thirty, and deploys.
# A node fails 4 times a year and takes 131.4 minutes to repair, so it
# is up 0.999 of the time. Architectures for 30 sites:
# SOLO - one shared node; any failure takes all 30 sites down;
# EACH - 30 nodes, one per site (30 times the operating work);
# PAIR - a shared active node with a passive standby; a failure of
# the active node costs a 60 s switch-over; both down only
# if the standby fails during a repair.
# Bad deploys: 100 deploys a year, 2% of them bad, each found and
# rolled back in 10 minutes. On a shared kernel a bad deploy hits all
# 30 sites; with a canary (one site first) 90% are caught on the canary.
# Reported per year: minutes each site is down, and minutes during
# which all 30 sites are down together.
YEAR = 525600.0
F, MTTR, SWITCH = 4.0, 131.4, 1.0
DEPLOYS, BAD, FIX, CANARY = 100, 0.02, 10.0, 0.9
if __name__ == "__main__":
a = 1 - F * MTTR / YEAR
print(" node availability: {:.5f}".format(a))
solo = F * MTTR
pair_both = F * MTTR * (F * MTTR / YEAR)
pair = F * SWITCH + pair_both
bad = DEPLOYS * BAD * FIX
canary_site = bad * (1 - CANARY) + bad * CANARY / 30
canary_all = bad * (1 - CANARY)
rows = [
("SOLO", solo + bad, solo + bad),
("EACH", solo + bad / 30, 0.0),
("PAIR", pair + bad, pair + bad),
("PAIR+canary", pair + canary_site, pair + canary_all),
]
print(" architecture down min/site/yr all-30-down min/yr")
for name, site, alld in rows:
print(" {:14s} {:17.2f} {:20.2f}".format(name, site, alld))
print(" bad-deploy minutes on a shared kernel: {:.1f}".format(bad))
print("\nReading: a passive standby removes almost all hardware")
print("downtime, leaving bad deploys as the main risk of a shared")
print("kernel - they take every site down together. A one-site")
print("canary cuts that tenfold. Thirty separate nodes avoid joint")
print("outages but each site is down far longer than with the pair.")Single source and citation
Fan, Y. (2026). Zero-Touch Multi-Site Fault Tolerance, Payment Anti-Fraud State Machines and Passive Cashflow Queuing (Version 1.0.0), Chapter 5: Availability: Shared Kernels, Standby Nodes and Blue-Green Draining. 5D Library. https://doi.org/10.5281/zenodo.24090201
DOI: 10.5281/zenodo.24090201 · Read the monograph · 5DL-B-075 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026075,
author = {Fan, Yafu},
title = {Zero-Touch Multi-Site Fault Tolerance, Payment Anti-Fraud State Machines and Passive Cashflow Queuing},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090201},
url = {https://doi.org/10.5281/zenodo.24090201}
}Other chapter answers in this book
- Chapter 1 · Transfer Receipts: Deduplication, Image Hashes and Release-Then-Audit
- Chapter 2 · Self-Referral and "Invite Friends to Unlock"
- Chapter 3 · The Order State Machine: Exhaustive Checking and the Idempotency Window
- Chapter 4 · Thirty Sites on One Kernel: Queues and Tail Latency
- Chapter 6 · Allocating Traffic, Promoting Domains and Holding Cash
- Chapter 7 · Matched Tallies, Banknote Seals and Liu Yan's Canal
- Chapter 8 · A Nine-Flag Audit and a Pre-Registered Experiment