What does Cascades, Curiosity and Paywalls conclude, in numbers, about “A Finite Audience, a Clustered Network and an Acquisition Cost That Is Not Zero”?
Answer: Chapter 2 shows that in a finite audience K = 1.15 reaches only 0.255, that in a clustered network the measured K is 0.934 against a tree estimate of 1.35, and that acquisition costs do not fall to zero: 3.22 per paying user, 0.325 of the price.
Scope of the numbers: It is not business, legal or investment advice; all data are synthetic, generated by its programs. 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. standard-library Python onlyprinted values that match the answer: 0.255, 0.325, 1.15, 3.22
K reached z = 1 - exp(-Kz) K_eff < 1 from gen peak gen (size) 1.15 0.255 0.249 42 42 (9,421) 1.50 0.618 0.583 19 19 (72,388) 2.00 0.869 0.797 12 12 (187,722) 3.00 0.993 0.940 8 8 (394,652) cost per paying user: free readings 3.00 + commissions 0.22 = 3.22 as a share of the price 9.9: 0.325 Reading: in a finite audience K_eff falls below 1 once a share 1 - 1/K has been reached; a K just above 1 reaches only about a quarter of the audience. (The generation recurrence reaches a little more than the classical relation, which also counts repeated invitations to the same person.) Referral growth is not free: the free readings given to everyone who never pays are the main acquisition cost.
Show the full program
# Chapter 2. A finite audience, and what "zero acquisition cost" hides.
# Part 1. Users can only be recruited from a finite reachable audience of
# 1,000,000 people. Generation by generation (100 seed users), each new
# user's invitations land on people already reached in proportion to the
# share already reached, so the effective number is K_eff = K x (unreached
# share). The program reports the final share reached (it solves the
# classical final-size relation z = 1 - exp(-K z) as a check), the
# generation at which K_eff falls below 1, and the peak generation size.
# Part 2. Every new user receives a free reading that costs c = 0.15 to
# generate and deliver; a 5 % share pay the price p = 9.9; a paying user
# whose referral link brought the payer earns a commission of 50 %. With
# the funnel of p02 at K = 1.15, a share 0.05 / 1.15 of joiners comes from
# paid links. Acquisition cost per paying user =
# c / 0.05 + (share of payers from paid links) x 0.5 x 9.9.
import math
AUDIENCE, SEEDS = 1_000_000, 100
def run(k):
reached, new, gen = SEEDS, SEEDS, 0
below, peak = None, (0, SEEDS)
while new >= 1:
unreached = 1 - reached / AUDIENCE
if below is None and k * unreached < 1:
below = gen
new = k * unreached * new
reached += new
gen += 1
if new > peak[1]:
peak = (gen, new)
return reached / AUDIENCE, below, peak
def final_size(k):
z = 0.5
for _ in range(500):
z = 1 - math.exp(-k * z)
return z
if __name__ == "__main__":
print(" K reached z = 1 - exp(-Kz) K_eff < 1 from gen"
" peak gen (size)")
for k in (1.15, 1.5, 2.0, 3.0):
share, below, (pg, ps) = run(k)
print(" {:4.2f} {:5.3f} {:5.3f} {:3d}"
" {:3d} ({:,.0f})".format(k, share, final_size(k),
below, pg, ps))
c, conv, price, alpha, k = 0.15, 0.05, 9.9, 0.5, 1.15
via_link = 0.05 / k
cac = c / conv + via_link * alpha * price
print("\n cost per paying user: free readings {:.2f} + commissions"
" {:.2f} = {:.2f}".format(c / conv, via_link * alpha * price, cac))
print(" as a share of the price 9.9: {:.3f}".format(cac / price))
print("\nReading: in a finite audience K_eff falls below 1 once a share")
print("1 - 1/K has been reached; a K just above 1 reaches only about a")
print("quarter of the audience. (The generation recurrence reaches a")
print("little more than the classical relation, which also counts")
print("repeated invitations to the same person.) Referral growth is not")
print("free: the free readings given to everyone who never pays are the")
print("main acquisition cost.")Single source and citation
Fan, Y. (2026). Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization (Version 1.0.0), Chapter 2: A Finite Audience, a Clustered Network and an Acquisition Cost That Is Not Zero. 5D Library. https://doi.org/10.5281/zenodo.24090174
DOI: 10.5281/zenodo.24090174 · Read the monograph · 5DL-B-063 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026063,
author = {Fan, Yafu},
title = {Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090174},
url = {https://doi.org/10.5281/zenodo.24090174}
}Other chapter answers in this book
- Chapter 1 · The Branching Process of "Invite to Unlock"
- Chapter 3 · Commissions, Share-to-Unlock and the Incentives of Fake Accounts
- Chapter 4 · Information Gaps, Purchase Hazards and the Feeling of "So Accurate"
- Chapter 5 · Pareto Willingness to Pay, One Price and the Revenue Ceiling
- Chapter 6 · Bundles, Decoy Tiers and Paying per Question
- Chapter 7 · "Rub It with Its Own Kind", "Lift Then Clamp" and "Gather When Light"
- Chapter 8 · A Four-Step Check, a Compliance Checklist and a Pre-Registered Paywall Test