What does Affiliate Power Laws, Creator Portfolios and Commission Bounds conclude, in numbers, about “The Geometry of Multi-Level Commissions and the Saturation of Pyramids”?

Answer: Chapter 5 computes the geometry of multi-level commission: a full twelve-level tree with five recruits each needs 305,175,781 people, and once a finite market saturates 0.724 of members have a net loss; it also sets out the line drawn by Malaysia's Act 500 and the US Federal Trade Commission's guidance.

Scope of the numbers: Its numbers of affiliates, sales distributions, conversion rates, customer counts, commission rates and recruitment speeds are illustrative or synthetic; all data are generated by its programs; the book is not legal, financial or investment advice. Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's 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: 305175781

blevels for RM 3,000people belowoverride (RM)
2 7 254 1,824 not reached
353635,229
531554,050
full tree of depth 12
bmembersshare above purchaseshare with no recruit
28,1910.2500.500
3797,1610.1110.667
5305,175,7810.2000.800
Show the full program
# Chapter 5. p09: The geometry of multi-level pay. A plan pays 50% of
# volume in all, spread over seven levels: 20, 10, 8, 5, 4, 2 and 1
# percent. Each member moves RM 300 a month, RM 200 of it the purchase
# needed to stay qualified. If every member brings in b recruits, a
# member with l full levels below has b + b^2 + ... + b^l people under
# her. How many does she need for RM 3,000 a month of override, and in
# a finished network (a full b-ary tree, depth 12) what share of members
# earn more in override than their own required purchase?
RATES = (0.20, 0.10, 0.08, 0.05, 0.04, 0.02, 0.01)
VOLUME, BUY = 300.0, 200.0

def override(b, levels):
    return sum(r * VOLUME * b ** (i + 1)
               for i, r in enumerate(RATES[:levels]))

if __name__ == "__main__":
    print("   b   levels for RM 3,000   people below   override (RM)")
    for b in (2, 3, 5):
        for lv in range(1, 8):
            if override(b, lv) >= 3000 or lv == 7:
                people = sum(b ** k for k in range(1, lv + 1))
                note = "" if override(b, lv) >= 3000 else "  not reached"
                print("   {}   {:19d}   {:12,d}   {:13,.0f}{}".format(
                    b, lv, people, override(b, lv), note))
                break
    print("   full tree of depth 12")
    print("   b   members        share above purchase   share with no"
          " recruit")
    for b in (2, 3, 5):
        depth = 12
        members = sum(b ** d for d in range(depth + 1))
        above = 0
        for d in range(depth + 1):
            if override(b, min(7, depth - d)) > BUY:
                above += b ** d
        leaves = b ** depth
        print("   {}   {:13,d}  {:21.3f}   {:20.3f}".format(
            b, members, above / members, leaves / members))

Single source and citation

Fan, Y. (2026). Affiliate Network Power Laws, Influencer Portfolio Optimization and Incentive Stability Bounds (Version 1.0.0), Chapter 5: The Geometry of Multi-Level Commissions and the Saturation of Pyramids. 5D Library. https://doi.org/10.5281/zenodo.24090229

DOI: 10.5281/zenodo.24090229 · Read the monograph · 5DL-B-087 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026087,
  author    = {Fan, Yafu},
  title     = {Affiliate Network Power Laws, Influencer Portfolio Optimization and Incentive Stability Bounds},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090229},
  url       = {https://doi.org/10.5281/zenodo.24090229}
}

Other chapter answers in this book