Bitcoin puzzle transaction ~32 BTC prize to who solves it

[alek76]

And so on and on....This is only part of it.

I even modify BIOS on Intel boards and even GPU bios.  Until the components burn *from efficiency.

Wow... Approaching your goal step by step. This is great !

[1715298743]

1715298743

[1715298743]

1715298743

[1715298743]

1715298743

[FlleOWA]

And leave it like that until January 1, 2025  

I have ~90 Ekeys/s in BSGS/keyhunt

I have less. Only 5 Ekeys/s, which is very little.
He should be taught not to slow down if there are a lot of keys.
By the way, I modified the divider from Alberto ecctools.
I made a subtractor out of it, and it saves everything into a text file. It can also take keys line by line from a file and take them away in order and write them either to a given file, or it creates a file with the name of who it subtractor it from and writes the keys.

[nomachine]

I have less. Only 5 Ekeys/s, which is very little.

And that's enough to solve 65 in two seconds.


I'm scratching my head to find a way to make baby steps for the H160. There seems to be no way.

[mabdlmonem]

I have less. Only 5 Ekeys/s, which is very little.

And that's enough to solve 65 in two seconds.


I'm scratching my head to find a way to make baby steps for the H160. There seems to be no way.

There is only one way pub to rmd

[nomachine]

I have less. Only 5 Ekeys/s, which is very little.

And that's enough to solve 65 in two seconds.


I'm scratching my head to find a way to make baby steps for the H160. There seems to be no way.

There is only one way pub to rmd

And make binary database full with H160. I don't know how long that process would take. I haven't tried it yet.

[mabdlmonem]

I have less. Only 5 Ekeys/s, which is very little.

And that's enough to solve 65 in two seconds.


I'm scratching my head to find a way to make baby steps for the H160. There seems to be no way.

There is only one way pub to rmd

And make binary database full with H160. I don't know how long that process would take. I haven't tried it yet.

Serialized point and get hash160 for it on the fly

[nomachine]

I have less. Only 5 Ekeys/s, which is very little.

And that's enough to solve 65 in two seconds.


I'm scratching my head to find a way to make baby steps for the H160. There seems to be no way.

There is only one way pub to rmd

And make binary database full with H160. I don't know how long that process would take. I haven't tried it yet.

Serialized point and get hash160 for it on the fly

I moved this to another topic
https://bitcointalk.org/index.php?topic=5477342.msg63451195#msg63451195

[FlleOWA]

I uploaded the subtraction program to GitHub. If anyone needs it, you can use it, there is a compiled version for Windows.
https://github.com/Flleowa/ecctools-Subtraction

[mabdlmonem]

I uploaded the subtraction program to GitHub. If anyone needs it, you can use it, there is a compiled version for Windows.
https://github.com/Flleowa/ecctools-Subtraction

What is 68719476736 , why this number and how you calculated it?

[FlleOWA]

I uploaded the subtraction program to GitHub. If anyone needs it, you can use it, there is a compiled version for Windows.
https://github.com/Flleowa/ecctools-Subtraction

What is 68719476736 , why this number and how you calculated it?

This is Hex 1000000000 in decimal

[vneos]

HI everyone, maybe someone here can explain to me how public key subtraction works? Thanks.

[nomachine]

HI everyone, maybe someone here can explain to me how public key subtraction works? Thanks.

Or even better.... a simplified NSA accelerated study on how to solve any puzzle with key-subtraction.

[albert0bsd]

I have developed a new method!
I have studied it 100% and it works.
My calculations tell me that before the end of January 2024 I will have unlocked puzzle #130 (if someone else doesn't solve it before).
For registration, I will send it to this address BTC bc1qxs47ttydl8tmdv8vtygp7dy76lvayz3r6rdahu

This message will not have edits for its validity.

If you want to question it, do it on February 1, 2024 if I don't send it to that address.

happy new year in advance, see you in February!, if life allows me.

blessings for all.

Quoting this just for archive right now puzzle 130 is 610K USD not bad lets to see how much is on Feb 1st.

[FlleOWA]

Using division and other manipulations of the public key of puzzle 130, we managed to obtain the key 02000000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
Someone tell me what sense does this make? For now I’m just researching what kind of public key this is.
I apologize if for my stupidity. It’s just that the specialists here are on topic, unlike me.

[mcdouglasx]

Using division and other manipulations of the public key of puzzle 130, we managed to obtain the key 02000000000000000000000003b78ce563f89a0ed9414f5aa28ad0d96d6795f9c63
Someone tell me what sense does this make? For now I’m just researching what kind of public key this is.
I apologize if for my stupidity. It’s just that the specialists here are on topic, unlike me.

edit:
that pub key is equivalent to inverrse N/2

pk=7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A1

[alek76]

Is Digaran talking to himself again  

In the meantime I rewrite the GPUHash.h file
GPU constant memory is not used in hash functions. I checked the program's operation on PK 40 bit. It works, but the speed is the same.
https://github.com/alek76-2/VanitySearch/blob/main/mod/other_files/GPUHash_nc.h

Can someone test it?

[CY4NiDE]

I have found a few interesting hints regarding the puzzle 130, since I don't know the actual private key, I will just leave them here for the author to verify.
Are the following values related to the puzzle 130 in any way? Like being the last characters, first characters, the key being divisible by them etc?
3c8
f2
ec

If yes then I might be onto something. Then I'd need a hint to follow up on it, you might also want to check the inverse key as well.

I think that if the creator was to come here and give us hints, this would defeat the purpose of his creation which is to measure our cracking capabilities.

Can't really be giving out hints in an experiment like this one, we must check our own leads and see what comes out of it.

[vneos]

I think I figured out how publickey subtraction works. I apologize if I misunderstood.
But I have a question, in programs that support multiple publickeys as input, such as kangaroo and keyhunt, do they look up all the publickeys in parallel? Or do they just look them up line by line? So far in my testing, JLP's kangaroo does lookup line by line, which would be very slow to lookup all publickeys, so what is the point of publickey subtraction?

[rosengold]

In the meantime I rewrite the GPUHash.h file
GPU constant memory is not used in hash functions. I checked the program's operation on PK 40 bit. It works, but the speed is the same.
https://github.com/alek76-2/VanitySearch/blob/main/mod/other_files/GPUHash_nc.h

Can someone test it?

nice work alek !

could you please add a stride function on it ?

[alek76]

In the meantime I rewrite the GPUHash.h file
GPU constant memory is not used in hash functions. I checked the program's operation on PK 40 bit. It works, but the speed is the same.
https://github.com/alek76-2/VanitySearch/blob/main/mod/other_files/GPUHash_nc.h

Can someone test it?

nice work alek !

could you please add a stride function on it ?

There, for starting keys in the getGPUStartingKeys function, the step is set here.

Code:

else {
      //
      keys[i].Set(&startKey);
      Int offT((uint64_t)i);
      //offT.ShiftL(32);	  
      Int offG((uint64_t)thId);
      //offG.ShiftL(40);
      // new offset
      int nbBit = startKey.GetBitLength();
      offT.ShiftL((uint32_t)(nbBit / 2));
      offG.ShiftL((uint32_t)(nbBit - 4));
      //
      keys[i].Add(&offT);
      keys[i].Add(&offG);
      if (i < 10 || i > nbThread - 10) { printf("Bit %d GPU startKey Base Key %d: %s\n", Random_bits, i,             
      keys[i].GetBase16().c_str()); } 
      //
}

I don’t want to, I will need to recalculate the distance traveled and create an addition for a new start of the keys. A table and steps are used. +1 and -1 further to +512 and -512 Delta is needed to increase the speed when calculating the inversion modulo distance - this is when adding points.
You can generate starting keys in increments. The dot addition step cannot be changed.
For example, you won’t be able to add 16, 64 or 2048. The addition step is 1 - all because of the table.