What survives a pair filter?
This page processes your typed text deterministically. It generates no physical randomness, secure keys, or evidence that a device is safe.
Output
| Pair | Input | Decision |
|---|
The rule and the assumption
Read nonoverlapping pairs: 00 and 11 are discarded; 01 emits 0; 10 emits 1. A final unpaired bit is unused. If input bits are independent and share a fixed probability p of being 1, the probabilities of 01 and 10 both equal p(1−p). Those assumptions justify fair retained outcomes in the ideal probabilistic model. They are not established by a finite text entry or by balanced counts.
The retained-pair probability under that model is 2 × p × (1−p). At p = 0.9, 18 percent of pairs survive on average, so the expected output length is 9 percent of the input bit count. These are calculated expectations, not guaranteed proportions in a short sample.
Explore more ideas at Incoprea.