Few more questions:
Does the bug concerning the "wrong generated key" is reproducible and do you always get a wrong key every ~2500 matches ?
Does it happen without the -r option ?
Topic: VanitySearch (Yet another address prefix finder) - page 51. (Read 32966 times)
Hello
Thanks for the report.
I try with both CUDA8 and CUDA10 using -b option and I generated ~2^33 keys with the same pattern as you did.
It has also found ~5000 matches without error in my case using a GTX 645.
Concerning the timeout of your GT 520M try with -g 4, a CUDA kernel has a limit of execution time, searching with -b is longer.
I will make more test on other hardware ASAP.
Thanks for the report.
I try with both CUDA8 and CUDA10 using -b option and I generated ~2^33 keys with the same pattern as you did.
It has also found ~5000 matches without error in my case using a GTX 645.
Concerning the timeout of your GT 520M try with -g 4, a CUDA kernel has a limit of execution time, searching with -b is longer.
I will make more test on other hardware ASAP.
Code:
C:\C++\VanitySearch\x64\Release>VanitySearchCUDA8.exe -r 100000 -b -o output.txt -gpu 1TeS
VanitySearch v1.11
Difficulty: 4553521
Search: 1TeS [Compressed or Uncompressed]
Start Sat Apr 6 17:07:14 2019
Base Key: Randomly changed every 100000 Mkeys
Number of CPU thread: 3
GPU: GPU #0 GeForce GTX 645 (3x192 cores) Grid(24x128)
13.944 MK/s (GPU 12.859 MK/s) (2^33.43) [P 100.00%][99.00% in 00:00:00][5049]
Code:
C:\C++\VanitySearch\x64\Release>VanitySearch.exe -r 100000 -b -o output.txt -gpu 1TeS
VanitySearch v1.11
Difficulty: 4553521
Search: 1TeS [Compressed or Uncompressed]
Start Sat Apr 6 17:33:01 2019
Base Key: Randomly changed every 100000 Mkeys
Number of CPU thread: 3
GPU: GPU #0 GeForce GTX 645 (3x192 cores) Grid(24x128)
14.804 MK/s (GPU 13.716 MK/s) (2^33.51) [P 100.00%][99.00% in 00:00:00][5315]
Code:
[code]Hello
I noticed a few bugs without knowing where it might have come from?
Some error messages
first under CUDA 10 when the search is started with 3 pattern with GPU // without using GPU no problems
[code]
VanitySearch111.exe -gpu -r 1000000 -b -o vanity.txt 1TeS
VanitySearch v1.11
Difficulty: 4553521
Search: 1TeS [Compressed or Uncompressed]
Start Sat Apr 6 15:26:11 2019
Base Key: Randomly changed every 1000000 Mkeys
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
337.525 MK/s (GPU 324.861 MK/s) (2^32.33) [P 100.00%][99.00% in 00:00:00][2409]
Warning, wrong private key generated !
Addr :1TeSstduvsJfM9wAJ8UvjN41mvAy9U98J
Check:1BW7YEF2dEFYpymuysVHywrvQnFcJHMt3x
349.466 MK/s (GPU 338.776 MK/s) (2^33.45) [P 100.00%][99.00% in 00:00:00][5103]
Warning, wrong private key generated !
Addr :1TeSoeK3628J1GuTqSfcrUSp6UW45Ffmf
Check:1NwdtKgE7oH4CMdau7w37vHmWN4nuRaegW
The same search without using the GPU no error message seems to happen
Code:
VanitySearch111.exe -r 1000000 -b -o vanity.txt 1TeS
VanitySearch v1.11
Difficulty: 4553521
Search: 1TeS [Compressed or Uncompressed]
Start Sat Apr 6 15:29:51 2019
Base Key: Randomly changed every 1000000 Mkeys
Number of CPU thread: 6
12.683 MK/s (GPU 0.000 MK/s) (2^30.20) [P 100.00%][99.00% in 00:00:00][530]
4 Pattern with or without the -gpu command no error message
Code:
VanitySearch111.exe -gpu -r 1000000 -b -o vanity.txt 1TeST
VanitySearch v1.11
Difficulty: 264104224
Search: 1TeST [Compressed or Uncompressed]
Start Sat Apr 6 15:32:47 2019
Base Key: Randomly changed every 1000000 Mkeys
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
460.813 MK/s (GPU 450.125 MK/s) (2^34.85) [P 100.00%][99.00% in 00:00:00][232]
Code:
VanitySearch111.exe -r 1000000 -b -o vanity.txt 1TeST
VanitySearch v1.11
Difficulty: 264104224
Search: 1TeST [Compressed or Uncompressed]
Start Sat Apr 6 15:34:47 2019
Base Key: Randomly changed every 1000000 Mkeys
Number of CPU thread: 6
12.468 MK/s (GPU 0.000 MK/s) (2^31.08) [P 99.98%][99.00% in 00:00:00][13]
without using the -b command more error even with -gpu and 3 pattern
It seems that the calculation in uncompressed poses worries using the GPU with less than 4 pattern (CUDA 10) and prevents the launch of Vanitysearch under CUDA 8
Under CUDA error message using the -gpu and -b command while without any problem
Code:
VanitySearchCUDA8.111.exe -b -r 100000 -o vanity.txt 1TeS
VanitySearch v1.11
Difficulty: 4553521
Search: 1TeS [Compressed or Uncompressed]
Start Sat Apr 6 15:45:09 2019
Base Key: Randomly changed every 100000 Mkeys
Number of CPU thread: 4
1.724 MK/s (GPU 0.000 MK/s) (2^26.94) [P 100.00%][99.00% in 00:00:00][39]
with the command - gpu CUDA 8 with 3 or 4 pattern message error unless the -b command is not used
Code:
VanitySearchCUDA8.111.exe -gpu -b -r 100000 -o vanity.txt 1TeS
VanitySearch v1.11
Difficulty: 4553521
Search: 1TeS [Compressed or Uncompressed]
Start Sat Apr 6 15:48:40 2019
Base Key: Randomly changed every 100000 Mkeys
Number of CPU thread: 3
GPU: GPU #0 GeForce GT 520M (1x48 cores) Grid(8x128)
GPUEngine: Launch: the launch timed out and was terminated 00:00:00][0]
[/code]
VanitySearchCUDA8.111.exe -gpu -o vanity.txt 1TeST
VanitySearch v1.11
Difficulty: 264104224
Search: 1TeST [Compressed]
Start Sat Apr 6 15:54:54 2019
Base Key:486E8062406D92DBF21C6B8DB09A4733D7F2685A2E30FCC3714B400E5E6DECAD
Number of CPU thread: 3
GPU: GPU #0 GeForce GT 520M (1x48 cores) Grid(8x128)
9.482 MK/s (GPU 6.621 MK/s) (2^30.78) [P 99.91%][99.00% in 00:00:00][11]
[/CODE]
Code:
VanitySearchCUDA8.111.exe -gpu -b -o vanity.txt 1TeS
VanitySearch v1.11
Difficulty: 4553521
Search: 1TeS [Compressed or Uncompressed]
Start Sat Apr 6 16:01:48 2019
Base Key:719ACDC6941DEB67E424B31DB0A0592777C5297E7ABB21E6091DA47CA6A80C2F
Number of CPU thread: 3
GPU: GPU #0 GeForce GT 520M (1x48 cores) Grid(8x128)
GPUEngine: Launch: the launch timed out and was terminated 00:00:00][0]
Code:
VanitySearchCUDA8.111.exe -gpu -r 50000 -o vanity.txt 1TeS
VanitySearch v1.11
Difficulty: 4553521
Search: 1TeS [Compressed]
Start Sat Apr 6 15:59:00 2019
Base Key: Randomly changed every 50000 Mkeys
Number of CPU thread: 3
GPU: GPU #0 GeForce GT 520M (1x48 cores) Grid(8x128)
10.593 MK/s (GPU 7.053 MK/s) (2^28.05) [P 100.00%][99.00% in 00:00:00][56]
the use of the -b command by associating with the -gpu under CUDA 8 seems to prevent the launch of VanitySearch under CUDA 10 but with 3 pattern ex 1TeS error messages appear while from 4pattern ex 1TeST more error messages
That's strange, on my GTX 1050 Ti, CUDA8 is slightly slower (~3%) than CUDA10. On my GTX 645 it is similar.
Did you wait that key rate is well stabilized ?
Did you wait that key rate is well stabilized ?
ok that is correct Jean_Luc actually waiting 2min the stabilization between the 2 versions is much less important yes about 3% at me too
That's strange, on my GTX 1050 Ti, CUDA8 is slightly slower (~3%) than CUDA10. On my GTX 645 it is similar.
Did you wait that key rate is well stabilized ?
Did you wait that key rate is well stabilized ?
Code:
C:\C++\VanitySearch\x64\Release>VanitySearch.exe -t 0 -stop -gpu 1Testtttt
VanitySearch v1.11
Difficulty: 2988734397852221
Search: 1Testtttt [Compressed]
Start Thu Apr 4 14:18:30 2019
Base Key:28B34C47FDB37FB3175059450AFD3D301F682B2F16217EEE25AD83A42939A1B6
Number of CPU thread: 0
GPU: GPU #0 GeForce GTX 1050 Ti (6x128 cores) Grid(48x128)
226.483 MK/s (GPU 226.483 MK/s) (2^32.65) [P 0.00%][50.00% in 106.4d][0]
Code:
C:\C++\VanitySearch\x64\Release>VanitySearchCUDA8.exe -t 0 -stop -gpu 1Testtttt
VanitySearch v1.11
Difficulty: 2988734397852221
Search: 1Testtttt [Compressed]
Start Thu Apr 4 14:19:17 2019
Base Key:290C9148BE403FE1904ACA72641003E9B04507E30A054DA64DB732963C3080D0
Number of CPU thread: 0
GPU: GPU #0 GeForce GTX 1050 Ti (6x128 cores) Grid(48x128)
219.406 MK/s (GPU 219.406 MK/s) (2^32.04) [P 0.00%][50.00% in 109.8d][0]
Good morning,
I don’t know why but with CUDA 8 equivalent parameter seems to calculate +12% faster than CUDA 10
cuda 10
cuda 8
I don’t know why but with CUDA 8 equivalent parameter seems to calculate +12% faster than CUDA 10
cuda 10
Code:
-gpu 1Testtttt
VanitySearch v1.11
Difficulty: 2988734397852221
Search: 1Testtttt [Compressed]
Start Thu Apr 4 13:46:27 2019
Base Key:9FF416E41E27BCE6DCC117E3EC28D088EA16EB7CF988BEABDFE45490162F0C16
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
1222.410 MK/s (GPU 1195.740 MK/s) (2^36.49) [P 0.00%][50.00% in 19.7d][0]
cuda 8
Code:
VanitySearchCUDA8.111 -gpu 1Testtttt
VanitySearch v1.11
Difficulty: 2988734397852221
Search: 1Testtttt [Compressed]
Start Thu Apr 4 13:49:35 2019
Base Key:A9CEB9932E377B3FC4517C8AF508432AF71CEA2276FDF3E1E97FB0F0D02917F9
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
1369.064 MK/s (GPU 1342.856 MK/s) (2^34.54) [P 0.00%][50.00% in 17.6d][0]
Yes, P2WPKH-P2SH (starting with '3') addresses are slower, there are 2 hash160 to compute per address, only 1 for P2PKH (starting with '1') and P2WPKH-BECH32 (starting with 'bc1q').
Edit:
Interesting test, you notice also that the -r option is costly for nothing...
Edit:
Interesting test, you notice also that the -r option is costly for nothing...
1.11 available for CUDA8 
Super thanks Jean-Luc, look I just edited my top post to complete my tests I tried to be as complete as possible by showing various commands good -i and -o everyone will put what they want in -i
1.11 available for CUDA8
Hello, here are the results of my tests first on my old hardware Core I5-2430M - NVIDIA GEFORCE GT520M that only supports CUDA 8
Then another more efficient configuration
intel core i5-9600k 3.70 GHz RAM32 GO GPU NVIDIA 2070
everything works well including
using -i and -o. Prefixes starting with 3 seem longer to calculate, those starting with 1 and bc1 faster
Thanks again to Jean_Luc for this beautiful update and for all the new features, VanitySearch is now well done[/code]
Code:
VanitySearchCUDA10.111.exe 1Testrrr
VanitySearch v1.11
Difficulty: 51529903411245
Search: 1Testrrr [Compressed]
Start Wed Apr 3 18:26:55 2019
Base Key:D4098AD1EC1DEB76F2A73F99D5FB7C0BAE6DDD0E5D956D3EE5501891D2377A1D
Number of CPU thread: 4
4.175 MK/s (GPU 0.000 MK/s) (2^25.61) [P 0.00%][50.00% in 98.9d][0]
Then another more efficient configuration
intel core i5-9600k 3.70 GHz RAM32 GO GPU NVIDIA 2070
Code:
VanitySearch111.exe -gpu 1Testrrr
VanitySearch v1.11
Difficulty: 51529903411245
Search: 1Testrrr [Compressed]
Start Wed Apr 3 18:36:00 2019
Base Key:926C0B465C72AFA454BEBE9F16EECCD1BFCBF2520FACAD90CD1DE23141769E4B
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
1535.880 MK/s (GPU 1470.257 MK/s) (2^31.52) [P 0.01%][50.00% in 06:27:06][0]
[code]
VanitySearch111.exe -gpu 3BTestrrr
VanitySearch v1.11
Difficulty: 51529903411245
Search: 3BTestrrr [Compressed]
Start Wed Apr 3 18:43:07 2019
Base Key:307D1359B8316234060503DDD4664191869953DE79243998184856E717B631B1
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
665.464 MK/s (GPU 647.760 MK/s) (2^33.25) [P 0.02%][50.00% in 14:53:15][0]
Code:
VanitySearch111.exe -gpu -r 500000 3BTestrrr
VanitySearch v1.11
Difficulty: 51529903411245
Search: 3BTestrrr [Compressed]
Start Wed Apr 3 18:46:37 2019
Base Key: Randomly changed every 500000 Mkeys
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
672.639 MK/s (GPU 654.885 MK/s) (2^33.70) [P 0.03%][50.00% in 14:43:38][0]
Code:
VanitySearch111.exe -gpu -r 2000 -t 6 3Btestrrr
VanitySearch v1.11
Difficulty: 51529903411245
Search: 3Btestrrr [Compressed]
Start Wed Apr 3 18:48:13 2019
Base Key: Randomly changed every 2000 Mkeys
Number of CPU thread: 6
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
421.783 MK/s (GPU 405.673 MK/s) (2^33.37) [P 0.02%][50.00% in 23:29:17][0]
Code:
VanitySearch111.exe -gpu -r 1000 bc1qrmnttuss
VanitySearch v1.11
Difficulty: 1099511627776
Search: bc1qrmnttuss [Compressed]
Start Wed Apr 3 18:51:02 2019
Base Key: Randomly changed every 1000 Mkeys
Number of CPU thread: 5
GPU: GPU #0 GeForce RTX 2070 (36x64 cores) Grid(288x128)
947.492 MK/s (GPU 908.299 MK/s) (2^32.94) [P 0.75%][50.00% in 00:13:15][0]
everything works well including
using -i and -o. Prefixes starting with 3 seem longer to calculate, those starting with 1 and bc1 faster
Thanks again to Jean_Luc for this beautiful update and for all the new features, VanitySearch is now well done[/code]
Hello,
I just published the release 1.11 of VanitySearch:
https://github.com/JeanLucPons/VanitySearch/releases/tag/1.11
- Added support for segwit address P2SH and BECH32
I upload the windows release for CUDA8 asap.
Thanks for testing
I just published the release 1.11 of VanitySearch:
https://github.com/JeanLucPons/VanitySearch/releases/tag/1.11
- Added support for segwit address P2SH and BECH32
I upload the windows release for CUDA8 asap.
Code:
C:\C++\VanitySearch\x64\Release>VanitySearch.exe -stop -gpu 3Happy
VanitySearch v1.11
Difficulty: 264104224
Search: 3Happy [Compressed]
Start Wed Apr 3 08:50:51 2019
Base Key:D1D33873F77889F1BF84683A9119A2B369758438EB1D6256E56504497F9475E7
Number of CPU thread: 7
GPU: GPU #0 GeForce GTX 1050 Ti (6x128 cores) Grid(48x128)
129.830 MK/s (GPU 113.242 MK/s) (2^27.95) [P 62.59%][70.00% in 00:00:00][0]
Pub Addr: 3HappypJDDfhbj5HasnFmctzd8Up7B5tLR
Priv (WIF): p2wpkh-p2sh:L3q4EBHk5eiuxhsNagsmY5aK8sCNd6zdh6gmqpVG6S666GbvNgcP
Priv (HEX): 0xC5351D98B0B2DE1BD6B7CACADA9A2BE4E09B849FB8816D1CEEC5A08C63A3E837
Code:
C:\C++\VanitySearch\x64\Release>VanitySearch.exe -stop bc1queen
VanitySearch v1.11
Difficulty: 1048576
Search: bc1queen [Compressed]
Start Wed Apr 3 08:56:32 2019
Base Key:6F907FDE30067DCDE802739E47C6463FE49C32791242458C2D141212DB107A55
Number of CPU thread: 8
Pub Addr: bc1queenu8kq0vjrl509w88mwefdu4pztkdvlst4at
Priv (WIF): p2wpkh:L24UVC7ZYgYjy4cStQvBHD3quJkeYN3xHYBqFjTYjJjwmht84jsg
Priv (HEX): 0x906F8021CFF9823217FD8C61B839B9BED612AA6D9D065AAF92BE4C79F5251BBA
Thanks for testing
Just curious, why P2SH? AFAIK there's no benefits of P2SH over legacy addresses if it's only 1 on 1, and you pay more fees. P2SH with Segwit would be great though 
It is a first attempt, this is just to allow to run VanitySearch like this (for those who want a private address starting with 3).
Code:
-snip-
Pub Addr: 3PrivG5uq7hwXLyAHbYkFTnFkzx1FEWQdf
Priv (WIF): p2wpkh-p2sh:L2wAVD273GwAxGuEDHvrCqPfuWg5wWLZWy6H3hjsmhCvNVuCERAQ
Priv (HEX): 0xAA83217B3A11FCCFF8142EF0681AD774D7AB6822F574C4BB99CBF9B9DD01E7F2
For 2to2 segwit, I need to implement split private keys then generate a 2to2 address from 2 given public key, this is more complex but I will try to do it. That has no sense that VanitySearch output 2 full private keys in the same file, no ?
One question, 2to2 segwit is possible only with BECH32 format (bc1...) or it is also possible with Base58 (3...) ?
Ah, you meant a P2SH SegWit address. That makes more sense, I thought you were talking about a P2SH address without SegWit. I agree, there's really no point for supporting 2 of 2 multisig or any other multisig option because of how vanitygen works. If you want a challenge, trying to get split key verification working would be nice and probably more useful
2 of 2 SegWit should be possible with Base58 I believe. You can do 2 of 3 SegWit as shown in this transaction, so it makes sense that 2 of 2 is doable.
You mean a public address starting with 3 I guess?
Right
It is a first attempt, this is just to allow to run VanitySearch like this (for those who want a private address starting with 3).
You mean a public address starting with 3 I guess?
Thank you for implementing tho
Just curious, why P2SH? AFAIK there's no benefits of P2SH over legacy addresses if it's only 1 on 1, and you pay more fees. P2SH with Segwit would be great though
It is a first attempt, this is just to allow to run VanitySearch like this (for those who want a private address starting with 3).
Code:
C:\C++\VanitySearch\x64\ReleaseSM30>VanitySearch.exe -stop 3Priv
VanitySearch v1.11
Difficulty: 4553521
Search: 3Priv [Compressed]
Start Tue Apr 2 07:43:52 2019
Base Key:B0A317C56CF0CF3C63E118687C153CD1336F2D5DCE33A3ADB3CE5E4EEA401436
Number of CPU thread: 8
Pub Addr: 3PrivG5uq7hwXLyAHbYkFTnFkzx1FEWQdf
Priv (WIF): p2wpkh-p2sh:L2wAVD273GwAxGuEDHvrCqPfuWg5wWLZWy6H3hjsmhCvNVuCERAQ
Priv (HEX): 0xAA83217B3A11FCCFF8142EF0681AD774D7AB6822F574C4BB99CBF9B9DD01E7F2
VanitySearch v1.11
Difficulty: 4553521
Search: 3Priv [Compressed]
Start Tue Apr 2 07:43:52 2019
Base Key:B0A317C56CF0CF3C63E118687C153CD1336F2D5DCE33A3ADB3CE5E4EEA401436
Number of CPU thread: 8
Pub Addr: 3PrivG5uq7hwXLyAHbYkFTnFkzx1FEWQdf
Priv (WIF): p2wpkh-p2sh:L2wAVD273GwAxGuEDHvrCqPfuWg5wWLZWy6H3hjsmhCvNVuCERAQ
Priv (HEX): 0xAA83217B3A11FCCFF8142EF0681AD774D7AB6822F574C4BB99CBF9B9DD01E7F2
For 2to2 segwit, I need to implement split private keys then generate a 2to2 address from 2 given public key, this is more complex but I will try to do it. That has no sense that VanitySearch output 2 full private keys in the same file, no ?
One question, 2to2 segwit is possible only with BECH32 format (bc1...) or it is also possible with Base58 (3...) ?
2^256/2^160=79228162514264337593543950336
I just can't believe it. Did I count correctly? It is the number of collisions is associated with each address?
I just can't believe it. Did I count correctly? It is the number of collisions is associated with each address?
Hello,
Lots of interesting features to add
I think I will work first on P2SH (1to1) add (may be) segwit addresses.
Lots of interesting features to add
I think I will work first on P2SH (1to1) add (may be) segwit addresses.
Just curious, why P2SH? AFAIK there's no benefits of P2SH over legacy addresses if it's only 1 on 1, and you pay more fees. P2SH with Segwit would be great though
Hello,
Lots of interesting features to add
I think I will work first on P2SH (1to1) add (may be) segwit addresses.
Lots of interesting features to add
I think I will work first on P2SH (1to1) add (may be) segwit addresses.
I've got a basic explanation here if it's needed. I'm not sure of the technical differences between compressed and uncompressed addresses though.
Jump to: