5D Library › Unbundling Economics, Anti-Arbitrage Identity Locking and Multi-Tier Licensing Ladders · 中文
Chapter 3. Resale Arbitrage and an Identity Hash Lock
Why extra slots become a business
A personal annual card that carries a few extra readings “for family and friends” looks like a harmless perk. To a fortune-teller with clients of her own, each extra slot is a single reading she can resell: she buys a card, sells the slots to her clients a little below the official single price and keeps the difference. This is resale arbitrage in the textbook sense: whenever the same good has different prices for different buyers and can change hands, middlemen eat the spread (Shapiro and Varian 1998).
The firm also has a legitimate channel, its affiliate programme: a partner who refers a client to buy the single deep report at full price earns a commission of . So the same fortune-teller has two options: refer, and earn per client; or resell, and earn per client, where is the card price, the number of extra slots and her resale price.
When arbitrage beats referral
The program takes and a card price and compares the two routes for a card with extra slots and no identity lock.
Calculation
# Chapter 3. [p05] Card resale arbitrage against a 50% affiliate channel.
# Single deep report p2 = 99 (USD). Personal annual card P = 199 that
# covers its holder plus k extra readings, with no identity lock, so a
# reseller (a fortune-teller with clients) can use all k + 1 slots.
# She can (i) refer each client as an affiliate and earn g * p2,
# g = 0.5, or (ii) buy cards and resell slots at s, either s = p2 or
# s = 0.8 * p2 (undercutting). Per client served, the firm receives
# p2 (direct), (1 - g) * p2 (affiliate) or P / (k + 1) (resold slot).
P2, CARD, G = 99.0, 199.0, 0.5
def margin(k, s):
return s - CARD / (k + 1)
if __name__ == "__main__":
aff = G * P2
print(" affiliate margin per client g * p2 = {:.2f}".format(aff))
print(" k cost/slot margin s=p2 margin s=0.8p2 firm gets"
" vs affiliate")
for k in range(0, 9):
cost = CARD / (k + 1)
print(" {:2d} {:10.2f} {:12.2f} {:15.2f} {:10.2f} {:13.2f}".format(
k, cost, margin(k, P2), margin(k, 0.8 * P2), cost,
cost - (1 - G) * P2))
for s, name in ((P2, "s = p2"), (0.8 * P2, "s = 0.8 p2")):
k = next(k for k in range(0, 99) if margin(k, s) > aff)
print(" resale beats referral ({}) from k = {}".format(name, k))
print(" threshold k + 1 > P / ((1 - g) p2) = {:.3f}".format(
CARD / ((1 - G) * P2)))
print("\n identity lock: the card serves its holder only; each extra")
print(" chart costs q. Reseller margin p2 - q against g * p2:")
for q in (29.0, 49.5, 69.0, 99.0):
m = P2 - q
print(" q = {:4.1f}: margin {:5.1f} IC: {:3s}"
" loss on a poached direct sale: {:4.1f}".format(
q, m, "yes" if m <= aff + 1e-9 else "no", P2 - q))
print("\nReading: at s = p2 the reseller gains exactly when the firm")
print("loses against its own affiliate channel. With a lock, any")
print("q of at least (1 - g) p2 stops resale against referral; only")
print("q = p2 also leaves a poached direct sale whole.")
# affiliate margin per client g * p2 = 49.50
# k cost/slot margin s=p2 margin s=0.8p2 firm gets vs affiliate
# 0 199.00 -100.00 -119.80 199.00 149.50
# 1 99.50 -0.50 -20.30 99.50 50.00
# 2 66.33 32.67 12.87 66.33 16.83
# 3 49.75 49.25 29.45 49.75 0.25
# 4 39.80 59.20 39.40 39.80 -9.70
# 5 33.17 65.83 46.03 33.17 -16.33
# 6 28.43 70.57 50.77 28.43 -21.07
# 7 24.88 74.12 54.33 24.88 -24.62
# 8 22.11 76.89 57.09 22.11 -27.39
# resale beats referral (s = p2) from k = 4
# resale beats referral (s = 0.8 p2) from k = 6
# threshold k + 1 > P / ((1 - g) p2) = 4.020
#
# identity lock: the card serves its holder only; each extra
# chart costs q. Reseller margin p2 - q against g * p2:
# q = 29.0: margin 70.0 IC: no loss on a poached direct sale: 70.0
# q = 49.5: margin 49.5 IC: yes loss on a poached direct sale: 49.5
# q = 69.0: margin 30.0 IC: yes loss on a poached direct sale: 30.0
# q = 99.0: margin 0.0 IC: yes loss on a poached direct sale: 0.0
#
# Reading: at s = p2 the reseller gains exactly when the firm
# loses against its own affiliate channel. With a lock, any
# q of at least (1 - g) p2 stops resale against referral; only
# q = p2 also leaves a poached direct sale whole.When the resale price equals the official single price (), resale beats referral when , that is , here 4.020: from 4 extra slots on, resale pays better than referral. The same threshold is exactly where the firm starts to lose against its own affiliate channel: at the firm gets 49.75 per slot, only 0.25 more than the 49.50 it keeps from a referral; at it gets 39.80, 9.70 less. At , what the fortune-teller gains is exactly what the firm loses relative to its affiliate channel. If she undercuts at 80% of the price to win clients, the threshold moves to .
Calculation
With an identity lock. The card serves its holder only () and each extra chart costs . A fortune-teller who buys extra charts for clients and resells them earns per client; referral earns . Resale does not pay when At , any extra-chart price of at least half the single price (49.5) stops resale from beating referral. But if the resold client would otherwise have bought directly at full price, the firm loses on each; only makes that loss zero.
So the outline’s claim that “one card locked to one identity, with extra charts at the full single price, is the only incentive-compatible equilibrium” needs correcting. Relative to the affiliate channel, incentive-compatible extra-chart prices form an interval, ; full price is special because it also protects the firm’s direct sales: if the reseller takes clients who would have ordered directly, any below full price costs the firm money.
The identity lock: one chart, one hash
The technical core of the lock is to normalise the birth record and hash it: the date written as year-month-day, the time to the minute, the name with spaces removed and case folded, plus the firm’s own salt, digested with SHA-256 (National Institute of Standards and Technology 2015). Two spellings of one person give one key; one minute later is another key.
Calculation
# 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.")
# 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.But a birth record is not an identity. Take 100,000 card holders born within 80 years. If the key holds only the date and the double-hour, there are 350,640 distinct keys, and by the birthday-problem formula 14,259.5 pairs of strangers are expected to share one; to the minute there are still 118.8 pairs. Twins aside. So the lock cannot bind the birth record alone: it must also bind the name and a verified contact, and “a second birth hash on the same card” should trigger a manual check, not an automatic ban.
Hypothesis · not established
The author’s interpretation (not yet tested): in the author’s products, “a personal annual card bound to its holder only, extra charts at full price, and affiliate commission paid only on purchases by someone other than the partner” can push resale arbitrage down to a negligible level without harming ordinary users. What would show this wrong: if, once the lock is in place, the share of ordinary users who give up the purchase because of the identity check costs more than the resale losses the lock prevents (the experiment in Chapter 8 can measure both), the design does not pay.
Summary
Extra slots turn into arbitrage when exceeds , from 4 slots with this book’s parameters; at the fortune-teller’s arbitrage gain is exactly the firm’s loss relative to its affiliate channel. Under an identity lock, an extra-chart price of at least half the single price is enough to keep resale from beating referral, and full price also protects direct sales. The birth hash must be locked together with the name and a contact.
References
Fan, Y. (2026). Unbundling Economics, Anti-Arbitrage Identity Locking and Multi-Tier Licensing Ladders: Orthogonal Demand Partitioning, Resale Cannibalization Bounds, Affiliate Margin Preservation and Five-Figure B2B Upsell Equilibria [分拆经济学、防套利身份锁定与多阶授权阶梯] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090184 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).