To prove that a number n is composite, it suffices to exhibit the working for the multiplication of a pair of factors. This working, represented as a, string, is of length bounded by a polynomial in log n. We show that the same property holds for the primes. It is noteworthy that almost no other set is known to have the property thatshort proofs for membership or nonmembership exist for all can...