Bitcoin puzzle transaction ~32 BTC prize to who solves it

[MrGPBit]

Vertix.exe -a 1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ -r f07cb223b00000000:f07cb223bffffffff -p 4

================= WORK IN PROGRESS =================
Target Address: 1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
Prefix length : 4 bytes
CPU Threads   : 6
Mkeys/s       : 19.59
Total Checked : 4211125760
Elapsed Time  : 00:03:35
Range         : f07cb223b00000000:f07cb223bffffffff
Progress      : 98.0479 %
Progress Save : 0
================== PARTIAL MATCH FOUND! ============
Prefix length : 4 bytes
Private Key   : 00000000000000000000000000000000000000000000000F07CB223B031139AF
Public Key    : 0333A5AF3BBFCBF7EC65CA9C90E5D6290AFE43599FE4C6A86ABCF607D54ED5F2F5
WIF           : KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qeGB5uGrWapPfs16Jf6q
Found Hash160 : e0b8a2bad3671c1c2c8423de358fd08f0aef7dd5
Target Hash160: e0b8a2baee1b77fc703455f39d51477451fc8cfc
Matched bytes : e0b8a2ba

Thanks Bro Now its working! Going to Rent a Super Computer   

@zahid888

Can you share the current source code with the changes? Thank you very much.

[hoanghuy2912]

use cuda bsgs to find the prikey for address 1MVaBXUsS3M2FWButxMCE9qu1i9MEbZvvZ, and let me know its prikey then I'll narrow it down for everyone

[kTimesG]

use cuda bsgs to find the prikey for address 1MVaBXUsS3M2FWButxMCE9qu1i9MEbZvvZ, and let me know its prikey then I'll narrow it down for everyone

Perfect tip. BSGS using CUDA sounds perfect. Even more so for finding priv key of an address.

[dastic]

use cuda bsgs to find the prikey for address 1MVaBXUsS3M2FWButxMCE9qu1i9MEbZvvZ, and let me know its prikey then I'll narrow it down for everyone

Perfect tip. BSGS using CUDA sounds perfect. Even more so for finding priv key of an address.

Lets use kangaroo on a prefix instead. 3 first characters so only 3 hex digits of privkey and then multiply it times 65. Good plan!

[nomachine]

care sharing the .cpp file

It's not possible to simply snap your fingers and create a script out of thin air.

First, the command:

Code:

// Use the g_prefixLength variable for comparison
if (_mm_movemask_epi8(cmp) & ((1 << g_prefixLength) - 1) == ((1 << g_prefixLength) - 1)) {

does not work in all cases. It must be changed to:

Code:

uint16_t bitmask = (0xFFFF >> (16 - 4 * g_prefixLength)) << (16 - 4 * g_prefixLength);
if ((_mm_movemask_epi8(cmp) & bitmask) == bitmask) {

Additionally, the following condition:

Code:

if (!matchFound && std::memcmp(localHashResults[j], targetHash160.data(), g_prefixLength) == 0) {

must be changed to:

Code:

if (!matchFound && std::memcmp(localHashResults[j], targetHash160.data(), 20) == 0) {

Otherwise, both partial and full matches will have the same length, causing the script to stop at the first partial match.

Second, printStatsBlock("WORK IN PROGRESS") overwrites the previous output, including the partial match information, every X seconds. As a result, you won't be able to see anything. To fix this, you need to ensure that partial match details are printed in a way that prevents them from being overwritten by printStatsBlock.

[Akito S. M. Hosana]

It's not possible to simply snap your fingers and create a script out of thin air.

I think programmers are magicians. They wave a magic wand and solve puzzles.  

Can you share some code?

[nomachine]

It's not possible to simply snap your fingers and create a script out of thin air.

I think programmers are magicians. They wave a magic wand and solve puzzles.  

Can you share some code?

https://github.com/NoMachine1/Cyclone

You can use:

Code:

./Cyclone -h bfebb73562d4541b32a02ba664d140b5a574792f -r 2000000:3ffffff -b 8

or

Code:

./Cyclone -h bfebb73562d4541b32a02ba664d140b5a574792f -p 26 -b 8

================= WORK IN PROGRESS =================
Puzzle        : 26
Range         : 2000000:3ffffff
Target Hash160: bfebb73562d4541b32a02ba664d140b5a574792f
CPU Threads   : 12
Mkeys/s       : 5.93
Total Checked : 5720064
Elapsed Time  : 00:00:00

================== PARTIAL MATCH FOUND! ============
Prefix length : 8 bytes
Private Key   : 000000000000000000000000000000000000000000000000000000000340326E
Public Key    : 024E4F50A2A3ECCDB368988AE37CD4B611697B26B29696E42E06D71368B4F3840F
Found Hash160 : bfebb73562d4541b32a02ba664d140b5a574792f
Target Hash160: bfebb73562d4541b32a02ba664d140b5a574792f
Matched bytes : bfebb73562d4541b
==================  FULL MATCH FOUND! ==================
Private Key   : 000000000000000000000000000000000000000000000000000000000340326E
Total Checked : 33885184
Elapsed Time  : 00:00:00
Speed         : 5.93 Mkeys/s


Partial Matches: Saved to MATCH.txt when the first g_prefixLength bytes of the hash match.

Full Matches: Saved to KEYFOUND.txt when the entire hash matches.

[zahid888]

It's not possible to simply snap your fingers and create a script out of thin air.

I think programmers are magicians. They wave a magic wand and solve puzzles.  

Can you share some code?

Buggy  not reached to end of keyspace!

[nomachine]

It's not possible to simply snap your fingers and create a script out of thin air.

I think programmers are magicians. They wave a magic wand and solve puzzles.  

Can you share some code?

Buggy  not reached to end of keyspace!

There is no end to the keyspace in my script!
It runs in full random mode, creating an endless loop.

[Akito S. M. Hosana]

It's not possible to simply snap your fingers and create a script out of thin air.

I think programmers are magicians. They wave a magic wand and solve puzzles.  

Can you share some code?

Buggy  not reached to end of keyspace!

There is no end to the keyspace in my script!
It runs in full random mode, creating an endless loop.

Can you make the switch to have both random and sequential modes, like in Keyhunt?

[dastic]

It's not possible to simply snap your fingers and create a script out of thin air.

I think programmers are magicians. They wave a magic wand and solve puzzles.  

Can you share some code?

Buggy   not reached to end of keyspace!

There is no end to the keyspace in my script!
It runs in full random mode, creating an endless loop.

You sure its full random ? cause based partial matches found it looks like sequential but the first hex characters is just random or something, quite buggy

================== PARTIAL MATCH FOUND! ============
Prefix length : 3 bytes
Private Key   : 00000000000000000000000000000000000000000000000A000000000023FA3A
Public Key    : 02DFE7512FFE8B8D4B2E6D88E2CD10947AE9B93ACA0E7F58BCB0582D81ED471D81
Found Hash160 : e0b8a28bbd8279519c46ed740e70f10fa2c9e4f0
Target Hash160: e0b8a2baee1b77fc703455f39d51477451fc8cfc
Matched bytes : e0b8a2

================== PARTIAL MATCH FOUND! ============
Prefix length : 3 bytes
Private Key   : 00000000000000000000000000000000000000000000000E8000000000259F9B
Public Key    : 02FA46CF0BF93F59D9594D7C38A2148E27ECBDAD66A4CF24CDA6D4DFEBCE37BEF0
Found Hash160 : e0b8a2ef73ca54abff046626184e4b30f9045ec6
Target Hash160: e0b8a2baee1b77fc703455f39d51477451fc8cfc
Matched bytes : e0b8a2

================== PARTIAL MATCH FOUND! ============
Prefix length : 3 bytes
Private Key   : 00000000000000000000000000000000000000000000000E800000000036E89E
Public Key    : 03871486B8A8774178CE2A24DACDB55045844840BB58643723783DBF76B6FA82AD
Found Hash160 : e0b8a253e66b6c9324d716c96d610a98b1503516
Target Hash160: e0b8a2baee1b77fc703455f39d51477451fc8cfc
Matched bytes : e0b8a2

================== PARTIAL MATCH FOUND! ============
Prefix length : 3 bytes
Private Key   : 00000000000000000000000000000000000000000000000C80000000007BED2F
Public Key    : 038FE66E0A4857DEC079AC43B971324394A9AF5D676F0D82BC486D199416DB41BF
Found Hash160 : e0b8a205f17a0034116123cc1d371897ff9f4732
Target Hash160: e0b8a2baee1b77fc703455f39d51477451fc8cfc
Matched bytes : e0b8a2

================== PARTIAL MATCH FOUND! ============
Prefix length : 3 bytes
Private Key   : 00000000000000000000000000000000000000000000000D00000000009101A9
Public Key    : 035E34E44397BAB5BADCC99B05AEE656ABA0ED8202CB054CBF4B54C1FCE8174F6C
Found Hash160 : e0b8a2fa56f54a34bcc7bd2c3cc25dc0c8723b84
Target Hash160: e0b8a2baee1b77fc703455f39d51477451fc8cfc
Matched bytes : e0b8a2

[nomachine]

Can you make the switch to have both random and sequential modes, like in Keyhunt?

This was a simple task, but don’t force me to add more functionality. I’m not doing you a favor like this—learn and implement it yourself.

https://github.com/NoMachine1/Cyclone

You sure its full random ? cause based partial matches found it looks like sequential but the first hex characters is just random or something, quite buggy

You'll find 200 million matches in three bytes in 20 minutes (sequentially or randomly) . You need at least 6 bytes, and even more to make it rarer.


P.S. I'm not debugging this any further. It's not my project anyway. I have other scripts and ideas that I'm working on in parallel.  

[Akito S. M. Hosana]

This was a simple task, but don’t force me to add more functionality.

Thank you very much for this as well - that's enough  

How hard would it be to add CUDA support to this?

[nomachine]

How hard would it be to add CUDA support to this?

It's very similar to VanitySearch—all the files are the same. If you have time, great. I don't.

[dastic]

This was a simple task, but don’t force me to add more functionality.

Thank you very much for this as well - that's enough  

How hard would it be to add CUDA support to this?

For CUDA, use this - https://github.com/WanderingPhilosopher/VanBitCrackenRandom2

[jedi12345]

Just an update that tripped me up, all the puzzles start with a 1 binary.

So every puzzle has half the possible combinations.

Like puzzle two only has the combinations 11 and 10 i thought it could of also had 01 and 00.

Nice little boost 

[nomachine]

Thank you very much for this as well - that's enough  

Here is the Git repository from my folder:
https://github.com/NoMachine1/Cyclone.git

[Akito S. M. Hosana]

Thank you very much for this as well - that's enough  

Here is the Git repository from my folder:
https://github.com/NoMachine1/Cyclone.git

What did you do with this? Is this even faster than the original? I have 72M keys/s!   

[Niekko]

Here is the Git repository from my folder:
https://github.com/NoMachine1/Cyclone.git

I think you cannot do it that way. You should fork the original code and then push your changes in order to respect the user's contribution and the license.
https://github.com/Dookoo2/Cyclone/blob/main/LICENSE

[marslas]

Hello everyone,  sorry  for the inconvenience, I would like to write personally to the author of the puzzle that you are actively trying to solve here and find the appropriate  key  for it. Could you please tell me how I can do this?