Tool
Vanity address difficulty calculator
Find out how many attempts and how long your custom address pattern will take, before you start grinding.
Expected attempts: —
Average time: —
90% chance within: —
Don't know your speed? The CLI and desktop app run a 2-second benchmark when a grind starts and then show keys per second with a live ETA. Case-insensitive matching lowers the cost for letters.
Reference tables
Average time at one million keys per second. Real speed varies by chain, CPU and whether OpenCL GPU is used (EVM only).
Hex alphabet (16 symbols)
| Pattern length | Expected attempts | Average time @ 1M keys/s |
|---|---|---|
| 1 | 16 | under a second |
| 2 | 256 | under a second |
| 3 | 4,096 | under a second |
| 4 | 65,536 | under a second |
| 5 | 1.0 million | 1 second |
| 6 | 16.8 million | 17 seconds |
| 7 | 268 million | 4.5 minutes |
| 8 | 4.3 billion | 1.2 hours |
Base32 / bech32 alphabet (32 symbols)
| Pattern length | Expected attempts | Average time @ 1M keys/s |
|---|---|---|
| 1 | 32 | under a second |
| 2 | 1,024 | under a second |
| 3 | 32,768 | under a second |
| 4 | 1.0 million | 1 second |
| 5 | 33.6 million | 34 seconds |
| 6 | 1.1 billion | 18 minutes |
| 7 | 34.4 billion | 9.5 hours |
| 8 | 1.1 trillion | 13 days |
Base58 alphabet (58 symbols)
| Pattern length | Expected attempts | Average time @ 1M keys/s |
|---|---|---|
| 1 | 58 | under a second |
| 2 | 3,364 | under a second |
| 3 | 195,112 | under a second |
| 4 | 11.3 million | 11 seconds |
| 5 | 656 million | 11 minutes |
| 6 | 38.1 billion | 11 hours |
| 7 | 2.2 trillion | 26 days |
| 8 | 128 trillion | 4.1 years |
Base64url alphabet (64 symbols)
| Pattern length | Expected attempts | Average time @ 1M keys/s |
|---|---|---|
| 1 | 64 | under a second |
| 2 | 4,096 | under a second |
| 3 | 262,144 | under a second |
| 4 | 16.8 million | 17 seconds |
| 5 | 1.1 billion | 18 minutes |
| 6 | 68.7 billion | 19 hours |
| 7 | 4.4 trillion | 51 days |
| 8 | 281 trillion | 8.9 years |
Frequently asked questions
How is vanity address difficulty calculated?
Each position in the pattern must match one specific symbol, so the expected number of attempts is the alphabet size raised to the pattern length.
Why does one extra character make it so much slower?
Every additional character multiplies the expected work by the alphabet size: 16× for hex, 32× for bech32 or Base32, 58× for Base58, 64× for base64.
Does ignoring case make it faster?
Yes for letters, because both upper and lower case forms match. Digits have no case variant, so patterns made of digits do not get faster.
Is the time shown exact?
No. Finding a match is random; the average time is attempts divided by speed, and there is a 63% chance of finishing within that time and about 90% within 2.3× that time.