Pages:
Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 58. (Read 245054 times)

member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk


Im rent a adt servers, for 0.08$/h for 1-20 code tasks, for this dcrypt I thin they will be ok.Tmux comnand for continue work scrypt then you close avast  jupitirnotebook terminal. https://vast.ai/

I see, already use vast ai, just for backtest the code for search.
i'm use 128 thread instances, but nearly nothing for bruteforce, for bruteforce is good when you use GPU.., but since lack of coding and not pros, idk how to deal make code with GPU implementation...


For me ny code make AI, Im use duck duck go ai


https://duckduckgo.com/?q=DuckDuckGo+AI+Chat&ia=chat&duckai=1

Llama 3.1 70B

But I have very little experience of cuda coding with AI, but python to c++  multythread he make good
jr. member
Activity: 79
Merit: 1


Im rent a adt servers, for 0.08$/h for 1-20 code tasks, for this dcrypt I thin they will be ok.Tmux comnand for continue work scrypt then you close avast  jupitirnotebook terminal. https://vast.ai/

I see, already use vast ai, just for backtest the code for search.
i'm use 128 thread instances, but nearly nothing for bruteforce, for bruteforce is good when you use GPU.., but since lack of coding and not pros, idk how to deal make code with GPU implementation...
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

Grat, Im waiting what you find privkey in 1 hour



yeah, i try push my luck on this, but it's impossible in hour, i use cheap laptop, i just figure out how to deal with ranges of bit, for me
"Under these software and hardware conditions, I can completely scan a range of 30 - 53 bits." -- IT'S STILL HARD, AND NEARLY IMPOSSIBLE  Tongue

2 years following this journey of search of puzzle it's fun, i learn everything about bitcoin rightnow.

thankyou  Wink

Im rent a adt servers, for 0.08$/h for 1-20 code tasks, for this dcrypt I thin they will be ok.Tmux comnand for continue work scrypt then you close avast  jupitirnotebook terminal. https://vast.ai/
jr. member
Activity: 79
Merit: 1

Grat, Im waiting what you find privkey in 1 hour



yeah, i try push my luck on this, but it's impossible in hour, i use cheap laptop, i just figure out how to deal with ranges of bit, for me
"Under these software and hardware conditions, I can completely scan a range of 30 - 53 bits." -- IT'S STILL HARD, AND NEARLY IMPOSSIBLE  Tongue

2 years following this journey of search of puzzle it's fun, i learn everything about bitcoin rightnow.

thankyou  Wink
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

go and brute this, lloks like this in not so hard. replace firts X to number from 1 to 9 in dec or to 1 to f in hex, you get ranges. from  46346217550346335726 to f000.0008929167990784  to 8929167990784.etc.

X is used for censorship, i got precise 4 letter of hex on that range, the rest is need to be brute-forced.


[EDIT]

let's see...

XXXXXXXXXX

  • Puzzle search
  • Script started at:2024-09-23 10:21:08
  • Thread:6
  • range:XXXXXXXXXX929167990784 to:XXXXXXXXXX581819002880
  • target:1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
  • --------------------------------------------------------------------------------
  • 2024-09-23 10:21:10
  • XXXXXXXXXX498399202730
  • 0256c1cb3cb333262596a93c000c21d0defe3b777de58296eda9aa600e921ad0ce
  • 1BY8U5dkJ9STJkZAR8aKMvqapo4chGjZVw
  • --------------------------------------------------------------------------------
Grat, Im waiting what you find privkey in 1 hour

member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

go and brute this, lloks like this in not so hard. replace firts X to number from 1 to 9 in dec or to 1 to f in hex, you get ranges. from  46346217550346335726 to f000.0008929167990784  to 8929167990784.etc.

X is used for censorship, i got precise 4 letter of hex on that range, the rest is need to be brute-forced.


[EDIT]

let's see...

XXXXXXXXXX

  • Puzzle search
  • Script started at:2024-09-23 10:21:08
  • Thread:6
  • range:XXXXXXXXXX929167990784 to:XXXXXXXXXX581819002880
  • target:1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
  • --------------------------------------------------------------------------------
  • 2024-09-23 10:21:10
  • XXXXXXXXXX498399202730
  • 0256c1cb3cb333262596a93c000c21d0defe3b777de58296eda9aa600e921ad0ce
  • 1BY8U5dkJ9STJkZAR8aKMvqapo4chGjZVw
  • --------------------------------------------------------------------------------

not bad not bad, dont forget share your results
jr. member
Activity: 79
Merit: 1

go and brute this, lloks like this in not so hard. replace firts X to number from 1 to 9 in dec or to 1 to f in hex, you get ranges. from  46346217550346335726 to f000.0008929167990784  to 8929167990784.etc.

X is used for censorship, i got precise 4 letter of hex on that range, the rest is need to be brute-forced.


[EDIT]

let's see...

XXXXXXXXXX

  • Puzzle search
  • Script started at:2024-09-23 10:21:08
  • Thread:6
  • range:XXXXXXXXXX929167990784 to:XXXXXXXXXX581819002880
  • target:1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9
  • --------------------------------------------------------------------------------
  • 2024-09-23 10:21:10
  • XXXXXXXXXX498399202730
  • 0256c1cb3cb333262596a93c000c21d0defe3b777de58296eda9aa600e921ad0ce
  • 1BY8U5dkJ9STJkZAR8aKMvqapo4chGjZVw
  • --------------------------------------------------------------------------------
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
I have range of exactly the range of #67, but i have less resource of bruteforce software/hardware.

I use math, and i have proof to clarify it's work.

this!

i try with 66 Bit.

Divide 4 from upper range, with formula!
result:

| 46337664863972737024 | 2831074afb231c000
| 46341573236515241984 | 2831e5754973d8000
| 46345481609057755136 | 2832c39f97c496000
| 46349389981600260096 | 2833a1c9e61552000

Private key located (already found) is on : 46346217550346335726 | 2832ed74f2b5e35ee

I make this formula like 90% to measure the range of search.

it work for count and make variable for measure ranges from key alread found or not.


for next 67 Bit.

67 BIT PUZZLE
46346217550346335726 | XXXXXXXXX8929167990784 | XXXXXXXX868880000 |
46346217550346335726 | XXXXXXXXX146718502912 | XXXXXXXXc12500000 |
46346217550346335726 | XXXXXXXXX364268752896 | XXXXXXXXfbc140000 |
46346217550346335726 | XXXXXXXXX581819002880 | XXXXXXXX365d80000 |

Cheesy

i already test it from 30 bit until 115 bit. and it's precisely work measure range.

go and brute this, lloks like this in not so hard. replace firts X to number from 1 to 9 in dec or to 1 to f in hex, you get ranges. from  46346217550346335726 to f000.0008929167990784  to 8929167990784.etc.

need not more then 2hours for prepare rabges and brute... ??
jr. member
Activity: 79
Merit: 1
I have range of exactly the range of #67, but i have less resource of bruteforce software/hardware.

I use math, and i have proof to clarify it's work.

this!

i try with 66 Bit.

Divide 4 from upper range, with formula!
result:

| 46337664863972737024 | 2831074afb231c000
| 46341573236515241984 | 2831e5754973d8000
| 46345481609057755136 | 2832c39f97c496000
| 46349389981600260096 | 2833a1c9e61552000

Private key located (already found) is on : 46346217550346335726 | 2832ed74f2b5e35ee

I make this formula like 90% to measure the range of search.

it work for count and make variable for measure ranges from key already found or not.


for next 67 Bit.

67 BIT PUZZLE
46346217550346335726 | XXXXXXXXX8929167990784 | XXXXXXXX868880000 |
46346217550346335726 | XXXXXXXXX146718502912 | XXXXXXXXc12500000 |
46346217550346335726 | XXXXXXXXX364268752896 | XXXXXXXXfbc140000 |
46346217550346335726 | XXXXXXXXX581819002880 | XXXXXXXX365d80000 |

Cheesy

i already test it from 30 bit until 115 bit. and it's precisely work measure range.
"Under these software and hardware conditions, I can completely scan a range of 30-53 bits."
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
I have range of exactly the range of #67, but i have less resource of bruteforce software/hardware.

I use math, and i have proof to clarify it's work.

you already have scrypt what need for this. As I understand spped of scrypt is more then 20 000 000 / sec, so, this is one of the bast scrypt , you not find faster then it
jr. member
Activity: 79
Merit: 1
I have range of exactly the range of #67, but i have less resource of bruteforce software/hardware.

I use math, and i have proof to clarify it's work.
jr. member
Activity: 79
Merit: 1

 # ./puzzle -r 1020000000:1040000000 -a 1LHtnpd8nU5VHEMkG2TMYYNUjjLc992bps
  • Puzzle search
  • Script started at:2024-09-22 18:25:34
  • concurrency:12
  • range:1020000000 to:1040000000
  • target:1LHtnpd8nU5VHEMkG2TMYYNUjjLc992bps
  • --------------------------------------------------------------------------------
  • KEY FOUND! 2024-09-22 18:25:54
  • decimal: 1033162084
  • private key: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9M8diLSC5MyERoW
  • public key: 030d282cf2ff536d2c42f105d0b8588821a915dc3f9a05bd98bb23af67a2e92a5b
  • address: 1LHtnpd8nU5VHEMkG2TMYYNUjjLc992bps
  • --------------------------------------------------------------------------------


# ./puzzle -r 46346217550300000000:46346217550360000000 -a 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
  • Puzzle search
  • Script started at:2024-09-22 19:05:32
  • concurrency:12
  • range:46346217550300000000 to:46346217550360000000
  • target:13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
  • --------------------------------------------------------------------------------
  • KEY FOUND! 2024-09-22 19:06:00
  • decimal: 46346217550346335726
  • private key: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZfFoWMiwBt943V7CQeX
  • public key: 024ee2be2d4e9f92d2f5a4a03058617dc45befe22938feed5b7a6b7282dd74cbdd
  • address: 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so

And this is an example of how narrow the range must be to hit WIF.

root@C.######:~/puzzle_solver$ cargo run -- --address 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so --range 0x2832c39f97c496000:0x2833a1c9e61552000
   Compiling puzzle v0.2.0 (/root/puzzle_solver)
    Finished `dev` profile [unoptimized + debuginfo] target(s) in 1.15s
     Running `target/debug/puzzle --address 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so --range '0x2832c39f97c496000:0x2833a1c9e61552000'`
  • Puzzle search
  • Script started at:2024-09-23 00:22:48
  • Thread:124
  • range:46345481609057755136 to:46349389981600260096
  • target:13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
  • --------------------------------------------------------------------------------
  • 2024-09-23 00:23:00
  • decimal: 46349075931177856298
  • private key: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZfFzd1mcPdvDRum7nYS
  • public key: 0288e98e6327376050c6789417ec200454b5730955389bc782868dfe0698eff2a3
  • address: 13zb1vySc4RTXfMcSqvBv8hhMSEhY4viFi
  • --------------------------------------------------------------------------------

I'm trying to test with already found #66

Good!, I'll try something, if i hit something, i'l message you bro Cheesy, wish me luck.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
trying, scaled the decimal to get the range of hex key.


root@C.######:~/keyhunt$ ./keyhunt -m rmd160 -f 66.rmd -r 2832c39f97c496000:2833a1c9e61552000 -n 0x1000000000 -k 256 -l compress -s 1 -t 128
  • Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
  • Mode rmd160
  • K factor 256
  • Search compress only
  • Stats output every 1 seconds
  • Threads : 128
  • N = 0x1000000000
  • Range
  • -- from : 0x2832c39f97c496000
  • -- to   : 0x2833a1c9e61552000
  • Allocating memory for 1 elements: 0.00 MB
  • Bloom filter for 1 elements.
  • Loading data to the bloomfilter total: 0.03 MB
  • Sorting data ... done! 1 values were loaded and sorted
  • Total 11198087168 keys in 339 seconds: ~33 Mkeys/s (33032705 keys/s)

 Cheesy

i try, it took 140 days to done with this, if you have 10K Mkeys, it will be done in less than one day.

you try konvertr range to wif and solve with scrypt of nomachine ? because this spped is slower then .dat password brute )))

because:

range:46346217550300000000 to:46346217550360000000
target:13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so

1 min to search
jr. member
Activity: 79
Merit: 1
trying, scaled the decimal to get the range of hex key.


root@C.######:~/keyhunt$ ./keyhunt -m rmd160 -f 66.rmd -r 2832c39f97c496000:2833a1c9e61552000 -n 0x1000000000 -k 256 -l compress -s 1 -t 128
  • Version 0.2.230519 Satoshi Quest, developed by AlbertoBSD
  • Mode rmd160
  • K factor 256
  • Search compress only
  • Stats output every 1 seconds
  • Threads : 128
  • N = 0x1000000000
  • Range
  • -- from : 0x2832c39f97c496000
  • -- to   : 0x2833a1c9e61552000
  • Allocating memory for 1 elements: 0.00 MB
  • Bloom filter for 1 elements.
  • Loading data to the bloomfilter total: 0.03 MB
  • Sorting data ... done! 1 values were loaded and sorted
  • Total 11198087168 keys in 339 seconds: ~33 Mkeys/s (33032705 keys/s)

 Cheesy

i try, it took 140 days to done with this, if you have 10K Mkeys, it will be done in less than one day.
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk

Did you know how to randomly  generate this sequence with random nambers from I 39 to 2 , faster is posible ?

Sequence,all next member of sequence < the previous ?

39 38 37 32 31 30 28 27 24 22 21 15 12 11 9 7 6

thank you



Code:
import random as A
B=list(range(39,1,-1));C=A.sample(B,k=A.randint(1,len(B)))
C.sort(reverse=True);print(C)

Bro, thank you very mach.Worked, faster theny scrypt, but, no so fast.


Bro, can you make example of a scrypt with your super fast RNG generator on rust ?

please

numbers from 39 to 6.

[39, 38, 37, 32, 31, 30, 28, 27, 24, 22, 21, 15, 12, 11, 9, 7, 6]

?

ps in python I get only 50000 examples every 3 seconds:

Code:

import random as A

tri = [39, 38, 37, 32, 31, 30, 28, 27, 24, 22, 21, 15, 12, 11, 9, 7, 6]

B=list(range(39,5,-1))

C =[]
count = 0

while tri != C:
    count=count+1
    C=A.sample(B,k=A.randint(17,17))
    C.sort(reverse=True);
   
    if count % 50000 ==0:
        print(C,count)







[37, 36, 35, 34, 33, 30, 28, 27, 22, 20, 15, 14, 13, 9, 8, 7, 6] 2000000
[38, 34, 33, 31, 30, 28, 27, 26, 25, 24, 22, 16, 13, 12, 10, 7, 6] 2050000
[39, 35, 34, 33, 31, 29, 28, 27, 23, 22, 20, 19, 17, 13, 12, 11, 6] 2100000
[38, 37, 35, 34, 32, 31, 26, 25, 24, 23, 22, 21, 18, 15, 14, 11, 6] 2150000
[38, 37, 36, 33, 32, 29, 27, 26, 24, 23, 22, 21, 20, 18, 14, 8, 6] 2200000
[36, 32, 31, 30, 29, 28, 26, 25, 22, 18, 17, 15, 13, 10, 9, 8, 6] 2250000
[38, 36, 32, 31, 30, 28, 27, 26, 25, 23, 21, 20, 19, 17, 13, 9, 8] 2300000
jr. member
Activity: 79
Merit: 1
Guys,
Puzzle 62 has private key, and that private key can used for answer for 66 bit.

i can't explain, but i found something funny while doing something with decimal number on that upper range.
member
Activity: 503
Merit: 38

Did you know how to randomly  generate this sequence with random nambers from I 39 to 2 , faster is posible ?

Sequence,all next member of sequence < the previous ?

39 38 37 32 31 30 28 27 24 22 21 15 12 11 9 7 6

thank you



Code:
import random as A
B=list(range(39,1,-1));C=A.sample(B,k=A.randint(1,len(B)))
C.sort(reverse=True);print(C)
newbie
Activity: 11
Merit: 0

https://privatekeys.pw/address/bitcoin/1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9

For other addresses you can check using hash:

Public Key Hash (Hash 160):
739437bb3dd6d1983e66629c5f08c70e52769371

Based on the puzzle's statistics, the private key for 67 is likely around 95XXXXXX. If anyone finds it within this range, I’d be more than happy to accept some gifts! Smiley

bc1q4xj4maw4csvn084zwjtrgzg8tk08660mxj6wnw

It is not working to find the other addresses using the hash: https://privatekeys.pw/quick-search?query=739437bb3dd6d1983e66629c5f08c70e52769371
it is searching only using the HEX or brainwallet
hero member
Activity: 630
Merit: 731
Bitcoin g33k
I may have missed this, but is there a working Kangaroo on github that can handle more than 128bit and is guaranteed to work correctly? Cheesy
member
Activity: 873
Merit: 22
$$P2P BTC BRUTE.JOIN NOW ! https://uclck.me/SQPJk
I tested your program and it works fine... i was wondering if that would make any sense to compile it for windows and run it on 5W powered fanless Intel NUC  1core atom procesor and let it run "forever" as a lottery ...

It doesn't have to be forever... I have a crystal ball, but I don't know how to look into it.  Grin

Hi, bro.


Did you know how to randomly  generate this sequence with random nambers from I 39 to 2 , faster is posible ?

Sequence,all next member of sequence < the previous ?

39 38 37 32 31 30 28 27 24 22 21 15 12 11 9 7 6

thank you
Pages:
Jump to: