What does The Algebra of Check Digits conclude, in numbers, about “Classics East and West: Ritual Bronzes, Red Tablets and Gauss's Congruences”?

Answer: The Overseer of Covenants in the Autumn Offices of the Rites of Zhou wrote great covenants on ritual bronzes and lesser ones on red tablets, a principle of matching protection to the stakes. Program p71's illustrative model shows that, with a slip chance of 0.00499 for a ten-character number, one Verhoeff digit is the lowest-cost choice for small orders (21.18 yuan per thousand), two MOD 97-10 characters are the lowest-cost choice for large orders and remittances (42.44 and 72.55 yuan), and entering numbers twice never pays; but a bronze guards against tampering and loss while a check digit guards against slips, and neither replaces the other. Gauss's congruence is the foundation of the book's arithmetic: over all four-digit amounts, casting out nines detects swaps at 0.0000 and the alternating sum modulo 11 at 1.0000, and every swap changes an amount by a multiple of 9, as 4710 written as 4170 differs by 540. The next chapter turns the whole book into an order desk procedure, a small tool and a pre-registered test plan.

Scope of the numbers: Entry volumes, error rates and costs are illustrative; all calculations are generated by the book's programs; the book is not individual business advice. Marked boxes separate published evidence, runnable Python calculations (19 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: -10, 0.00499, 21.18, 42.44, 72.55, 97

cost per 1,000 codes (yuan): typing + expected loss from misses
option small order large order remittance
no check99.78 2993.26 39910.12
1 Verhoeff digit21.18 55.25 490.06
2 MOD 97-10 digits40.08 42.44 72.55
typed twice200.05 201.49 219.91
cheapest for small order1 Verhoeff digit
cheapest for large order2 MOD 97-10 digits
cheapest for remittance2 MOD 97-10 digits
slip chance of a 10-character code0.00499
Show the full program
# Chapter 7. p71: great contracts on bronze, small ones on red tablets.
# The Rites of Zhou keep weighty agreements on durable ritual vessels and
# lesser ones on painted tablets. Read as an engineering rule: spend
# more redundancy where a wrong record costs more. Illustrative model:
# a code of 10 characters, each mistyped with probability 0.0005; four
# protections, each adding characters that cost 0.02 yuan of typing and
# can themselves be mistyped. Misses per 10,000 slips come from p52
# (Verhoeff, MOD 97-10); for typing the code twice, a slip escapes only
# if the second copy repeats it, put at one slip in ten being a shared
# misreading. Expected cost per 1,000 codes is printed for three tiers.
import math

CHARS, P_CHAR, COST_CHAR = 10, 0.0005, 0.02
OPTIONS = [("no check", 0, 1.0),
           ("1 Verhoeff digit", 1, 107.1 / 10000),
           ("2 MOD 97-10 digits", 2, 6.8 / 10000),
           ("typed twice", CHARS, 0.1 * (1 - (1 - P_CHAR) ** CHARS))]
TIERS = [("small order", 20), ("large order", 600),
         ("remittance", 8000)]
print("cost per 1,000 codes (yuan): typing + expected loss from misses")
print("option               " + "".join("%14s" % t for t, _ in TIERS))
best = {}
for name, extra, miss in OPTIONS:
    n = CHARS + (extra if name != "typed twice" else 0)
    p_slip = 1 - (1 - P_CHAR) ** n
    row = []
    for tier, loss in TIERS:
        cost = math.fsum([1000 * extra * COST_CHAR,
                          1000 * p_slip * miss * loss])
        row.append(cost)
        if tier not in best or cost < best[tier][0]:
            best[tier] = (cost, name)
    print("%-20s " % name + "".join("%14.2f" % c for c in row))
for tier, _ in TIERS:
    print("cheapest for %-12s %s" % (tier + ":", best[tier][1]))
print("slip chance of a %d-character code: %.5f"
      % (CHARS, 1 - (1 - P_CHAR) ** CHARS))

Single source and citation

Fan, Y. (2026). The Algebra of Check Digits and Verhoeff's Dihedral-Group Code: Detection Rates for Single-Digit Slips and Adjacent Transpositions in Order, Remittance and Book Numbers (Version 1.0.0), Chapter 7: Classics East and West: Ritual Bronzes, Red Tablets and Gauss's Congruences. 5D Library. DOI pending

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

BibTeX
@book{fan2026297,
  author    = {Fan, Yafu},
  title     = {The Algebra of Check Digits and Verhoeff's Dihedral-Group Code: Detection Rates for Single-Digit Slips and Adjacent Transpositions in Order, Remittance and Book Numbers},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book