But this will require user to distinguish 12 words from error correcting words. Which is another hassle.
On Thu, Jul 7, 2022, at 10:52 AM, Pavol Rusnak wrote: > There is. Just encode the index of permutation used to scramble the otherwise > sorted list. For 12 words you need to store 12! = ~32 bits so 3 words should > be enough. > > Repetitions make this more difficult, though. > > On Thu 7. 7. 2022 at 19:41, Bram Cohen via bitcoin-dev > <bitcoin-dev@lists.linuxfoundation.org> wrote: >> On Thu, Jul 7, 2022 at 7:43 AM Anton Shevchenko via bitcoin-dev >> <bitcoin-dev@lists.linuxfoundation.org> wrote: >>> I made a python implementation for a different mnemonic encoding. The >>> encoding requires user to remember words but not the order of those words. >>> The code is open (MIT license) at https://github.com/sancoder/noomnem >> >> Thanks Anton. There's an interesting mathematical question of whether it's >> possible to make a code like this which always uses the BIP-39 words for the >> same key as part of its encoding, basically adding a few words as error >> correction in case the order is lost or confused. If the BIP-39 contains a >> duplicate you can add an extra word. >> _______________________________________________ >> bitcoin-dev mailing list >> bitcoin-dev@lists.linuxfoundation.org >> https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev > -- > > Best Regards / S pozdravom, > > Pavol "stick" Rusnak > Co-Founder, SatoshiLabs
_______________________________________________ bitcoin-dev mailing list bitcoin-dev@lists.linuxfoundation.org https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
