Here is some code Mark Lundeberg had previously composed while researching the combinatoric effects of mixing large numbers of inputs and outputs.
It's very counterintuitive (at least it was to me), but a surprisingly large number of combinations arirses that give the same exact sums of inputs when you start increasing the numbers.
For example, here we are using only 3 players with 6 inputs each (and one output each), and using the random seed in Mark's example, we get 125 combinations that work! Now just imagine how crazy it will get with 10 players and 10 inputs etc.
https://gist.github.com/markblundeberg/521f10f4fbbd347636167972e757a10e
I took the liberty of just formatting this iPython Notebook output into a standalone file so you can copy paste it and run it. (I took out the plotting stuff and it also picks a new random seed on every run):
https://gist.github.com/fyookball/0b79a56b484063ac25d1ccaf22894dbb
The code can take anywhere from 1 to 10 minutes to run depending on how fast your system is (VM are slower).
I also have attached a sample output of my run of this in the comments of the gist, which happened to give 67 combinations.
[link] [comments]
source https://www.reddit.com/r/btc/comments/cuo3hi/cash_fusion_mini_simulator/
No comments:
Post a Comment