Pages:
Author

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

hero member
Activity: 952
Merit: 938
Hello

I try to understand big numbers I mean, thousand of years and so on.

Please write mi in words how many years it is:

1.055e+06y


One million and fifty five thousand years.

By that time some interesting things will happen:

Betelgeuse, one of the top ten brightest stars in our sky, will have exploded in a supernova. It will be so bright that it will be visible on Earth in day time. [1]

A couple of Uranus moons, Desdemona and Cressida, will probably have already collided with each other. [2]

inlovewiththedj will probably have obtained his vanity address. [3]

[1]: https://earthsky.org/brightest-stars/betelgeuse-will-explode-someday
[2]: https://astronomy.com/news/2017/09/uranus-colliding-moons
[3]: https://bitcointalksearch.org/topic/m.59427656
member
Activity: 313
Merit: 34
Please write mi in words how many years it is:

1.055e+06y
The simpler method is to just move the decimal point depending on the value of "e+number".

From your example:
1.055(e+06 = move by 6 decimal places)
10.55=  move by 1 place
105.5=  move by 2 places
1055.=  move by 3 places
10550.=  move by 4 places
105500.=  move by 5 places
1055000.=  move by 6 places

Other note: You can use your forum signature for off-topic messages.
You can access it in: "Profile->Forum Profile Information".

Thanks!



Am I correct with  6.02311e+07y?

6.02311    (e+07 = move by 7 decimal places)
60.2311      =  move by 1 place
602.311      =  move by 2 places
6023.11      =  move by 3 places
60231.1      =  move by 4 places
602311.      =  move by 5 places
6023110.      =  move by 6 places
60231100.      =  move by 7 places
use big calc
https://www.calculator.net/big-number-calculator.html
member
Activity: 93
Merit: 12
Please write mi in words how many years it is:

1.055e+06y
The simpler method is to just move the decimal point depending on the value of "e+number".

From your example:
1.055(e+06 = move by 6 decimal places)
10.55=  move by 1 place
105.5=  move by 2 places
1055.=  move by 3 places
10550.=  move by 4 places
105500.=  move by 5 places
1055000.=  move by 6 places

Other note: You can use your forum signature for off-topic messages.
You can access it in: "Profile->Forum Profile Information".

Thanks!



Am I correct with  6.02311e+07y?

6.02311    (e+07 = move by 7 decimal places)
60.2311      =  move by 1 place
602.311      =  move by 2 places
6023.11      =  move by 3 places
60231.1      =  move by 4 places
602311.      =  move by 5 places
6023110.      =  move by 6 places
60231100.      =  move by 7 places
legendary
Activity: 2394
Merit: 5531
Self-proclaimed Genius
Please write mi in words how many years it is:

1.055e+06y
The simpler method is to just move the decimal point depending on the value of "e+number".

From your example:
1.055(e+06 = move by 6 decimal places)
10.55=  move by 1 place
105.5=  move by 2 places
1055.=  move by 3 places
10550.=  move by 4 places
105500.=  move by 5 places
1055000.=  move by 6 places

Other note: You can use your forum signature for off-topic messages.
You can access it in: "Profile->Forum Profile Information".
hero member
Activity: 789
Merit: 1909
Quote
1.055e+06y
You can split such string into some pieces: "1.055", "e+06", "y". Then, "e+number" means "10^number", so in this case it is "1000000", you have six zeros, because of "+06". So, it means 1055000 years, because you have multiplication of "1.055" by one million, and that "y" in the end means "years".
member
Activity: 93
Merit: 12
Hello

I try to understand big numbers I mean, thousand of years and so on.

Please write mi in words how many years it is:

1.055e+06y



where can I find online calculator to count and show such big numbers to readable words?


Peace in Ukraine, death to Putin!!!!!!!!!
legendary
Activity: 3346
Merit: 2529
Escrow Service
368x128 is the default grid

GPU: GPU #2 NVIDIA GeForce RTX 3070 (46x0 cores) Grid(368x128)
GPU: GPU #1 NVIDIA GeForce RTX 3070 (46x0 cores) Grid(368x128)
GPU: GPU #0 NVIDIA GeForce RTX 3070 (46x0 cores) Grid(368x128)
hero member
Activity: 1423
Merit: 504
any ideas at which grid size, these 3070 cards run in best speed?

VanitySearch.exe -l
GPU #0 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.4 MB) (Multiple host threads)
GPU #1 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.5 MB) (Multiple host threads)
GPU #2 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.5 MB) (Multiple host threads)
Try for 368x128
hero member
Activity: 1423
Merit: 504


------
Take the RTX 3070 for example.
  Bitcrack gives out 800mk.
Vanitysearch, gives out 1600-1700mk.
So why not use vanitysearch for search, if it is twice as fast?
Therefore, I asked about the possibility of searching in a fixed range, in vanitysearch.
You can read up, I've answered this before.

When vanity search lands on a single private key, it actually checks that single key against 6 possibilities, because it is checking Point + endo1 + endo2 + symmetries. While vanitysearch modded is faster than bitcrack, the precompiled version is checking more points per single private key which is why the speed seems a lot faster.

this explains why 1 of 6 will be valid if split gen right?


Yes. But this is due only to the way the programs we use to reassemble the pieces for the final private key work.

Let s (Q = sG) be the secret private key (the public key). Only one person knows 's'.

Then he sends only Q to another person, who run a "split gen" program.

Usually "split gen" works like this:

it computes only (s+1)G = Q + G, (s+2)G = Q + 2G, …, (s+k)G = Q + kG = P

until it gets a public key P with a particular address.

The program knows only k (the partial private key).

Then you need to compute k' (k' G = P):

k' = (s + k)  mod n.


Now suppose you get P in this way: - (Q + kG) = P

then in order to get from the partial private key k the correct final private key k' = (-s -k) mod n
you need to know how k was obtained (exploiting the symmetry).


If you get P in this way: λ(Q + kG) = P

(exploiting the endomorphism) the correct final private k' will be: λ*(s + k) mod n   and so on.
I'm quoting this for research purposes.
bip32
Code:
ExtKey masterKey = new ExtKey();
Console.WriteLine("Master key : " + masterKey.ToString(Network.Main));
for (int i = 0 ; i < 5 ; i++)
{
 ExtKey key = masterKey.Derive((uint)i);
 Console.WriteLine("Key " + i + " : " + key.ToString(Network.Main));
}

base58
Code:
ExtPubKey masterPubKey = masterKey.Neuter();
for (int i = 0 ; i < 5 ; i++)
{
 ExtPubKey pubkey = masterPubKey.Derive((uint)i);
 Console.WriteLine("PubKey " + i + " : " + pubkey.ToString(Network.Main));
}

legendary
Activity: 3346
Merit: 2529
Escrow Service
any ideas at which grid size, these 3070 cards run in best speed?

VanitySearch.exe -l
GPU #0 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.4 MB) (Multiple host threads)
GPU #1 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.5 MB) (Multiple host threads)
GPU #2 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.5 MB) (Multiple host threads)
member
Activity: 78
Merit: 133
Sorry I made a new thread to not clutter this one up. Thank you both!
full member
Activity: 233
Merit: 253
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
I have a question. Recently there was a flood and a notebook containing a offline wallet was damage and it destroyed part of a WIF private key, so now I basically have:

Kw**********(I have the next 40 characters, just not posting for obvious reasons), so I am missing 10 characters in all.

I also have the public key. Is it possible to use this software to start a search at Kw... and iterate over the missing 10 characters with the known 40 characters also in the key.

For example : 1GuqEWwH5iRZ89oo5xw26FqmyZFMWZrtPi - is the public address

and for the WIF private key I'd have Kw**********JzXaqU2rcFSoaLaehAQHqoQX1cWCo92tAA3ihLJ7

basically I want to always have search for private key start at 'Kw', then search for missing 10, and end with 'JzXaqU2rcFSoaLaehAQHqoQX1cWCo92tAA3ihLJ7'

Any advice is appreciated and examples are even more appreciated

Thank you,
S.

The "K" at the beginning stands for an uncompressed private key so effectively one character is ruled out.

You should probably use bitcrack with a stride of "244 62 8 66 47 124 80 157 248 14 101 42 20 166 75 38 90 171 48 143 193 217 43 86 127 213 68 99 176 225 142 231 221 232 209 1 232 119 87 59 159 250 92" (these are grouped in three digits - where there's less than three digits then put zeros at the beginning).

Then you set the start range to "62 15 48 27 224 252 140 123 196 154 246 145 249 147 190 242 245 119 253 137 57 120 87 229 177 249 235 57 188 105 162 106 16 38 232 62 226 68 207 61 60 159 137 16 30 135 117 115 185 255 165 192" (3E 0F 30 1B E0 FC 8C 7B C4 9A F6 91 F9 93 BE F2 F5 77 FD 89 39 78 57 E5 B1 F9 EB 39 BC 69 A2 6A 10 26 E8 3E E2 44 CF 3D 3C 9F 89 10 1E 87 75 73 B9 FF A5 C0, or: w1111111111JzXa.....)

and the end range to "63 53 101 37 224 105 133 154 79 164 116 14 184 245 198 239 210 247 218 39 60 17 143 67 53 249 245 92 6 253 234 184 11 67 248 114 161 110 81 101 39 66 237 125 158 135 117 115 185 255 165 192" (3F 35 65 25 E0 69 85 9A 4F A4 74 0E B8 F5 C6 EF D2 F7 DA 27 3C 11 8F 43 35 F9 F5 5C 06 FD EA B8 0B 43 F8 72 A1 6E 51 65 27 42 ED 7D 9E 87 75 73 B9 FF A5 C0, or: wzzzzzzzzzzJzXa....).

Make sure you only search for uncompressed keys to speed things up.

In one command:

./bitcrack -u --keyspace 0x3E0F301BE0FC8C7BC49AF691F993BEF2F577FD89397857E5B1F9EB39BC69A26A1026E83EE244C F3D3C9F89101E877573B9FFA5C0:0x3F356525E069859A4FA4740EB8F5C6EFD2F7DA273C118F4335F9F55C06FDEAB80B43F872A16E5 1652742ED7D9E877573B9FFA5C0 --stride 2440620080660471240801572480141010420201660750380901710481431932170430861272130 68099176225142231221232209001232119087059159250092

It has a difficulty of log2(58**10) = 58.5798 bits, this is doable if you have a few GPUs.
member
Activity: 78
Merit: 133
I have a question. Recently there was a flood and a notebook containing a offline wallet was damage and it destroyed part of a WIF private key, so now I basically have:

Kw**********(I have the next 40 characters, just not posting for obvious reasons), so I am missing 10 characters in all.

I also have the public key. Is it possible to use this software to start a search at Kw... and iterate over the missing 10 characters with the known 40 characters also in the key.

For example : 1GuqEWwH5iRZ89oo5xw26FqmyZFMWZrtPi - is the public address

and for the WIF private key I'd have Kw**********JzXaqU2rcFSoaLaehAQHqoQX1cWCo92tAA3ihLJ7

basically I want to always have search for private key start at 'Kw', then search for missing 10, and end with 'JzXaqU2rcFSoaLaehAQHqoQX1cWCo92tAA3ihLJ7'

Any advice is appreciated and examples are even more appreciated

Thank you,
S.
newbie
Activity: 3
Merit: 0
Supports, I just do not know where to write and what I need to write. Here is an inscription from Github "Note: The current relase has been compiled with CUDA SDK 10.0, if you have a different release of the CUDA SDK, you may need to update CUDA SDK paths in VanitySearch.vcxproj using a text editor. The current nvcc option are set up to architecture starting at 3.0 capability, for older hardware, add the desired compute capabilities to the list in GPUEngine.cu properties, CUDA C/C++, Device, Code Generation."
legendary
Activity: 2394
Merit: 5531
Self-proclaimed Genius
Hello everyone, can you help me configure the program for searching on the GPU? Where and what to add? My graphics card gt 550ti CUDA installed version 8.
Test the "-l" argument first to see if your GPU is supported:
Code:
vanitysearch -l

If yes, you just have to add the argument -gpu when searching for a vanity prefix.
newbie
Activity: 3
Merit: 0
Hello everyone, can you help me configure the program for searching on the GPU? Where and what to add? My graphics card gt 550ti CUDA installed version 8.
full member
Activity: 206
Merit: 100
Wich version will run on a RTX3090 ?

I alwais get error when trying to run this software.

error is : GPUEngine: Launch: misaligned address
Do not use full address, if you have a full address you are looking for, delete the last 8-9 characters from the end of the address and the program will work fine on 30xx cards

Seems to work.

So, if i'm trying to "hack" into a lost wallet i just delete the last 8-9 digit of this wallet and it "should" look for it ?
legendary
Activity: 952
Merit: 1367
When using VanitySearch
What meaning about   Base Key: DA12E013325F12D6B68520E327847218128B788E6A9F2247BC104A0EE2818F44 ?

The initial key from which search starts.
If the initial key would be always the same, users who search for the same prefix would receive the same results (first key which fulfils criteria).
member
Activity: 406
Merit: 45
When using VanitySearch
What meaning about   Base Key: DA12E013325F12D6B68520E327847218128B788E6A9F2247BC104A0EE2818F44 ?
Pages:
Jump to: