I'm including multiple quantum methods that the user can choose from. Bit recycling is best in my mind. It is bit perfect.

But the cascade extractor method and Fourier method are so rigorous that they're used in cryptography algorithms. These two are very computationally expensive, and they do reject bits. A bit being rejected does not harm randomness.

>>40770070
The tests are classical statistics tests not computational tests.

The tests check for uniformity. True quantum randomness is perfectly uniform. They check for obedient to exact probabilities distributions, they check for independence, they check for pattern absence, they check for entropy, and they check for multi dimensional context independence.

Quantum randomness has statistical signatures and tare mathematically provable and testable without quantum computers.