What does Readable Monographs, Weighed conclude, in numbers, about “The Chapter-End Suspense Engine: the Inverted U of the Information Gap, the Placement of Hooks and the Beta Update of Trust”?

Answer: Chapter 5 is the chapter-end suspense engine: the pull of an information gap peaks with 4 candidates left (0.7358), and early, spaced hooks bring the expected chapters read to 4.6318. The central counter-intuitive proposition is that inflated hooks add 0.4926 chapters read while raising the share of readers who meet two broken promises from 0.0156 to 0.6517.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not legal advice and not personalised business or financial advice. Marked boxes separate published evidence, runnable Python calculations (21 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.0156, 0.4926, 0.6517

style open ch2 read reach ch8 broken twice final trust
honest0.8140 4.48 0.2730 0.0156 0.8510
inflated0.8940 4.98 0.2954 0.6517 0.6400
inflated minus honest: chapter 2 +0.0800, chapters +0.4926
inflated minus honest: reach chapter 8 +0.0223
readers who saw two or more broken promises41.7 times
Show the full program
# Chapter 5. p53: honest hooks against inflated hooks, with trust.
# Model: every one of chapters 1 to 7 ends on a hook. A reader's trust
# that hooks pay off is Beta(a, b), starting at Beta(4, 1), with mean
# t = a / (a + b). The chance to open the next chapter is
# (A + BOOST) * t + Q * (1 - t): a reader who trusts the hook feels its
# pull; one who expects an empty teaser reads on only with chance
# Q = 0.55, below the A = 0.78 of a plain summary ending. On opening it,
# the reader sees whether the promise was kept and updates a or b.
# Honest author: BOOST 0.10, promise kept with chance 0.95.
# Inflated author: BOOST 0.20 (louder teasers), kept with chance 0.40.
# Exact dynamic programme over (a, b); masses merged with math.fsum.
# "Final trust" is the mean of t when a reader stops or finishes: the
# goodwill the author carries to the next book.
# Parameters illustrative.
import collections
import math

A, Q = 0.78, 0.55
STYLES = {"honest": (0.10, 0.95), "inflated": (0.20, 0.40)}


def simulate(boost, keep):
    states = {(4, 1): 1.0}
    reach = [1.0]
    open2 = None
    stopped_cheated = []
    final_t = []
    for i in range(1, 8):
        nxt = collections.defaultdict(list)
        for (a, b), mass in sorted(states.items()):
            t = a / (a + b)
            go = (A + boost) * t + Q * (1 - t)
            nxt[(a + 1, b)].append(mass * go * keep)
            nxt[(a, b + 1)].append(mass * go * (1 - keep))
            final_t.append(mass * (1 - go) * t)
            if b - 1 >= 2:
                stopped_cheated.append(mass * (1 - go))
        states = {k: math.fsum(v) for k, v in nxt.items()}
        reach.append(math.fsum(states.values()))
        if i == 1:
            open2 = reach[-1]
    for (a, b), mass in sorted(states.items()):
        final_t.append(mass * a / (a + b))
        if b - 1 >= 2:
            stopped_cheated.append(mass)
    return (open2, math.fsum(reach), reach[-1],
            math.fsum(stopped_cheated), math.fsum(final_t))


print("style     open ch2  read  reach ch8  broken twice  final trust")
res = {}
for name in ("honest", "inflated"):
    res[name] = simulate(*STYLES[name])
    o, e, f, c, t = res[name]
    print("{:<8s}  {:8.4f}  {:4.2f}  {:9.4f}  {:12.4f}  {:11.4f}".format(
        name, o, e, f, c, t))
h, f = res["honest"], res["inflated"]
print("inflated minus honest: chapter 2 {:+.4f}, chapters {:+.4f}".format(
    f[0] - h[0], f[1] - h[1]))
print("inflated minus honest: reach chapter 8 {:+.4f}".format(f[2] - h[2]))
print("readers who saw two or more broken promises: {:.1f} times".format(
    f[3] / h[3]))

Single source and citation

Fan, Y. (2026). Information-Theoretic Rhetoric of Bestselling Monographs, Concrete Metaphor Mapping of Hard Formulas and the Chapter-End Suspense Engine (Version 1.0.0), Chapter 5: The Chapter-End Suspense Engine: the Inverted U of the Information Gap, the Placement of Hooks and the Beta Update of Trust. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-149 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026149,
  author    = {Fan, Yafu},
  title     = {Information-Theoretic Rhetoric of Bestselling Monographs, Concrete Metaphor Mapping of Hard Formulas and the Chapter-End Suspense Engine},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book