Worked example · 2013
Meiklejohn Bitcoin address clustering research — 2013
Summary
Meiklejohn et al. (2013) clustered Bitcoin addresses using two heuristics: (1) the multi-input heuristic — addresses spent together as inputs to one transaction are probably controlled by the same entity, because the sender must hold the keys for every input; (2) a change-address heuristic — the output that returns leftover coins to the sender is identified by conditions such as appearing for the first time on the ledger as the only such output, in a non-coinbase transaction ([acolyermeik], [spiralclustering]). Earlier drafts listed "one-time-change" as a separate third heuristic; the cited sources describe it as part of the change heuristic.
The paper's method of validating the clusters by transacting with services is described in the cited summaries as part of the full IMC version ([acolyermeik]); the specific claim in earlier drafts about the fraction of graph activity captured is not verified here.
Public references
- Meiklejohn, S. et al. "A Fistful of Bitcoins: Characterizing Payments Among Men with No Names." ACM IMC 2013.
- Whether these heuristics remain the core primitives of all major forensic platforms is OAK commentary, not verified in the cited sources.
[acolyermeik]— The Morning Paper, "A fistful of bitcoins: characterizing payments among men with no names" (2017-02-20): https://blog.acolyer.org/2017/02/20/a-fistful-of-bitcoins-characterizing-payments-among-men-with-no-names/[spiralclustering]— Spiral, "The Scroll #3: A Brief History of Wallet Clustering": https://spiralbtc.substack.com/p/the-scroll-3-a-brief-history-of-wallet[cacmfistful]— CACM, "A Fistful of Bitcoins" (video): https://cacm.acm.org/videos/a-fistful-of-bitcoins