Hello, I gust did the same way but just in the ioncoleman's converter, located locally on the tails without an access to the internet. So, I also flipped a coin 256 times ant typed it in the converter's entropy field. So my question is that why I should do my seed phrase manually, if I can just enter my truly random 256 bits to the coverter?
It is just for educational purposes. Yes, you can do the whole thing with iancoleman's tool. I'm just showing the process, under the hood so-to-speak. There is no back door to iancoleman's that I'm aware of, and the code is open source so I'd imagine if there were, someone would have seen it by now. That said, it's best to source iancoleman's tool from github and check hash/signatures and do everything as you suggest on airgap. @@eidenrid7735
Would this be similar for a 18 mnemonic word phrase? I have a wallet I am trying to get access too, but when I enter in the seed phrase into the Mnemonic Code converter says it's invalid
Here is a One-time link: File name Archive dot Zip. It's an old version that will run offline. If it you can't download, it means someone beat you to it. Reply to me here again and I'll put a new one in if you need. But please let me know if it works! file.io/FiYVCPh3HzR2
Having the 12 or 24 words, let's suppose the 12, to each one corresponds a binary value of 11 positions; if we split the string of these 12 binary (without spaces) in blocks of 4, we would have 33 blocks of 4 bits ( 12 x 11 = 132 ; 132 / 4 = 33 ); let's consider the first 32. I ask : is the string formed by the hexadecimal value of each of these 32 blocks the private key ? I will appreciate your answer or comments.
No, doing what you suggest will not equate to any private key. It will create a number that has nothing to do with your seed or your private keys. A 12 word seed is a deterministic way to generate thousands, perhaps millions, of private keys, via BIP 39. See iancoleman.io/bip39/ If I've misunderstood your question, please let me know.
Thats ok, sorry about my English, thanks again, it is what i was thinking, just to demostrate it to a friend, he did not beleave me @@georgehammond6175
What about working out all the words using 128 bits of entropy and start brute forcing the last word from the 16 words in the block that 12th word starts at the top off? Then don't have to use any hex, hash and nothing online just all in your head or on paper etc. For instance say the 12th word equals sock. Go to the word list and try the next 15 words down below sock including sock and it will be one of those words. Just enter them in one at a time as the 12th word when it works the wallet will accept as the right one. It will reject anything that doesn't work. There is 128 blocks of 16 words so you could actually start and pick any block and begin to guest because every block has a word that will accept. This is for a 12 word seed phrase.
Ok, you CAN do this but hold on... You cannot begin with 128 bits of random entropy, you can only start with 121 bits of entropy 11 x 11. The other 7 bits will be determined with your brute force technique, as well as the remaining 4 bits (checksum) that append to the 7 ... 7+4=11 to arrive at your 12th word. Therefore your technique is fine as long as your brute force method is truly random. For example you must use true randomness to decide which of the 128 blocks of 16 words to use. This way, you will be adding 7 bits of randomness to your 121 bits for 128 bits of true randomness. If you decide you like one block of 16 over another for some non random reason, technically your seed will only have 121 bits of true randomness. Does this make sense?
@@georgehammond6175 Yes i get you thanks for the reply. But you can use 128 bits to begin with because the 7 bits for the 12th word will be random entropy, (even though this word will be incorrect) but that that word will be where you start brute forcing guessing from the 16 words in that block down one by one. The 7bits will always give you the word at the VERY top of the 16 words in the block! For example for your last word if you flip a coin 0110010 and your last 7 bits calculates to 800 the word at the very top of the block with be Goat. You will go down each word until you find the one it excepts. 512 + 256 + 32 = 800 = Goat >> one of the next 15 words below goat or goat in the list will be the correct 12th word.
@@georgehammond6175 Awesome! Thank you. I'm new to this stuff and after spending too much time on this the last few days and nights, I noticed after putting all the binary numbers to the word list in a spreadsheet could see a 16 pattern in the 0 and 1s. I was hoping to workout with some math in my head by looking at the other 11 words binary and how does it relate to the checksum because it seems simple but I can NOT figure that part out. Seems the magic happens in the processing of the sha256 so that it is the first number converted to 4 binary bits. Its only one in 16 numbers seems simple but its really hard to figure out how it fits in with the other 11 words even looking at them in bits or binary. It be much harder for 24th word as the blocks are in 256. Imagine the 3 bit word starts at the top of each block same as the 12words seed phrase does. All the best thanks for you video very helpful.
@@georgehammond6175 Thank you. I replied tow times already and YT didn't show it. Your video is very helpful. Before that i was just sha256 the 128 bits as most directions online say to do that. But it never worked for the first digit to binary as the 12th word. The HEX and the text box did the trick from your video and finally BINGO. So I made a Google sheet as was curious how the checksum works and if there was an easier way by using the math somehow. I couldn't work an easy way, it seems just have to use the SHA. But then observed the 16 block patterns and how the 7 bits indicates the top of what block to start guessing from. Makes it somewhat easier and a manual way ppl could do it. 16 Guesses doesn't take too long to airgap your Cold Wallet Seed Generation. Really tricky how the developers have worked out this BIP39 process, it's a really neat and cool bit of work. I made the sheet convert the Binary to HEX which makes it easier to just SHA256 the HEX and bang you got the 12th word. But when i do it for real i will flip coins instead of a google sheet so it is 100% OFFLINE AS RECORMENDED!!!
I doing all proces and plus fliped some coins to determinate some ones, on 24 works fine and understood the process, but I dont know how to try with 12,15,18 words, understanding that will be the same dictionary, always when I try to check is was result a invalid phrase.
12 words must start with 128 bits, 15 words must start with 160 bits, 18 words must start with 192 bits, 21 words must start with 224 bits, and 24 words must start with 256 bits. Whichever one of these you want to use, divide the 'starting bits' by 11. This is the number of words you will search out via the binary. 11 bits each. The REMAINDER is the *lonely bits*. So for example say you want 18 words.... 192/11 = 17 R 5 (remainder 5) ... (17 words of 11 bits each with 5 lonely bits left over) Now your 18th word must be 11 bits, and you only have 5 of those bits. So we get the rest as a checksum. Take all 192 bits (ones and zeros) and convert to hexidecimal, like in the video. Take that Hex number and hash it sha256 (as a hex#, not text) like in the video. Take the first two characters (8 bits) and convert to binary just like in the video. BUT THIS TIME ONLY USE THE FIRST 6 BITS that you get, not all 8. And append those 6 bits to the 5 lonely bits for 11 bits for your 18th word. It works exactly the same for any number of words 12,15,18,21,24. It's just that in each case the REMAINDER will be different. 11 minus the remainder is the number of bits you use to make the 11th word. Lets do 15 words for an example now... 160/11 = 14 R 6 (remainder 6) ... (14 words of 11 bits each with 6 lonely bits left over) Now your 15th word must be 11 bits, and you only have 6 of those bits. So we get the rest as a checksum. Take all 160 bits (ones and zeros) and convert to hexadecimal, like in the video. Take that Hex number and hash it sha256 (as a hex#, not text) like in the video. Take the first two characters (8 bits) and convert to binary just like in the video. BUT THIS TIME ONLY USE THE FIRST 5 BITS that you get, not all 8. And append those 5 bits to the 6 lonely bits for 11 bits for your 18th word. Does this help, please let me know. With 12 words for example your remainder is 7 so the bits you will append from the hash are only 4 7+4=11 All words must have 11 bits. A full example in the next reply...
Example for 15 word seed. 14 sets of eleven: 00010111000 10100010110 00000110110 00110111101 00111101110 00000101101 00001000001 10000100111 01000101110 01010100110 00100001111 10000010101 11010001010 10001011101 with 6 lonely bits left over [110100] All together 160 bits 14 words found from each full set of eleven bits: blade people almost dash differ aisle amused lumber easy feel capable live spend merry convert the 160 binary bits to Hex 1714581B1BD3DC0B420C2745CA9887C15D151774 Hash this hex number^ Result: 31f224fca54eb81bd2283531f9af8aeb755ade85a0c9a6bca5bbd85783bf6817 Take 31 (first 8 bits or 2 characters) and convert from hex to binary Result: 00110001 We had 6 lonely bits, so we only need the first 5 of this result to equal 11 for our 15th word. So we take 00110 and we append that to the 6 lonely bits of 110100 and get 11010000110 Which is our 15th word. Go look it up and it is: "speak" Put "speak" on the end of our 14 words for a checksum word and we get 15: blade people almost dash differ aisle amused lumber easy feel capable live spend merry speak. Which is a valid 15 word mnemonic.
@@georgehammond6175HI, I'm back again, well just to write my feedback, 1st of all thanks for your time to answer and the video you share with us, 2nd , I flipped so many coins that I only view 0 and 1 like Neo xD, ROLF, 3rd well my fella I understood all the asignament and work so well in my case, I tried to all 12, 15, 18, 21, 24 and all cases I get a good result. so my man thank you to share and answear, have a nice day.
You need 256 bits total for a 24 word seed phrase. 23 rows of 11 only give you 253. So they are the 3 left over after flipping 256 coins for example, to achieve 256bits of entropy.. Watch this video I made to see how I get all 256 bits .... ruclips.net/video/gNc5B2uylxk/видео.htmlsi=eGcEKwNj6SeKRRx5
The seed phrase (24 words) is always a representation of 256 bits (ones & zeros.) This is determined by flipping coins or rolling dice. When we go to convert to words, 11 bits make up to each word. By the time we achieve 23 words we've used 253 bits (11 x 23 = 253) That leaves exactly 3 bits left over. In my example It was 001, but it can be any permutation of 3 bits, whatever your entropy determined. These unused bits (not used to reference a word directly) are appended to the check sum (which is 8 bits) as shown in the video, to determine the 24th word.
Sorry for late reply Saribex. No! not if you do it as I suggest, there is only one word that will work as a checksum on your 256 (hopefully truly random) bits. Now if you manually select 23 words from the list, it will only be 253 bits, and YES you can find a FEW 24th words that will made a valid seed. However this is not the way you should be doing it. Never pick words first. Get your 256 bits of entropy first via shaking a jar of 256 coins. I have a video for that ruclips.net/video/gNc5B2uylxk/видео.html. Or if you know what you're doing , you can use dice. But you need 256 bits, which is 3 more than just picking 23 words. If you insist upon picking your 23 words yourself first, or via some random way that you've fashioned to pick them, you will need to flip a coin 3 times, to get the last 3 bits to make 256. Then you can pick up from there. Please note this is DANGEROUS if you don't know exactly what you're doing.
HI there! Thanks for a great and informative video! I did the dice roll and followed exactly what you said to do with 12 instead of 24 words. I did the hex conversion and then wanted to use the SHA256. When I saved and tried to run on my airgap it kept on saying loading on the bottom part! Is there another program I can save and use on my airgap? I did eventually use the iancoleman to find my checksum final word and i tested it also on an electrum which confirmed as well all was good...but I feel your way would really complete it as my own finding out and not using ians program if you know what I mean. Any help would be great and thank!
Ah, I see what you mean. They must have updated the hashing tool to no longer work offline. Bummer. I have no way of sending you my old file either. Let me look around and see if I can find one that works offline.
Would uploading your file to Dropbox work or that cannot be done here? I really want to be able to do it just like your video and not rely on ianColeman's program to find the checksum
@@jayc5058 I made a zip file for the html and accompanying files. Try this link to download and put on your airgap. It's the old version of the webpage. file.io/u4ZqY6TA8GL0 (This link is good for one shot only) If anyone needs this file, hit me up with a message and I'll try to provide another link.
@@georgehammond6175 HI There...sorry about the delay...Yes it has and thanks so much! I installed on the airgap and it works as it does online! Thanks again for the video and of course for the file!! Cheers!
Same way, except instead of having 256 bits, you'll have 128 which will be 11 rows of 11 bits and 7 bits left over. ((11 x 11)+7)=128. Then you go ahead and convert the 128 bits to hex just like in the video and then SHA256 the results just like in the video (using hex, NOT text, just like in the video) But DON'T GRAB THE LEADING TWO CHARACTERS, only grab the single very first character, (NOT two, ONLY one.) Convert that back to binary which will give you 4 bits, (your checksum) instead of the 8 in the video. Place these 4 bits next to your 7 bits left over, and viola you have 11 bits for your 12th word. Make sense? If not please let me know and maybe I can explain it better.
Hello. I created a wallet with 12 words in electrum and then used the bip39 option to enter the wallet. An option "checksum failed" appeared but I can send sats there, Is there any risk of using a wallet with a failed checksum?
I believe Electrum uses a different method than Bip39. I would not send sats to a bip39 with failed checksum. If I were you, I'd start from scratch using bip39 from the beginning. Can you do that? Or have you already send sats in there?@@mynzks
@@venisani8871 The last 3 bits (not digits because they must be 1's or 0's) are the remainder of 256 ÷ 23. Put another way: The seed must be 256 bits, which are divided by 23 rows of 11 bits each. These 23 rows correspond to 23 *organic* words. 3 bits are left over. 256 ÷ 23 = 11 R 3. Then the whole 256 bits as ibe big binary number is converted to hexadecimal. The resulting hexadecimal number gets sha256 hashed as a number, not text. You take the first two characters of the hash and convert to binary which will always give you 8 bits, which you append to the 3 remaining bits to derive the 24th *non organic word* I say non organic because it contains the checksum of the other 23 words via the hashing process. ... So to directly answer your questions, YES the last 3 bits can be any bits, but only insomuch as all 256 bits can be any bits, and they all should be random. So for example you could flip a coin 256 times, heads is a 1 and tails a 0, put the into 23 rows of 11, and end a 24th row with only 3 bits. :)
You can do everything manually except running the sha256 hash of the hexadecimal number to find the checksum (first 2 characters which get converted to 8 bits). Well actually you can do a sha256 hash manually, but it would be really difficult. I've seen it done manually on a youtube video, sped up, it must have taken hours and hours.
Title: how to manually do checksum
Tutorial: use this automatic code to calculate for you
👍
Gracias George. Muy útil y sin decir una sola palabra. !! Thank you George. Very helpful and without saying a single word. !!
You're very welcome - I'm glad you liked!
George!! Please!! How to download the html on my Pc??
Wow, thats a very good step by step guide everyon can understand !
Glad it was helpful!
One of the best videos I found about this topic. BUT!! Why nothing at all was mentioned about Derivation Path options to choose from?
Very good tutorial! Can we also derive public addresses whithout any tool or it's too difficult?
No, you cannot practically speaking, derive public addresses manually.
Hello, I gust did the same way but just in the ioncoleman's converter, located locally on the tails without an access to the internet. So, I also flipped a coin 256 times ant typed it in the converter's entropy field.
So my question is that why I should do my seed phrase manually, if I can just enter my truly random 256 bits to the coverter?
Does converter with backdor or what? Or your video is just for educational purposes just to show the way of 24th word being calculated?
It is just for educational purposes. Yes, you can do the whole thing with iancoleman's tool. I'm just showing the process, under the hood so-to-speak. There is no back door to iancoleman's that I'm aware of, and the code is open source so I'd imagine if there were, someone would have seen it by now. That said, it's best to source iancoleman's tool from github and check hash/signatures and do everything as you suggest on airgap. @@eidenrid7735
Would this be similar for a 18 mnemonic word phrase? I have a wallet I am trying to get access too, but when I enter in the seed phrase into the Mnemonic Code converter says it's invalid
Hi i have 9words of 12 metamask wallet and address wallet
how can i recover 3missing?
hello Where are the zero and one codes extracted from?
Can convert private key into seed phrase?
What exactly are you asking?
where can I download the truly offline sha256 calculator in html form for hex? i only found it for utf-8 strings
Here is a One-time link: File name Archive dot Zip. It's an old version that will run offline. If it you can't download, it means someone beat you to it. Reply to me here again and I'll put a new one in if you need. But please let me know if it works! file.io/FiYVCPh3HzR2
Did you get it ?
Having the 12 or 24 words, let's suppose the 12, to each one corresponds a binary value of 11 positions; if we split the string of these 12 binary (without spaces) in blocks of 4, we would have 33 blocks of 4 bits ( 12 x 11 = 132 ; 132 / 4 = 33 ); let's consider the first 32. I ask : is the string formed by the hexadecimal value of each of these 32 blocks the private key ? I will appreciate your answer or comments.
No, doing what you suggest will not equate to any private key. It will create a number that has nothing to do with your seed or your private keys. A 12 word seed is a deterministic way to generate thousands, perhaps millions, of private keys, via BIP 39. See iancoleman.io/bip39/ If I've misunderstood your question, please let me know.
Thats ok, sorry about my English, thanks again, it is what i was thinking, just to demostrate it to a friend, he did not beleave me
@@georgehammond6175
My friend will believe what you say.
@@jorgenoziglia1086 Yes sir, it is true🧡. Thank you Jorge.
in last step u have to add +1 to the decimal number when you want to match it with a word from the list
Not sure what you mean. You shouldn't have to add +1 to anything
@@georgehammond6175 I think he refers to BIP39 words ranging from 1 to 2.048 and numbers generated ranging from 0 to 255
Hi friend. If have only wallet address, can you find 12 phase key ? Please explain to me ?
Yes i can find but if wallet belongs to you
@@heerasingh7359 ib
What about working out all the words using 128 bits of entropy and start brute forcing the last word from the 16 words in the block that 12th word starts at the top off? Then don't have to use any hex, hash and nothing online just all in your head or on paper etc. For instance say the 12th word equals sock. Go to the word list and try the next 15 words down below sock including sock and it will be one of those words. Just enter them in one at a time as the 12th word when it works the wallet will accept as the right one. It will reject anything that doesn't work.
There is 128 blocks of 16 words so you could actually start and pick any block and begin to guest because every block has a word that will accept. This is for a 12 word seed phrase.
Ok, you CAN do this but hold on... You cannot begin with 128 bits of random entropy, you can only start with 121 bits of entropy 11 x 11. The other 7 bits will be determined with your brute force technique, as well as the remaining 4 bits (checksum) that append to the 7 ... 7+4=11 to arrive at your 12th word. Therefore your technique is fine as long as your brute force method is truly random. For example you must use true randomness to decide which of the 128 blocks of 16 words to use. This way, you will be adding 7 bits of randomness to your 121 bits for 128 bits of true randomness. If you decide you like one block of 16 over another for some non random reason, technically your seed will only have 121 bits of true randomness. Does this make sense?
@@georgehammond6175 Yes i get you thanks for the reply.
But you can use 128 bits to begin with because the 7 bits for the 12th word will be random entropy, (even though this word will be incorrect) but that that word will be where you start brute forcing guessing from the 16 words in that block down one by one. The 7bits will always give you the word at the VERY top of the 16 words in the block!
For example for your last word if you flip a coin 0110010 and your last 7 bits calculates to 800 the word at the very top of the block with be Goat. You will go down each word until you find the one it excepts. 512 + 256 + 32 = 800 = Goat >> one of the next 15 words below goat or goat in the list will be the correct 12th word.
@@jaffasoft8976 You' are100% absolutely correct! Very cool observation, I completely overlooked this fact. Great work jaffasoft!
@@georgehammond6175 Awesome! Thank you.
I'm new to this stuff and after spending too much time on this the last few days and nights, I noticed after putting all the binary numbers to the word list in a spreadsheet could see a 16 pattern in the 0 and 1s. I was hoping to workout with some math in my head by looking at the other 11 words binary and how does it relate to the checksum because it seems simple but I can NOT figure that part out. Seems the magic happens in the processing of the sha256 so that it is the first number converted to 4 binary bits.
Its only one in 16 numbers seems simple but its really hard to figure out how it fits in with the other 11 words even looking at them in bits or binary.
It be much harder for 24th word as the blocks are in 256. Imagine the 3 bit word starts at the top of each block same as the 12words seed phrase does. All the best thanks for you video very helpful.
@@georgehammond6175 Thank you. I replied tow times already and YT didn't show it.
Your video is very helpful. Before that i was just sha256 the 128 bits as most directions online say to do that. But it never worked for the first digit to binary as the 12th word. The HEX and the text box did the trick from your video and finally BINGO.
So I made a Google sheet as was curious how the checksum works and if there was an easier way by using the math somehow. I couldn't work an easy way, it seems just have to use the SHA. But then observed the 16 block patterns and how the 7 bits indicates the top of what block to start guessing from. Makes it somewhat easier and a manual way ppl could do it. 16 Guesses doesn't take too long to airgap your Cold Wallet Seed Generation.
Really tricky how the developers have worked out this BIP39 process, it's a really neat and cool bit of work. I made the sheet convert the Binary to HEX which makes it easier to just SHA256 the HEX and bang you got the 12th word. But when i do it for real i will flip coins instead of a google sheet so it is 100% OFFLINE AS RECORMENDED!!!
I doing all proces and plus fliped some coins to determinate some ones, on 24 works fine and understood the process, but I dont know how to try with 12,15,18 words, understanding that will be the same dictionary, always when I try to check is was result a invalid phrase.
12 words must start with 128 bits, 15 words must start with 160 bits, 18 words must start with 192 bits, 21 words must start with 224 bits, and 24 words must start with 256 bits. Whichever one of these you want to use, divide the 'starting bits' by 11. This is the number of words you will search out via the binary. 11 bits each. The REMAINDER is the *lonely bits*. So for example say you want 18 words.... 192/11 = 17 R 5 (remainder 5) ... (17 words of 11 bits each with 5 lonely bits left over) Now your 18th word must be 11 bits, and you only have 5 of those bits. So we get the rest as a checksum. Take all 192 bits (ones and zeros) and convert to hexidecimal, like in the video. Take that Hex number and hash it sha256 (as a hex#, not text) like in the video. Take the first two characters (8 bits) and convert to binary just like in the video. BUT THIS TIME ONLY USE THE FIRST 6 BITS that you get, not all 8. And append those 6 bits to the 5 lonely bits for 11 bits for your 18th word. It works exactly the same for any number of words 12,15,18,21,24. It's just that in each case the REMAINDER will be different. 11 minus the remainder is the number of bits you use to make the 11th word. Lets do 15 words for an example now... 160/11 = 14 R 6 (remainder 6) ... (14 words of 11 bits each with 6 lonely bits left over) Now your 15th word must be 11 bits, and you only have 6 of those bits. So we get the rest as a checksum. Take all 160 bits (ones and zeros) and convert to hexadecimal, like in the video. Take that Hex number and hash it sha256 (as a hex#, not text) like in the video. Take the first two characters (8 bits) and convert to binary just like in the video. BUT THIS TIME ONLY USE THE FIRST 5 BITS that you get, not all 8. And append those 5 bits to the 6 lonely bits for 11 bits for your 18th word. Does this help, please let me know. With 12 words for example your remainder is 7 so the bits you will append from the hash are only 4 7+4=11 All words must have 11 bits. A full example in the next reply...
Example for 15 word seed.
14 sets of eleven: 00010111000 10100010110 00000110110 00110111101 00111101110 00000101101 00001000001 10000100111 01000101110 01010100110 00100001111 10000010101 11010001010 10001011101
with 6 lonely bits left over [110100]
All together 160 bits
14 words found from each full set of eleven bits:
blade people almost dash differ aisle amused lumber easy feel capable live spend merry
convert the 160 binary bits to Hex
1714581B1BD3DC0B420C2745CA9887C15D151774
Hash this hex number^
Result: 31f224fca54eb81bd2283531f9af8aeb755ade85a0c9a6bca5bbd85783bf6817
Take 31 (first 8 bits or 2 characters) and convert from hex to binary
Result: 00110001
We had 6 lonely bits, so we only need the first 5 of this result to equal 11 for our 15th word. So we take 00110 and we append that to the 6 lonely bits of 110100 and get
11010000110 Which is our 15th word. Go look it up and it is: "speak"
Put "speak" on the end of our 14 words for a checksum word and we get 15:
blade people almost dash differ aisle amused lumber easy feel capable live spend merry speak.
Which is a valid 15 word mnemonic.
@@georgehammond6175 thank you I'll do it and after have the complete experience I'll feedback you
@@georgehammond6175HI, I'm back again, well just to write my feedback, 1st of all thanks for your time to answer and the video you share with us, 2nd , I flipped so many coins that I only view 0 and 1 like Neo xD, ROLF, 3rd well my fella I understood all the asignament and work so well in my case, I tried to all 12, 15, 18, 21, 24 and all cases I get a good result. so my man thank you to share and answear, have a nice day.
Where did you get the 001? The last 3 numbers after the seed list...
You need 256 bits total for a 24 word seed phrase. 23 rows of 11 only give you 253. So they are the 3 left over after flipping 256 coins for example, to achieve 256bits of entropy.. Watch this video I made to see how I get all 256 bits .... ruclips.net/video/gNc5B2uylxk/видео.htmlsi=eGcEKwNj6SeKRRx5
how and where did you get that last 001 from the seed phrase?!?!
The seed phrase (24 words) is always a representation of 256 bits (ones & zeros.) This is determined by flipping coins or rolling dice. When we go to convert to words, 11 bits make up to each word. By the time we achieve 23 words we've used 253 bits (11 x 23 = 253) That leaves exactly 3 bits left over. In my example It was 001, but it can be any permutation of 3 bits, whatever your entropy determined. These unused bits (not used to reference a word directly) are appended to the check sum (which is 8 bits) as shown in the video, to determine the 24th word.
Is it possible that there are multiple possible words for the 24th word?
of course No
Sorry for late reply Saribex. No! not if you do it as I suggest, there is only one word that will work as a checksum on your 256 (hopefully truly random) bits. Now if you manually select 23 words from the list, it will only be 253 bits, and YES you can find a FEW 24th words that will made a valid seed. However this is not the way you should be doing it. Never pick words first. Get your 256 bits of entropy first via shaking a jar of 256 coins. I have a video for that ruclips.net/video/gNc5B2uylxk/видео.html. Or if you know what you're doing , you can use dice. But you need 256 bits, which is 3 more than just picking 23 words. If you insist upon picking your 23 words yourself first, or via some random way that you've fashioned to pick them, you will need to flip a coin 3 times, to get the last 3 bits to make 256. Then you can pick up from there. Please note this is DANGEROUS if you don't know exactly what you're doing.
HI there! Thanks for a great and informative video! I did the dice roll and followed exactly what you said to do with 12 instead of 24 words. I did the hex conversion and then wanted to use the SHA256. When I saved and tried to run on my airgap it kept on saying loading on the bottom part! Is there another program I can save and use on my airgap? I did eventually use the iancoleman to find my checksum final word and i tested it also on an electrum which confirmed as well all was good...but I feel your way would really complete it as my own finding out and not using ians program if you know what I mean. Any help would be great and thank!
Ah, I see what you mean. They must have updated the hashing tool to no longer work offline. Bummer. I have no way of sending you my old file either. Let me look around and see if I can find one that works offline.
Would uploading your file to Dropbox work or that cannot be done here? I really want to be able to do it just like your video and not rely on ianColeman's program to find the checksum
@@jayc5058 I made a zip file for the html and accompanying files. Try this link to download and put on your airgap. It's the old version of the webpage. file.io/u4ZqY6TA8GL0 (This link is good for one shot only) If anyone needs this file, hit me up with a message and I'll try to provide another link.
@jayc5058 please let me know if that worked!
@@georgehammond6175 HI There...sorry about the delay...Yes it has and thanks so much! I installed on the airgap and it works as it does online! Thanks again for the video and of course for the file!! Cheers!
what about the 12 word phrase
Same way, except instead of having 256 bits, you'll have 128 which will be 11 rows of 11 bits and 7 bits left over. ((11 x 11)+7)=128. Then you go ahead and convert the 128 bits to hex just like in the video and then SHA256 the results just like in the video (using hex, NOT text, just like in the video) But DON'T GRAB THE LEADING TWO CHARACTERS, only grab the single very first character, (NOT two, ONLY one.) Convert that back to binary which will give you 4 bits, (your checksum) instead of the 8 in the video. Place these 4 bits next to your 7 bits left over, and viola you have 11 bits for your 12th word. Make sense? If not please let me know and maybe I can explain it better.
@@georgehammond6175thx u explained it well , so in 12 word its 128 bit
@@northstar5934 Yes, 12 words is 128 bits of entropy.
Sir i need your help. Please
What's up?
Hello. I created a wallet with 12 words in electrum and then used the bip39 option to enter the wallet. An option "checksum failed" appeared but I can send sats there, Is there any risk of using a wallet with a failed checksum?
I believe Electrum uses a different method than Bip39. I would not send sats to a bip39 with failed checksum. If I were you, I'd start from scratch using bip39 from the beginning. Can you do that? Or have you already send sats in there?@@mynzks
i lost last 2 words for 12 phrase seed
easy... that's about 2048 x 128 combinations you can try.
good luck!
How to hack btc?
haha, No! That's impossible. This is a breakdown of how the checksum on a bip39 passphrase works.
How did you get the 3 digits from the las number? It can be any 3 digits?
And also, is there a way to do everything manually? Not using a computer at all?
@@venisani8871 The last 3 bits (not digits because they must be 1's or 0's) are the remainder of 256 ÷ 23. Put another way: The seed must be 256 bits, which are divided by 23 rows of 11 bits each. These 23 rows correspond to 23 *organic* words. 3 bits are left over. 256 ÷ 23 = 11 R 3. Then the whole 256 bits as ibe big binary number is converted to hexadecimal. The resulting hexadecimal number gets sha256 hashed as a number, not text. You take the first two characters of the hash and convert to binary which will always give you 8 bits, which you append to the 3 remaining bits to derive the 24th *non organic word* I say non organic because it contains the checksum of the other 23 words via the hashing process. ... So to directly answer your questions, YES the last 3 bits can be any bits, but only insomuch as all 256 bits can be any bits, and they all should be random. So for example you could flip a coin 256 times, heads is a 1 and tails a 0, put the into 23 rows of 11, and end a 24th row with only 3 bits. :)
You can do everything manually except running the sha256 hash of the hexadecimal number to find the checksum (first 2 characters which get converted to 8 bits). Well actually you can do a sha256 hash manually, but it would be really difficult. I've seen it done manually on a youtube video, sped up, it must have taken hours and hours.
Piece of cake 💀
No way! Oups you didn't do it manually.... 😑