What does One-Site Thousand, Five-Site Matrix conclude, in numbers, about “Five Sites That Do Not Raid Each Other: Orthogonal Partition of Keywords and Audiences, and the Multiplier”?

Answer: Chapters 5 to 8 show that a partition with a Jaccard coefficient of only 0.048 still has a volume-weighted overlap of 0.209; that with new sites at 0.8 of the first site's size the five-site multiplier is only 3.902, and RM 5,000 requires a first site of RM 1,284.09; that a shared core leaves the average loss to downtime unchanged but raises the worst one-per-cent monthly loss from RM 672.47 to RM 1,259.38; and that canary releases cut the monthly loss from bad versions from RM 51.37 to RM 14.66.

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.209, 0.8, 3.902, 5000

rhoM(s=0.2)M(s=0.3)M(s=0.5)site 1 needed for RM 5,000 (s=0.3)
0.0005.0005.0005.000RM 1,000
0.1004.8364.7774.694RM 1,047
0.2094.6584.5354.360RM 1,103
0.4004.3454.1093.775RM 1,217
0.6004.0173.6643.162RM 1,365
0.9993.3632.7751.941RM 1,802
new sites own a fraction g of site 1's own demand (rho 0.209, s 0.3):
g 1.0: M 4.535; RM 1,000 site gives RM 4,535; RM 5,000 needs RM 1,103
g 0.8: M 3.902; RM 1,000 site gives RM 3,902; RM 5,000 needs RM 1,281
g 0.6: M 3.269; RM 1,000 site gives RM 3,269; RM 5,000 needs RM 1,530
Show the full program
# Chapter 5. p52: the five-site multiplier as a function of overlap.
# Revenue of the first site = 1. A share rho of it comes from a pool of
# demand that every sibling also chases; the rest is the site's own. One
# site wins a given shared search or buyer with probability s, so the pool
# holds rho / s and n sites together win 1 - (1 - s) ** n of it. The four
# new sites own a fraction g of the first site's own demand. rho = 0.209 and
# 0.999 are the partition and clone plans of p51; s and g are illustrative.
import math


def multiplier(rho, s, n=5, g=1.0):
    own = math.fsum([1.0 - rho] + [g * (1.0 - rho)] * (n - 1))
    return own + rho / s * (1 - (1 - s) ** n)


print("rho     M(s=0.2)  M(s=0.3)  M(s=0.5)  site 1 needed for RM 5,000 (s=0.3)")
for rho in (0.0, 0.1, 0.209, 0.4, 0.6, 0.999):
    m = [multiplier(rho, s) for s in (0.2, 0.3, 0.5)]
    print("{:5.3f}   {:6.3f}    {:6.3f}    {:6.3f}      RM {:,.0f}".format(
        rho, m[0], m[1], m[2], 5000 / m[1]))
print("new sites own a fraction g of site 1's own demand (rho 0.209, s 0.3):")
for g in (1.0, 0.8, 0.6):
    m = multiplier(0.209, 0.3, g=g)
    print("  g {:.1f}: M {:.3f}; RM 1,000 site gives RM {:,.0f}; RM 5,000 needs"
          " RM {:,.0f}".format(g, m, 1000 * m, 5000 / m))

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 5: Five Sites That Do Not Raid Each Other: Orthogonal Partition of Keywords and Audiences, and the Multiplier. 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