What does Disaster Recovery and Threshold Shares conclude, in numbers, about “Classics East and West: the Tiger Tally of Shiji 77 and the Split Tally of the Exchequer”?
Answer: The tiger tally is a two-of-two scheme in which the verifier holds the other half, so stealing the ruler's half is enough to forge an order. Jin Bi's doubt was anomaly detection, Zhu Hai's mallet was coercion of the verifier, and the step Hou Ying feared, asking the king again, was out-of-band confirmation. In the illustrative model a forged order succeeds with probability 0.0500 on the tally alone and 0.0025 with a call back to the capital. The split tally encoded amounts in notches, authenticated by grain and achieved off-site keeping by giving each party a half. A forged half matches all of 20 features with probability only 0.0000009537, keeping both halves in one building makes their loss five times as likely as keeping them apart, and the fire of 1834 shows that destroying everything in one place is just as dangerous. The final chapter gathers the book's models into a procedure that can be drilled, a small tool and a pre-registered test plan.
Scope of the numbers: Chapter 6 computes self-rescue after one share goes missing: losing the fastest holder is like raising the threshold by one, and the illustrative rescue window is 263 hours. 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. printed values that match the answer: 0.0025, 0.0500, 20
| picked troops that marched on the matched tally: 80000 | |||
| design | forged obeyed | genuine stalled | delay |
| tally only | 0.0500 | 0.0000 | 0 d |
| tally + general's doubt | 0.0150 | 0.1000 | 0 d |
| doubt, then a strongman | 0.0325 | 0.0500 | 0 d |
| tally + call back to king | 0.0025 | 0.0000 | 4 d |
| call back + guard on it | 0.0008 | 0.0000 | 4 d |
| call back cuts forged-order success by a factor of 20 | |||
| doubt alone, once force is allowed, keeps 65% of the risk |
Show the full program
# Chapter 7. p71: the tiger tally as a 2-of-2 scheme, with and without a
# second check. Shiji 77: the king keeps one half, general Jin Bi the
# other; the matched halves gave the prince Jin Bi's army, from which
# 80,000 picked troops marched. Per forged-order attempt
# (illustrative, not historical rates): s = thief obtains the king's
# half; d = general's doubt catches an odd order ("one carriage comes to
# replace me"); g = doubt also stalls a genuine odd order; c = a call
# back to the capital is intercepted; f = a strongman overcomes refusal.
# Outputs: forged order obeyed, genuine order stalled, days of delay.
S, D, G, C, F, TROOPS = 0.05, 0.70, 0.10, 0.05, 0.50, 80000
CALLBACK_DAYS = 4
designs = [
("tally only", S, 0.0, 0),
("tally + general's doubt", S * (1 - D), G, 0),
("doubt, then a strongman", S * (1 - D) + S * D * F, G * (1 - F), 0),
("tally + call back to king", S * C, 0.0, CALLBACK_DAYS),
("call back + guard on it", S * C * (1 - D), 0.0, CALLBACK_DAYS),
]
print("picked troops that marched on the matched tally: %d" % TROOPS)
print("design forged obeyed genuine stalled delay")
for name, fa, fr, days in designs:
print("%-26s %13.4f %15.4f %3d d" % (name, fa, fr, days))
base = designs[0][1]
print("call back cuts forged-order success by a factor of %.0f"
% (base / designs[3][1]))
print("doubt alone, once force is allowed, keeps %.0f%% of the risk"
% (100 * designs[2][1] / base))Single source and citation
Fan, Y. (2026). Disaster Recovery for Digital Assets: Shamir Secret-Sharing Thresholds, Off-Site Incremental Snapshots and Self-Rescue from Single Points of Loss (Version 1.0.0), Chapter 7: Classics East and West: the Tiger Tally of Shiji 77 and the Split Tally of the Exchequer. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-272 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026272,
author = {Fan, Yafu},
title = {Disaster Recovery for Digital Assets: Shamir Secret-Sharing Thresholds, Off-Site Incremental Snapshots and Self-Rescue from Single Points of Loss},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Illusion of Three Copies: a Binomial Ledger of Loss and Leak
- Chapter 2 · Lagrange Interpolation over a Finite Field: Making, Rebuilding and Checking Shares
- Chapter 3 · Loss and Collusion: Unequal Holders, Shared Buildings and Acquaintance Graphs
- Chapter 4 · Off-Site Incremental Snapshots: Recovery Point, Recovery Time and Mean Time to Data Loss
- Chapter 5 · Leaks Accumulate: Proactive Share Refresh
- Chapter 6 · Self-Rescue after a Single Point of Loss: Time to Quorum and the Exposed Window
- Chapter 8 · Closing the Loop: Threshold Drills, the Risk Calculator and a Pre-Registered Test