VanitySearch (Yet another address prefix finder) - page 50.

Lolo54

member

Activity: 117

Merit: 32

Hello, here are the results of my tests first on my old hardware Core I5-2430M - NVIDIA GEFORCE GT520M that only supports CUDA 8

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]

asche

legendary

Activity: 1484

Merit: 1489

I forgot more than you will ever know.

Quote from: Jean_Luc on April 03, 2019, 02:59:25 AM

Thank you so much. This tool is perfect now Cheesy

Jean_Luc

sr. member

Activity: 462

Merit: 696

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.

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 Wink

DarkStar_

legendary

Activity: 2758

Merit: 3282

Quote from: Jean_Luc on April 02, 2019, 02:46:24 AM

Quote from: DarkStar_ on April 01, 2019, 09:39:47 PM

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 Cheesy

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 Cheesy

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.

Jean_Luc

sr. member

Activity: 462

Merit: 696

Quote from: asche on April 02, 2019, 03:47:14 AM

You mean a public address starting with 3 I guess?

Right

asche

legendary

Activity: 1484

Merit: 1489

I forgot more than you will ever know.

Quote from: Jean_Luc on April 02, 2019, 02:46:24 AM

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

Jean_Luc

sr. member

Activity: 462

Merit: 696

Quote from: DarkStar_ on April 01, 2019, 09:39:47 PM

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 Cheesy

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

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...) ?

RobertPaulig

newbie

Activity: 7

Merit: 1

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?

DarkStar_

legendary

Activity: 2758

Merit: 3282

Quote from: Jean_Luc on April 01, 2019, 03:57:08 AM

Hello,

Lots of interesting features to add Wink

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 Cheesy

Jean_Luc

sr. member

Activity: 462

Merit: 696

Hello,

Lots of interesting features to add Wink

I think I will work first on P2SH (1to1) add (may be) segwit addresses.

Chris!

legendary

Activity: 1382

Merit: 1122

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.

asche

legendary

Activity: 1484

Merit: 1489

I forgot more than you will ever know.

Quote from: arulbero on March 31, 2019, 09:35:09 AM

Quote from: Jean_Luc on March 31, 2019, 08:23:08 AM

Ok, that means that the requester must know how to reconstruct the final private key.
Does Vanity pool support the needed methods ?
I just had a quick look on the site and there is not information on how to submit the partial private key (which format to use) and the reconstruction method.

Unfortunately I think that:

1) only uncompressed keys are considered

2) no other ways to reconstruct the key are considered

it is a old site. Maybe someone could organize a new site that supports the new options (at the end the final user doesn't care about the method to rebuild the private key, if it is sure and it works).

LoyceV does offer Vanity addys using that method. Maybe he has some insight to offer regarding this.

arulbero

legendary

Activity: 1914

Merit: 2071

Quote from: Jean_Luc on March 31, 2019, 08:23:08 AM

Ok, that means that the requester must know how to reconstruct the final private key.
Does Vanity pool support the needed methods ?
I just had a quick look on the site and there is not information on how to submit the partial private key (which format to use) and the reconstruction method.

Unfortunately I think that:

1) only uncompressed keys are considered

2) no other ways to reconstruct the key are considered

it is a old site. Maybe someone could organize a new site that supports the new options (at the end the final user doesn't care about the method to rebuild the private key, if it is sure and it works).

Jean_Luc

sr. member

Activity: 462

Merit: 696

Ok, that means that the requester must know how to reconstruct the final private key.
Does Vanity pool support the needed methods ?
I just had a quick look on the site and there is not information on how to submit the partial private key (which format to use) and the reconstruction method.

arulbero

legendary

Activity: 1914

Merit: 2071

Quote from: Jean_Luc on March 31, 2019, 05:43:32 AM

Quote from: arulbero on March 31, 2019, 04:58:43 AM

Another nice option would be adding the split-key generator, in this way could be solved these works :

https://vanitypool.appspot.com/availableWork

Yes that could be interesting.
But as we start with an offset (the given public key), can we still apply symmetry and endomorpshim optimization ?

Yes.

Let P be the public key (offset). Let be 'secret' the private key of P.

Let 's' be the start random private key you generate from the seed, and s*G = Q the current start point.

Instead of starting from P, you start from Q+P. Let's say Q' = Q + P

Now, you find a public key R' such that --> ripemd160(sha256(R')) = address with a certain prefix.

Your program works exactly like now, it finds only the private key of Q, not of Q'. Simply you get a partial key of Q instead of the final private key of Q'.

Now there are 3 possibilities:

if R' is a standard point (no symmetry / endo), then you have found R' = R + P and you know only the private key k of R (k*G = R), not the private key of R'. Then k is the correct partial private key.
The final user needs to add the k found to the secret private key of P (that he only knows) to get the final private key:

final private key = (k + secret) mod n (explanation: (k + secret)*G = k*G + secret*G = R + P = R')

if R' is a simmetric point, then R' = -(R + P). You found the private key k of -R (k*G = -R), nothing more.

The final user needs to build the final private key this way:

final private key = (k - secret) mod n (explanation: (k -secret)*G = k*G - secret*G = -R - P = R')

if R' is a endo point, then R' = lambda1*(R + P). (or lambda2)

You found the private key k of lambda1*R (k*G = lambda1*R), then:

final private key = ( k + lambda1*secret)) mod n
(explanation: (k + lambda1*secret)*G = k*G + lambda1*secret*G = lambda1*R + lambda1*P = R')

Jean_Luc

sr. member

Activity: 462

Merit: 696

Quote from: arulbero on March 31, 2019, 04:58:43 AM

Another nice option would be adding the split-key generator, in this way could be solved these works :

https://vanitypool.appspot.com/availableWork

Yes that could be interesting.
But as we start with an offset (the given public key), can we still apply symmetry and endomorpshim optimization ?

arulbero

legendary

Activity: 1914

Merit: 2071

Another nice option would be adding the split-key generator, in this way could be solved these works :

https://vanitypool.appspot.com/availableWork

Chris!

legendary

Activity: 1382

Merit: 1122

Very cool. I'm glad to see a compressed key option, but of course would love native segwit/P2SH as well (as I see has already been brought up).

I'll test it out when I have a chance! Thanks Jean_Luc for taking this on!

Lolo54

member

Activity: 117

Merit: 32

Hello, it seems to me faster

works perfectly

Code:

VanitySearchCUDA8..exe -gpu 1Testrrr
VanitySearch v1.10
Difficulty: 51529903411245
Search: 1Testrrr [Compressed]
Start Sat Mar 30 12:38:01 2019
Base Key:57AA37BF4DB32E5668B51B6599428CF30FB675996C0A10FDA84761AE0B3C3BE9
Number of CPU thread: 3
GPU: GPU #0 GeForce GT 520M (1x48 cores) Grid(8x128)
10.233 MK/s (GPU 7.026 MK/s) (2^27.89) [P 0.00%][50.00% in 40.4d][0]

Jean_Luc

sr. member

Activity: 462

Merit: 696

I updated the GitHub release and I added the CUDA8 binary.
I managed to work around the compiler issue.
No both CPU and GPU runs at nominal speed.

https://github.com/JeanLucPons/VanitySearch/releases/tag/1.10

Thanks to test Wink

Topic: VanitySearch (Yet another address prefix finder) - page 50. (Read 31225 times)