What does Paywall Breakpoints and Unlock Interfaces conclude, in numbers, about “Sunk-Progress Ratchets: Saved Progress, Personalised Results and the Ethical Edge of the Ratchet”?
Answer: At the paywall the reader holds time, answers and a first result. The ledger in p40 shows that this investment is six minutes, worth about a fifth of the standard price, far too little to support copy that says "pay or it was all for nothing"; the free summary explains only 6 of the 24 answers, and that is the honest reason to upgrade. A legitimate ratchet turns towards the reader: answers are saved for at least 30 days by default and can be exported and deleted; "personalised" must survive the swap test, and below a mean difference of 0.5 the word "personal" is not used; upgrades carry full credit, so climbing from standard all the way to advisor costs RM 299 in total, with break-even multiples between 1.1074 and 1.4950. A reversed ratchet includes deletion threats, false "90% done" claims, undisclosed full-price upgrades and guilt-trip declines. The account in p41 shows that an empty deletion threat starts losing once more than 0.460 of buyers find it out, and that a real deletion destroys resumption, the most dependable road back. The next chapter turns to how locked content should be previewed, and to the conditions under which "already computed, waiting to unlock" may be said at all.
Scope of the numbers: It is not legal advice; pricing economics is left to earlier volumes. Marked boxes separate published evidence, runnable calculations, classical sources and the author's hypotheses, each stating what would refute it; the "hook and clamp" of the Guiguzi chapter Feiqian is examined in Chapter 1.
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: 1.1074, 1.4950, 299, 30
| path no credit full credit staircase penalty | |
| advisor | 299 299 0 |
| standard > advisor | 328 299 29 |
| full > advisor | 398 299 99 |
| standard > full > advisor | 427 299 128 |
| full | 99 99 0 |
| standard > full | 128 99 29 |
| worst staircase pays 427 for a 299 tier | 1.428 x |
| break-even: with credit an upgrade a > b earns (b - a) instead of b, | |
| so credit pays for itself if it multiplies the number of upgrades by at least b / (b - a) | |
| standard > full : due | 70 instead of 99; break-even ratio 99/70 = 1.4143 |
| standard > advisor : due 270 instead of 299; break-even ratio 299/270 | 1.1074 |
| full > advisor : due 200 instead of 299; break-even ratio 299/200 | 1.4950 |
| credit window: share of a RM 29 credit still usable if it fades linearly over W days | |
| W | 7 day 0: RM 29.00 day 3: RM 16.57 day 7: RM 0.00 day 14: RM 0.00 day 30: RM 0.00 |
| W | 30 day 0: RM 29.00 day 3: RM 26.10 day 7: RM 22.23 day 14: RM 15.47 day 30: RM 0.00 |
Show the full program
# Chapter 4. p42: Upgrade credit on the Starbalance ladder (free, RM 29, RM 99, RM 299): paths, break-evens.
# Prices are the book's fictional tiers. No conversion data is assumed: break-even ratios are pure arithmetic.
from fractions import Fraction
from itertools import combinations
TIERS = {"free": 0, "standard": 29, "full": 99, "advisor": 299}
PAID = ["standard", "full", "advisor"]
def path_cost(path, credit):
paid, total = 0, 0
for t in path:
price = TIERS[t]
due = price - paid if credit else price
total += due
paid = max(paid, price)
return total
print("path no credit full credit staircase penalty")
paths = [["advisor"], ["standard", "advisor"], ["full", "advisor"], ["standard", "full", "advisor"],
["full"], ["standard", "full"]]
for p in paths:
a, b = path_cost(p, False), path_cost(p, True)
print("{:28s} {:9d} {:11d} {:17d}".format(" > ".join(p), a, b, a - TIERS[p[-1]]))
worst = path_cost(["standard", "full", "advisor"], False)
print("worst staircase pays {} for a {} tier: {:.3f} x".format(
worst, TIERS["advisor"], worst / TIERS["advisor"]))
print("break-even: with credit an upgrade a > b earns (b - a) instead of b,")
print("so credit pays for itself if it multiplies the number of upgrades by at least b / (b - a)")
for a, b in combinations(PAID, 2):
pa, pb = TIERS[a], TIERS[b]
r = Fraction(pb, pb - pa)
print(" {:8s} > {:8s}: due {:3d} instead of {:3d}; break-even ratio {} = {:.4f}".format(
a, b, pb - pa, pb, r, float(r)))
print("credit window: share of a RM 29 credit still usable if it fades linearly over W days")
for w in (7, 30):
row = []
for day in (0, 3, 7, 14, 30):
left = max(0.0, 1 - day / w)
row.append("day {:2d}: RM {:5.2f}".format(day, 29 * left))
print(" W={:2d} ".format(w) + " ".join(row))Single source and citation
Fan, Y. (2026). Suspense Breakpoints in Multi-Tier Diagnostic Paywalls, Sunk-Progress Ratchets and Frictionless Unlock Interface Design (Version 0.1.0), Chapter 4: Sunk-Progress Ratchets: Saved Progress, Personalised Results and the Ethical Edge of the Ratchet. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-139 · v0.1.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026139,
author = {Fan, Yafu},
title = {Suspense Breakpoints in Multi-Tier Diagnostic Paywalls, Sunk-Progress Ratchets and Frictionless Unlock Interface Design},
year = {2026},
publisher = {5D Library},
edition = {0.1.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Method: Four Interface Variables, Four Indicators, Evidence Grades and Honest Previews
- Chapter 2 · The Truncation Breakpoint: Which Screen, Which Pixel
- Chapter 3 · Endowed Progress: Where the Bar Starts, What It Counts, How Fast It Moves and Whether It Tells the Truth
- Chapter 5 · Previewing Locked Content: Blur, Truncation, Card Titles, Sample Sections and the Truth of "Already Computed"
- Chapter 6 · One-Screen Checkout: Fields, Wallets, Trust Marks, Error Messages, Latency and the Edge of Dark Patterns
- Chapter 7 · The Paywall Playbook: Pages for Four Report Tiers, Honest Status Labels and the Distillation Spec for the Four Kits
- Chapter 8 · Practice: Starbalance's Unlock Page from Audit to Rebuild and a Pre-Registered Test