What does Stories, Counter-Arguing and Checkout Bridges conclude, in numbers, about “The Empathic Opening: How a Story Lets Readers In”?
Answer: With 100 impressions per arm, only 10 of the two hundred tests pick the right opening and 190 reach no decision. At 400 impressions per arm, 36 pick correctly; at 1,600, 109; at 3,200, 156, with 44 still undecided. Notice that the column for wrong picks is 0 throughout. The strict 95 % rule almost never crowns the wrong opening; the price is that it often declines to crown any.
Scope of the numbers: Parameters are illustrative, and all calculations are generated by the book's programs. This is general business analysis, not legal or medical advice; every story sample is an illustrative fiction, and no testimonial or real case is fabricated.
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: 10, 100, 109, 156, 1600, 190
| n/arm right wrong none (200 tests each) | |||
| 100 | 10 | 0 | 190 |
| 400 | 36 | 0 | 164 |
| 1,600 | 109 | 0 | 91 |
| 3,200 | 156 | 0 | 44 |
| O1 vs O3 alone separates fast; O1 vs O2 (0.58 vs 0.55) is slow | |||
Show the full program
# Chapter 4. p42: how many impressions before an opening is "the best"?
# Illustrative true first-screen continuation rates (share of readers
# who scroll past the opening): O1 ledger chaos 0.58, O2 curious
# learner 0.55, O3 spec sheet 0.46. For each sample size per arm we
# run 200 simulated tests; each test draws 500 posterior samples per
# arm from Beta(1 + x, 1 + n - x) and declares a winner when one arm
# is best in at least 95 % of draws. We report how often the right
# arm (O1) is declared, how often a wrong arm is, and how often none.
import random
TRUE = [0.58, 0.55, 0.46]
def one_test(rng, n):
xs = [0] * 3
for i, p in enumerate(TRUE):
for _ in range(n):
if rng.random() < p:
xs[i] += 1
wins = [0, 0, 0]
for _ in range(500):
d = [rng.betavariate(1 + x, 1 + n - x) for x in xs]
wins[d.index(max(d))] += 1
top = max(range(3), key=lambda i: wins[i])
return top if wins[top] >= 475 else -1
if __name__ == "__main__":
rng = random.Random(4242)
print(" n/arm right wrong none (200 tests each)")
for n in (100, 400, 1600, 3200):
res = [one_test(rng, n) for _ in range(200)]
right = res.count(0)
none = res.count(-1)
print(" {:>5,} {:>5} {:>5} {:>4}".format(
n, right, 200 - right - none, none))
print("O1 vs O3 alone separates fast; O1 vs O2 (0.58 vs 0.55) is slow")Single source and citation
Fan, Y. (2026). Commercial Storytelling Mechanics, Counter-Arguing Suppression Arcs and Seamless Narrative-to-Checkout Bridges (Version 1.0.0), Chapter 4: The Empathic Opening: How a Story Lets Readers In. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-380 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026380,
author = {Fan, Yafu},
title = {Commercial Storytelling Mechanics, Counter-Arguing Suppression Arcs and Seamless Narrative-to-Checkout Bridges},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Counter-Arguing and Transport: Why the Hard Sell So Often Fails
- Chapter 2 · The Dose of Transportation: Longer and Sadder Is Not Better
- Chapter 3 · The Parameters of a Narrative Arc: Emotional Curves, Reversal Density and Concreteness
- Chapter 5 · The Bridge Formula: From Climax to Call to Action
- Chapter 6 · Compliance Red Lines and a Full-Funnel Simulation: A Smooth Bridge Must Not Become a Trapdoor
- Chapter 7 · Eastern and Western Sources Examined: The Difficulty of Persuasion, Zou Ji, Reversal and the Three Proofs
- Chapter 8 · Field Tools and Checker Specifications: The Story-Page Ledger, a Pre-Registered Test and the Conditions of Refutation