What does Diagnostic Paywalls and Unlock Pricing conclude, in numbers, about “Sunk Input: Commitment or Selection?”?
Answer: Chapter 2 shows that input before the paywall helps only if each step raises willingness to pay by more than 1.0753, and that selection alone raises paywall conversion by 1.4080 while purchases per visitor fall to 0.6439.
Scope of the numbers: Its users, rates and parameters are illustrative models; all calculations are generated by its programs; the book is not legal, financial or consumer-protection 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. standard-library Python onlyprinted values that match the answer: 0.6439, 1.4080
| steps | reach paywall | pay at paywall | buys per visitor |
|---|---|---|---|
| 0 | 1.0000 | 0.0396 | 0.03961 |
| 2 | 0.7540 | 0.0454 | 0.03421 |
| 4 | 0.5814 | 0.0494 | 0.02873 |
| 6 | 0.4573 | 0.0558 | 0.02550 |
| 8 | 0.3647 | 0.0602 | 0.02194 |
| paywall conversion, 6 steps over none: 1.4080 | |||
| buys per visitor, 6 steps over none: | 0.6439 |
Show the full program
# Chapter 2. p04: Selection is not commitment. Visitors differ in intent
# t, drawn as the square of a uniform number (most are browsing). Each
# input step is abandoned with chance 0.20 (1 - t), so the curious stay.
# At the paywall a visitor pays with chance 0.12 t: no causal commitment
# effect at all. Observed paywall conversion still rises with the number
# of steps, because the visitors who reach it are different people. We
# print both, and what a randomised test of 0 against 6 steps would show.
# 200000 visitors per arm, seed 114.
import random
def arm(steps, n=200000, seed=114):
rng = random.Random(seed)
reach, buy = 0, 0
for _ in range(n):
t = rng.random() ** 2
ok = True
for _ in range(steps):
if rng.random() < 0.20 * (1 - t):
ok = False
break
if not ok:
continue
reach += 1
if rng.random() < 0.12 * t:
buy += 1
return reach / n, buy / reach, buy / n
if __name__ == "__main__":
print("steps reach paywall pay at paywall buys per visitor")
for s in (0, 2, 4, 6, 8):
r, p, b = arm(s)
print("{:5d} {:13.4f} {:14.4f} {:16.5f}".format(s, r, p, b))
r0, p0, b0 = arm(0)
r6, p6, b6 = arm(6)
print("paywall conversion, 6 steps over none: {:.4f}".format(p6 / p0))
print("buys per visitor, 6 steps over none: {:.4f}".format(b6 / b0))Single source and citation
Fan, Y. (2026). Algorithmic Diagnostic Paywalls, Curiosity-Gap Calibration and Tiered Report Unlock Economics (Version 1.0.0), Chapter 2: Sunk Input: Commitment or Selection?. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-114 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026114,
author = {Fan, Yafu},
title = {Algorithmic Diagnostic Paywalls, Curiosity-Gap Calibration and Tiered Report Unlock Economics},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Curiosity Gap and the Free/Paid Cut
- Chapter 3 · Three Prices and a Subscription
- Chapter 4 · Thirty Sites as One Markov Chain
- Chapter 5 · Free Quotas and the Second Asking
- Chapter 6 · Refund Promises and Dark Patterns
- Chapter 7 · The Second Asking, Giving First and Costly Signals
- Chapter 8 · Practice: One Year of the Matrix and One Test Protocol