Next scheduled rescrape ... never
Version 1
Last scraped
Scraped on 23/04/2025, 20:24:32 UTC
10 each, 48+ matching prefixes in 66 minutes.

Equivalent to what, 710,795,395,733 K/s, average speed to find 10 in that amount of time?

Just FYI, they were not all in order...


What you're saying is extremely unlikely. How do we know you're telling the truth about your actual speed? Or that you actually know the private key for that 48+bit match hashes? For that, you could at least provide the SHA256(pubkey), just to offer a minimum proof of work. The best thing would be to share the method so it can be tested, repeated, and falsified.

I don’t want to think you’re lying. So either you're really lucky (in which case, please share some lottery numbers Smiley ), or you've found a way to break cryptography and somehow reverse the address generation process, actually proving that cryptographic and hashing functions don’t generate uniformly distributed numbers. That would be huge, in my view.

And, ordered based on what? The value of the private key? The value of Px or Py? Or according to the SHA256 hash value? What order does the RIPEMD160 hash prefer or not prefersprefer? I assume you mean the value of the private key, the one that’s furthest away in terms of mathematical steps.

Honestly, I can’t explain any of this and I find it strange. But I’m definitely open to changing my mind if I were to see a method that actually allows what you’re describing, in a repeatable way.
Original archived Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
Scraped on 23/04/2025, 20:19:23 UTC
10 each, 48+ matching prefixes in 66 minutes.

Equivalent to what, 710,795,395,733 K/s, average speed to find 10 in that amount of time?

Just FYI, they were not all in order...


What you're saying is extremely unlikely. How do we know you're telling the truth about your actual speed? Or that you actually know the private key for that 48+bit match hashes? For that, you could at least provide the SHA256(pubkey), just to offer a minimum proof of work. The best thing would be to share the method so it can be tested, repeated, and falsified.

I don’t want to think you’re lying. So either you're really lucky (in which case, please share some lottery numbers Smiley ), or you've found a way to break cryptography and somehow reverse the address generation process, actually proving that cryptographic and hashing functions don’t generate uniformly distributed numbers. That would be huge, in my view.

And, ordered based on what? The value of the private key? The value of Px or Py? Or according to the SHA256 hash value? What order does the RIPEMD160 hash prefer or not prefers? I assume you mean the value of the private key, the one that’s furthest away in terms of mathematical steps.

Honestly, I can’t explain any of this and I find it strange. But I’m definitely open to changing my mind if I were to see a method that actually allows what you’re describing, in a repeatable way.