What does Computational Bibliometrics and Self-Verifying Books conclude, in numbers, about “The Self-Verifying Compiler: Code Points and the Whole Pipeline”?
Answer: Chapter 6 surveys the code points that print like ideographs (all 214 Kangxi radicals) and computes that the whole pipeline takes a draft with 81 wrong numbers to an expected 1.322, with a chance of no error of 0.2665, not zero.
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: 0.2665, 1.322
| stages | errors left | P(zero errors) |
|---|---|---|
| draft | 81.000 | 0.0000 |
| A | 12.109 | 0.0000 |
| G | 20.388 | 0.0000 |
| GB | 14.313 | 0.0000 |
| AG | 3.048 | 0.0475 |
| AGB | 2.140 | 0.1177 |
| GBT | 8.845 | 0.0001 |
| AGBT | 1.322 | 0.2665 |
| raw rate 0.18 -> per-number rate after AGBT 0.00294 |
Show the full program
# Chapter 6. p12: From an 18% draft to how many errors? A 450-number
# draft at 0.18 holds 81 wrong numbers, mixed 0.60 invented, 0.25 slips,
# 0.15 swaps. Stages, each applied to what the last one left:
# A three human passes, detectability Beta(0.7, 0.3) (miss 0.1495)
# G chapter-local whitelist (escape: invented 0.122, slip 0.114,
# swap 1.000; values from p10)
# B bilingual set equality: a swap made in one language only is caught
# if it changes the set of numbers; assume half of swaps are
# one-language and those are caught
# T numbers typed from the program output by a template: swaps of
# that kind cannot occur; assume 0.9 of swaps are removed
# Expected errors left and P(zero errors) under a Poisson count.
import math
from math import exp
DRAFT = 81.0
MIX = {"invented": 0.60, "slip": 0.25, "swap": 0.15}
GATE = {"invented": 0.122, "slip": 0.114, "swap": 1.0}
def run(stages):
e = {k: DRAFT * v for k, v in MIX.items()}
for s in stages:
if s == "A":
e = {k: v * 0.1495 for k, v in e.items()}
elif s == "G":
e = {k: v * GATE[k] for k, v in e.items()}
elif s == "B":
e["swap"] *= 0.5
elif s == "T":
e["swap"] *= 0.1
return math.fsum(e.values())
if __name__ == "__main__":
print(" stages errors left P(zero errors)")
for st in ("", "A", "G", "GB", "AG", "AGB", "GBT", "AGBT"):
left = run(st)
print(" {:<14} {:11.3f} {:14.4f}".format(
st or "draft", left, exp(-left)))
print(" raw rate 0.18 -> per-number rate after AGBT {:.5f}".format(
run("AGBT") / 450))Single source and citation
Fan, Y. (2026). Computational Bibliometrics, Falsification-First Rhetoric and Self-Verifying Monograph Compilers (Version 1.0.0), Chapter 6: The Self-Verifying Compiler: Code Points and the Whole Pipeline. 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 4 · The Trust Ratchet Turns Both Ways
- Chapter 5 · Proofreading Floors and Whitelist Gates
- Chapter 7 · Liu Xie, Dai Zhen and Knuth: Old Rules for Checkable Writing
- Chapter 8 · Practice: Costs, the Long Tail and a Checklist