16:15:20 this line causes problems in WebAssembly only on mainnet because it depends on libunbound: https://github.com/monero-project/monero/blob/93257997bd69e25c76de8ebf3f46bfeb44f11589/src/wallet/wallet2.cpp#L13579 16:15:59 You can set use_dns to 0. 16:16:06 There's a command line flag for that. 16:17:50 sorry I disconnected if there were any responses 16:18:08 You can set use_dns to 0. 16:18:09 There's a command line flag for that. 16:22:30 oh perfect. thank you 18:34:39 I try to come to a full understanding how seed words are used to calculate the private spend key in Monero 18:35:19 My problem is with this part of the code, where 3 words are treated as number in the 1626 number system and turned into 32 bits: https://github.com/monero-project/monero/blob/master/src/mnemonics/electrum-words.cpp#L316 18:36:09 I would have written this simply as: w[0] = w[1] + wordListLength * w[2] + wordListLength * wordListLength * w[3]; 18:36:33 But now it's more complicated, as can be seen in the source code. I wonder why. 18:39:42 I mean, what's the math principle behind ((word_list_length - w[1]) + w[2]) % word_list_length) ? 20:07:30 is the mod producing the checksum? https://monero.stackexchange.com/questions/468/how-are-monero-wallets-generated rbrunner 20:08:48 No, it's not about the checksum. It's much more basic, how words are "turned into bits". It seems needlessly complicated, but I am quite sure there is some intention behind it. To know which would be interesting. 20:11:08 One theory I came up in the meantime: subtracting w[1] in the expression for the second "digit" I gave negates some "rotating" or "shifting" within the words which may make the seed more "varied" i.e. using more different words. 20:11:38 But well, on the other hand, the bits should be completely random anyway ... 20:14:27 Thanks for the link, scoobybejesus. It's much more than just an explanation of the checksum alright, but I could not see this particular detail in luigi's explanations