nonlocality can be used to certify that the outcomes of one of the parties in a bell experiment are partially unknown to an external adversary. by feeding a partially random seed to several non-local boxes, and, after processing the outputs, one can end up with a longer (potentially unbounded) string of comparable randomness or with a shorter but more random string. this last primitive can be proven impossible in a classical setting.