📅 Original date posted:2022-07-07
📝 Original message:Part of the rules of my challenge is that the 'new' words need to be in the
same pool as the 'old' words, so any ordering is okay. Without that
requirement it's mathematically very straightforward.
On Thu, Jul 7, 2022 at 10:52 AM Pavol Rusnak <stick at satoshilabs.com> 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 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/72c4a5e7/attachment.html>;
Bram Cohen [ARCHIVE] /
npub1ld…t8ur6
2023-06-08 01:11:15
in reply to nevent1q…demd
Author Public Key
npub1ldcq03p2qe58u0xnlwa35wchjuhz49y6ueu5ghmtjetez9xstnvsmt8ur6Published at
2023-06-08 01:11:15Event JSON
{
"id": "190a93b005e5052ce77b714595133fe73cd7245ae4e194d005e31290ede1b4cf",
"pubkey": "fb7007c42a06687e3cd3fbbb1a3b17972e2a949ae679445f6b96579114d05cd9",
"created_at": 1686179475,
"kind": 1,
"tags": [
[
"e",
"eac87b4c91a108febb37fcfdedf34b8ebc91e557769313850338d8ae3e1c4c99",
"",
"root"
],
[
"e",
"eebbad902fe4d3d240ee58c3da00d5a9fe59d613ac9989713b887451699c7ca1",
"",
"reply"
],
[
"p",
"845fcd294cd02e515ce70ee633f6eca61a6bea1fe447705e9e60a0381ee7066e"
]
],
"content": "📅 Original date posted:2022-07-07\n📝 Original message:Part of the rules of my challenge is that the 'new' words need to be in the\nsame pool as the 'old' words, so any ordering is okay. Without that\nrequirement it's mathematically very straightforward.\n\nOn Thu, Jul 7, 2022 at 10:52 AM Pavol Rusnak \u003cstick at satoshilabs.com\u003e wrote:\n\n\u003e There is. Just encode the index of permutation used to scramble the\n\u003e otherwise sorted list. For 12 words you need to store 12! = ~32 bits so 3\n\u003e words should be enough.\n\u003e\n\u003e Repetitions make this more difficult, though.\n\u003e\n\u003e On Thu 7. 7. 2022 at 19:41, Bram Cohen via bitcoin-dev \u003c\n\u003e bitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\u003e\n\u003e\u003e On Thu, Jul 7, 2022 at 7:43 AM Anton Shevchenko via bitcoin-dev \u003c\n\u003e\u003e bitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\u003e\u003e\n\u003e\u003e\u003e I made a python implementation for a different mnemonic encoding. The\n\u003e\u003e\u003e encoding requires user to remember words but not the order of those words.\n\u003e\u003e\u003e The code is open (MIT license) at https://github.com/sancoder/noomnem\n\u003e\u003e\n\u003e\u003e\n\u003e\u003e Thanks Anton. There's an interesting mathematical question of whether\n\u003e\u003e it's possible to make a code like this which always uses the BIP-39 words\n\u003e\u003e for the same key as part of its encoding, basically adding a few words as\n\u003e\u003e error correction in case the order is lost or confused. If the BIP-39\n\u003e\u003e contains a duplicate you can add an extra word.\n\u003e\u003e _______________________________________________\n\u003e\u003e bitcoin-dev mailing list\n\u003e\u003e bitcoin-dev at lists.linuxfoundation.org\n\u003e\u003e https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev\n\u003e\u003e\n\u003e --\n\u003e Best Regards / S pozdravom,\n\u003e\n\u003e Pavol \"stick\" Rusnak\n\u003e Co-Founder, SatoshiLabs\n\u003e\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20220707/72c4a5e7/attachment.html\u003e",
"sig": "afd63458abdad07dc8003190ae6925be5268a60b77d2e4033f8ec45ec3e2bdd0b2fd377054a02bb4aaf7be44f888ecc877958a8f46ee926c4d1024803b1a25f1"
}