What does Causal Graphs, Suspense Entropy and Foreshadowing conclude, in numbers, about “Sawtooth Scheduling: Hook Spacing and a Markov Model of Serial Retention”?
Answer: Chapter 4 solves for the best hook spacing under sawtooth entropy, gap-dependent churn and habituation: under illustrative parameters a hook every three chapters keeps 0.234 of readers at chapter 100 against 0.098 for a hook in every chapter, and under other reader traits a blanket spacing keeps up to 0.140 less.
Scope of the numbers: Its serials, readers and parameters are illustrative models; all calculations are generated by its programs; it is not legal, financial or investment advice, and it keeps one red line: no false suspense to win clicks. 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.098, 0.234, 100
| k | hook bits | mean H end | mean churn | kept@30 | kept@100 |
| 1 | 0.200 | 0.806 | 0.0229 | 0.504 | 0.098 |
| 2 | 0.615 | 1.219 | 0.0150 | 0.625 | 0.220 |
| 3 | 1.000 | 1.311 | 0.0144 | 0.629 | 0.234 |
| 4 | 1.280 | 1.254 | 0.0160 | 0.594 | 0.200 |
| 5 | 1.471 | 1.149 | 0.0184 | 0.544 | 0.155 |
| 6 | 1.600 | 1.036 | 0.0212 | 0.495 | 0.116 |
| 7 | 1.690 | 0.943 | 0.0240 | 0.458 | 0.087 |
| 8 | 1.753 | 0.853 | 0.0268 | 0.410 | 0.065 |
| 9 | 1.800 | 0.778 | 0.0296 | 0.389 | 0.049 |
| 10 | 1.835 | 0.706 | 0.0323 | 0.346 | 0.037 |
| best spacing over 100 chapters: every 3 chapters, kept 0.234 | |||||
| H at chapter ends 1 to 9: 0.75 0.56 1.42 1.07 0.80 1.60 1.20 0.90 1.67 |
Show the full program
# Chapter 4. p41: sawtooth suspense and reader retention, hook every k.
# Open entropy H (bits) is released mid-chapter by a fraction RHO; every
# k-th chapter ends on a hook that adds h(k) = H0K k^2 / (k^2 + KAP^2)
# bits, capped at HMAX: hooks fired too close together are discounted by
# the reader (habituation). After each chapter a reader leaves with
# q = QF + A exp(-B H) + C max(0, H - HC)^2: a small floor, a term that
# falls as the information gap H grows (Loewenstein 1994) and an overload
# term when too much is left open. Retention is the product of (1 - q)
# over the chapters, a Markov chain with two states (reading, gone).
# All parameters are illustrative, chosen to show the shape.
import math
HMAX, RHO, H0K, KAP = 3.0, 0.25, 2.0, 3.0
QF, A, B, C, HC = 0.005, 0.06, 1.5, 0.03, 2.0
def hook(k):
return H0K * k * k / (k * k + KAP * KAP)
def run(k, n=100, h=1.0, rho=RHO, kap=KAP):
s, trace, qs = 1.0, [], []
for t in range(1, n + 1):
mid = h * (1 - rho)
h = mid
if t % k == 0:
h = min(HMAX, mid + H0K * k * k / (k * k + kap * kap))
q = QF + A * math.exp(-B * h) + C * max(0.0, h - HC) ** 2
s *= 1 - q
trace.append(h)
qs.append(q)
if t == 30:
s30 = s
return s30, s, trace, qs
print(" k hook bits mean H end mean churn kept@30 kept@100")
best = None
for k in range(1, 11):
s30, s100, trace, qs = run(k)
print("{:>2} {:>9.3f} {:>10.3f} {:>10.4f} {:>7.3f} {:>8.3f}".format(
k, hook(k), math.fsum(trace) / len(trace),
math.fsum(qs) / len(qs), s30, s100))
if best is None or s100 > best[1]:
best = (k, s100)
print("best spacing over 100 chapters: every {} chapters, kept {:.3f}"
.format(*best))
tr = run(best[0])[2]
print("H at chapter ends 1 to 9: " +
" ".join("{:.2f}".format(x) for x in tr[:9]))Single source and citation
Fan, Y. (2026). Causal-DAG Validation of Long-Form Narrative, Sawtooth Scheduling of Chapter Suspense Entropy and Forgetting-Aware Foreshadowing Recovery (Version 1.0.0), Chapter 4: Sawtooth Scheduling: Hook Spacing and a Markov Model of Serial Retention. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-178 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026178,
author = {Fan, Yafu},
title = {Causal-DAG Validation of Long-Form Narrative, Sawtooth Scheduling of Chapter Suspense Entropy and Forgetting-Aware Foreshadowing Recovery},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Causal Graph: Kahn's Topological Sort and Version Conflicts in a Setting
- Chapter 2 · Cross-Volume Retcons: Incremental Cycle Detection, Transitive Closure and the Author's Own Forgetting
- Chapter 3 · The Entropy of Suspense: Bayesian Readers, Contrary Evidence and the Suspense Budget
- Chapter 5 · The Forgetting of Foreshadowing: Best Payoff Time, Mid-Way Reminders and a Ceiling on Open Threads
- Chapter 6 · The Survivors Who Keep Reading: Reader Heterogeneity, Survivor Bias and Censoring
- Chapter 7 · The Classics Examined: Jin Shengtan's "How to Read the Fifth Book of Genius" against Aristotle's *Poetics*
- Chapter 8 · Practice and Falsification: A Publisher's Checklist, a Persuasive-Copy Checker and a Pre-Registered Test