I tried to create wallet by mnemonic seed, this link explains how to do it.

I've created this sample:

use yellow direct rib grass uncle cinnamon country furnace endless book denial

Rules I followed:

  1. The words are separated by a single space.
  2. The words are all in lowercase.
  3. The words are included in this word list

But https://iancoleman.io/bip39/ tells me it is an invalid mnemonic.

2 Answers 2


To create a 128 bits BIP39 mnemonic phrase, you need to:

  1. generate the entropy
    Let's take for example ae0d36b7fcfb6cfe599366ecd9411b62 which is the hexadecimal representation of 128 bits of entropy.

  2. calculate the checksum by hashing the entropy and keeping the first 4bits (1 bit for 32 bits of entropy (128/32 = 4))

    hash(entropy) = 9214b8501502213b6e1d67f4bed6dd216596c553f0a0618bbd63c1cc3d7db51e

Now let's keep the first 4bits which is '9' (1001 in binary)

  1. append the checksum to the entropy:
    ae0d36b7fcfb6cfe599366ecd9411b629 which gives us in binary:

10101110000 01101001101 10101101111 11111001111 10110110110 01111111001 01100110010 01101100110 11101100110 11001010000 01000110110 11000101001

(The binary string is split into groups of 11 bits (2^11 = 2048 and there are 2048 words in the BIP39 Wordlist))

  1. convert each group of 11 bits to its corresponding word in the BIP39 Wordlist

For example, the first group: 10101110000 is the 1392th word on the list. (starting from 0) => The word is 'puppy'

(10101110000 being the binary representation of 1392)


The last word is a checksum, i.e. it is computed based on the 11 previous words.

So you can't just pick any random 12 words. You can pick 11 random words and compute the last one -- although I don't know if there is an easy resource that would help you do that.

In any case, you really shouldn't do this with real money ever.

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.