Author

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

hero member
Activity: 583
Merit: 502
this is man 1AqEgLuT4V2XL2yQ3cCzjMtu1mXtJLVvww hacked:

1LzhS3k3e9Ub8i2W1V8xQFdB8n2MYCHPCa 2018-05-29
17aPYR1m6pVAacXg1PTDDU7XafvK1dxvhi  2018-09-08
15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz 2018-11-08 today

=$ 10,448

what hash 15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz.........

Code:
Private key : 00000000000000000000000000000000000000000000000001eb25c90795d61c
Public key  : a521a07e98f78b03fc1e039bc3a51408cd73119b5eb116e583fe57dc8db07aea  6fb15c871dd7cf7d287390acd4e09d41f705081a98d5fe3a930ca032525dbcdc
 

PrKey WIF c.: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjqtiAvYTJzYEmqup7b
Address c.  : 328660ef43f66abe2653fa178452a5dfc594c2a1
Address c.  : 15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz


 

Hi

Really impressive.
Could you provide a list of all the hex private keys of this puzzle that have been found so far?
from 1 to 57

Thanks.


They are listed in this thread, you just need to look for them. Cheers.
member
Activity: 245
Merit: 17
this is man 1AqEgLuT4V2XL2yQ3cCzjMtu1mXtJLVvww hacked:

1LzhS3k3e9Ub8i2W1V8xQFdB8n2MYCHPCa 2018-05-29
17aPYR1m6pVAacXg1PTDDU7XafvK1dxvhi  2018-09-08
15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz 2018-11-08 today

=$ 10,448

what hash 15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz.........

Code:
Private key : 00000000000000000000000000000000000000000000000001eb25c90795d61c
Public key  : a521a07e98f78b03fc1e039bc3a51408cd73119b5eb116e583fe57dc8db07aea  6fb15c871dd7cf7d287390acd4e09d41f705081a98d5fe3a930ca032525dbcdc
 

PrKey WIF c.: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjqtiAvYTJzYEmqup7b
Address c.  : 328660ef43f66abe2653fa178452a5dfc594c2a1
Address c.  : 15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz


 

Hi

Really impressive.
Could you provide a list of all the  hex private keys of this puzzle that have been found so far?
from 1 to 57



Thanks.
jr. member
Activity: 184
Merit: 3
this time he quickly found it turned out, got a taste. Arulbero thx.

Another formula (of success. just to be)

                     puzzle  : 128  =                                           = 128 :  2^                      2^ -
53    6763683971478124    52841281027172  |   70368744177664   9007199254740992      8954357973713820
54    9974455244496707    77925431597630  | 140737488355328  18014398509481984    17936473077884354    
55  30045390491869460   234729613217730  | 281474976710656  36028797018963968    35794067405746238  
56  44218742292676575   345458924161535  | 562949953421312  72057594037927936    71712135113766401
57 138245758910846492 1080044991490988  |1125899906842624 144115188075855872  143035143084364884
                                                                                          288230376151711744

288230376151711744 : 128 = 2251799813685248  
                        
                                                        :128:128:128:128:128  
      70368744177664     69955921669639    2048  2035  13
    140737488355328    140128695920971    4096  4078  18
    281474976710656    279641151607392    8192  8138  54  
    562949953421312    560251055576300   16384 16305 79
  1125899906842624   1117462055346600   32768 32522 246
2251799813685248                              65536

for example the previous puzzle number 57. 144115188075855872 - 1080044991490988 = 143035143084364884
144115188075855872 : 128 = 1125899906842624
143035143084364884 : 128 = 1117462055346600
1125899906842624 - 1117462055346600 * 128 * 128 = 138245758910857216 practically what we need

look at the bin of the second column

1111111001111111100001110111000110111000000111
11111110011 (2035)
11111110111001001000001001001001010100101001011
111111101110 (4078)
111111100101010100000111100000011001001001100000
1111111001010 (8138)
1111111011000101110011101001001110001010011101100
11111110110001 (16305)
11111110000101001101101000110110111110000110101000
111111100001010 (32522)

111111100000000000000000000000000000000000000000000
1111111000000000 (65024-65279)

first bytes 11111110... + always 35 random bytes (here the right side increases)

for the 58 puzzle will 256 options beginning with 1111111000000000 (65024) finishing up 1111111011111111 (65279)

take these 256 initial parts and add random 35 bits for each and from the received number we take about 15000-20000 with - 1 step, profit Cheesy

***

by zeros here we got in 58 11110101 10010010 11100100 10000011 11001010 11101011 00001110 0 28-29 almost equally divided 000000000000000000000000000011111111111111111111111111111

***

and to the extent

56.940012835374135824
55.295507509568065689
54.737993190511333013
53.147159473916182226
52.586730675690989872
51.904965885818221825
50.870703748687580964
49.118497410306637905
48.539513532885657356
47.442128478217754077
46.766014580697737785
45.547076931749783679
44.184810076602017917
43.808441604030467369
42.752573892536879788
41.396887129359569265

2^57
10100110110100011011011111000011010100010101010110000
101100010111001110100100111000101001110101111111111010000
110010101010000011110000001100100100110000001111011111000
111011100100100000100100100101010010100101110000010110110
111100111111110000111011100011011100000011100110110100010
111110001000001010001111010011011001101000110000111000110
111111000101011111000111101011110010111111111011000101011
111111101110101000010101111000011110100010110110010101100
111111110100010111110100010010100111111101010000010110100
legendary
Activity: 1968
Merit: 2130
this is man 1AqEgLuT4V2XL2yQ3cCzjMtu1mXtJLVvww hacked:

1LzhS3k3e9Ub8i2W1V8xQFdB8n2MYCHPCa 2018-05-29
17aPYR1m6pVAacXg1PTDDU7XafvK1dxvhi  2018-09-08
15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz 2018-11-08 today

=$ 10,448

what hash 15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz.........

Code:
Private key : 00000000000000000000000000000000000000000000000001eb25c90795d61c
Public key  : a521a07e98f78b03fc1e039bc3a51408cd73119b5eb116e583fe57dc8db07aea  6fb15c871dd7cf7d287390acd4e09d41f705081a98d5fe3a930ca032525dbcdc
 

PrKey WIF c.: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjqtiAvYTJzYEmqup7b
Address c.  : 328660ef43f66abe2653fa178452a5dfc594c2a1
Address c.  : 15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz
newbie
Activity: 54
Merit: 0
this is man 1AqEgLuT4V2XL2yQ3cCzjMtu1mXtJLVvww hacked:

1LzhS3k3e9Ub8i2W1V8xQFdB8n2MYCHPCa 2018-05-29
17aPYR1m6pVAacXg1PTDDU7XafvK1dxvhi  2018-09-08
15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz 2018-11-08 today

=$ 10,448

what hash 15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz.........
legendary
Activity: 1968
Merit: 2130
My answer was a general answer to a general question about the two forms of Bitcoin address and was not meant to be a technical paper or exact description of how to create Bitcoin addresses (that is what the wiki is for).  

So, I started out with "Leaving out some small details:".

Thanks for filling in a few of the technical details.

Ok, but anyway I don't understand "257 bit", this value is not correct at all. Or 512 bit and 256 bit, or 8+512 bit and 8+256 bit.


BTW, even with the additional details, the description is still incomplete because you left out the checksum in the hashing description.

No, the address in the blockchain's blocks (and in the UTXO data set) are stored exactly this way: ripemd160(sha256('02' or '03' + 'x'), 160 bit, no checksum, no base58 encode.

Example:

private key = 01
address = 91B24BF9F5288532960AC687ABB035127B1D28A5  (step 3, address for the blockchain)
address = 1EHNa6Q4Jz2uvNExL497mE43ikXhwF6kZm (checksum + base58) (step 9, address for human people)

Check with http://gobittest.appspot.com/Address  or https://www.blockchain.com/it/btc/address/91B24BF9F5288532960AC687ABB035127B1D28A5

Now if we look at a tx that funds the address 91B24BF9F5288532960AC687ABB035127B1D28A5 /  1EHNa6Q4Jz2uvNExL497mE43ikXhwF6kZm :

https://www.blockchain.com/btc/tx/6797afc4d9b91fb9b283fedddec4e35b00d54063d73bb0d3e97f3537ed8fff3c?show_adv=true

output script: DUP HASH160 PUSHDATA(20)[91b24bf9f5288532960ac687abb035127b1d28a5] EQUALVERIFY CHECKSIG

The address in the "1EHNa6Q4Jz2uvNExL497mE43ikXhwF6kZm" format is only for human people.
legendary
Activity: 2646
Merit: 1138
All paid signature campaigns should be banned.
My answer was a general answer to a general question about the two forms of Bitcoin address and was not meant to be a technical paper or exact description of how to create Bitcoin addresses (that is what the wiki is for).  

So, I started out with "Leaving out some small details:".

Thanks for filling in a few of the technical details.

BTW, even with the additional details, the description is still incomplete because you left out the checksum in the hashing description.

Anyone who wants to know all the nitty gritty details can look it up.
legendary
Activity: 1968
Merit: 2130
I did a quick write up on compressed versus uncompressed Bitcoin addresses here:

https://bitcointalksearch.org/topic/m.45500313

To get the Bitcoin address from the public key you either:

1) Take the full 512 bit public key (X, Y) and hash it down to 256 bits, then hash it down to 160 bits then encode the answer.

or

2) Take the 257 bit compressed public key (X, b) and hash it down to 256 bits, then hash it down to 160 bits then encode the answer.


Red lines are not correct:


public uncompressed key :  '04' + 'x' + 'y'

public compressed    key  : '02' or '03' + 'x'  (02 if y is even, 03 if y is odd)

https://github.com/bitcoinbook/bitcoinbook/blob/develop/images/mbc2_0407.png




address 'uncompressed' =  ripemd160(sha256('04' + 'x' + 'y')

address 'compressed' =  ripemd160(sha256('02' or '03' + 'x')

https://github.com/bitcoinbook/bitcoinbook/blob/develop/images/mbc2_0405.png


newbie
Activity: 2
Merit: 0
Thank you arulbero and BurtW!!

Now i can get to the good stuff. Really appreciate it!
legendary
Activity: 2646
Merit: 1138
All paid signature campaigns should be banned.
Hi guys, I'm trying to understand the procedure to solving this puzzle, starting from the easy ones that were solved already. Im clearly a little over my head here, and I cannot figure out what I am doing wrong.

I have this code so far, which gives me the same results as this website (https://brainwalletx.github.io/#generator), but they never match what I see here. So clearly i'm doing something wrong

Code:
let bitcoin = require('bitcoinjs-lib');

let pvk_seed = '000000000000000000000000000000000011';
let hash = bitcoin.crypto.sha256(pvk_seed);
const keyPair = bitcoin.ECPair.fromPrivateKey(hash);
const { address } = bitcoin.payments.p2pkh({ pubkey: keyPair.publicKey });

let wif = keyPair.toWIF();

console.log(`${pvk_seed} = Address ${address}, WIF : ${wif}`)


That code is using 3 to generate PVK, ive tried 3 in Decimal, Binary, Hex, nothing works.

Thanks for any tips



If you put 0000000000000000000000000000000000000000000000000000000000000003
here -> https://www.bitaddress.org/bitaddress.org-v3.3.0-SHA256-dec17c07685e1870960903d8f58090475b25af946fe95a734f88408cef4aa194.html
(wallet details)

you'll get 2 addresses:

Bitcoin Address (Uncompressed)
1NZUP3JAc9JkmbvmoTv7nVgZGtyJjirKV1

Bitcoin Address Compressed
1CUNEBjYrCn2y1SdiUMohaKUi4wpP326Lb

In this case the address in puzzle transaction is the last one.

Look here : https://github.com/bitcoinjs/bitcoinjs-lib/issues/155

I did a quick write up on compressed versus uncompressed Bitcoin addresses here:

https://bitcointalksearch.org/topic/m.45500313

in case you want more technical details.
legendary
Activity: 1968
Merit: 2130
Hi guys, I'm trying to understand the procedure to solving this puzzle, starting from the easy ones that were solved already. Im clearly a little over my head here, and I cannot figure out what I am doing wrong.

I have this code so far, which gives me the same results as this website (https://brainwalletx.github.io/#generator), but they never match what I see here. So clearly i'm doing something wrong

Code:
let bitcoin = require('bitcoinjs-lib');

let pvk_seed = '000000000000000000000000000000000011';
let hash = bitcoin.crypto.sha256(pvk_seed);
const keyPair = bitcoin.ECPair.fromPrivateKey(hash);
const { address } = bitcoin.payments.p2pkh({ pubkey: keyPair.publicKey });

let wif = keyPair.toWIF();

console.log(`${pvk_seed} = Address ${address}, WIF : ${wif}`)


That code is using 3 to generate PVK, ive tried 3 in Decimal, Binary, Hex, nothing works.

Thanks for any tips



If you put 0000000000000000000000000000000000000000000000000000000000000003
here -> https://www.bitaddress.org/bitaddress.org-v3.3.0-SHA256-dec17c07685e1870960903d8f58090475b25af946fe95a734f88408cef4aa194.html
(wallet details)

you'll get 2 addresses:

Bitcoin Address (Uncompressed)
1NZUP3JAc9JkmbvmoTv7nVgZGtyJjirKV1

Bitcoin Address Compressed
1CUNEBjYrCn2y1SdiUMohaKUi4wpP326Lb

In this case the address in puzzle transaction is the last one.

Look here : https://github.com/bitcoinjs/bitcoinjs-lib/issues/155
newbie
Activity: 2
Merit: 0
Hi guys, I'm trying to understand the procedure to solving this puzzle, starting from the easy ones that were solved already. Im clearly a little over my head here, and I cannot figure out what I am doing wrong.

I have this code so far, which gives me the same results as this website (https://brainwalletx.github.io/#generator), but they never match what I see here. So clearly i'm doing something wrong

Code:
let bitcoin = require('bitcoinjs-lib');

let pvk_seed = '000000000000000000000000000000000011';
let hash = bitcoin.crypto.sha256(pvk_seed);
const keyPair = bitcoin.ECPair.fromPrivateKey(hash);
const { address } = bitcoin.payments.p2pkh({ pubkey: keyPair.publicKey });

let wif = keyPair.toWIF();

console.log(`${pvk_seed} = Address ${address}, WIF : ${wif}`)


That code is using 3 to generate PVK, ive tried 3 in Decimal, Binary, Hex, nothing works.

Thanks for any tips

legendary
Activity: 3808
Merit: 1723
Looks like the LBC is behind and someone else is solving these puzzles.

Looks like you've been sleeping for too long  Grin Stupid rico is still continuing on depleted 55-range. Of course not a single sane person will participate in LBC now.

I am pretty sure some large farm of >1000 GPUs or so switched from mining ETH to solving these private keys, already 2 of them were solved beating LBC pretty much.

Maybe a Martian Colony of Sectoids awoke to snatch our precious 32BTC!

p.s. If you do a simple math, you'll see that the guy who took puzzle 55 and puzzle 56 only have speed of 1000 megakeys. That's less than LBC had several months ago. If rico wasn't such a worthless project manager, this could be LBC. Now sane people use BitCrack, it makes 1000megakeys with only two gtx1080ti.  Shocked

I might have to look into the BitCrack program, if a pair of 1080ti can reach 1GH/s then it might still be worth scanning for.

The LBC is still scanning the 55th range probably because they can't skip over and jump ahead, they probably didn't realise that someone would be doing this solo.

It would be best if there was some pool for searching for these keys, then it would be fair for everybody. But now it seems risky because you start scanning, find nothing after a month or so and then someone already found the key right ahead of you. No idea how many people now are scanning for these keys instead of mining ETH.
hero member
Activity: 583
Merit: 502
This puzle has 32 BTC prizes, then what is the motive behind the person who gave 32 BTC to use as a public donation for those who can decode?
32 BTC is a lot, it's like a treasure that can be solved by anyone, even though it's not easy.


It is a test, and back then BTC wasn't that expensive.
hero member
Activity: 1470
Merit: 558
dont be greedy
This puzle has 32 BTC prizes, then what is the motive behind the person who gave 32 BTC to use as a public donation for those who can decode?
32 BTC is a lot, it's like a treasure that can be solved by anyone, even though it's not easy.
jr. member
Activity: 115
Merit: 1
Looks like the LBC is behind and someone else is solving these puzzles.

Looks like you've been sleeping for too long  Grin Stupid rico is still continuing on depleted 55-range. Of course not a single sane person will participate in LBC now.

I am pretty sure some large farm of >1000 GPUs or so switched from mining ETH to solving these private keys, already 2 of them were solved beating LBC pretty much.

Maybe a Martian Colony of Sectoids awoke to snatch our precious 32BTC!

p.s. If you do a simple math, you'll see that the guy who took puzzle 55 and puzzle 56 only have speed of 1000 megakeys. That's less than LBC had several months ago. If rico wasn't such a worthless project manager, this could be LBC. Now sane people use BitCrack, it makes 1000megakeys with only two gtx1080ti.  Shocked
legendary
Activity: 3808
Merit: 1723
Looks like the LBC is behind and someone else is solving these puzzles.

I am pretty sure some large farm of >1000 GPUs or so switched from mining ETH to solving these private keys, already 2 of them were solved beating LBC pretty much.

Its too bad because with each solved puzzle, the work required basically doubles and so does the time. Probably not worth using the GPU to solve from here on out, unless that Vanitygen software gets improved and gets a faster speed. I think the most I could get out of that was like 75MH/s from an RX 470 highly overclocked.
jr. member
Activity: 184
Merit: 3
Quote
OK I have done the installation steps, how I actually run your program/code in Anaconda with numba?
Look in the (google) manual on numba jit. jit does not speed up every "own" random in python.
acceleration example from google.

Quote
from numba import jit
import numpy
import time
#from bit import *
#import secrets
#from bitcoin import *

start_time = time.time()

@jit
def inner_func(a_list, b_list):
    sum = 0
    j = 0
    for y in range(0, 16):
        for x in range(0, 16):
            p = a_list[j] - b_list[j]
            sum += p * p
            j += 1
            
    return sum


@jit
def outer_func(a_list, b_list):
    sum = 0
    for g in range(0, 100000000):  # 100 000 000 == 10^8 !!!
        sum += inner_func(a_list, b_list)
        
    return sum


def main():
    
    maxint = numpy.iinfo(numpy.intc).max
    a_list = numpy.random.randint(maxint, size=256)
    b_list = numpy.random.randint(maxint, size=256)
    sum = outer_func(a_list, b_list)
    print(sum)
    
    


if __name__ == '__main__':
    main()

print("--- %s seconds ---" % (time.time() - start_time))


100 000 000 for a 30 second well cpu is not bad, but that's until we started converting the numbers into bitcoin addresses (((

example with the fastest Bitcoin library "bit" without it, the cycle 1000000 takes ~0.4 sec. with her (remove #) ~123,3! sec o_O

Quote
import time
from bit import *
from numba import jit
import random

@jit
def ran():
    a = random.randint(50028797018963968,66057594037927936)
    return a

start_time = time.time()

i = 1000000
while i >= 1:
    #ran()
    #k=Key()
    #k.address

    
    i = i -1

print("--- %s seconds ---" % (time.time() - start_time))
   

example with a random access passage from "01111111111111111111111111111111111111111111111111111111" to "00000000000000000000000000000000000000000000000000000001" each shuffle 1000 times

Quote
import random
from bit import *
from PyRandLib import *
rand = FastRand63()
random.seed(rand())

c1 = str (random.choice("1"))
b1  = "01111111111111111111111111111111111111111111111111111111"
b2  = "00111111111111111111111111111111111111111111111111111111"
b3  = "00011111111111111111111111111111111111111111111111111111"
b4  = "00001111111111111111111111111111111111111111111111111111"
b5  = "00000111111111111111111111111111111111111111111111111111"
b6  = "00000011111111111111111111111111111111111111111111111111"
b7  = "00000001111111111111111111111111111111111111111111111111"
b8  = "00000000111111111111111111111111111111111111111111111111"
b9  = "00000000011111111111111111111111111111111111111111111111"
b10 = "00000000001111111111111111111111111111111111111111111111"
b11 = "00000000000111111111111111111111111111111111111111111111"
b12 = "00000000000011111111111111111111111111111111111111111111"
b13 = "00000000000001111111111111111111111111111111111111111111"
b14 = "00000000000000111111111111111111111111111111111111111111"
b15 = "00000000000000011111111111111111111111111111111111111111"
b16 = "00000000000000001111111111111111111111111111111111111111"
b17 = "00000000000000000111111111111111111111111111111111111111"
b18 = "00000000000000000011111111111111111111111111111111111111"
b19 = "00000000000000000001111111111111111111111111111111111111"
b20 = "00000000000000000000111111111111111111111111111111111111"
b21 = "00000000000000000000011111111111111111111111111111111111"
b22 = "00000000000000000000001111111111111111111111111111111111"
b23 = "00000000000000000000000111111111111111111111111111111111"
b24 = "00000000000000000000000011111111111111111111111111111111"
b25 = "00000000000000000000000001111111111111111111111111111111"
b26 = "00000000000000000000000000111111111111111111111111111111"
b27 = "00000000000000000000000000011111111111111111111111111111"
b28 = "00000000000000000000000000001111111111111111111111111111"
b29 = "00000000000000000000000000000111111111111111111111111111"
b30 = "00000000000000000000000000000011111111111111111111111111"
b31 = "00000000000000000000000000000001111111111111111111111111"
b32 = "00000000000000000000000000000000111111111111111111111111"
b33 = "00000000000000000000000000000000011111111111111111111111"
b34 = "00000000000000000000000000000000001111111111111111111111"
b35 = "00000000000000000000000000000000000111111111111111111111"
b36 = "00000000000000000000000000000000000011111111111111111111"
b37 = "00000000000000000000000000000000000001111111111111111111"
b38 = "00000000000000000000000000000000000000111111111111111111"
b39 = "00000000000000000000000000000000000000011111111111111111"
b40 = "00000000000000000000000000000000000000001111111111111111"
b41 = "00000000000000000000000000000000000000000111111111111111"
b42 = "00000000000000000000000000000000000000000011111111111111"
b43 = "00000000000000000000000000000000000000000001111111111111"
b44 = "00000000000000000000000000000000000000000000111111111111"
b45 = "00000000000000000000000000000000000000000000011111111111"
b46 = "00000000000000000000000000000000000000000000001111111111"
b47 = "00000000000000000000000000000000000000000000000111111111"
b48 = "00000000000000000000000000000000000000000000000011111111"
b49 = "00000000000000000000000000000000000000000000000001111111"
b50 = "00000000000000000000000000000000000000000000000000111111"
b51 = "00000000000000000000000000000000000000000000000000011111"
b52 = "00000000000000000000000000000000000000000000000000001111"
b53 = "00000000000000000000000000000000000000000000000000000111"
b54 = "00000000000000000000000000000000000000000000000000000011"
b55 = "00000000000000000000000000000000000000000000000000000001"
#xx = "00000000000000000000000000000000000000000000000000000001"

while True:
    spisok = [b1,b2,b3,b4,b5,b6,b7,b8,b9,b10,b11,b12,b13,b14,b15,b16,b18,b19,b20,b21,b22,b23,b24,b25,b26,b27,b28,b30,b31,b32,b33,b34,b35,b36,b37,b38,b39,b40,b41,b42,b43,b44,b45,b46,b47,b48,b49,b50,b51,b52,b53,b54,b55]
    for element in (spisok):
        for spisok in range(1000):
            s = element
            d = ''.join(random.sample(s,len(s)))
            bina = (c1+d)
            b = int(c1+d,2)
            key = Key.from_int(b)
            addr = key.address
            if addr == "15c9mPGLku1HuW9LRtBf4jcHVpBUt8txKz":
                print ("found!!!",b,addr)
                s1 = str(b)
                s2 = addr
                f=open(u"C:/a.txt","a")
                f.write(s1)
                f.write(s2)      
                f.close()
                pass
            else:
                print (s,bina,b,addr)
    pass

"print" slows down speed so you can not use it (#bina = (c1+d),pass #print (s,bina,b,addr)) and shorten the "spisok" but use @jit here useless bottle neck "bitcoin lib".
newbie
Activity: 15
Merit: 0
jr. member
Activity: 115
Merit: 1
Andzhig read this article at last!

https://en.wikipedia.org/wiki/Random_number_generation

Your pollutions are not funny to read any more.
Jump to: