Zero-Touch Multi-Site Fault Tolerance, Payment Anti-Fraud State Machines and Passive Cashflow Queuing: chapter answers
A digital service network of dozens of sites that share one program kernel and try to run without human work has to answer four questions: how to stop manual transfer receipts from being reused or forged, how self-referral commissions and "invite friends to unlock" offers are arbitraged, how the order state machine and message retries stay correct, and how much headroom the shared kernel and the cash flow need under bursts and shocks. This book writes these questions as runnable programs. Its traffic, price, fraud and failure parameters are model parameters, not data from any business; it giv…
DOI 10.5281/zenodo.24090201 · Read the monograph · 中文版
- Chapter 1 · Transfer Receipts: Deduplication, Image Hashes and Release-Then-Audit
Chapter 1 shows that checking only 4 trailing digits gives an even chance of a collision by 119 orders and, after 5,000 orders, wrongly refuses 0.3935 of honest receipts; a perceptual hash recognises re-saved copies but… - Chapter 2 · Self-Referral and "Invite Friends to Unlock"
Chapter 2's association graph shows that devices and payment accounts identify most cheating rings, while IP subnets join 4692 accounts into one component and wrongly block 0.817 of referrals between strangers; "invite… - Chapter 3 · The Order State Machine: Exhaustive Checking and the Idempotency Window
Chapter 3's exhaustive model check shows that handlers blind to state double-release with two events, and that idempotency keys must outlive the 511-minute retry schedule and be written atomically. - Chapter 4 · Thirty Sites on One Kernel: Queues and Tail Latency
Chapter 4 shows by queueing theory and simulation that bursty arrivals push a single worker's T99 to tens of seconds; at a mean load of 0.80, bursts need 4 workers, or 3 with load shedding (refusing 0.0005 of requests). - Chapter 5 · Availability: Shared Kernels, Standby Nodes and Blue-Green Draining
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. - Chapter 6 · Allocating Traffic, Promoting Domains and Holding Cash
Chapter 6 allocates traffic by Thompson sampling (470.0 conversions short of the ideal), gives a posterior stopping rule for promoting a site to its own domain, and shows that a three-month halving of orders needs a cas… - Chapter 7 · Matched Tallies, Banknote Seals and Liu Yan's Canal
Matching the tallies of flying cash is a check of the whole voucher: 4 marks of 10 forms leave a blind forger one chance in ten thousand. The multiple seals of jiaozi multiply independent checks, and the issue cap and t… - Chapter 8 · A Nine-Flag Audit and a Pre-Registered Experiment
Chapter 8 gives a nine-flag audit and a pre-registered experiment. Marked boxes separate evidence, 16 runnable Python programs, historical sources and hypotheses.
Illustrative model calculation, not a live quote