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

This code I use to scan #64 using python 3.xxx:

Do i just add this one if only wanting the 64th to be searched,
0000000000000000000000000000000000000000000000007CCE5EFDACCF6808 so adding this
added the a append, anything needed to be printed onscreen while searching?
like speed or time left or
#print(hex(i))
#print(key1.address)
#print(key2.address)
  print(i,wif,wif2) #(i,wif,wif2,key1.address,key2.address)
any of these, i know i already asked to much.

but you can found puzzle creator comment on this thread. (just one comment). and it would be better to read all about this puzzle on all related info/thread

btw, I read almost all of the thread, including the locked one and you've mentioned above

you can follow this topic on new thread update at here

https://bitcointalksearch.org/topic/bitcoin-challenge-transaction-1000-btc-total-bounty-to-solvers-updated-5218972

this thread is older and long

You can use open() function + parameter to open/read/write/append your result into a file
parameters:
'a' (Append) will append to the end of the file
'w' (Write) will overwrite any existing content
'r' (Read) will read from file

This code I use to scan #64 using python 3.xxx:

*if the YourFileName.txt file does not exist it will create automatically

if you want to test the code with a small range. let say puzzle #25
then you can change a,b, prehex and wallettofind value like this:

how you make the bottom part of your code search the 64th puzzle and save it if found
wow andzhig respect. you really great in these things man.
thanks

Or such an option.

Take 1000 samples of 50 from the set 00-99 ()

>>> 1

>>> 2

>>> 3

>>> 4

>>> 5
480 huuuuuuuuuurraaaaaaaaaa... ['00', '01', '02', '03', '04', '05', '06', '07', '08', '09', '10', '11', '12', '13', '14', '15', '16', '17', '18', '19', '20', '21', '22', '23', '24', '25', '26', '27', '28', '29', '30', '31', '32', '33', '34', '35', '36', '37', '38', '39', '40', '41', '42', '43', '44', '45', '46', '47', '48', '49', '50', '51', '52', '53', '54', '55', '56', '57', '58', '59', '60', '61', '62', '63', '64', '65', '66', '67', '68', '69', '70', '71', '72', '73', '74', '75', '76', '77', '78', '79', '80', '81', '82', '83', '84', '85', '86', '87', '88', '89', '90', '91', '92', '93', '94', '95', '96', '97', '98', '99'] 100     ['46', '77', '96', '34', '68', '95', '45', '60', '30', '96', '90', '63', '29', '23', '56', '65', '28', '84', '69', '43', '84', '08', '84', '36', '64', '83', '70', '91', '20', '28', '73', '73', '58', '68', '72', '92', '61', '85', '70', '52', '24', '58', '55', '54', '54', '93', '12', '64', '44', '31'] 50     ['30'] ['56'] ['83'] ['77'] ['31'] ['20'] ['64'] ['20'] ['28'] ['55']

5 samples come across

['46, '77', '96', '34', '68', '95', '45', '60', '30', '96', '90', '63', '29', '23', '56', '65', '28', '84', '69', '43', '84', '08', '84', '36', '64', '83', '70', '91', '20', '28', '73', '73', '58', '68', '72', '92', '61', '85', '70', '52', '24', '58', '55', '54', '54', '93', '12', '64', '44', '31'] 50

['30'] ['56'] ['83'] ['77'] ['31'] ['20'] ['64'] ['20'] ['28'] ['55']

and that only 5000 mixed sets in which dropped out with the required number.

now we take each of these 5000 sets and select 1000 from each of them, 30 samples.

finds the first time (but you may need 20-30, etc.)

174 huuuuuuuuuurraaaaaaaaaa... ['46', '77', '96', '34', '68', '95', '45', '60', '30', '96', '90', '63', '29', '23', '56', '65', '28', '84', '69', '43', '84', '08', '84', '36', '64', '83', '70', '91', '20', '28', '73', '73', '58', '68', '72', '92', '61', '85', '70', '52', '24', '58', '55', '54', '54', '93', '12', '64', '44', '31'] 50     ['46', '73', '31', '84', '83', '95', '63', '72', '95', '68', '68', '58', '30', '77', '56', '83', '20', '45', '95', '84', '64', '28', '65', '70', '85', '55', '08', '85', '68', '83'] 30     ['30'] ['56'] ['83'] ['77'] ['31'] ['20'] ['64'] ['20'] ['28'] ['55']

666 huuuuuuuuuurraaaaaaaaaa... ['46', '77', '96', '34', '68', '95', '45', '60', '30', '96', '90', '63', '29', '23', '56', '65', '28', '84', '69', '43', '84', '08', '84', '36', '64', '83', '70', '91', '20', '28', '73', '73', '58', '68', '72', '92', '61', '85', '70', '52', '24', '58', '55', '54', '54', '93', '12', '64', '44', '31'] 50     ['92', '56', '73', '12', '34', '73', '96', '90', '95', '58', '20', '93', '83', '60', '63', '84', '58', '68', '31', '28', '77', '23', '72', '54', '55', '30', '64', '70', '93', '23'] 30     ['30'] ['56'] ['83'] ['77'] ['31'] ['20'] ['64'] ['20'] ['28'] ['55']

now can search further in the same way for 17 parts, but it takes a long time or choose from 30

and then, in the end, for the first choice from 100 to 50 we take 1000 and then for each 1000 1000 already 1000000 and 17 parts from 30 20-30 20000000 (using a stirring of 17 on a PC it takes 1 stirring per day approximately)

or search in another way

how to choose from 30 parts.
can create as many sets as you like from fixed positions and run reading lines

we have a string blablabla

123456789

pos 2 4 6 8
     2 4 6 8 > 2468
pos 1 3 4 7
     1 3 4 7 > 1347

n this case,need to run only 1000x1000 1,000,000 lines (in several copies of the program, for each program you need its own set of random 1,000,000)

and position traps when fishing from 30 parts what you can think of

pos 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17...
pos 2 4 6 8 10 12 14 16...
pos 1 3 7 9...
pos 25 12 20 3...

***
Or try to iterate over the private keys (not compressed in short). Someone could still hack this.
https://twitter.com/UnderTheBreach/status/1303316723186139136?ref_src=twsrc%5Etfw%7Ctwcamp%5Etweetembed%7Ctwterm%5E1303316723186139136%7Ctwgr%5E%7Ctwcon%5Es1_&ref_url=https%3A%2F%2F2bitcoins.ru%2Fvzlomat-koshelek-s-69370-bitkoinami%2F forwarded https://www.blockchain.com/btc/address/bc1qa5wkgaew2dkv56kfvj49j0av5nml45x9ek9hz6

And they wrote that out of 15+ a password from a set of letters and numbers cannot be cracked faster than 100 years.

Or the author of the puzzle, if bitcoin starts to cost 500 thousand dollars (0,6 > ~ 300000$), will bring everything back to himself. Either he owns thousands of bitcoins and doesn't care or we need to hurry.  

We have 17 to 15 characters (123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz) long.

the private owner himself lenght is 51...

5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip + 17 or

5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip7 + 16
5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip8 + 16
5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip9 + 16

etc...

[/size]

[/size]

did not delve into the details of how he generates it this private but the main part goes through step by step (for each of 123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz the same in order) as an option, see how much it will roll on the counter between the puzzles, maybe there is something to attach to, or it will copy dec.

It is not yet clear where he might be

1Me6EfpwZK5kQziBwBfvLiHjaPGxCKLoJi      | 4611686018427387903                     
1NpYjtLira16LfGbGwZJ5JbDPh3ai9bjf4        | 9223372036854775807  8993229949524469768
16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN   | 18446744073709551615                 
18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe | 36893488147419103231                   

[/size]

gunchefi i send you looot of btc send me the file, my asic,

waiting for the files.

Link

https://github.com/iceland2k14/bsgs

this is not the pvk asic pool or solo miner, just a bsgs multi pub search made by iceland somethin with help of albert something,

this is not the original link it is 100% SCAM


[/quote]

Thats exactly thé sames files That i bought from thé github but here for only 0.001 btc ...
they are password protected And i don’t know how to contact the github guy

Here : https://satoshi-box.com/pay/CBglPP

Link?

I bought your code but There is a password ?

There is nothing special to understand)). I already wrote once.

We're searching for a number, let's say it 30568377312064202855

break it into pieces of 2 digits 30 56 83 77 31 20 64 20 28 55

We just swap them and get the number you need. python  random shuffle uses something of Fisher–Yates https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle (will gpu speed it up?)


...

2175109 find.............................. 30568377312064202855

2175109 mileage permutation steps.

we can increase the number of parts to 15-20-30 ['30', '56', '83', '77', '31', '20', '64', '20', '28', '55'] > ['30', '56', '83', '77', '31', '20', '64', '20', '28', '55', '30', '56', '83', '77', '31', '20', '64', '20', '28', '55'] this will increase the search time but will increase the dropout of the parts we need to compose the desired number.


in other words, we need to find "abc" from the set "abcdef"

we choose from "abcdef" any letters and mix them

"cde"

dec
ecd
edc
...

did not find we take others

"bdf"
fdb
dbf
fbd
...

we can take all the letters and mix them (cutting to the length we need)
"abcdef"

defabc > def
bcdaef > bcd
abcdef > abc find!

How mixing itself works in python libraries should be seen in the documentation (https://docs.python.org/3/library/random.html) or in the scripts libraries (or come up with your own version).

our puzzle numbers consist of numbers

    ['00', '01', '02', '03', '04', '05', '06', '07', '08', '09',
     '10', '11', '12', '13', '14', '15', '16', '17', '18', '19',
     '20', '21', '22', '23', '24', '25', '26', '27', '28', '29',
     '30', '31', '32', '33', '34', '35', '36', '37', '38', '39',
     '40', '41', '42', '43', '44', '45', '46', '47', '48', '49',
     '50', '51', '52', '53', '54', '55', '56', '57', '58', '59',
     '60', '61', '62', '63', '64', '65', '66', '67', '68', '69',
     '70', '71', '72', '73', '74', '75', '76', '77', '78', '79',
     '80', '81', '82', '83', '84', '85', '86', '87', '88', '89',
     '90', '91', '92', '93', '94', '95', '96', '97', '98', '99']

we can randomly choose 10-20-30 parts from them and mix them in search of the number we need (looking for 10 needed out of a 100 or search for several puzzles at once 10 11 12 13... trimming the length we need programmatically).

hi

sharing is caring,

what is that the app, from satoshidisk

I have taken programs developed, Kangaroo, VS, BitCrack (not using bitcrack anymore) and have tinkered with them along with python and batch scripts to do what I want it to do. Doesn't mean my ideas are the best, just I wanted to do something and set out to do it. I am not a programmer but I can study code and make some changes.  I was/am still trying to figure out your mixing. Can you explain via an example?

For the #64, how would the mixing work, mix what, and do what?

Well, this is already a question of writing a program, in theory, gpu acceleration is enough only for check the keys. And depending on which programming language your, libraries or ready-made scripts should be on the internet. You wrote that gpu works for you, you created the program yourself or use some of the puzzle theme (bitcrack or kangaroo)? what prevents you if you created the program yourself, add on top (before checking the gpu keys) a ready-made script from the Internet mixing (random shuffle function) in C ++ or OpenCl/Gl gpu cuda. 

In general, let's find at least 1 pz and pay brichard19 he will write to us as needed 

Technical question - can somebody point out how author created this puzzle with deterministic wallet, not shure how masking could be done (and with what deterministic wallet in early 2015)?
"It is just consecutive keys from a deterministic wallet (masked with leading 000...0001 to set difficulty)."

Thnx and good luck for fighters!

I would have to see this in action to fully understand it all. Program? How to implement the mixing? How do you go from mixing to checking the keys? Use one program to mix and then another to check the keys??

i am using gtx 970 and win10, how can i use kangaroo, i tried but can be run the kangaroo, can you help me?