What does Library Conflicts, Reproducibility and Erasure Codes conclude, in numbers, about “Practice and Falsification: a Publisher's Checklists for Consistency, Reproducibility and Cold Storage”?
Answer: Chapter 8 offers checklists for publishers, a cold-storage cost calculator, an errata register format and a pre-registered test protocol. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.
Scope of the numbers: Library sizes, error rates, hazards and failure rates are illustrative; all calculations are generated by the programs in the book; the book is not legal, financial, procurement or storage-service advice. Chapter 1 draws the library as a knowledge graph and shows that the more volumes there are, the fewer places an error can hide: at 200 volumes, 0.9821 of deviant definitions in the illustrative library sit where another volume can contradict them.
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: 20
| erratum | ch kind | wrong | fixed | edition | gate |
|---|---|---|---|---|---|
| B182-E01 | 2 wording | 660835d7 | eba5e722 | 1.0.1 | text |
| B182-E02 | 3 number | a3ecb34c | 1609cb27 | 1.1.0 | full |
| B182-E03 | 5 wording | 8eff8f20 | 6bf10d73 | 1.1.1 | text |
| B182-E04 | 6 program | 5ab13d14 | f7d2d18b | 1.2.0 | full |
| B182-E05 | 6 number | fef04985 | b5aa90ab | 1.3.0 | full |
| B182-E06 | 7 wording | 9ef8fe7f | 71c5e466 | 1.3.1 | text |
| reports 6, numbers or programs 3, final edition 1.3.1 |
Show the full program
# Chapter 8. p83: an errata register that a reply to a reader can quote.
# Each erratum gets a stable number (volume, running index), the chapter,
# its kind, SHA-256 fingerprints of the wrong and the corrected sentence,
# and the edition that fixes it. Version rule: wording-only fixes bump the
# patch number; any change to a printed number or a program bumps the
# minor number and forces the whole gate to run again. The six reports
# are synthetic examples, not real errata of any volume.
import hashlib
REPORTS = (
(2, "wording", "the index compares every pair",
"the index compares pairs inside one bucket"),
(3, "number", "rule of three needs 300 claims",
"the exact zero-failure plan needs 299 claims"),
(5, "wording", "parity rows form a Vandermonde matrix",
"parity rows form a Cauchy matrix"),
(6, "program", "scrub model ignores disk failures",
"scrub model counts failed and rotten shards together"),
(6, "number", "library loss 1.0e-04 per year",
"library loss 1.089e-04 per year"),
(7, "wording", "seven copies, four lost",
"seven copies, three lost entirely and one in part"),
)
def fp(s):
return hashlib.sha256(s.encode("utf-8")).hexdigest()[:8]
major, minor, patch = 1, 0, 0
print("{:<10} {:>3} {:<8} {:>9} {:>9} {:>9} {:>6}".format(
"erratum", "ch", "kind", "wrong", "fixed", "edition", "gate"))
for i, (ch, kind, old, new) in enumerate(REPORTS, 1):
if kind == "wording":
patch += 1
else:
minor, patch = minor + 1, 0
ed = "{}.{}.{}".format(major, minor, patch)
print("{:<10} {:>3} {:<8} {:>9} {:>9} {:>9} {:>6}".format(
"B182-E{:02d}".format(i), ch, kind, fp(old), fp(new), ed,
"full" if kind != "wording" else "text"))
kinds = [k for _, k, _, _ in REPORTS]
print("reports {}, numbers or programs {}, final edition {}.{}.{}".format(
len(REPORTS), len([k for k in kinds if k != "wording"]),
major, minor, patch))Single source and citation
Fan, Y. (2026). Cross-Volume Theorem-Conflict Detection in Large Bilingual Monograph Libraries, Anti-Decay of Code Reproducibility and Erasure-Coded Cold Storage (Version 1.0.0), Chapter 8: Practice and Falsification: a Publisher's Checklists for Consistency, Reproducibility and Cold Storage. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 1 · The Library as a Graph: Volumes, Chapters, Terms and Numeric Claims as Nodes
- Chapter 2 · Normalization and Hash Indexing: False Alarms and Misses in Cross-Volume Conflict Detection
- Chapter 3 · The Sampling Theory of Regression Audits: the Rule of Three and the Finite-Population Correction
- Chapter 4 · The Decay of Code Reproducibility: Hazard Rates of Dependency Drift and Byte-Exact Output Regression
- Chapter 5 · Reed-Solomon over GF(2^8): Erasure Coding and Recovery in the Standard Library
- Chapter 6 · The Reliability of Replicas and Erasure Codes: Binomial Windows, Markov Chains and Scrubbing for Bit Rot
- Chapter 7 · Classical Sources: Siku Collation, the Fate of the Seven Pavilions and Lachmann's Stemmatics