Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 140.

mcdouglasx

member

Activity: 239

Merit: 53

New ideas will be criticized and then admired.

Quote from: nomachine on January 10, 2024, 08:07:36 AM

Quote from: CY4NiDE on January 09, 2024, 06:50:59 PM

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.

He succeeded in his idea. He showed our cracking capabilities are poor.

Prize: 988.498 BTC (total), 31.998 BTC (won), 956.5 BTC (remaining)

His 956 BTC is relatively safe even the whole world knows the ranges where the private keys are. Grin

I sometimes think that the creator has been withdrawing the BTC from the undisclosed wallets in recent years, I see no reason why someone who unlocks the puzzle should not share their keys anonymously once the wallet is emptied, either that or there is a possible sequence that we are not seeing.

alek76

member

Activity: 93

Merit: 16

Optimized code a little.
https://github.com/alek76-2/VanitySearch/blob/main/mod/other_files/GPUHash_nc_optimized.h
Previously, the data array was transferred from one function to another when initializing RIPEMD160.
I put the constants directly into the RIPEMD160Transform() function.
Now the question is, can this be optimized using compiler options? The uint32_t * array is no longer used.

Code:

__device__ void RIPEMD160Transform(uint32_t s[5],uint32_t* w) {

  uint32_t u;
  //uint32_t a1 = s[0], b1 = s[1], c1 = s[2], d1 = s[3], e1 = s[4];
  //uint32_t a2 = a1, b2 = b1, c2 = c1, d2 = d1, e2 = e1;

  uint32_t a1 = 0x67452301ul, b1 = 0xEFCDAB89ul, c1 = 0x98BADCFEul, d1 = 0x10325476ul, e1 = 0xC3D2E1F0ul;
  uint32_t a2 = a1, b2 = b1, c2 = c1, d2 = d1, e2 = e1;

  //uint32_t t = s[0];
  //s[0] = s[1] + c1 + d2;
  //s[1] = s[2] + d1 + e2;
  //s[2] = s[3] + e1 + a2;
  //s[3] = s[4] + a1 + b2;
  //s[4] = t + b1 + c2;

  //uint32_t t = 0x67452301ul;
  s[0] = 0xEFCDAB89ul + c1 + d2;
  s[1] = 0x98BADCFEul + d1 + e2;
  s[2] = 0x10325476ul + e1 + a2;
  s[3] = 0xC3D2E1F0ul + a1 + b2;
  s[4] = 0x67452301ul + b1 + c2;//s[4] = t + b1 + c2;

Or will the compiler do it itself now? Who can test the speed and correctness of the code?
I checked it on Tesla T4, this code works.

nomachine

member

Activity: 503

Merit: 38

Quote from: CY4NiDE on January 09, 2024, 06:50:59 PM

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.

He succeeded in his idea. He showed our cracking capabilities are poor.

Prize: 988.498 BTC (total), 31.998 BTC (won), 956.5 BTC (remaining)

His 956 BTC is relatively safe even the whole world knows the ranges where the private keys are. Grin

alek76

member

Activity: 93

Merit: 16

Quote from: rosengold on January 09, 2024, 10:31:30 PM

Quote from: alek76 on January 09, 2024, 04:23:27 PM

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.

rosengold

jr. member

Activity: 149

Merit: 7

Quote from: alek76 on January 09, 2024, 04:23:27 PM

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 ?

vneos

newbie

Activity: 26

Merit: 8

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?

CY4NiDE

member

Activity: 63

Merit: 14

Quote from: ?? on ??

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.

alek76

member

Activity: 93

Merit: 16

Is Digaran talking to himself again Roll Eyes

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?

mcdouglasx

member

Activity: 239

Merit: 53

New ideas will be criticized and then admired.

Quote from: FlleOWA on January 09, 2024, 09:56:17 AM

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

FlleOWA

newbie

Activity: 13

Merit: 0

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.

albert0bsd

hero member

Activity: 862

Merit: 662

Quote from: mcdouglasx on December 30, 2023, 10:18:38 PM

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.

nomachine

member

Activity: 503

Merit: 38

Quote from: vneos on January 08, 2024, 12:01:19 AM

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. Grin

vneos

newbie

Activity: 26

Merit: 8

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

FlleOWA

newbie

Activity: 13

Merit: 0

Quote from: mabdlmonem on January 06, 2024, 04:23:24 PM

Quote from: FlleOWA on January 06, 2024, 07:54:46 AM

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

mabdlmonem

jr. member

Activity: 37

Merit: 1

Quote from: FlleOWA on January 06, 2024, 07:54:46 AM

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

newbie

Activity: 13

Merit: 0

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

nomachine

member

Activity: 503

Merit: 38