What does Zero-Touch Sites, Payment Anti-Fraud and Cashflow Queues conclude, in numbers, about “Matched Tallies, Banknote Seals and Liu Yan's Canal”?
Answer: Matching the tallies of flying cash is a check of the whole voucher: 4 marks of 10 forms leave a blind forger one chance in ten thousand. The multiple seals of jiaozi multiply independent checks, and the issue cap and two-year term bound the vouchers outstanding. After Liu Yan cleared the Bian River the food supply of Chang'an became plentiful; Little's law shows that shortening time in transit reduces the goods on the road. Everything quoted in this chapter is the wording of English Wikipedia articles; no classical text is quoted.
Scope of the numbers: Marked boxes separate evidence, 16 runnable Python programs, historical sources and 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: 10
| (1) blind forgery of a tally: b^-k | |
| k b | 4 b=10 b=60 |
| 1 | 2.50e-01 1.00e-01 1.67e-02 |
| 2 | 6.25e-02 1.00e-02 2.78e-04 |
| 3 | 1.56e-02 1.00e-03 4.63e-06 |
| 4 | 3.91e-03 1.00e-04 7.72e-08 |
| 6 | 2.44e-04 1.00e-06 2.14e-11 |
| (2) all n seals pass: q^n | |
| n q | 0.5 q=0.3 q=0.1 |
| 1 | 0.5000 0.3000 0.1000 |
| 2 | 0.2500 0.0900 0.0100 |
| 3 | 0.1250 0.0270 0.0010 |
| 5 | 0.0312 0.0024 0.0000 |
| (3) cap 1,255,340; even exchange over 2 years | 627,670 a year |
| (4) grain in transit for throughput T | 100 units a day |
| transit 60 days | 6,000 units on the road |
| transit 40 days | 4,000 units on the road |
| transit 30 days | 3,000 units on the road |
| Reading: matching four marks of ten forms leaves a blind | |
| forger one chance in ten thousand - the full reference | |
| number of Chapter 1, not its last digits. Several seals | |
| multiply a forger's difficulty as several independent | |
| checks do. A cap and a term bound what is outstanding, as a | |
| limit on provisional orders and a key's lifetime do. |
Show the full program
# Chapter 7. [p14] Tallies, seals, caps and canals, recomputed.
# (1) Flying cash: a merchant's tally half is redeemed only when it
# matches the office's half. If a match checks k independent marks of
# b possible forms each, a blind forger matches with chance b^-k.
# (2) Jiaozi were stamped with several seals. If a forger copies any one
# seal convincingly with chance q, all n seals pass with chance q^n.
# (3) The official issue was capped at 1,255,340 strings of cash and
# notes were exchanged after a two-year term: if exchanges were spread
# evenly, the issue office turned over cap / 2 a year.
# (4) Little's law for a supply line: stock in transit = throughput x
# transit time. Throughput T and the transit times are parameters; a
# shorter passage carries the same flow with less grain on the road.
if __name__ == "__main__":
print(" (1) blind forgery of a tally: b^-k")
print(" k b=4 b=10 b=60")
for k in (1, 2, 3, 4, 6):
print(" {} {:10.2e} {:10.2e} {:10.2e}".format(
k, 4.0 ** -k, 10.0 ** -k, 60.0 ** -k))
print(" (2) all n seals pass: q^n")
print(" n q=0.5 q=0.3 q=0.1")
for n in (1, 2, 3, 5):
print(" {} {:9.4f} {:8.4f} {:8.4f}".format(
n, 0.5 ** n, 0.3 ** n, 0.1 ** n))
cap = 1255340
print(" (3) cap {:,d}; even exchange over 2 years: {:,d} a year"
.format(cap, cap // 2))
print(" (4) grain in transit for throughput T = 100 units a day")
for days in (60, 40, 30):
print(" transit {:2d} days -> {:,d} units on the road".format(
days, 100 * days))
print("\nReading: matching four marks of ten forms leaves a blind")
print("forger one chance in ten thousand - the full reference")
print("number of Chapter 1, not its last digits. Several seals")
print("multiply a forger's difficulty as several independent")
print("checks do. A cap and a term bound what is outstanding, as a")
print("limit on provisional orders and a key's lifetime do.")Single source and citation
Fan, Y. (2026). Zero-Touch Multi-Site Fault Tolerance, Payment Anti-Fraud State Machines and Passive Cashflow Queuing (Version 1.0.0), Chapter 7: Matched Tallies, Banknote Seals and Liu Yan's Canal. 5D Library. https://doi.org/10.5281/zenodo.24090201
DOI: 10.5281/zenodo.24090201 · Read the monograph · 5DL-B-075 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026075,
author = {Fan, Yafu},
title = {Zero-Touch Multi-Site Fault Tolerance, Payment Anti-Fraud State Machines and Passive Cashflow Queuing},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090201},
url = {https://doi.org/10.5281/zenodo.24090201}
}Other chapter answers in this book
- Chapter 1 · Transfer Receipts: Deduplication, Image Hashes and Release-Then-Audit
- Chapter 2 · Self-Referral and "Invite Friends to Unlock"
- Chapter 3 · The Order State Machine: Exhaustive Checking and the Idempotency Window
- Chapter 4 · Thirty Sites on One Kernel: Queues and Tail Latency
- Chapter 5 · Availability: Shared Kernels, Standby Nodes and Blue-Green Draining
- Chapter 6 · Allocating Traffic, Promoting Domains and Holding Cash
- Chapter 8 · A Nine-Flag Audit and a Pre-Registered Experiment