== Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==

[digaran]

If you guys are going for 125, then the rest of us should skip 125 and start working on 130. [insert skeleton meme behind a computer desk here], we could solve 130 when we are looking the same as our text meme. Lol

[racminer]

Hello,

Due to the situation that happened in this challenge - I allowed myself to refresh the topic - I corrected the name of the thread, added a new date to "important dates", changed the image of the remaining amount of BTC up for grabs, and restored the functioning of my website zielar.pl from which you can now restart download the VanitySearch builds, because I saw somewhere earlier that someone mentioned that the links are out of date. It's a fact - they were outdated because I didn't extend the hosting :-) Nevertheless, everything is fine now. I'm also considering re-entering with some power... therefore, to shorten the necessary time to refresh the news about currently running programs - give me the details of any latest and greatest versions you are currently using (VanitySearch, Kangaroo) - and whether poolem 66bit also works pool fighting for 125?

Regards

Thank you for restoring zielar.pl site. I finally got to try  your latest vanitysearch version on my GeForce GTX 1080 Ti and I got only 400 Mkeys/s instead of 900 Mkeys/s. Am I missing something?

[zielar]

I'm currently checking apps that I haven't checked before... and that's how I found PubHunt. I entered the 29 closest unresolved addresses without pubkey in the input... This way I achieve a scan of 6400Gkeys/s . What are the estimates that a pubkeys lookup for 29 addresses with this method and this program at this speed will yield the intended expectations more than a traditional key lookup? What are the real chances of success and effectiveness of this method?

Hello,

Due to the situation that happened in this challenge - I allowed myself to refresh the topic - I corrected the name of the thread, added a new date to "important dates", changed the image of the remaining amount of BTC up for grabs, and restored the functioning of my website zielar.pl from which you can now restart download the VanitySearch builds, because I saw somewhere earlier that someone mentioned that the links are out of date. It's a fact - they were outdated because I didn't extend the hosting :-) Nevertheless, everything is fine now. I'm also considering re-entering with some power... therefore, to shorten the necessary time to refresh the news about currently running programs - give me the details of any latest and greatest versions you are currently using (VanitySearch, Kangaroo) - and whether poolem 66bit also works pool fighting for 125?

Regards

My man! Thanks for updating and refreshing the topics and links!

I am running a kangaroo pool/server and have posted to see the interest in the community (before posting and giving out IP and port) but there have only been two people interested.

I have locked up agreements from gpu farms. I will have (so far) 480 cards connecting to the pool BUT for only 20-25 minutes each day. In the agreement I have to pay for storage space so that I can save and keep each card's kangaroos (paths). I am currently trying to work out additional agreements. I also have 72 cards that are constantly running in the pool. All are RTX 30xx and above; 30xx. I would love to have many CPUs running in the race as well as their paths (although less paths) become much longer than a GPUs path.

Current progress = 2^19.06/2^27.05

Could i join to your work? Please send me PM to more details. I can use 8x Tesla A100 to work for this task per 1-2 months

[BS0D]

Hello,

Due to the situation that happened in this challenge - I allowed myself to refresh the topic - I corrected the name of the thread, added a new date to "important dates", changed the image of the remaining amount of BTC up for grabs, and restored the functioning of my website zielar.pl from which you can now restart download the VanitySearch builds, because I saw somewhere earlier that someone mentioned that the links are out of date. It's a fact - they were outdated because I didn't extend the hosting :-) Nevertheless, everything is fine now. I'm also considering re-entering with some power... therefore, to shorten the necessary time to refresh the news about currently running programs - give me the details of any latest and greatest versions you are currently using (VanitySearch, Kangaroo) - and whether poolem 66bit also works pool fighting for 125?

Regards

My man! Thanks for updating and refreshing the topics and links!

I am running a kangaroo pool/server and have posted to see the interest in the community (before posting and giving out IP and port) but there have only been two people interested.

I have locked up agreements from gpu farms. I will have (so far) 480 cards connecting to the pool BUT for only 20-25 minutes each day. In the agreement I have to pay for storage space so that I can save and keep each card's kangaroos (paths). I am currently trying to work out additional agreements. I also have 72 cards that are constantly running in the pool. All are RTX 30xx and above; 30xx. I would love to have many CPUs running in the race as well as their paths (although less paths) become much longer than a GPUs path.

Current progress = 2^19.06/2^27.05

Could i join to your work? Please send me PM to more details. I can use 8x Tesla A100 to work for this task per 1-2 months

What is A100 performance on kangaroo and BSGS?

[zielar]

What is A100 performance on kangaroo and BSGS?

1xA100 = ~3800MK/s

[Lolo54]

I'm currently checking apps that I haven't checked before... and that's how I found PubHunt. I entered the 29 closest unresolved addresses without pubkey in the input... This way I achieve a scan of 6400Gkeys/s . What are the estimates that a pubkeys lookup for 29 addresses with this method and this program at this speed will yield the intended expectations more than a traditional key lookup? What are the real chances of success and effectiveness of this method?

Hi Zielar
Waouhh impressive this speed! If you could choose the beginning and end of the search range, you could find pubkey #66 between 2 and 4 months. On the other hand the search is carried out randomly it makes random hashes on the PK of #64 #66 #67 #68 #69 #71 and #72 it can be faster as well as much longer depending on luck. Too bad this program could be largely optimized like choosing the hash range #66 as well as the random or sequential mode with your speed you could come across #66 in 1 month or 2 depending on luck.

Edit
Looking more closely at the operation of this utility and your speed, the proba are these
in 10 days on all the beaches by inserting the 6 pubkeys (I calculated for the first 6 # not 29)  you have a one in 148 chance of having one of the keys
in 20 days 1/74  1.35%
in 40 days 1/37  2.75%
in 80 days 1/18  5.5%
in 160 days 1/9  11%
in 320 days 1/4  25%
it remains arbitrary because luck can enormously speed up the process

[kknd]

1 Ekeys/s (1021708069969158067 keys/s)

1.021.708.069.969.158.067 keys/s

128gb + 16 AMD Ryzen 7 5800X

Code:

ubuntu@:~/kknd/keyhunt$ ./keyhunt -m bsgs -f 125.pub -b 125 -R -q -S -n 0x400000000000 -k 4096 -t 15
[+] Version 0.2.230428 Satoshi Quest, developed by AlbertoBSD
[+] Random mode
[+] Quiet thread output
[+] K factor 4096
[+] Threads : 15
[+] Mode BSGS random
[+] Opening file 125.pub
[+] Added 1 points from file
[+] Bit Range 125
[+] -- from : 0x10000000000000000000000000000000 [+] -- to   : 0x20000000000000000000000000000000
[+] N = 0x400000000000
[+] Bloom filter for 34359738368 elements : 117781.20 MB
[+] Bloom filter for 1073741824 elements : 3680.66 MB
[+] Bloom filter for 33554432 elements : 115.02 MB
[+] Allocating 512.00 MB for 33554432 bP Points
[+] Reading bloom filter from file keyhunt_bsgs_4_34359738368.blm .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_6_1073741824.blm .... Done!
[+] Reading bP Table from file keyhunt_bsgs_2_33554432.tbl .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_7_33554432.blm .... Done!
[+] Total 82543794972808280276992 keys in 80790 seconds: ~1 Ekeys/s (1021708069969158067 keys/s)

Code:

Architecture:            x86_64
  CPU op-mode(s):        32-bit, 64-bit
  Address sizes:         48 bits physical, 48 bits virtual
  Byte Order:            Little Endian
CPU(s):                  16
  On-line CPU(s) list:   0-15
Vendor ID:               AuthenticAMD
  Model name:            AMD Ryzen 7 5800X 8-Core Processor
    CPU family:          25
    Model:               33
    Thread(s) per core:  2
    Core(s) per socket:  8
    Socket(s):           1
    Stepping:            2
    Frequency boost:     enabled
    CPU max MHz:         3800.0000
    CPU min MHz:         2200.0000
    BogoMIPS:            7586.05

[Gianluca95]

1 Ekeys/s (1021708069969158067 keys/s)

1.021.708.069.969.158.067 keys/s

128gb + 16 AMD Ryzen 7 5800X

Code:

ubuntu@:~/kknd/keyhunt$ ./keyhunt -m bsgs -f 125.pub -b 125 -R -q -S -n 0x400000000000 -k 4096 -t 15
[+] Version 0.2.230428 Satoshi Quest, developed by AlbertoBSD
[+] Random mode
[+] Quiet thread output
[+] K factor 4096
[+] Threads : 15
[+] Mode BSGS random
[+] Opening file 125.pub
[+] Added 1 points from file
[+] Bit Range 125
[+] -- from : 0x10000000000000000000000000000000 [+] -- to   : 0x20000000000000000000000000000000
[+] N = 0x400000000000
[+] Bloom filter for 34359738368 elements : 117781.20 MB
[+] Bloom filter for 1073741824 elements : 3680.66 MB
[+] Bloom filter for 33554432 elements : 115.02 MB
[+] Allocating 512.00 MB for 33554432 bP Points
[+] Reading bloom filter from file keyhunt_bsgs_4_34359738368.blm .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_6_1073741824.blm .... Done!
[+] Reading bP Table from file keyhunt_bsgs_2_33554432.tbl .... Done!
[+] Reading bloom filter from file keyhunt_bsgs_7_33554432.blm .... Done!
[+] Total 82543794972808280276992 keys in 80790 seconds: ~1 Ekeys/s (1021708069969158067 keys/s)

Code:

Architecture:            x86_64
  CPU op-mode(s):        32-bit, 64-bit
  Address sizes:         48 bits physical, 48 bits virtual
  Byte Order:            Little Endian
CPU(s):                  16
  On-line CPU(s) list:   0-15
Vendor ID:               AuthenticAMD
  Model name:            AMD Ryzen 7 5800X 8-Core Processor
    CPU family:          25
    Model:               33
    Thread(s) per core:  2
    Core(s) per socket:  8
    Socket(s):           1
    Stepping:            2
    Frequency boost:     enabled
    CPU max MHz:         3800.0000
    CPU min MHz:         2200.0000
    BogoMIPS:            7586.05

I would like to understand how it is possible to get that quantity of keys. It is something of really amazing 

As I read, this software scan 1exakey/s with your hw?

[noecp]

I would like to understand how it is possible to get that quantity of keys. It is something of really amazing  
As I read, this software scan 1exakey/s with your hw?

this is not 1 ExaKey/s  this like 1 Exa Compares per seconds

in this screen's 28807259 Keys per seconds compared on 35 467 034 624 elements in bloom filters and have 1021708069969158067  compares/s
really key generate speed is 28.8 MKeys/sec

[albert0bsd]

Compares per seconds

Interesting concept, i really like it

Thanks

[digaran]

Since you are wanderer your self, you could understand others when they wonder, so I was wondering what happened to your newly improved version of kangaroo/bsgs tool? A good dev always shares the best of his work with the world😉, we'll keep on waiting!

[racminer]

Since you are wanderer your self, you could understand others when they wonder, so I was wondering what happened to your newly improved version of kangaroo/bsgs tool? A good dev always shares the best of his work with the world😉, we'll keep on waiting!

Good point.

[WanderingPhilospher]

Since you are wanderer your self, you could understand others when they wonder, so I was wondering what happened to your newly improved version of kangaroo/bsgs tool? A good dev always shares the best of his work with the world😉, we'll keep on waiting!

I thought I had said what had happened was…I could not figure out the stride function for GPU. Then there was an injection of BTC for the challenge so I took a pause to go through files and search for the Red October. I mimicked it with bitcrack but you lose to much speed to be effective.

[NotATether]

this is not 1 ExaKey/s  this like 1 Exa Compares per seconds

Compare benchmarks and stats are no big deal to be honest, because pretty much all hardware have dedicated paths in the transistors for performing numeric comparisons, so of course it will be much faster if you just measure how many times it runs CMP ... JNZ. Keys calculation on the other hand can not be hardware accelerated with general purpose hardware.

Which leads me to ask, Alberto what loop are you measuring as a key?

[MrFreeDragon]

-snip-
2023-04-16 - The creator of the challenge paid rounded amounts of BTC to the remaining unguessed addresses - thus increasing the value of the prizes by a total of over 900 BTC. From this moment, for example - the reward value for address 66 is not 0.66BTC but 6.6BTC
-snip-

How do you know the source of the latest 900 btc and say that it was made by the creator? The transaction potentially could lead to the stolen funds... 

[GR Sasa]

How do you know the source of the latest 900 btc and say that it was made by the creator? The transaction potentially could lead to the stolen funds...  

It was thought to be from the creator of the puzzle because in 2017 he himself promised to increase the puzzle prize by 10x, and yet now after 5 years, the puzzle prize was surprisingly unexpectable increased again by 10x. This should be from the creator himself Satoshi. Even though he didn't announce that himself, like what he did in 2017.

[zielar]

-snip-
2023-04-16 - The creator of the challenge paid rounded amounts of BTC to the remaining unguessed addresses - thus increasing the value of the prizes by a total of over 900 BTC. From this moment, for example - the reward value for address 66 is not 0.66BTC but 6.6BTC
-snip-

How do you know the source of the latest 900 btc and say that it was made by the creator? The transaction potentially could lead to the stolen funds... 

Puzzles are an interesting form of challenge from the very beginning. In the meantime, the prize pool has already been increased once... so I don't think anyone stole over 900 btc this time and donated it to raise the prize pool. It is not the purpose of spreading propaganda, but honest information about what is happening in this challenge. If you don't like it, then go elsewhere and don't come up with this nonsense.

[digaran]

So I was thinking about a new method, I call it GPS tracking, it simply uses triangulation tactic to pinpoint the location of the key. The question though, how do I derive the key given not 3 but 9 interconnected values? I have the mutual distances between several keys, I have tried at least 50 combinations and all lead to dead end, but I know there is a way to estimate the closest location coordinates of the key I'm looking for.


For example, if I know the distances between 3 objects,  I should be able to determine the nearest point to at least one of them, right?

[ProjectSe7en]

So I was thinking about a new method, I call it GPS tracking, it simply uses triangulation tactic to pinpoint the location of the key. The question though, how do I derive the key given not 3 but 9 interconnected values? I have the mutual distances between several keys, I have tried at least 50 combinations and all lead to dead end, but I know there is a way to estimate the closest location coordinates of the key I'm looking for.


For example, if I know the distances between 3 objects,  I should be able to determine the nearest point to at least one of them, right?

Nope, no pattern, so the "triangulation" method is useless, you can fin some collision with almost 10 chars, and guess what? in a near area of 2^40 or maybe more, you will fine nothing.

 

[WanderingPhilospher]

I always like numbers!
First, what is this modified kangaroo program?
Verified that a 3090 gets 4.8G Key/s

This is not JeanLucPons version of Kangaroo
this have a lot of unnecessary checks that slow down the process.

The plain cuda version of secp256k1 and several optimize changes have this speed.

RTX 3070 with power limit 170w 2.4 GKey/s  GPU Ram Usage 3.5GB
RTX 3090 with power limit 350w 4.8 GKey/s  GPU Ram Usage 8.0GB

And one dedicated server for check
have 32GB RAM ( 8gb+ ram need for bloom filters )
~140Gb of nvme used for kvrocks storage for store 2^31.10 of DP32
or 35Gb if use DP34

ps4all. Possibly I'll find time for compare if you have dp's (or work file fromJeanLucPons Kangaroo ) for still determine 120 and check wild/tame and later
(in compared dp's included buyed from zielar)

But i rarely come here.

This had me racking my brain and relooking at kangaroo code for the past week and a half.
But after many trials and errors, I have figured it out. Or at least one way to increase speed using kangaroo.

I'm not one to BS on here.

The speeds posted above could be true because my results are even better!!

RTX 3060 (non Ti) = 2,400 MKey/s (2.4GKey/s)
RTX 3600 Ti = 2,800 MKey/s (2.8GKey/s)
RTX 3070  = 3,100 MKey/s (3.1GKey/s)
RTX 3090 = 5,250 MKey/s (5.2GKey/s)

and

RTX 4090 = 7,750 MKey/s (7.7 GKey/s) (yes, you read that right lol)

But in the end, doesn't really matter lol. There is no community here to help break records and earn some coinage. Just a few people doing their own thing.
I plan on setting something up that members can participate in, but not a pool again...next time, if you want to play, you will pay. This cuts out a lot of people who aren't committed, try attacking your server, ect.
If no one participates, that's cool too...I will definitely keep on grinding.