BTCRecover search-space calculator

Calculate a simple search

Enter counts only, never passwords or seed words. A value of 1 means that position is fixed. This calculator runs locally in your browser and does not submit the inputs.

What this model assumes

The three positions are independent, their order is fixed, and every combination is distinct. The count is A × B × C. For two known word alternatives, one of 100 two-digit suffixes and three punctuation choices, that is 600 combinations. These are illustrative counts, not a claim that your password has that structure.

Optional token lines, permutations, duplicate strings, variable lengths, typo expansion, seed checksums and derivation paths are outside this model. Use BTCRecover’s own candidate/counting workflow for the actual configuration. The candidate lab demonstrates why removing ordering constraints changes counts.

A rate is not a success probability

The approximate exhaustive duration is combinations divided by checks per second. It excludes startup and counting overhead and assumes sustained throughput. Enter a rate measured for the same wallet format and checking configuration, not a candidate-generation rate from --listpass. No rate is supplied by default because we have not benchmarked your wallet.

Even a completed search can find nothing if the right answer is outside the configured set. See our benchmark methodology for the assumptions that belong beside any estimate.