What does Computational Bibliometrics and Self-Verifying Books conclude, in numbers, about “The Trust Ratchet Turns Both Ways”?
Answer: Chapter 4 shows that one found error cancels 17.8 good checks.
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. standard-library Python onlyprinted values that match the answer: 17.8
| good checks | P(careful) | after one error |
|---|---|---|
| 0 | 0.200 | 0.016 |
| 5 | 0.349 | 0.034 |
| 10 | 0.535 | 0.071 |
| 20 | 0.841 | 0.260 |
| 40 | 0.991 | 0.881 |
| 80 | 1.000 | 1.000 |
| one found error cancels 17.8 good checks | ||
| 20 good checks, then 2 errors: 0.023 | ||
| 40 good checks, then 2 errors: 0.331 |
Show the full program
# Chapter 4. p07: The trust ratchet runs both ways. A reader checks claims
# one at a time. A careful author is wrong on 1 claim in 100, a careless
# one on 15 in 100. Prior P(careful) = 0.20. Each claim that checks out
# multiplies the odds by 0.99 / 0.85; each error found multiplies them by
# 0.01 / 0.15. How many good checks does one found error cancel?
from math import log
E_C, E_S, PRIOR = 0.01, 0.15, 0.20
def p_after(good, bad, prior=PRIOR):
odds = prior / (1 - prior)
odds *= ((1 - E_C) / (1 - E_S)) ** good * (E_C / E_S) ** bad
return odds / (1 + odds)
if __name__ == "__main__":
print(" good checks P(careful) after one error")
for g in (0, 5, 10, 20, 40, 80):
print(" {:11d} {:10.3f} {:15.3f}".format(
g, p_after(g, 0), p_after(g, 1)))
lr_good = log((1 - E_C) / (1 - E_S))
lr_bad = log(E_S / E_C)
print(" one found error cancels {:.1f} good checks".format(
lr_bad / lr_good))
for g in (20, 40):
print(" {} good checks, then 2 errors: {:.3f}".format(
g, p_after(g, 2)))Single source and citation
Fan, Y. (2026). Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers (Version 1.0.0), Chapter 4: The Trust Ratchet Turns Both Ways. 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
- Chapter 1 · Two Survival Laws: Why Most Books Fade and a Few Keep Being Read
- Chapter 2 · Surprise, Anchors and Completion
- Chapter 3 · Falsify, Then Bound: The Bayesian Case and Its Limits
- Chapter 5 · Proofreading Floors and Whitelist Gates
- Chapter 6 · The Self-Verifying Compiler: Code Points and the Whole Pipeline
- Chapter 7 · Liu Xie, Dai Zhen and Knuth: Old Rules for Checkable Writing
- Chapter 8 · Practice: Costs, the Long Tail and a Checklist