2019-06-08 00:39:02   BTC address:  3GVSoQar7WnVMFjchpkNkh9UwkJbbdeCwM

I think the person who solved #65 is very rich or has no interest in Bitcoin ...

 

Hello friends, it's time to make it public.
I hope these findings will help you find the keys.
The program used is Adobe Illustrator, where the keys are placed together around a spiral axis and separated by a distance.
The coloring is adjusted according to the work of zahid888.
What is strange is that with the font number 10 and the distance between the numbers of 600, we have an order and the colors are automatically placed in their own categories.
The stars selected in black color are the position of key number 66, and the next stars are placed in order up to key 70.
I have many more things and more detailed arrangements, and if I can and my condition allows, I will make them public.
Don't forget me if I helped you reach the key.

1E4Shdpyfqz2vBqsnYw1Z8XT5cu7N5dEaK

My speed is no important, I get 1 Exakeys/s as far i can remember.

Which key? puzzle key? 66?

If the 66 key is spent it may enter in some bot fight each one will increase the fees compared to other until there is nothing left to spent but the final result is unknown

Not always the higher fee wins, chek my previous reply to this:


All depens of what is the transaction that the miner selected to work with his hardware.


If you don't show what command do you used, then there is no way to know what is wrong.

What kind of address are you trying to import? it looks like it is not a legacy one.

That depend of your target, for small ranges sequential is good, but for largest ranges random is the best choice.

The issue may be some configuration of the WSL enviroment sometimes it is capped at a certain percentage of the Host RAM please check:

https://www.aleksandrhovhannisyan.com/blog/limiting-memory-usage-in-wsl-2/

Your problem is the .exe and windows stuff

Don use it on windows, compile it your self in a WSL environment or native linux

The lastest version is Version 0.2.230519 Satoshi Quest it provide an increment of speed X2 compared with previous version

Your problem is the .exe and windows stuff

Don use it on windows, compile it your self in a WSL environment or native linux

The lastest version is Version 0.2.230519 Satoshi Quest it provide an increment of speed X2 compared with previous version

Well in the case of Keyhunt BSGS the speed is made by a combination of CPU Generation, Number of Thread and Memory available

Also some other considerations Like: Is the blooom filter File already available? , with the -S parameter you triger the load or creation of files just to be available the next time of execution

In mi case with bloom filter files available
My laptop: "11th Gen Intel(R) Core(TM) i5-1145G7 @ 2.60GHz" with 8 GB of RAM  and 8 threads the program found the test key in 5 minutes
My PC: 13th Gen Intel Core i7-13700 with 32 GB of RAM and 24 threads the program found the test key in less than 1 minute
and the same PC with the BSGS server the program found the test key in less than 20 seconds (The difference here is that the files are already loaded in memory)
For keyhunt issues/doubts/talk please use the next topic: Keyhunt - development requests - bug reports

We can do some basic arithmetic operations (blindly) with them.

But this is only useful when you know some information about the privatekey like the range ( smallest ranges are easy)

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

I use keyhunt the program that i develop:

https://bitcointalk.org/index.php?topic=5322040.0
https://github.com/albertobsd/keyhunt

But other programs can also be used like Kangaroo

https://github.com/JeanLucPons/Kangaroo

There is no way to know the range of an address.

But since we are talking here of puzzle 66 i did the test in the bit 66 just to check if that address was in that range, and actually the key is of that address is in that range!!

Other address besides of low bit puzzles aren't vulnerable to this.


Exactly all the non-confirmed transacctions are public avaible in the mempool of each node.

Also there is sites to check them https://mempool.space/ also they offer some api to check for some values

https://mempool.space/docs/api/rest#get-address-transactions-mempool

Once that you get the TX id, you need to download the Raw transaction, decode it and extract the publickey and that is easy to do if you know what are you doing.



Well for puzzle  66 is really easy (some minutes/seconds) but since the complexity is exponential it will take a lot of time do that for those bits ranges, months or years depending of hardware.

Here we are talking of low bit puzzles less than 80 bits are solvables by GPU almost in less than 10 minutes (in avarage the time needed to mine a block)

As soon as the person who finds puzzle 66 sends the transaction to the network, pubkey will appear without requiring network approval. Once Pubkey appears it will take 1 second to find the private key. Then, someone else will spend again because the network approval has not yet occurred. The person with the highest network approval will own the bitcoins. Even if you send with a high transaction fee, the person who receives a higher transaction fee and network approval than you will win. For this reason, Low puzzles are problematic.