{"type":"rich","version":"1.0","author_name":"npub1f2nvlx49er5c7sqa43src6ssyp6snd4qwvtkwm5avc2l84cs84esecrwet","author_url":"https://nostr.ae/npub1f2nvlx49er5c7sqa43src6ssyp6snd4qwvtkwm5avc2l84cs84esecrwet","provider_name":"njump","provider_url":"https://nostr.ae","html":"📅 Original date posted:2014-04-07\n📝 Original message:On Mon, Apr 7, 2014 at 5:33 PM, Nikita Schmidt\n\u003cnikita at megiontechnologies.com\u003e wrote:\n\u003e Regarding the choice of fields, any implementation of this BIP will\n\u003e need big integer arithmetic to do base-58 anyway.\n\nNah, it doesn't. E.g.\nhttps://gitorious.org/bitcoin/libblkmaker/source/eb33f9c8e441ffef457a79d76ceed1ea20ab3059:base58.c\n\n\u003e However, the maths in GF(2^8) is so simple that this\n\u003e additional complexity can be considered negligible.\n[...]\n\u003e Uniform processing of secrets of any size (instead of using different\n\u003e primes for different cases) is a valid argument in favour of GF(2^8),\n\u003e though.  I have no preference one way or another.\n\nI think this is really one of the bigger selling points."}