关于「悬念的信息熵:贝叶斯读者、反向证据与悬念预算」,《长篇叙事的因果图、悬念熵与伏笔回收》给出的定量结论是什么?

结论:把悬念写成熵,钩子就有了明确的数学身份:它是支持读者原本不看好的结局的证据,所以能让熵上升,而平均来看证据只会让熵下降。示意故事的熵沿着锯齿走了六章,最后由揭晓降到 0.060 比特。悬念的总预算是守恒的,示意问题中为 0.2500;捂到结局只换来 0.500 的平方根之和,每章分到同样多的悬念则得到 1.500。剧透研究提醒我们,这只是阅读动力的一部分。下一章把锯齿与留存连起来,求钩子的最优间距。

数据口径:书中的连载、读者与参数均为示意模型;全部计算由书中程序生成;本书不是法律、财务或投资建议,并坚持一条红线:不得以虚假悬念骗取点击。 第一、二章用卡恩拓扑排序与按键分组的版本检查找出时间悖论与同一属性的两个值,并说明跨卷吃书藏在推得出的先后里:示意连载第六卷的一条边与写在第 2 卷到第 6 卷之间的 10 条边相冲突。

English version

对照数据表

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

scheduletotalfinalesum sqrtbits leftchapter 1
hold to finale0.25001.0000.5001.0000.0000
front-loaded0.25000.1900.6680.2860.2025
flat 0.620.25000.6601.2270.7200.0144
equalised0.25000.1111.5000.1410.0278
equalised clue accuracy, ch 1 and ch 8: 0.667 and 0.906
查看完整验算程序
# Chapter 3. p32: how to spend a fixed budget of suspense.
# Ely, Frankel and Kamenica (2015): the reader's belief that the hero
# survives is a martingale, so the expected squared belief moves over the
# whole book always add up to mu0 (1 - mu0), whatever the author does.
# Suspense in a chapter is the expected squared move it causes; a reader
# whose enjoyment is concave (here the square root) in each chapter's
# suspense prefers the budget spread out. Exact enumeration of a binary
# state, prior 0.5, eight chapters of clues with accuracy a_t and a
# finale that reveals the state. Schedules are illustrative.
import math

T, MU0 = 8, 0.5


def step(dist, a):
    out, move = {}, 0.0
    parts = []
    for mu, w in dist.items():
        for s in (1, 0):
            ps = mu * a + (1 - mu) * (1 - a) if s else \
                mu * (1 - a) + (1 - mu) * a
            if ps <= 0:
                continue
            post = mu * (a if s else 1 - a) / ps
            key = round(post, 12)
            out[key] = out.get(key, 0.0) + w * ps
            parts.append(w * ps * (post - mu) ** 2)
    return out, math.fsum(parts)


def H2(m):
    if m <= 0 or m >= 1:
        return 0.0
    return -(m * math.log2(m) + (1 - m) * math.log2(1 - m))


def evaluate(acc):
    dist, sus = {MU0: 1.0}, []
    for a in acc:
        dist, m = step(dist, a)
        sus.append(m)
    sus.append(math.fsum(w * mu * (1 - mu) for mu, w in dist.items()))
    left = math.fsum(w * H2(mu) for mu, w in dist.items())
    return sus, left


def equalised():
    dist, acc = {MU0: 1.0}, []
    for t in range(T):
        target = MU0 * (1 - MU0) / (T + 1)
        lo, hi = 0.5, 0.999999
        for _ in range(60):
            mid = (lo + hi) / 2
            if step(dist, mid)[1] < target:
                lo = mid
            else:
                hi = mid
        acc.append(lo)
        dist = step(dist, lo)[0]
    return acc


SCHED = [
    ("hold to finale", [0.5] * T),
    ("front-loaded", [0.95] + [0.5] * (T - 1)),
    ("flat 0.62", [0.62] * T),
    ("equalised", equalised()),
]
print("schedule        total   finale  sum sqrt  bits left  chapter 1")
for name, acc in SCHED:
    sus, left = evaluate(acc)
    print("{:<14}  {:.4f}  {:>6.3f}  {:>8.3f}  {:>9.3f}  {:.4f}".format(
        name, math.fsum(sus), sus[-1] / math.fsum(sus),
        math.fsum(math.sqrt(x) for x in sus), left, sus[0]))
acc = SCHED[-1][1]
print("equalised clue accuracy, ch 1 and ch 8: {:.3f} and {:.3f}".format(
    acc[0], acc[-1]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《长篇叙事因果有向无环图校验、章节悬念信息熵锯齿调度与伏笔遗忘衰减回收》第 3 章「悬念的信息熵:贝叶斯读者、反向证据与悬念预算」(版本 1.0.0). 5D Library. DOI 待发布

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

本书其他章节结论