pull down to refresh
Yes absolutely, Von Neumann debiasing, which entirely nullifies first order bias. It kinda takes forever, though I believe you can go faster with a die doing: 1 if every other throw is higher, 0 if every other throw is lower, discard if they are equal. (I think Codex32 uses that from the top of my head)
It's a very good solution if you have the patience, probably closer to optimal than using tiles, but I was looking for the best solution that would be fast & simple. Btw, I'm curious, how do you compute your checksum if you go for 24 words?
There's bias correction techniques. The simple version of which is:
The more technical and in depth version of which is:
https://wuille.net/posts/binomial-randomness-extractors/
https://btcmaxis.com/article.html?id=7554e7cb-d8aa-45d5-95c8-adea8d87ea23 ↩