As I mentioned before, I also use random numbers, just like others do. However, what you are doing in your 'random.cpp' involves seeding, twisting, doubling, and including 'rand.h,' which has already been created by someone else.
It uses many old and common methods for generating random numbers, which have been tried by many over the years. Unfortunately, there haven't been any positive results, and the only method that seems to work is brute force. Yet, you continue to use these methods instead of exploring something new. Just as some people are asking why I keep doing the same job repeatedly, I can also ask why you keep using the same old random methods repeatedly.
If someone attempts to innovate, you suggest they go to art school, taunting them in the process. I'm not here to teach anyone; I'm simply sharing my experiences with these so-called 'random' methods and my own random formula.
for your information.
When I was working on puzzle 64, I've come close to solving it using what you call 'cheap art' as random numbers. Right now, my 'cheap art' has brought me closer to possible keys for puzzle 66. And how am I able to differentiate between the two random methods? Because I have saved the analysis of the initial 8 hex (4 bytes) generated through both functions in my local database, and I have managed to obtain matches through my random method several times (3 or 4 bytes), whereas with the old random method, I have hardly obtained a match of (2 bytes). If puzzle 62 hasn't been solved yet, I've managed to solve it twice with my 'cheap art' through 14 zeros and 16 ones. My script skipped it 2 times because the range was already in the database, and I saved the skipped range also to study how randomness works. I'm not blindly running code like the so-called 'copy-paste' programmers.
Once I've achieved the 14:16 pattern and saved and merged my database, then I'll invert it and try more combinations. I also have ten more unique methods that I haven't shared yet. These methods are far better than the older random techniques that couldn't produce even three matching bytes of the private key hex in months, or even years.
As I mentioned earlier, I'm not here to teach anyone, just to share my experience whether it's the worst or good. These are common factors that cross everyone's minds to compare their results with something that exists, whether it's Ripemd160 or Base58. That's why I always share information related to these topics. That doesn't mean my calculation is totally dependent on these things. You may call it spam or anything else you like. The only difference is that I am using a different method to generate random numbers, which I prefer over the old methods, so please stop repeatedly giving me advice on this topic. I am well aware of non-linear or linear functions; please don't attempt to act overly intelligent. And I don't need advice from 'copy-paste' and renaming enthusiasts.
I have several people on ignore.
this is a good idea if my posts are irritating someone.
this master of mathematics has no clues what you are talking about.
This is the reason why I write long posts, so that they can penetrate people's minds without explaining much. But it's the sheer bad luck of some people that even after that, they can't understand properly. And people scold me, asking why I write such long posts... lol
. Here, I'm just reducing the possibilities from nearly 100% to 27%, you can try it yourself.
import math
def binomial_coefficient(n, k):
return math.factorial(n) // (math.factorial(k) * math.factorial(n - k))
start = int('20000000', 16)
end = int('40000000', 16)
zeros = int(input("Enter the number of zeros (0-30): "))
if 0 <= zeros <= 30:
total_possibilities = end - start + 1
possibilities_with_zeros = binomial_coefficient(30, zeros)
percentage_with_zeros = (possibilities_with_zeros / total_possibilities) * 100
percentage_diff = 100 - percentage_with_zeros
print(f"Total possibilities within the specified 30-bit range: {total_possibilities} (100%)")
print(f"When applying {zeros} zeros within the range: {possibilities_with_zeros} ({percentage_with_zeros:.2f}%)")
print(f"Difference between total possibilities and applying condition: {total_possibilities - possibilities_with_zeros} ({percentage_diff:.2f}%)")
else:
print("Invalid input. Please enter a number between 0 and 30.")
Seriously, how much am I talking, that's why I try to explain it in the language of coding. My fingers are tired
. Smarter people can kindly put me in their ignore list or create a new thread (I think there are already 2 more threads). You can go there, I won't be coming there. I'll just continue my nonsense here. Thank you very much, everyone👍
. I have not studied probability theory. Previously, the program included the Mersenne Twister algorithm. The Mersenne Twister is a general-purpose pseudorandom number generator (PRNG) developed in 1997 by Makoto Matsumoto.