What does Computational Bibliometrics and Self-Verifying Books conclude, in numbers, about “Liu Xie, Dai Zhen and Knuth: Old Rules for Checkable Writing”?

Answer: A true gloss fits each passage with chance 0.95, a plausible false one with chance 0.50. Starting from a prior of 0.30, one fitting passage moves belief only to 0.4488; four passages to 0.8481; eight to 0.9864; and 9 are needed for 0.99. A false gloss survives eight passages with chance 0.00391. The bilingual gate of Chapter 6 is the same test with two "passages" for every number: the Chinese and English text must print the same set.

Scope of the numbers: Its readers, books, error rates and costs are illustrative models; all calculations are generated by its programs; the book is not legal, financial or publishing advice. Marked boxes separate published evidence, runnable Python calculations (16 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. printed values that match the answer: 0.00391, 0.4488, 0.8481, 0.9864, 0.99

passagesP(true | all fit)false gloss survives
10.44880.50000
20.60740.25000
40.84810.06250
80.98640.00391
160.99990.00002
passages needed for 0.99: 9
Show the full program
# Chapter 7. p14: "Without evidence, no belief", as arithmetic. Dai Zhen
# asked that the sense of a word be tested in every passage where it
# occurs. Two rival glosses of a word: the true one fits each passage
# with chance 0.95 (copying errors), a plausible false one with chance
# 0.50. Prior on the true gloss 0.30. Posterior after n passages that all
# fit, and the chance a false gloss survives n passages. The same test
# is what the bilingual gate does: one number, two languages, n chapters.

def posterior(n, prior=0.30, t=0.95, f=0.50):
    a = prior * t ** n
    b = (1 - prior) * f ** n
    return a / (a + b)

if __name__ == "__main__":
    print("   passages   P(true | all fit)   false gloss survives")
    for n in (1, 2, 4, 8, 16):
        print("   {:8d}   {:17.4f}   {:20.5f}".format(
            n, posterior(n), 0.5 ** n))
    n = 0
    while posterior(n) < 0.99:
        n += 1
    print("   passages needed for 0.99: {}".format(n))

Single source and citation

Fan, Y. (2026). Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers (Version 1.0.0), Chapter 7: Liu Xie, Dai Zhen and Knuth: Old Rules for Checkable Writing. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-101 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026101,
  author    = {Fan, Yafu},
  title     = {Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book