CRYPTO NEWS

french help or english ? problem bitcoin core log?

the forum of the new colors !! ok, I need help :

have an old wallet backup … I can’t "restore" (option) the copy of my wallet !(or other…)

encrypt wallet with new passphrase, Possibly change the bitcoin of place’s address (yes for the hdseed ) or not ? I don’t check my address’s wallet of bitcoin ! any or it’s the age ? (if anyone know the change’s of age for "restore" option they wallet, talk it here please ?) thanks…, with help, with bitcoin !

thanks you

you know the contact of french encoder OR I understand but A good explain, very must ! a good explain !

Crypto Hats, Crypto Shirts, Crypto Socks, Crypto Clothing

Bits of entropy needed to choose a random element from a list?

Suppose I want to choose a random element from a list of size $2^n$, for any integer $n$. (Here, random is to mean an equal probability of selecting every item.) My intuition says I’d need $n$ bits of entropy. For example, for a list of size 64, I’d need 6 bits of entropy. However, how::Listen

Suppose I want to choose a random element from a list of size $2^n$, for any integer $n$. (Here, random is to mean an equal probability of selecting every item.) My intuition says I’d need $n$ bits of entropy. For example, for a list of size 64, I’d need 6 bits of entropy.

However, how many bits of entropy would I need to choose a random element from a list that’s sized something other than $2^n$? For example, for a list of size 3, or 10?

My intuition says that I’d need to find $n$ such that $2^n$ is a multiple of list size, to ensure equal probability of selecting every item. (This is true for all lists sized $2^n$.) However, that doesn’t seem to work in practice: there does not appear to be any $n$ such that $2^n$ that divides evenly into 3 or 10.

french help or english ? problem bitcoin core log?

Shopping cart
There are no products in the cart!
Continue shopping
0