<p>Zero. They are completely unrelated.</p>

<p>And if you think about that, it is quite obvious... otherwise it would be very easy to steal known addresses: you would just have to find a similar one.</p>

CC BY-SA 3.0
2013-02-14T11:14:20.487Z
2013-02-14T11:29:47.773Z
2013-02-14T11:29:47.773Z
o0'.
<p>Finding a vanity address is a random process. Even if we find an address with N letters we are interested in, it does not change anything about finding an address of N+1 letters.</p>

<p>Finding an additional letter in a vanity address pattern requires on average performing 58 times as many calculations as it took to find the original length.</p>

CC BY-SA 3.0
2013-02-14T12:32:15.127Z
2013-02-14T12:32:15.127Z
ThePiachu
<p>Is it easy to find out related vanity address '<strong>1googlex</strong>' if we already know '<strong>1google</strong>' vanity address pair, than through usual vanitygen iteration process? if yes, can this be extended further, like, '<strong>1googlexx</strong>', without exponentially increasing difficulty?</p>

CC BY-SA 3.0
2013-02-14T15:42:08.373Z
From answers I understand that it is also equally difficult for vanitygen tool to hit same pair twice (with no random number seed). right?
vi.su.
CC BY-SA 3.0
2013-02-15T03:57:50.100Z
I will add this as a separate question, by referring this question and answer page, for better visibility.
vi.su.
<vanity-address><vanitygen>
How easy is finding related vanity addresses?
vi.su.
# How easy is finding related vanity addresses?

(Asked by: username_0 on 2013-02-14)

Is it easy to find out related vanity address '**1googlex**' if we already know '**1google**' vanity address pair, than through usual vanitygen iteration process? if yes, can this be extended further, like, '**1googlexx**', without exponentially increasing difficulty?

**Tags:** vanity-address, vanitygen

> **Comments:**
> **username_0**: From answers I understand that it is also equally difficult for vanitygen tool to hit same pair twice (with no random number seed). right?  
> **username_0**: I will add this as a separate question, by referring this question and answer page, for better visibility.  

---

## 2 answers

### Answer by username_2 on 2013-02-14. Score: 3 | Accepted answer

Finding a vanity address is a random process. Even if we find an address with N letters we are interested in, it does not change anything about finding an address of N+1 letters.

Finding an additional letter in a vanity address pattern requires on average performing 58 times as many calculations as it took to find the original length.


---

### Answer by username_1 on 2013-02-14. Score: 4

Zero. They are completely unrelated.

And if you think about that, it is quite obvious... otherwise it would be very easy to steal known addresses: you would just have to find a similar one.


---

