What does Unbundling, Anti-Arbitrage and Licensing Ladders conclude, in numbers, about “Resale Arbitrage and an Identity Hash Lock”?
Answer: Chapters 3 and 4 model resale arbitrage: with a 50% affiliate commission, resale beats referral when the extra slots satisfy k + 1 > 4.020; with self-referral, arbitrage costs half as much and six extra slots make the firm lose money on every reading it serves; imitation among channel partners spreads resale to 0.877 of them within two years. Under an identity lock, an extra-chart price of at least half the single price keeps resale from beating referral, and full price also protects direct sales; birth data are not an identity, as among 100,000 card holders 14,259.5 pairs of strangers share a date-and-double-hour key.
Scope of the numbers: Marked boxes separate evidence, 16 runnable Python programs, classical sources and 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: 100000, 14259.5
a66c2af375f32dcf a66c2af375f32dcf 63bcf8d2f829f2d7 same person, two spellings, one key: True one minute later, a new key : True key = date + double-hour: 350,640 keys, 14,259.5 shared pairs key = date + minute : 42,076,800 keys, 118.8 shared pairs Reading: normalising before hashing makes one person one key. Birth data alone are not an identity: at 100,000 users a double-hour key is shared by thousands of pairs of strangers, so the lock binds the name and a verified contact as well.
Key formula
Show the full program
# Chapter 3. [p06] An identity lock: one card, one birth-record hash.
# The record is normalised (date as YYYY-MM-DD, time to the minute,
# name case-folded with spaces removed) and hashed with SHA-256 and a
# per-firm salt. Two spellings of one record give one hash. Then the
# birthday problem: how many pairs of DIFFERENT people share a key if
# the key holds only birth data, for 100,000 card holders born over 80
# years, with time known to the double-hour or to the minute.
import hashlib
SALT = "fdl-068"
def norm(name, date, time):
y, m, d = (int(x) for x in date.replace("/", "-").split("-"))
hh, mm = (int(x) for x in time.split(":"))
nm = "".join(name.split()).casefold()
return "{}|{:04d}-{:02d}-{:02d}|{:02d}:{:02d}".format(nm, y, m, d,
hh, mm)
def key(name, date, time):
raw = (SALT + "|" + norm(name, date, time)).encode("ascii")
return hashlib.sha256(raw).hexdigest()[:16]
def pairs(n, m):
return n * (n - 1) / (2 * m)
if __name__ == "__main__":
a = key("Tan Mei Ling", "1990-1-5", "7:05")
b = key("tan meiling", "1990/01/05", "07:05")
c = key("Tan Mei Ling", "1990-01-05", "07:06")
print(" {} {} {}".format(a, b, c))
print(" same person, two spellings, one key: {}".format(a == b))
print(" one minute later, a new key : {}".format(a != c))
n = 100000
days = 80 * 365.25
for label, m in (("date + double-hour", days * 12),
("date + minute", days * 1440)):
print(" key = {:18s}: {:12,.0f} keys, {:9,.1f} shared pairs"
.format(label, m, pairs(n, m)))
print("\nReading: normalising before hashing makes one person one")
print("key. Birth data alone are not an identity: at 100,000 users")
print("a double-hour key is shared by thousands of pairs of strangers,")
print("so the lock binds the name and a verified contact as well.")Single source and citation
Fan, Y. (2026). Unbundling Economics, Anti-Arbitrage Identity Locking and Multi-Tier Licensing Ladders (Version 1.0.0), Chapter 3: Resale Arbitrage and an Identity Hash Lock. 5D Library. https://doi.org/10.5281/zenodo.24090184
DOI: 10.5281/zenodo.24090184 · Read the monograph · 5DL-B-068 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026068,
author = {Fan, Yafu},
title = {Unbundling Economics, Anti-Arbitrage Identity Locking and Multi-Tier Licensing Ladders},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090184},
url = {https://doi.org/10.5281/zenodo.24090184}
}Other chapter answers in this book
- Chapter 1 · When Bundling Pays: from Two Modules to Four
- Chapter 2 · How a Cheap All-Access Pass Cannibalizes, and Heavy Tails
- Chapter 4 · Self-Referral, Channel Blow-Through and Imitating Partners
- Chapter 5 · The Six-Tier Menu: an Exactly Solved Screening Problem
- Chapter 6 · How Robust Is the Menu: Misspecified Demand, Add-on Prices and Whale Risk
- Chapter 7 · The Han Tax on Hoarded Cash, the *Guanzi* and Song Salt Vouchers
- Chapter 8 · A Menu Audit and a Pre-Registered Experiment