His original paper can be found here:
math.harvard.edu/~ctm/home/text…
medium.com/@laurentmt/int…
github.com/kristovatlas/c…
E = log2(N)
Where:
E = entropy of the transaction
N = number of combinations (mapping of inputs to outputs)
github.com/Samourai-Walle…
gist.github.com/LaurentMT/d361…
It’s open, we can see everything.
I think the term privacy or anonymity should be substituted for uncertainty or computational expense.
But good luck with that.
Clustering
Transaction graph analysis
Merging of inputs
Timing attacks
But entropy is a decent evaluation of the computational expense of evaluating just the transaction itself.