What does Diagnostic Paywalls and Unlock Pricing conclude, in numbers, about “The Curiosity Gap and the Free/Paid Cut”?
Answer: Chapter 1 shows that trust times the remaining gap has an interior optimum, 0.25 in the base case, but that across 60 cases it runs from 0.000 to 0.425, with only 15 inside the claimed 0.28 to 0.42; that interval appears reliably when free statements are Barnum statements and users do not notice, and then 0.5364 of buyers buy on a mistake.
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.000, 0.25, 0.28, 0.42, 0.425, 15
| alpha trust buy chance (pi0 0.30, qh 0.80, K 20) | ||
| 0.00 | 0.3000 | 0.3000 |
| 0.10 | 0.4063 | 0.3656 |
| 0.20 | 0.4951 | 0.3960 |
| 0.30 | 0.5677 | 0.3974 |
| 0.40 | 0.6279 | 0.3767 |
| 0.50 | 0.6783 | 0.3392 |
| 0.60 | 0.7209 | 0.2884 |
| 0.70 | 0.7572 | 0.2272 |
| 0.80 | 0.7883 | 0.1577 |
| 0.90 | 0.8149 | 0.0815 |
| 1.00 | 0.8380 | 0.0000 |
| best alpha 0.25, buy chance 0.3998 | ||
| over 60 cases: best alpha from 0.000 to 0.425 | ||
| cases with best alpha in 0.28 to 0.42: 15 of 60 | ||
Show the full program
# Chapter 1. p01: The free/paid cut. A diagnostic report has K
# statements; the free part shows the first n = alpha K of them, all about
# the past, so the user can check each. An accurate tool is right on each
# with chance qh; a tool that guesses, with chance ql = 0.5. The user's
# prior that the tool is accurate is pi0; after checking she holds the
# posterior. She buys with chance (posterior) x (1 - alpha): trust times
# the gap still closed to her. The tool here is accurate. We find the
# best alpha, then repeat over a grid of pi0, qh and K.
import math
def trust(n, pi0, qh, ql=0.5):
"""Expected posterior after n checked statements, tool accurate."""
out = []
for k in range(n + 1):
pk = math.comb(n, k) * qh ** k * (1 - qh) ** (n - k)
lr = (qh / ql) ** k * ((1 - qh) / (1 - ql)) ** (n - k)
out.append(pk * pi0 * lr / (pi0 * lr + 1 - pi0))
return math.fsum(out)
def best(pi0, qh, k):
rows = [(trust(n, pi0, qh) * (1 - n / k), n / k) for n in range(k + 1)]
return max(rows)
if __name__ == "__main__":
print("alpha trust buy chance (pi0 0.30, qh 0.80, K 20)")
for n in range(0, 21, 2):
t = trust(n, 0.30, 0.80)
print("{:5.2f} {:6.4f} {:11.4f}".format(n / 20, t,
t * (1 - n / 20)))
b, a = best(0.30, 0.80, 20)
print("best alpha {:.2f}, buy chance {:.4f}".format(a, b))
found = []
for pi0 in (0.1, 0.2, 0.3, 0.5, 0.7):
for qh in (0.65, 0.7, 0.8, 0.9):
for k in (10, 20, 40):
found.append(best(pi0, qh, k)[1])
print("over {} cases: best alpha from {:.3f} to {:.3f}".format(
len(found), min(found), max(found)))
inside = [a for a in found if 0.28 <= a <= 0.42]
print("cases with best alpha in 0.28 to 0.42: {} of {}".format(
len(inside), len(found)))Single source and citation
Fan, Y. (2026). Algorithmic Diagnostic Paywalls, Curiosity-Gap Calibration and Tiered Report Unlock Economics (Version 1.0.0), Chapter 1: The Curiosity Gap and the Free/Paid Cut. 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 2 · Sunk Input: Commitment or Selection?
- 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