Natural proof
= Natural proof
{wiki=Natural_proof}
A natural proof lower bound is based on a property of Boolean functions that is simultaneously <constructive property of Boolean functions>[constructive], <large property of Boolean functions>[large], and <useful property against a circuit class>[useful] against the circuit class being bounded.