It is not the case that Polynomial verification requires witnesses whose size is polynomially bounded in input length; exponential-bit factorizations violate this constraint fundamentally.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.