Sign inSign in

Next-bit prediction theorem

A theorem stating that if a circuit can distinguish between a truly random string and a pseudorandom string, then there exists a predictor circuit that can predict the i-th bit from the previous i-1 bits with non-negligible advantage.
as Ryan O'Donnell defines itCarnegie Mellon University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Distinguisher circuits1Probability expectations1

Lecturers

1

    Connections

    1

    The lectures that define it or assume it, and the concepts next to it.

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.