1 exakey per second means 1 and 18 zeros, a 4 GHz CPU could "count" up to a 11 digits number with no EC math involved, just pure counting per second. I would like to know how you can generate 4 exakey/s using keyhunt?

Yeah exakeys is nothing compared with the keyspace that is begin scannig.

I really like the binary tree analogy as example it is good.

With BSGS the important number is the precalculated data in the bloom filter if we have 4 billion keys in a bloom filter we easily can know if the key is not in our bloom filter doing less than 20 hashes. so that means we  discard a subrange of 4 billion keys with only 20 CPU Operations.

https://andrea.corbellini.name/2015/06/08/elliptic-curve-cryptography-breaking-security-and-a-comparison-with-rsa/

I was trying to figure out a way to see if PubHunt even works. It is not easy to test on lower complexity keys. Would also be nice to see current key being worked on. So far I have.

https://github.com/Chail35/PubHuntRange

PubHunt.cpp
Line 330

         printf("\r[%s] [GPU: %.2f MK/s] [T: %s (%d bit)] [F: %d] %02hhx %016llx %llu  ",

%016llx should be the starting key. However it looks like this. and only upldates every few trillion keys.

[00:00:06] [GPU: 4316.00 MK/s] [T: 25,904,021,504 (35 bit)] [F: 0] a4 00007fffb46dd420 17179869184

Many thanks to Chail35 for recently updating this fork!

I think it was a attempt, work in progress. Does not function correctly. That got me started on attempting to display the current key it was working on as it was running. As well as attempting to modifiy it to start with the fisrt 20 or so known keys for tests. I know of no current Pubkey search program for the puzzles with GPU. The upside of GPU searching for just the pubkey is the speed for video cards seems to be x2 the speed with more then 20 hash160 addresses. More fun right now then anything, always trying to learn. Based on the random output. This program in this way will never find any key. As 0000 is always front running. Maybe limited by uint64_t?

Again target is to break pubkey hash, not privkey

Breaking the address (pubkey hash) automatically implies searching through the entire field range (~ 2^96 pub keys per address, in the 2^256 field)
Breaking the key searches through the key range.

TL;DR it makes no sense to try to first break the pub key in hope of using that later to find the private key. And it also doesn't make sense to break the pub key if you constrain the search to the private keys range, because this is equivalent to basically finding the solution, not breaking anything, but solving the puzzle.

Guyz im working on these puzzle since 2y ago i never shared anything but i have to say please rush to find answers people im coming to solve all of them soon

The creator lied 🤥 there is a pattern which is made by superrr smart way i just found it by a silly mistake i shocked asffffff just need time and some more mathematics to solve more but soon all gonna be solve ))

Just for making history im gonna put my address here and share this post

Thanks all 🧩

Good luck.

I will transfer funds to here : bc1q4kp7qr5ylr2vnylvqqs57mz4e4hpq28kkgh40y

If you really solved this, then congratulations. However, I'd be careful about making such claims. I've been at this on and off since 2019, and on several occasions I've thought I'd found mathematical patterns, and on a few of those occasions I've even been convinced, but none of them held up. I've also delved into visual patterns, on both the already claimed keys, and on the addresses.

Sadly I don't have the hardware to brute force, so pattern finding is essentially my only option. Nevertheless, I have my computer trying one of the so far unclaimed keys. Based on the number of keys it tries every minute, I will, statistically, be at it for about a billion years.

Hi. Are you sure you've found the key to the still unresolved address?

Not that I have ever claimed to have solved this, and in spite of being a newbie I'm just as amused as you are by those who do claim to have done it.
And yes, I do work on pattern finding (mathematical as well as visual) and statistical approaches, and have done since I first discovered this challenge in 2019. With the hardware and the budget available to me, brute forcing would be ridiculous. A billion years or more to find a single key. Sure I could stumble on it tomorrow. But I could do that with pattern finding and statistics as well, and even if I do not, I find trying to think of new ways to discover patterns or statistical relations intellectually stimulating, and even if I don't get a single sat out of this, I may have gained some insights into things I might use elsewhere.
That said, given that I'm a newbie on this forum, and that before this one I've only posted one message, who will you send to fuck me? Please say she's a gorgeous brunette.

if you have 56core/256GB server, you'll check about 12 exakeys per sec

2^129 11344588059320129643 3600*24 = ?

after 1_902_338_144_733  years AT MOST you'll become rich, but with this probability 1/680564733841876926926749214863536422912 you'll find PK in first second. Feel lucky? (haha)

p.s. if you pay $200 per month for server, you'll pay 1902338144733*200*12 = ?

4_565_611_547_359_200 dollars

so, it's only reasonable if you do not pay for server