What does Paywall Recall and Upsell Ratchets conclude, in numbers, about “The Upgrade Ratchet: Expected Value and Refund Risk of Crediting a First RM 19.90 Toward RM 199”?
Answer: With λ at 0.5 the picture changes completely. With the middle rung at RM 49, the ladder's revenue rises to RM 36.793, +13.501 above the single step, and 0.090 of first-order buyers read the middle rung and then upgrade to the top. With the middle rung at RM 59 the ladder adds +11.355, and 0.079 climb the whole way. With the middle rung at RM 79 the ladder adds +11.796. With λ at 1.0, the RM 49 rung adds +27.399 and 0.182 climb the whole way.
Scope of the numbers: The site is treated as a paid report product, with no claim of predictive accuracy and no fear; all visitor and order data are synthetic or illustrative. Marked boxes separate published evidence, runnable Python calculations (25 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.079, 0.090, 0.182, 0.5, 1.0, 11.355
| single credited step to RM 199: RM 23.292 per entry buyer | |||||||||
| middle | share | lam | RM/buyer | vs single | stop | mid only | full | mid->full | |
| RM | 49 | 0.35 | 0.0 | 23.353 | +0.061 | 0.608 | 0.313 | 0.080 | 0.000 |
| RM | 49 | 0.35 | 0.5 | 36.793 | +13.501 | 0.608 | 0.223 | 0.080 | 0.090 |
| RM | 49 | 0.35 | 1.0 | 50.691 | +27.399 | 0.608 | 0.130 | 0.080 | 0.182 |
| RM | 59 | 0.45 | 0.0 | 23.657 | +0.365 | 0.626 | 0.309 | 0.065 | 0.000 |
| RM | 59 | 0.45 | 0.5 | 34.647 | +11.355 | 0.626 | 0.230 | 0.065 | 0.079 |
| RM | 59 | 0.45 | 1.0 | 46.477 | +23.185 | 0.626 | 0.146 | 0.065 | 0.163 |
| RM | 79 | 0.45 | 0.0 | 23.549 | +0.258 | 0.783 | 0.128 | 0.089 | 0.000 |
| RM | 79 | 0.45 | 0.5 | 35.087 | +11.796 | 0.783 | 0.032 | 0.089 | 0.096 |
| RM | 79 | 0.45 | 1.0 | 38.909 | +15.618 | 0.783 | 0.000 | 0.089 | 0.128 |
Show the full program
# Chapter 5. p52: a ratchet ladder against a single upgrade step.
# Every rung credits all money already paid, and a buyer can only move up.
# Entry buyers value the full volume at W, lognormal, median RM 65, log-sd
# 0.9 (as p51). A middle rung (three of the eight parts) is worth share s
# of W. At each offer the buyer takes the option with the largest surplus
# value - price, if positive. A buyer who took the middle rung may value
# the rest more after reading it: factor (1 + lam), lam = 0, 0.5 or 1.0
# (an assumption to be tested, not a finding). Integration over 20,000
# quantiles of W (deterministic). Prices and shares are illustrative.
import math
from statistics import NormalDist
ND = NormalDist()
MED, SD = 65.0, 0.9
ENTRY, FULL = 19.90, 199.0
QS = [MED * math.exp(SD * ND.inv_cdf((i + 0.5) / 20000)) for i in range(20000)]
def single(w):
return FULL - ENTRY if w >= FULL - ENTRY else 0.0
def ladder(w, mid, share, lam):
# first offer: stop, middle rung (mid - ENTRY) or full (FULL - ENTRY)
s_mid = share * w - (mid - ENTRY)
s_full = w - (FULL - ENTRY)
if max(s_mid, s_full) <= 0:
return 0.0, "stop"
if s_full >= s_mid:
return FULL - ENTRY, "full"
# second offer, credited: the rest of the volume for FULL - mid
if (1.0 - share) * w * (1.0 + lam) >= FULL - mid:
return FULL - ENTRY, "mid-then-full"
return mid - ENTRY, "mid"
if __name__ == "__main__":
base = math.fsum(single(w) for w in QS) / len(QS)
print("single credited step to RM 199: RM {:.3f} per entry buyer".format(base))
print("middle share lam RM/buyer vs single stop mid only full mid->full")
for mid, share in ((49.0, 0.35), (59.0, 0.45), (79.0, 0.45)):
for lam in (0.0, 0.5, 1.0):
res = [ladder(w, mid, share, lam) for w in QS]
rev = math.fsum(r[0] for r in res) / len(res)
cnt = {k: len([1 for r in res if r[1] == k]) / len(res)
for k in ("stop", "mid", "full", "mid-then-full")}
fmt = "RM {:>3.0f} {:.2f} {:.1f} {:.3f} {:+.3f} {:.3f} {:.3f} {:.3f} {:.3f}"
print(fmt.format(mid, share, lam, rev, rev - base, cnt["stop"], cnt["mid"],
cnt["full"], cnt["mid-then-full"]))Single source and citation
Fan, Y. (2026). Paywall Abandonment Recovery Timing, Personalised Curiosity Recall and High-Ticket Upsell Ratchets (Version 1.0.0), Chapter 5: The Upgrade Ratchet: Expected Value and Refund Risk of Crediting a First RM 19.90 Toward RM 199. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-349 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026349,
author = {Fan, Yafu},
title = {Paywall Abandonment Recovery Timing, Personalised Curiosity Recall and High-Ticket Upsell Ratchets},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The 95 Per Cent Leak: The Cash Arithmetic of an RM 5,000 Daily Target
- Chapter 2 · The Decay of Intent: Three Recall Waves at Fifteen Minutes, Twenty-Four Hours and Seventy-Two Hours
- Chapter 3 · The Dose of the Information Gap: Curiosity Recalls Written Only from the Visitor's Own Free Result
- Chapter 4 · The Red Lines of Unsubscription and Complaint: A Stopping Rule, a Complaint Brake and the Consent Law of Three Jurisdictions
- Chapter 6 · Testing Message Variants: Sequential Tests, Multi-Armed Bandits and the False Discovery Rate
- Chapter 7 · A Study of Classics East and West: The Han Feizi on the Difficulties of Persuasion and Aristotle's Rhetoric
- Chapter 8 · The Recall Scheduler and Upsell Trigger: Integration Spec, Example Runs and a Pre-Registered Refutation Plan