Keyspace Navigator
Browse through all 115792089237316195423570985008687907852837564279074904382605163141518161494336 private keys.
Every key exists. Every address is valid. Most are empty.
| # | Private Key (HEX) | Ethereum Address | Bitcoin Address |
|---|
Where Are You?
secp256k1 Keyspace
- Valid keys: 1 to n-1 (curve order)
- Max key: FFFFFFFFFFFF...0364140
- Total: ~1.16 × 1077 keys
- Atoms in universe: ~1080
At 1 Billion Keys/Second
- To check all keys: 3.67 × 1060 years
- Universe age: 1.38 × 1010 years
- Ratio: 2.66 × 1050 universe ages
- Still basically 0% complete
Every private key shown here is mathematically valid. Each one controls a real Ethereum and Bitcoin address. The keys are generated deterministically from the page number - same page always shows the same keys.
Browsing the Bitcoin and Ethereum Keyspace
The Keyspace Navigator turns the abstract concept of "all possible private keys" into something you can scroll through page by page. Each page shows 60 consecutive private keys along with the Bitcoin and Ethereum addresses they unlock. The first key on page 1 is 0x0000…0001; the last key on the final page is the secp256k1 curve order minus one, written 0xFFFF…0364140. Between those bounds sit roughly 1.16 × 10^77 valid keys, organized into about 1.93 × 10^75 pages. If you visited one new page every second, you would finish browsing the keyspace 10^67 universe-ages from now.
Why does this matter? Because the security of every cryptocurrency wallet on Earth rests on the assumption that no one — no individual, no nation-state, no future supercomputer — can meaningfully sample this space. The Keyspace tool exists to make that assumption tangible. It does not generate random keys. It enumerates them in order. You can jump to page one, page one trillion, or page 10^70, and the addresses always derive deterministically. Every funded wallet that has ever existed on Bitcoin or Ethereum is hiding somewhere in this list. Finding one without already knowing the page number requires luck on a scale that no amount of compute can rescue.
How secp256k1 Bounds the Keyspace
The valid range of Bitcoin and Ethereum private keys is not actually a perfect 2^256. The secp256k1 elliptic curve has a finite group order n = FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFE BAAEDCE6 AF48A03B BFD25E8C D0364141. Any integer from 1 up to n-1 is a valid private key. Integers greater than or equal to n wrap around the curve and are normally rejected by wallet software. The difference between n and 2^256 is so tiny relative to the magnitude that practitioners refer to "2^256 keys" without losing sleep over the missing fraction.
This curve was chosen by Satoshi Nakamoto for Bitcoin and inherited by Ethereum because it was efficient on the hardware of 2009 and had been studied since 2000 without serious cryptanalytic break. Decades later, secp256k1 remains unbroken in the classical computing model. The Keyspace Navigator is a celebration of that fact: every page you scroll through is a small reminder of how much room these algorithms give legitimate users to hide in.
Frequently Asked Questions About the Keyspace
How many private keys exist in Bitcoin?
Bitcoin uses the secp256k1 curve, which has a curve order of about 1.158 × 10^77. That is the number of valid private keys: any integer from 1 up to n-1, where n is the curve order. Numerically, this is 2^256 minus a small number — close enough to 2^256 that the two figures are used interchangeably.
Are all the keys shown on this page mathematically valid?
Yes. Every key on every page corresponds to a real Ethereum and Bitcoin address. The keys are generated deterministically from the page number, so the keys on page 5 are always the same five-times-keys-per-page values shifted by one. Nothing about a page changes between visits.
How do you derive a Bitcoin or Ethereum address from a page number?
For a given page p with k keys per page, the keys for that page are the integers (p-1)·k + 1 through p·k. Each integer is hex-padded to 64 characters and treated as a private key. Standard secp256k1 multiplication gives the public key, then keccak256 (Ethereum) or RIPEMD160(SHA256) (Bitcoin) gives the address.
Why can't an attacker simply check every key?
Because there are too many. At one billion derivations per second — far above what a single GPU can manage — checking every key would take 3.67 × 10^60 years. The universe has only existed for 1.4 × 10^10 years. No imaginable scaling of classical hardware closes that gap.
Are the very first keys (page 1) just empty wallets?
Mostly, but not always. The very first keys (1, 2, 3, …) have been examined by curious researchers and any incoming dust transactions have been swept long ago. A handful of test addresses derived from extremely small private keys briefly receive transactions when newcomers find them, but they are continuously drained by bots watching the network.
Can I use this tool to find an unused address for myself?
Technically yes, but you absolutely should not. Anything visible in a public web tool is a key that other people are also looking at, and any private key generated outside a hardware wallet is exposed to the browser environment. For real funds, generate keys offline using audited wallet software.