What does Causal Graphs, Suspense Entropy and Foreshadowing conclude, in numbers, about “Practice and Falsification: A Publisher's Checklist, a Persuasive-Copy Checker and a Pre-Registered Test”?
Answer: Chapter 8 gives a checklist, an eight-rule persuasive-copy checker and a pre-registered protocol: comparing hook schedules needs 3,044 readers per arm, and evaluating a single hook needs 583,531 starting readers per arm. Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.
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: 3044, 583531
| z for alpha/2 | 1.9600, z for power = 0.8416 |
| comparison p1 p2 readers per arm | |
| kept@30, k | 3 vs k = 4 (p41) 0.6290 0.5940 3,044 |
| kept@30, k | 3 vs k = 1 (p41) 0.6290 0.5040 246 |
| ch 50 churn, x0.9 (p62) | 0.0150 0.0135 98,002 |
| S(49) | 0.1679; starters per arm for the ch 50 test: 583,531 |
| with | 2,000 per arm, smallest detectable kept@30 gap: 0.0433 |
| with | 5,000 per arm, smallest detectable kept@30 gap: 0.0273 |
| with 20,000 per arm, smallest detectable kept@30 gap | 0.0136 |
Show the full program
# Chapter 8. p82: sample sizes for a pre-registered hook-spacing test.
# Two-sided two-proportion z test, alpha 0.05, power 0.80, readers
# randomized at chapter 1 to two hook spacings. The proportions are taken
# from p41 (share kept at chapter 30) and p62 (churn at chapter 50 among
# readers who got there, which needs the starters scaled up by the
# shifted-beta-geometric survival S(49) with a = 0.8, b = 6). Normal
# approximation, standard library NormalDist. Inputs are model outputs.
import math
from statistics import NormalDist
Z = NormalDist()
ZA, ZB = Z.inv_cdf(0.975), Z.inv_cdf(0.80)
def n_per_arm(p1, p2):
pb = (p1 + p2) / 2
num = (ZA * math.sqrt(2 * pb * (1 - pb))
+ ZB * math.sqrt(p1 * (1 - p1) + p2 * (1 - p2)))
return math.ceil(num ** 2 / (p1 - p2) ** 2)
def s49(a=0.8, b=6.0, t=49):
return math.exp(math.lgamma(b + t) - math.lgamma(a + b + t)
- math.lgamma(b) + math.lgamma(a + b))
print("z for alpha/2 = {:.4f}, z for power = {:.4f}".format(ZA, ZB))
print("comparison p1 p2 readers per arm")
rows = [("kept@30, k = 3 vs k = 4 (p41)", 0.629, 0.594),
("kept@30, k = 3 vs k = 1 (p41)", 0.629, 0.504),
("ch 50 churn, x0.9 (p62)", 0.0150, 0.0135)]
for label, a, b in rows:
print("{:<33} {:.4f} {:.4f} {:>15,}".format(label, a, b,
n_per_arm(a, b)))
n50 = n_per_arm(0.0150, 0.0135)
print("S(49) = {:.4f}; starters per arm for the ch 50 test: {:,}".format(
s49(), math.ceil(n50 / s49())))
for n in (2000, 5000, 20000):
lo = 0.629
hi = next(d / 10000 for d in range(1, 6000)
if n_per_arm(lo, lo - d / 10000) <= n)
print("with {:>6,} per arm, smallest detectable kept@30 gap: {:.4f}"
.format(n, hi))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 8: Practice and Falsification: A Publisher's Checklist, a Persuasive-Copy Checker and a Pre-Registered Test. 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 4 · Sawtooth Scheduling: Hook Spacing and a Markov Model of Serial Retention
- 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*