Pages:
Author

Topic: VanitySearch (Yet another address prefix finder) - page 30. (Read 32966 times)

jr. member
Activity: 41
Merit: 1

Do you have the same issue with the 1.17 and CUDA 10.0 ?


self compiled 1.17 with cuda 10.2 -> NOT working
your exe 1.17       with cuda 10.2 -> working

your exe 1.17       with cuda 11   -> NOT working
your exe 1.18       with cuda 10.2 -> NOT working but no surprise
your exe 1.18       with cuda 11   -> NOT working bit of a surprise

self compiled 1.18 with cuda 11   -> not tested as of now

i was a litte frustrated because i couldnt figure out why my complies didnt work on 10.2 with 1.17 (compilation went ok exe just didnt work.. same error as above) also because a few weeks ago there was someone posting here that they didn't have any problems compiling 1.17 to a running state after a small issue he had.

and now with 1.18 and cuda 11 i'm totaly confused as to why.

PS: 1.17 with cuda 10.0 self compiled on linux was working fine, if i want to use it though i have to run this on a windows system..
sr. member
Activity: 462
Merit: 701
is there maybe some cuda environment setting i'm missing or havent set ?!

Do you have the same issue with the 1.17 and CUDA 10.0 ?

However I have significant speed loss if I am searching for a large number of prefixes.

When searching, are you using only compressed, both, only uncompressed ?
newbie
Activity: 12
Merit: 0


4Bk/s as in Billions? that's quite impressive. what is your rig consist of?

It is a rig of 8 gtx 1060 6gb and yes B stand for billion. I have 2 of that type and right now I am building one with 2080 super.
Since we are now in the billions, we should also use x Bk/s, because 4000 Mk/s is shit. I better write 4 Bk/s. With my new rig I can expect about 10 Bk/s.
However I have significant speed loss if I am searching for a large number of prefixes. With about 10k prefixes I am down to 700 Mk/s, but I just parsed some data and want to search for 10M prefixes. I dont know where the speed will be with so many prefixes. In oclvanitygen there were no impact on the speed - doesnt matter if you are looking for 10 or 10M prefixes. But vanitysearch is still 5-6 times faster with so many prefixes.

I was thinking of doing an FPGA, but with this much speed I dont need an FPGA. I probably just put more rigs on this task.




jr. member
Activity: 75
Merit: 2
Hi,

why is the software failing when I am looking for more than 50 prefixes?
It looses speed dramatically. With my Rig I have 4 Bk/s and the speed goes as I increase the number of prefixes.
Can you please fix it? So that it doesnt matter if you are looking for 50 prefixes or 5 000 000. Otherwise oclvanitygen would be better for a large number of prefixes.....


4Bk/s as in Billions? that's quite impressive. what is your rig consist of?
jr. member
Activity: 41
Merit: 1
thx 4 .18 !

though having the same problem i had with cuda 10.2 when self compiled but this time with you'r realeased 18.exe (cuda 11 is installed and working fine)

-check all fine
prefix search all fine (though not testet over 50 prefixes)
searching very few adresses runs a while but even below 100 adresses:

VanitySearch v1.18
Search: 73 addresses (Lookup size 37,[1,7]) [Compressed or Uncompressed]
Start Tue Jun 23 13:24:08 2020
Base Key: Randomly changed every 44400 Mkeys
Number of CPU thread: 0
GPU: GPU #0 GeForce RTX 2080 Ti (68x64 cores) Grid(544x512)
[852.29 Mkey/s][GPU 852.29 Mkey/s][Total 2^31.67][Prob 0.0%][50% in 3.76903e+31y][Found 0]  GPUEngine: Launch: an illegal memory access was encountered

is there maybe some cuda environment setting i'm missing or havent set ?!

thx up front...
newbie
Activity: 12
Merit: 0
Hi,

why is the software failing when I am looking for more than 50 prefixes?
It looses speed dramatically. With my Rig I have 4 Bk/s and the speed goes as I increase the number of prefixes.
Can you please fix it? So that it doesnt matter if you are looking for 50 prefixes or 5 000 000. Otherwise oclvanitygen would be better for a large number of prefixes.....
sr. member
Activity: 462
Merit: 701
I released the 1.18
- Port to CUDAv11
- Fixed wrong rare points

https://github.com/JeanLucPons/VanitySearch/releases
sr. member
Activity: 462
Merit: 701
If you can compile the last release, you can do:
Code:
pons@linpons:~/VanitySearch$ ./VanitySearch -cp 1A838B13505B26867
PrivAddr: p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZM21gaY8WN2CdwnTG57
PubKey: 0230210C23B1A047BC9BDBB13448E67DEDDC108946DE6DE639BCC75D47C0216B1B
Addr (P2PKH): 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe
Addr (P2SH): 32xNiwhBsssQikVNaRPzxpp4UZKc7F789h
Addr (BECH32): bc1q2tnk8f7acx4yl2q327xyj8qmcl74wqfhz3w3zh
newbie
Activity: 27
Merit: 0
Priv: 0x1A838B13505B26867
How to translate into an understandable type type HuhHuhHuh
Private Key WIF
51 characters base58, starts with a '5'   5HscGG8iqA7YnZPN9ZEPdJSHVsb5zuUVST9XFB4M1tQUWUbFsh3
Private Key WIF Compressed
52 characters base58, starts with a 'K' or 'L'   KwUNeMo5dZDuJ5wiLmG6sDxbpSHT4acLXLQcVZPmLutcR3MHSHN3
Private Key Hexadecimal Format (64 characters [0-9A-F]):  078B13055AB016486AF996FCD19DBD8AD528BE1D4F014845BC1D1E06E7BE38A8
newbie
Activity: 27
Merit: 0

If you collected * bat * as the above program does not start, help correct and fix the ERROR.
newbie
Activity: 5
Merit: 1
@Konstanting2


First try this:

Kangaroo.exe -l  

If is says: GPU #0

Then try this command:

Kangaroo.exe -t 0 -d 14 -gpu -ws -w 65save.txt -wi 30 -o 64save.txt 65.txt


If it says: GPU #1

Then:

Kangaroo.exe -t 0 -d 14 -gpu -gpuId 1 -ws -w 65save.txt -wi 30 -o 64save.txt 65.txt




This thread is for VanitySearch, you may get more help if you post here:

Jean Luc  Kangaroo:


https://bitcointalksearch.org/topic/pollards-kangaroo-ecdlp-solver-5244940

 Grin








newbie
Activity: 27
Merit: 0
Hello to all! To my questions, while there is no answer, help who can. I tried to compile the file myself, but it does not start, what did I do wrong? To output information to a separate file
Kangaroo.exe -t 0 -d 14 -gpu -gpuId 0 -w 65save.txt -wi 30 65.txt -o 64save.txt
save the kangaroo in a working file also did not start
Kangaroo.exe -t 0 -d 14 -gpu -gpuId 0 -w 65save.txt -wi 30 65.txt -ws:64save.txt

Kangaroo v1.9
Kangaroo [-v] [-t nbThread] [-d dpBit] [gpu] [-check]
         [-gpuId gpuId1[,gpuId2,...]] [-g g1x,g1y[,g2x,g2y,...]]
         inFile
 -v: Print version
 -gpu: Enable gpu calculation
 -gpuId gpuId1,gpuId2,...: List of GPU(s) to use, default is 0
 -g g1x,g1y,g2x,g2y,...: Specify GPU(s) kernel gridsize, default is 2*(MP),2*(Core/MP)
 -d: Specify number of leading zeros for the DP method (default is auto)
 -t nbThread: Secify number of thread
 -w workfile: Specify file to save work into (current processed key only)
 -i workfile: Specify file to load work from (current processed key only)
 -wi workInterval: Periodic interval (in seconds) for saving work
 -ws: Save kangaroos in the work file
 -wsplit: Split work file of server and reset hashtable
 -wm file1 file2 destfile: Merge work file
 -wmdir dir destfile: Merge directory of work files
 -wt timeout: Save work timeout in millisec (default is 3000ms)
 -winfo file1: Work file info file
 -m maxStep: number of operations before give up the search (maxStep*expected operation)
 -s: Start in server mode
 -c server_ip: Start in client mode and connect to server server_ip
 -sp port: Server port, default is 17403
 -nt timeout: Network timeout in millisec (default is 3000ms)
 -o fileName: output result to fileName
 -l: List cuda enabled devices
 -check: Check GPU kernel vs CPU
 inFile: intput configuration file

Please, if possible with examples of use. HELP!!!!
A few days ago I asked for help. After all, it’s not difficult for you. Thank you so much in advance !!!!!!!!
newbie
Activity: 149
Merit: 0
Are you planning to make the OpenGL version?
full member
Activity: 1232
Merit: 242
Shooters Shoot...
part 3 of private_to_address.py:
-snip-

Your script works fine with random numbers, but not with all numbers.
You should add some check and do not perform inverse for zero - it immediately lead to mistake.

Try for example to calculate address for private key 1,2,3,4,... or 13, or 2^109 or 2^110 or for number 1298074214633706907135958430033862 - it will not work for these numbers. There a lot of other numbers the script will not work.

leads to this error:
Code:
invb = inv(b5*b6,p)
ZeroDivisionError: invert() no inverse exists

I know, that function is not perfect. I have just fixed some (not all) errors.

If you need a correct function replace mul2G with mulG:

Code:
def mulG(d): # d -> d*G

dax, day =  0, 0

r = d%16
if (r > 0):
rr = 2*r-1
#dax, day = ax, ay #solo se d e' dispari
dax, day = G[rr-1], G[rr]

q = d>>4
i = 30 #2*(16-1)
while q > 0:
#ax, ay = double(ax,ay)
#ax, ay = G[i], G[i+1]
r = q%16
rr = 2*r+i-1
if (r > dax): #puo' succedere solo se dax = 0 e r > 0 cioe' la prima volta
dax, day = G[rr-1], G[rr]  #solo se d e' pari
elif (r):
dax, day = add(G[rr-1], G[rr], dax, day)  
q = q>>4                      
i = i + 30
return dax, day
@arulbero unlock your PMs please.
member
Activity: 170
Merit: 58
isn't what we use VanitySearch for? Or by 'to generate key for address' you mean to generate private key for a given address?

Aaa, you mean Kangaroo program by Jean Luc? It is just an another approach to find private key which generates given address. Recently the discussion in the topic is mostly theoretical, how to improve algorithm. On github of this project Jean Luc mentioned some documents/papers which you may want to read to learn more about this way of solving problem.
jr. member
Activity: 75
Merit: 2
Dear Jean Luc, please do a search --keyspace. You are a real programmer. You can do it. I ask you to. Hope to find the key with the program BitCrack lost(((  Want to find the address from the puzzle...  Sad

Doesn't this utility do that?
https://bitcointalksearch.org/topic/pollards-kangaroo-ecdlp-solver-5244940


I'm still struggling to understand what exactly does this program do.
Have read the thread, it only created more confusion especially with those kangaroos.
Could anyone please explain it in a nutshell, what it's for?


To generate key for address with a given prefix. You may use it if you want to have a bitcoin address which starts with 1Shlomo ;-)

isn't what we use VanitySearch for? Or by 'to generate key for address' you mean to generate private key for a given address?
member
Activity: 170
Merit: 58
Dear Jean Luc, please do a search --keyspace. You are a real programmer. You can do it. I ask you to. Hope to find the key with the program BitCrack lost(((  Want to find the address from the puzzle...  Sad

Doesn't this utility do that?
https://bitcointalksearch.org/topic/pollards-kangaroo-ecdlp-solver-5244940


I'm still struggling to understand what exactly does this program do.
Have read the thread, it only created more confusion especially with those kangaroos.
Could anyone please explain it in a nutshell, what it's for?


To generate key for address with a given prefix. You may use it if you want to have a bitcoin address which starts with 1Shlomo ;-)
jr. member
Activity: 75
Merit: 2
Dear Jean Luc, please do a search --keyspace. You are a real programmer. You can do it. I ask you to. Hope to find the key with the program BitCrack lost(((  Want to find the address from the puzzle...  Sad

Doesn't this utility do that?
https://bitcointalksearch.org/topic/pollards-kangaroo-ecdlp-solver-5244940


I'm still struggling to understand what exactly does this program do.
Have read the thread, it only created more confusion especially with those kangaroos.
Could anyone please explain it in a nutshell, what it's for?
sr. member
Activity: 462
Merit: 701

This utility is to find the key when you know the public key. Next puzzle is #120 ~1 or 2 month on 256 Tesla V100 Cheesy
If you want to attack #64, consider using https://github.com/Telariust/VanitySearch-bitcrack or bitcrack
member
Activity: 174
Merit: 12
Dear Jean Luc, please do a search --keyspace. You are a real programmer. You can do it. I ask you to. Hope to find the key with the program BitCrack lost(((  Want to find the address from the puzzle...  Sad

Doesn't this utility do that?
https://bitcointalksearch.org/topic/pollards-kangaroo-ecdlp-solver-5244940
Pages:
Jump to: