What does Paywall Breakpoints and Unlock Interfaces conclude, in numbers, about “The Paywall Playbook: Pages for Four Report Tiers, Honest Status Labels and the Distillation Spec for the Four Kits”?

Answer: The four report tiers sell three different things: results already computed, results a machine will produce later, and a person's time. p70 lays the tiers out as pages and shows the break sitting on a block boundary at 1688 pixels, while 4 of the 10 sections blurred on today's page do not yet exist when it is shown. The four page playbooks settle what each tier may say: the free summary uses a list of titles instead of half a sentence; the standard tier may say "ready"; the full tier has to state truthfully, side by side, the batch time, the measured generation time and the dependency; the advisor tier gives only the first open slot on the calendar. p71 shows that even at a utilisation of only 0.863, an advisor tier without a sales limit lets 0.060 of sessions run later than promised, and that governing sales by the calendar brings this share to zero. The next section hands these rules to the front-end style kit.

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: 0.060, 0.863, 10

supply 12 slots/week; base demand 10.36/week; utilisation 0.863
casedemand/wkrhosoldturnedservedleftmean wait dp50p90max>7 d
base10.360.863273026853.2636100.060
base, 7-day cap10.360.863266726152.642560.000
redesign x1.313.471.12236603075916.311730340.707
x1.3, 7-day cap13.471.12231749305123.954660.000
Little's law check (base): mean queue = arrival rate x mean wait
arrivals/day 1.500 x mean wait 3.26 d = 4.89 orders waiting on an average day
Show the full program
# Chapter 7. p71: The RM 299 tier sells a person's hour: queue, honest wait and a sales cap from the calendar.
# Demand is p10's 44.90 advisor orders a month (10.36 a week, see p70); a 1.3x case models a page redesign.
# Supply: two of the team's four people hold 45-minute sessions, 12 slots a week (Mon 3, Tue 2, Wed 3,
# Thu 2, Fri 2). Chapter 1's menu promises the session within seven days of payment.
# Orders arrive as a Poisson stream (seed 7171), are served first come first served, 26 weeks.
# A 7-day cap sells a session only while the queue is shorter than the slots in the next 7 days.
import math
import random

SLOTS = [3, 2, 3, 2, 2, 0, 0]          # Monday to Sunday
WEEKS = 26
BASE_WEEK = 44.90 * 12 / 52


def poisson(rng, lam):
    k, p, lim = 0, 1.0, math.exp(-lam)
    while True:
        p *= rng.random()
        if p <= lim:
            return k
        k += 1


def run(per_week, window=None, seed=7171):
    rng = random.Random(seed)
    queue, waits, sold, turned = [], [], 0, 0
    for day in range(WEEKS * 7):
        for _ in range(poisson(rng, per_week / 7)):
            if window is not None and len(queue) >= sum(SLOTS[(day + d) % 7] for d in range(1, window + 1)):
                turned += 1
                continue
            queue.append(day)
            sold += 1
        for _ in range(SLOTS[day % 7]):
            if queue and queue[0] < day:
                waits.append(day - queue.pop(0))
    waits.sort()
    q = lambda x: waits[min(len(waits) - 1, int(x * len(waits)))]
    return sold, turned, len(waits), len(queue), waits, q


cap_week = sum(SLOTS)
print("supply {} slots/week; base demand {:.2f}/week; utilisation {:.3f}".format(
    cap_week, BASE_WEEK, BASE_WEEK / cap_week))
print("case                 demand/wk  rho    sold  turned  served  left  mean wait d  p50  p90  max  >7 d")
for name, lam, win in [("base", BASE_WEEK, None), ("base, 7-day cap", BASE_WEEK, 7),
                       ("redesign x1.3", BASE_WEEK * 1.3, None), ("x1.3, 7-day cap", BASE_WEEK * 1.3, 7)]:
    sold, turned, served, left, waits, q = run(lam, win)
    mean = math.fsum(waits) / len(waits)
    late = sum(w > 7 for w in waits) / len(waits)
    print("{:20s} {:9.2f}  {:.3f} {:5d}  {:6d}  {:6d}  {:4d}  {:11.2f}  {:3d}  {:3d}  {:3d}  {:.3f}".format(
        name, lam, lam / cap_week, sold, turned, served, left, mean, q(0.5), q(0.9), waits[-1], late))
print("Little's law check (base): mean queue = arrival rate x mean wait")
sold, turned, served, left, waits, q = run(BASE_WEEK)
rate_day = sold / (WEEKS * 7)
print("  arrivals/day {:.3f} x mean wait {:.2f} d = {:.2f} orders waiting on an average day".format(
    rate_day, math.fsum(waits) / len(waits), rate_day * math.fsum(waits) / len(waits)))

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 7: The Paywall Playbook: Pages for Four Report Tiers, Honest Status Labels and the Distillation Spec for the Four Kits. 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