<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <updated></updated>
  <generator>https://nostr.ae</generator>

  <title>Nostr notes by </title>
  <author>
    <name></name>
  </author>
  <link rel="self" type="application/atom+xml" href="https://nostr.ae/npub1s30u622v6qh9zh88pmnr8ahv5cdxh6slu3rhqh57vzsrs8h8qehq0fs7ae.rss" />
  <link href="https://nostr.ae/npub1s30u622v6qh9zh88pmnr8ahv5cdxh6slu3rhqh57vzsrs8h8qehq0fs7ae" />
  <id>https://nostr.ae/npub1s30u622v6qh9zh88pmnr8ahv5cdxh6slu3rhqh57vzsrs8h8qehq0fs7ae</id>
  <icon></icon>
  <logo></logo>




  <entry>
    <id>https://nostr.ae/nevent1qqswawadjqh7f57jgrh93s76qr26nlje6cf6exvfwyacsaz3dxw8eggzyzz9lnfffngzu52uuu8wvvlkajnp56l2rljywuz7nes2qwq7uurxuz5zuhj</id>
    
      <title type="html">📅 Original date posted:2022-07-07 📝 Original message:But ...</title>
    
    <link rel="alternate" href="https://nostr.ae/nevent1qqswawadjqh7f57jgrh93s76qr26nlje6cf6exvfwyacsaz3dxw8eggzyzz9lnfffngzu52uuu8wvvlkajnp56l2rljywuz7nes2qwq7uurxuz5zuhj" />
    <content type="html">
      In reply to &lt;a href=&#39;/nevent1qqs2q8atl6q36wyf86cmrsjgk0hesf28fr3a0mmyenfstds3z4cq53suhmktu&#39;&gt;nevent1q…mktu&lt;/a&gt;&lt;br/&gt;_________________________&lt;br/&gt;&lt;br/&gt;📅 Original date posted:2022-07-07&lt;br/&gt;📝 Original message:But this will require user to distinguish 12 words from error correcting words. Which is another hassle.&lt;br/&gt;&lt;br/&gt;On Thu, Jul 7, 2022, at 10:52 AM, Pavol Rusnak wrote:&lt;br/&gt;&amp;gt; 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. &lt;br/&gt;&amp;gt; &lt;br/&gt;&amp;gt; Repetitions make this more difficult, though. &lt;br/&gt;&amp;gt; &lt;br/&gt;&amp;gt; On Thu 7. 7. 2022 at 19:41, Bram Cohen via bitcoin-dev &amp;lt;bitcoin-dev at lists.linuxfoundation.org&amp;gt; wrote:&lt;br/&gt;&amp;gt;&amp;gt; On Thu, Jul 7, 2022 at 7:43 AM Anton Shevchenko via bitcoin-dev &amp;lt;bitcoin-dev at lists.linuxfoundation.org&amp;gt; wrote:&lt;br/&gt;&amp;gt;&amp;gt;&amp;gt; I made a python implementation for a different mnemonic encoding. The encoding requires user to remember words but not the order of those words.&lt;br/&gt;&amp;gt;&amp;gt;&amp;gt; The code is open (MIT license) at &lt;a href=&#34;https://github.com/sancoder/noomnem&#34;&gt;https://github.com/sancoder/noomnem&lt;/a&gt;&lt;br/&gt;&amp;gt;&amp;gt; &lt;br/&gt;&amp;gt;&amp;gt; Thanks Anton. There&amp;#39;s an interesting mathematical question of whether it&amp;#39;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.&lt;br/&gt;&amp;gt;&amp;gt; _______________________________________________&lt;br/&gt;&amp;gt;&amp;gt; bitcoin-dev mailing list&lt;br/&gt;&amp;gt;&amp;gt; bitcoin-dev at lists.linuxfoundation.org&lt;br/&gt;&amp;gt;&amp;gt; &lt;a href=&#34;https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev&#34;&gt;https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev&lt;/a&gt;&lt;br/&gt;&amp;gt; -- &lt;br/&gt;&amp;gt; &lt;br/&gt;&amp;gt; Best Regards / S pozdravom,&lt;br/&gt;&amp;gt; &lt;br/&gt;&amp;gt; Pavol &amp;#34;stick&amp;#34; Rusnak&lt;br/&gt;&amp;gt; Co-Founder, SatoshiLabs&lt;br/&gt;-------------- next part --------------&lt;br/&gt;An HTML attachment was scrubbed...&lt;br/&gt;URL: &amp;lt;&lt;a href=&#34;http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20220707/1d22ce6b/attachment.html&amp;gt&#34;&gt;http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20220707/1d22ce6b/attachment.html&amp;gt&lt;/a&gt;;
    </content>
    <updated>2023-06-08T01:11:15&#43;02:00</updated>
  </entry>

  <entry>
    <id>https://nostr.ae/nevent1qqswt7au4et2x87lcmelz5qfk3f5md8f0znul60n47v8lp5qv04nueqzyzz9lnfffngzu52uuu8wvvlkajnp56l2rljywuz7nes2qwq7uurxutgr9ah</id>
    
      <title type="html">📅 Original date posted:2022-07-07 📝 Original message:Hello, ...</title>
    
    <link rel="alternate" href="https://nostr.ae/nevent1qqswt7au4et2x87lcmelz5qfk3f5md8f0znul60n47v8lp5qv04nueqzyzz9lnfffngzu52uuu8wvvlkajnp56l2rljywuz7nes2qwq7uurxutgr9ah" />
    <content type="html">
      In reply to &lt;a href=&#39;/nevent1qqsw4jrmfjg6zz87hvmlel0d7d9ca0y3u4thdycns5pn3k9w8cwyexgptztsy&#39;&gt;nevent1q…ztsy&lt;/a&gt;&lt;br/&gt;_________________________&lt;br/&gt;&lt;br/&gt;📅 Original date posted:2022-07-07&lt;br/&gt;📝 Original message:Hello,&lt;br/&gt;&lt;br/&gt;I am new to this list, sorry if it&amp;#39;s been discussed earlier.&lt;br/&gt;I made a python implementation for a different mnemonic encoding. The encoding requires user to remember words but not the order of those words.&lt;br/&gt;The code is open (MIT license) at &lt;a href=&#34;https://github.com/sancoder/noomnem&#34;&gt;https://github.com/sancoder/noomnem&lt;/a&gt;&lt;br/&gt;&lt;br/&gt;--  Anton Shevchenko
    </content>
    <updated>2023-06-08T01:11:14&#43;02:00</updated>
  </entry>

</feed>