🤖 AI Summary
This work resolves the long-standing open problem posed by Gat and Goldwasser: can an $n$-bit prime be *pseudodeterministically constructed* in polynomial time? That is, does there exist a polynomial-time randomized algorithm that, with high probability, outputs a unique, canonical $n$-bit prime? The authors introduce a novel bootstrapping construction that integrates an enhanced hardness-to-randomness framework (Chen–Tell), a variant of the Shaltiel–Umans generator, and a customized quantified derandomization technique. Their approach yields the first polynomial-time pseudodeterministic prime generator that succeeds infinitely often. This result markedly improves upon the subexponential-time solution of Oliveira and Santhanam, requires no unproven assumptions, and generalizes to all polynomial-time decidable dense string properties.
📝 Abstract
A randomized algorithm for a search problem is pseudodeterministic if it produces a fixed canonical solution to the search problem with high probability. In their seminal work on the topic, Gat and Goldwasser [1] posed as their main open problem whether prime numbers can be pseudodeterministically constructed in polynomial time. We provide a positive solution to this question in the infinitely-often regime. In more detail, we give an unconditional polynomial-time randomized algorithm B such that, for infinitely many values of $n, Bleft(1^{n}
ight)$ outputs a canonical n-bit prime $p_{n}$ with high probability. More generally, we prove that for every dense property Q of strings that can be decided in polynomial time, there is an infinitely-often pseudodeterministic polynomial-time construction of strings satisfying Q. This improves upon a subexponential-time construction of Oliveira and Santhanam [2]. Our construction uses several new ideas, including a novel bootstrapping technique for pseudodeterministic constructions, and a quantitative optimization of the uniform hardness-randomness framework of Chen and Tell [3], using a variant of the Shaltiel-Umans generator [4].
