关于「传输的剂量:故事不是越长越好、越煽情越好」,《故事劝买与成交桥接》给出的定量结论是什么?

结论:第二章写传输的剂量上限,示意模型里最佳故事段约 600 字、轻度煽情,又长又催泪的版本只剩最佳值的 33.9 %;并给出具体人物与统计句的配比。

数据口径:书中参数为示意,全部计算由书中程序生成。 本书是非个人化经营建议,不构成法律或医疗意见;所有故事样本均为示意虚构,不伪造任何证言或真实案例。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 33.9, 600

scales: transport saturates at 600, reach decays at 2,500 hanzi
A. value at the CTA by length (m = 0.25)
lengthTreachV
2000.2640.9230.4399
6000.5430.7870.4928
1,0000.6860.6700.4644
1,4000.7600.5710.4139
2,0000.8090.4490.3348
2,6000.8270.3530.2659
3,4000.8350.2570.1939
B. best length for each melodrama level
msbest LV at best
0.000.3006000.4860
0.250.3376000.4928
0.500.4506000.4823
0.750.6378000.4455
1.000.9001,0000.3680
C. overall best: L = 600 hanzi, m = 0.25, V = 0.4928
long and maudlin (3,400, m = 1): V = 0.1669, 33.9% of best
查看完整验算程序
# Chapter 2. p21: story length and melodrama have a dose ceiling.
# Illustrative model built on p11 (all parameters are assumptions):
#   transport T(L, m) = min(0.95, 0.80 * (1 - exp(-L / 600)) + 0.15 m)
#   L = story length in hanzi before the call to action, m = melodrama
#   salience s(m) = 0.30 + 0.60 m^2   (overt tear-jerking is noticed)
#   reach r(L) = exp(-L / 2500)       (share still reading at the CTA)
#   value at the CTA V = r(L) * A(Q = 0.55, s, T), A from p11.
import math

B0, B1, B2 = -1.5, 3.0, 2.5
BETA, GAMMA = 0.30, 0.25


def shift(q, s, t):
    c = 1.0 / (1.0 + math.exp(-(B0 + B1 * s - B2 * t)))
    return math.fsum([q * (1.0 - c), BETA * t, -GAMMA * c * s])


def value(length, m):
    t = min(0.95, 0.80 * (1.0 - math.exp(-length / 600.0)) + 0.15 * m)
    s = 0.30 + 0.60 * m * m
    return math.exp(-length / 2500.0) * shift(0.55, s, t), t, s


if __name__ == "__main__":
    lengths = list(range(200, 3401, 200))
    print("scales: transport saturates at {:,}, reach decays at {:,} hanzi"
          .format(600, 2500))
    print("A. value at the CTA by length (m = 0.25)")
    print("  length   T      reach   V")
    for n in (200, 600, 1000, 1400, 2000, 2600, 3400):
        v, t, _ = value(n, 0.25)
        print("  {:>6,}  {:.3f}  {:.3f}   {:.4f}".format(
            n, t, math.exp(-n / 2500.0), v))
    print("B. best length for each melodrama level")
    print("    m     s     best L   V at best")
    for m in (0.0, 0.25, 0.5, 0.75, 1.0):
        best = max(lengths, key=lambda n: value(n, m)[0])
        v, _, s = value(best, m)
        print("  {:.2f}  {:.3f}  {:>6,}    {:.4f}".format(m, s, best, v))
    grid = [(value(n, m)[0], n, m) for n in lengths
            for m in (0.0, 0.25, 0.5, 0.75, 1.0)]
    v, n, m = max(grid)
    print("C. overall best: L = {:,} hanzi, m = {:.2f}, V = {:.4f}".format(
        n, m, v))
    v3 = value(3400, 1.0)[0]
    print("   long and maudlin (3,400, m = 1): V = {:.4f}, {:.1%} of best"
          .format(v3, v3 / v))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《商业故事劝买动力学、心防卸载叙事弧与无痕切入成交母典》第 2 章「传输的剂量:故事不是越长越好、越煽情越好」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论