Fault-Tolerant Parsing of Payment Receipts and Spoken Orders: Last-Five-Digit Write-Off Automata and Blocking Duplicate-Screenshot Fraud: chapter answers
Buying agents and small shops selling through private messages often reconcile payments the same way: the buyer sends a screenshot of a transfer, the owner finds a credit of the same amount on the statement and marks the order paid. This book tests two defaults behind that routine, that "prices all differ, so same-amount collisions are unlikely" and that "if the screenshot matches, the money has arrived", and quantifies the specification's three claims one by one: matching on amount alone must collide; with the last five digits and a time window collisions can become negligible; repeated scre…
DOI pending · monograph page goes live after publication · 5DL-B-267 · 中文版
- Chapter 1 · Matching on Amount Alone Must Collide: the Birthday Problem of Same-Day, Same-Amount Payments
Chapter 1 quantifies collisions through the birthday problem: from 10 to 100 orders the expected number of colliding pairs grows 110.0 times while the collision probability grows only 41.3 times; an illustrative catalog… - Chapter 2 · The Last Five Digits and a Time Window: How Far Collisions Fall, and What Will Not Fall
Chapter 2 shows that at a thousand orders a day, amount plus last five digits plus a thirty-minute window collides once in 93.9 days on average, and at five thousand once in 3.8 days; repeat orders by the same buyer sti… - Chapter 3 · A Finite Automaton for Spoken and Written Chinese Amounts, Simplified and Traditional
Spoken amounts do not need an ever-growing pile of rules. A finite-state transducer with 15 states, 9 token classes and 45 transitions covers simplified and traditional script, banker's capitals, spoken cut-offs and mix… - Chapter 4 · The Write-Off Automaton: a Screenshot Is a Claim, a Credit Is a Fact
Chapter 4 proves by exhaustive search that a screenshot is a claim and a credit the fact; with amount alone about 0.17823 of credits are misassigned. - Chapter 5 · Average Hash and Hamming Distance: Detecting Repeated Screenshots, and Where Detection Is Blind
Chapter 5 shows that a whole-image average hash at threshold 4 flags 0.9135 of same-layout genuine receipts as resends, while a hash of the fields alone recognises 0.8333 of resends at threshold 10 with no false positiv… - Chapter 6 · The Receipt Fingerprint Library: the Birthday Problem Among Hashes, and Pigeonhole Search
The hash library has its own birthday problem: chance neighbours of a single query grow in step with the library, and chance pairs within the library grow with its square. For an ideal 64-bit hash at threshold 10, a lib… - Chapter 7 · Classics East and West: Half-Seal Tallies in the Collected Statutes of the Ming and Galton's Finger Prints
The amount under the illustrative catalogue carries only 4.27 bits, with a birthday bound of 5.2 orders, as in Chapter 1. The last four digits carry 13.29 bits with a bound of 117.7; the last five, 16.61 bits with a bou… - Chapter 8 · The Buying Agent's Reconciliation Loop and a Protocol for Refutation
Chapter 8 gives the reconciliation loop, the distilled tool, the Payment Receipt Reconciler, and a pre-registered protocol. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical…
Illustrative model calculation, not a live quote