What does Narrative Transportation and Scroll Rhythms conclude, in numbers, about “Narrative Transportation: Scale Reliability, Attenuation and the Cost of Breaking a Story”?

Answer: Chapter 1 shows that a two-question survey sees only part of the true effect of narrative transportation, and that two hard-sell breaks inside a story leave 0.681 of the unbroken acceptance.

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: 0.681

breakstransportintentcounterargsacceptancevs unbroken
00.8000.300.2400.9321.000
10.6000.500.8000.7900.848
20.4500.701.5400.6350.681
30.3380.902.3850.4940.531
40.2531.002.9870.4140.444
50.1901.003.2410.3840.412
plain sales text (T = 0, I = 1): acceptance 0.307
unbroken story with the ask at the end: 0.932
unbroken story, intent fully seen at the end: 0.790
Show the full program
# Chapter 1. p12: What a hard-sell break inside a story costs. A reader's
# counterarguments arrive as a Poisson count with mean
#   lam = MU * (1 - T) * I,
# where T is transportation (0 to 1) and I the perceived persuasive
# intent. Each counterargument multiplies acceptance by exp(-KAP), so
#   E[acceptance] = exp(-lam * (1 - exp(-KAP))).
# Every hard-sell break inside the story removes a share DROP of T and
# adds GAM to I. All parameters are illustrative.
import math

T0 = 0.80     # transportation of an unbroken story (illustrative)
I0 = 0.30     # perceived intent while the story runs
DROP = 0.25   # share of transportation lost at each break
GAM = 0.20    # intent added by each break
MU = 4.0      # counterarguments expected when T = 0 and I = 1
KAP = 0.35    # log-acceptance lost per counterargument


def accept(t, i):
    lam = MU * (1 - t) * i
    return lam, math.exp(-lam * (1 - math.exp(-KAP)))


base_lam, base = accept(T0, I0)
print("breaks  transport  intent  counterargs  acceptance  vs unbroken")
for k in range(6):
    t = T0 * (1 - DROP) ** k
    i = min(1.0, I0 + GAM * k)
    lam, a = accept(t, i)
    print("{:6d}  {:9.3f}  {:6.2f}  {:11.3f}  {:10.3f}  {:11.3f}".format(
        k, t, i, lam, a, a / base))
lam0, plain = accept(0.0, 1.0)
print("plain sales text (T = 0, I = 1): acceptance {:.3f}".format(plain))
print("unbroken story with the ask at the end: {:.3f}".format(base))
ask_end = accept(T0, 1.0)[1]
print("unbroken story, intent fully seen at the end: {:.3f}".format(
    ask_end))

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 1: Narrative Transportation: Scale Reliability, Attenuation and the Cost of Breaking a Story. 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