What does One-Site Thousand, Five-Site Matrix conclude, in numbers, about “System Architecture and Operations Spec: The 72-Hour Clone Pipeline, the Weekly Ledger and the Five-Site Matrix Cloning Calculator”?
Answer: The system has three layers, core, skins and ledger, and the eight ledger tables hold summed data only. The critical path of the 72-hour clone pipeline has an expected 53.00 hours; Monte Carlo gives a 0.9578 chance of finishing within 72 hours and only 0.2099 within 48. Under the default conditions the five sites can expect RM 3,893.70 a day, and reaching RM 5,000 requires a first site of RM 1,284.09. The pre-registered tests show that the multiplier needs about 153 days of observation and that cannibalisation can be tested only at the level of search terms. Our advice is: pass the gate first, partition next, clone after that, and write every step into the ledger.
Scope of the numbers: Order values, conversion rates, fees, incident rates and market parameters are illustrative, and all calculations are generated by the book's programs. Revenue figures are illustrative arithmetic, not a promise of income, and not investment, legal or tax advice.
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.2099, 0.9578, 48, 53.00, 72
critical path T1 > T3 > T6 > T8: mean 53.00 h, sd 9.33 h normal approximation: P(done within 72 h) 0.9792, within 48 h 0.2960 Monte Carlo: mean 55.46 h; P(within 72 h) 0.9578, within 48 h 0.2099 T1 skin config from core template mean 4.33 h finishes at 4.33 h T2 domain, TLS and DNS (human approval) mean 12.33 h finishes at 12.33 h T3 localised copy and legal pages mean 29.00 h finishes at 33.33 h T4 payment methods in test mode mean 19.00 h finishes at 23.33 h T5 keyword partition and seed content mean 26.00 h finishes at 26.00 h T6 privacy notice review (human) mean 15.33 h finishes at 48.67 h T7 QA: mobile, contrast, test orders mean 13.00 h finishes at 46.33 h T8 go-live gate and canary mean 4.33 h finishes at 53.00 h
Show the full program
# Chapter 8. p81: the 72-hour clone pipeline as a PERT network.
# Eight tasks with optimistic, most likely and pessimistic elapsed hours
# (a, m, b); PERT mean (a + 4m + b) / 6 and sd (b - a) / 6 as in Malcolm et
# al. (1959). The task list and every duration are illustrative. A Monte
# Carlo run samples each task from a PERT beta to show merge bias: the
# critical path alone understates the chance of running late.
import math
import random
import statistics
RNG = random.Random(357081)
TASKS = [ # id, name, predecessors, a, m, b (elapsed hours, nights included)
("T1", "skin config from core template", (), 2, 4, 8),
("T2", "domain, TLS and DNS (human approval)", (), 2, 8, 40),
("T3", "localised copy and legal pages", ("T1",), 14, 26, 56),
("T4", "payment methods in test mode", ("T1",), 6, 16, 44),
("T5", "keyword partition and seed content", (), 12, 24, 48),
("T6", "privacy notice review (human)", ("T3",), 4, 12, 40),
("T7", "QA: mobile, contrast, test orders", ("T2", "T3", "T4"), 6, 12, 24),
("T8", "go-live gate and canary", ("T5", "T6", "T7"), 2, 4, 8),
]
def finish(dur):
end = {}
for tid, _, pre, *_ in TASKS:
end[tid] = max([end[p] for p in pre] + [0.0]) + dur[tid]
return end
mean = {t[0]: (t[3] + 4 * t[4] + t[5]) / 6 for t in TASKS}
var = {t[0]: ((t[5] - t[3]) / 6) ** 2 for t in TASKS}
end = finish(mean)
path, node = [], "T8"
while node:
path.append(node)
pre = [t[2] for t in TASKS if t[0] == node][0]
node = max(pre, key=lambda p: end[p]) if pre else None
path.reverse()
mu = end["T8"]
sd = math.sqrt(math.fsum(var[p] for p in path))
z = statistics.NormalDist(mu, sd)
print("critical path " + " > ".join(path) + ": mean %.2f h, sd %.2f h" % (mu, sd))
print(" normal approximation: P(done within 72 h) %.4f, within 48 h %.4f" % (
z.cdf(72), z.cdf(48)))
def pert(a, m, b):
al = 1 + 4 * (m - a) / (b - a)
be = 1 + 4 * (b - m) / (b - a)
return a + (b - a) * RNG.betavariate(al, be)
runs = [finish({t[0]: pert(*t[3:]) for t in TASKS})["T8"]
for _ in range(20000)]
print("Monte Carlo: mean %.2f h; P(within 72 h) %.4f, within 48 h %.4f" % (
statistics.fmean(runs), len([r for r in runs if r <= 72]) / 20000,
len([r for r in runs if r <= 48]) / 20000))
for tid, name, *_ in TASKS:
print(" %s %-38s mean %5.2f h finishes at %5.2f h" % (
tid, name, mean[tid], end[tid]))Single source and citation
Fan, Y. (2026). The Thousand-Ringgit Single-Site Minimum Loop, Headless Core Multi-Skin Cloning and Five-Site Revenue Multiplication (Version 1.0.0), Chapter 8: System Architecture and Operations Spec: The 72-Hour Clone Pipeline, the Weekly Ledger and the Five-Site Matrix Cloning Calculator. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-357 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026357,
author = {Fan, Yafu},
title = {The Thousand-Ringgit Single-Site Minimum Loop, Headless Core Multi-Skin Cloning and Five-Site Revenue Multiplication},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Ask What a Thousand a Day Leaves: The Minimum Loop, Unit Contribution and Break-Even
- Chapter 2 · A Good Week Is Not a Stable Thousand: Daily Noise, Sequential Tests and the Clone Gate
- Chapter 3 · A Central Core Is Not Always Worth Building First: Headless Architecture, Information Hiding and Economies of Scope
- Chapter 4 · A New Skin Is Not a Copy of the Revenue: Per-Skin Accounts by Language, Country and Niche
- Chapter 5 · Five Sites That Do Not Raid Each Other: Orthogonal Partition of Keywords and Audiences, and the Multiplier
- Chapter 6 · The Price of a Shared Core: Correlated Failure, Blast Radius and the Chargeback Pool
- Chapter 7 · East-West Classical Sources: Sunzi on Division and Variation, and Smith on the Extent of the Market