关于「原典考辨:四库校勘、七阁存亡与拉赫曼谱系法」,《书库冲突检测、可复现与纠删码》给出的定量结论是什么?

结论:第七章考辨四库全书的校勘记录与七阁存亡,并与拉赫曼谱系法对读:四份同源抄本加一份独立抄本,按抄本数投票每千字错 20.300 个,按家族比较只剩 0.100 个。

数据口径:书中的书库规模、错误率、风险率与故障率均为示意参数;全部计算由书中程序生成;本书不是法律、财务、采购或存储服务建议。 第一章把书库画成知识图谱,说明卷数越多错误越难藏身:示意书库到 200 卷时,0.9821 的偏差定义处在可以被另一卷反驳的位置。

English version

对照数据表

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

readingwrong / 1000flagged/1000
one copy20.8000.000
3 independent copies, plurality0.0001.300
5 independent copies, plurality0.0000.050
7 independent copies, plurality0.0000.000
4 from beta + 1 alpha, naive plurality20.3000.100
4 from beta + 1 alpha, Lachmann two branches0.10039.800
code view: 3 copies = repetition code, rate 0.333, fixes 1 error;
RS(6+3) has rate 0.667, fixes 3 erasures or 1 error per stripe
查看完整验算程序
# Chapter 7. p72: collation as decoding. A text of 20,000 characters is
# copied by hand; each copy miswrites a character with probability E.
# A miswriting is the common slip (one shared wrong reading, such as a
# look-alike character) with probability SHARE, otherwise a private one.
# (A) independent witnesses copied from the archetype, read by plurality;
# (B) five witnesses of which four descend from one lost exemplar (beta)
# and one from the archetype (alpha): naive plurality against Lachmann's
# rule (rebuild beta from its four, then compare beta with alpha, and
# flag every disagreement for the editor). E and SHARE are illustrative.
import random
from collections import Counter

rng = random.Random(20261112)
L, E, SHARE = 20000, 0.02, 0.3


def copy(text):
    out = []
    for ch in text:
        if rng.random() < E:
            if rng.random() < SHARE:
                out.append(-ch - 1)
            else:
                out.append(rng.randrange(10 ** 6, 10 ** 7))
        else:
            out.append(ch)
    return out


def plural(wits):
    res = []
    for col in zip(*wits):
        c = Counter(col).most_common()
        if len(c) > 1 and c[0][1] == c[1][1]:
            res.append(None)
        else:
            res.append(c[0][0])
    return res


def score(read, truth):
    wrong = len([1 for r, t in zip(read, truth) if r is not None and r != t])
    flag = len([1 for r in read if r is None])
    return 1000 * wrong / L, 1000 * flag / L


arch = list(range(L))
print("{:<44} {:>13} {:>13}".format(
    "reading", "wrong / 1000", "flagged/1000"))
print("{:<44} {:>13.3f} {:>13.3f}".format(
    "one copy", *score(copy(arch), arch)))
for n in (3, 5, 7):
    wits = [copy(arch) for _ in range(n)]
    print("{:<44} {:>13.3f} {:>13.3f}".format(
        "{} independent copies, plurality".format(n),
        *score(plural(wits), arch)))
beta = copy(arch)
fam = [copy(beta) for _ in range(4)] + [copy(arch)]
print("{:<44} {:>13.3f} {:>13.3f}".format(
    "4 from beta + 1 alpha, naive plurality", *score(plural(fam), arch)))
b_hat = plural(fam[:4])
lach = [b if b == a else None for b, a in zip(b_hat, fam[4])]
print("{:<44} {:>13.3f} {:>13.3f}".format(
    "4 from beta + 1 alpha, Lachmann two branches", *score(lach, arch)))
print("code view: 3 copies = repetition code, rate 0.333, fixes 1 error;")
print("RS(6+3) has rate 0.667, fixes 3 erasures or 1 error per stripe")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《超大规模双语专著库跨卷定理冲突检测、代码可复现性衰减防腐与冷存储纠删码》第 7 章「原典考辨:四库校勘、七阁存亡与拉赫曼谱系法」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-182 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026182,
  author    = {Fan, Yafu},
  title     = {Cross-Volume Theorem-Conflict Detection in Large Bilingual Monograph Libraries, Anti-Decay of Code Reproducibility and Erasure-Coded Cold Storage},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论