I tried optimizing it so that even if you have a colossal seed (say, 99999999999999999999), it still gets it done quick. Whenever you put in the same initial conditions, you always get the same result. There is no "pick random" operator in this whole project. You might not think this is useful, but it could be used for encryption, as reversing the algorithm is near impossible. Eg. what number with limits 0-1 gives 0.7358913982121759? Yeah, you don't know, and you couldn't figure it out even looking at the code (the number that gives it by the way is 2167776). On average, you would have to check a quintillion numbers to crack the code, wich will take about 10 million years on scratch. For you nerds, this is actually more of a hash function than an encryption algorithm.
