Randomness extractors can turn unpredictable sources of randomness into almost perfectly random bits. Researchers have improved the analysis of deterministic randomness extraction for sources sampled by polynomial size quantum circuits. They show that a circuit lower bound against NP-circuits is enough in the classical case, and they can handle sources sampled by postselecting circuits. This model can capture randomness extraction even when there is leakage of information.