https://izbicki.me/blog/how-to-create-an-unfair-coin-and-pro...
I get the idea as shorthand for a binary outcome, but the way you make a coin fair is to flip it.
https://izbicki.me/blog/how-to-create-an-unfair-coin-and-pro...
I get the idea as shorthand for a binary outcome, but the way you make a coin fair is to flip it.
1.96 * sqrt(p * (1-p) / n) = 0.01
0.5^2 / n = (0.01/1.96)^2
n = (1.96/0.01 * 0.5)^2
Or about 9604. So you need roughly 10k trials to determine with 95% confidence a bias of 1%.
https://epubs.siam.org/doi/abs/10.1137/S0036144504446436?jou...
But bending/weighting won't change that.
The implications on all of it are pretty big.
There very well be refs who can take advantage of coin flips over time.
See https://news.ycombinator.com/item?id=30696269 for how you can improve on von Neumann's technique and still stay provably unbiased in your output.
Instead of biasing the coin, consider unrandomizing the flip.
Here’s one of many articles on Perci Diaconis trying just this
https://www.ams.org/publicoutreach/math-history/hap7-fifty-o...
> I get the idea as shorthand for a binary outcome, but the way you make a coin fair is to flip it.
That's a case of working from false assumptions that aren't necessarily true in practice.
The way to make a coin flip fair is to control as many variables as possible during the flip and landing - because that is what is done by people who bias the flip. Only one of these variables is the coin itself.
Bias sometimes exists in the apparatus around the coin. After all some historical coins have ferrous metal in them, as the simplest example.
Bias can also be introduced by the people performing the flips. For example, there are people who can flip a coin onto its edge or with an outcome biased towards heads or tails. A flip onto the coin's edge can even be done by an amateur. [1]
After all, even without bias a coin can land on its edge. See this CBS News video from a Soccer game's ref flipping a coin. [2]
To make an extreme example, if someone can cause the sequence to contain strings of HHHT, this algorithm would absolutely bias towards returning H. So, the key to overcoming this algorithm is to inject a sequence that, regardless of which modulo 2 positition is A or B in the code, will tend to fall on such an input bias. The point is that people trust code that says it fixes these sorts of things, so it is often easier than not to break the code by controlling the input.
There are other methods used in the real world when ingesting random bit sequences.
You can just glue a weight to one side of the faces at an offset.
All because you can't imagine a way to do it doesn't mean it can't be physically done. This is a lesson kids. Randos on the internet can be wrong. Even with high conviction