What does Cascades, Curiosity and Paywalls conclude, in numbers, about “A Four-Step Check, a Compliance Checklist and a Pre-Registered Paywall Test”?
Answer: Chapter 8 gives a four-step check, a compliance checklist and a pre-registered paywall test (166,788 referral trees per arm). Marked boxes separate published evidence, runnable Python calculations (16 programs), classical sources and the author's hypotheses.
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: 166788
simulated net revenue per seed: A 2.987, B 3.253 pooled SD 10.308 -> 166,788 trees per arm for 80 % power decision rule, one line per branch: D = +0.25: B better by at least the smallest effect of interest D = +0.12: B better, but not shown to reach 0.10 D = +0.05: no difference shown D = -0.20: B worse: the tiered menu earns less per seed D = +0.25: uninterpretable: sample-ratio mismatch D = +0.25: uninterpretable: arms mixed in more than 5 % of trees D = +0.25: uninterpretable: under 90 % of planned trees Reading: because one seed's tree may hold hundreds of users, the outcome is so dispersed that detecting 0.10 per seed takes well over a hundred thousand trees per arm. A test that small sites cannot afford should not be replaced by a guess.
Show the full program
# Chapter 8. A pre-registered paywall test and its decision rule.
# Arms: A = one price for the full reading (9.9); B = the tiered menu.
# Unit of randomisation: the referral tree (p15). Primary outcome: NET
# revenue per seed visitor over 30 days, counting every visitor in the
# seed's tree: payments minus commissions paid out minus the cost of the
# free readings given (0.15 each). Estimand D = mean(B) - mean(A); the
# smallest effect of interest is 0.10 per seed. Gates that make a result
# uninterpretable rather than negative: sample-ratio mismatch (|z| > 3 on
# the split of trees), more than 5 % of trees exposed to both arms, and
# fewer than 90 % of the planned trees. The program sizes the test by
# simulating trees (outcome per seed: a heavy-tailed sum, as in p02; a
# tenth of payments paid out as commission; B lifts paying by 0.4 point)
# and prints the decision for each branch of the rule.
import math
import random
from statistics import NormalDist
Z = NormalDist()
def tree_outcome(rng, uplift):
size = 1
alive = 1
while alive and size < 400:
kids = sum(rng.random() < 0.18 for _ in range(5))
alive += kids - 1
size += kids
pays = sum(rng.random() < 0.05 + uplift for _ in range(size))
return pays * 9.9 * 0.9 - 0.15 * size
def decide(d, se, srm_z, mixed, enrolled):
if abs(srm_z) > 3:
return "uninterpretable: sample-ratio mismatch"
if mixed > 0.05:
return "uninterpretable: arms mixed in more than 5 % of trees"
if enrolled < 0.9:
return "uninterpretable: under 90 % of planned trees"
lo, hi = d - 1.96 * se, d + 1.96 * se
if lo > 0.10:
return "B better by at least the smallest effect of interest"
if hi < 0:
return "B worse: the tiered menu earns less per seed"
if lo > 0:
return "B better, but not shown to reach 0.10"
return "no difference shown"
if __name__ == "__main__":
rng = random.Random(63016)
a = [tree_outcome(rng, 0.0) for _ in range(20000)]
b = [tree_outcome(rng, 0.004) for _ in range(20000)]
ma, mb = sum(a) / len(a), sum(b) / len(b)
sd = math.sqrt((sum((x - ma) ** 2 for x in a)
+ sum((x - mb) ** 2 for x in b)) / (len(a) + len(b) - 2))
n = math.ceil(2 * ((1.96 + Z.inv_cdf(0.8)) * sd / 0.10) ** 2)
print(" simulated net revenue per seed: A {:.3f}, B {:.3f}".format(
ma, mb))
print(" pooled SD {:.3f} -> {:,} trees per arm for 80 % power"
.format(sd, n))
se = sd * math.sqrt(2 / n)
print("\n decision rule, one line per branch:")
for case in ((0.25, 0.0, 0.0, 1.0), (0.12, 0.0, 0.0, 1.0),
(0.05, 0.0, 0.0, 1.0), (-0.20, 0.0, 0.0, 1.0),
(0.25, 3.5, 0.0, 1.0), (0.25, 0.0, 0.08, 1.0),
(0.25, 0.0, 0.0, 0.8)):
print(" D = {:+.2f}: {}".format(case[0], decide(case[0], se,
*case[1:])))
print("\nReading: because one seed's tree may hold hundreds of users,")
print("the outcome is so dispersed that detecting 0.10 per seed takes")
print("well over a hundred thousand trees per arm. A test that small")
print("sites cannot afford should not be replaced by a guess.")Single source and citation
Fan, Y. (2026). Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization (Version 1.0.0), Chapter 8: A Four-Step Check, a Compliance Checklist and a Pre-Registered Paywall Test. 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 2 · A Finite Audience, a Clustered Network and an Acquisition Cost That Is Not Zero
- 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"