What does Diagnostic Paywalls and Unlock Pricing conclude, in numbers, about “Free Quotas and the Second Asking”?

Answer: Chapter 5 shows that a free quota is best at one reading a month, and that a user who re-asks a sensitive tool six times ends on the answer she wanted with chance 0.8840.

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. printed values that match the answer: 0.8840

asks mS ends favourableexpected P(R) when SR favourable
10.00000.50000.0000
20.35000.42970.0500
30.57750.36000.0975
40.72540.29870.1426
50.82150.24910.1855
60.88400.21140.2262
posterior after one flip: 0.1250
re-runs locked: posterior stays 0.5000
Show the full program
# Chapter 5. p10: Asking again. A user may re-run a free diagnosis,
# nudging her birth time by a few minutes. A robust tool R flips its key
# verdict on such nearby inputs with chance 0.05 a run; a sensitive tool
# S with chance 0.35. Her first verdict is "unfavourable"; she asks again
# until she sees "favourable" or has asked m times. Her prior that the
# tool is R is 0.5. When the tool is in fact S we print the chance she
# ends on "favourable" and her expected posterior that it is R; locking
# the re-runs keeps that posterior at 0.5.
FR, FS = 0.05, 0.35

def post(saw_flip, asks, fr, fs):
    if saw_flip:
        lr, ls = fr, fs                  # one flip ends the asking
    else:
        lr, ls = (1 - fr) ** asks, (1 - fs) ** asks
    return 0.5 * lr / (0.5 * lr + 0.5 * ls)

if __name__ == "__main__":
    print("asks m   S ends favourable   expected P(R) when S   R favourable")
    for m in range(1, 7):
        fav_s = 1 - (1 - FS) ** (m - 1)
        e = 0.0
        for t in range(1, m):            # flip seen on re-run t
            pr = (1 - FS) ** (t - 1) * FS
            e += pr * post(True, t, FR, FS)
        e += (1 - FS) ** (m - 1) * post(False, m - 1, FR, FS)
        fav_r = 1 - (1 - FR) ** (m - 1)
        print("{:6d}   {:17.4f}   {:20.4f}   {:12.4f}".format(
            m, fav_s, e, fav_r))
    print("posterior after one flip: {:.4f}".format(post(True, 1, FR, FS)))
    print("re-runs locked: posterior stays 0.5000")

Single source and citation

Fan, Y. (2026). Algorithmic Diagnostic Paywalls, Curiosity-Gap Calibration and Tiered Report Unlock Economics (Version 1.0.0), Chapter 5: Free Quotas and the Second Asking. 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