Estimate vanity address

Estimate average brute-force work for an exact hexadecimal address prefix from measured attempts per second.

freeworks offlinenothing uploaded
ToolVanity Address Estimator
Input
Output
—
Put this on your own site

The frame below runs the same code as this page, in the reader's own browser. Nothing is sent to us, and nothing is sent to you.

Pick a dark background and the text and panels follow it, so the frame stays readable on a dark page.

Preview

How it works

Each fixed hexadecimal character contributes four bits, so an n-character prefix succeeds with probability 1 ÷ 16ⁿ per independent uniform attempt. Expected attempts are 16ⁿ, and dividing by throughput gives mean time rather than a deadline.

Formula
expected attempts = 16ⁿ
  • Hash rate must be measured or supplied because hardware and generation code determine it.
  • The geometric waiting process has no guaranteed completion at its mean.

Worked example

Estimate vanity address
Input
											Hex characters: 6
Attempts per second: 1000000
Output
												Average attempts: 16777216
Seconds: 16.78
Hours: 0
Probability per attempt: 5.960464477539063e-8
Note: Expected average, not a guarantee; each valid address remains equally likely.

When to use this

Ethereum developers budget cosmetic prefixes, benchmark results become time estimates, and security reviews compare prefix length with brute-force work.

Edge cases

  • Six prefix characters require 16⁶ expected trials, not six multiplied by sixteen.
  • Finishing later than the expected count is entirely possible because every unsuccessful attempt leaves the same next-attempt probability.
  • Mixed-case checksum display does not add entropy to the underlying hexadecimal address bytes.