📅 Original date posted:2022-07-07
📝 Original message: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 at lists.linuxfoundation.org> wrote:
> On Thu, Jul 7, 2022 at 7:43 AM Anton Shevchenko via bitcoin-dev <
> bitcoin-dev at 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 at lists.linuxfoundation.org
> https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
>
--
Best Regards / S pozdravom,
Pavol "stick" Rusnak
Co-Founder, SatoshiLabs
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20220707/cf37de1e/attachment-0001.html>;
Pavol Rusnak [ARCHIVE] /
npub1wc…3hnuq
2023-06-07 23:11:15
in reply to nevent1q…yerl
Author Public Key
npub1wccnjljxnarlx564vuc37hmuzuffurljevjnmuq4u0vjmh7e933sn3hnuqPublished at
2023-06-07 23:11:15Event JSON
{
"id": "a01fabfe811d38893eb1b1c248b3ef98254748e3d7ef64ccd305b61115700a46",
"pubkey": "7631397e469f47f3535567311f5f7c17129e0ff2cb253df015e3d92ddfd92c63",
"created_at": 1686179475,
"kind": 1,
"tags": [
[
"e",
"eac87b4c91a108febb37fcfdedf34b8ebc91e557769313850338d8ae3e1c4c99",
"",
"root"
],
[
"e",
"dedbbd56c6bf05b5d67f83178f8a2ad4d8322c33d6840dd4dedbeb4c5e6e5e10",
"",
"reply"
],
[
"p",
"fb7007c42a06687e3cd3fbbb1a3b17972e2a949ae679445f6b96579114d05cd9"
]
],
"content": "📅 Original date posted:2022-07-07\n📝 Original message:There is. Just encode the index of permutation used to scramble the\notherwise sorted list. For 12 words you need to store 12! = ~32 bits so 3\nwords should be enough.\n\nRepetitions make this more difficult, though.\n\nOn Thu 7. 7. 2022 at 19:41, Bram Cohen via bitcoin-dev \u003c\nbitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\n\u003e On Thu, Jul 7, 2022 at 7:43 AM Anton Shevchenko via bitcoin-dev \u003c\n\u003e bitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\u003e\n\u003e\u003e I made a python implementation for a different mnemonic encoding. The\n\u003e\u003e encoding requires user to remember words but not the order of those words.\n\u003e\u003e The code is open (MIT license) at https://github.com/sancoder/noomnem\n\u003e\n\u003e\n\u003e Thanks Anton. There's an interesting mathematical question of whether it's\n\u003e possible to make a code like this which always uses the BIP-39 words for\n\u003e the same key as part of its encoding, basically adding a few words as error\n\u003e correction in case the order is lost or confused. If the BIP-39 contains a\n\u003e duplicate you can add an extra word.\n\u003e _______________________________________________\n\u003e bitcoin-dev mailing list\n\u003e bitcoin-dev at lists.linuxfoundation.org\n\u003e https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev\n\u003e\n-- \nBest Regards / S pozdravom,\n\nPavol \"stick\" Rusnak\nCo-Founder, SatoshiLabs\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20220707/cf37de1e/attachment-0001.html\u003e",
"sig": "de7df02cf3fc721aae87dea05986f2d9121bbd3831693721e413cf4c3b963495cb70fef0d6ef1a8f3e5b70758c3f56e2c33b8c2d7f9f1b3a83b05f3f6643b6b3"
}