关于「原典考辨:金圣叹《读第五才子书法》对读亚里士多德《诗学》」,《长篇叙事的因果图、悬念熵与伏笔回收》给出的定量结论是什么?
结论:金圣叹的草蛇灰线、横云断山与弄引,分别对应本书的分散轻提醒、过载泄压与短距离伏笔;示意模型中,六次轻提的满足感 0.820 高于一次大声提醒的 0.574,插入一章间隔让十二章围城的留存从 0.677 升到 0.737,引子的最优距离约为 4.48 章。亚里士多德的整一标准在示意图上删去了 5 个节点,他对「出人意料而因果相承」的要求,可以量成挣来的惊奇。两部原典的分歧,提醒我们区分结构的整一与读者的持续阅读,并把两者都交给数据。
数据口径:书中的连载、读者与参数均为示意模型;全部计算由书中程序生成;本书不是法律、财务或投资建议,并坚持一条红线:不得以虚假悬念骗取点击。 第一、二章用卡恩拓扑排序与按键分组的版本检查找出时间悖论与同一属性的两个值,并说明跨卷吃书藏在推得出的先后里:示意连载第六卷的一条边与写在第 2 卷到第 6 卷之间的 10 条边相冲突。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.574, 0.677, 0.737, 0.820, 4.48
| (1) object pays off at chapter 40; recall x (1 - spoil) | |
| never mentioned again | 0.036 |
| one loud mention at 37 | 0.574 |
| one loud mention at 25 | 0.554 |
| six faint mentions | 0.820 |
| (2) 12-chapter siege arc, kept: unbroken 0.677, with interlude 0.737 | |
| (3) lead-in k chapters before a big episode; appetite x recall: | |
| k | 1 0.099, k=2 0.158, k=4 0.202, k=5 0.202, k=9 0.151, k=15 0.069 |
| best k = TAU ln(1 + SL / TAU) | 4.48 chapters |
查看完整验算程序
# Chapter 7. p71: three of Jin Shengtan's devices as testable models.
# (1) Grass-snake ash line: an object is mentioned faintly many times
# before it matters. Memory model of p52: a mention resets recall and
# raises stability by G (1 - R); a faint mention has gain GF and
# gives the payoff away with weight WF, a loud one GL and WL.
# (2) Clouds cutting across the mountain: an interlude chapter inside a
# long high-tension arc releases entropy; churn law of p41.
# (3) Lead-in: a small episode k chapters before a big one starts the
# appetite 1 - exp(-k / TAU) early, but is itself recalled only with
# exp(-k / SL): the lead-in is a short foreshadowing (p51 form).
# Parameters are illustrative; the devices are Jin's, the numbers are not.
import math
P, S0, TAU, DELTA = 40, 12.0, 8.0, 6.0
GF, WF, GL, WL, SL = 0.6, 0.08, 1.5, 0.6, 6.0
def payoff(mentions):
s, last, spoil = S0, 0, 0.0
for r, g, w in sorted(mentions):
s *= 1 + g * (1 - math.exp(-(r - last) / s))
last = r
spoil += w * math.exp(-(P - r) / DELTA)
return math.exp(-(P - last) / s) * max(0.0, 1 - spoil)
print("(1) object pays off at chapter {}; recall x (1 - spoil)".format(P))
plans = [("never mentioned again", []),
("one loud mention at 37", [(37, GL, WL)]),
("one loud mention at 25", [(25, GL, WL)]),
("six faint mentions", [(r, GF, WF) for r in range(6, 37, 6)])]
for label, m in plans:
print(" {:<24} {:.3f}".format(label, payoff(m)))
def arc(interlude, n=12, h=1.6, rho=0.25):
s = 1.0
for t in range(1, n + 1):
h *= 1 - rho
if interlude and t == n // 2:
h *= 0.5
else:
h = min(3.0, h + 1.0)
s *= 1 - (0.005 + 0.06 * math.exp(-1.5 * h)
+ 0.03 * max(0.0, h - 2.0) ** 2)
return s
print("(2) 12-chapter siege arc, kept: unbroken {:.3f},".format(
arc(False)) + " with interlude {:.3f}".format(arc(True)))
print("(3) lead-in k chapters before a big episode; appetite x recall:")
cells = []
for k in (1, 2, 4, 5, 9, 15):
v = (1 - math.exp(-k / TAU)) * math.exp(-k / SL)
cells.append("k={} {:.3f}".format(k, v))
print(" " + ", ".join(cells))
print(" best k = TAU ln(1 + SL / TAU) = {:.2f} chapters".format(
TAU * math.log(1 + SL / TAU)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《长篇叙事因果有向无环图校验、章节悬念信息熵锯齿调度与伏笔遗忘衰减回收》第 7 章「原典考辨:金圣叹《读第五才子书法》对读亚里士多德《诗学》」(版本 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}
}