What does Narrative Transportation and Scroll Rhythms conclude, in numbers, about “The "Dopamine" Rhythm: Reward-Prediction Errors, Hook Debt and the True Ledger of Pressure”?

Answer: Chapter 6 tests the dopamine metaphor, showing that sales peak when hooks and payoffs are about one to one, that writing for depth cuts buyers per 1000 readers from 8.64 to 5.93, and that 0.794 of the excess net value of pressure copy comes from readers in financial distress.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not individual legal, advertising-compliance or financial advice, and it teaches no deception. Marked boxes separate published evidence, runnable Python calculations (20 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: 1000, 5.93, 8.64

hooks/payoffreach endopen at endtrustbuyers per 1000
0.000.0910.001.0004.54
0.500.1350.001.0006.77
1.000.1730.001.0008.63
1.250.2372.500.5005.93
1.500.1825.000.0000.00
2.000.02610.000.0000.00
3.000.00020.000.0000.00
4.000.00030.000.0000.00
best ratio 1.01: 8.64 buyers per 1000
ratio that maximises depth alone 1.25: 5.93 buyers
Show the full program
# Chapter 6. p62: Hooks per payoff. A page has PARAS paragraphs; a payoff
# arrives every M paragraphs and closes one open hook. At the start of
# each payoff interval the writer opens H new hooks (H may be fractional:
# an average). Open hooks lower the exit hazard with diminishing returns,
# but hooks beyond the reader's working capacity CAPW add frustration:
#   hazard = H0 * exp(-A * ln(1 + open) + B * max(0, open - CAPW)).
# Trust falls by DT for every hook still open at the end. Conversion at
# the end is CONV * trust. Deterministic; parameters are illustrative.
import math

PARAS, M = 40, 4
H0, A, B, CAPW = 0.06, 0.45, 0.30, 3.0
DT, CONV = 0.20, 0.05


def page(h):
    open_, surv = 0.0, 1.0
    for p in range(PARAS):
        if p % M == 0:
            open_ += h
        haz = H0 * math.exp(-A * math.log(1 + open_)
                            + B * max(0.0, open_ - CAPW))
        surv *= math.exp(-haz)
        if p % M == M - 1:
            open_ -= min(1.0, open_)
    trust = max(0.0, 1 - DT * open_)
    return surv, open_, trust, 1000 * surv * CONV * trust


print("hooks/payoff  reach end  open at end  trust  buyers per 1000")
for h in (0.0, 0.5, 1.0, 1.25, 1.5, 2.0, 3.0, 4.0):
    s, o, t, b = page(h)
    print("{:12.2f}  {:9.3f}  {:11.2f}  {:5.3f}  {:15.2f}".format(
        h, s, o, t, b))
grid = [i / 100 for i in range(401)]
best = max(grid, key=lambda h: page(h)[3])
print("best ratio {:.2f}: {:.2f} buyers per 1000".format(
    best, page(best)[3]))
deep = max(grid, key=lambda h: page(h)[0])
print("ratio that maximises depth alone {:.2f}: {:.2f} buyers".format(
    deep, page(deep)[3]))

Single source and citation

Fan, Y. (2026). Narrative Transportation, Cognitive-Dissonance Disarming and Dopaminergic Scroll Rhythms in High-Conversion Long-Form Copy (Version 1.0.0), Chapter 6: The "Dopamine" Rhythm: Reward-Prediction Errors, Hook Debt and the True Ledger of Pressure. 5D Library. DOI pending

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

BibTeX
@book{fan2026141,
  author    = {Fan, Yafu},
  title     = {Narrative Transportation, Cognitive-Dissonance Disarming and Dopaminergic Scroll Rhythms in High-Conversion Long-Form Copy},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book