Introduction
A probability distribution D ′ D' D ′ polynomially dominates D D D if D ′ ( x ) ≥ D ( x ) / p ( ∣ x ∣ ) D'(x) \ge D(x)/p(|x|) D ′ ( x ) ≥ D ( x ) / p ( ∣ x ∣ ) for some polynomial p p p and all strings x x x . Domination lets average-case easiness travel: a language decidable in average polynomial time under D ′ D' D ′ is decidable in average polynomial time under every distribution that D ′ D' D ′ dominates [15 , 5 ] . A distribution that dominates every member of a class is therefore a single hardest distribution for the class, and we call a sampler with this property universal for the class. Gurevich [10 ] introduced a weaker relation that also transfers average polynomial time: D ′ D' D ′ dominates D D D on average if D ( x ) ≤ f ( x ) D ′ ( x ) D(x) \le f(x)D'(x) D ( x ) ≤ f ( x ) D ′ ( x ) for some f f f that is polynomial on D D D -average, that is, if the likelihood ratio D / D ′ D/D' D / D ′ has a polynomially bounded positive moment under D D D .
Universal objects of this kind are classical in Kolmogorov complexity, where the universal semimeasure dominates every enumerable semimeasure [20 ] . In the polynomial-time world they are hard to come by. For each fixed polynomial p p p there are polynomial-time computable distributions universal for the p p p -time computable ones [25 , 26 ] , with a construction that allows a polynomial overhead in p p p ; strict polynomial-time samplers contain no universal member if F P = # P \mathrm{FP} = \#\mathrm{P} FP = # P [31 ] (Theorem I.9); and Antunes and Fortnow obtain universality of time-bounded Kolmogorov distributions only under a hardness assumption [1 ] .
The obvious way out is to let the universal sampler run long on rare occasions: choose a random machine and a random clock, and pay for long clocks with small probabilities. Whether this works depends on how runtime is measured. We measure it by moments. For real r > 0 r > 0 r > 0 , let S r S_r S r be the samplers whose r r r th runtime moment E [ T ( n ) r ] \mathbb{E}[T(n)^r] E [ T ( n ) r ] is polynomially bounded at every output length n n n . Expected polynomial time is the case r = 1 r = 1 r = 1 , and r < 1 r < 1 r < 1 is the sampler-side analogue of the fractional moments in Levin’s average polynomial time [15 ] . We ask what a sampler with polynomial a a a th moment can guarantee against S r S_r S r , and in particular for which r r r the class S r S_r S r has a universal member. The answer is governed by the first moment and by the single function
B ( a , r ) = 1 + max { 0 , a − min { r , 1 } } r . B(a,r) = 1 + \frac{\max\{0, a - \min\{r,1\}\}}{r}. B ( a , r ) = 1 + r max { 0 , a − min { r , 1 }} .
Results
Results are stated relative to an oracle unless said otherwise, in a model that charges for writing query strings (§ 2 ). We write U O ( r ) \mathcal{U}^{O}(r) U O ( r ) for the supremum of the orders a > 0 a > 0 a > 0 such that some sampler in S a O S_a^O S a O polynomially dominates every member of S r O S_r^O S r O .
Three results carry the paper. The first is a sharp Rényi frontier: one sampler of order a a a has Rényi divergence O ( log n ) O(\log n) O ( log n ) of order B / ( B − 1 ) B/(B - 1) B / ( B − 1 ) from every source of order r r r , and relative to an oracle no larger order is possible (Theorem 1.2). Its endpoint B = 1 B = 1 B = 1 , divergence of infinite order, is polynomial domination; it is reached exactly when a ≤ min { r , 1 } a \le\min\{r,1\} a ≤ min { r , 1 } , which is the first-moment threshold of Theorem 1.1. The second is a frontier for algorithms: polynomial runtime moments of a deterministic decider transfer from one fixed sampler to every source of order r r r with an exact exponent q ∗ q^* q ∗ (Theorem 1.4). For running times this exponent can beat the exponent 1 / B 1/B 1/ B that holds for arbitrary costs, but only above the critical moment v = a v = a v = a , and it jumps there. The third is that the lower bounds hold against every correct bounded-error solver of a sparse language in U P ∩ c o U P \mathrm{UP} \cap\mathrm{coUP} UP ∩ coUP , relative to oracles, so the frontier constrains computational problems and not only distributions.
Theorem 1.1 (The first-moment threshold; Theorems 3.4, 6.1 and 6.8).
For every oracle O O O and every rational 0 < r ≤ 1 0 < r \le1 0 < r ≤ 1 , one sampler Q r ∈ S r O Q_r \in S_r^O Q r ∈ S r O polynomially dominates every member of S r O S_r^O S r O .
There is one oracle O O O such that, for every real a > 1 a > 1 a > 1 and every Q ∈ S a O Q \in S_{a}^{O} Q ∈ S a O , some sampler A A A is not polynomially dominated by Q Q Q , where A A A uses polynomial space, has polynomial runtime moments of every fixed order, and has worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) .
Consequently, for this O O O and every real r > 0 r > 0 r > 0 , U O ( r ) = min { r , 1 } U^{O}(r) = \min\{r,1\} U O ( r ) = min { r , 1 } , also when the sources are restricted to polynomial space, and the supremum is attained for every r ≥ 1 r \ge1 r ≥ 1 and every rational r r r .
Since Q 1 Q_{1} Q 1 lies in S 1 O S_{1}^{O} S 1 O and dominates all of S 1 O S_{1}^{O} S 1 O , the obstruction above one sits entirely on the side of the candidate: keeping a higher moment is what costs. The price is exactly B ( a , r ) B(a,r) B ( a , r ) .
Theorem 1.2 (The frontier; Theorems 3.3 , 4.4 , 4.6 and 6.6 ). For every oracle and every rational a > 0 a > 0 a > 0 there is one sampler Q a ∈ S a Q_{a} \in S_{a} Q a ∈ S a such that, for every real r > 0 r > 0 r > 0 and every A ∈ S r A \in S_{r} A ∈ S r , with B = B ( a , r ) B = B(a,r) B = B ( a , r ) :
P Q a ( x ∣ n ) ≥ P A ( x ∣ n ) B / poly A , a , r ( n ) P_{Q_{a}}(x \mid n) \ge P_{A}(x \mid n)^{B}/\operatorname{poly}_{A,a,r}(n) P Q a ( x ∣ n ) ≥ P A ( x ∣ n ) B / poly A , a , r ( n ) for all x x x ;
the Rényi divergence of P A P_{A} P A from P Q a P_{Q_{a}} P Q a of order B / ( B − 1 ) B/(B-1) B / ( B − 1 ) , read as ∞ \infty ∞ when B = 1 B = 1 B = 1 , is O A , a , r ( log n ) O_{A,a,r}(\log n) O A , a , r ( log n ) , so for every v > 0 v > 0 v > 0 and every F ≥ 0 F \ge0 F ≥ 0 on { 0 , 1 } n \{0,1\}^{n} { 0 , 1 } n , such as the running time of a decider,
E x ∼ P A [ F ( x ) v / B ] ≤ poly A , a , r , v ( n ) ( E x ∼ P Q a [ F ( x ) v ] ) 1 / B . \mathop{\mathbb{E}}_{x\sim P_{A}}\left[F(x)^{v/B}\right]\le\operatorname{poly}_{A,a,r,v}(n)\left(\mathop{\mathbb{E}}_{x\sim P_{Q_{a}}}\left[F(x)^{v}\right]\right)^{1/B}. E x ∼ P A [ F ( x ) v / B ] ≤ poly A , a , r , v ( n ) ( E x ∼ P Q a [ F ( x ) v ] ) 1/ B .
Relative to the oracle of Theorem 1.1 , for all real a , r > 0 a,r > 0 a , r > 0 , no sampler in S a S_{a} S a achieves power below B ( a , r ) B(a,r) B ( a , r ) in the first sense, or a logarithmic Rényi divergence of order above B / ( B − 1 ) B/(B-1) B / ( B − 1 ) in the second, already against polynomial-space sources in S r S_{r} S r with worst-case time 2 o ( n ) 2^{o(n)} 2 o ( n ) .
For example, a candidate keeping a second moment achieves powers 2 2 2 , 3 / 2 3/2 3/2 and 5 / 4 5/4 5/4 against S 1 S_{1} S 1 , S 2 S_{2} S 2 and S 4 S_{4} S 4 , and has polynomial χ 2 \chi^{2} χ 2 -divergence from every expected-polynomial-time sampler; these are optimal. The second part is stronger than the first: pointwise power domination alone bounds no likelihood-ratio moment. With Gurevich’s transfer it gives a hardest ensemble for Levin’s average polynomial time at every moment order, also where domination fails (Theorem 4.9). That qualitative consequence also follows from a direct analysis of a plain clock mixture, which runs a random program for a random number of steps; what is new is the sharp order B / ( B − 1 ) B/(B-1) B / ( B − 1 ) , including its endpoint, and its optimality.
Read with F F F the error probability of a heuristic, the second part says that an error rate ε \varepsilon ε under Q a Q_{a} Q a is at most poly ( n ) ε 1 / B \operatorname{poly}(n)\varepsilon^{1/B} poly ( n ) ε 1/ B under every source in S r S_{r} S r (Theorem 4.7 ): testing on inputs whose generation time has a polynomially bounded second moment costs a square root of the error rate against expected-polynomial-time generators, and relative to an oracle no less.
Theorem 1.3 (Not even infinitely often; Theorem 6.13 ). There is a computable oracle O i o O_{\mathrm{io}} O io relative to which parts 2 and 3 of Theorem 1.1 and the optimality statement of Theorem 1.2 hold with failures at all large lengths, by factors 2 n 1 − ε 2^{n^{1-\varepsilon}} 2 n 1 − ε for every ε > 0 \varepsilon> 0 ε > 0 .
Algorithms. The frontier also governs the running times of actual algorithms. For rationals a , r , v > 0 a,r,v > 0 a , r , v > 0 put s = min { r , 1 } s = \min\{r,1\} s = min { r , 1 } and
q ∗ ( a , r , v ) = { v / B ( a , r ) if a ≥ s , v s / a if a < s and v > a , v if a < s and v ≤ a . q^{*}(a,r,v)=
\begin{cases}
v/B(a,r) & \text{if } a \ge s,\\
vs/a & \text{if } a < s \text{ and } v > a,\\
v & \text{if } a < s \text{ and } v \le a.
\end{cases} q ∗ ( a , r , v ) = ⎩ ⎨ ⎧ v / B ( a , r ) v s / a v if a ≥ s , if a < s and v > a , if a < s and v ≤ a .
Theorem 1.4 (Correct solvers; Theorems 4.8 , 6.2 and 6.10 to 6.12 ).
For every oracle, a deterministic algorithm with polynomial v v v th moment under one fixed sampler of order a a a , the plain clock mixture Q a ′ Q_a' Q a ′ of Theorem 4.5, has polynomial moment of order q ∗ ( a , r , v ) q^*(a,r,v) q ∗ ( a , r , v ) under every member of S r \mathcal{S}_r S r .
There is an oracle, the oracle O O O of Theorem 1.1 outside the third case and an oracle depending only on v v v in the third, relative to which the following holds. For every candidate Q Q Q of order a a a there are a language L ∈ U P ∩ c o U P L \in\mathrm{UP} \cap\mathrm{coUP} L ∈ UP ∩ coUP with at most one member of each length, a deterministic decider D D D for L L L with polynomial v v v th moment under P Q P_Q P Q , and one source A ∈ S r A \in\mathcal{S}_r A ∈ S r such that, for every q > q ∗ ( a , r , v ) q > q^*(a,r,v) q > q ∗ ( a , r , v ) , every randomized algorithm deciding L L L with error at most 1 / 3 1/3 1/3 on every input has superpolynomial q q q th moment under A A A . In the third case D D D works for all candidates at once and the source is the uniform sampler.
Relative to the oracle of Theorem 1.1 , for every real a > 1 a > 1 a > 1 and every Q ∈ S a Q \in\mathcal{S}_a Q ∈ S a , the same holds with v = 1 v = 1 v = 1 , q = 1 q = 1 q = 1 and a source A A A with the properties of part 2 of Theorem 1.1 .
Part 3 says that the first moment is the threshold for solvers: domination by Q 1 Q_1 Q 1 transfers expected polynomial time, and nothing of higher order does. It separates expected time only, since the decider has every fractional moment below one polynomially bounded under A A A . Parts 1 and 2 give the exact transfer exponent. Where B ( a , r ) > 1 B(a,r) > 1 B ( a , r ) > 1 it is the ratio 1 / B 1/B 1/ B of Theorem 1.2 , optimal already for arbitrary costs. Where B ( a , r ) = 1 B(a,r) = 1 B ( a , r ) = 1 , running times do better than arbitrary costs, because whether an algorithm runs longer than t t t can be tested by running it; the gain appears only above the critical moment v = a v = a v = a , and the jump there is real.
Without a constructed oracle. For expected-polynomial-time sources the threshold needs no special oracle.
Theorem 1.5 (Expected-time sources; Theorems 8.2 , 8.4 , 8.6 , 8.9 and 8.11 and Theorem 8.10 ).
Relative to a random oracle, with probability 1, U ( r ) = r U(r) = r U ( r ) = r and the optimal power is B ( a , r ) B(a,r) B ( a , r ) for all real a > 0 a > 0 a > 0 and 0 < r ≤ 1 0 < r \le1 0 < r ≤ 1 , with every failure at all large lengths.
If some public chain is sequentially hard (Theorem 8.3), or some verifiable delay function with short public-coin seeds resists parallel speedup without preprocessing (Theorem 8.5), then without an oracle U ( r ) = r U(r) = r U ( r ) = r for every real 0 < r ≤ 1 0 < r \le1 0 < r ≤ 1 : Q 1 Q_1 Q 1 is universal for expected polynomial time, and no sampler of order above one is. Under the second hypothesis the optimal power is B ( a , r ) B(a,r) B ( a , r ) for all real a > 0 a > 0 a > 0 and 0 < r ≤ 1 0 < r \le1 0 < r ≤ 1 .
For rationals 0 < r ≤ a ≤ 1 0 < r \le a \le1 0 < r ≤ a ≤ 1 and 0 < v ≤ a 0 < v \le a 0 < v ≤ a , if no algorithm finds an accepted repeated-squaring record of delay 2 j 2^j 2 j in time 2 j / poly ( n ) 2^j/\operatorname{poly}(n) 2 j / poly ( n ) with probability 1 / 2 1/2 1/2 , uniformly in j j j , then one explicit sparse problem in U P ∩ c o U P \mathrm{UP} \cap\mathrm{coUP} UP ∩ coUP meets the exact solver exponent q ∗ ( a , r , v ) = v / r q^*(a,r,v) = v/r q ∗ ( a , r , v ) = v / r without an oracle. The same holds for r ≤ min { a , 1 } r \le\min\{a,1\} r ≤ min { a , 1 } and every q q q if a repeated squaring is tightly sequential (Theorem 8.7). For v > a v > a v > a and every 0 < r ≤ 1 0 < r \le1 0 < r ≤ 1 , including the amplification regime a < r a < r a < r , a problem in U P ∩ c o U P \mathrm{UP} \cap\mathrm{coUP} UP ∩ coUP that is not known to be sparse meets q ∗ q^* q ∗ under the two-stage conditions of Theorem 8.10 , and for a ≤ 1 a \le1 a ≤ 1 under constant-success hardness of both stages.
The hypothesis of part 2 asks only that iterating a polynomial-time function T = 2 n T = 2^{\sqrt{n}} T = 2 n times from a starting point computable from n n n admits no polynomial speedup at success probability 1 / T 1/T 1/ T ; iterated hashing and repeated squaring in class groups are natural candidates. The second hypothesis is the usual parallel-time sequentiality of verifiable delay functions on random instances, at constant success, with two changes that our proof needs: the seed is short, with T o ( 1 ) T^{o(1)} T o ( 1 ) values (O ( log T ) O(\log T) O ( log T ) bits suffice for the threshold), and the adversary may not precompute before seeing it. In exchange, constant success replaces negligible success.
Table 1. The universality profile U ( r ) U(r) U ( r ) and the all-moments question in each setting. C C C and ζ \zeta ζ are absolute constants, and a dash marks a question we leave open. Sources: Theorems 1.1 and 7.11 (every oracle); Theorems 1.1 and 6.13 (O O O , O i o O_{\mathrm{io}} O io ); Theorems 8.2 , 8.4 and 8.6 (random oracle, sequential hardness, VDF); Theorems 7.4, 7.5 and 7.10 (O ⋆ O_{\star} O ⋆ ); Theorems 7.7 , 7.9 and 7.10 (P = NP).
Barriers. For sources with all moments, and for internal universality above one, the threshold is not forced by relativizing reasoning.
Theorem 1.6 (Barriers; Theorems 7.2 , 7.4, 7.5 , 7.7 and 7.9 to 7.11 ).
There is an oracle O ⋆ O_{\star} O ⋆ , relative to which P = NP, such that for every rational r > 0 r>0 r > 0 some sampler in S r O ⋆ S_r^{O_{\star}} S r O ⋆ dominates every member of S r O ⋆ S_r^{O_{\star}} S r O ⋆ , and U O ⋆ ( r ) = r U^{O_{\star}}(r)=r U O ⋆ ( r ) = r for every real r > 0 r>0 r > 0 .
If P = NP, then for every real a > 1 a>1 a > 1 some sampler in S a S_a S a dominates every member of S a l l S_{\mathrm{all}} S all , and 1 ≤ U ( 1 ) ≤ C 1\leq U(1)\leq C 1 ≤ U ( 1 ) ≤ C for an absolute constant C C C .
If P = NP, and relative to every oracle with P = NP, including O ⋆ O_{\star} O ⋆ , no sampler in S a l l S_{\mathrm{all}} S all dominates every member of S a l l S_{\mathrm{all}} S all , with any finite power or on average; for every oracle one sampler in S a l l S_{\mathrm{all}} S all has Kullback–Leibler divergence O ( log n ) O(\log n) O ( log n ) from every member of every S r S_r S r .
So for every rational r > 1 r>1 r > 1 , “S r S_r S r has a universal member” holds relative to O ⋆ O_{\star} O ⋆ and fails relative to O O O , and an unrelativized proof of part 2 of Theorem 1.1 for any a > 1 a>1 a > 1 would imply P ≠ \ne = NP. Since P = NP relative to O ⋆ O_{\star} O ⋆ , no relativizing argument derives a loss in the order from P = NP either. For expected-polynomial-time sources no such barrier is known, which is consistent with Theorem 1.5 . Table 1 collects the profile in each setting.
Further results. Below one, the profile is attained at every real r r r whose binary approximations are computable in time 2 O ( 2 m ) 2^{O(2^m)} 2 O ( 2 m ) , relative to every oracle, while relative to O O O the set of attained orders is countable and misses some computable ones (Section A). B ( a , r ) B(a,r) B ( a , r ) is also the optimal coefficient in a coding theorem for public-coin time-bounded Kolmogorov complexity (Section E), Q a Q_a Q a characterizes worst-case running times of average-case algorithms (Section F), and for polynomial-space sources a PSPACE-complete oracle gives one universal sampler with all moments, which must use more than polynomial space (§ 19 ).
Techniques
Killed restarts. The positive results run trials of the source, discard those that halt before time t t t , and kill the whole procedure with probability 1 / ( 2 t ) 1/(2t) 1/ ( 2 t ) before every simulated step. The total work is geometric with mean about t t t whatever the source does, and an output of the bucket [ t , 2 t ) [t,2t) [ t , 2 t ) is reached with probability at least π t min { r , 1 } / ( 6 μ ) \pi_t^{\min\{r,1\}}/(6\mu) π t m i n { r , 1 } / ( 6 μ ) , where μ \mu μ is the source’s r r r th moment. This is where the first moment enters: discarded trials cost linear time, and the r r r th moment pays for at most linear time once r ≥ 1 r\geq1 r ≥ 1 . A universal sampler picks a program and a scale j j j , passes a gate of probability 2 − a j 2^{-aj} 2 − aj , and runs the killed restart at t = 2 j t=2^j t = 2 j ; optimizing the scale gives the power B ( a , r ) B(a,r) B ( a , r ) . For the Rényi bound the contributions of all scales are added at each output before Hölder’s inequality is applied, which keeps the source’s moment separate at each output and sums it only at the end. Killed restarts are an analytic device more than a new sampler: the plain clock mixture runs, among its programs, the fixed program that performs a killed restart, so it also attains the power B ( a , r ) B(a,r) B ( a , r ) and the sharp Rényi order, up to a polynomial factor (Theorem 4.5). Its direct analysis gives only the order 1 + r / a 1+r/a 1 + r / a .
The negative oracle. The whole lower-bound idea for one pair ( a , r ) (a,r) ( a , r ) is the analysis of a single finite block (§ 5 ); § 6 interleaves blocks only so that one oracle defeats every candidate, at every order and for the solver statements, simultaneously. The oracle O O O is built in stages. A stage aimed at a candidate Q Q Q places a block of N N N gate seeds and a chain of T T T hidden labels ending in a random terminal W W W ; a positive gate reveals the head, and reaching W W W takes T T T sequential queries. In the good world one seed is positive, and the source picks a random seed and walks the chain, giving W W W probability 1 / N 1/N 1/ N at cost about T r / N ≤ 1 T^r/N \le1 T r / N ≤ 1 in its r r r th moment. If Q Q Q rarely outputs W W W , it fails to dominate. Otherwise its successful runs halt at some scale V V V , and we move to a bad world with about N / V N/V N / V positive seeds. Runs that touch at most 2 V 2V 2 V seeds cannot tell the worlds apart, so these runs keep their probability multiplied by about N / V N/V N / V , and Q Q Q runs for time V V V with probability about 1 / V 1/V 1/ V ; its ρ \rho ρ th moment picks up V ρ − 1 V^{\rho-1} V ρ − 1 , large for every ρ > 1 \rho>1 ρ > 1 . Charging the candidate’s own halting scale is the point: spending more time to detect the density only enlarges the certificate, so the source exponent can grow without bound and the sources end up with all moments. A threshold 1 / N b 1/N^b 1/ N b in place of 1 / N 1/N 1/ N gives the power tradeoff, and a chain behind a public head, entered with probability T − γ T^{-\gamma} T − γ , gives the sources below one. The oracle O i o O_{\mathrm{io}} O io instead fixes blocks one at a time and draws positive seeds and labels from pools that earlier requirements rarely query, so that every pooled block protects all earlier requirements deterministically and each source wins at every large length.
Solvers. A block also carries a verification table with one positive entry, chosen after the block against a solver, so that a correct solver must search about H H H entries on the terminal; candidates are analysed through a monitor that never queries the table. The upper bound for running times when B ( a , r ) = 1 B(a,r)=1 B ( a , r ) = 1 uses a program that samples from the source until it finds an input on which the decider runs longer than t t t : its expected cost is about 1 / p ( t ) 1/p(t) 1/ p ( t ) , the fixed sampler gives its output set probability about p ( t ) v p(t)^v p ( t ) v , and comparing with the v v v th moment gives p ( t ) ≤ poly ( n ) t − v / a p(t)\le\operatorname{poly}(n)t^{-v/a} p ( t ) ≤ poly ( n ) t − v / a , which integrates to the ( v / a ) (v/a) ( v / a ) th moment exactly when v > a v>a v > a . At v ≤ a v\le a v ≤ a an oracle with random delays, learnable only through threshold queries written in unary, shows that no gain is possible. When a ≤ 1 a\le1 a ≤ 1 a candidate cannot even find one positive seed among N N N , so strict polynomial-time sources suffice for the lower bound.
Sequential chains. Against expected-polynomial-time sources only the chain is needed, not the gate: the source enters the chain with probability 1 / T 1/T 1/ T , and any candidate that outputs its terminal with probability about 1 / T 1/T 1/ T must spend time T 1 − o ( 1 ) T^{1-o(1)} T 1 − o ( 1 ) on those runs. An iterated random function has this property with probability one, and Theorem 8.3 asks for it without an oracle. For decision problems, a correct solver reconstructs a whole second sequential output bit by bit, and for repeated squaring the order of the base element, with its factorization, is a unique certificate for every iterate, which gives U P ∩ c o U P \mathrm{UP}\cap\mathrm{coUP} UP ∩ coUP .
Barriers. The oracle O ⋆ O_\star O ⋆ answers threshold queries about the output law of a machine conditioned on surviving to time t t t . A sample from the surviving runs removes the loss of the killed restart, and under P = N P P = NP P = N P uniform generation of witnesses supplies such samples at a polynomial loss in the order. The same deterministic access lets a source with all moments find, at every scale, a string that the candidate’s short runs avoid and pay for each scale with a gate tuned to the candidate’s own tail; this is why no sampler with all moments is universal for all-moments sources there.
Related work
Levin [15 ] and Ben-David, Chor, Goldreich and Luby [5 ] transfer average polynomial time along pointwise domination, Gurevich [10 ] along domination on average, studied further in [28 , 3 , 31 ] ; Impagliazzo and Levin [13 ] relate samplable and uniform distributions through reductions. None of these treats samplers under runtime-moment constraints or determines an optimal power or likelihood-ratio moment. Universal distributions for computable distributions under a fixed time bound [25 , 26 ] , the nonexistence of universal strict samplers under F P = # P \mathrm{FP} = \#\mathrm{P} FP = # P [31 ] , universality of time-bounded Kolmogorov distributions under hardness assumptions [1 ] , and coding theorems for p K t \mathrm{pK}^t pK t for time-bounded samplers [9 , 17 ] concern different objects; we compare them in § 9 . Restarts go back to Luby, Sinclair and Zuckerman [18 ] , and uniform generation of witnesses to [14 , 8 ] . The sequential functions of § 8 are related to time-lock puzzles and verifiable delay functions [23 , 4 , 30 , 22 , 21 ] , whose security notions concern parallel adversaries on random instances; Theorem 8.6 uses such a notion with short seeds and no preprocessing.
Organization. Section 2 fixes the model. Section 3 proves the positive results, and Section 4 the average-case consequences, including Rényi universality, moment transfer and the amplification for running times. Section 5 develops the oracle blocks and Section 6 builds the negative oracles, including the exact frontier for solvers. Section 7 gives the positive oracle, the P versus NP barrier and the all-moments endpoint, and Section 8 treats expected-time sources without a constructed oracle. Sections 9 and 10 discuss related work and open questions, and the appendices contain the remaining proofs and further results.
Model
Samplers. A sampler is a fixed uniform private-coin oracle Turing machine that on input 1 n 1^n 1 n outputs a string in { 0 , 1 } n \{0,1\}^n { 0 , 1 } n . When an arbitrary oracle machine is viewed as a sampler, an output outside { 0 , 1 } n \{0,1\}^n { 0 , 1 } n is replaced by 0 n 0^n 0 n ; this does not change runtimes. Its coins are independent fair bits. The oracle O O O is one fixed language; it is not a source of fresh randomness. We write P A O ( x ∣ n ) P_A^O(x \mid n) P A O ( x ∣ n ) for the output law of A A A on 1 n 1^n 1 n and T A O ( n ) ≥ 1 T_A^O(n) \ge1 T A O ( n ) ≥ 1 for its runtime. Writing a query string costs one step per symbol, and an oracle answer bit costs one step. A universal machine simulates t t t steps of a given machine in time t ⋅ poly ( n , log t ) t \cdot\operatorname{poly}(n,\log t) t ⋅ poly ( n , log t ) . All logarithms are to base two.
Classes. For real r > 0 r > 0 r > 0 , S r O \mathcal{S}_r^O S r O is the class of samplers A A A that halt almost surely and satisfy
E [ T A O ( n ) r ] ≤ C A ( n + 2 ) c A for every n , \mathbb{E}\left[T_A^O(n)^r\right] \le C_A(n+2)^{c_A} \qquad\text{for every } n, E [ T A O ( n ) r ] ≤ C A ( n + 2 ) c A for every n ,
with constants depending on A A A and r r r . Since runtimes are at least one, S a O ⊆ S r O \mathcal{S}_a^O \subseteq\mathcal{S}_r^O S a O ⊆ S r O for a ≥ r a \ge r a ≥ r . We put S a l l O = ⋂ m ≥ 1 S m O \mathcal{S}_{\mathrm{all}}^O = \bigcap_{m\ge1}\mathcal{S}_m^O S all O = ⋂ m ≥ 1 S m O ; a sampler in S a l l O \mathcal{S}_{\mathrm{all}}^O S all O has a polynomial moment of every fixed order, with the polynomial allowed to depend on the order. W O \mathcal{W}^O W O is the class of almost-surely halting samplers with a polynomial bound on work and query-tape space along every computation path, and P O \mathcal{P}^O P O is the class of samplers with a polynomial bound on the runtime of every path (strict samplers ).
Domination. A sampler Q Q Q polynomially dominates A A A , written Q ⪰ A Q \succeq A Q ⪰ A , if there are constants C , c C,c C , c depending on A A A such that for all sufficiently large n n n and all x ∈ { 0 , 1 } n x \in\{0,1\}^{n} x ∈ { 0 , 1 } n ,
P Q O ( x ∣ n ) ≥ P A O ( x ∣ n ) C ( n + 2 ) c . P_{Q}^{O}(x \mid n) \ge\frac{P_{A}^{O}(x \mid n)}{C(n+2)^{c}}. P Q O ( x ∣ n ) ≥ C ( n + 2 ) c P A O ( x ∣ n ) .
Domination is transitive: multiply the loss factors and take the larger threshold. Q Q Q is universal for a class C \mathcal{C} C if Q ⪰ A Q \succeq A Q ⪰ A for every A ∈ C A \in\mathcal{C} A ∈ C . Q Q Q dominates A A A infinitely often if the displayed inequality holds for all x ∈ { 0 , 1 } n x \in\{0,1\}^{n} x ∈ { 0 , 1 } n at infinitely many n n n .
Power domination. Q Q Q dominates A A A with power β ≥ 1 \beta\ge1 β ≥ 1 if
P Q O ( x ∣ n ) ≥ P A O ( x ∣ n ) β [ C ( n + 2 ) c ] β P_{Q}^{O}(x \mid n) \ge\frac{P_{A}^{O}(x \mid n)^{\beta}}{[C(n+2)^{c}]^{\beta}} P Q O ( x ∣ n ) ≥ [ C ( n + 2 ) c ] β P A O ( x ∣ n ) β
under the same quantifiers. Power one is polynomial domination.
The profile. We write
U O ( r ) = sup { a > 0 : some Q ∈ S a O is universal for S r O } . \mathcal{U}^{O}(r) = \sup\{a > 0 : \text{some } Q \in\mathcal{S}_{a}^{O} \text{ is universal for } \mathcal{S}_{r}^{O}\}. U O ( r ) = sup { a > 0 : some Q ∈ S a O is universal for S r O } .
Notation. The table lists symbols that are used across sections; symbols local to one proof are introduced there.
Table 2.
Killed restarts and the power tradeoff
Throughout this section the oracle O O O is fixed and arbitrary, and we suppress it from the notation. Recall power domination from § 2 . Powers below one are impossible against the uniform source, since ∑ x P Q ( x ∣ n ) = 1 \sum_x P_Q(x \mid n)=1 ∑ x P Q ( x ∣ n ) = 1 .
Choosing a runtime scale
Lemma 3.1. Let A A A halt almost surely on 1 n 1^n 1 n , let r > 0 r>0 r > 0 , μ = E [ T A ( n ) r ] < ∞ \mu=\mathbb{E}[T_A(n)^r]<\infty μ = E [ T A ( n ) r ] < ∞ , and let π = P A ( x ∣ n ) > 0 \pi=P_A(x\mid n)>0 π = P A ( x ∣ n ) > 0 . Put H = ( 4 μ / π ) 1 / r H=(4\mu/\pi)^{1/r} H = ( 4 μ / π ) 1/ r and M = max { 1 , ⌈ log H ⌉ } M=\max\{1,\lceil\log H\rceil\} M = max { 1 , ⌈ log H ⌉} . Some power of two t < H t<H t < H satisfies
π t : = Pr [ A ( 1 n ) = x , t ≤ T A ( n ) < 2 t ] ≥ 3 π 4 M . \pi_t := \Pr[A(1^n)=x,\ t\le T_A(n)<2t] \ge\frac{3\pi}{4M}. π t := Pr [ A ( 1 n ) = x , t ≤ T A ( n ) < 2 t ] ≥ 4 M 3 π .
and α : = Pr [ T A ( n ) ≥ t ] \alpha:= \Pr[T_A(n) \ge t] α := Pr [ T A ( n ) ≥ t ] satisfies α ≥ π t \alpha\ge\pi_t α ≥ π t and α t r ≤ μ \alpha t^r \le\mu α t r ≤ μ .
Proof. Markov’s inequality gives Pr [ T A ≥ H ] ≤ π / 4 \Pr[T_A \ge H] \le\pi/4 Pr [ T A ≥ H ] ≤ π /4 . Since T A ≥ 1 T_A \ge1 T A ≥ 1 and H > 1 H > 1 H > 1 , the M M M buckets [ 2 b , 2 b + 1 ) [2^b,2^{b+1}) [ 2 b , 2 b + 1 ) with 2 b < H 2^b < H 2 b < H carry at least 3 π / 4 3\pi/4 3 π /4 of the executions that output x x x , so one of them carries 3 π / ( 4 M ) 3\pi/(4M) 3 π / ( 4 M ) . The last claim is Markov’s inequality again.
Killed restarts
Fix a machine p p p , a length n n n , and a power of two t ≥ 1 t \ge1 t ≥ 1 . The procedure R t ( p ) R_t(p) R t ( p ) runs trials of p p p on 1 n 1^n 1 n with fresh coins. Before each simulated step of the current trial it tosses log ( 2 t ) \log(2t) log ( 2 t ) fresh coins and, if all are zero, kills the whole procedure and outputs 0 n 0^n 0 n ; this happens with probability 1 / ( 2 t ) 1/(2t) 1/ ( 2 t ) per step. A trial that halts before step t t t is discarded and a new trial starts. A trial that halts at a step in [ t , 2 t ) [t,2t) [ t , 2 t ) ends the procedure with that trial’s output, replaced by 0 n 0^n 0 n if malformed. A trial that reaches step 2 t 2t 2 t without halting ends the procedure with output 0 n 0^n 0 n .
Lemma 3.2 (Killed restarts). Let A A A be a sampler with description p p p , let r > 0 r > 0 r > 0 with μ = E [ T A ( n ) r ] < ∞ \mu= \mathbb{E}[T_A(n)^r] < \infty μ = E [ T A ( n ) r ] < ∞ , let s = min { r , 1 } s = \min\{r,1\} s = min { r , 1 } , and let π t \pi_t π t be as in Theorem 3.1. Then
Pr [ R t ( p ) = x ] ≥ π t t s 6 μ . (1) \Pr[R_t(p)=x] \ge\frac{\pi_t t^s}{6\mu}. \tag*{(1)} Pr [ R t ( p ) = x ] ≥ 6 μ π t t s . (1) Let K K K be the number of simulated steps attempted, including a step at which the procedure is killed. Then Pr [ K > m ] ≤ ( 1 − 1 / ( 2 t ) ) m \Pr[K > m] \le(1 - 1/(2t))^m Pr [ K > m ] ≤ ( 1 − 1/ ( 2 t ) ) m for all m m m , so E [ K a ] ≤ C a t a \mathbb{E}[K^a] \le C_a t^a E [ K a ] ≤ C a t a for every real a > 0 a > 0 a > 0 , whatever the machine p p p . The runtime of R t ( p ) R_t(p) R t ( p ) is at most ( K + 1 ) poly ( n , ∣ p ∣ , log t ) (K+1)\operatorname{poly}(n,|p|,\log t) ( K + 1 ) poly ( n , ∣ p ∣ , log t ) .
Proof. Let z = 1 − 1 / ( 2 t ) z = 1 - 1/(2t) z = 1 − 1/ ( 2 t ) and
f = E [ z T A 1 { T A < t } ] , g = E [ z T A 1 { A = x , t ≤ T A < 2 t } ] . f = \mathbb{E}\left[z^{T_A}1\{T_A < t\}\right], \qquad g = \mathbb{E}\left[z^{T_A}1\{A=x,t \le T_A < 2t\}\right]. f = E [ z T A 1 { T A < t } ] , g = E [ z T A 1 { A = x , t ≤ T A < 2 t } ] .
A trial is discarded and restarted with probability f f f and ends the procedure with output x x x in the designated way with probability g g g . Since f ≤ z < 1 f \le z < 1 f ≤ z < 1 and trials are independent, the designated success probability is g / ( 1 − f ) g/(1-f) g / ( 1 − f ) ; for x = 0 n x=0^n x = 0 n other endings only add probability. Since z 2 t ≥ 1 / 4 z^{2t} \ge1/4 z 2 t ≥ 1/4 , g ≥ π t / 4 g \ge\pi_t/4 g ≥ π t /4 . Moreover
1 − f = α + E [ ( 1 − z T A ) 1 { T A < t } ] ≤ α + E [ T A 1 { T A < t } ] 2 t . 1-f = \alpha+ \mathbb{E}\left[(1-z^{T_A})1\{T_A < t\}\right] \le\alpha+ \frac{\mathbb{E}[T_A1\{T_A < t\}]}{2t}. 1 − f = α + E [ ( 1 − z T A ) 1 { T A < t } ] ≤ α + 2 t E [ T A 1 { T A < t }] .
If r ≤ 1 r \le1 r ≤ 1 , then α ≤ μ t − r \alpha\le\mu t^{-r} α ≤ μ t − r and u ≤ t 1 − r u r u \le t^{1-r}u^r u ≤ t 1 − r u r for u < t u < t u < t , so 1 − f ≤ 3 2 μ t − r 1-f \le\frac{3}{2}\mu t^{-r} 1 − f ≤ 2 3 μ t − r . If r ≥ 1 r \ge1 r ≥ 1 , then α ≤ μ t − r ≤ μ t − 1 \alpha\le\mu t^{-r} \le\mu t^{-1} α ≤ μ t − r ≤ μ t − 1 and E [ T A ] ≤ μ \mathbb{E}[T_A] \le\mu E [ T A ] ≤ μ , so 1 − f ≤ 3 2 μ t − 1 1-f \le\frac{3}{2}\mu t^{-1} 1 − f ≤ 2 3 μ t − 1 . Dividing gives (1).
Each attempted step is killed independently with probability 1 / ( 2 t ) 1/(2t) 1/ ( 2 t ) , so Pr [ K > m ] ≤ z m ≤ e − m / ( 2 t ) \Pr[K > m] \le z^m \le e^{-m/(2t)} Pr [ K > m ] ≤ z m ≤ e − m / ( 2 t ) , and the exponential tail gives the moment bound. Each trial simulates fewer than 2 t 2t 2 t steps, so nearly linear simulation costs poly ( n , ∣ p ∣ , log t ) \operatorname{poly}(n,|p|,\log t) poly ( n , ∣ p ∣ , log t ) per simulated step; resetting a trial costs at most the space it used plus initialization; and the kill coins cost O ( log t ) O(\log t) O ( log t ) per step. There are at most K + 1 K+1 K + 1 trials.
The factor t min { r , 1 } t^{\min\{r,1\}} t m i n { r , 1 } is where the first moment enters. Discarded trials cost linear time in their length, and once r ≥ 1 r \ge1 r ≥ 1 the r r r th moment cannot pay for more than linear time; for r < 1 r < 1 r < 1 it pays for exactly t r t^r t r . Section 6 shows that this is not an artifact of the procedure.
One sampler for all source orders
For a , r > 0 a,r>0 a , r > 0 put
B ( a , r ) = 1 + max { 0 , a − min { r , 1 } } r = { max { 1 , a / r } , 0 < r ≤ 1 , 1 + ( a − 1 ) + / r , r ≥ 1. B(a,r)=1+\frac{\max\{0,a-\min\{r,1\}\}}{r}=
\begin{cases}
\max\{1,a/r\}, & 0<r\le1,\\
1+(a-1)_{+}/r, & r\ge1.
\end{cases} B ( a , r ) = 1 + r max { 0 , a − min { r , 1 }} = { max { 1 , a / r } , 1 + ( a − 1 ) + / r , 0 < r ≤ 1 , r ≥ 1.
Theorem 3.3 (The power tradeoff). For every oracle and every rational a > 0 a>0 a > 0 there is one sampler Q a ∈ S a Q_a\in S_a Q a ∈ S a that, for every real r > 0 r>0 r > 0 , dominates every A ∈ S r A\in S_r A ∈ S r with power B ( a , r ) B(a,r) B ( a , r ) . More precisely, for large n n n ,
P Q a ( x ∣ n ) ≥ P A ( x ∣ n ) B ( a , r ) E [ T A ( n ) r ] B ( a , r ) poly A , a , r ( n ) . P_{Q_a}(x\mid n)\ge\frac{P_A(x\mid n)^{B(a,r)}}{\mathbb{E}[T_A(n)^r]^{B(a,r)}\operatorname{poly}_{A,a,r}(n)}. P Q a ( x ∣ n ) ≥ E [ T A ( n ) r ] B ( a , r ) poly A , a , r ( n ) P A ( x ∣ n ) B ( a , r ) . The sampler depends only on a a a .
Proof. On input 1 n 1^n 1 n the sampler Q a Q_a Q a does the following.
With probability 1 / 2 1/2 1/2 output a uniform string in { 0 , 1 } n \{0,1\}^n { 0 , 1 } n .
Otherwise choose λ , j ∈ { 0 , … , n 2 } \lambda,j\in\{0,\ldots,n^2\} λ , j ∈ { 0 , … , n 2 } by reading fixed numbers of bits, outputting 0 n 0^n 0 n on out-of-range values; each valid pair has probability at least 1 / [ 4 ( n 2 + 1 ) 2 ] 1/[4(n^2+1)^2] 1/ [ 4 ( n 2 + 1 ) 2 ] . Choose a uniform p ∈ { 0 , 1 } p\in\{0,1\} p ∈ { 0 , 1 } .
Toss ⌈ a j ⌉ \lceil aj\rceil ⌈ aj ⌉ coins; unless all are zero, output 0 n 0^n 0 n .
Run R 2 j ( p ) R_{2^j}(p) R 2 j ( p ) and output its result.
Moment. Steps 1–3 cost poly ( n ) \operatorname{poly}(n) poly ( n ) . Conditional on reaching step 4 with scale j j j , Theorem 3.2 bounds the a a a th moment of the remaining runtime by poly a ( n ) 2 a j \operatorname{poly}_a(n)2^{aj} poly a ( n ) 2 aj , since ∣ p ∣ ≤ n 2 |p|\le n^2 ∣ p ∣ ≤ n 2 and log t ≤ n 2 \log t\le n^2 log t ≤ n 2 . The gate passes with probability at most 2 − a j 2^{-aj} 2 − aj . Averaging over ( λ , j , p ) (\lambda,j,p) ( λ , j , p ) and using ( u + v ) a ≤ max { 1 , 2 a − 1 } ( u a + v a ) (u+v)^a\le\max\{1,2^{a-1}\}(u^a+v^a) ( u + v ) a ≤ max { 1 , 2 a − 1 } ( u a + v a ) gives E [ T Q a ( n ) a ] ≤ poly a ( n ) \mathbb{E}[T_{Q_a}(n)^a]\le\operatorname{poly}_a(n) E [ T Q a ( n ) a ] ≤ poly a ( n ) . No property of the simulated programs is used.
Domination. Let A ∈ S r A\in S_r A ∈ S r have description p A p_A p A , let μ = E [ T A ( n ) r ] ≤ C A ( n + 2 ) c A \mu=\mathbb{E}[T_A(n)^r]\le C_A(n+2)^{c_A} μ = E [ T A ( n ) r ] ≤ C A ( n + 2 ) c A , π = P A ( x ∣ n ) \pi=P_A(x\mid n) π = P A ( x ∣ n ) and s = min { r , 1 } s=\min\{r,1\} s = min { r , 1 } . If π ≤ 2 − n \pi\le2^{-n} π ≤ 2 − n , step 1 gives x x x probability at least $2^{-n-1}\ge\pi^\beta/2$ for every β ≥ 1 \beta\ge1 β ≥ 1 . Otherwise take t = 2 j < H t=2^j<H t = 2 j < H from Theorem 3.1. Since log H ≤ ( n + log ( 4 μ ) ) / r \log H\le(n+\log(4\mu))/r log H ≤ ( n + log ( 4 μ )) / r , for large n n n we have j ≤ n 2 j\le n^2 j ≤ n 2 and ∣ p A ∣ ≤ n 2 |p_A|\le n^2 ∣ p A ∣ ≤ n 2 . Taking the second branch (probability $1/2), selecting ( ∣ p A ∣ , j , p A ) (|p_A|,j,p_A) ( ∣ p A ∣ , j , p A ) (probability at least 2 − ∣ p A ∣ / [ 4 ( n 2 + 1 ) 2 ] 2^{-|p_A|}/[4(n^2+1)^2] 2 − ∣ p A ∣ / [ 4 ( n 2 + 1 ) 2 ] ), passing the gate (probability at least t − a / 2 t^{-a}/2 t − a /2 , since ⌈ a j ⌉ ≤ a j + 1 \lceil aj\rceil\le aj+1 ⌈ aj ⌉ ≤ aj + 1 ), and applying (1) gives
P Q a ( x ∣ n ) ≥ 2 − ∣ p A ∣ 16 ( n 2 + 1 ) 2 ⋅ t − a ⋅ π t t s 6 μ ≥ π t s − a μ poly A ( n ) . (2) P_{Q_a}(x\mid n)\ge\frac{2^{-|p_A|}}{16(n^2+1)^2}\cdot t^{-a}\cdot\frac{\pi_t t^s}{6\mu}\ge\frac{\pi t^{s-a}}{\mu\operatorname{poly}_A(n)}. \tag*{(2)} P Q a ( x ∣ n ) ≥ 16 ( n 2 + 1 ) 2 2 − ∣ p A ∣ ⋅ t − a ⋅ 6 μ π t t s ≥ μ poly A ( n ) π t s − a . (2)
using π t ≥ 3 π / ( 4 M ) \pi_t\ge3\pi/(4M) π t ≥ 3 π / ( 4 M ) and M = O A , r ( n ) M=O_{A,r}(n) M = O A , r ( n ) . If a ≤ s a\le s a ≤ s , use t s − a ≥ 1 t^{s-a}\ge1 t s − a ≥ 1 . If a > s a>s a > s , use t < H t<H t < H :
t s − a ≥ H − ( a − s ) = 4 − ( a − s ) / r ( π / μ ) ( a − s ) / r . t^{s-a}\ge H^{-(a-s)}=4^{-(a-s)/r}(\pi/\mu)^{(a-s)/r}. t s − a ≥ H − ( a − s ) = 4 − ( a − s ) / r ( π / μ ) ( a − s ) / r .
In both cases P Q a ( x ∣ n ) ≥ π B ( a , r ) / ( μ B ( a , r ) poly A , a , r ( n ) ) P_{Q_a}(x\mid n)\ge\pi^{B(a,r)}/(\mu^{B(a,r)}\operatorname{poly}_{A,a,r}(n)) P Q a ( x ∣ n ) ≥ π B ( a , r ) / ( μ B ( a , r ) poly A , a , r ( n )) .
For a ≤ min { r , 1 } a\le\min\{r,1\} a ≤ min { r , 1 } the power is one, so the cases a = r ≤ 1 a=r\le1 a = r ≤ 1 give universality.
Theorem 3.4 (Universality up to the first moment). For every oracle and every rational 0 < r ≤ 1 0<r\le1 0 < r ≤ 1 , the sampler Q r Q_r Q r of Theorem 3.3 lies in S r S_r S r and satisfies, for every A ∈ S r A\in S_r A ∈ S r and large n n n ,
P Q r ( x ∣ n ) ≥ P A ( x ∣ n ) E [ T A ( n ) r ] poly A , r ( n ) . P_{Q_r}(x\mid n)\ge\frac{P_A(x\mid n)}{\mathbb{E}[T_A(n)^r]\operatorname{poly}_{A,r}(n)}. P Q r ( x ∣ n ) ≥ E [ T A ( n ) r ] poly A , r ( n ) P A ( x ∣ n ) . In particular Q r Q_r Q r is universal for S r S_r S r .
Proof. This is Theorem 3.3 with a = r a=r a = r , where B ( r , r ) = 1 B(r,r)=1 B ( r , r ) = 1 .
Corollary 3.5 (All-moments sources). For every oracle, every rational a > 0 a>0 a > 0 and every ε > 0 \varepsilon>0 ε > 0 , the sampler Q a Q_a Q a dominates every A ∈ S a l l A\in S_{\mathrm{all}} A ∈ S all with power 1 + ε 1+\varepsilon 1 + ε . In particular, P Q a ( x ∣ n ) ≥ P A ( x ∣ n ) 2 − ε n / poly A , a , ε ( n ) P_{Q_a}(x\mid n)\ge P_A(x\mid n)2^{-\varepsilon n}/\operatorname{poly}_{A,a,\varepsilon}(n) P Q a ( x ∣ n ) ≥ P A ( x ∣ n ) 2 − ε n / poly A , a , ε ( n ) .
Proof. Choose r ≥ 1 r\ge1 r ≥ 1 with ( a − 1 ) + / r ≤ ε (a-1)_+/r\le\varepsilon ( a − 1 ) + / r ≤ ε ; then A ∈ S r A\in S_r A ∈ S r and B ( a , r ) ≤ 1 + ε B(a,r)\le1+\varepsilon B ( a , r ) ≤ 1 + ε . For the second form, strings with P A ( x ∣ n ) ≤ 2 − n P_A(x\mid n)\le2^{-n} P A ( x ∣ n ) ≤ 2 − n are covered by step 1, and otherwise P A 1 + ε ≥ P A 2 − ε n P_A^{1+\varepsilon}\ge P_A2^{-\varepsilon n} P A 1 + ε ≥ P A 2 − ε n .
So every power above one, and every loss factor 2 ε n 2^{\varepsilon n} 2 ε n , is achievable against all-moments sources by a candidate of any fixed order, relative to every oracle. § 6 shows that power one is not (Theorem 6.1) and that B ( a , r ) B(a,r) B ( a , r ) is optimal (Theorem 6.6 ). The constants depend on ε \varepsilon ε , so there is no limit argument giving power one.
Pointwise power domination alone does not transfer average-case easiness the way Theorem 4.1 does: with β > 1 \beta>1 β > 1 , the inequality P A β ≤ poly ( n ) P Q P_A^\beta\le\operatorname{poly}(n)P_Q P A β ≤ poly ( n ) P Q still allows P A / P Q P_A/P_Q P A / P Q to be exponentially large on many strings. The sampler Q a Q_a Q a satisfies a stronger integrated bound, and that bound does transfer it (§ 4.2 ).
Average-case complexity
Transfer along domination
We use Levin’s notion of average polynomial time in the formulation for ensembles indexed by length. A sampler A A A defines the ensemble ( P A O ( ⋅ ∣ n ) ) n (P_A^O(\cdot\mid n))_n ( P A O ( ⋅ ∣ n ) ) n . A language L L L is in AvgP under A A A if some deterministic oracle algorithm M M M decides L L L and, for some ε > 0 \varepsilon>0 ε > 0 ,
E x ∼ P A O ( ⋅ ∣ n ) [ t M ( x ) ε ] = O ( n ) , \mathop{\mathbb{E}}_{x\sim P_A^O(\cdot\mid n)}[t_M(x)^\varepsilon]=O(n), E x ∼ P A O ( ⋅ ∣ n ) [ t M ( x ) ε ] = O ( n ) ,
where t M ( x ) t_M(x) t M ( x ) is the running time of M M M on $x.
Proposition 4.1 (Transfer along domination). If Q ⪰ A Q\succeq A Q ⪰ A and L L L is in AvgP under Q Q Q , then L L L is in AvgP under A A A , with the same algorithm.
Proof. Let P A O ( x ∣ n ) ≤ C ( n + 2 ) c P Q O ( x ∣ n ) P_A^O(x\mid n)\le C(n+2)^cP_Q^O(x\mid n) P A O ( x ∣ n ) ≤ C ( n + 2 ) c P Q O ( x ∣ n ) for n ≥ n 0 n\ge n_0 n ≥ n 0 , and let E Q [ t M ε ] ≤ C ′ n \mathbb{E}_Q[t_M^\varepsilon]\le C'n E Q [ t M ε ] ≤ C ′ n . Then E A [ t M ε ] ≤ C C ′ ( n + 2 ) c + 1 \mathbb{E}_A[t_M^\varepsilon]\le CC'(n+2)^{c+1} E A [ t M ε ] ≤ C C ′ ( n + 2 ) c + 1 . Put ε ′ = ε / ( c + 1 ) \varepsilon'=\varepsilon/(c+1) ε ′ = ε / ( c + 1 ) . By Jensen’s inequality for the concave map u ↦ u 1 / ( c + 1 ) u\mapsto u^{1/(c+1)} u ↦ u 1/ ( c + 1 ) ,
E A [ t M ε ′ ] ≤ ( E A [ t M ε ] ) 1 / ( c + 1 ) ≤ ( C C ′ ) 1 / ( c + 1 ) ( n + 2 ) = O ( n ) . \mathbb{E}_A[t_M^{\varepsilon'}]\le\left(\mathbb{E}_A[t_M^\varepsilon]\right)^{1/(c+1)}\le(CC')^{1/(c+1)}(n+2)=O(n). E A [ t M ε ′ ] ≤ ( E A [ t M ε ] ) 1/ ( c + 1 ) ≤ ( C C ′ ) 1/ ( c + 1 ) ( n + 2 ) = O ( n ) .
Finitely many lengths below n 0 n_0 n 0 change only the constant.
The same argument works for errorless heuristic schemes, since domination by a factor p ( n ) p(n) p ( n ) multiplies failure probabilities by at most p ( n ) p(n) p ( n ) and schemes allow any inverse-polynomial failure bound.
Corollary 4.2 (A hardest ensemble up to the first moment). Let r ∈ ( 0 , 1 ] r\in(0,1] r ∈ ( 0 , 1 ] be rational, O O O any oracle, and Q r Q_r Q r the sampler of Theorem 3.4 . For every language L L L , L L L is in AvgP under every sampler in S r O S_r^O S r O if and only if L L L is in AvgP under Q r Q_r Q r .
Proof. One direction holds because Q r ∈ S r O Q_r\in S_r^O Q r ∈ S r O . The other is Theorem 4.1.
Two remarks fix the scope. First, the corollary keeps the language and the output space fixed. Impagliazzo and Levin [13 ] show that average-case hardness of NP on some strict polynomial-time samplable distribution yields hardness on the uniform distribution, but through randomized reductions that change both the language and the instances. Domination is a stronger relation and makes no use of NP. Second, relative to an oracle the negative results below rule out a universal sampler retaining a moment above one, so this corollary cannot be extended above one through domination. The conclusion itself does extend: § 4.2 obtains it at every moment order from a Rényi-divergence bound (Theorem 4.9).
Rényi universality
Relative to the oracle of § 6 , no sampler of order above one dominates all expected-polynomial-time samplers (Theorem 6.1), so Theorem 4.1 gives no hardest ensemble there. The sampler Q a Q_a Q a of Theorem 3.3 nevertheless satisfies an integrated bound that is enough for average-case complexity. The proof of Theorem 3.3 uses one runtime bucket for each output. Adding the contributions of all buckets before applying Hölder’s inequality bounds a Rényi divergence of the source from Q a Q_a Q a , with exactly the frontier B ( a , r ) B(a,r) B ( a , r ) of the power tradeoff, and Hölder’s inequality then transfers runtime moments of any decider from Q a Q_a Q a to the source.
For distributions P , q P,q P , q on { 0 , 1 } n \{0,1\}^{n} { 0 , 1 } n with q > 0 q>0 q > 0 everywhere and real α > 1 \alpha>1 α > 1 put
R α ( P ∥ q ) = ∑ x P ( x ) α q ( x ) α − 1 , D α ( P ∥ q ) = log R α ( P ∥ q ) α − 1 , D ∞ ( P ∥ q ) = log max x P ( x ) q ( x ) R_{\alpha}(P\mathbin{\|}q)=\sum_x\frac{P(x)^{\alpha}}{q(x)^{\alpha-1}},\qquad D_{\alpha}(P\mathbin{\|}q)=\frac{\log R_{\alpha}(P\mathbin{\|}q)}{\alpha-1},\qquad D_{\infty}(P\mathbin{\|}q)=\log\max_x\frac{P(x)}{q(x)} R α ( P ∥ q ) = x ∑ q ( x ) α − 1 P ( x ) α , D α ( P ∥ q ) = α − 1 log R α ( P ∥ q ) , D ∞ ( P ∥ q ) = log x max q ( x ) P ( x )
D α D_{\alpha} D α is nondecreasing in α \alpha α , and D ∞ = O ( log n ) D_{\infty}=O(\log n) D ∞ = O ( log n ) is polynomial domination. We write P A P_A P A for P A O ( ⋅ ∣ n ) P_A^O(\mathord{\cdot}\mid n) P A O ( ⋅ ∣ n ) and q a q_a q a for P Q a O ( ⋅ ∣ n ) P_{Q_a}^O(\mathord{\cdot}\mid n) P Q a O ( ⋅ ∣ n ) ; note q a ( x ) ≥ 2 − n − 1 q_a(x)\ge2^{-n-1} q a ( x ) ≥ 2 − n − 1 by step 1 of Q a Q_a Q a .
Relation to domination on average. With W = P A / q a W=P_A/q_a W = P A / q a ,
R 1 + η ( P A ∥ q a ) = E x ∼ P A [ W ( x ) η ] , R_{1+\eta}(P_A\mathbin{\|}q_a)=\mathbb{E}_{x\sim P_A}\left[W(x)^{\eta}\right], R 1 + η ( P A ∥ q a ) = E x ∼ P A [ W ( x ) η ] ,
so D 1 + η ( P A ∥ q a ) = O ( log n ) D_{1+\eta}(P_A\mathbin{\|}q_a)=O(\log n) D 1 + η ( P A ∥ q a ) = O ( log n ) says exactly that the likelihood ratio has a polynomially bounded η \eta η th moment under P A P_A P A . In the ensemble formulation this is Gurevich’s weak domination, or domination on average, with f = W f=W f = W , and average polynomial time transfers along it [10 ] ; see also [28 , 31 , 3 ] . Gurevich works with one distribution on all strings and a condition of the form ∑ x μ ( x ) f ( x ) ε / ∣ x ∣ < ∞ \sum_x\mu(x)f(x)^{\varepsilon}/|x|<\infty ∑ x μ ( x ) f ( x ) ε /∣ x ∣ < ∞ ; giving both ensembles a common inverse-polynomial prior on lengths and lowering ε \varepsilon ε converts between the two formulations, qualitatively but not with a prescribed exponent. Theorem 4.4 is therefore a sharp quantitative realization of domination on average: for candidates with polynomial a a a th runtime moment, it determines the largest order of likelihood-ratio moment that one sampler can guarantee against all sources of order r r r , attains it, and shows it optimal relative to O O O . No efficient evaluation of W W W is needed or provided.
Lemma 4.3 (Summing the buckets). Fix an oracle, a rational a > 0 a>0 a > 0 , a sampler A A A with description p A p_A p A , a real r > 0 r>0 r > 0 and n n n with ∣ p A ∣ ≤ n 2 |p_A|\le n^2 ∣ p A ∣ ≤ n 2 , and let μ = E [ T A ( n ) r ] < ∞ \mu=\mathbb{E}[T_A(n)^r]<\infty μ = E [ T A ( n ) r ] < ∞ , d = min { r , 1 } d=\min\{r,1\} d = min { r , 1 } and π j ( x ) = Pr [ A ( 1 n ) = x , 2 j ≤ T A ( n ) < 2 j + 1 ] \pi_j(x)=\Pr[A(1^n)=x,\ 2^j\le T_A(n)<2^{j+1}] π j ( x ) = Pr [ A ( 1 n ) = x , 2 j ≤ T A ( n ) < 2 j + 1 ] . Then
q a ( x ) ≥ 1 b A ( n ) μ ∑ j = 0 n 2 π j ( x ) 2 j ( d − a ) , b A ( n ) = 96 ( n 2 + 1 ) 2 2 ∣ p A ∣ . q_a(x)\ge\frac{1}{b_A(n)\mu}\sum_{j=0}^{n^2}\pi_j(x)2^{j(d-a)},\qquad b_A(n)=96(n^2+1)^2 2^{|p_A|}. q a ( x ) ≥ b A ( n ) μ 1 j = 0 ∑ n 2 π j ( x ) 2 j ( d − a ) , b A ( n ) = 96 ( n 2 + 1 ) 2 2 ∣ p A ∣ .
Proof. For each j ≤ n 2 j \le n^2 j ≤ n 2 , Q a Q_a Q a takes the second branch with probability 1 / 2 1/2 1/2 , selects ( ∣ p A ∣ , j , p A ) (|p_A|,j,p_A) ( ∣ p A ∣ , j , p A ) with probability at least 2 − ∣ p A ∣ / [ 4 ( n 2 + 1 ) 2 ] 2^{-|p_A|}/[4(n^2+1)^2] 2 − ∣ p A ∣ / [ 4 ( n 2 + 1 ) 2 ] , and passes the gate with probability at least 2 − a j / 2 2^{-a j/2} 2 − aj /2 . Then (1) , whose proof applies to every power of two t t t and every x x x , gives Pr [ R 2 j ( p A ) = x ] ≥ π j ( x ) 2 j d / ( 6 μ ) \Pr[R_{2^j}(p_A)=x] \ge\pi_j(x)2^{j d}/(6\mu) Pr [ R 2 j ( p A ) = x ] ≥ π j ( x ) 2 j d / ( 6 μ ) . Different j j j are disjoint branches of Q a Q_a Q a , so the contributions add.
Theorem 4.4. (Sharp Rényi universality.) For every oracle and every rational a > 0 a>0 a > 0 , the sampler Q a Q_a Q a of Theorem 3.3 has the following property for every real r > 0 r>0 r > 0 and every A ∈ S r A\in S_r A ∈ S r . Put ψ = ( a − min { r , 1 } ) + \psi=(a-\min\{r,1\})_+ ψ = ( a − min { r , 1 } ) + .
If ψ = 0 \psi=0 ψ = 0 , then Q a ⪰ A Q_a \succeq A Q a ⪰ A , that is, D ∞ ( P A ∥ q a ) = O A , a , r ( log n ) D_\infty(P_A\|q_a)=O_{A,a,r}(\log n) D ∞ ( P A ∥ q a ) = O A , a , r ( log n ) .
If ψ > 0 \psi>0 ψ > 0 , then with α = 1 + r / ψ = B ( a , r ) / ( B ( a , r ) − 1 ) \alpha=1+r/\psi=B(a,r)/(B(a,r)-1) α = 1 + r / ψ = B ( a , r ) / ( B ( a , r ) − 1 ) ,
D α ( P A ∥ q a ) ≤ B ( a , r ) log E [ T A ( n ) r ] + O A , a , r ( log n ) . D_\alpha(P_A\|q_a) \le B(a,r)\log\mathbb{E}[T_A(n)^r]+O_{A,a,r}(\log n). D α ( P A ∥ q a ) ≤ B ( a , r ) log E [ T A ( n ) r ] + O A , a , r ( log n ) . Consequently, for every fixed α ∈ ( 1 , ∞ ] \alpha\in(1,\infty] α ∈ ( 1 , ∞ ] , D α ( P A ∥ q a ) = O A , a , r ( log n ) D_\alpha(P_A\|q_a)=O_{A,a,r}(\log n) D α ( P A ∥ q a ) = O A , a , r ( log n ) for every A ∈ S r A\in S_r A ∈ S r whenever
a ≤ min { r , 1 } + r α − 1 , (3) a \le\min\{r,1\}+\frac{r}{\alpha-1}, \tag*{(3)} a ≤ min { r , 1 } + α − 1 r , (3) where r / ( α − 1 ) = 0 r/(\alpha-1)=0 r / ( α − 1 ) = 0 for α = ∞ \alpha=\infty α = ∞ . Relative to the oracle O O O of § 6 , (3) is necessary for every real a > 0 a>0 a > 0 : if it fails, then for every Q ∈ S a O Q\in S_a^O Q ∈ S a O some A ∈ S r O ∩ W O A\in S_r^O\cap W^O A ∈ S r O ∩ W O with worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) has D α ( P A ∥ P Q ) ≠ O ( log n ) D_\alpha(P_A\|P_Q)\ne O(\log n) D α ( P A ∥ P Q ) = O ( log n ) .
Proof. Let n n n be large enough that ∣ p A ∣ ≤ n 2 |p_A|\le n^2 ∣ p A ∣ ≤ n 2 , put μ = E [ T A ( n ) r ] \mu=\mathbb{E}[T_A(n)^r] μ = E [ T A ( n ) r ] , d = min { r , 1 } d=\min\{r,1\} d = min { r , 1 } , H = 2 n 2 + 1 H=2^{n^2+1} H = 2 n 2 + 1 and b = b A ( n ) b=b_A(n) b = b A ( n ) , and split P A ( x ) = b x + ℓ x P_A(x)=b_x+\ell_x P A ( x ) = b x + ℓ x with b x = Pr [ A = x , T A < H ] b_x=\Pr[A=x,T_A<H] b x = Pr [ A = x , T A < H ] and ℓ x = Pr [ A = x , T A ≥ H ] \ell_x=\Pr[A=x,T_A\ge H] ℓ x = Pr [ A = x , T A ≥ H ] . Markov’s inequality gives ∑ x ℓ x ≤ μ H − r \sum_x\ell_x\le\mu H^{-r} ∑ x ℓ x ≤ μ H − r .
Case ψ = 0 \psi=0 ψ = 0 . Every factor 2 j ( d − a ) 2^{j(d-a)} 2 j ( d − a ) in Theorem 4.3 is at least one, so b x ≤ b μ q a ( x ) b_x\le b\mu q_a(x) b x ≤ b μ q a ( x ) , and ℓ x / q a ( x ) ≤ 2 n + 1 μ 2 − r ( n 2 + 1 ) ≤ 1 \ell_x/q_a(x)\le2^{n+1}\mu2^{-r(n^2+1)}\le1 ℓ x / q a ( x ) ≤ 2 n + 1 μ 2 − r ( n 2 + 1 ) ≤ 1 for large n n n . Hence P A ( x ) ≤ ( b μ + 1 ) q a ( x ) P_A(x)\le(b\mu+1)q_a(x) P A ( x ) ≤ ( b μ + 1 ) q a ( x ) .
Case ψ > 0 \psi>0 ψ > 0 . Put η = r / ψ \eta=r/\psi η = r / ψ , so α = 1 + η \alpha=1+\eta α = 1 + η , and
w x = E [ 1 { A = x , T A < H } T A − ψ ] , u x = E [ 1 { A = x , T A < H } T A r ] . w_x=\mathbb{E}\left[1\{A=x,T_A<H\}T_A^{-\psi}\right],\qquad u_x=\mathbb{E}\left[1\{A=x,T_A<H\}T_A^r\right]. w x = E [ 1 { A = x , T A < H } T A − ψ ] , u x = E [ 1 { A = x , T A < H } T A r ] .
In bucket j j j we have T A ≥ 2 j T_A\ge2^j T A ≥ 2 j , so 2 j ( d − a ) = 2 − j ψ ≥ T A − ψ 2^{j(d-a)}=2^{-j\psi}\ge T_A^{-\psi} 2 j ( d − a ) = 2 − j ψ ≥ T A − ψ , and Theorem 4.3 gives q a ( x ) ≥ w x / ( b μ ) q_a(x)\ge w_x/(b\mu) q a ( x ) ≥ w x / ( b μ ) . Writing 1 = ( T A r ) r / ( r + ψ ) ( T A r ) ψ / ( r + ψ ) 1=(T_A^r)^{r/(r+\psi)}(T_A^r)^{\psi/(r+\psi)} 1 = ( T A r ) r / ( r + ψ ) ( T A r ) ψ / ( r + ψ ) and applying Hölder’s inequality with exponents ( r + ψ ) / r (r+\psi)/r ( r + ψ ) / r and ( r + ψ ) / ψ (r+\psi)/\psi ( r + ψ ) / ψ on the event { A = x , T A < H } \{A=x,T_A<H\} { A = x , T A < H } gives b x ≤ w x r / ( r + ψ ) u x ψ / ( r + ψ ) b_x\le w_x^{r/(r+\psi)}u_x^{\psi/(r+\psi)} b x ≤ w x r / ( r + ψ ) u x ψ / ( r + ψ ) , that is, b x 1 + η ≤ w x η u x b_x^{1+\eta}\le w_x^\eta u_x b x 1 + η ≤ w x η u x . Therefore
∑ x b x 1 + η q a ( x ) η ≤ ( b μ ) η ∑ x u x ≤ b η μ 1 + η , \sum_x\frac{b_x^{1+\eta}}{q_a(x)^\eta}\le(b\mu)^\eta\sum_xu_x\le b^\eta\mu^{1+\eta}, x ∑ q a ( x ) η b x 1 + η ≤ ( b μ ) η x ∑ u x ≤ b η μ 1 + η ,
since ∑ x u x ≤ μ \sum_xu_x\le\mu ∑ x u x ≤ μ ; terms with b x = 0 b_x=0 b x = 0 vanish. This is the step that a pointwise bound cannot make: the source’s runtime moment is kept separately at each output and summed only at the end. For the tail, q a ≥ 2 − n − 1 q_a\ge2^{-n-1} q a ≥ 2 − n − 1 gives
∑ x ℓ x 1 + η q a ( x ) η ≤ 2 η ( n + 1 ) ( ∑ x ℓ x ) 1 + η ≤ 2 η ( n + 1 ) ( μ 2 − r ( n 2 + 1 ) ) 1 + η , \sum_x\frac{\ell_x^{1+\eta}}{q_a(x)^\eta}\le2^{\eta(n+1)}\left(\sum_x\ell_x\right)^{1+\eta}\le2^{\eta(n+1)}\left(\mu2^{-r(n^2+1)}\right)^{1+\eta}, x ∑ q a ( x ) η ℓ x 1 + η ≤ 2 η ( n + 1 ) ( x ∑ ℓ x ) 1 + η ≤ 2 η ( n + 1 ) ( μ 2 − r ( n 2 + 1 ) ) 1 + η ,
which tends to zero. Since ( u + v ) 1 + η ≤ 2 η ( u 1 + η + v 1 + η ) (u+v)^{1+\eta}\le2^\eta(u^{1+\eta}+v^{1+\eta}) ( u + v ) 1 + η ≤ 2 η ( u 1 + η + v 1 + η ) ,
R α ( P A ∥ q a ) ≤ 2 η [ b η μ 1 + η + o ( 1 ) ] . R_\alpha(P_A\|q_a)\le2^\eta\left[b^\eta\mu^{1+\eta}+o(1)\right]. R α ( P A ∥ q a ) ≤ 2 η [ b η μ 1 + η + o ( 1 ) ] .
and dividing the logarithm by η \eta η gives the claim, because ( 1 + η ) / η = B ( a , r ) (1+\eta)/\eta=B(a,r) ( 1 + η ) / η = B ( a , r ) and log b = O A ( log n ) \log b=O_A(\log n) log b = O A ( log n ) .
The frontier. If (3) holds then either ψ = 0 \psi=0 ψ = 0 , or α ≤ 1 + r / ψ \alpha\le1+r/\psi α ≤ 1 + r / ψ and monotonicity of D α D_\alpha D α in α \alpha α applies. Conversely, a bound R α ( P A ∥ P Q ) ≤ C ( n + 2 ) c R_\alpha(P_A\Vert P_Q)\le C(n+2)^c R α ( P A ∥ P Q ) ≤ C ( n + 2 ) c bounds each summand, so P Q ( x ) ≥ P A ( x ) α / ( α − 1 ) / [ C ( n + 2 ) c ] 1 / ( α − 1 ) P_Q(x)\ge P_A(x)^{\alpha/(\alpha-1)}/[C(n+2)^c]^{1/(\alpha-1)} P Q ( x ) ≥ P A ( x ) α / ( α − 1 ) / [ C ( n + 2 ) c ] 1/ ( α − 1 ) , which is domination with power α / ( α − 1 ) \alpha/(\alpha-1) α / ( α − 1 ) (power one for α = ∞ \alpha=\infty α = ∞ ). If (3) fails, then α / ( α − 1 ) < 1 + ( a − min { r , 1 } ) / r = B ( a , r ) \alpha/(\alpha-1)<1+(a-\min\{r,1\})/r=B(a,r) α / ( α − 1 ) < 1 + ( a − min { r , 1 }) / r = B ( a , r ) , and Theorem 6.6 provides, for every Q ∈ S a O Q\in\mathcal{S}_a^O Q ∈ S a O , a source as stated that Q Q Q does not dominate with this power.
The gain over Theorem 3.3 is real. A pointwise bound q ( x ) ≥ P ( x ) β / poly ( n ) q(x)\ge P(x)^\beta/\operatorname{poly}(n) q ( x ) ≥ P ( x ) β / poly ( n ) does not by itself give R α ( P ∥ q ) = n O ( 1 ) R_\alpha(P\Vert q)=n^{O(1)} R α ( P ∥ q ) = n O ( 1 ) for any finite α > 1 \alpha>1 α > 1 : for even n n n , let q q q be uniform on { 0 , 1 } n \{0,1\}^n { 0 , 1 } n and P P P uniform on a set of size 2 n / 2 2^{n/2} 2 n /2 . Then q ≥ P 2 q\ge P^2 q ≥ P 2 everywhere, but R α ( P ∥ q ) = 2 ( α − 1 ) n / 2 R_\alpha(P\Vert q)=2^{(\alpha-1)n/2} R α ( P ∥ q ) = 2 ( α − 1 ) n /2 ; in particular χ 2 ( P ∥ q ) = 2 n / 2 − 1 \chi^2(P\Vert q)=2^{n/2}-1 χ 2 ( P ∥ q ) = 2 n /2 − 1 .
The qualitative part has an elementary proof. Let Q a ′ Q'_a Q a ′ take the uniform branch with probability 1 / 2 1/2 1/2 , and otherwise select ( λ , j , p ) (\lambda,j,p) ( λ , j , p ) and pass the gate exactly as Q a Q_a Q a does, and then run p p p directly for at most 2 j + 1 2^{j+1} 2 j + 1 steps, outputting its result if it halts and 0 n 0^n 0 n otherwise. Then Q a ′ ∈ S a Q'_a\in\mathcal{S}_a Q a ′ ∈ S a , and the run outputs every x x x of bucket j j j , so q a ′ ( x ) ≥ ∑ j π j ( x ) 2 − a j / poly A ( n ) q'_a(x)\ge\sum_j\pi_j(x)2^{-aj}/\operatorname{poly}_A(n) q a ′ ( x ) ≥ ∑ j π j ( x ) 2 − aj / poly A ( n ) . The proof above, with ψ \psi ψ replaced by a a a , gives D 1 + r / a ( P A ∥ q a ′ ) = O A , a , r ( log n ) D_{1+r/a}(P_A\Vert q'_a)=O_{A,a,r}(\log n) D 1 + r / a ( P A ∥ q a ′ ) = O A , a , r ( log n ) for every A ∈ S r A\in\mathcal{S}_r A ∈ S r and every r > 0 r>0 r > 0 . For a = 2 a=2 a = 2 and r = 1 r=1 r = 1 this direct analysis gives order 3 / 2 3/2 3/2 and transfers E [ F v ] \mathbb{E}[F^v] E [ F v ] to E [ F v / 3 ] \mathbb{E}[F^{v/3}] E [ F v /3 ] , while Theorem 4.4 gives order 2 2 2 and E [ F v / 2 ] \mathbb{E}[F^{v/2}] E [ F v /2 ] . The difference lies in the analysis, not in the samplers.
Proposition 4.5. For every rational a > 0 a>0 a > 0 there is a polynomial h a h_a h a such that, relative to every oracle, q a ( x ) ≤ h a ( n ) q a ′ ( x ) q_a(x)\le h_a(n)q'_a(x) q a ( x ) ≤ h a ( n ) q a ′ ( x ) for all x ∈ { 0 , 1 } n x\in\{0,1\}^n x ∈ { 0 , 1 } n and large n n n . Hence Theorem 4.4 holds for Q a ′ Q'_a Q a ′ in place of Q a Q_a Q a , with D α D_\alpha D α larger by O a ( log n ) O_a(\log n) O a ( log n ) .
Proof. Let W W W be the fixed program that, on 1 n 1^n 1 n , makes the internal choices of Q a Q_a Q a other than the gate, that is, the branch, ( λ , j , p ) (\lambda,j,p) ( λ , j , p ) and the uniform string, and then runs R 2 j 2 ( p ) R^{2}_{2^j}(p) R 2 j 2 ( p ) . By Theorem 3.2 the number K K K of attempted steps satisfies Pr [ K > 2 j ( n + 2 ) 2 ] ≤ e − ( n + 2 ) 2 / 2 \Pr[K>2^j(n+2)^2]\le e^{-(n+2)^2/2} Pr [ K > 2 j ( n + 2 ) 2 ] ≤ e − ( n + 2 ) 2 /2 , whatever p p p and the oracle are, and each step costs poly ( n ) \operatorname{poly}(n) poly ( n ) because ∣ p ∣ , j ≤ n 2 |p|,j\le n^2 ∣ p ∣ , j ≤ n 2 . So there is L n = O ( log ( n + 2 ) ) L_n=O(\log(n+2)) L n = O ( log ( n + 2 )) such that, apart from probability e − ( n + 2 ) 2 / 2 e^{-(n+2)^2/2} e − ( n + 2 ) 2 /2 , the run of W W W with internal scale j j j ends within 2 j + L n 2^{j+L_n} 2 j + L n steps of Q a ′ Q'_a Q a ′ 's simulation. Let Q a ′ Q'_a Q a ′ select W W W , which costs an inverse-polynomial factor since W W W is fixed, and, for j ≤ ⌈ 2 ( n + 1 ) / a ⌉ j\le\lceil2(n+1)/a\rceil j ≤ ⌈ 2 ( n + 1 ) / a ⌉ , the clock k = j + L n k=j+L_n k = j + L n , which is at most n 2 n^2 n 2 for large n n n and whose gate is at least 2 − a L n − 1 2^{-aL_n-1} 2 − a L n − 1 times the gate at j j j . Since j ↦ j + L n j\mapsto j+L_n j ↦ j + L n is injective, the contributions of different j j j come from disjoint branches of Q a ′ Q'_a Q a ′ . Scales j > ⌈ 2 ( n + 1 ) / a ⌉ j>\lceil2(n+1)/a\rceil j > ⌈ 2 ( n + 1 ) / a ⌉ contribute at most 2 − 2 ( n + 1 ) 2^{-2(n+1)} 2 − 2 ( n + 1 ) to q a q_a q a , and the truncation at most e − ( n + 2 ) 2 / 2 e^{-(n+2)^2/2} e − ( n + 2 ) 2 /2 . For x ≠ 0 n x\ne0^n x = 0 n both errors and the uniform branch of Q a Q_a Q a are absorbed by the uniform branch of Q a ′ Q'_a Q a ′ , which gives every string probability at least 2 − n − 1 2^{-n-1} 2 − n − 1 . For x = 0 n x=0^n x = 0 n , Q a ′ Q'_a Q a ′ outputs 0 n 0^n 0 n with constant probability for large n n n , because most clocks fail their gates. The Rényi bound transfers because R α ( P ∥ q a ′ ) ≤ h a α − 1 R α ( P ∥ q ) R_\alpha(P\Vert q'_a)\le h_a^{\alpha-1}R_\alpha(P\Vert q) R α ( P ∥ q a ′ ) ≤ h a α − 1 R α ( P ∥ q ) .
Transfer of runtime moments
Theorem 4.6 (Moment transfer). For every oracle, rational a > 0 a>0 a > 0 , real r > 0 r>0 r > 0 , A ∈ S r A\in\mathcal{S}_r A ∈ S r and v > 0 v>0 v > 0 there is a polynomial c A , a , r , v c_{A,a,r,v} c A , a , r , v such that, with B = B ( a , r ) B=B(a,r) B = B ( a , r ) , for all large n n n and every function F : { 0 , 1 } n → [ 0 , ∞ ) F:\{0,1\}^n\to[0,\infty) F : { 0 , 1 } n → [ 0 , ∞ ) ,
E x ∼ P A [ F ( x ) v / B ] ≤ c A , a , r , v ( n ) ( E x ∼ q a [ F ( x ) v ] ) 1 / B . \mathbb{E}_{x\sim P_A}\left[F(x)^{v/B}\right]\le c_{A,a,r,v}(n)\left(\mathbb{E}_{x\sim q_a}\left[F(x)^v\right]\right)^{1/B}. E x ∼ P A [ F ( x ) v / B ] ≤ c A , a , r , v ( n ) ( E x ∼ q a [ F ( x ) v ] ) 1/ B .
Relative to O O O the ratio is optimal: for real a > 0 a>0 a > 0 and θ > 1 / B \theta>1/B θ > 1/ B , no sampler in S a O \mathcal{S}_a^O S a O satisfies such an inequality with θ \theta θ in place of 1 / B 1/B 1/ B , for every A ∈ S r O A\in\mathcal{S}_r^O A ∈ S r O and every F F F .
Proof. If B = 1 B=1 B = 1 , use P A ≤ poly ( n ) q a P_A\le\operatorname{poly}(n)q_a P A ≤ poly ( n ) q a . If B > 1 B>1 B > 1 , the exponents α = B / ( B − 1 ) \alpha=B/(B-1) α = B / ( B − 1 ) and B B B are Hölder conjugates, so
E P A [ F v / B ] = E q a [ P A q a F v / B ] ≤ R α ( P A ∥ q a ) 1 / α ( E q a F v ) 1 / B , (4) \mathbb{E}_{P_A}\left[F^{v/B}\right]=\mathbb{E}_{q_a}\left[\frac{P_A}{q_a}F^{v/B}\right]\le R_\alpha(P_A\Vert q_a)^{1/\alpha}\left(\mathbb{E}_{q_a}F^v\right)^{1/B}, \tag*{(4)} E P A [ F v / B ] = E q a [ q a P A F v / B ] ≤ R α ( P A ∥ q a ) 1/ α ( E q a F v ) 1/ B , (4)
and Theorem 4.4 bounds the first factor by a polynomial. For the last claim take F F F to be the indicator of a single string x x x : an inequality with ratio θ \theta θ for a sampler Q Q Q gives P A ( x ) ≤ c ( n ) P Q ( x ) θ P_A(x) \le c(n)P_Q(x)^\theta P A ( x ) ≤ c ( n ) P Q ( x ) θ , which is domination with power 1 / θ < B 1/\theta< B 1/ θ < B , excluded relative to O O O by Theorem 6.6 when 1 / θ ≥ 1 1/\theta\ge1 1/ θ ≥ 1 and against the uniform source when 1 / θ < 1 1/\theta< 1 1/ θ < 1 .
Corollary 4.7 (Universal validation). For every oracle, rational a > 0 a > 0 a > 0 , real r > 0 r > 0 r > 0 and A ∈ S r A \in S_r A ∈ S r there is a polynomial c c c such that, with B = B ( a , r ) B = B(a,r) B = B ( a , r ) , for all large n n n and every function e : { 0 , 1 } n → [ 0 , 1 ] e : \{0,1\}^n \to[0,1] e : { 0 , 1 } n → [ 0 , 1 ] ,
E x ∼ P A [ e ( x ) ] ≤ c ( n ) ( E x ∼ Q a [ e ( x ) ] ) 1 / B . \mathbb{E}_{x\sim P_A}[e(x)] \le c(n)\left(\mathbb{E}_{x\sim Q_a}[e(x)]\right)^{1/B}. E x ∼ P A [ e ( x )] ≤ c ( n ) ( E x ∼ Q a [ e ( x )] ) 1/ B . In particular, if E Q a [ e n ] \mathbb{E}_{Q_a}[e^n] E Q a [ e n ] is negligible, then so is E P A [ e n ] \mathbb{E}_{P_A}[e^n] E P A [ e n ] for every sampler A A A with a polynomial runtime moment of some order. Relative to O O O , and for r ≤ 1 r \le1 r ≤ 1 under the hypothesis of Theorem 8.6, the exponent 1 / B 1/B 1/ B cannot be raised, already when e e e is the indicator of a single string.
Proof. Apply Theorem 4.6 with F = e F = e F = e and v = B v = B v = B , and use e B ≤ e e^B \le e e B ≤ e . For the last claim, an inequality with exponent θ > 1 / B \theta> 1/B θ > 1/ B for the indicator of { x } \{x\} { x } is domination with power 1 / θ < B 1/\theta< B 1/ θ < B , which Theorem 6.6 excludes relative to O O O and Theorem 8.6 excludes under its hypothesis; a power below one is impossible against the uniform source.
The function e e e can be the probability that a randomized heuristic errs on x x x , or the error of a hypothesis on x x x . It should not be read as an inversion probability: Q a Q_a Q a puts probability 1 / poly ( n ) 1/\operatorname{poly}(n) 1/ poly ( n ) on 0 n 0^n 0 n , so an inverter that answers 0 n 0^n 0 n already succeeds with nonnegligible probability, and no function is one-way on inputs drawn from Q a Q_a Q a in the usual sense. A learner with membership queries that draws its examples from Q a Q_a Q a and reaches error ϵ \epsilon ϵ there has error at most c ( n ) ϵ 1 / B c(n)\epsilon^{1/B} c ( n ) ϵ 1/ B under every source in S r S_r S r ; Li and Vitányi proved the analogous statement for the universal enumerable semimeasure [19 ] . The exponent measures the price of a test distribution whose generation time is predictable. Against expected-polynomial-time generators (r = 1 r = 1 r = 1 ), validating on Q 1 Q_1 Q 1 , whose sampling time has polynomial mean, loses only a polynomial factor; asking for a polynomially bounded second moment (a = 2 a = 2 a = 2 ) costs a square root, and a bounded k k k th moment costs the k k k th root; these exponents are optimal relative to O O O , and under the hypothesis of Theorem 8.6. The polynomial c c c depends on A A A , and Q a Q_a Q a enumerates programs, so the statement is about exponents, not practical constants.
The sharpness statement concerns the inequality for arbitrary F F F . Running times of a fixed deterministic algorithm behave differently when B ( a , r ) = 1 B(a,r) = 1 B ( a , r ) = 1 , that is, when a ≤ min { r , 1 } a \le\min\{r,1\} a ≤ min { r , 1 } : the event that D D D runs longer than t t t on x x x can be tested by running D D D , and this amplifies the moment.
Theorem 4.8 (Amplification for running times). For every oracle, every rational 0 < a ≤ 1 0 < a \le1 0 < a ≤ 1 , every total deterministic oracle machine D D D and every v > a v > a v > a : if E x ∼ Q a ′ [ T D ( x ) v ] ≤ poly ( n ) \mathbb{E}_{x\sim Q'_a}[T_D(x)^v] \le\operatorname{poly}(n) E x ∼ Q a ′ [ T D ( x ) v ] ≤ poly ( n ) , where Q a ′ Q'_a Q a ′ is the law of the plain clock mixture Q a ′ Q'_a Q a ′ of Theorem 4.5, then for every real r > 0 r > 0 r > 0 and every A ∈ S r A \in S_r A ∈ S r ,
E x ∼ P A [ T D ( x ) min { r , 1 } v / a ] ≤ poly A , D , a , v ( n ) . \mathbb{E}_{x\sim P_A}\left[T_D(x)^{\min\{r,1\}v/a}\right] \le\operatorname{poly}_{A,D,a,v}(n). E x ∼ P A [ T D ( x ) m i n { r , 1 } v / a ] ≤ poly A , D , a , v ( n ) . *For example, a deterministic algorithm with polynomial second moment under Q 1 / 2 ′ Q'_{1/2} Q 1/2 ′ has polynomial fourth moment under every expected-polynomial-time sampler, while domination alone transfers only the second. For r ≥ 1 r \ge1 r ≥ 1 the idea is as follows; Section G handles general r r r with an s s s th cost moment, s = min { r , 1 } s = \min\{r,1\} s = min { r , 1 } . The proof uses a program that samples from A A A until it finds an input on which D D D runs longer than t t t ; its expected cost is F ( t ) / p ( t ) F(t)/p(t) F ( t ) / p ( t ) , where p ( t ) = Pr P A [ T D > t ] p(t) = \Pr_{P_A}[T_D > t] p ( t ) = Pr P A [ T D > t ] and F ( t ) = E T A + E P A min { T D , t } F(t) = \mathbb{E}T_A + \mathbb{E}_{P_A}\min\{T_D,t\} F ( t ) = E T A + E P A min { T D , t } , and Q a ′ Q'_a Q a ′ gives its output set probability about ( p / F ) a (p/F)^a ( p / F ) a . Comparing with the v v v th moment under Q a Q_a Q a gives p ( t ) ≤ poly ( n ) F ( t ) t − v / a p(t) \le\operatorname{poly}(n)F(t)t^{-v/a} p ( t ) ≤ poly ( n ) F ( t ) t − v / a ; since v / a > 1 v/a > 1 v / a > 1 , integrating bounds F F F
by a polynomial, and the uniform branch of Q a ′ Q'_a Q a ′ limits the relevant scales to t ≤ 2 O ( n ) t \le2^{O(n)} t ≤ 2 O ( n ) , which keeps the endpoint. Determinism matters: an algorithm that reads 2 n 2n 2 n coins and waits 2 n 2^n 2 n steps when all are zero decides the empty language with polynomial second moment under every distribution and with w w w th moment at least 2 n ( w − 2 ) 2^{n(w-2)} 2 n ( w − 2 ) for w > 2 w > 2 w > 2 . Theorems 6.10 and 6.11 show that Theorems 4.6 and 4.8 together give the exact exponent for the running times of all correct solvers of one sparse language (Theorem 6.12 ); in particular the condition v > a v > a v > a cannot be dropped.
Corollary 4.9 (A hardest ensemble at every order). Let O O O be any oracle, r > 0 r > 0 r > 0 real, a ≥ r a \ge r a ≥ r rational, and Q a Q_a Q a the sampler of Theorem 3.3 . For every language L L L , L L L is in AvgP under every sampler in S r O S^O_r S r O if and only if L L L is in AvgP under Q a Q_a Q a . A decider witnessing the right side works for every source on the left.
Proof. One direction holds because Q a ∈ S a O ⊆ S r O Q_a \in S^O_a \subseteq S^O_r Q a ∈ S a O ⊆ S r O . For the other, let E Q a [ t M B ] ≤ C ′ n \mathbb{E}_{Q_a}[t_M^B] \le C'n E Q a [ t M B ] ≤ C ′ n . Theorem 4.6 with F = t M F = t_M F = t M and v = ε v = \varepsilon v = ε gives E P A [ t M ε / B ] ≤ poly A ( n ) \mathbb{E}_{P_A}[t_M^{\varepsilon/B}] \le\operatorname{poly}_A(n) E P A [ t M ε / B ] ≤ poly A ( n ) for large n n n , and Jensen’s inequality as in Theorem 4.1 lowers the exponent further to get O ( n ) O(n) O ( n ) . Finitely many lengths change only the constant.
Qualitatively, Theorem 4.9 is Gurevich’s transfer along domination on average [10 ] applied to Q a Q_a Q a ; Theorem 4.6 adds the sharp exponent. The same holds for errorless heuristic schemes: taking F F F to be the indicator of the failure set, a failure probability δ \delta δ under Q a Q_a Q a becomes at most poly ( n ) δ 1 / B \operatorname{poly}(n)\delta^{1/B} poly ( n ) δ 1/ B under A A A , and schemes allow any inverse-polynomial failure bound. The plain mixture Q a ′ Q'_a Q a ′ gives the same corollary with B B B replaced by 1 + a / r 1+a/r 1 + a / r .
Corollary 4.10 (One average-case class for all finite orders). For an oracle O O O and real r > 0 r > 0 r > 0 let C r C_r C r be the class of languages in AvgP under every sampler in S r O S^O_r S r O . Then C r = C t C_r = C_t C r = C t for all real r , t > 0 r,t > 0 r , t > 0 , and both equal the class of languages in AvgP under every sampler in ⋃ u > 0 S u O \bigcup_{u>0} S^O_u ⋃ u > 0 S u O . For a language in this class one decider works for every such source, and Q 1 Q_1 Q 1 alone tests membership.
Proof. Let L ∈ C r L \in C_r L ∈ C r and choose a rational a ≥ r a \ge r a ≥ r . Then Q a ∈ S r O Q_a \in S^O_r Q a ∈ S r O , so some decider M M M puts L L L in AvgP under Q a Q_a Q a . For any t > 0 t > 0 t > 0 and A ∈ S t O A \in S^O_t A ∈ S t O , Theorem 4.4 applies with t t t in place of r r r , since B ( a , t ) B(a,t) B ( a , t ) is finite, and the proof of Theorem 4.9 shows that M M M works under A A A . The remaining inclusions are immediate, and r = 1 r = 1 r = 1 gives the last claim.
So average-case tractability does not depend on which finite moment of the sampler’s runtime is bounded, even though, relative to O O O , universality in the sense of domination fails for every order above one. This needs only domination on average, so it also follows from the direct analysis of the plain mixture. The equality concerns the finite-moment classes; it does not identify C r C_r C r with tractability under all strict samplers or all members of S a l l O S^O_{\mathrm{all}} S all O , and Q a Q_a Q a is not useful in S a l l S_{\mathrm{all}} S all . Strict time bounds behave differently: more sampling time gives more distributions [29 ] , and Itsykson, Knop and Sokolov use this to separate heuristic tractability with negligible error under distributions samplable in time n log a n n^{\log^a n} n l o g a n from that under time n log b n n^{\log^b n} n l o g b n , for a < b a < b a < b [12 ] . A moment bound allows rare long runs, and one sampler absorbs them.
Finite oracle blocks
Gated chain blocks
Fix a length n n n and integers T , N T, N T , N . A gated block at length n n n consists of N N N gate seeds, a set G G G of positive seeds, a chain of T T T distinct labels u 0 , … , u T − 1 u_0,\ldots,u_{T-1} u 0 , … , u T − 1 from a universe of size U = 2 4 n U=2^{4n} U = 2 4 n , and a terminal string W ∈ { 0 , 1 } n ∖ { 0 n } W\in\{0,1\}^n\setminus\{0^n\} W ∈ { 0 , 1 } n ∖ { 0 n } . Every positive gate returns the head u 0 u_0 u 0 ; negative gates return ⊥ \perp ⊥ . The successor oracle returns H ( u j ) = u j + 1 H(u_j)=u_{j+1} H ( u j ) = u j + 1 for j < T − 1 j<T-1 j < T − 1 , H ( u T − 1 ) = ( terminal , W ) H(u_{T-1})=(\text{terminal},W) H ( u T − 1 ) = ( terminal , W ) , and ⊥ \perp ⊥ on all other labels. Each gate or chain query carries the unary tag 1 n 1^n 1 n , a type field, the seed or label, and the index of the requested answer bit. Fixed-length answer words with explicit membership and terminal flags make this an ordinary bit oracle; a whole answer word is read in poly ( n ) \operatorname{poly}(n) poly ( n ) time.
A block is good if ∣ G ∣ = 1 |G|=1 ∣ G ∣ = 1 and bad if ∣ G ∣ = K |G|=K ∣ G ∣ = K . In the analysis we choose G G G uniformly among sets of the given size, the chain labels uniformly without repetition, and W W W uniformly, all independently, with the oracle outside the block fixed identically in both experiments.
For lower bounds we augment the analyst’s history: whenever the machine asks for one bit of an answer word, the history records the whole word. The machine itself ignores the extra bits, and an S S S -step prefix makes at most S S S such queries.
Lemma 5.1 (Shortcut bound). Suppose U > T + S U>T+S U > T + S . In either experiment, the probability that the S S S -step prefix of a run outputs W W W without exposing the terminal by a traversal from an exposed head is at most
δ = S T U − T − S + 1 2 n − 1 . \delta=\frac{ST}{U-T-S}+\frac{1}{2^n-1}. δ = U − T − S S T + 2 n − 1 1 . Outside the event of querying a not-yet-exposed chain label, exposing the terminal takes at least T T T sequential chain queries.
Proof. Condition on an augmented history. A not-yet-exposed chain label is uniform among the remaining labels, so a fresh label query hits a hidden chain node with probability at most T / ( U − T − S ) T/(U-T-S) T / ( U − T − S ) ; a union bound over at most S S S queries gives the first term. This event covers guessing the head as well as interior or terminal nodes. Without such a hit, chain nodes are discovered only by following the chain from an exposed head. Before the terminal is exposed, W W W is uniform on the nonzero strings, so a final output equals it with probability at most 1 / ( 2 n − 1 ) 1/(2^n-1) 1/ ( 2 n − 1 ) . A partial read of the terminal word already counts as exposure in the augmented history. □
Lemma 5.2 (Transcript amplification). Let S ≤ N / 2 S\le N/2 S ≤ N /2 and K = ⌊ N / ( 4 S ) ⌋ ≥ 1 K=\lfloor N/(4S)\rfloor\ge1 K = ⌊ N / ( 4 S )⌋ ≥ 1 . Consider any collection of S S S -step transcripts in the good experiment that touch the positive seed and otherwise only negative seeds. Its probability in the bad experiment, restricted to the same gate answers and the same remaining transcript, is at least K / 2 K/2 K /2 times its probability in the good experiment.
Proof. Fix the private coins, the chain labels, W W W , and one good transcript. Let g g g be its touched positive seed and b ≤ S b\le S b ≤ S the number of other distinct touched seeds. The gate pattern has probability 1 / N 1/N 1/ N in the good experiment, and the ratio of its bad-experiment probability to that is
K ∏ j = 0 b − 1 N − K − j N − 1 − j . K\prod_{j=0}^{b-1}\frac{N-K-j}{N-1-j}. K j = 0 ∏ b − 1 N − 1 − j N − K − j .
Each factor equals 1 − ( K − 1 ) / ( N − 1 − j ) 1-(K-1)/(N-1-j) 1 − ( K − 1 ) / ( N − 1 − j ) , and the losses sum to at most S K / ( N − S ) ≤ 1 / 2 SK/(N-S)\le1/2 S K / ( N − S ) ≤ 1/2 , so the product is at least 1 / 2 1/2 1/2 . Preserving all answers along a transcript preserves every later query, so adaptivity changes nothing. The transferred events are disjoint over g g g , because each transferred transcript touches exactly one positive seed. Summing and averaging proves the claim. Repeated queries to a seed count once. □
Remark 5.3 (Affine gate sets). The proof of Theorem 5.2 uses only two incidence probabilities of the random bad set: Pr [ g ∈ G ] = K / N \Pr[g \in G] = K/N Pr [ g ∈ G ] = K / N and Pr [ h ∈ G ∣ g ∈ G ] = ( K − 1 ) / ( N − 1 ) \Pr[h \in G \mid g \in G] = (K-1)/(N-1) Pr [ h ∈ G ∣ g ∈ G ] = ( K − 1 ) / ( N − 1 ) for distinct g , h g,h g , h . Then a transcript with positive seed g g g and a set D D D of other touched seeds keeps its gate pattern with probability at least ( K / N ) ( 1 − ∣ D ∣ ( K − 1 ) / ( N − 1 ) ) (K/N)(1-|D|(K-1)/(N-1)) ( K / N ) ( 1 − ∣ D ∣ ( K − 1 ) / ( N − 1 )) , by a union bound. So the lemma, and with it Theorems 5.4 and 5.5, holds for any distribution on K K K -sets with uniform one-point and two-point incidences. When N = 2 m N=2^m N = 2 m , which is the case in Section 6 since N = T R N=T^R N = T R , one can take G G G to be a uniform affine subspace of F m \mathbb{F}^m F m of dimension ⌊ log ( N / ( 8 V ) ) ⌋ \lfloor\log(N/(8V))\rfloor ⌊ log ( N / ( 8 V ))⌋ . The affine group acts transitively on ordered pairs of distinct points, so the incidences are as required, and N / ( 16 V ) < K ≤ N / ( 8 V ) N/(16V)<K\le N/(8V) N / ( 16 V ) < K ≤ N / ( 8 V ) keeps the bound K ≥ N / ( 16 V ) K\ge N/(16V) K ≥ N / ( 16 V ) used in Theorem 5.4; for transcripts shorter than 2 V 2V 2 V the loss term is 2 V ( K − 1 ) / ( N − 1 ) ≤ 1 / 2 2V(K-1)/(N-1)\le1/2 2 V ( K − 1 ) / ( N − 1 ) ≤ 1/2 . The bad blocks of O O O then have gate sets with O ( m 2 ) O(m^2) O ( m 2 ) -bit descriptions { x : H x = b } \{x:Hx=b\} { x : H x = b } . This does not apply directly to the pooled experiments of Section B, whose seed pools are not affine. It also leaves the chains, which dominate the description of a block, unchanged.
The runtime-bucket dichotomy
Fix an integer k ≥ 1 k\ge1 k ≥ 1 and put
ρ k = 1 + 1 k , κ k = 2 k + 1 2 k + 2 , D k = 2 k ( k + 1 ) . \rho_k=1+\frac{1}{k},\qquad\kappa_k=\frac{2k+1}{2k+2},\qquad D_k=2k(k+1). ρ k = 1 + k 1 , κ k = 2 k + 2 2 k + 1 , D k = 2 k ( k + 1 ) .
Then 1 < ρ k ≤ 2 1<\rho_k\le2 1 < ρ k ≤ 2 , 3 / 4 ≤ κ k < 1 3/4\le\kappa_k<1 3/4 ≤ κ k < 1 , κ k ρ k = 1 + 1 / ( 2 k ) > 1 \kappa_k\rho_k=1+1/(2k)>1 κ k ρ k = 1 + 1/ ( 2 k ) > 1 , and D k D_k D k is a common denominator of ρ k \rho_k ρ k and κ k \kappa_k κ k . For integers d ≥ 1 d\ge1 d ≥ 1 , R ≥ 3 R\ge3 R ≥ 3 and a power of two n n n set
h = D k ⌈ n 8 R D k ⌉ , T = 2 h , N = T R , S = T κ k R n 2 d , J = log ( S / T ) . h=D_k\left\lceil\frac{n}{8RD_k}\right\rceil,\qquad T=2^h,\qquad N=T^R,\qquad S=T^{\kappa_k R}n^{2d},\qquad J=\log(S/T). h = D k ⌈ 8 R D k n ⌉ , T = 2 h , N = T R , S = T κ k R n 2 d , J = log ( S / T ) .
These are integers, and T T T , N N N , S S S are powers of two. Since κ k R > 1 \kappa_kR>1 κ k R > 1 , T < S T<S T < S whenever h ≥ 1 h\ge1 h ≥ 1 . Call n n n admissible for ( k , d , R ) (k,d,R) ( k , d , R ) if the block’s query encodings are shorter than S S S , 2 4 n > T + S 2^{4n}>T+S 2 4 n > T + S , and
h ≥ 1 , S ≤ N / 8 , δ ≤ 1 2 N n d , T ρ k − 1 128 n d J > n d . (5) h\ge1,\qquad S\le N/8,\qquad\delta\le\frac{1}{2Nn^d},\qquad\frac{T^{\rho_k-1}}{128n^dJ}>n^d. \tag*{(5)} h ≥ 1 , S ≤ N /8 , δ ≤ 2 N n d 1 , 128 n d J T ρ k − 1 > n d . (5)
For fixed ( k , d , R ) (k,d,R) ( k , d , R ) every sufficiently large power of two is admissible: h = Θ ( n ) h=\Theta(n) h = Θ ( n ) , κ k < 1 \kappa_k<1 κ k < 1 , N ≤ 2 n 2 / 8 N\le2^{n^2/8} N ≤ 2 n 2 /8 , and T ρ k − 1 T^{\rho_k-1} T ρ k − 1 eventually exceeds every power of n n n . All tests use exact integer arithmetic.
For a candidate Q Q Q , a fixing of the oracle outside the block, and a good block B B B , let
q < S ( B ) = Pr [ Q ( 1 n ) outputs W in fewer than S steps ] . q_{<S}(B)=\Pr[Q(1^n)\text{ outputs }W\text{ in fewer than }S\text{ steps}]. q < S ( B ) = Pr [ Q ( 1 n ) outputs W in fewer than S steps ] .
Lemma 5.4 (Runtime-bucket dichotomy). Let n n n be admissible for ( k , d , R ) (k,d,R) ( k , d , R ) , and fix Q Q Q and the oracle outside the block. Then one of the following holds.
Some good block B B B has q < S ( B ) < 1 / ( N n d ) q_{<S}(B)<1/(Nn^d) q < S ( B ) < 1/ ( N n d ) .
For some V ∈ { T , 2 T , … , S / 2 } V\in\{T,2T,\ldots,S/2\} V ∈ { T , 2 T , … , S /2 } , some bad block with K = ⌊ N / ( 8 V ) ⌋ K=\lfloor N/(8V)\rfloor K = ⌊ N / ( 8 V )⌋ positive seeds satisfies
E [ ⌊ min { T Q , S } ρ k ⌋ ] > n d , \mathbb{E}\left[\left\lfloor\min\{T_Q,S\}^{\rho_k}\right\rfloor\right]>n^d, E [ ⌊ min { T Q , S } ρ k ⌋ ] > n d , and hence
E [ min { T Q , S } ρ k ] > n d . \mathbb{E}\left[\min\{T_Q,S\}^{\rho_k}\right]>n^d. E [ min { T Q , S } ρ k ] > n d .
The lemma assumes nothing about the full runtime of Q Q Q . The floor makes the second alternative a comparison of rationals: ⌊ τ ( k + 1 ) / k ⌋ = ⌊ ( τ k + 1 ) 1 / k ⌋ \lfloor\tau^{(k+1)/k}\rfloor=\lfloor(\tau^{k+1})^{1/k}\rfloor ⌊ τ ( k + 1 ) / k ⌋ = ⌊( τ k + 1 ) 1/ k ⌋ is an integer k k k th root, and the expectation is a dyadic combination of such integers.
Proof. Suppose the first case fails. Averaging over the good experiment, Q Q Q outputs W W W before time S S S with probability at least 1 / ( N n d ) 1/(Nn^d) 1/ ( N n d ) . Removing the shortcut event of Theorem 5.1 leaves genuine traversals of total probability at least 1 / ( 2 N n d ) 1/(2Nn^d) 1/ ( 2 N n d ) . Each such run has runtime τ \tau τ with T ≤ τ < S T \le\tau< S T ≤ τ < S and has touched the unique positive seed, since guessing the head is part of the shortcut event. Split these runs into the J J J buckets [ V , 2 V ) [V,2V) [ V , 2 V ) , V = T , 2 T , … , S / 2 V=T,2T,\ldots,S/2 V = T , 2 T , … , S /2 . Some bucket has probability at least 1 / ( 2 N n d J ) 1/(2Nn^dJ) 1/ ( 2 N n d J ) in the good experiment. Fix it, put B ∗ = 2 V B^*=2V B ∗ = 2 V and K = ⌊ N / ( 4 B ∗ ) ⌋ = ⌊ N / ( 8 V ) ⌋ K=\lfloor N/(4B^*)\rfloor=\lfloor N/(8V)\rfloor K = ⌊ N / ( 4 B ∗ )⌋ = ⌊ N / ( 8 V )⌋ . Then B ∗ ≤ S ≤ N / 8 B^* \le S \le N/8 B ∗ ≤ S ≤ N /8 , so K ≥ N / ( 8 B ∗ ) = N / ( 16 V ) K \ge N/(8B^*)=N/(16V) K ≥ N / ( 8 B ∗ ) = N / ( 16 V ) . The selected runs are complete halting transcripts shorter than B ∗ B^* B ∗ , so Theorem 5.2 with cutoff B ∗ B^* B ∗ applies; it preserves each transcript’s answers, output and runtime. Their probability in the bad experiment is at least K / 2 K/2 K /2 times as large, and each still runs for at least V V V steps. Hence the bad experiment’s average floored capped ρ k \rho_k ρ k th moment is at least
V ρ k 2 ⋅ K 2 ⋅ 1 2 N n d J ≥ V ρ k − 1 128 n d J ≥ T ρ k − 1 128 n d J > n d , \frac{V^{\rho_k}}{2}\cdot\frac{K}{2}\cdot\frac{1}{2Nn^dJ}\ge\frac{V^{\rho_k-1}}{128n^dJ}\ge\frac{T^{\rho_k-1}}{128n^dJ}>n^d, 2 V ρ k ⋅ 2 K ⋅ 2 N n d J 1 ≥ 128 n d J V ρ k − 1 ≥ 128 n d J T ρ k − 1 > n d ,
for the floored capped moment, since ⌊ y ⌋ ≥ y / 2 \lfloor y\rfloor\ge y/2 ⌊ y ⌋ ≥ y /2 for y ≥ 1 y\ge1 y ≥ 1 ; some bad block attains at least the average.
A general threshold. The proof uses n d n^d n d only as a threshold. For a power of two F ≥ 1 F\ge1 F ≥ 1 put S = T κ k R F 2 S=T^{\kappa_k}RF^2 S = T κ k R F 2 , keep h , T , N , J h,T,N,J h , T , N , J , and call n n n admissible for ( k , F , R ) (k,F,R) ( k , F , R ) if (4) holds with F F F in place of n d n^d n d . Then Theorem 5.4 holds verbatim with F F F in place of n d n^d n d . At stage s s s , the gated stages of Section 6 use F = 2 ⌊ n / 2 2 s + 8 ⌋ F=2^{\lfloor n/2^{2s+8}\rfloor} F = 2 ⌊ n / 2 2 s + 8 ⌋ .
The density in the second case is of order 1 / V 1/V 1/ V , where V V V is the candidate’s own halting scale, and the charge is V ρ k V^{\rho_k} V ρ k . Their product V ρ k − 1 V^{\rho_k-1} V ρ k − 1 grows with V V V , so a candidate that spends extra time probing the density strengthens the certificate against itself. This is why no upper bound on R R R in terms of the candidate’s order is needed: for a candidate of order a > ρ k a>\rho_k a > ρ k the relevant window is T < S < N < S a T<S<N<S^a T < S < N < S a , and nothing like S < T a S<T^a S < T a is required.
A dichotomy with a power
For the power tradeoff we need the same argument with the good-world threshold 1 / N 1/N 1/ N replaced by 1 / N b 1/N^b 1/ N b . Fix rationals R > 1 R>1 R > 1 , ρ > 1 \rho>1 ρ > 1 , b ≥ 1 b\ge1 b ≥ 1 with
η : = ρ − 1 − R ( b − 1 ) > 0 , \eta:=\rho-1-R(b-1)>0, η := ρ − 1 − R ( b − 1 ) > 0 ,
and a rational θ \theta θ with max { 1 , R b / ρ } < θ < R \max\{1,Rb/\rho\}<\theta<R max { 1 , R b / ρ } < θ < R ; the interval is nonempty because η > 0 \eta>0 η > 0 and R > 1 R>1 R > 1 give b < ρ b<\rho b < ρ . Call such ( R , ρ , b , θ ) (R,\rho,b,\theta) ( R , ρ , b , θ ) a valid tuple. Let D D D be a common denominator of R , θ , R b R,\theta,Rb R , θ , R b and ρ \rho ρ , so that η h \eta h η h is an integer below, and C ∗ = 64 ( 1 + ⌈ R b + R + θ ⌉ ) C_*=64(1+\lceil Rb+R+\theta\rceil) C ∗ = 64 ( 1 + ⌈ R b + R + θ ⌉) . For integers d , σ ≥ 1 d,\sigma\ge1 d , σ ≥ 1 and a power of two n n n set
h = D ⌊ n C ∗ D σ ⌋ , T = 2 h , N = T R , S = T θ n 2 d , J = log ( S / T ) . h=D\left\lfloor\frac{n}{C_*D\sigma}\right\rfloor,\qquad T=2^h,\qquad N=T^R,\qquad S=T^\theta n^{2d},\qquad J=\log(S/T). h = D ⌊ C ∗ D σ n ⌋ , T = 2 h , N = T R , S = T θ n 2 d , J = log ( S / T ) .
Call n n n admissible for the tuple and ( d , σ ) (d,\sigma) ( d , σ ) if the block’s query encodings are shorter than S S S , 2 4 n > T + S 2^{4n}>T+S 2 4 n > T + S , and
h ≥ 1 , S ≤ N / 8 , δ ≤ 1 2 N b n d , T η > 128 n 2 d J . (6) h\ge1,\qquad S\le N/8,\qquad\delta\le\frac{1}{2N^bn^d},\qquad T^\eta>128n^{2d}J. \tag*{(6)} h ≥ 1 , S ≤ N /8 , δ ≤ 2 N b n d 1 , T η > 128 n 2 d J . (6)
For fixed parameters every large power of two is admissible: h = Θ ( n / σ ) h=\Theta(n/\sigma) h = Θ ( n / σ ) , θ < R \theta<R θ < R , N b ≤ 2 h R b ≤ 2 n / 64 N^b\le2^{hRb}\le2^{n/64} N b ≤ 2 h R b ≤ 2 n /64 while δ = O ( 2 − n ) \delta=O(2^{-n}) δ = O ( 2 − n ) , and T η T^\eta T η is exponential in n n n . The tests are exact.
Lemma 5.5 (Dichotomy with a power). Let n n n be admissible for a valid tuple and ( d , σ ) (d,\sigma) ( d , σ ) , and fix Q Q Q and the oracle outside the block. Then either some good block has Pr [ Q ( 1 n ) = W , T Q < S ] < 1 / ( N b n d ) \Pr[Q(1^n)=W,\ T_Q<S]<1/(N^bn^d) Pr [ Q ( 1 n ) = W , T Q < S ] < 1/ ( N b n d ) , or for some V ∈ { T , … , S / 2 } V\in\{T,\ldots,S/2\} V ∈ { T , … , S /2 } some bad block with K = ⌊ N / ( 8 V ) ⌋ K=\lfloor N/(8V)\rfloor K = ⌊ N / ( 8 V )⌋ positive seeds has E [ min { T Q , S } ρ ] > n d \mathbb{E}[\min\{T_Q,S\}^{\rho}]>n^d E [ min { T Q , S } ρ ] > n d , and hence E [ min { T Q , S } ρ ] > n d \mathbb{E}[\min\{T_Q,S\}^{\rho}]>n^d E [ min { T Q , S } ρ ] > n d .
Proof. As in Theorem 5.4, if the first alternative fails then genuine traversals have probability at least 1 / ( 2 N b n d ) 1/(2N^{b}n^{d}) 1/ ( 2 N b n d ) and some bucket [ V , 2 V ) [V,2V) [ V , 2 V ) has at least 1 / ( 2 N b n d J ) 1/(2N^{b}n^{d}J) 1/ ( 2 N b n d J ) . Transferring with K ≥ N / ( 16 V ) K \ge N/(16V) K ≥ N / ( 16 V ) , the average bad-world floored capped ρ \rho ρ th moment is at least
V ρ 2 ⋅ K 2 ⋅ 1 2 N b n d J ≥ V ρ − 1 N 1 − b 128 n d J ≥ T ρ − 1 − R ( b − 1 ) 128 n d J > n d , \frac{V^{\rho}}{2}\cdot\frac{K}{2}\cdot\frac{1}{2N^{b}n^{d}J}\ge\frac{V^{\rho-1}N^{1-b}}{128n^{d}J}\ge\frac{T^{\rho-1-R(b-1)}}{128n^{d}J}>n^{d}, 2 V ρ ⋅ 2 K ⋅ 2 N b n d J 1 ≥ 128 n d J V ρ − 1 N 1 − b ≥ 128 n d J T ρ − 1 − R ( b − 1 ) > n d ,
using V ≥ T V\ge T V ≥ T , b ≥ 1 b\ge1 b ≥ 1 and N = T R N=T^{R} N = T R .
Theorem 5.4 is essentially the case b = 1 b=1 b = 1 , with θ = κ k R \theta=\kappa_kR θ = κ k R and R R R growing.
Public-head chain blocks
A public-head block at length n n n has no gates. Its head is the public label u 0 = 0 4 n u_0=0^{4n} u 0 = 0 4 n ; the labels u 1 , … , u T − 1 u_1,\ldots,u_{T-1} u 1 , … , u T − 1 are chosen uniformly without repetition from the other 4 n 4n 4 n -bit labels and W W W uniformly from { 0 , 1 } n ∖ { 0 n } \{0,1\}^{n}\setminus\{0^{n}\} { 0 , 1 } n ∖ { 0 n } . The successor oracle is as before, and a type field distinguishes these blocks from gated ones.
Lemma 5.6 (Public-head blocks against finitely many machines). Fix the oracle outside a public-head block at length n n n , let 1 ≤ h ≤ n / 2 1\le h\le n/2 1 ≤ h ≤ n /2 , T = 2 h T=2^{h} T = 2 h and F = T / 2 F=T/2 F = T /2 , and let Q 0 , … , Q s Q_0,\ldots,Q_s Q 0 , … , Q s be machines. If the block’s query encodings are shorter than F F F and
( s + 1 ) 2 3 n / 4 ( F T 2 4 n − T − F − 1 + 1 2 n − 1 ) < 1 , (s+1)2^{3n/4}\left(\frac{FT}{2^{4n}-T-F-1}+\frac{1}{2^{n}-1}\right)<1, ( s + 1 ) 2 3 n /4 ( 2 4 n − T − F − 1 F T + 2 n − 1 1 ) < 1 , then some choice of the block satisfies, for all i ≤ s i\le s i ≤ s simultaneously,
Pr [ Q i ( 1 n ) outputs W in fewer than F steps ] ≤ 2 − 3 n / 4 . \Pr[Q_i(1^n)\text{ outputs }W\text{ in fewer than }F\text{ steps}]\le2^{-3n/4}. Pr [ Q i ( 1 n ) outputs W in fewer than F steps ] ≤ 2 − 3 n /4 . Proof. The proof of Theorem 5.1 applies with the head already exposed and excluded from the random-label universe, which accounts for the − 1 -1 − 1 . A run shorter than F < T F<T F < T cannot complete a traversal. So for each machine, averaged over the random block and the coins, the probability of outputting W W W before F F F is at most δ F = F T / ( 2 4 n − T − F − 1 ) + 1 / ( 2 n − 1 ) \delta_F=FT/(2^{4n}-T-F-1)+1/(2^n-1) δ F = F T / ( 2 4 n − T − F − 1 ) + 1/ ( 2 n − 1 ) . By Markov’s inequality over the block and a union bound over the s + 1 s+1 s + 1 machines, the probability that some machine violates the bound is at most ( s + 1 ) δ F 2 3 n / 4 < 1 (s+1)\delta_F2^{3n/4}<1 ( s + 1 ) δ F 2 3 n /4 < 1 .
Terminal tests and hidden witnesses
For the application to decision problems in § 6.3 , a gated block at length n n n carries two further oracle types with tag 1 n 1^n 1 n and their own type fields:
R n ( x ) = 1 [ x = W ] , V n ( x , b , z ) = 1 [ ( x , b , z ) = ( W , b ∗ , z ∗ ) ] . R_n(x)=1[x=W],\qquad V_n(x,b,z)=1[(x,b,z)=(W,b_*,z_*)]. R n ( x ) = 1 [ x = W ] , V n ( x , b , z ) = 1 [( x , b , z ) = ( W , b ∗ , z ∗ )] .
for x ∈ { 0 , 1 } n x\in\{0,1\}^{n} x ∈ { 0 , 1 } n , b ∈ { 0 , 1 } b\in\{0,1\} b ∈ { 0 , 1 } and z ∈ { 0 , 1 } ℓ z\in\{0,1\}^{\ell} z ∈ { 0 , 1 } ℓ , with malformed queries answered zero. The verification table V n V_n V n has exactly one positive entry. While the gated part of the block is chosen, R n R_n R n is installed and V n V_n V n is provisionally zero; the witness ( b ∗ , z ∗ ) (b_*,z_*) ( b ∗ , z ∗ ) is chosen afterwards.
Lemma 5.7 (Shortcut bound with terminal tests). Theorem 5.1 holds in the presence of R n R_n R n , with V n V_n V n zero, when δ \delta δ is replaced by
δ + = S T U − T − S + S + 1 2 n − 1 − S , \delta^{+}=\frac{ST}{U-T-S}+\frac{S+1}{2^{n}-1-S}, δ + = U − T − S S T + 2 n − 1 − S S + 1 , provided both denominators are positive. An equality query that returns one counts as a shortcut.
Proof. The chain part is unchanged. Before the terminal is exposed, each equality query that returns zero excludes one candidate for W W W , so conditional on the augmented history W W W is uniform on the remaining nonzero strings. A union bound over at most S S S equality queries and the final output gives the second term.
A candidate that queries V n V_n V n at the hidden witness could change its output law after the witness is inserted. We therefore apply the block lemmas not to the candidate but to a monitor . Given Q Q Q , the monitor runs Q ( 1 n ) Q(1^n) Q ( 1 n ) on the same coins and forwards every oracle query, except that a well-formed query V n ( x , b , z ) V_n(x,b,z) V n ( x , b , z ) at the current length is replaced by the query R n ( x ) R_n(x) R n ( x ) : if the answer is one, the monitor stops and reports output x x x ; otherwise it answers zero to Q Q Q . If Q Q Q halts, the monitor reports Q Q Q ’s output. Its clock τ \tau τ is the number of simulated steps of Q Q Q when it stops, with τ = ∞ \tau= \infty τ = ∞ if it never stops. The monitor is an analytical device; only its queries and its clock matter, not the time needed to implement it.
Lemma 5.8 (Monitoring). Fix the oracle outside the block’s verification table.
The law of the monitor does not depend on which single entry of V n V_n V n is positive.
By clock value t t t the monitor has made at most t t t oracle queries, and for every choice of the witness τ ≤ T Q ( n ) \tau\le T_Q(n) τ ≤ T Q ( n ) on the same coins.
For every cutoff S S S and every choice of the witness,
Pr [ Q ( 1 n ) = W , T Q < S ] ≤ Pr [ the monitor reports W with τ < S ] . \Pr[Q(1^n) = W,\ T_Q < S] \le\Pr[\text{the monitor reports } W \text{ with } \tau< S]. Pr [ Q ( 1 n ) = W , T Q < S ] ≤ Pr [ the monitor reports W with τ < S ] .
Proof. The monitor never queries V n V_n V n , and its replies to Q Q Q about strings x ≠ W x \ne W x = W are correct in every completion. So it agrees with Q Q Q , on the same coins, until Q Q Q halts or first queries V n V_n V n about W W W , and at that moment the monitor stops. This gives the first two parts. If Q Q Q outputs W W W before time S S S , either the monitor stopped earlier at a query about W W W , reporting W W W , or it reached the same halt.
Theorems 5.2, 5.4, 5.5 and 5.7 use only that a process makes at most t t t queries by clock value t t t , that a genuine traversal needs clock value at least T T T , and that identical transcripts have identical clocks. The monitor has all three properties, so Theorems 5.4 and 5.5 apply to it, with δ + \delta^{+} δ + in place of δ \delta δ and min { τ , S } \min\{\tau,S\} min { τ , S } in place of min { T Q , S } \min\{T_Q,S\} min { T Q , S } .
Lemma 5.9 (A hidden witness). Fix the oracle outside the verification table, a randomized oracle machine M M M , and H = 2 ℓ ≥ 16 H = 2^\ell\ge16 H = 2 ℓ ≥ 16 . Some choice of the witness ( b ∗ , z ∗ ) (b_*,z_*) ( b ∗ , z ∗ ) has the following property: if, in the resulting oracle, M ( W ) M(W) M ( W ) outputs b ∗ b_* b ∗ with probability at least 2 / 3 2/3 2/3 , then Pr [ T M ( W ) ≥ H / 16 ] > 1 / 16 \Pr[T_M(W) \ge H/16] > 1/16 Pr [ T M ( W ) ≥ H /16 ] > 1/16 , so E [ T M ( W ) w ] > 16 − w − 1 H w \mathbb{E}[T_M(W)^w] > 16^{-w-1}H^w E [ T M ( W ) w ] > 1 6 − w − 1 H w for every real w > 0 w > 0 w > 0 , and in particular E [ T M ( W ) ] ≥ H / 256 \mathbb{E}[T_M(W)] \ge H/256 E [ T M ( W )] ≥ H /256 . The property depends only on oracle answers to strings shorter than H / 16 H/16 H /16 , and the choice is a finite computation.
Proof. Put h = H / 16 h = H/16 h = H /16 and run M ( W ) M(W) M ( W ) with the verification table all zero. Let p b p_b p b be the probability that it halts with output b b b before time h h h , and choose b ∗ b_* b ∗ with p b ∗ ≤ 1 / 2 p_{b_*} \le1/2 p b ∗ ≤ 1/2 . For each x x x let u x u_x u x be the probability that it queries V n ( W , b ∗ , x ) V_n(W,b_*,x) V n ( W , b ∗ , x ) before time h h h . A run of M M M that makes fewer than h h h queries, so ∑ x u x ≤ h \sum_x u_x \le h ∑ x u x ≤ h , and some z ∗ z_* z ∗ has u z ∗ ≤ h / H = 1 / 16 u_{z_*} \le h/H = 1/16 u z ∗ ≤ h / H = 1/16 . With this witness the two executions agree, on the same coins, until the query V n ( W , b ∗ , z ∗ ) V_n(W,b_*,z_*) V n ( W , b ∗ , z ∗ ) . Hence M ( W ) M(W) M ( W ) halts with output b ∗ b_* b ∗ before time h h h with probability at most 1 / 2 + 1 / 16 1/2 + 1/16 1/2 + 1/16 , so if it is correct with probability at least 2 / 3 2/3 2/3 then Pr [ T M ( W ) ≥ h ] ≥ 2 / 3 − 9 / 16 > 1 / 16 \Pr[T_M(W) \ge h] \ge2/3 - 9/16 > 1/16 Pr [ T M ( W ) ≥ h ] ≥ 2/3 − 9/16 > 1/16 , and E [ T M ( W ) w ] ≥ h w / 16 \mathbb{E}[T_M(W)^w] \ge h^w/16 E [ T M ( W ) w ] ≥ h w /16 .
Reveal blocks
Against candidates of order at most one, a chain is not needed: finding one positive seed among N N N already costs too much. A reveal block at length n n n has N N N seeds of log N \log N log N bits, one positive seed g g g , and a terminal W ∈ { 0 , 1 } n ∖ { 0 n } W \in\{0,1\}^{n} \setminus\{0^{n}\} W ∈ { 0 , 1 } n ∖ { 0 n } , with U = 2 n − 1 U = 2^{n} - 1 U = 2 n − 1 possible values. Its tables are the flag G ( g ′ ) = 1 [ g ′ = g ] G(g') = \mathbf{1}[g' = g] G ( g ′ ) = 1 [ g ′ = g ] , the reveal table returning bit k k k of W W W at g ′ = g g' = g g ′ = g and zero elsewhere, and the terminal test and verification table of Section 5.5. In the analysis g g g and W W W are uniform and independent. For a candidate Q Q Q and a cap S ≥ N S \ge N S ≥ N , the stopped trace runs Q ( 1 n ) Q(1^{n}) Q ( 1 n ) as the monitor of Section 5.5 does, and also stops and reports when Q Q Q queries the flag or the reveal table at g g g . Its clock τ \tau τ counts simulated steps of Q Q Q , capped at S S S . A stop is successful if the trace queries the flag or the reveal table at g g g , or reports W W W ; a halt with any other output is unsuccessful. Let q ∗ q_* q ∗ be the probability of a successful stop with τ < S \tau< S τ < S . As in Theorem 5.8, its law does not depend on the witness, τ ≤ T Q \tau\le T_Q τ ≤ T Q , and Pr [ Q ( 1 n ) = W , T Q < S ] ≤ q ∗ \Pr[Q(1^{n}) = W, T_Q < S] \le q_* Pr [ Q ( 1 n ) = W , T Q < S ] ≤ q ∗ .
Lemma 5.10 (Search dichotomy). Let 0 < b < ρ ≤ 1 0 < b < \rho\le1 0 < b < ρ ≤ 1 , d ≥ 1 d \ge1 d ≥ 1 , N ≥ 4 N \ge4 N ≥ 4 divisible by 4, U ≥ max { N , 2 N b n d } U \ge\max\{N, 2N^{bn^{d}}\} U ≥ max { N , 2 N b n d } and N ρ − b > 256 n 2 d N^{\rho-b} > 256n^{2d} N ρ − b > 256 n 2 d , and fix Q Q Q , a cap S ≥ N S \ge N S ≥ N and the oracle outside the block. Then either some reveal block has q ∗ < N − b n − d q_* < N^{-b n^{-d}} q ∗ < N − b n − d , or some reveal block has E [ ⌊ τ ρ ⌋ ] > n d \mathbb{E}[\lfloor\tau^{\rho}\rfloor] > n^{d} E [⌊ τ ρ ⌋] > n d .
Proof. We first show E g , W q ∗ ≤ 16 N − ρ E g , W E [ τ ρ ] + 1 / U \mathbb{E}_{g,W} q_* \le16N^{-\rho}\mathbb{E}_{g,W}\mathbb{E}[\tau^{\rho}] + 1/U E g , W q ∗ ≤ 16 N − ρ E g , W E [ τ ρ ] + 1/ U . Fix the coins of Q Q Q and run it against the all-zero block; let ℓ ≤ S \ell\le S ℓ ≤ S be the clock at which this run stops. The stopped trace agrees with it until it touches g g g or a key equal to W W W . By clock value t t t it has queried at most t t t seeds and at most t t t keys, so the probability of a touch, or of an output equal to W W W , by then is at most t / N + ( t + 1 ) / U t/N + (t+1)/U t / N + ( t + 1 ) / U . Let k = ⌊ N / 4 ⌋ ≥ N / 8 k = \lfloor N/4\rfloor\ge N/8 k = ⌊ N /4 ⌋ ≥ N /8 . If ℓ ≤ k \ell\le k ℓ ≤ k , the trace runs to ℓ \ell ℓ with probability at least 1 / 2 1/2 1/2 , so E g , W τ ρ ≥ ℓ ρ / 2 \mathbb{E}_{g,W}\tau^{\rho} \ge\ell^{\rho}/2 E g , W τ ρ ≥ ℓ ρ /2 , while it reports with probability at most ℓ / N + ( ℓ + 1 ) / U ≤ 2 ( ℓ / N ) ρ + 1 / U ≤ 4 N − ρ E g , W τ ρ + 1 / U \ell/N + (\ell+1)/U \le2(\ell/N)^{\rho} + 1/U \le4N^{-\rho}\mathbb{E}_{g,W}\tau^{\rho} + 1/U ℓ / N + ( ℓ + 1 ) / U ≤ 2 ( ℓ / N ) ρ + 1/ U ≤ 4 N − ρ E g , W τ ρ + 1/ U , using ℓ ≤ N ≤ U \ell\le N \le U ℓ ≤ N ≤ U and ρ ≤ 1 \rho\le1 ρ ≤ 1 . If ℓ > k \ell> k ℓ > k , then τ ≥ k \tau\ge k τ ≥ k with probability at least 1 / 2 1/2 1/2 , so E g , W τ ρ ≥ k ρ / 2 ≥ N ρ / 16 \mathbb{E}_{g,W}\tau^{\rho} \ge k^{\rho}/2 \ge N^{\rho}/16 E g , W τ ρ ≥ k ρ /2 ≥ N ρ /16 and the bound is trivial. Averaging over the coins proves the claim.
If every block has q ∗ ≥ N − b n − d q_* \ge N^{-b n^{-d}} q ∗ ≥ N − b n − d , then E τ ρ ≥ N ρ ( N − b n − d − 1 / U ) / 16 ≥ N ρ − b n − d / 32 > 8 n d \mathbb{E}\tau^{\rho} \ge N^{\rho}(N^{-b n^{-d}} - 1/U)/16 \ge N^{\rho-b n^{-d}}/32 > 8n^{d} E τ ρ ≥ N ρ ( N − b n − d − 1/ U ) /16 ≥ N ρ − b n − d /32 > 8 n d on average over blocks, and ⌊ y ⌋ ≥ y − 1 \lfloor y\rfloor\ge y - 1 ⌊ y ⌋ ≥ y − 1 gives a block with E [ ⌊ τ ρ ⌋ ] > n d \mathbb{E}[\lfloor\tau^{\rho}\rfloor] > n^{d} E [⌊ τ ρ ⌋] > n d .
The negative oracles
Schedule and freezing
Enumerate oracle machines Q 0 , Q 1 , … Q_0, Q_1, \ldots Q 0 , Q 1 , … , and fix an elementary decoding of integers e e e into rational tuples ( R , ρ , b , θ ) (R,\rho,b,\theta) ( R , ρ , b , θ ) in which every valid tuple occurs, the components have bit length polynomial in log ( e + 2 ) \log(e+2) log ( e + 2 ) , and invalid codes decode to the valid tuple ( 2 , 2 , 1 , 3 / 2 ) (2,2,1,3/2) ( 2 , 2 , 1 , 3/2 ) . Stages s ≥ 0 s \ge0 s ≥ 0 come in three kinds, by s m o d 3 s \bmod3 s mod 3 ; in all of them d s = s + 1 d_s = s+1 d s = s + 1 .
Public-head stages, s = 3 t s = 3t s = 3 t : the block is public-head with h s = ⌈ n / ( s + 2 ) ⌉ h_s = \lceil n/(s+2)\rceil h s = ⌈ n / ( s + 2 )⌉ , T s = 2 h s T_s = 2^{h_s} T s = 2 h s and S s = T s / 2 S_s = T_s/2 S s = T s /2 .
Gated stages, s = 3 t + 1 s = 3t+1 s = 3 t + 1 : writing ν 2 ( m ) \nu_2(m) ν 2 ( m ) for the exponent of the largest power of two dividing m m m , decode ν 2 ( t + 1 ) \nu_2(t+1) ν 2 ( t + 1 ) by an elementary bijection as a triple ( i s , k s − 1 , j s ) (i_s,k_s-1,j_s) ( i s , k s − 1 , j s ) with k s ≥ 1 k_s \ge1 k s ≥ 1 , each component at most its code, and put R s = s + 3 R_s = s+3 R s = s + 3 . The block is gated, with the parameters of Theorem 5.4 for ( k s , F s , R s ) (k_s,F_s,R_s) ( k s , F s , R s ) , where F s = F s ( n ) = 2 ⌊ n / 2 2 s + 8 ⌋ F_s = F_s(n) = 2^{\lfloor n/2^{2s+8}\rfloor} F s = F s ( n ) = 2 ⌊ n / 2 2 s + 8 ⌋ ; see the general threshold after Theorem 5.4. It also carries the terminal test and a verification table of Section 5.5, with H s = 2 ℓ s = N s n d s H_s = 2^{\ell_s} = N_s n^{d_s} H s = 2 ℓ s = N s n d s .
Power stages, s = 3 t + 2 s = 3t+2 s = 3 t + 2 : decode ν 2 ( t + 1 ) \nu_2(t+1) ν 2 ( t + 1 ) in the same way as a requirement of one of four types, each with a candidate index i s i_s i s and a solver index j s j_s j s :
fixed , ( i s , e s , λ s , j s ) (i_s,e_s,\lambda_s,j_s) ( i s , e s , λ s , j s ) with a rational λ s ≥ 0 \lambda_s \ge0 λ s ≥ 0 : the stage uses the valid tuple decoded from e s e_s e s ;
– drifting , ( i s , a , r , v , j s ) (i_s,a,r,v,j_s) ( i s , a , r , v , j s ) with rationals a > 1 a>1 a > 1 , r ≥ 1 r\ge1 r ≥ 1 , v > 0 v>0 v > 0 : the stage uses the valid tuple
ε s = min { 1 , ( a − 1 ) / ( 4 ( r + 1 ) ) } s + 2 , ρ s = a − ε s , R s = r + ε s , b s = 1 + ρ s − 1 R s − ε s , \varepsilon_s=\frac{\min\{1,(a-1)/(4(r+1))\}}{s+2},\qquad\rho_s=a-\varepsilon_s,\qquad R_s=r+\varepsilon_s,\qquad b_s=1+\frac{\rho_s-1}{R_s}-\varepsilon_s, ε s = s + 2 min { 1 , ( a − 1 ) / ( 4 ( r + 1 ))} , ρ s = a − ε s , R s = r + ε s , b s = 1 + R s ρ s − 1 − ε s ,
with θ s \theta_s θ s the midpoint of max { 1 , R s b s / ρ s } \max\{1,R_sb_s/\rho_s\} max { 1 , R s b s / ρ s } and R s R_s R s , and λ s = b s / v \lambda_s=b_s/v λ s = b s / v ; – thin , ( i s , γ s , λ s , j s ) (i_s,\gamma_s,\lambda_s,j_s) ( i s , γ s , λ s , j s ) with rationals 0 < γ s < 1 0<\gamma_s<1 0 < γ s < 1 and λ s ≥ 0 \lambda_s\ge0 λ s ≥ 0 ; – reveal , ( i s , a , v , j s ) (i_s,a,v,j_s) ( i s , a , v , j s ) with rationals 0 < a ≤ 1 0<a\le1 0 < a ≤ 1 and v > 0 v>0 v > 0 : put ε s = a / ( 4 ( s + 2 ) ) \varepsilon_s=a/(4(s+2)) ε s = a / ( 4 ( s + 2 )) , ρ s = a − ε s \rho_s=a-\varepsilon_s ρ s = a − ε s , b s = a − 2 ε s b_s=a-2\varepsilon_s b s = a − 2 ε s and K s = ⌈ 2 / a ⌉ + 1 K_s=\lceil2/a\rceil+1 K s = ⌈ 2/ a ⌉ + 1 .
At fixed and drifting stages the block is gated, with the parameters of Theorem 5.5 for the stage’s tuple, d = d s d=d_s d = d s and σ = ( s + 2 ) ( 1 + ⌈ λ s R s ⌉ ) \sigma=(s+2)(1+\lceil\lambda_sR_s\rceil) σ = ( s + 2 ) ( 1 + ⌈ λ s R s ⌉) , where R s R_s R s is the tuple’s first component. At thin stages the block is gated with a single positive seed among N s = 2 ⌈ γ s h s ⌉ N_s=2^{\lceil\gamma_sh_s\rceil} N s = 2 ⌈ γ s h s ⌉ seeds, where h s = ⌊ n s / ( 64 ( s + 2 ) ( 1 + ⌈ λ s ⌉ ) ) ⌋ h_s=\lfloor n_s/(64(s+2)(1+\lceil\lambda_s\rceil))\rfloor h s = ⌊ n s / ( 64 ( s + 2 ) ( 1 + ⌈ λ s ⌉))⌋ , T s = 2 h s T_s=2^{h_s} T s = 2 h s and S s = T s / 2 S_s=T_s/2 S s = T s /2 . At reveal stages the block is a reveal block (§ 5.6 ) with N s = 2 h s N_s=2^{h_s} N s = 2 h s seeds, where h s = ⌊ n s / ( 64 ( s + 2 ) K s ( 1 + ⌈ 1 / v ⌉ ) ) ⌋ h_s=\lfloor n_s/(64(s+2)K_s(1+\lceil1/v\rceil))\rfloor h s = ⌊ n s / ( 64 ( s + 2 ) K s ( 1 + ⌈ 1/ v ⌉))⌋ , and cutoff S s = N s K s S_s=N_s^{K_s} S s = N s K s . Every power stage carries the terminal test and a verification table of § 5.5 , with H s = 2 ℓ s H_s=2^{\ell_s} H s = 2 ℓ s , where ℓ s = max { 4 , ⌊ λ s log N s ⌋ } \ell_s=\max\{4,\lfloor\lambda_s\log N_s\rfloor\} ℓ s = max { 4 , ⌊ λ s log N s ⌋} at fixed and drifting stages, ℓ s = max { 4 , ⌊ λ s h s ⌋ } \ell_s=\max\{4,\lfloor\lambda_sh_s\rfloor\} ℓ s = max { 4 , ⌊ λ s h s ⌋} at thin stages and ℓ s = max { 4 , ⌊ b s h s / v ⌋ } \ell_s=\max\{4,\lfloor b_sh_s/v\rfloor\} ℓ s = max { 4 , ⌊ b s h s / v ⌋} at reveal stages.
Every triple ( i , k , j ) (i,k,j) ( i , k , j ) occurs at infinitely many gated stages and every power requirement at infinitely many power stages. A fixed power stage with candidate i i i and tuple e e e is assigned to ( i , e ) (i,e) ( i , e ) , whatever its other components. In all cases S s S_s S s is the cutoff. The freezing length is S s S_s S s at public-head stages and max { S s , H s } \max\{S_s,H_s\} max { S s , H s } at gated and power stages.
For a drifting requirement, 1 < ρ s < a 1<\rho_s<a 1 < ρ s < a , R s > r R_s>r R s > r , η s = ρ s − 1 − R s ( b s − 1 ) = R s ε s > 0 \eta_s=\rho_s-1-R_s(b_s-1)=R_s\varepsilon_s>0 η s = ρ s − 1 − R s ( b s − 1 ) = R s ε s > 0 , 1 < b s < ρ s 1<b_s<\rho_s 1 < b s < ρ s and b s < B ( a , r ) b_s<B(a,r) b s < B ( a , r ) , so the tuple is valid; and b s → B ( a , r ) b_s\to B(a,r) b s → B ( a , r ) along the stages of the requirement. The choice of σ \sigma σ gives λ s log N s = λ s R s h s ≤ n s / 64 \lambda_s\log N_s=\lambda_sR_sh_s\le n_s/64 λ s log N s = λ s R s h s ≤ n s /64 , and similarly λ s h s ≤ n s / 64 \lambda_sh_s\le n_s/64 λ s h s ≤ n s /64 at thin stages and b s h s / v ≤ n s / 64 b_sh_s/v\le n_s/64 b s h s / v ≤ n s /64 at reveal stages, so ℓ s ≤ n s / 64 \ell_s\le n_s/64 ℓ s ≤ n s /64 whenever ℓ s > 4 \ell_s>4 ℓ s > 4 ; also log S s = K s h s ≤ n s / 64 \log S_s=K_sh_s\le n_s/64 log S s = K s h s ≤ n s /64 at reveal stages.
Let n s n_s n s be the first power of two that satisfies the encoding-size requirements, the inequality of Theorem 5.6 at public-head stages, (5) at gated stages, with δ + \delta^+ δ + of Theorem 5.7 in place of δ \delta δ and with ℓ s ≤ n s / 4 \ell_s\le n_s/4 ℓ s ≤ n s /4 , (6) at fixed and drifting power stages, with δ + \delta^+ δ + in place of δ \delta δ , at thin stages h s ≥ 1 h_s\ge1 h s ≥ 1 and δ + ≤ 2 − n s / 2 \delta^+\le2^{-n_s/2} δ + ≤ 2 − n s /2 for the cutoff S s = T s / 2 S_s=T_s/2 S s = T s /2 , at reveal stages h s ≥ 2 h_s\ge2 h s ≥ 2 , 2 n s − 1 ≥ 2 N s b s n s d s 2^{n_s}-1\ge2N_s^{b_s}n_s^{d_s} 2 n s − 1 ≥ 2 N s b s n s d s , N s ρ s − b s > 256 n s 2 d s N_s^{\rho_s-b_s}>256n_s^{2d_s} N s ρ s − b s > 256 n s 2 d s and N s K s a − b s ≥ n s 3 d s N_s^{K_s a-b_s}\ge n_s^{3d_s} N s K s a − b s ≥ n s 3 d s , and
n s ≥ max { 4 , 2 ( s + 2 ) 2 } , n s ≥ 2 2 s − 1 ( s > 0 ) . n_s\ge\max\{4,2^{(s+2)^2}\},\qquad n_s\ge2^{2^{s-1}}\quad(s>0). n s ≥ max { 4 , 2 ( s + 2 ) 2 } , n s ≥ 2 2 s − 1 ( s > 0 ) .
The last condition implies that n s n_s n s exceeds the freezing length of stage s − 1 s-1 s − 1 , since S s − 1 , H s − 1 ≤ 2 n s − 1 / 4 S_{s-1},H_{s-1}\le2^{n_{s-1}/4} S s − 1 , H s − 1 ≤ 2 n s − 1 /4 at gated and power stages. Such n s n_s n s exists because the parameters at a fixed stage are fixed. At public-head stages n s ≥ 2 ( s + 2 ) 2 n_s\ge2^{(s+2)^2} n s ≥ 2 ( s + 2 ) 2 gives h s ≥ ( s + 2 ) 2 log n s h_s\ge(s+2)^2\log n_s h s ≥ ( s + 2 ) 2 log n s for large s s s , so h s / log n s → ∞ h_s/\log n_s\to\infty h s / log n s → ∞ while h s / n s → 0 h_s/n_s\to0 h s / n s → 0 .
Recognition. The schedule does not depend on any oracle choice, and on input 1 n 1^n 1 n one can decide in polynomial time whether n n n is a stage length and recover the stage and its parameters. Generate candidate powers of two only while they do not exceed n n n ; there are polynomially many candidates and stages. At a candidate m ≤ n m\le n m ≤ n all parameters have polynomial bit length, and every test involves integers of polynomial bit length: R s h s ≤ m / 8 R_sh_s\le m/8 R s h s ≤ m /8 , log S s ≤ m / 8 + 2 ⌊ m / 2 2 s + 8 ⌋ \log S_s\le m/8+2\lfloor m/2^{2s+8}\rfloor log S s ≤ m /8 + 2 ⌊ m / 2 2 s + 8 ⌋ and ℓ s ≤ m / 4 \ell_s\le m/4 ℓ s ≤ m /4 at gated stages, h R b ≤ m / 64 hR_b\le m/64 h R b ≤ m /64 , log S ≤ m / 4 + 2 d s log m \log S\le m/4+2d_s\log m log S ≤ m /4 + 2 d s log m and ℓ s ≤ m / 64 \ell_s\le m/64 ℓ s ≤ m /64 at power stages, D k s D_{k_s} D k s , the decoded tuples and the drifting tuples have bit length polynomial in log ( s + 2 ) \log(s+2) log ( s + 2 ) , and the public-head, thin-stage and reveal-stage tests have exponents O ( m ) O(m) O ( m ) . A candidate with h = 0 h=0 h = 0 is rejected before the other quantities are formed. Growth conditions are tested by comparing exponents with ⌊ log n ⌋ \lfloor\log n\rfloor ⌊ log n ⌋ , and a proposed next power of two is compared with n n n before it is constructed.
Freezing. At stage s s s keep all previously frozen answers and set every other answer outside the current block provisionally to zero. At a public-head stage select a block given by Theorem 5.6 for Q 0 , … , Q s Q_0,\ldots,Q_s Q 0 , … , Q s . At a gated stage install the terminal test, leave the verification table zero, apply Theorem 5.4 to the monitor of Q i s Q_{i_s} Q i s (Theorem 5.8), and select the resulting good or bad block; then choose the witness by Theorem 5.9 for M j s = Q j s M_{j_s}=Q_{j_s} M j s = Q j s on input W s W_s W s with H = H s H=H_s H = H s . At a fixed or drifting power stage install the terminal test, leave the verification table zero, apply Theorem 5.5 to the monitor of Q i s Q_{i_s} Q i s , and select the resulting block. At a thin stage install the terminal test, leave the table zero, and select a block that minimizes the probability that the monitor of Q i s Q_{i_s} Q i s reports W W W with τ < S s \tau<S_s τ < S s . At a reveal stage install the terminal test, leave the table zero, apply Theorem 5.10 with ( ρ , b , d ) = ( ρ s , b s , d s ) (\rho,b,d)=(\rho_s,b_s,d_s) ( ρ , b , d ) = ( ρ s , b s , d s ) to the stopped trace of Q i s Q_{i_s} Q i s , and select the first block with q ∗ < N − b s n s − d s q_*<N^{-\!b_s}n_s^{-\!d_s} q ∗ < N − b s n s − d s if one exists, and otherwise the first block with E ⌊ τ ρ s ⌋ > n s d s \mathbb{E}\lfloor\tau^{\rho_s}\rfloor>n_s^{d_s} E ⌊ τ ρ s ⌋ > n s d s . At every power stage then choose the witness by Theorem 5.9 for M j s = Q j s M_{j_s}=Q_{j_s} M j s = Q j s on input W s W_s W s with H = H s H=H_s H = H s . When several blocks qualify, take the first one in a fixed order on block descriptions; for the bad alternatives the test is the floored moment of Theorems 5.4 and 5.5. Then freeze every answer on strings of length at most the freezing length, including the provisional zeros. All valid encodings of the current block are shorter than S s S_s S s . Every later block carries a unary tag longer than the freezing length, and writing it takes longer than that, so later choices cannot change any cutoff computation, capped moment or witness diagonalization used at stage s s s ; by Theorem 5.8, the choice of the witness does not change the monitor’s certificate either. All remaining answers are zero. This defines one ordinary bit oracle O O O .
Above the first moment
Theorem 6.1. For every real a > 1 a>1 a > 1 and every Q ∈ S a O Q\in S_a^O Q ∈ S a O there is a sampler A ∈ S a l l O ∩ W O A\in S_{\mathrm{all}}^O\cap W^O A ∈ S all O ∩ W O with worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) that Q Q Q does not polynomially dominate. The oracle does not depend on a a a , and a a a may be noncomputable.
Proof. Let Q = Q i Q=Q_i Q = Q i and E [ T Q i ( n ) a ] ≤ C ( n + 2 ) e \mathbb{E}[T_{Q_i}(n)^a]\le C(n+2)^e E [ T Q i ( n ) a ] ≤ C ( n + 2 ) e . Choose k k k with ρ k < a \rho_k<a ρ k < a .
Only finitely many bad stages. At a bad gated stage assigned to ( i , k ) (i,k) ( i , k ) , Theorem 5.4 for the monitor, τ ≤ T Q i \tau\le T_{Q_i} τ ≤ T Q i from Theorem 5.8, and T ≥ 1 T\ge1 T ≥ 1 give
E [ T Q i ( n s ) a ] ≥ E [ min { τ , S s } ρ k ] > F s ( n s ) . \mathbb{E}[T_{Q_i}(n_s)^a]\ge\mathbb{E}\left[\min\{\tau,S_s\}^{\rho_k}\right]>F_s(n_s). E [ T Q i ( n s ) a ] ≥ E [ min { τ , S s } ρ k ] > F s ( n s ) .
For s ≥ 2 s\ge2 s ≥ 2 we have n s ≥ 2 ( s + 2 ) 2 ≥ 2 2 s + 8 n_s\ge2^{(s+2)^2}\ge2^{2s+8} n s ≥ 2 ( s + 2 ) 2 ≥ 2 2 s + 8 , so F s ( n s ) ≥ 2 n s / 2 s + 9 F_s(n_s)\ge2^{n_s/2^{s+9}} F s ( n s ) ≥ 2 n s / 2 s + 9 , which eventually exceeds every polynomial in n s n_s n s ; so this can happen only finitely often.
The competitor. Let A = A i , k A=A_{i,k} A = A i , k output 0 n 0^n 0 n except at gated stage lengths assigned to ( i , k ) (i,k) ( i , k ) . There it picks a uniform seed among N s N_s N s seeds using log N s \log N_s log N s fair bits, outputs 0 n 0^n 0 n if the gate is negative, and otherwise follows the chain for at most T s T_s T s links and outputs the terminal; malformed answers or a timeout give 0 n 0^n 0 n . Recognition is polynomial time, so A A A is a total uniform sampler. At each good assigned stage, P A ( W ∣ n s ) = 1 / N s P_A(W\mid n_s)=1/N_s P A ( W ∣ n s ) = 1/ N s , and for every fixed r > 0 r>0 r > 0
E [ T A ( n s ) r ] ≤ poly i , k , r ( n s ) ( 1 + T s r / N s ) . \mathbb{E}[T_A(n_s)^r]\le\operatorname{poly}_{i,k,r}(n_s)(1+T_s^r/N_s). E [ T A ( n s ) r ] ≤ poly i , k , r ( n s ) ( 1 + T s r / N s ) .
Since R s → ∞ R_s\to\infty R s → ∞ , eventually T s r / N s = T s r − R s ≤ 1 T_s^r/N_s=T_s^{r-R_s}\le1 T s r / N s = T s r − R s ≤ 1 . Earlier stages and the finitely many bad stages have bounded runtime and only change constants, so A ∈ S r O A\in S_r^O A ∈ S r O for every r r r , that is, A ∈ S a l l O A\in S_{\mathrm{all}}^O A ∈ S all O . It stores a seed, a constant number of 4 n 4n 4 n -bit labels, a log T s \log T_s log T s -bit counter and polynomial bookkeeping, so A ∈ W O A\in W^O A ∈ W O . Its worst-case time is poly ( n ) ( 1 + T s ) \operatorname{poly}(n)(1+T_s) poly ( n ) ( 1 + T s ) , and log T s ≤ n s / ( 8 R s ) = o ( n s ) \log T_s\le n_s/(8R_s)=o(n_s) log T s ≤ n s / ( 8 R s ) = o ( n s ) .
Domination fails. At every sufficiently late good stage assigned to ( i , k ) (i,k) ( i , k ) , part 3 of Theorem 5.8 bounds the probability that Q i Q_i Q i outputs W W W before time S s S_s S s by 1 / ( N s F s ) 1/(N_sF_s) 1/ ( N s F s ) , and Markov’s inequality on the event T Q i ≥ S s T_{Q_i} \ge S_s T Q i ≥ S s gives
P Q i ( W ∣ n s ) ≤ 1 N s F s + C ( n s + 2 ) e S s a ≤ 1 N s F s + C ( n s + 2 ) e N s F s 2 ≤ 2 N s F s , P_{Q_i}(W \mid n_s) \le\frac{1}{N_sF_s}+\frac{C(n_s+2)^e}{S_s^a}\le\frac{1}{N_sF_s}+\frac{C(n_s+2)^e}{N_sF_s^2}\le\frac{2}{N_sF_s}, P Q i ( W ∣ n s ) ≤ N s F s 1 + S s a C ( n s + 2 ) e ≤ N s F s 1 + N s F s 2 C ( n s + 2 ) e ≤ N s F s 2 ,
with F s = F s ( n s ) F_s=F_s(n_s) F s = F s ( n s ) . The middle step uses S s a = N s κ k a F s 2 a ≥ N s F s 2 S_s^a=N_s^{\kappa_k a}F_s^{2a}\ge N_sF_s^2 S s a = N s κ k a F s 2 a ≥ N s F s 2 , since κ k a > κ k ρ k > 1 \kappa_k a>\kappa_k\rho_k>1 κ k a > κ k ρ k > 1 ; the last holds once F s ≥ C ( n s + 2 ) e F_s\ge C(n_s+2)^e F s ≥ C ( n s + 2 ) e . So P A ( W ∣ n s ) / P Q i ( W ∣ n s ) ≥ F s / 2 P_A(W\mid n_s)/P_{Q_i}(W\mid n_s)\ge F_s/2 P A ( W ∣ n s ) / P Q i ( W ∣ n s ) ≥ F s /2 along infinitely many lengths, which beats every fixed polynomial. □
Solvers, not only distributions
Theorem 6.1 separates distributions, and the optimality part of Theorem 4.6 concerns arbitrary cost functions. The witnesses of § 5.5 turn the separation into one about the running times of all correct algorithms for one decision problem. We write U P O \mathrm{UPO} UPO and c o U P O \mathrm{coUPO} coUPO for the relativized classes.
Theorem 6.2 (An operational endpoint). For every real a > 1 a>1 a > 1 and every Q ∈ S a O Q\in S_a^O Q ∈ S a O there are a sampler A ∈ S a l l O ∩ W O A\in S_{\mathrm{all}}^O\cap W^O A ∈ S all O ∩ W O with worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) , a language L ∈ U P O ∩ c o U P O L\in\mathrm{UPO}\cap\mathrm{coUPO} L ∈ UPO ∩ coUPO with at most one member of each length, and a deterministic oracle machine D D D deciding L L L , such that
E x ∼ P Q ( ⋅ ∣ n ) [ T D ( x ) ] ≤ poly ( n ) \mathbb{E}_{x\sim P_Q(\cdot\mid n)}[T_D(x)]\le\operatorname{poly}(n) E x ∼ P Q ( ⋅ ∣ n ) [ T D ( x )] ≤ poly ( n ) ;
E x ∼ P A ( ⋅ ∣ n ) [ T D ( x ) ] ≤ poly ε ( n ) \mathbb{E}_{x\sim P_A(\cdot\mid n)}[T_D(x)]\le\operatorname{poly}_{\varepsilon}(n) E x ∼ P A ( ⋅ ∣ n ) [ T D ( x )] ≤ poly ε ( n ) for every ε ∈ ( 0 , 1 ) \varepsilon\in(0,1) ε ∈ ( 0 , 1 ) ;
for every randomized oracle machine M M M that decides L L L with error at most 1 / 3 1/3 1/3 on every input, E x ∼ P A ( ⋅ ∣ n ) [ T M ( x ) ] \mathbb{E}_{x\sim P_A(\cdot\mid n)}[T_M(x)] E x ∼ P A ( ⋅ ∣ n ) [ T M ( x )] , taken over x x x and the coins of M M M , is not bounded by any polynomial in n n n .
Proof. Let Q = Q i Q=Q_i Q = Q i , choose k k k with ρ k < a \rho_k<a ρ k < a , and let A = A i , k A=A_{i,k} A = A i , k be the competitor of Theorem 6.1, which never queries the verification tables. Let L L L consist of the terminals W s W_s W s of the gated stages s s s assigned to ( i , k ) (i,k) ( i , k ) , with any third component j s j_s j s , whose witness has b ∗ , s ∗ = 1 b^*_{*,s}=1 b ∗ , s ∗ = 1 . Recognition of stages is polynomial time, so L ∈ U P O L\in\mathrm{UPO} L ∈ UPO : a member x x x of length n s n_s n s has the unique certificate z z z with V n s ( x , 1 , z ) = 1 V_{n_s}(x,1,z)=1 V n s ( x , 1 , z ) = 1 . Also L ∈ c o U P O L\in\mathrm{coUPO} L ∈ coUPO : a string at another length, or with R n ( x ) = 0 R_n(x)=0 R n ( x ) = 0 , has one canonical certificate of nonmembership, checked with one query; and W s ∉ L W_s\notin L W s ∈ / L has the unique certificate z z z with V n s ( W s , 0 , z ) = 1 V_{n_s}(W_s,0,z)=1 V n s ( W s , 0 , z ) = 1 .
The decider D D D rejects at lengths other than the gated stage lengths assigned to ( i , k ) (i,k) ( i , k ) . At such a length it queries R n ( x ) R_n(x) R n ( x ) , rejects if the answer is zero, and otherwise searches all 2 ℓ s + 1 2^{\ell_s+1} 2 ℓ s + 1 entries of the verification table and returns the bit of the positive one. So T D ( x ) ≤ p ( n ) ( 1 + H s 1 [ x = W s ] ) T_D(x)\le p(n)(1+H_s\mathbf{1}[x=W_s]) T D ( x ) ≤ p ( n ) ( 1 + H s 1 [ x = W s ]) for a fixed polynomial p p p . By the proof of Theorem 6.1, only finitely many of these stages are bad, and at the good ones P Q ( W s ∣ n s ) ≤ 2 / ( N s F s ) P_Q(W_s\mid n_s)\le2/(N_sF_s) P Q ( W s ∣ n s ) ≤ 2/ ( N s F s ) , so
E P Q [ T D ] ≤ p ( n s ) ( 1 + 2 H s N s F s ) = p ( n s ) ( 1 + 2 n s d s F s ) ≤ 2 p ( n s ) \mathbb{E}_{P_Q}[T_D]\le p(n_s)\left(1+\frac{2H_s}{N_sF_s}\right)=p(n_s)\left(1+\frac{2n_s^{d_s}}{F_s}\right)\le2p(n_s) E P Q [ T D ] ≤ p ( n s ) ( 1 + N s F s 2 H s ) = p ( n s ) ( 1 + F s 2 n s d s ) ≤ 2 p ( n s )
for large s s s , since F s F_s F s is superpolynomial. At a good stage P A ( W s ∣ n s ) = 1 / N s P_A(W_s\mid n_s)=1/N_s P A ( W s ∣ n s ) = 1/ N s , so
E P A [ T D ε ] ≤ poly ε ( n s ) ( 1 + H s ε / N s ) = poly ε ( n s ) ( 1 + N s ε − 1 n s ε d s ) , \mathbb{E}_{P_A}[T_D^\varepsilon]\le\operatorname{poly}_{\varepsilon}(n_s)(1+H_s^\varepsilon/N_s)=\operatorname{poly}_{\varepsilon}(n_s)(1+N_s^{\varepsilon-1}n_s^{\varepsilon d_s}), E P A [ T D ε ] ≤ poly ε ( n s ) ( 1 + H s ε / N s ) = poly ε ( n s ) ( 1 + N s ε − 1 n s ε d s ) ,
which is polynomial because log N s ≥ n s / 16 \log N_s\ge n_s/16 log N s ≥ n s /16 for large s s s while d s log n s = o ( n s ) d_s\log n_s=o(n_s) d s log n s = o ( n s ) . The finitely many bad stages and short lengths change only constants.
Let M = M j M=M_j M = M j decide L L L with error at most $1/3. The triple ( i , k , j ) (i,k,j) ( i , k , j ) occurs at infinitely many gated stages, and all but finitely many of them are good. At each, Theorem 5.9, applied to M j M_j M j when the witness was chosen and preserved by freezing through H s H_s H s , gives E [ T M ( W s ) ] ≥ H s / 256 \mathbb{E}[T_M(W_s)]\ge H_s/256 E [ T M ( W s )] ≥ H s /256 . Hence E P A [ T M ] ≥ P A ( W s ∣ n s ) H s / 256 = n s d s / 256 \mathbb{E}_{P_A}[T_M]\ge P_A(W_s\mid n_s)H_s/256=n_s^{d_s}/256 E P A [ T M ] ≥ P A ( W s ∣ n s ) H s /256 = n s d s /256 along these stages, which exceeds every polynomial. □
Corollary 6.3 (The threshold for solvers). For every oracle, the sampler Q 1 Q_1 Q 1 of Theorem 3.4 has the following property: every algorithm that runs in expected polynomial time under Q 1 Q_1 Q 1 runs in expected polynomial time under every member of S 1 S_1 S 1 . Relative to O O O , no sampler of order above one has this property, already for sparse languages in U P O ∩ c o U P O UPO \cap coUPO U P O ∩ co U P O and sources in S a l l O S_{\mathrm{all}}^O S all O .
Proof. If P A ≤ C ( n + 2 ) c P Q 1 P_A \le C(n+2)^cP_{Q_1} P A ≤ C ( n + 2 ) c P Q 1 , then E P A [ T M ] = ∑ x P A ( x ) E [ T M ( x ) ] ≤ C ( n + 2 ) c E P Q 1 [ T M ] \mathbb{E}_{P_A}[T_M]=\sum_x P_A(x)\mathbb{E}[T_M(x)]\le C(n+2)^c\mathbb{E}_{P_{Q_1}}[T_M] E P A [ T M ] = ∑ x P A ( x ) E [ T M ( x )] ≤ C ( n + 2 ) c E P Q 1 [ T M ] . The second statement is Theorem 6.2 .
Part 2 of Theorem 6.2 puts L L L in AvgP under A A A , so this is not a separation for Levin’s average polynomial time, which allows a positive fractional moment; it is an endpoint statement at the first moment, and correctness is required on every input. It matches the positive side: against all-moments sources, Theorem 4.6 transfers E [ F v ] \mathbb{E}[F^v] E [ F v ] to E [ F v / B ] \mathbb{E}[F^v/B] E [ F v / B ] with B = B ( a , r ) B=B(a,r) B = B ( a , r ) as close to one as desired, and Theorem 6.2 shows that ratio one itself fails, for the running times of all correct solvers of one language. The same construction gives a total search problem with a unique, polynomially verifiable answer for every input: the answer is the witness ( b ∗ , z ∗ ) (b_*,z_*) ( b ∗ , z ∗ ) at a terminal and a canonical symbol elsewhere, and a fast solver for it would give one for L L L .
Remark 6.4 (Larger losses). The threshold F s = 2 ⌊ n / 2 s + 8 ⌋ F_s=2^{\lfloor n/2^{s+8}\rfloor} F s = 2 ⌊ n / 2 s + 8 ⌋ at gated stages is what makes the losses large. It is admissible at every large power of two: the constraints that involve it are
F s 2 ≤ 1 8 T ( 1 − κ k ) R , 128 J F s 2 < T ρ k − 1 , δ + ≤ 1 2 N F s . F_s^2 \le\frac{1}{8}T^{(1-\kappa_k)}R,\qquad128JF_s^2<T^{\rho_k-1},\qquad\delta^+\le\frac{1}{2NF_s}. F s 2 ≤ 8 1 T ( 1 − κ k ) R , 128 J F s 2 < T ρ k − 1 , δ + ≤ 2 N F s 1 .
With h ≥ n / ( 8 R ) − D k h\ge n/(8R)-D_k h ≥ n / ( 8 R ) − D k , the right-hand sides of the first two are at least 2 n / ( 16 ( k + 1 ) ) − O s ( 1 ) 2^{n/(16(k+1))-O_s(1)} 2 n / ( 16 ( k + 1 )) − O s ( 1 ) and 2 n / ( 8 R k ) − O s ( 1 ) 2^{n/(8Rk)-O_s(1)} 2 n / ( 8 R k ) − O s ( 1 ) , while F s 2 ≤ 2 2 n / 2 s + 8 F_s^2\le2^{2n/2^{s+8}} F s 2 ≤ 2 2 n / 2 s + 8 . Since k s ≤ s + 1 k_s\le s+1 k s ≤ s + 1 and R s = s + 3 R_s=s+3 R s = s + 3 , we have 2 2 s + 8 ≥ 64 ( k s + 1 ) 2^{2s+8}\ge64(k_s+1) 2 2 s + 8 ≥ 64 ( k s + 1 ) and 2 2 s + 8 ≥ 32 R s k s 2^{2s+8}\ge32R_sk_s 2 2 s + 8 ≥ 32 R s k s for every s ≥ 0 s\ge0 s ≥ 0 , so both hold for large n n n at each fixed stage; the third holds because N F s ≤ 2 n / 8 + n / 256 NF_s\le2^{n/8+n/256} N F s ≤ 2 n /8 + n /256 and, gated stages carrying terminal tests, the shortcut bound is δ + \delta^+ δ + of Theorem 5.7, which is O ( 2 − 7 n / 8 ) O(2^{-7n/8}) O ( 2 − 7 n /8 ) since S ≤ N / 8 ≤ 2 n / 8 S\le N/8\le2^{n/8} S ≤ N /8 ≤ 2 n /8 . Also S s ≤ N s / 8 ≤ 2 n s / 8 S_s\le N_s/8\le2^{n_s/8} S s ≤ N s /8 ≤ 2 n s /8 , so the growth condition still gives n s + 1 > S s n_{s+1}>S_s n s + 1 > S s . By the proof of Theorem 6.1, the ratio is at least F s ( n s ) / 2 F_s(n_s)/2 F s ( n s ) /2 along infinitely many lengths. Since n s ≥ 2 ( s + 2 ) 2 n_s\ge2^{(s+2)^2} n s ≥ 2 ( s + 2 ) 2 , we have 4 s ≤ 2 2 log n s 4^s\le2^{2\sqrt{\log n_s}} 4 s ≤ 2 2 l o g n s , and the ratio is 2 n s 1 − o ( 1 ) 2^{n_s^{1-o(1)}} 2 n s 1 − o ( 1 ) . In particular domination with any loss factor 2 n c 2^{n^c} 2 n c , c < 1 c<1 c < 1 , fails relative to O O O . By Theorem 3.5, on the other hand, every loss factor 2 ϵ n 2^{\epsilon n} 2 ϵ n is achievable against all-moments sources, relative to every oracle.
Below the first moment
Theorem 6.5. For every rational γ ∈ ( 0 , 1 ) \gamma\in(0,1) γ ∈ ( 0 , 1 ) there is A γ ∈ S γ O ∩ W O A_\gamma\in S_\gamma^O\cap W^O A γ ∈ S γ O ∩ W O , with worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) , that no sampler in S a O S_a^O S a O with a > γ a>\gamma a > γ polynomially dominates.
Proof. At a public-head stage length n = n s n=n_s n = n s , A γ A_\gamma A γ requires ⌈ γ h s ⌉ \lceil\gamma h_s\rceil ⌈ γ h s ⌉ fair bits to be zero. If they are, it follows the public-head chain for at most T s = 2 h s T_s=2^{h_s} T s = 2 h s links and outputs the terminal, with 0 n 0^n 0 n on malformed answers or timeout; otherwise it outputs 0 n 0^n 0 n . At other lengths it outputs 0 n 0^n 0 n . Then
E [ T A γ ( n ) γ ] ≤ poly γ ( n ) ( 1 + 2 − ⌈ γ h s ⌉ 2 γ h s ) ≤ 2 poly γ ( n ) , \mathbb{E}[T_{A_\gamma}(n)^\gamma]\le\operatorname{poly}_\gamma(n)(1+2^{-\lceil\gamma h_s\rceil}2^{\gamma h_s})\le2\operatorname{poly}_\gamma(n), E [ T A γ ( n ) γ ] ≤ poly γ ( n ) ( 1 + 2 − ⌈ γ h s ⌉ 2 γ h s ) ≤ 2 poly γ ( n ) ,
A γ A_\gamma A γ uses polynomial space, its worst-case time is poly ( n ) 2 h s = 2 o ( n ) \operatorname{poly}(n)2^{h_s}=2^{o(n)} poly ( n ) 2 h s = 2 o ( n ) , and at each public-head stage
1 2 T s − γ ≤ P A γ ( W ∣ n s ) ≤ T s − γ . \frac{1}{2}T_s^{-\gamma}\le P_{A_\gamma}(W\mid n_s)\le T_s^{-\gamma}. 2 1 T s − γ ≤ P A γ ( W ∣ n s ) ≤ T s − γ .
Let Q i ∈ S a O Q_i\in S_a^O Q i ∈ S a O with a > γ a>\gamma a > γ and E [ T Q i ( n ) a ] ≤ C ( n + 2 ) e \mathbb{E}[T_{Q_i}(n)^a]\le C(n+2)^e E [ T Q i ( n ) a ] ≤ C ( n + 2 ) e . For every public-head stage s ≥ i s\ge i s ≥ i , Theorem 5.6, freezing and Markov’s inequality give
P Q i ( W ∣ n s ) ≤ 2 − 3 n s / 4 + C ( n s + 2 ) e S s − a . (7) P_{Q_i}(W\mid n_s)\le2^{-3n_s/4}+C(n_s+2)^eS_s^{-a}. \tag*{(7)} P Q i ( W ∣ n s ) ≤ 2 − 3 n s /4 + C ( n s + 2 ) e S s − a . (7)
Dividing by the source probability bounds P Q i ( W ∣ n s ) / P A γ ( W ∣ n s ) P_{Q_i}(W \mid n_s)/P_{A_\gamma}(W \mid n_s) P Q i ( W ∣ n s ) / P A γ ( W ∣ n s ) by
2 ⋅ 2 − 3 n s / 4 + γ h s + 2 a + 1 C ( n s + 2 ) e 2 − ( a − γ ) h s , 2 \cdot2^{-3n_s/4+\gamma h_s} + 2^{a+1}C(n_s+2)^e 2^{-(a-\gamma)h_s}, 2 ⋅ 2 − 3 n s /4 + γ h s + 2 a + 1 C ( n s + 2 ) e 2 − ( a − γ ) h s ,
which tends to zero because h s / n s → 0 h_s/n_s \to0 h s / n s → 0 , h s / log n s → ∞ h_s/\log n_s \to\infty h s / log n s → ∞ and a > γ a > \gamma a > γ .
The power profile
Theorem 6.6 (Optimality of the power tradeoff). For all real a , r > 0 a,r>0 a , r > 0 and every β \beta β with 1 ≤ β < B ( a , r ) 1 \le\beta< B(a,r) 1 ≤ β < B ( a , r ) , no sampler in S a O S_a^O S a O dominates every member of S r O ∩ W O S_r^O \cap WO S r O ∩ W O with power β \beta β . The witnessing sources can be taken with worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) .
Proof. Since B ( a , r ) > 1 B(a,r)>1 B ( a , r ) > 1 , either r ≥ 1 r \ge1 r ≥ 1 and a > 1 a>1 a > 1 , or r < 1 r<1 r < 1 and a > r a>r a > r . Fix Q i ∈ S a O Q_i \in S_a^O Q i ∈ S a O with E [ T Q i ( n ) a ] ≤ C ( n + 2 ) e \mathbb{E}[T_{Q_i}(n)^a] \le C(n+2)^e E [ T Q i ( n ) a ] ≤ C ( n + 2 ) e .
Case r ≥ 1 r \ge1 r ≥ 1 . Since β < 1 + ( a − 1 ) / r \beta< 1+(a-1)/r β < 1 + ( a − 1 ) / r , we have a − 1 − r ( β − 1 ) > 0 a-1-r(\beta-1)>0 a − 1 − r ( β − 1 ) > 0 , so we can choose rationals 1 < ρ < a 1<\rho<a 1 < ρ < a , R > r R>r R > r and b > β b>\beta b > β with η = ρ − 1 − R ( b − 1 ) > 0 \eta=\rho-1-R(b-1)>0 η = ρ − 1 − R ( b − 1 ) > 0 , and then θ \theta θ as required; let e e e code this valid tuple. At a bad power stage assigned to ( i , e ) (i,e) ( i , e ) , the monitor’s clock satisfies τ ≤ T Q i \tau\le T_{Q_i} τ ≤ T Q i , so E [ T Q i a ] ≥ E [ min { τ , S s } ρ ] > n s d s \mathbb{E}[T_{Q_i}^a] \ge\mathbb{E}[\min\{\tau,S_s\}^{\rho}] > n_s^{d_s} E [ T Q i a ] ≥ E [ min { τ , S s } ρ ] > n s d s , and only finitely many such stages are bad. Let A i , e A_{i,e} A i , e output 0 n 0^n 0 n except at power stage lengths assigned to ( i , e ) (i,e) ( i , e ) , where it picks a uniform seed among N s N_s N s seeds and, if the gate is positive, follows the chain for at most T s T_s T s links and outputs the terminal. At good assigned stages P A ( W ∣ n s ) = 1 / N s P_A(W \mid n_s)=1/N_s P A ( W ∣ n s ) = 1/ N s and E [ T A ( n s ) r ] ≤ poly ( n s ) ( 1 + T s r − R ) ≤ 2 poly ( n s ) \mathbb{E}[T_A(n_s)^r] \le\operatorname{poly}(n_s)(1+T_s^{r-R}) \le2\operatorname{poly}(n_s) E [ T A ( n s ) r ] ≤ poly ( n s ) ( 1 + T s r − R ) ≤ 2 poly ( n s ) because R > r R>r R > r ; bad stages change only constants. So A i , e ∈ S r O ∩ W O A_{i,e}\in S_r^O \cap WO A i , e ∈ S r O ∩ W O , and its worst-case time is poly ( n ) 2 h \operatorname{poly}(n)2^h poly ( n ) 2 h with h ≤ n / ( C ∗ ( s + 2 ) ) = o ( n ) h\le n/(C_*(s+2))=o(n) h ≤ n / ( C ∗ ( s + 2 )) = o ( n ) . At late good assigned stages, the first alternative of Theorem 5.5 for the monitor, Theorem 5.8 and Markov’s inequality give
P Q i ( W ∣ n s ) < 1 N s b n s d s + C ( n s + 2 ) e S s a ≤ 2 N s b n s d s . P_{Q_i}(W \mid n_s) < \frac{1}{N_s^b n_s^{d_s}}+\frac{C(n_s+2)^e}{S_s^a}\le\frac{2}{N_s^b n_s^{d_s}}. P Q i ( W ∣ n s ) < N s b n s d s 1 + S s a C ( n s + 2 ) e ≤ N s b n s d s 2 .
since S s a = T s θ n s 2 a d s S_s^a=T_s^\theta n_s^{2ad_s} S s a = T s θ n s 2 a d s and θ a > θ ρ > R b \theta_a>\theta_\rho>Rb θ a > θ ρ > R b . Relative to P A ( W ∣ n s ) β = N s − β P_A(W \mid n_s)^\beta=N_s^{-\beta} P A ( W ∣ n s ) β = N s − β the ratio is at most 2 n s − d s N s − ( b − β ) 2n_s^{-d_s}N_s^{-(b-\beta)} 2 n s − d s N s − ( b − β ) , which is smaller than every inverse polynomial.
Case r < 1 r<1 r < 1 . Since β < a / r \beta<a/r β < a / r , choose a rational γ \gamma γ with r < γ < min { 1 , a / β } r<\gamma<\min\{1,a/\beta\} r < γ < min { 1 , a / β } . Then A γ ∈ S γ O ∩ W O ⊆ S r O ∩ W O A_\gamma\in S_\gamma^O\cap WO\subseteq S_r^O\cap WO A γ ∈ S γ O ∩ W O ⊆ S r O ∩ W O , and by (7) and P A γ ( W ∣ n s ) β ≥ 2 − β T s β P_{A_\gamma}(W \mid n_s)^\beta\ge2^{-\beta}T_s^\beta P A γ ( W ∣ n s ) β ≥ 2 − β T s β ,
P Q i ( W ∣ n s ) P A γ ( W ∣ n s ) β ≤ 2 β 2 − 3 n s / 4 + γ β h s + 2 a + β C ( n s + 2 ) e 2 − ( a − γ β ) h s → 0 , \frac{P_{Q_i}(W \mid n_s)}{P_{A_\gamma}(W \mid n_s)^\beta}\le2^\beta2^{-3n_s/4+\gamma\beta h_s}+2^{a+\beta}C(n_s+2)^e2^{-(a-\gamma\beta)h_s}\to0, P A γ ( W ∣ n s ) β P Q i ( W ∣ n s ) ≤ 2 β 2 − 3 n s /4 + γ β h s + 2 a + β C ( n s + 2 ) e 2 − ( a − γ β ) h s → 0 ,
because h s / n s → 0 h_s/n_s\to0 h s / n s → 0 , h s / log n s → ∞ h_s/\log n_s\to\infty h s / log n s → ∞ and a > γ β a>\gamma\beta a > γ β .
Corollary 6.7 (The exact power profile). For a , r > 0 a,r>0 a , r > 0 let B ∗ O ( a , r ) B_*^O(a,r) B ∗ O ( a , r ) be the infimum of the β ≥ 1 \beta\ge1 β ≥ 1 for which some sampler in S a O S_a^O S a O dominates every member of S r O S_r^O S r O with power β \beta β . Then B ∗ O ( a , r ) = B ( a , r ) B_*^O(a,r)=B(a,r) B ∗ O ( a , r ) = B ( a , r ) for all real a , r > 0 a,r>0 a , r > 0 , also when the sources are restricted to S r O ∩ W O S_r^O\cap WO S r O ∩ W O . For rational a a a the infimum is attained by Q a Q_a Q a .
Proof. The lower bound is Theorem 6.6 . For the upper bound, Theorem 3.3 applies for rational a a a , and for real a a a take rationals a ′ ↓ a a' \downarrow a a ′ ↓ a : then Q a ′ ∈ S a ′ O ⊆ S a O Q_{a'}\in S_{a'}^O\subseteq S_a^O Q a ′ ∈ S a ′ O ⊆ S a O and B ( a ′ , r ) → B ( a , r ) B(a',r)\to B(a,r) B ( a ′ , r ) → B ( a , r ) .
At β = 1 \beta=1 β = 1 Theorem 6.6 recovers U O ( r ) ≤ min { r , 1 } U^O(r)\le\min\{r,1\} U O ( r ) ≤ min { r , 1 } ; Theorem 6.1 is stronger above one in that its competitors have all moments polynomial. So power one fails against all-moments sources for every candidate of order above one, while by Theorem 3.5 every power above one is achievable against them.
The profile
Theorem 6.8. For every real r > 0 r > 0 r > 0 , U O ( r ) = min { r , 1 } U^{O}(r) = \min\{r,1\} U O ( r ) = min { r , 1 } . The same holds when the sources are restricted to S r O ∩ W O S^{O}_{r} \cap W^{O} S r O ∩ W O . The supremum is attained for every r ≥ 1 r \ge1 r ≥ 1 , every rational r ∈ ( 0 , 1 ) r \in(0,1) r ∈ ( 0 , 1 ) , and every r ∈ ( 0 , 1 ) r \in(0,1) r ∈ ( 0 , 1 ) satisfying the hypothesis of Theorem A.1 . Section A.2 shows that the set of r ∈ ( 0 , 1 ) r \in(0,1) r ∈ ( 0 , 1 ) at which it is attained is countable, consists of reals computable from 0 ′ ′ 0^{\prime\prime} 0 ′′ , and misses some computable orders.
Proof. For r ≥ 1 r \ge1 r ≥ 1 , S r O ⊆ S 1 O S^{O}_{r} \subseteq S^{O}_{1} S r O ⊆ S 1 O , so Q 1 Q_{1} Q 1 of Theorem 3.4 attains order one, and Theorem 6.1 excludes every a > 1 a > 1 a > 1 already for sources in S a l l O ∩ W O S^{O}_{\mathrm{all}} \cap W^{O} S all O ∩ W O .
Let 0 < r < 1 0 < r < 1 0 < r < 1 . For every rational γ ∈ ( 0 , r ) \gamma\in(0,r) γ ∈ ( 0 , r ) the sampler Q γ ∈ S γ O Q_{\gamma} \in S^{O}_{\gamma} Q γ ∈ S γ O dominates S γ O ⊇ S r O S^{O}_{\gamma} \supseteq S^{O}_{r} S γ O ⊇ S r O ; letting γ ↑ r \gamma\uparrow r γ ↑ r gives U O ( r ) ≥ r U^{O}(r) \ge r U O ( r ) ≥ r . For a > r a > r a > r choose a rational γ \gamma γ with r < γ < min { a , 1 } r < \gamma< \min\{a,1\} r < γ < min { a , 1 } ; then A γ ∈ S γ O ∩ W O ⊆ S r O ∩ W O A_{\gamma} \in S^{O}_{\gamma} \cap W^{O} \subseteq S^{O}_{r} \cap W^{O} A γ ∈ S γ O ∩ W O ⊆ S r O ∩ W O , and by Theorem 6.5 no sampler in S a O S^{O}_{a} S a O dominates it. So U O ( r ) ≤ r U^{O}(r) \le r U O ( r ) ≤ r , for irrational and noncomputable r r r as well. Attainment follows from Theorems A.1 and 3.4 .
Corollary 6.9. For every source class C C C with S a l l O ∩ W O ⊆ C ⊆ S 1 O S^{O}_{\mathrm{all}} \cap W^{O} \subseteq C \subseteq S^{O}_{1} S all O ∩ W O ⊆ C ⊆ S 1 O , some sampler in S 1 O S^{O}_{1} S 1 O is universal for C C C , and no sampler in S a O S^{O}_{a} S a O with a > 1 a > 1 a > 1 is.
The exact frontier for solvers
Theorem 4.6 transfers the v v v th moment of any cost under q a q_{a} q a to its ( v / B ) (v/B) ( v / B ) th moment under every source in S r S_{r} S r , with B = B ( a , r ) B = B(a,r) B = B ( a , r ) , and the ratio 1 / B 1/B 1/ B is optimal for arbitrary costs. For running times of deterministic algorithms, Theorem 4.8 does better when a < min { r , 1 } a < \min\{r,1\} a < min { r , 1 } . Put
e ( a , r ) = { r r + a − 1 = 1 B ( a , r ) if r ≥ 1 and a ≥ 1 , min { r , 1 } a otherwise. e(a,r) =
\begin{cases}
\dfrac{r}{r+a-1} = \dfrac{1}{B(a,r)} & \text{if } r \ge1 \text{ and } a \ge1,\\
\dfrac{\min\{r,1\}}{a} & \text{otherwise.}
\end{cases} e ( a , r ) = ⎩ ⎨ ⎧ r + a − 1 r = B ( a , r ) 1 a min { r , 1 } if r ≥ 1 and a ≥ 1 , otherwise.
So e ( a , r ) = 1 / B ( a , r ) e(a,r) = 1/B(a,r) e ( a , r ) = 1/ B ( a , r ) whenever a ≥ min { r , 1 } a \ge\min\{r,1\} a ≥ min { r , 1 } , and e ( a , r ) = min { r , 1 } / a > 1 = 1 / B ( a , r ) e(a,r) = \min\{r,1\}/a > 1 = 1/B(a,r) e ( a , r ) = min { r , 1 } / a > 1 = 1/ B ( a , r ) when a < min { r , 1 } a < \min\{r,1\} a < min { r , 1 } . For rational a a a and every oracle, Theorems 4.6 and 4.8 show that a deterministic algorithm with polynomial v v v th moment under Q a ′ Q'_{a} Q a ′ has polynomial moment of order v e ( a , r ) v e(a,r) v e ( a , r ) under every source in S r S_{r} S r , provided v > a v > a v > a when a < min { r , 1 } a < \min\{r,1\} a < min { r , 1 } . The power and reveal stages realize this exponent for the running times of all correct solvers of one decision problem (Theorem 6.10 ). It is the exact guaranteed exponent except when v ≤ a < min { r , 1 } v \le a < \min\{r,1\} v ≤ a < min { r , 1 } , where no gain over v v v is possible (Theorem 6.11 ).
Theorem 6.10 (The exact frontier for solvers). Let a , r , v > 0 a,r,v > 0 a , r , v > 0 be rationals and e = e ( a , r ) e = e(a,r) e = e ( a , r ) . For every Q ∈ S a O Q \in S^{O}_{a} Q ∈ S a O there are A ∈ S r O ∩ W O A \in S^{O}_{r} \cap W^{O} A ∈ S r O ∩ W O with worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) , a language L ∈ U P O ∩ c o U P O L \in\mathrm{UP}^{O} \cap\mathrm{coUP}^{O} L ∈ UP O ∩ coUP O with at most one member of each length, and a deterministic oracle machine D D D deciding L L L , such that
E x ∼ P Q ( ⋅ ∣ n ) [ T D ( x ) v ] ≤ poly ( n ) \mathop{\mathrm{E}}_{x \sim P_{Q}(\cdot\mid n)}[T_{D}(x)^{v}] \le\operatorname{poly}(n) E x ∼ P Q ( ⋅ ∣ n ) [ T D ( x ) v ] ≤ poly ( n ) and E x ∼ P A ( ⋅ ∣ n ) [ T D ( x ) v e ] ≤ poly ( n ) \mathop{\mathrm{E}}_{x \sim P_{A}(\cdot\mid n)}[T_{D}(x)^{ve}] \le\operatorname{poly}(n) E x ∼ P A ( ⋅ ∣ n ) [ T D ( x ) v e ] ≤ poly ( n ) ;
for every real w > v e w > ve w > v e and every randomized oracle machine M M M that decides L L L with error at most 1 / 3 1/3 1/3 on every input, E x ∼ P A ( ⋅ ∣ n ) [ T M ( x ) w ] \mathop{\mathrm{E}}_{x \sim P_{A}(\cdot\mid n)}[T_{M}(x)^{w}] E x ∼ P A ( ⋅ ∣ n ) [ T M ( x ) w ] , over x x x and the coins of M M M , is not bounded by any polynomial in n n n .
If r ≥ 1 r \ge1 r ≥ 1 and a ≤ 1 a \le1 a ≤ 1 , the source runs in polynomial time on every path. For real a , r , v > 0 a,r,v > 0 a , r , v > 0 and every real w > v e ( a , r ) w > ve(a,r) w > v e ( a , r ) the same holds with A A A , L L L and D D D allowed to depend on w w w .
For example, against every candidate with polynomial second moment, some sparse language is decided in expected polynomial time under the candidate, while under one expected-polynomial-time source its best solvable moment is exactly 1 / 2 1/2 1/2 . Against a candidate with polynomial halfmoment, some language is decided with polynomial second moment under the candidate and polynomial fourth moment under one strict polynomial-time source, and every correct solver has a superpolynomial moment of every order above four there. Theorem 6.2 is the all-moments case of the first kind, where B B B tends to one.
Proof. Let Q = Q i Q = Q_i Q = Q i with E [ T Q ( n ) a ] ≤ C ( n + 2 ) c \mathbb{E}[T_Q(n)^a] \le C(n+2)^c E [ T Q ( n ) a ] ≤ C ( n + 2 ) c . In each case below, A A A outputs 0 n 0^n 0 n except at the power stage lengths of one family F \mathcal{F} F of requirements, all with candidate i i i and differing only in the solver index j j j . At such a length it picks a uniform seed, outputs 0 n 0^n 0 n if the gate is negative, and otherwise obtains the terminal, by following the chain for at most T s T_s T s links or by reading the reveal table, with 0 n 0^n 0 n on malformed answers or timeout. L L L consists of the terminals W s W_s W s of the stages of F \mathcal{F} F whose witness has b ∗ , s = 1 b_{*,s}=1 b ∗ , s = 1 , and D D D is the decider of the proof of Theorem 6.2 for these stages, so T D ( x ) ≤ p ( n ) ( 1 + H s 1 [ x = W s ] ) T_D(x) \le p(n)(1+H_s\mathbf{1}[x=W_s]) T D ( x ) ≤ p ( n ) ( 1 + H s 1 [ x = W s ]) for a fixed polynomial p p p ; L ∈ U P O ∩ c o U P O L \in\mathrm{UPO} \cap\mathrm{coUPO} L ∈ UPO ∩ coUPO as there. Hence
E P Q [ T D v ] ≤ 2 v p ( n s ) v ( 1 + P Q ( W s ∣ n s ) H s v ) , E P A [ T D v ϵ ] ≤ 2 v ϵ p ( n s ) v ϵ ( 1 + P A ( W s ∣ n s ) H s v ϵ ) . \mathbb{E}_{P_Q}[T_D^v] \le2^v p(n_s)^v(1+P_Q(W_s\mid n_s)H_s^v), \qquad\mathbb{E}_{P_A}[T_D^{v\epsilon}] \le2^{v\epsilon}p(n_s)^{v\epsilon}(1+P_A(W_s\mid n_s)H_s^{v\epsilon}). E P Q [ T D v ] ≤ 2 v p ( n s ) v ( 1 + P Q ( W s ∣ n s ) H s v ) , E P A [ T D v ϵ ] ≤ 2 v ϵ p ( n s ) v ϵ ( 1 + P A ( W s ∣ n s ) H s v ϵ ) .
For a correct M = M j M=M_j M = M j , at the stages of F \mathcal{F} F with solver index j j j , Theorem 5.9 and freezing through H s H_s H s give
E P A [ T M w ] ≥ P A ( W s ∣ n s ) 16 w − 1 H s w . (8) \mathbb{E}_{P_A}[T_M^w] \ge P_A(W_s\mid n_s)16^{w-1}H_s^w. \tag*{(8)} E P A [ T M w ] ≥ P A ( W s ∣ n s ) 1 6 w − 1 H s w . (8)
A A A stores a seed, a constant number of labels and a counter, so A ∈ W O A \in\mathcal{W}^O A ∈ W O , and its worst-case time is poly ( n ) 2 h s = 2 o ( n ) \operatorname{poly}(n)2^{h_s}=2^{o(n)} poly ( n ) 2 h s = 2 o ( n ) .
Case r ≥ 1 r\ge1 r ≥ 1 and a > 1 a>1 a > 1 . Here e = 1 / B e=1/B e = 1/ B . Let F \mathcal{F} F consist of the drifting requirements ( i , a , r , v , j ) (i,a,r,v,j) ( i , a , r , v , j ) , j ≥ 0 j\ge0 j ≥ 0 . At a bad stage of F \mathcal{F} F , C ( n s + 2 ) c ≥ E [ min { τ , S s } ρ s ] > n s d s C(n_s+2)^c \ge\mathbb{E}[\min\{\tau,S_s\}^{\rho_s}] > n_s^{d_s} C ( n s + 2 ) c ≥ E [ min { τ , S s } ρ s ] > n s d s because τ ≤ T Q \tau\le T_Q τ ≤ T Q and ρ s < a \rho_s<a ρ s < a , so only finitely many stages are bad, although ρ s \rho_s ρ s tends to a a a . At a good stage, Theorem 5.8 and Markov’s inequality give, as in the proof of Theorem 6.6 ,
P Q ( W s ∣ n s ) ≤ 1 N s b s n s d s + C ( n s + 2 ) c S s a ≤ 2 N s b s n s d s P_Q(W_s\mid n_s)\le\frac{1}{N_s^{b_s}n_s^{d_s}}+\frac{C(n_s+2)^c}{S_s^a}\le\frac{2}{N_s^{b_s}n_s^{d_s}} P Q ( W s ∣ n s ) ≤ N s b s n s d s 1 + S s a C ( n s + 2 ) c ≤ N s b s n s d s 2
for large s s s , since θ s a > θ s ρ s > R s b s \theta_s^a>\theta_s^{\rho_s}>R_sb_s θ s a > θ s ρ s > R s b s . Also P A ( W s ∣ n s ) = 1 / N s P_A(W_s\mid n_s)=1/N_s P A ( W s ∣ n s ) = 1/ N s and E [ T A ( n s ) r ] ≤ poly ( n s ) ( 1 + T s r − R s ) ≤ 2 poly ( n s ) \mathbb{E}[T_A(n_s)^r]\le\operatorname{poly}(n_s)(1+T_s^{r-R_s})\le2\operatorname{poly}(n_s) E [ T A ( n s ) r ] ≤ poly ( n s ) ( 1 + T s r − R s ) ≤ 2 poly ( n s ) because R s > r R_s>r R s > r , so A ∈ S r O A\in\mathcal{S}_r^O A ∈ S r O . For large s s s , ℓ s = ⌊ ( b s / v ) log N s ⌋ \ell_s=\lfloor(b_s/v)\log N_s\rfloor ℓ s = ⌊( b s / v ) log N s ⌋ , so N s b s / v / 2 ≤ H s ≤ N s b s / v N_s^{b_s/v}/2\le H_s\le N_s^{b_s/v} N s b s / v /2 ≤ H s ≤ N s b s / v . Then P Q ( W s ) H s v ≤ 2 P_Q(W_s)H_s^v\le2 P Q ( W s ) H s v ≤ 2 and P A ( W s ) H s v / B ≤ N s b s / B − 1 ≤ 1 P_A(W_s)H_s^{v/B}\le N_s^{b_s/B-1}\le1 P A ( W s ) H s v / B ≤ N s b s / B − 1 ≤ 1 , which gives part 1. By Eq. (∗),
E P A [ T M w ] ≥ c w N s b s w / v − 1 \mathbb{E}_{P_A}[T_M^w]\ge c_wN_s^{b_sw/v-1} E P A [ T M w ] ≥ c w N s b s w / v − 1 .
Since b s → B b_s\to B b s → B and B w / v > 1 Bw/v>1 B w / v > 1 , the exponent is eventually at least a positive constant, and log N s ≥ h s \log N_s\ge h_s log N s ≥ h s is linear in n s / s n_s/s n s / s , so this exceeds every polynomial along the stages with solver index j j j .
Case r ≥ 1 r\ge1 r ≥ 1 and a ≤ 1 a\le1 a ≤ 1 . Here e = 1 / a e=1/a e = 1/ a . Let F \mathcal{F} F consist of the reveal requirements ( i , a , v , j ) (i,a,v,j) ( i , a , v , j ) , j ≥ 0 j\ge0 j ≥ 0 . The source chooses a uniform seed, queries the flag, and on success reads the n n n reveal bits; it runs in polynomial time on every path, so A ∈ S r O A\in\mathcal{S}_r^O A ∈ S r O for every r r r , and P A ( W s ∣ n s ) = 1 / N s P_A(W_s\mid n_s)=1/N_s P A ( W s ∣ n s ) = 1/ N s . At a stage of the second kind in Theorem 5.10, E [ T Q ] ≥ E [ τ s ] > n s d s \mathbb{E}[T_Q]\ge\mathbb{E}[\tau_s]>n_s^{d_s} E [ T Q ] ≥ E [ τ s ] > n s d s , since τ ≤ T Q \tau\le T_Q τ ≤ T Q , τ ≥ 1 \tau\ge1 τ ≥ 1 and ρ s < a \rho_s<a ρ s < a ; so only finitely many stages are of this kind. At the others, Markov’s inequality at S s = N s K s S_s=N_s^{K_s} S s = N s K s gives
P Q ( W s ∣ n s ) ≤ N s − b s n s − d s + C ( n s + 2 ) c N s − K s a ≤ 2 N s − b s n s − d s P_Q(W_s\mid n_s)\le N_s^{-b_s}n_s^{-d_s}+C(n_s+2)^cN_s^{-K_sa}\le2N_s^{-b_s}n_s^{-d_s} P Q ( W s ∣ n s ) ≤ N s − b s n s − d s + C ( n s + 2 ) c N s − K s a ≤ 2 N s − b s n s − d s
for large s s s , since N s K s a − b s ≥ n s 3 d s N_s^{K_sa-b_s}\ge n_s^{3d_s} N s K s a − b s ≥ n s 3 d s . For large s s s , N s b s / v / 2 ≤ H s ≤ N s b s / v N_s^{b_s/v}/2\le H_s\le N_s^{b_s/v} N s b s / v /2 ≤ H s ≤ N s b s / v , so P Q ( W s ) H s v ≤ 2 P_Q(W_s)H_s^v\le2 P Q ( W s ) H s v ≤ 2 and P A ( W s ) H s v / a ≤ N s b s / a − 1 ≤ 1 P_A(W_s)H_s^{v/a}\le N_s^{b_s/a-1}\le1 P A ( W s ) H s v / a ≤ N s b s / a − 1 ≤ 1 . By Eq. (∗), E P A [ T M w ] ≥ c w N s b s w / v − 1 \mathbb{E}_{P_A}[T_M^w]\ge c_wN_s^{b_sw/v-1} E P A [ T M w ] ≥ c w N s b s w / v − 1 , which is superpolynomial for w > v / a w>v/a w > v / a since b s → a b_s\to a b s → a .
Case r < 1 r<1 r < 1 . Here e = r / a e=r/a e = r / a . Let F \mathcal{F} F consist of the thin requirements ( i , r , a / v , j ) (i,r,a/v,j) ( i , r , a / v , j ) , j ≥ 0 j\ge0 j ≥ 0 . The source passes the gate with probability 2 − r h s ∈ [ T s − r / 2 , T s − r ] 2^{-r h_s}\in[T_s^{-r}/2,T_s^{-r}] 2 − r h s ∈ [ T s − r /2 , T s − r ] , so E [ T A ( n s ) r ] ≤ poly ( n s ) \mathbb{E}[T_A(n_s)^r]\le\operatorname{poly}(n_s) E [ T A ( n s ) r ] ≤ poly ( n s ) and A ∈ S r o A \in S_r^{o} A ∈ S r o . The block selection, Theorem 5.8 and Markov’s inequality give P Q ( W s ∣ n s ) ≤ 2 − n s / 2 + C ( n s + 2 ) c ( T s / 2 ) − a P_Q(W_s \mid n_s) \le2^{-n_s/2} + C(n_s + 2)^c(T_s/2)^{-a} P Q ( W s ∣ n s ) ≤ 2 − n s /2 + C ( n s + 2 ) c ( T s /2 ) − a . For large s s s , T s a / v / 2 ≤ H s ≤ T s a / v T_s^{a/v}/2 \le H_s \le T_s^{a/v} T s a / v /2 ≤ H s ≤ T s a / v . So P Q ( W s ) H s v ≤ 2 − n s / 2 T s a + 2 a C ( n s + 2 ) c P_Q(W_s)H_s^v \le2^{-n_s/2}T_s^a + 2^aC(n_s + 2)^c P Q ( W s ) H s v ≤ 2 − n s /2 T s a + 2 a C ( n s + 2 ) c is polynomial, as a h s ≤ n s / 4 ah_s \le n_s/4 a h s ≤ n s /4 for large s s s , and P A ( W s ) H s v r / a ≤ T s − r T s r = 1 P_A(W_s)H_s^{vr/a} \le T_s^{-r}T_s^r = 1 P A ( W s ) H s v r / a ≤ T s − r T s r = 1 . By ( ∗ ) (*) ( ∗ ) , E P A [ T M w ] ≥ c w T s a w / v − r \mathbb{E}_{P_A}[T_M^w] \ge c_wT_s^{aw/v-r} E P A [ T M w ] ≥ c w T s a w / v − r , which is superpolynomial because w > v r / a w > vr/a w > v r / a and h s / log n s → ∞ h_s/\log n_s \to\infty h s / log n s → ∞ .
Real parameters. If r ≥ 1 r \ge1 r ≥ 1 and a > 1 a > 1 a > 1 , then w > v / B ( a , r ) w > v/B(a,r) w > v / B ( a , r ) ; choose rationals 1 < ρ < a 1 < \rho< a 1 < ρ < a , R > r R > r R > r and b > max { 1 , v / w } b > \max\{1,v/w\} b > max { 1 , v / w } with ρ − 1 − R ( b − 1 ) > 0 \rho- 1 - R(b - 1) > 0 ρ − 1 − R ( b − 1 ) > 0 , a valid θ \theta θ , and a rational λ \lambda λ with 1 / w < λ < b / v 1/w < \lambda< b/v 1/ w < λ < b / v , and let F \mathcal{F} F consist of the fixed requirements with candidate i i i , this tuple and this λ \lambda λ . The argument of the first case gives P Q ( W ) H v ≤ 2 N λ v − b ≤ 2 P_Q(W)H^v \le2N^{\lambda v-b} \le2 P Q ( W ) H v ≤ 2 N λ v − b ≤ 2 , P A ( W ) H v / B ≤ N λ v / B − 1 ≤ 1 P_A(W)H^{v/B} \le N^{\lambda v/B-1} \le1 P A ( W ) H v / B ≤ N λ v / B − 1 ≤ 1 as λ v < b < B \lambda v < b < B λ v < b < B , and E P A [ T M w ] ≥ c w N λ w − 1 \mathbb{E}_{P_A}[T_M^w] \ge c_wN^{\lambda w-1} E P A [ T M w ] ≥ c w N λ w − 1 , superpolynomial as λ w > 1 \lambda w > 1 λ w > 1 . If r ≥ 1 r \ge1 r ≥ 1 and a ≤ 1 a \le1 a ≤ 1 , choose rationals a ′ < a a' < a a ′ < a and v ′ ≥ v v' \ge v v ′ ≥ v with v ′ / a ′ < w v'/a' < w v ′ / a ′ < w ; then Q ∈ S a ′ o Q \in S_{a'}^{o} Q ∈ S a ′ o , the second case with ( a ′ , v ′ ) (a',v') ( a ′ , v ′ ) applies, and a polynomial v ′ v' v ′ th moment under Q Q Q gives a polynomial v v v th moment. If r < 1 r < 1 r < 1 , choose rationals γ ∈ ( r , min { 1 , a w / v } ) \gamma\in(r,\min\{1,aw/v\}) γ ∈ ( r , min { 1 , a w / v }) and λ ∈ ( γ / w , a / v ) \lambda\in(\gamma/w,a/v) λ ∈ ( γ / w , a / v ) and use the thin requirements ( i , γ , λ , j ) (i,\gamma,\lambda,j) ( i , γ , λ , j ) ; then A ∈ S γ o ⊆ S r o A \in S_\gamma^{o} \subseteq S_r^{o} A ∈ S γ o ⊆ S r o , P Q ( W ) H v P_Q(W)H^v P Q ( W ) H v is polynomial as λ v < a \lambda v < a λ v < a , P A ( W ) H v r / a ≤ T λ v r / a − γ ≤ 1 P_A(W)H^{vr/a} \le T^{\lambda vr/a-\gamma} \le1 P A ( W ) H v r / a ≤ T λ v r / a − γ ≤ 1 as λ v < a \lambda v < a λ v < a and r < γ r < \gamma r < γ , and E P A [ T M w ] ≥ c w T λ w − γ \mathbb{E}_{P_A}[T_M^w] \ge c_wT^{\lambda w-\gamma} E P A [ T M w ] ≥ c w T λ w − γ , superpolynomial as λ w > γ \lambda w > \gamma λ w > γ .
The strict inequality v > a v > a v > a in Theorem 4.8 is necessary, and the gap at v = a v = a v = a is real.
Theorem 6.11 (No gain at or below the critical moment). For every rational 0 < v ≤ 1 0 < v \le1 0 < v ≤ 1 there is an oracle X X X , a language L ∈ U P X ∩ c o U P X L \in\mathrm{UP}^{X} \cap\mathrm{coUP}^{X} L ∈ UP X ∩ coUP X with at most one member of each length, and a deterministic oracle machine D D D deciding L L L such that, with A A A the uniform sampler,
E x ∼ P Q ( ⋅ ∣ n ) [ T D ( x ) v ] ≤ poly Q ( n ) \mathbb{E}_{x\sim P_Q(\cdot\mid n)}[T_D(x)^v] \le\operatorname{poly}_Q(n) E x ∼ P Q ( ⋅ ∣ n ) [ T D ( x ) v ] ≤ poly Q ( n ) for every real a ≥ v a \ge v a ≥ v and every Q ∈ S a X Q \in S_a^X Q ∈ S a X , and E x ∼ A [ T D ( x ) v ] ≤ poly ( n ) \mathbb{E}_{x\sim A}[T_D(x)^v] \le\operatorname{poly}(n) E x ∼ A [ T D ( x ) v ] ≤ poly ( n ) ;
for every randomized oracle machine M M M that decides L L L with error at most 1 / 3 1/3 1/3 on every input and every real w > v w > v w > v , E x ∼ A [ T M ( x ) w ] ≥ 2 Ω M , w ( n ) \mathbb{E}_{x\sim A}[T_M(x)^w] \ge2^{\Omega_{M,w}(n)} E x ∼ A [ T M ( x ) w ] ≥ 2 Ω M , w ( n ) at all large n n n .
The oracle comes from a probability-one argument, in Section H, and is not claimed to be computable. Each string x x x gets a random delay L x L_x L x with Pr [ L x ≥ 2 j ] = 2 − j v \Pr[L_x \ge2^j] = 2^{-jv} Pr [ L x ≥ 2 j ] = 2 − j v , capped at 2 ⌊ ε n ⌋ 2^{\lfloor\varepsilon n\rfloor} 2 ⌊ ε n ⌋ , which can be learned only through threshold queries that write the threshold in unary, so learning L x > u L_x > u L x > u costs u u u steps; the hidden member sits among the strings of maximal delay. A candidate of order a ≥ v a \ge v a ≥ v therefore outputs strings whose v v v th delay moment is at most a polynomial times E [ T Q v ] \mathbb{E}[T_Q^v] E [ T Q v ] , while a correct solver that is fast on most strings of maximal delay cannot tell where the member is. Since the uniform sampler lies in every S r S_r S r , combining Theorems 4.6, 4.8, 6.10 and 6.11 determines the exact exponent.
Corollary 6.12 (The exact transfer exponent for running times). For rationals a , r , v > 0 a,r,v > 0 a , r , v > 0 put s = min { r , 1 } s = \min\{r,1\} s = min { r , 1 } and
q ∗ ( a , r , v ) = { v / B ( a , r ) if a ≥ s , v s / a if a < s and v > a , v if a < s and v ≤ a . q^*(a,r,v) =
\begin{cases}
v/B(a,r) & \text{if } a \ge s,\\
vs/a & \text{if } a < s \text{ and } v > a,\\
v & \text{if } a < s \text{ and } v \le a.
\end{cases} q ∗ ( a , r , v ) = ⎩ ⎨ ⎧ v / B ( a , r ) v s / a v if a ≥ s , if a < s and v > a , if a < s and v ≤ a . For every oracle, a deterministic algorithm with polynomial v v v th moment under Q a ′ Q_a' Q a ′ has polynomial moment of order q ∗ q^* q ∗ under every member of S r S_r S r . Conversely, there is an oracle X X X , namely the oracle O O O of Section 6 in the first two cases and an oracle depending only on v v v in the third, such that for every Q ∈ S a X Q \in S_a^X Q ∈ S a X there are a sparse language in U P X ∩ c o U P X \mathrm{UP}^{X} \cap\mathrm{coUP}^{X} UP X ∩ coUP X , a deterministic decider for it with polynomial v v v th moment under Q Q Q , and a source in S r X S_r^X S r X under which, for every q > q ∗ q > q^* q > q ∗ , every correct bounded-error solver has superpolynomial moment of order q q q . In the third case one decider works for all candidates (Theorem 6.11). In the first two cases the decider depends on Q Q Q , and when 1 < a ≤ r 1 < a \le r 1 < a ≤ r it must: a single decider for all of S a X S_a^X S a X would have polynomial v v v th moment under the source, which lies in S r X ⊆ S a X S_r^X \subseteq S_a^X S r X ⊆ S a X , while q ∗ < v q^* < v q ∗ < v .
Proof. The upper bounds are Theorem 4.6 when a ≥ s a \ge s a ≥ s or v ≤ a v \le a v ≤ a , using Theorem 4.5 to pass from Q a ′ Q'_a Q a ′ to Q a Q_a Q a , and Theorem 4.8 when a < s a < s a < s and v > a v > a v > a . The lower bounds are Theorem 6.10 relative to O O O in the first two cases and Theorem 6.11 in the third, where v ≤ a < s ≤ 1 v \le a < s \le1 v ≤ a < s ≤ 1 .
Failure at all large lengths
The construction above refutes eventual domination, with failures at sparse stage lengths. At every other length its competitors output 0 n 0^n 0 n , so the deterministic zero sampler dominates them at infinitely many lengths. To refute infinitely-often domination a competitor has to win at every large length, and this needs a different construction.
Theorem 6.13 (Failure at all large lengths). There is a computable oracle O i o O_{\mathrm{io}} O io with the following properties. Say that Q Q Q loses to A A A with power β \beta β if for every ε > 0 \varepsilon> 0 ε > 0 and all but finitely many n n n some x ∈ { 0 , 1 } n x \in\{0,1\}^n x ∈ { 0 , 1 } n satisfies P Q ( x ∣ n ) < 2 − n 1 − ε P A ( x ∣ n ) β P_Q(x\mid n) < 2^{-n^{1-\varepsilon}}P_A(x\mid n)^\beta P Q ( x ∣ n ) < 2 − n 1 − ε P A ( x ∣ n ) β ; in particular Q Q Q does not dominate A A A with power β \beta β even infinitely often. Every source below lies in W O i o W^{O_{\mathrm{io}}} W O io and has worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) .
For every real a > 1 a > 1 a > 1 and every Q ∈ S a O i o Q \in S_a^{O_{\mathrm{io}}} Q ∈ S a O io , Q Q Q loses with power one to some A ∈ S a l l O i o A \in S_{\mathrm{all}}^{O_{\mathrm{io}}} A ∈ S all O io .
For every rational γ ∈ ( 0 , 1 ) \gamma\in(0,1) γ ∈ ( 0 , 1 ) there is one A γ ∈ S γ O i o A_\gamma\in S_\gamma^{O_{\mathrm{io}}} A γ ∈ S γ O io such that every Q ∈ S a O i o Q \in S_a^{O_{\mathrm{io}}} Q ∈ S a O io with a > γ a > \gamma a > γ loses to A γ A_\gamma A γ with every power β ∈ [ 1 , a / γ ) \beta\in[1,a/\gamma) β ∈ [ 1 , a / γ ) .
For all real a , r > 0 a,r > 0 a , r > 0 , every β \beta β with 1 ≤ β < B ( a , r ) 1 \le\beta< B(a,r) 1 ≤ β < B ( a , r ) and every Q ∈ S a O i o Q \in S_a^{O_{\mathrm{io}}} Q ∈ S a O io , Q Q Q loses with power β \beta β to some A ∈ S r O i o A \in S_r^{O_{\mathrm{io}}} A ∈ S r O io .
Consequently U O i o ( r ) = min { r , 1 } U^{O_{\mathrm{io}}}(r) = \min\{r,1\} U O io ( r ) = min { r , 1 } and B ∗ O i o ( a , r ) = B ( a , r ) B_*^{O_{\mathrm{io}}}(a,r) = B(a,r) B ∗ O io ( a , r ) = B ( a , r ) for all real a , r > 0 a,r > 0 a , r > 0 , with the supremum attained for r ≥ 1 r \ge1 r ≥ 1 and rational r r r , and with every failure holding at all large lengths. Likewise the Rényi frontier (3) is necessary relative to O i o O_{\mathrm{io}} O io in this strong sense: if it fails, then for every Q ∈ S a O i o Q \in S_a^{O_{\mathrm{io}}} Q ∈ S a O io some A ∈ S r O i o ∩ W O i o A \in S_r^{O_{\mathrm{io}}} \cap W^{O_{\mathrm{io}}} A ∈ S r O io ∩ W O io satisfies, for every ε > 0 \varepsilon> 0 ε > 0 , D α ( P A ∥ P Q ) > n 1 − ε D_\alpha(P_A\Vert P_Q) > n^{1-\varepsilon} D α ( P A ∥ P Q ) > n 1 − ε at all large $n.
We prove Theorem 6.13 in Section B. The construction places one block per stage, with three kinds of stages for the three parts. The block of a stage serves every input length up to the next stage of the same kind and parameters, so each competitor is active at every large length. Blocks are fixed one at a time against an all-zero future, and each new block takes its positive seeds and chain labels only from pools of seeds and labels that the runs of earlier stages query with small weight. The scale separation (7) between consecutive stages makes these pools almost everything, and stage lengths n s = 2 s 3 n_s = 2^{s^3} n s = 2 s 3 keep consecutive lengths polynomially related, which gives losses 2 n 1 − o ( 1 ) 2^{n^{1-o(1)}} 2 n 1 − o ( 1 ) . Every block drawn from the pools then changes each earlier requirement by at most a geometrically decreasing fraction of its margin, so the bad blocks given by a pooled form of Theorems 5.4 and 5.5 can be used without a union bound against earlier requirements. The public-head blocks behind Theorem 6.5 cannot be pooled, since their head is a fixed string; they are replaced by gated blocks with 2 ⌈ γ h ⌉ 2^{\lceil\gamma h\rceil} 2 ⌈ γ h ⌉ seeds, whose single positive seed is drawn from a pool (Theorem B.2).
Relative to O i o O_{\mathrm{io}} O io , as relative to every oracle, the sampler Q 1 Q_1 Q 1 of Theorem 1.1 lies in S 1 S_1 S 1 and dominates all of S 1 S_1 S 1 , so the optimal order is exactly one also for infinitely-often domination. Theorems 6.2 and 6.10 and the attainment results of Section A.2 at irrational orders are proved only relative to O O O : the first two use terminal tests and verification tables, the second the cost of the construction, and we have not redone either for O i o O_{\mathrm{io}} O io .
Removing the cost of restarts
The killed restart of Theorem 3.2 reaches a run that survives to time t t t , but it pays the factor t min { r , 1 } / μ t^{\min\{r,1\}}/\mu t m i n { r , 1 } / μ where a direct sample from the surviving runs would pay 1 / α 1/\alpha 1/ α : discarded trials cost linear time. For r ≤ 1 r \le1 r ≤ 1 this is enough. Above one it is the only loss in Theorem 3.3 , and § 6 shows that it cannot be avoided by relativizing methods. This section removes it in two ways: an oracle that hands out surviving runs, and a collapse that lets a sampler generate them.
Truncated conditional laws
Fix an oracle X X X , a machine description p p p , a length n n n and a power of two t ≥ 1 t \ge1 t ≥ 1 . Draw ω \omega ω uniformly from { 0 , 1 } 2 t \{0,1\}^{2t} { 0 , 1 } 2 t and run p X p^{X} p X on 1 n 1^{n} 1 n for at most 2 t 2t 2 t steps, supplying coins from ω \omega ω ; at most 2 t 2t 2 t coins are read. Let E E E be the event that the run does not halt before step t t t . If Pr [ E ] = 0 \Pr[E] = 0 Pr [ E ] = 0 , let D p , n , t X D^{X}_{p,n,t} D p , n , t X be the point mass on 0 n 0^{n} 0 n . Otherwise let D p , n , t X ( y ) D^{X}_{p,n,t}(y) D p , n , t X ( y ) , for y ∈ { 0 , 1 } n ∖ { 0 n } y \in\{0,1\}^{n} \setminus\{0^{n}\} y ∈ { 0 , 1 } n ∖ { 0 n } , be the conditional probability given E E E that the run halts before step 2 t 2t 2 t with output y y y , and put the remaining conditional mass on 0 n 0^{n} 0 n . Let F p , n , t X ( x ) = ∑ y ≤ x D p , n , t X ( y ) F^{X}_{p,n,t}(x) = \sum_{y \le x} D^{X}_{p,n,t}(y) F p , n , t X ( x ) = ∑ y ≤ x D p , n , t X ( y ) in lexicographic order.
Lemma 7.1. Let A A A be a sampler with description p p p , let t t t be a power of two, let α = Pr [ T A ( n ) ≥ t ] > 0 \alpha= \Pr[T_{A}(n) \ge t] > 0 α = Pr [ T A ( n ) ≥ t ] > 0 , and let π t = Pr [ A ( 1 n ) = x , t ≤ T A ( n ) < 2 t ] \pi_t = \Pr[A(1^{n}) = x,\ t \le T_{A}(n) < 2t] π t = Pr [ A ( 1 n ) = x , t ≤ T A ( n ) < 2 t ] . Then D p , n , t X ( x ) ≥ π t / α D^{X}_{p,n,t}(x) \ge\pi_t/\alpha D p , n , t X ( x ) ≥ π t / α .
Proof. The event T A ≥ t T_{A} \ge t T A ≥ t is determined by the first t t t steps, and the event { A = x , t ≤ T A < 2 t } \{A = x,\ t \le T_{A} < 2t\} { A = x , t ≤ T A < 2 t } by the first 2 t 2t 2 t steps; in both cases at most 2 t 2t 2 t coins are read. Under ω \omega ω uniform on { 0 , 1 } 2 t \{0,1\}^{2t} { 0 , 1 } 2 t they therefore have probabilities α \alpha α and π t \pi_t π t , and the second is contained in the first.
A positive oracle
Fix an encoding of tuples q = ⟨ p , 1 n , 1 2 t , x , u ⟩ q = \langle p,1^{n},1^{2t},x,u\rangle q = ⟨ p , 1 n , 1 2 t , x , u ⟩ , with t t t a power of two, x ∈ { 0 , 1 } n x \in\{0,1\}^{n} x ∈ { 0 , 1 } n and u u u an integer in [ 0 , 2 2 n ) [0,2^{2n}) [ 0 , 2 2 n ) written in 2 n 2n 2 n bits, such that ∣ q ∣ > 2 t |q| > 2t ∣ q ∣ > 2 t and q q q can be written in time O ( t + n + ∣ p ∣ ) O(t+n+|p|) O ( t + n + ∣ p ∣ ) . Define O ⋆ O_{\star} O ⋆ by induction on length: a string not of this form is not in O ⋆ O_{\star} O ⋆ , and
q ∈ O ⋆ ⟺ F p , n , t O ⋆ ( x ) > u / 2 2 n . q \in O_{\star} \Longleftrightarrow F^{O_{\star}}_{p,n,t}(x) > u/2^{2n}. q ∈ O ⋆ ⟺ F p , n , t O ⋆ ( x ) > u / 2 2 n .
A run of at most 2 t 2t 2 t steps writes no query of length 2 t 2t 2 t or more, so D p , n , t O ⋆ D^{O_{\star}}_{p,n,t} D p , n , t O ⋆ depends only on O ⋆ O_{\star} O ⋆ restricted to strings shorter than 2 t < ∣ q ∣ 2t < |q| 2 t < ∣ q ∣ . The definition is therefore well founded.
Theorem 7.2. For every rational r > 0 r > 0 r > 0 there is a sampler Q r ∈ S r O ⋆ Q_r \in S^{O_{\star}}_r Q r ∈ S r O ⋆ that polynomially dominates every member of S r O ⋆ S^{O_{\star}}_r S r O ⋆ . Consequently U O ⋆ ( r ) ≥ r U^{O_{\star}}(r) \ge r U O ⋆ ( r ) ≥ r for every real r > 0 r > 0 r > 0 , and for every rational r > 0 r > 0 r > 0 order r r r is achieved by a universal sampler belonging to S r O ⋆ S^{O_{\star}}_r S r O ⋆ .
Proof. Let ȷ ˉ n = ⌈ 2 n / r ⌉ + 1 \bar{\jmath}_n = \lceil2n/r \rceil+ 1 ˉ n = ⌈ 2 n / r ⌉ + 1 . On input 1 n 1^n 1 n the sampler Q r Q_r Q r does the following, writing O = O ⋆ O = O_{\star} O = O ⋆ .
With probability 1 / 2 1/2 1/2 output a uniform string in { 0 , 1 } n \{0,1\}^{n} { 0 , 1 } n .
Otherwise choose λ ∈ { 0 , … , n } \lambda\in\{0,\ldots,n\} λ ∈ { 0 , … , n } and j ∈ { 0 , … , ȷ ˉ n } j \in\{0,\ldots,\bar{\jmath}_n\} j ∈ { 0 , … , ˉ n } by reading enough bits for each, outputting 0 n 0^n 0 n on out-of-range indices, and choose a uniform p ∈ { 0 , 1 } λ p \in\{0,1\}^{\lambda} p ∈ { 0 , 1 } λ . Each valid triple ( λ , j , p ) (\lambda,j,p) ( λ , j , p ) has probability at least 2 − λ / [ 4 ( n + 1 ) ( ȷ ˉ n + 1 ) ] 2^{-\lambda}/[4(n+1)(\bar{\jmath}_n+1)] 2 − λ / [ 4 ( n + 1 ) ( ˉ n + 1 )] .
Toss ⌈ r j ⌉ \lceil rj\rceil ⌈ r j ⌉ coins; unless all are zero, output 0 n 0^n 0 n .
Let t = 2 j t = 2^j t = 2 j . Draw u u u uniformly from [ 0 , 2 2 n ) [0,2^{2n}) [ 0 , 2 2 n ) and binary-search, with n n n queries ⟨ p , 1 n , 1 2 t , x , u ⟩ \langle p,1^n,1^{2t},x,u\rangle ⟨ p , 1 n , 1 2 t , x , u ⟩ , for the least x x x with F p , n , t O ( x ) > u / 2 2 n F^{O}_{p,n,t}(x) > u/2^{2n} F p , n , t O ( x ) > u / 2 2 n ; it exists because F p , n , t O F^{O}_{p,n,t} F p , n , t O equals one at the last string. Output $x.
Moment. Steps 1–3 cost poly ( n ) \operatorname{poly}(n) poly ( n ) . Step 4 writes n n n queries of length O ( t + n ) O(t+n) O ( t + n ) , so it costs at most C n ( 2 j + n ) Cn(2^j+n) C n ( 2 j + n ) . Hence
E [ T Q r ( n ) r ] ≤ poly r ( n ) + ∑ j ≤ ȷ ˉ n 2 − ⌈ r j ⌉ ( C n ( 2 j + n ) ) r ≤ poly r ( n ) . \mathbb{E}\left[T_{Q_r}(n)^r\right] \le\operatorname{poly}_r(n) + \sum_{j \le\bar{\jmath}_n} 2^{-\lceil rj\rceil}\left(Cn(2^j+n)\right)^r \le\operatorname{poly}_r(n). E [ T Q r ( n ) r ] ≤ poly r ( n ) + j ≤ ˉ n ∑ 2 − ⌈ r j ⌉ ( C n ( 2 j + n ) ) r ≤ poly r ( n ) .
This holds for every r > 0 r > 0 r > 0 ; nothing here uses r ≤ 1 r \le1 r ≤ 1 .
Domination. Let A ∈ S r O A \in S^{O}_{r} A ∈ S r O have description p A p_A p A of length λ A \lambda_A λ A and μ = E [ T A ( n ) r ] ≤ C A ( n + 2 ) c A \mu= \mathbb{E}[T_A(n)^r] \le C_A(n+2)^{c_A} μ = E [ T A ( n ) r ] ≤ C A ( n + 2 ) c A , and let π = P A ( x ∣ n ) \pi= P_A(x \mid n) π = P A ( x ∣ n ) . If π ≤ 4 ⋅ 2 − n \pi\le4 \cdot2^{-n} π ≤ 4 ⋅ 2 − n , step 1 gives x x x probability at least 2 − n − 1 ≥ π / 8 2^{-n-1} \ge\pi/8 2 − n − 1 ≥ π /8 . Otherwise, by Theorem 3.1, let H = ( 4 μ / π ) 1 / r H = (4\mu/\pi)^{1/r} H = ( 4 μ / π ) 1/ r and M = max { 1 , ⌈ log H ⌉ } M = \max\{1,\lceil\log H\rceil\} M = max { 1 , ⌈ log H ⌉} ; some t = 2 j < H t = 2^j < H t = 2 j < H has π t ≥ 3 π / ( 4 M ) \pi_t \ge3\pi/(4M) π t ≥ 3 π / ( 4 M ) , and α = Pr [ T A ≥ t ] \alpha= \Pr[T_A \ge t] α = Pr [ T A ≥ t ] satisfies α ≥ π t \alpha\ge\pi_t α ≥ π t and α t r ≤ μ \alpha t^r \le\mu α t r ≤ μ . Since π > 4 ⋅ 2 − n \pi> 4 \cdot2^{-n} π > 4 ⋅ 2 − n , for large n n n we have log H ≤ 2 n / r \log H \le2n/r log H ≤ 2 n / r , so j ≤ ȷ ˉ n j \le\bar{\jmath}_n j ≤ ˉ n , and λ A ≤ n \lambda_A \le n λ A ≤ n .
The binary search returns x x x exactly when 2 2 n F ( x − ) ≤ u < 2 2 n F ( x ) 2^{2n}F(x^-) \le u < 2^{2n}F(x) 2 2 n F ( x − ) ≤ u < 2 2 n F ( x ) , with F = F p A , n , t O F = F^{O}_{p_A,n,t} F = F p A , n , t O , so with probability at least D p A , n , t O ( x ) − 2 − 2 n D^{O}_{p_A,n,t}(x)-2^{-2n} D p A , n , t O ( x ) − 2 − 2 n . By Theorem 7.1, D p A , n , t O ( x ) ≥ π t / α ≥ π t ≥ 3 ⋅ 2 − n / M D^{O}_{p_A,n,t}(x) \ge\pi_t/\alpha\ge\pi_t \ge3 \cdot2^{-n}/M D p A , n , t O ( x ) ≥ π t / α ≥ π t ≥ 3 ⋅ 2 − n / M , which exceeds 2 ⋅ 2 − 2 n 2 \cdot2^{-2n} 2 ⋅ 2 − 2 n for large n n n , so this probability is at least π t / ( 2 α ) \pi_t/(2\alpha) π t / ( 2 α ) . The gate passes with probability 2 − ⌈ r j ⌉ ≥ t − r / 2 ≥ α / ( 2 μ ) 2^{-\lceil rj\rceil} \ge t^{-r}/2 \ge\alpha/(2\mu) 2 − ⌈ r j ⌉ ≥ t − r /2 ≥ α / ( 2 μ ) . Multiplying,
P Q r ( x ∣ n ) ≥ 2 − λ A 8 ( n + 1 ) ( ȷ ˉ n + 1 ) ⋅ α 2 μ ⋅ π t 2 α ≥ π μ poly A , r ( n ) . P_{Q_r}(x \mid n) \ge\frac{2^{-\lambda_A}}{8(n+1)(\bar{\jmath}_n+1)} \cdot\frac{\alpha}{2\mu} \cdot\frac{\pi_t}{2\alpha} \ge\frac{\pi}{\mu\operatorname{poly}_{A,r}(n)}. P Q r ( x ∣ n ) ≥ 8 ( n + 1 ) ( ˉ n + 1 ) 2 − λ A ⋅ 2 μ α ⋅ 2 α π t ≥ μ poly A , r ( n ) π .
so the factor α \alpha α cancels and Q r Q_r Q r dominates A A A .
For real r r r , rationals γ ↑ r \gamma\uparrow r γ ↑ r give samplers Q γ ∈ S γ O ∗ Q_\gamma\in S^{O^*}_\gamma Q γ ∈ S γ O ∗ that dominate S γ O ∗ ⊇ S r O ∗ S^{O^*}_\gamma\supseteq S^{O^*}_r S γ O ∗ ⊇ S r O ∗ , so U O ∗ ( r ) ≥ r U^{O^*}(r) \ge r U O ∗ ( r ) ≥ r .
The cascaded gate of Theorem A.1 works here as well, with ( ∑ i ≤ L u i ) r ≤ L max { r − 1 , 0 } ∑ i ≤ L u i r \left(\sum_{i\le L}u_i\right)^r \le L^{\max\{r-1,0\}}\sum_{i\le L}u_i^r ( ∑ i ≤ L u i ) r ≤ L m a x { r − 1 , 0 } ∑ i ≤ L u i r for the L = O ( log n ) L = O(\log n) L = O ( log n ) levels in place of subadditivity, so for every real r > 0 r > 0 r > 0 whose m m m -bit approximations take time 2 O ( 2 m ) 2^{O(2^m)} 2 O ( 2 m ) , order r r r is likewise achieved, with the clock cap ȷ ˉ n \bar{\jmath}_n ˉ n replaced by n 2 n^2 n 2 so that it is computable, by a universal sampler belonging to S O ∗ S^{O^*} S O ∗ . Since U O ∗ ( r ) = r U^{O^*}(r) = r U O ∗ ( r ) = r (Theorem 7.5 ), these samplers attain the supremum.
Corollary 7.3 (Opposing oracles above the first moment). For every rational r > 1 r > 1 r > 1 , S r O ∗ S^{O^*}_r S r O ∗ has a universal member and S r O S^O_r S r O does not, where O O O is the oracle of § 6 . For every real a > 1 a > 1 a > 1 , some sampler in S a O ∗ S^{O^*}_a S a O ∗ dominates every member of S a l l O ∗ S^{O^*}_{\mathrm{all}} S all O ∗ , while no sampler in S a O S^O_a S a O dominates every member of S a l l O ∩ W O S^O_{\mathrm{all}} \cap W^O S all O ∩ W O .
Proof. For the first sentence use Theorem 7.2 and Theorem 6.1. For the second, choose a rational r ≥ a r \ge a r ≥ a ; then Q r ∈ S r O ∗ ⊆ S a O ∗ Q_r \in S^{O^*}_r \subseteq S^{O^*}_a Q r ∈ S r O ∗ ⊆ S a O ∗ dominates S r O ∗ ⊇ S a l l O ∗ S^{O^*}_r \supseteq S^{O^*}_{\mathrm{all}} S r O ∗ ⊇ S all O ∗ , and Theorem 6.1 gives the negative part.
Note that Q r Q_r Q r never shortcuts the computation of the source: at scale t t t it spends time proportional to t t t , and its queries are as long as the runs they describe. In particular it does not let polynomial time shortcut exponential-time computations relative to O ∗ O^* O ∗ , which the relativized time hierarchy rules out under the charged-query convention; it removes only the restarts. Nevertheless U O ∗ ( r ) = r U^{O^*}(r) = r U O ∗ ( r ) = r exactly (Theorem 7.5 ).
Proposition 7.4. P O ∗ = N P O ∗ P^{O^*} = NP^{O^*} P O ∗ = N P O ∗ .
Proof. Let N N N be a nondeterministic oracle machine running in time t 0 ( m ) = m c t_0(m) = m^c t 0 ( m ) = m c on inputs of length m m m . For an input z z z let p z p_z p z be the machine that, on 1 1 1^1 1 1 , reads t 0 ( ∣ z ∣ ) t_0(|z|) t 0 ( ∣ z ∣ ) coins as the nondeterministic choices of N N N and simulates N O ∗ ( z ) N^{O^*}(z) N O ∗ ( z ) on them, which takes at most s ( ∣ z ∣ ) s(|z|) s ( ∣ z ∣ ) steps for a polynomial s s s . If the simulated run rejects, p z p_z p z puts all at once; if it accepts, p z p_z p z runs a counter until at least t t t steps have passed and then halts with output 1 before step 2 t 2t 2 t , where t t t is the least power of two above s ′ ( ∣ z ∣ ) s'(|z|) s ′ ( ∣ z ∣ ) for a polynomial s ′ ≥ s s' \ge s s ′ ≥ s large enough for the counter. Every run of p z p_z p z reads at most 2 t 2t 2 t coins and halts within 2 t 2t 2 t steps. If N N N has no accepting run on z z z , no run of p z p_z p z survives to step t t t , so D p z , 1 , t O D^O_{p_z,1,t} D p z , 1 , t O is the point mass on 0 and F p z , 1 , t O ( 0 ) = 1 F^{O}_{p_z,1,t}(0) = 1 F p z , 1 , t O ( 0 ) = 1 . Otherwise every surviving run halts at a step in [ t , 2 t ) [t,2t) [ t , 2 t ) with output 1, so F p z , 1 , t O ( 0 ) = 0 F^{O}_{p_z,1,t}(0) = 0 F p z , 1 , t O ( 0 ) = 0 . Hence z ∈ L ( N O ∗ ) z \in L(N^{O^*}) z ∈ L ( N O ∗ ) if and only if ⟨ p z , 1 1 , 1 2 t , 0 , 3 ⟩ ∉ O ∗ \langle p_z,1^1,1^{2t},0,3\rangle\notin O^* ⟨ p z , 1 1 , 1 2 t , 0 , 3 ⟩ ∈ / O ∗ . The description p z p_z p z has length ∣ z ∣ + O ( 1 ) |z|+O(1) ∣ z ∣ + O ( 1 ) , so this query has polynomial length and is written in polynomial time.
So O ⋆ O_{\star} O ⋆ is an oracle relative to which P = NP and, by Theorem 7.5 below, U O ⋆ ( r ) = r U^{O_{\star}}(r)=r U O ⋆ ( r ) = r for every real r > 0 r>0 r > 0 . A relativizing proof that P = NP forces U ( r ) < r U(r)<r U ( r ) < r for some r r r , or forces any loss in the order of the universal sampler of Theorem 7.7 , is therefore impossible; the attainment at rational orders is Theorem 7.2 .
The exact profile of the positive oracle
The positive oracle helps above one, but only up to the source order.
Theorem 7.5 (The profile of O ⋆ O_{\star} O ⋆ ).
For all reals a > r > 0 a>r>0 a > r > 0 and every Q ∈ S a O ⋆ Q\in S^{O_{\star}}_{a} Q ∈ S a O ⋆ , some A ∈ S r O ⋆ A\in S^{O_{\star}}_{r} A ∈ S r O ⋆ with worst-case runtime 2 O ( n ) 2^{O(\sqrt{n})} 2 O ( n ) satisfies, for every polynomial p p p and all large n n n , P A ( x ∣ n ) > p ( n ) P Q ( x ∣ n ) P_A(x\mid n)>p(n)P_Q(x\mid n) P A ( x ∣ n ) > p ( n ) P Q ( x ∣ n ) for some x ∈ { 0 , 1 } n x\in\{0,1\}^{n} x ∈ { 0 , 1 } n . Hence U O ⋆ ( r ) = r U^{O_{\star}}(r)=r U O ⋆ ( r ) = r for every real r > 0 r>0 r > 0 , and the supremum is attained at every rational r r r .
For every rational a > 0 a>0 a > 0 some Q a ⋆ ∈ S a O ⋆ Q^{\star}_{a}\in S^{O_{\star}}_{a} Q a ⋆ ∈ S a O ⋆ dominates every A ∈ S r O ⋆ A\in S^{O_{\star}}_{r} A ∈ S r O ⋆ , for every real r > 0 r>0 r > 0 , with power B ⋆ ( a , r ) = max { 1 , a / r } B^{\star}(a,r)=\max\{1,a/r\} B ⋆ ( a , r ) = max { 1 , a / r } , and D α ( P A ∥ P Q a ⋆ ) = O A , a , r , α ( log n ) D_{\alpha}(P_A\mathbin\Vert P_{Q^{\star}_{a}})=O_{A,a,r,\alpha}(\log n) D α ( P A ∥ P Q a ⋆ ) = O A , a , r , α ( log n ) for every finite α > 1 \alpha>1 α > 1 with a ( α − 1 ) ≤ r α a(\alpha-1)\le r\alpha a ( α − 1 ) ≤ r α . Relative to O ⋆ O_{\star} O ⋆ , no sampler in S a O ⋆ S^{O_{\star}}_{a} S a O ⋆ achieves a smaller power, or a logarithmic Rényi divergence of a larger order, against all of S r O ⋆ S^{O_{\star}}_{r} S r O ⋆ .
There is one sampler A † ∈ S 1 O ⋆ A^{\dagger}\in S^{O_{\star}}_{1} A † ∈ S 1 O ⋆ with worst-case runtime 2 n + O ( log n ) 2^{\sqrt{n}+O(\log n)} 2 n + O ( l o g n ) that no sampler of any order above one dominates.
The proof is in Section C. The source uses the threshold interface of O ⋆ O_{\star} O ⋆ against the candidate itself. It writes conditional queries about a clocked simulation of Q Q Q at the scales up to s = 2 ⌊ n ⌋ s=2^{\lfloor\sqrt{n}\rfloor} s = 2 ⌊ n ⌋ , so that the average of the conditional laws majorizes the output law of Q Q Q ’s runs shorter than s s s . Approximate CDF values of that average let it descend the binary tree of prefixes deterministically, choosing the lighter child each time, to a fixed string x n x_n x n to which Q Q Q ’s short runs give probability O ( n 2 − n ) O(\sqrt{n}2^{-n}) O ( n 2 − n ) . Output with probability about s − r s^{-r} s − r , at cost spoly ( n ) \operatorname{spoly}(n) spoly ( n ) , this string has probability s − a s^{-a} s − a under the source and at most poly ( n ) s − a \operatorname{poly}(n)s^{-a} poly ( n ) s − a under Q Q Q .
So O ⋆ O_{\star} O ⋆ removes exactly the loss of the killed restart and nothing more. For r ≤ 1 r\le1 r ≤ 1 its frontier B ⋆ ( a , r ) = max { 1 , a / r } B_{\star}(a,r)=\max\{1,a/r\} B ⋆ ( a , r ) = max { 1 , a / r } coincides with B ( a , r ) B(a,r) B ( a , r ) on the negative oracle, and in particular O ⋆ O_{\star} O ⋆ does not help against expected-polynomial-time sources. For r > 1 r>1 r > 1 and a > 1 a>1 a > 1 it is smaller: a / r < 1 + ( a − 1 ) / r a/r<1+(a-1)/r a / r < 1 + ( a − 1 ) / r when a > r a>r a > r , and 1 < 1 + ( a − 1 ) / r 1<1+(a-1)/r 1 < 1 + ( a − 1 ) / r when 1 < a ≤ r 1<a\le r 1 < a ≤ r . The upper bound does not come from O ⋆ O_{\star} O ⋆ failing to speed up long computations. It comes from the CDF interface, which gives a canonical light output in time proportional to the cutoff; the sampling access that Q r Q_r Q r uses would not.
A P versus NP barrier
Without an oracle, a collapse can play the role of O ⋆ O_{\star} O ⋆ at a polynomial loss in the order. We use uniform generation of NP witnesses.
Lemma 7.6 ([8 ] ; see also [14 ] ). For every polynomial-time relation R R R with polynomially bounded witnesses there is a probabilistic polynomial-time machine G G G with access to an NP oracle that, on input z z z , outputs ⊥ \perp ⊥ if R ( z ) = { w : ( z , w ) ∈ R } R(z)=\{w:(z,w)\in R\} R ( z ) = { w : ( z , w ) ∈ R } is empty, and otherwise outputs ⊥ \perp ⊥ with probability at most 1 / 2 1/2 1/2 and a uniformly distributed element of R ( z ) R(z) R ( z ) with the remaining probability.
Any generator whose output law gives each element of R ( z ) R(z) R ( z ) probability within a constant factor of 1 / ∣ R ( z ) ∣ 1/\lvert R(z)\rvert 1/ ∣ R ( z )∣ would do equally well below.
Theorem 7.7. Assume P = NP. There is a constant ζ ≥ 1 \zeta\ge1 ζ ≥ 1 such that for every rational r > 0 r>0 r > 0 some sampler in S r / ζ S_{r/\zeta} S r / ζ polynomially dominates every member of S r S_r S r . Consequently, for every real r > 0 r>0 r > 0 ,
U ( r ) ≥ max { min { r , 1 } , r / ζ } , U(r)\ge\max\{\min\{r,1\},r/\zeta\}, U ( r ) ≥ max { min { r , 1 } , r / ζ } ,
and for every real a > 1 a > 1 a > 1 some sampler in S a S_a S a dominates every member of S a l l S_{\mathrm{all}} S all . The same holds relative to any oracle X X X with P X = N P X \mathrm{P}^{X} = \mathrm{NP}^{X} P X = NP X .
Proof. Let R R R be the relation of pairs ( z , ω ) (z,\omega) ( z , ω ) with z = ( p , 1 n , 1 t ) z=(p,1^n,1^t) z = ( p , 1 n , 1 t ) and ω ∈ { 0 , 1 } 2 t \omega\in\{0,1\}^{2t} ω ∈ { 0 , 1 } 2 t such that p p p on 1 n 1^n 1 n with coins from ω \omega ω does not halt before step t t t . It is decidable by simulation in time t ⋅ poly ( n , ∣ p ∣ ) t \cdot\operatorname{poly}(n,|p|) t ⋅ poly ( n , ∣ p ∣ ) , polynomial in ∣ z ∣ |z| ∣ z ∣ . Apply Theorem 7.6 and replace the NP oracle by a polynomial-time decider; the result is an ordinary probabilistic algorithm G G G running in time at most C ( n + t + ∣ p ∣ ) ζ C(n+t+|p|)^\zeta C ( n + t + ∣ p ∣ ) ζ on every path, for constants C , ζ ≥ 1 C,\zeta\ge1 C , ζ ≥ 1 that depend only on the hypothesis.
The sampler Q Q Q follows steps 1–3 of the proof of Theorem 7.2 . In place of step 4 it runs G ( p , 1 n , 1 t ) G(p,1^n,1^t) G ( p , 1 n , 1 t ) with t = 2 j t=2^j t = 2 j ; on ⊥ \bot ⊥ it outputs 0 n 0^n 0 n ; otherwise it simulates p p p on 1 n 1^n 1 n with coins ω \omega ω for 2 t 2t 2 t steps and outputs the result if the run halts before step 2 t 2t 2 t with an n n n -bit output, and 0 n 0^n 0 n otherwise.
Domination. With A A A , x x x , π \pi π , t t t , π t \pi_t π t and α \alpha α as before, G G G returns a uniform element of the survival set with probability at least 1 / 2 1/2 1/2 , so by the argument of Theorem 7.1 the simulation outputs x x x with probability at least π t / ( 2 α ) \pi_t/(2\alpha) π t / ( 2 α ) . The rest of the calculation is the same, and α \alpha α cancels.
Moment. Put a = r / ζ a=r/\zeta a = r / ζ . After a gate passed with probability at most 2 − r j 2^{-rj} 2 − r j , the cost is at most C ′ ( n + 2 j ) ζ poly ( n ) C'(n+2^j)^\zeta\operatorname{poly}(n) C ′ ( n + 2 j ) ζ poly ( n ) . So
E [ T Q ( n ) a ] ≤ poly ( n ) + ∑ j ≤ ȷ ˉ n 2 − r j ( C ′ ( n + 2 j ) ζ poly ( n ) ) r / ζ ≤ poly r ( n ) . \mathbb{E}\left[T_Q(n)^a\right] \le\operatorname{poly}(n) + \sum_{j\le\bar{\jmath}_n} 2^{-rj}\left(C'(n+2^j)^\zeta\operatorname{poly}(n)\right)^{r/\zeta} \le\operatorname{poly}_r(n). E [ T Q ( n ) a ] ≤ poly ( n ) + j ≤ ˉ n ∑ 2 − r j ( C ′ ( n + 2 j ) ζ poly ( n ) ) r / ζ ≤ poly r ( n ) .
For the consequences, Theorem 3.4 gives the bound min { r , 1 } \min\{r,1\} min { r , 1 } , and for a > 1 a > 1 a > 1 a rational r ≥ ζ a r \ge\zeta a r ≥ ζ a gives a sampler in S r / ζ ⊆ S a S_{r/\zeta} \subseteq S_a S r / ζ ⊆ S a dominating S r ⊇ S a l l S_r \supseteq S_{\mathrm{all}} S r ⊇ S all . Everything relativizes. □
Corollary 7.8. An unrelativized proof that, for some real a > 1 a > 1 a > 1 , no sampler in S a S_a S a dominates every member of S a l l S_{\mathrm{all}} S all would imply P ≠ N P \mathrm{P} \ne\mathrm{NP} P = NP . This applies in particular to an unrelativized version of Theorem 6.1, even without its polynomial-space and subexponential-time refinements.
The collapse also bounds the profile from above, by the light-output argument of Theorem 7.5 , with a fixed polynomial in place of the near-linear cost of O ⋆ O_\star O ⋆ .
Theorem 7.9 (A linear profile under P = N P \mathrm{P}=\mathrm{NP} P = NP ). Assume P = N P \mathrm{P}=\mathrm{NP} P = NP , or more generally work relative to an oracle X X X with P X = N P X \mathrm{P}^{X}=\mathrm{NP}^{X} P X = NP X . There is a constant C ≥ 1 C \ge1 C ≥ 1 such that for all real a , r > 0 a,r>0 a , r > 0 , every β \beta β with 1 ≤ β < a / ( C r ) 1 \le\beta< a/(Cr) 1 ≤ β < a / ( C r ) and every Q ∈ S a Q \in S_a Q ∈ S a , some A ∈ S r A \in S_r A ∈ S r with worst-case runtime 2 O q ( n ) 2^{O_q(\sqrt n)} 2 O q ( n ) satisfies, for every polynomial p p p and all large n n n , P A ( x ∣ n ) β > p ( n ) P Q ( x ∣ n ) P_A(x\mid n)^\beta> p(n)P_Q(x\mid n) P A ( x ∣ n ) β > p ( n ) P Q ( x ∣ n ) for some x ∈ { 0 , 1 } n x \in\{0,1\}^n x ∈ { 0 , 1 } n . Consequently U ( r ) ≤ C r U(r) \le Cr U ( r ) ≤ C r for every real r > 0 r>0 r > 0 , and with Theorem 7.7 ,
max { min { r , 1 } , r / ζ } ≤ U ( r ) ≤ C r , in particular 1 ≤ U ( 1 ) ≤ C . \max\{\min\{r,1\},r/\zeta\} \le U(r) \le Cr,\qquad\text{in particular}\qquad1 \le U(1) \le C. max { min { r , 1 } , r / ζ } ≤ U ( r ) ≤ C r , in particular 1 ≤ U ( 1 ) ≤ C . For rational r r r , one source A r ∈ S r A_r \in S_r A r ∈ S r works against every candidate of every order a > C r a > Cr a > C r .
Proof. Fix a universal machine. The number of h h h -bit coin strings on which the h h h -step run of the machine with description q q q on 1 n 1^n 1 n ends, after mapping timeouts and malformed outputs to 0 n 0^n 0 n , with an output extending a prefix y y y is a # P \#\mathrm{P} # P function of ( q , 1 n , 1 h , y ) (q,1^n,1^h,y) ( q , 1 n , 1 h , y ) , computed by one fixed relation. As in the proof of Theorem D.1, Stockmeyer’s approximate counting [27 ] and the collapse give, for every description q q q , a string x ( q , n , h ) ≠ 0 n x(q,n,h)\ne0^n x ( q , n , h ) = 0 n with Pr [ Q q ( 1 n ) = x , T < h ] ≤ 2 − n / 2 \Pr[Q_q(1^n)=x,\ T<h]\le2^{-n/2} Pr [ Q q ( 1 n ) = x , T < h ] ≤ 2 − n /2 , computed in time at most C 0 ( n + h + ∣ q ∣ ) C ′ C_0(n+h+|q|)^{C'} C 0 ( n + h + ∣ q ∣ ) C ′ for constants C 0 , C C_0,C C 0 , C that do not depend on q q q .
Let h = 2 ⌊ n ⌋ h=2\lfloor\sqrt n\rfloor h = 2 ⌊ n ⌋ , let Q = Q q ∈ S a Q=Q_q\in S_a Q = Q q ∈ S a with E [ T Q a ] ≤ C ′ ( n + 2 ) c \mathbb{E}[T_Q^a]\le C'(n+2)^c E [ T Q a ] ≤ C ′ ( n + 2 ) c , and choose a rational b b b with C r < b < a / β Cr<b<a/\beta C r < b < a / β . The source A A A outputs 0 n 0^n 0 n unless ⌈ b log h ⌉ \lceil b\log h\rceil ⌈ b log h ⌉ coins are all zero, and then outputs x ( q , n , h ) x(q,n,h) x ( q , n , h ) . Then E [ T A r ] ≤ poly ( n ) + h − b poly ( n ) h C r ≤ poly ( n ) \mathbb{E}[T_A^r]\le\operatorname{poly}(n)+h^{-b}\operatorname{poly}(n)h^{Cr}\le\operatorname{poly}(n) E [ T A r ] ≤ poly ( n ) + h − b poly ( n ) h C r ≤ poly ( n ) , and P A ( x ∣ n ) ≥ h − b / 2 P_A(x\mid n)\ge h^{-b}/2 P A ( x ∣ n ) ≥ h − b /2 , while Markov’s inequality gives P Q ( x ∣ n ) ≤ 2 − n / 2 + C ′ ( n + 2 ) c h − a P_Q(x\mid n)\le2^{-n/2}+C'(n+2)^c h^{-a} P Q ( x ∣ n ) ≤ 2 − n /2 + C ′ ( n + 2 ) c h − a . So P A ( x ) β / P Q ( x ) ≥ h a − β b / poly ( n ) P_A(x)^\beta/P_Q(x)\ge h^{a-\beta b}/\operatorname{poly}(n) P A ( x ) β / P Q ( x ) ≥ h a − β b / poly ( n ) , which exceeds every polynomial. With β = 1 \beta=1 β = 1 this excludes every a > C r a>Cr a > C r . For the single source, choose q q q with probability 2 − 2 ∣ q ∣ − 1 2^{-2|q|-1} 2 − 2∣ q ∣ − 1 , abort if ∣ q ∣ > n |q|>n ∣ q ∣ > n , and use the gate 2 − ⌈ C r log h ⌉ 2^{-\lceil Cr\log h\rceil} 2 − ⌈ C r l o g h ⌉ ; every fixed q q q then gets weight independent of n n n , and the same estimate applies to each candidate. □
For r ≤ 1 r \le1 r ≤ 1 the single-source statement is not new, since Q r Q_r Q r of Theorem 3.4 is universal for S r \mathcal{S}_r S r . The gap between C C C and one is the cost of the light output. Relative to O ⋆ O_\star O ⋆ that cost is h poly ( n ) h^{\operatorname{poly}(n)} h poly ( n ) , which is why the profile of O ⋆ O_\star O ⋆ is exactly r r r ; if, under P = N P \mathrm{P} = \mathrm{NP} P = NP , a light output could be found in time h 1 + ε poly Q , ε ( n ) h^{1+\varepsilon}\operatorname{poly}_{Q,\varepsilon}(n) h 1 + ε poly Q , ε ( n ) for every ε > 0 \varepsilon> 0 ε > 0 , the same argument would give U ( 1 ) = 1 U(1) = 1 U ( 1 ) = 1 .
We do not know whether P = N P \mathrm{P} = \mathrm{NP} P = NP gives a universal member of S r \mathcal{S}_r S r itself, that is, whether ζ \zeta ζ can be taken to be one; relative to O ⋆ O_\star O ⋆ it can.
No universal sampler with all moments
Relative to O ⋆ O_\star O ⋆ , every class S r O ⋆ \mathcal{S}_r^{O_\star} S r O ⋆ with rational r r r has a universal member, and under P = N P \mathrm{P} = \mathrm{NP} P = NP every order a > 1 a > 1 a > 1 has a sampler dominating all of S a l l \mathcal{S}_{\mathrm{all}} S all . Neither gives a universal sampler for S a l l \mathcal{S}_{\mathrm{all}} S all that itself has all polynomial moments: the sampler for order a a a keeps only its a a a th moment. This cannot be repaired.
Theorem 7.10 (No all-moments universal law). Relative to every oracle X X X with P X = N P X \mathrm{P}^{X} = \mathrm{NP}^{X} P X = NP X , in particular relative to O ⋆ O_\star O ⋆ (Theorem 7.4) and without an oracle if P = N P \mathrm{P} = \mathrm{NP} P = NP , the following holds. For every Q ∈ S a l l Q \in\mathcal{S}_{\mathrm{all}} Q ∈ S all there are A ∈ S a l l A \in\mathcal{S}_{\mathrm{all}} A ∈ S all with worst-case runtime 2 Q ( n ) 2^{Q(\sqrt{n})} 2 Q ( n ) and strings x n ∈ { 0 , 1 } n x_n \in\{0,1\}^{n} x n ∈ { 0 , 1 } n such that for every fixed β ≥ 1 \beta\ge1 β ≥ 1 and every c > 0 c > 0 c > 0 , at all large n n n ,
P A ( x n ∣ n ) β ≥ 2 c n P Q ( x n ∣ n ) , P_A(x_n \mid n)^\beta\ge2^{c\sqrt{n}}P_Q(x_n \mid n), P A ( x n ∣ n ) β ≥ 2 c n P Q ( x n ∣ n ) , and for every fixed α > 1 \alpha> 1 α > 1 , D α ( P A ∥ P Q ) / n → ∞ D_\alpha(P_A\mathbin\Vert P_Q)/\sqrt{n} \to\infty D α ( P A ∥ P Q ) / n → ∞ . So no member of S a l l \mathcal{S}_{\mathrm{all}} S all dominates every member of S a l l \mathcal{S}_{\mathrm{all}} S all with any finite power, even infinitely often, and none dominates every member of S a l l \mathcal{S}_{\mathrm{all}} S all on average in the sense of Gurevich.
The proof is in Section D. The source runs a cascade of rare gates at the scales h = 2 m h = 2^m h = 2 m , log n ≤ m ≤ n \log n \le m \le\sqrt{n} log n ≤ m ≤ n , doubling m m m at each step. At each scale it estimates the candidate’s tail τ h = Pr [ T Q ≥ h ] \tau_h = \Pr[T_Q \ge h] τ h = Pr [ T Q ≥ h ] deterministically and passes the next gate with probability 2 − z m 2^{-\sqrt{zm}} 2 − z m , where 2 − z 2^{-z} 2 − z is the estimate. Since Q Q Q has every moment, z ≥ K m / 4 z \ge Km/4 z ≥ K m /4 for every fixed K K K once m m m is moderately large, so the gate pays for the cost h O ( 1 ) h^{O(1)} h O ( 1 ) of the next scale in every fixed moment. At the last scale the source outputs a canonical light string of Q Q Q ’s short runs, which Q Q Q gives probability at most about 2 − z 2^{-z} 2 − z , while the source gives it 2 − z M 2^{-\sqrt{zM}} 2 − z M with M = ⌊ n ⌋ M = \lfloor\sqrt{n}\rfloor M = ⌊ n ⌋ and z / M → ∞ z/M \to\infty z / M → ∞ . The source never uses the moment order, which is why one source defeats every power at once. Relative to O ⋆ O_\star O ⋆ the estimates come from conditional queries about a padded clocked simulation of Q Q Q , and under P = N P \mathrm{P} = \mathrm{NP} P = NP from Stockmeyer’s approximate counting [27 ] .
The order of Rényi divergence that a sampler with all moments can guarantee is therefore exactly one.
Theorem 7.11 (The Kullback–Leibler endpoint). For every oracle there is one Q ∞ ∈ S a l l Q_\infty\in\mathcal{S}_{\mathrm{all}} Q ∞ ∈ S all such that KL ( P A ∥ P Q ∞ ) = O A , r ( log n ) \operatorname{KL}(P_A\mathbin\Vert P_{Q_\infty}) = O_{A,r}(\log n) KL ( P A ∥ P Q ∞ ) = O A , r ( log n ) for every real r > 0 r > 0 r > 0 and every A ∈ S r A \in\mathcal{S}_r A ∈ S r .
Proof. Let V ∈ S a l l V \in\mathcal{S}_{\mathrm{all}} V ∈ S all be the sampler of Theorem 1.4 , which dominates every strict sampler, and let Q ∞ Q_\infty Q ∞ run V V V or output a uniform string, with probability 1 / 2 1/2 1/2 each. Then Q ∞ ∈ S a l l Q_\infty\in\mathcal{S}_{\mathrm{all}} Q ∞ ∈ S all and q ( x ) = P Q ∞ ( x ∣ n ) ≥ 2 − n − 1 q(x) = P_{Q_\infty}(x \mid n) \ge2^{-n-1} q ( x ) = P Q ∞ ( x ∣ n ) ≥ 2 − n − 1 . Fix A A A with E [ T A ( n ) r ] ≤ C ( n + 2 ) c \mathbb{E}[T_A(n)^r] \le C(n+2)^c E [ T A ( n ) r ] ≤ C ( n + 2 ) c , an integer c ≥ ( c + 3 ) / r c \ge(c+3)/r c ≥ ( c + 3 ) / r , and let B B B run A A A for ( n + 2 ) c (n+2)^c ( n + 2 ) c steps, outputting 0 0 0 on timeout. B B B is strict, and the timeout probability ε n \varepsilon_n ε n is at most ( n + 2 ) − 2 (n+2)^{-2} ( n + 2 ) − 2 for large n n n . Write P A = ( 1 − ε n ) P g o o d + ε n P t a i l P_A = (1-\varepsilon_n)P_{\mathrm{good}} + \varepsilon_n P_{\mathrm{tail}} P A = ( 1 − ε n ) P good + ε n P tail according to whether A A A halts before the cutoff. Since ( 1 − ε n ) P g o o d ≤ P B ≤ poly B ( n ) q (1-\varepsilon_n)P_{\mathrm{good}} \le P_B \le\operatorname{poly}_B(n)q ( 1 − ε n ) P good ≤ P B ≤ poly B ( n ) q , we have KL ( P g o o d ∥ q ) = O B ( log n ) \operatorname{KL}(P_{\mathrm{good}}\mathbin\Vert q) = O_B(\log n) KL ( P good ∥ q ) = O B ( log n ) , and KL ( P t a i l ∥ q ) ≤ n + 1 \operatorname{KL}(P_{\mathrm{tail}}\mathbin\Vert q) \le n+1 KL ( P tail ∥ q ) ≤ n + 1 . Convexity of KL in its first argument gives KL ( P A ∥ q ) ≤ O B ( log n ) + ε n ( n + 1 ) = O A , r ( log n ) \operatorname{KL}(P_A\mathbin\Vert q) \le O_B(\log n)+\varepsilon_n(n+1) = O_{A,r}(\log n) KL ( P A ∥ q ) ≤ O B ( log n ) + ε n ( n + 1 ) = O A , r ( log n ) .
Since K L ≤ D α \mathrm{KL} \le D_{\alpha} KL ≤ D α for α > 1 \alpha> 1 α > 1 , Theorem 7.10 shows that Theorem 7.11 cannot be improved to any order above one relative to O ⋆ O_{\star} O ⋆ or under P = N P \mathrm{P} = \mathrm{NP} P = NP , already against S a l l S_{\mathrm{all}} S all . This is the endpoint a = ∞ a = \infty a = ∞ of the frontier (3), whose admissible orders α ≤ 1 + r / ( a − min { r , 1 } ) \alpha\le1 + r/(a - \min\{r,1\}) α ≤ 1 + r / ( a − min { r , 1 }) decrease to one as a a a grows. Neither theorem makes the likelihood ratio efficiently computable, and KL divergence alone does not transfer average polynomial time.
Corollary 7.12. An unrelativized construction of a sampler in S a l l S_{\mathrm{all}} S all that dominates every member of S a l l S_{\mathrm{all}} S all , with some finite power or on average in the sense of Gurevich, would imply P ≠ N P \mathrm{P} \ne\mathrm{NP} P = NP . No relativizing proof can give such a sampler, since none exists relative to O ⋆ O_{\star} O ⋆ .
The sources of Theorem 7.10 use superpolynomial space, and they must. A PSPACE-complete oracle O + O_{+} O + satisfies P O + = N P O + \mathrm{P}^{O_{+}} = \mathrm{NP}^{O_{+}} P O + = NP O + , and relative to it Theorem I.1 gives one sampler with all polynomial moments that dominates every polynomial-space source. We know no oracle relative to which some member of S a l l S_{\mathrm{all}} S all is universal for S a l l S_{\mathrm{all}} S all .
Expected-time sources without a constructed oracle
Against sources with all moments the negative oracle needs gated blocks, whose positive density adapts to the candidate, and an unrelativized proof would separate P \mathrm{P} P from N P \mathrm{NP} NP (Theorem 7.8 ). Against expected-polynomial-time sources much less is needed. The source of Theorem 6.5 with γ = 1 \gamma= 1 γ = 1 walks a single chain with a public head, and the only property it uses is that the terminal cannot be produced faster than by walking the chain. That property holds for an iterated random function, and it is a natural hardness hypothesis for iterated functions without an oracle.
A random oracle
Let R ⊆ { 0 , 1 } ∗ R \subseteq\{0,1\}^{*} R ⊆ { 0 , 1 } ∗ be a random oracle in the sense of Bennett and Gill [7 ] : each string belongs to R R R independently with probability 1 / 2 1/2 1/2 . For each n n n let H n : { 0 , 1 } 4 n → { 0 , 1 } 4 n H_n : \{0,1\}^{4n} \to\{0,1\}^{4n} H n : { 0 , 1 } 4 n → { 0 , 1 } 4 n be the function whose i i i th output bit at u u u is the answer of R R R to the encoding of ( 1 n , u , i ) (1^n,u,i) ( 1 n , u , i ) , put h = ⌊ n ⌋ h = \lfloor\sqrt{n}\rfloor h = ⌊ n ⌋ and T = 2 h T = 2^h T = 2 h , and define the chain
u 0 = 0 4 n , u j + 1 = H n ( u j ) , W R ( n ) = the first n bits of u T . u_0 = 0^{4n}, \qquad u_{j+1} = H_n(u_j), \qquad W_R(n) = \text{the first } n \text{ bits of } u_T. u 0 = 0 4 n , u j + 1 = H n ( u j ) , W R ( n ) = the first n bits of u T .
Lemma 8.1 (Sequentiality of the chain). For every oracle machine M M M , every n n n and every t ≤ T / 2 t \le T/2 t ≤ T /2 ,
E R [ Pr [ M R ( 1 n ) outputs W R ( n ) within t steps ] ] ≤ ( t T + T 2 ) 2 − 4 n + 2 − n . \mathop{\mathbb{E}}_{R}\left[\Pr\left[M^{R}(1^n)\text{ outputs }W_R(n)\text{ within }t\text{ steps}\right]\right] \le(tT + T^2)2^{-4n} + 2^{-n}. E R [ Pr [ M R ( 1 n ) outputs W R ( n ) within t steps ] ] ≤ ( tT + T 2 ) 2 − 4 n + 2 − n .
Proof. Fix the coins of M M M and sample R R R lazily. As in § 5 , augment the history so that a query to any bit of H n ( u ) H_n(u) H n ( u ) reveals the whole word H n ( u ) H_n(u) H n ( u ) ; a run of t t t steps asks for at most t t t words. Let Coll be the event that u 0 , … , u T u_0,\ldots,u_T u 0 , … , u T are not distinct; each u j + 1 u_{j+1} u j + 1 is uniform given u 0 , … , u j u_0,\ldots,u_j u 0 , … , u j while these are distinct, so Pr [ C o l l ] ≤ T 2 2 − 4 n \Pr[\mathrm{Coll}] \le T^2 2^{-4n} Pr [ Coll ] ≤ T 2 2 − 4 n . Let Hit be the event that the run asks for H n ( u j ) H_n(u_j) H n ( u j ) with j ≥ 1 j \ge1 j ≥ 1 at a time when H n ( u j − 1 ) H_n(u_{j-1}) H n ( u j − 1 ) has not been asked. At such a time u j = H n ( u j − 1 ) u_j = H_n(u_{j-1}) u j = H n ( u j − 1 ) is the value of H n H_n H n at a point that has not been asked, hence uniform given the history, so each query hits it with probability 2 − 4 n 2^{-4n} 2 − 4 n ; a union bound over at most t t t queries and T T T indices gives Pr [ H i t ] ≤ t T 2 − 4 n \Pr[\mathrm{Hit}] \le tT2^{-4n} Pr [ Hit ] ≤ tT 2 − 4 n . Outside Coll ∪ \cup ∪ Hit the run asks for the chain words only in order, so it cannot ask for H n ( u T − 1 ) H_n(u_{T-1}) H n ( u T − 1 ) with fewer than T ≥ t T \ge t T ≥ t queries. Then u T u_T u T is uniform given the history, and the final output equals W R ( n ) W_R(n) W R ( n ) with probability 2 − n 2^{-n} 2 − n . □
This is the sequentiality of iterated random functions; Mahmood, Moran and Vadhan [21 ] prove a parallel version. We need only total time, but at success probability far below 1 / T 1/T 1/ T .
Theorem 8.2 (Expected-time sources relative to a random oracle). With probability 1 over R R R , the following holds. For every rational γ > 0 \gamma> 0 γ > 0 there is A γ ∈ S γ R ∩ W R A_\gamma\in S_\gamma^R \cap W^R A γ ∈ S γ R ∩ W R with worst-case runtime 2 n + O ( log n ) 2^{\sqrt{n}+O(\log n)} 2 n + O ( l o g n ) such that for every real a > γ a > \gamma a > γ , every Q ∈ S a R Q \in S_a^R Q ∈ S a R and every β ∈ [ 1 , a / γ ) \beta\in[1,a/\gamma) β ∈ [ 1 , a / γ ) there is δ > 0 \delta> 0 δ > 0 with
P A γ ( W R ( n ) ∣ n ) β ≥ 2 δ n P Q ( W R ( n ) ∣ n ) P_{A_\gamma}(W_R(n) \mid n)^\beta\ge2^{\delta\sqrt{n}} P_Q(W_R(n) \mid n) P A γ ( W R ( n ) ∣ n ) β ≥ 2 δ n P Q ( W R ( n ) ∣ n ) at all large n n n .
Consequently, for every real 0 < r ≤ 1 0 < r \le1 0 < r ≤ 1 , U R ( r ) = r U^R(r) = r U R ( r ) = r and B ∗ R ( a , r ) = B ( a , r ) B_*^R(a,r) = B(a,r) B ∗ R ( a , r ) = B ( a , r ) for all real a > 0 a > 0 a > 0 , and every failure of domination holds at all large lengths. For every real r > 1 r > 1 r > 1 , 1 ≤ U R ( r ) ≤ r 1 \le U^R(r) \le r 1 ≤ U R ( r ) ≤ r . In particular one source A 1 ∈ S R A_1 \in S^R A 1 ∈ S R is dominated by no sampler of order above one, even infinitely often.
Proof. For a machine Q Q Q and a length n n n let p n ( R ) p_n(R) p n ( R ) be the probability that Q R ( 1 n ) Q^R(1^n) Q R ( 1 n ) outputs W R ( n ) W_R(n) W R ( n ) within T / 2 T/2 T /2 steps. By Theorem 8.1, E R [ p n ] ≤ 2 1 − n \mathbb{E}_R[p_n] \le2^{1-n} E R [ p n ] ≤ 2 1 − n for large n n n , so Pr R [ p n > 2 − n / 2 ] ≤ 2 1 − n / 2 \Pr_R[p_n > 2^{-n/2}] \le2^{1-n/2} Pr R [ p n > 2 − n /2 ] ≤ 2 1 − n /2 . These probabilities are summable, so by the Borel–Cantelli lemma p n ≤ 2 − n / 2 p_n \le2^{-n/2} p n ≤ 2 − n /2 for all large n n n , with probability 1; as there are countably many machines, this holds for all of them at once. Fix such an R R R .
A γ A_\gamma A γ on 1 n 1^n 1 n outputs 0 n 0^n 0 n unless ⌈ γ h ⌉ \lceil\gamma h\rceil ⌈ γ h ⌉ coins are all zero, which has probability in [ T − γ / 2 , T − γ ] [T^{-\gamma}/2,T^{-\gamma}] [ T − γ /2 , T − γ ] ; then it computes u T u_T u T by T T T evaluations of H n H_n H n , each costing poly ( n ) \operatorname{poly}(n) poly ( n ) steps, and outputs W R ( n ) W_R(n) W R ( n ) . So E [ T A γ ( n ) γ ] ≤ poly ( n ) ( 1 + T − γ T γ ) \mathbb{E}[T_{A_\gamma}(n)^\gamma] \le\operatorname{poly}(n)(1+T^{-\gamma}T^\gamma) E [ T A γ ( n ) γ ] ≤ poly ( n ) ( 1 + T − γ T γ ) , A γ A_\gamma A γ stores one label and a counter, and P A γ ( W R ( n ) ∣ n ) ≥ T − γ / 2 P_{A_\gamma}(W_R(n)\mid n) \ge T^{-\gamma}/2 P A γ ( W R ( n ) ∣ n ) ≥ T − γ /2 .
If Q ∈ S a R Q \in S_a^R Q ∈ S a R with E [ T Q ( n ) c ] ≤ C ( n + 2 ) c \mathbb{E}[T_Q(n)^c] \le C(n+2)^c E [ T Q ( n ) c ] ≤ C ( n + 2 ) c , Markov’s inequality gives
P Q ( W R ( n ) ∣ n ) P A γ ( W R ( n ) ∣ n ) β ≤ 2 β T β γ ( 2 − n / 2 + 2 a C ( n + 2 ) c T − a ) = 2 β 2 β γ h − n / 2 + 2 a + β C ( n + 2 ) c 2 − ( a − β γ ) h , \frac{P_Q(W_R(n)\mid n)}{P_{A_\gamma}(W_R(n)\mid n)^\beta}
\le2^\beta T^{\beta\gamma}\left(2^{-n/2}+2^aC(n+2)^cT^{-a}\right)
=2^\beta2^{\beta\gamma h-n/2}+2^{a+\beta}C(n+2)^c2^{-(a-\beta\gamma)h}, P A γ ( W R ( n ) ∣ n ) β P Q ( W R ( n ) ∣ n ) ≤ 2 β T β γ ( 2 − n /2 + 2 a C ( n + 2 ) c T − a ) = 2 β 2 β γ h − n /2 + 2 a + β C ( n + 2 ) c 2 − ( a − β γ ) h ,
and both terms are at most 2 − δ n / 2 2^{-\delta\sqrt{n}}/2 2 − δ n /2 at large n n n for δ < min { 1 , a − β γ } \delta< \min\{1,a-\beta\gamma\} δ < min { 1 , a − β γ } , since h = ⌊ n ⌋ h=\lfloor\sqrt n\rfloor h = ⌊ n ⌋ .
For 0 < r ≤ 1 0<r\le1 0 < r ≤ 1 and a > r a>r a > r , choose a rational γ \gamma γ with r ≤ γ ≤ 1 r\le\gamma\le1 r ≤ γ ≤ 1 and γ < a \gamma<a γ < a , taking γ = 1 \gamma=1 γ = 1 if r = 1 r=1 r = 1 ; then A γ ∈ S γ R ⊆ S r R A_\gamma\in S_\gamma^R\subseteq S_r^R A γ ∈ S γ R ⊆ S r R is dominated by no sampler of order a a a , so U R ( r ) ≤ r U^R(r)\le r U R ( r ) ≤ r , and Theorem 3.4 gives the reverse inequality. For the power, B ( a , r ) = a / r B(a,r)=a/r B ( a , r ) = a / r when a > r a>r a > r ; for 1 ≤ β < a / r 1\le\beta<a/r 1 ≤ β < a / r choose a rational γ ∈ ( r , a / β ) \gamma\in(r,a/\beta) γ ∈ ( r , a / β ) , and Theorem 3.3 gives the upper bound. For r > 1 r>1 r > 1 , S r R ⊆ S 1 R S_r^R\subseteq S_1^R S r R ⊆ S 1 R gives U R ( r ) ≥ 1 U^R(r)\ge1 U R ( r ) ≥ 1 , and rational γ ↓ r \gamma\downarrow r γ ↓ r gives U R ( r ) ≤ r U^R(r)\le r U R ( r ) ≤ r .
A sequential-hardness hypothesis
The argument uses the random oracle only through Theorem 8.1. Without an oracle, the chain is replaced by an iterated function whose starting point is computable from n n n alone.
Definition 8.3. A public chain consists of polynomial-time computable maps n ↦ x 0 ( n ) ∈ { 0 , 1 } m ( n ) n\mapsto x_0(n)\in\{0,1\}^{m(n)} n ↦ x 0 ( n ) ∈ { 0 , 1 } m ( n ) and ( 1 n , x ) ↦ f n ( x ) ∈ { 0 , 1 } m ( n ) (1^n,x)\mapsto f_n(x)\in\{0,1\}^{m(n)} ( 1 n , x ) ↦ f n ( x ) ∈ { 0 , 1 } m ( n ) , with n ≤ m ( n ) ≤ poly ( n ) n\le m(n)\le\operatorname{poly}(n) n ≤ m ( n ) ≤ poly ( n ) . With T ( n ) = 2 ⌊ n ⌋ T(n)=2^{\lfloor\sqrt n\rfloor} T ( n ) = 2 ⌊ n ⌋ , its terminal W ( n ) W(n) W ( n ) is the first n n n bits of f n T ( n ) ( x 0 ( n ) ) f_n^{T(n)}(x_0(n)) f n T ( n ) ( x 0 ( n )) . The chain is sequentially hard if for every probabilistic machine M M M , every δ ∈ ( 0 , 1 ) \delta\in(0,1) δ ∈ ( 0 , 1 ) and every polynomial p p p there are infinitely many n n n with
Pr [ M ( 1 n ) outputs W ( n ) within T ( n ) 1 − δ steps ] ≤ 1 p ( n ) T ( n ) . \Pr\left[M(1^n)\text{ outputs }W(n)\text{ within }T(n)^{1-\delta}\text{ steps}\right]\le\frac{1}{p(n)T(n)}. Pr [ M ( 1 n ) outputs W ( n ) within T ( n ) 1 − δ steps ] ≤ p ( n ) T ( n ) 1 .
The hypothesis asks for no polynomial speedup in total time on one public instance per length, and only at the scale 1 / T ( n ) = 2 − ⌊ n ⌋ 1/T(n)=2^{-\lfloor\sqrt n\rfloor} 1/ T ( n ) = 2 − ⌊ n ⌋ , far above the probability 2 − n 2^{-n} 2 − n of guessing an n n n -bit terminal, and only at infinitely many lengths. By Theorem 8.1 and the argument above, an iterated random function has this property with probability 1. Natural candidates without an oracle are iterated hashing with a standard hash function, and repeated squaring in the class group of an imaginary quadratic field whose discriminant is computed from n n n , as in verifiable delay functions without trusted setup [30 , 4 ] . The instance must be computable from n n n alone, and computing it must not reveal a shortcut. This rules out the time-lock puzzles of [23 ] , whose modulus would be factored by its own derivation, and it is the reason why a puzzle that comes with a trapdoor does not help: the candidate receives only 1 n 1^n 1 n , but whoever can derive the instance can derive the trapdoor. Standard sequentiality assumptions for verifiable delay functions bound parallel time on random instances; Theorem 8.3 bounds sequential time on fixed instances with a smaller success threshold. We know of no implication either way; § 8.3 shows that the parallel form also suffices once the seeds are short.
Theorem 8.4 (The threshold for expected-time sources from sequential hardness). Assume that some public chain is sequentially hard. Then for every rational γ ∈ ( 0 , 1 ] \gamma\in(0,1] γ ∈ ( 0 , 1 ] there is A γ ∈ S γ ∩ W A_\gamma\in\mathcal{S}_\gamma\cap\mathcal{W} A γ ∈ S γ ∩ W with worst-case runtime 2 n 2^n 2 n that no sampler of any order a > γ a > \gamma a > γ polynomially dominates. Consequently U ( r ) = r U(r)=r U ( r ) = r for every real 0 < r ≤ 1 0 < r \le1 0 < r ≤ 1 , with the supremum attained at rational r r r . In particular the sampler Q 1 Q_1 Q 1 of Theorem 3.4 is universal for S 1 \mathcal{S}_1 S 1 , while no sampler with polynomial a a a th moment for any a > 1 a > 1 a > 1 is, and one source A 1 ∈ S 1 A_1 \in\mathcal{S}_1 A 1 ∈ S 1 defeats all of them.
Proof. A γ A_\gamma A γ outputs 0 n 0^n 0 n unless ⌈ γ ⌊ n ⌋ ⌉ \lceil\gamma\lfloor\sqrt{n}\rfloor\rceil ⌈ γ ⌊ n ⌋⌉ coins are all zero, and then computes f n T ( x 0 ( n ) ) f_n^T(x_0(n)) f n T ( x 0 ( n )) in time T poly ( n ) T^{\operatorname{poly}}(n) T poly ( n ) and space poly ( n ) \operatorname{poly}(n) poly ( n ) and outputs W ( n ) W(n) W ( n ) . As in Theorem 8.2 , A γ ∈ S γ ∩ W A_\gamma\in\mathcal{S}_\gamma\cap\mathcal{W} A γ ∈ S γ ∩ W and P A γ ( W ( n ) ∣ n ) ≥ T − γ / 2 P_{A_\gamma}(W(n)\mid n)\ge T^{-\gamma}/2 P A γ ( W ( n ) ∣ n ) ≥ T − γ /2 . Let Q Q Q have E [ T Q ( n ) a ] ≤ C ( n + 2 ) c \mathbb{E}[T_Q(n)^a]\le C(n+2)^c E [ T Q ( n ) a ] ≤ C ( n + 2 ) c with a > γ a>\gamma a > γ , choose δ ∈ ( 0 , 1 ) \delta\in(0,1) δ ∈ ( 0 , 1 ) with a ( 1 − δ ) > γ a(1-\delta)>\gamma a ( 1 − δ ) > γ , and let C ′ , c ′ C',c' C ′ , c ′ be given. Apply Theorem 8.3 to M = Q M=Q M = Q , this δ \delta δ and p ( n ) = 4 C ′ ( n + 2 ) c ′ p(n)=4C'(n+2)^{c'} p ( n ) = 4 C ′ ( n + 2 ) c ′ . At each of the infinitely many lengths it provides, Markov’s inequality at T 1 − δ T^{1-\delta} T 1 − δ gives
P Q ( W ( n ) ∣ n ) ≤ 1 p ( n ) T + C ( n + 2 ) c T − a ( 1 − δ ) ≤ 2 p ( n ) T γ ≤ P A γ ( W ( n ) ∣ n ) C ′ ( n + 2 ) c ′ P_Q(W(n)\mid n)\le\frac{1}{p(n)T}+C(n+2)^cT^{-a(1-\delta)}\le\frac{2}{p(n)T^\gamma}\le\frac{P_{A_\gamma}(W(n)\mid n)}{C'(n+2)^{c'}} P Q ( W ( n ) ∣ n ) ≤ p ( n ) T 1 + C ( n + 2 ) c T − a ( 1 − δ ) ≤ p ( n ) T γ 2 ≤ C ′ ( n + 2 ) c ′ P A γ ( W ( n ) ∣ n )
for large n n n , because T a ( 1 − δ ) − γ T^{a(1-\delta)-\gamma} T a ( 1 − δ ) − γ grows faster than every polynomial. So Q Q Q does not dominate A γ A_\gamma A γ . For 0 < r < 1 0<r<1 0 < r < 1 and a > r a>r a > r use a rational γ ∈ ( r , min { a , 1 } ) \gamma\in(r,\min\{a,1\}) γ ∈ ( r , min { a , 1 }) , and for r = 1 r=1 r = 1 use γ = 1 \gamma=1 γ = 1 ; the lower bound and attainment are Theorem 3.4 .
For a general public chain, the hypothesis of Theorem 8.4 is not known to imply P ≠ N P \mathrm{P}\ne\mathrm{NP} P = NP . For repeated squaring in a group of order at most 2 poly ( n ) 2^{\operatorname{poly}(n)} 2 poly ( n ) it implies more. Any d ≥ 1 d\ge1 d ≥ 1 with g d = 1 g^d=1 g d = 1 determines g 2 T = g 2 T m o d d g^{2^T}=g^{2^T\bmod d} g 2 T = g 2 T mod d , since the order of g g g divides d d d , and the order itself has a unique certificate: d d d with its prime factorization, checked by deterministic primality tests [2 ] , by g d = 1 g^d=1 g d = 1 and by g d / p ≠ 1 g^{d/p}\ne1 g d / p = 1 for each prime factor p p p . So the tally language { 1 n 2 + i : 1 ≤ i ≤ n , W ( n ) i = 1 } \{1^{n^2+i}:1\le i\le n,\ W(n)_i=1\} { 1 n 2 + i : 1 ≤ i ≤ n , W ( n ) i = 1 } lies in U P ∩ c o U P \mathrm{UP}\cap\mathrm{coUP} UP ∩ coUP , and sequential hardness puts it outside B P P \mathrm{BPP} BPP , since a fast solver would recover W ( n ) W(n) W ( n ) bit by bit. Its binary version lies in ( U E ∩ c o U E ) ∖ B P E (\mathrm{UE}\cap\mathrm{coUE})\setminus\mathrm{BPE} ( UE ∩ coUE ) ∖ BPE , so E ≠ U E \mathrm{E}\ne\mathrm{UE} E = UE and in particular E ≠ N E \mathrm{E}\ne\mathrm{NE} E = NE ; compare Hartmanis, Immerman and Sewelson [11 ] . The theorem is consistent with Theorem 7.9 , which gives only 1 ≤ U ( 1 ) ≤ C 1\le U(1)\le C 1 ≤ U ( 1 ) ≤ C unless P = N P \mathrm{P}=\mathrm{NP} P = NP . If the hypothesis holds at all large lengths, the conclusion holds at all large lengths, so domination fails even infinitely often. If the success threshold 1 / ( p ( n ) T ( n ) ) 1/(p(n)T(n)) 1/ ( p ( n ) T ( n )) is replaced by T ( n ) − κ T(n)^{-\kappa} T ( n ) − κ for every fixed κ \kappa κ , the argument of Theorem 8.2 also gives the exact power profile B ∗ ( a , r ) = B ( a , r ) B_*(a,r)=B(a,r) B ∗ ( a , r ) = B ( a , r ) for r ≤ 1 r\le1 r ≤ 1 . For r > 1 r>1 r > 1 and sources with all moments, the oracle constructions remain the only evidence; for solvers see § 8.4 .
Verifiable delay functions with short seeds
Theorem 8.3 asks for hardness of one fixed instance per length against sequential algorithms at success probability 1 / ( p ( n ) T ( n ) ) 1/(p(n)T(n)) 1/ ( p ( n ) T ( n )) . Security notions for verifiable delay functions [4 , 30 , 22 ] instead bound the success of parallel algorithms on random instances, requiring it to be negligible. Constant success of parallel algorithms suffices for us, if the random instance comes from a short seed. The reduction below reruns the candidate until it hits a given seed, which takes about 2 β ℓ T β 2^{\beta\ell T^\beta} 2 β ℓ T β processors when the power is β \beta β ; this needs only ℓ = O ( log T ) \ell=O(\log T) ℓ = O ( log T ) , which suffices for the threshold (β = 1 \beta= 1 β = 1 ). For powers β > 1 \beta> 1 β > 1 a counting step loses a factor 2 ( β − 1 ) ℓ 2^{(\beta-1)\ell} 2 ( β − 1 ) ℓ , which must be T o ( 1 ) T^{o(1)} T o ( 1 ) , and this is why Theorem 8.5 asks for ℓ = o ( log T ) \ell= o(\log T) ℓ = o ( log T ) . We do not know whether short seeds are needed in general. A parallel algorithm here is a uniform probabilistic algorithm that runs some number of processors in synchronous steps; its parallel time is the number of steps.
Definition 8.5. Let τ ( n ) ≤ poly ( n ) \tau(n) \le\operatorname{poly}(n) τ ( n ) ≤ poly ( n ) and ℓ ( n ) \ell(n) ℓ ( n ) be computable in polynomial time, with τ ( n ) / log n → ∞ \tau(n)/\log n \to\infty τ ( n ) / log n → ∞ and ℓ ( n ) / τ ( n ) → 0 \ell(n)/\tau(n) \to0 ℓ ( n ) / τ ( n ) → 0 , and put T ( n ) = 2 τ ( n ) T(n) = 2^{\tau(n)} T ( n ) = 2 τ ( n ) . A short-seed delay function consists of a deterministic algorithm Eval and a polynomial-time algorithm Verify such that, for every seed s ∈ { 0 , 1 } ℓ ( n ) s \in\{0,1\}^{\ell(n)} s ∈ { 0 , 1 } ℓ ( n ) , Eval(1 n , s 1^n,s 1 n , s ) runs in time T ( n ) poly ( n ) T(n)\operatorname{poly}(n) T ( n ) poly ( n ) and space poly ( n ) \operatorname{poly}(n) poly ( n ) and outputs ( y ( s ) , π ( s ) ) (y(s),\pi(s)) ( y ( s ) , π ( s )) with Verify(1 n , s , y ( s ) , π ( s ) ) = 1 1^n,s,y(s),\pi(s)) = 1 1 n , s , y ( s ) , π ( s )) = 1 , and the padded encoding x s = ⟨ s , y ( s ) , π ( s ) ⟩ x_s = \langle s,y(s),\pi(s)\rangle x s = ⟨ s , y ( s ) , π ( s )⟩ lies in { 0 , 1 } n ∖ { 0 n } \{0,1\}^n \setminus\{0^n\} { 0 , 1 } n ∖ { 0 n } . It is parallel sequential if:
(a) for every δ ∈ ( 0 , 1 ) \delta\in(0,1) δ ∈ ( 0 , 1 ) and every parallel algorithm A \mathcal{A} A that on input ( 1 n , s ) (1^n,s) ( 1 n , s ) uses at most T ( n ) O ( 1 ) T(n)^{O(1)} T ( n ) O ( 1 ) processors and parallel time at most T ( n ) 1 − δ T(n)^{1-\delta} T ( n ) 1 − δ , there are infinitely many n n n with Pr s , A [ A ( 1 n , s ) = y ( s ) ] < 1 / 2 \Pr_{s,\mathcal{A}}[\mathcal{A}(1^n,s) = y(s)] < 1/2 Pr s , A [ A ( 1 n , s ) = y ( s )] < 1/2 , for s s s uniform in { 0 , 1 } ℓ ( n ) \{0,1\}^{\ell(n)} { 0 , 1 } ℓ ( n ) ;
(b) for every probabilistic algorithm B B B with total work T ( n ) O ( 1 ) T(n)^{O(1)} T ( n ) O ( 1 ) , Pr s , B [ B ( 1 n , s ) = ( y ′ , π ′ ) , y ′ ≠ y ( s ) , Verify ( 1 n , s , y ′ , π ′ ) = 1 ] → 0 \Pr_{s,B}[B(1^n,s) = (y',\pi'),\ y' \ne y(s),\ \operatorname{Verify}(1^n,s,y',\pi') = 1] \to0 Pr s , B [ B ( 1 n , s ) = ( y ′ , π ′ ) , y ′ = y ( s ) , Verify ( 1 n , s , y ′ , π ′ ) = 1 ] → 0 as n → ∞ n \to\infty n → ∞ .
The adversary in (a) starts from ( 1 n , s ) (1^n,s) ( 1 n , s ) ; there is no preprocessing phase before s s s is drawn. This is the point where Theorem 8.5 departs from the standard definition [4 ] , which allows precomputation for time polynomial in T T T : with only 2 ℓ = T o ( 1 ) 2^\ell= T^{o(1)} 2 ℓ = T o ( 1 ) seeds, such a precomputation could tabulate every answer. Our candidates receive only 1 n 1^n 1 n and pay for every step, so the version without preprocessing is the relevant one.
Theorem 8.6 (The threshold and the power frontier from short-seed delay functions). Assume a parallel sequential short-seed delay function. Then for every rational γ ∈ ( 0 , 1 ] \gamma\in(0,1] γ ∈ ( 0 , 1 ] there is A γ ∈ S γ ∩ W A_\gamma\in S_\gamma\cap W A γ ∈ S γ ∩ W with worst-case runtime T ( n ) poly ( n ) T(n)\operatorname{poly}(n) T ( n ) poly ( n ) such that for every real a > γ a > \gamma a > γ , every β ∈ [ 1 , a / γ ) \beta\in[1,a/\gamma) β ∈ [ 1 , a / γ ) and every Q ∈ S a Q \in S_a Q ∈ S a , Q Q Q does not dominate A γ A_\gamma A γ with power β \beta β . Consequently U ( r ) = r U(r) = r U ( r ) = r for every real 0 < r ≤ 1 0 < r \le1 0 < r ≤ 1 , and for all real a > 0 a > 0 a > 0 and 0 < r ≤ 1 0 < r \le1 0 < r ≤ 1 no sampler in S a S_a S a dominates every member of S r S_r S r with power below B ( a , r ) B(a,r) B ( a , r ) . If (a) holds at all large n n n , every failure occurs at all large lengths.
Proof. A γ A_\gamma A γ outputs 0 n 0^n 0 n unless ⌈ γ τ ( n ) ⌉ \lceil\gamma\tau(n)\rceil ⌈ γ τ ( n )⌉ coins are all zero; then it draws s s s uniformly from { 0 , 1 } ℓ \{0,1\}^{\ell} { 0 , 1 } ℓ , computes Eval(1 n , s 1^n,s 1 n , s ) and outputs x s x_s x s . So A γ ∈ S γ ∩ W A_\gamma\in S_\gamma\cap W A γ ∈ S γ ∩ W , and P A γ ( x s ∣ n ) ≥ 2 − ℓ T − γ / 2 P_{A_\gamma}(x_s \mid n) \ge2^{-\ell T^{-\gamma/2}} P A γ ( x s ∣ n ) ≥ 2 − ℓ T − γ /2 for every seed s s s ; the strings x s x_s x s are distinct.
Let E [ T Q ( n ) a ] ≤ C ( n + 2 ) c \mathbb{E}[T_Q(n)^a] \le C(n+2)^c E [ T Q ( n ) a ] ≤ C ( n + 2 ) c , and suppose that P Q ( x ∣ n ) ≥ P A γ ( x ∣ n ) β / ( C ′ ( n + 2 ) c ) P_Q(x \mid n) \ge P_{A_\gamma}(x \mid n)^\beta/(C'(n+2)^c) P Q ( x ∣ n ) ≥ P A γ ( x ∣ n ) β / ( C ′ ( n + 2 ) c ) for all x x x at some large n n n . Put θ = 2 − β ℓ T − β γ / 2 / ( 2 β + 1 ) C ′ ( n + 2 ) c \theta= 2^{-\beta\ell T^{-\beta\gamma/2}/(2^\beta+1)C'(n+2)^c} θ = 2 − β ℓ T − β γ /2 / ( 2 β + 1 ) C ′ ( n + 2 ) c , so P Q ( x s ∣ n ) ≥ 2 θ P_Q(x_s \mid n) \ge2\theta P Q ( x s ∣ n ) ≥ 2 θ for every s s s , and choose rationals δ ∈ ( 0 , 1 ) \delta\in(0,1) δ ∈ ( 0 , 1 ) and κ \kappa κ with β γ < κ < a ( 1 − δ ) \beta\gamma< \kappa< a(1-\delta) β γ < κ < a ( 1 − δ ) . Write q l o n g ( s ) q_{\mathrm{long}}(s) q long ( s ) for the probability that Q ( 1 n ) Q(1^n) Q ( 1 n ) outputs x s x_s x s after running for at least T 1 − δ T^{1-\delta} T 1 − δ steps. These events are disjoint, so Markov’s inequality gives ∑ s q l o n g ( s ) ≤ C ( n + 2 ) c T − δ ( 1 − δ ) \sum_s q_{\mathrm{long}}(s) \le C(n+2)^cT^{-\delta(1-\delta)} ∑ s q long ( s ) ≤ C ( n + 2 ) c T − δ ( 1 − δ ) , and the number of seeds with q l o n g ( s ) > θ q_{\mathrm{long}}(s) > \theta q long ( s ) > θ is at most
C ( n + 2 ) c θ T a ( 1 − δ ) = 2 β + 1 C C ′ ( n + 2 ) c + c ′ 2 β ℓ T β γ − a ( 1 − δ ) ≤ 2 ℓ / 8 \frac{C(n+2)^c}{\theta T^{a(1-\delta)}} = 2^{\beta+1}CC'(n+2)^{c+c'}2^{\beta\ell}T^{\beta\gamma-a(1-\delta)} \le2^\ell/8 θ T a ( 1 − δ ) C ( n + 2 ) c = 2 β + 1 C C ′ ( n + 2 ) c + c ′ 2 β ℓ T β γ − a ( 1 − δ ) ≤ 2 ℓ /8
for large n n n , because 2 ( β − 1 ) ℓ ( n + 2 ) c + c ′ = T o ( 1 ) 2^{(\beta-1)\ell}(n+2)^{c+c'} = T^{o(1)} 2 ( β − 1 ) ℓ ( n + 2 ) c + c ′ = T o ( 1 ) . For the other seeds, at least 7 / 8 7/8 7/8 of all, a run of Q Q Q truncated at T 1 − δ T^{1-\delta} T 1 − δ steps outputs x s x_s x s with probability at least θ \theta θ .
Let A ( 1 n , s ) \mathcal{A}(1^n,s) A ( 1 n , s ) run K = 2 κ τ ( n ) ≤ 2 T κ K = 2^{\kappa\tau(n)} \le2T^\kappa K = 2 κ τ ( n ) ≤ 2 T κ independent copies of Q ( 1 n ) Q(1^n) Q ( 1 n ) , each truncated at $2^{\lceil(1-\delta)\tau(n)\rceil}$ steps, one per processor. A processor whose run halts with an output of the form ⟨ s , y ′ , π ′ ⟩ \langle s,y',\pi'\rangle ⟨ s , y ′ , π ′ ⟩ and Verify(1 n , s , y ′ , π ′ ) = 1 m a r k s 1^n,s,y',\pi') = 1 marks 1 n , s , y ′ , π ′ ) = 1 ma r k s (y',\pi')$, and A \mathcal{A} A selects the mark of the least-indexed marking processor, found by a tree of depth O ( log K ) O(\log K) O ( log K ) , and outputs its first component. Only the rationals κ \kappa κ and δ \delta δ enter A \mathcal{A} A ; it does not use β \beta β or the domination polynomial. Its parallel time is T 1 − δ poly ( n ) ≤ T 1 − δ / 2 T^{1-\delta}\operatorname{poly}(n) \le T^{1-\delta/2} T 1 − δ poly ( n ) ≤ T 1 − δ /2 . Since K θ = T κ − β γ 2 − β ℓ / poly ( n ) = T κ − β γ − o ( 1 ) → ∞ K\theta= T^{\kappa-\beta\gamma}2^{-\beta\ell}/\operatorname{poly}(n) = T^{\kappa-\beta\gamma-o(1)} \to\infty K θ = T κ − β γ 2 − β ℓ / poly ( n ) = T κ − β γ − o ( 1 ) → ∞ , for a good seed some copy outputs x s x_s x s , and so some processor marks ( y ( s ) , π ( s ) ) (y(s),\pi(s)) ( y ( s ) , π ( s )) , with probability at least 1 − e − K θ = 1 − o ( 1 ) 1-e^{-K\theta}=1-o(1) 1 − e − K θ = 1 − o ( 1 ) . Let B B B simulate A \mathcal{A} A sequentially and return the selected pair. Its total work is K T 1 − δ poly ( n ) = T O ( 1 ) KT^{1-\delta}\operatorname{poly}(n)=T^{O(1)} K T 1 − δ poly ( n ) = T O ( 1 ) , so by (b) the selected pair is false with probability o ( 1 ) o(1) o ( 1 ) ; no union bound over processors is needed. Hence Pr s , A [ A ( 1 n , s ) = y ( s ) ] ≥ 7 8 − o ( 1 ) > 1 / 2 \Pr_{s,\mathcal{A}}[\mathcal{A}(1^n,s)=y(s)]\geq\frac{7}{8}-o(1)>1/2 Pr s , A [ A ( 1 n , s ) = y ( s )] ≥ 8 7 − o ( 1 ) > 1/2 at every large n n n where Q Q Q dominates A γ A_\gamma A γ with power β \beta β . By (a) applied with δ / 2 \delta/2 δ /2 , this fails at infinitely many n n n , and at all large n n n if (a) holds there.
For the consequences, the matching positive results are Theorems 3.3 and 3.4. Given real 0 < r ≤ 1 0<r\leq1 0 < r ≤ 1 , a > r a>r a > r and β < a / r = B ( a , r ) \beta<a/r=B(a,r) β < a / r = B ( a , r ) , use a rational γ ∈ ( r , min { 1 , a / β } ) \gamma\in(r,\min\{1,a/\beta\}) γ ∈ ( r , min { 1 , a / β }) if r < 1 r<1 r < 1 , and γ = 1 \gamma=1 γ = 1 if r = 1 r=1 r = 1 ; then A γ ∈ S r A_\gamma\in S_r A γ ∈ S r and β < a / γ \beta<a/\gamma β < a / γ . With β = 1 \beta=1 β = 1 this gives U ( r ) ≤ r U(r)\leq r U ( r ) ≤ r .
A conjectural candidate is repeated squaring in class groups: hash the seed to a discriminant of about n / 3 n/3 n /3 bits and a base element, take τ ( n ) = ⌊ n c ⌋ \tau(n)=\lfloor n^c\rfloor τ ( n ) = ⌊ n c ⌋ with c < 1 / 2 c<1/2 c < 1/2 , so that the best known algorithms for the class number, which take time 2 Θ ( n log n ) 2^{\Theta(\sqrt{n\log n})} 2 Θ ( n l o g n ) heuristically, are slower than T O ( 1 ) T^{O(1)} T O ( 1 ) , and attach Wesolowski’s proof [30 ] . Its published soundness analysis is in the random oracle model, under the adaptive root assumption; for a fixed hash and this short-seed ensemble, both conditions of Theorem 8.5 remain assumptions, although (b) only asks for vanishing soundness error. As far as we know, neither Theorem 8.3 nor Theorem 8.5 implies the other.
An explicit problem on the solver frontier
For r ≤ 1 r\leq1 r ≤ 1 , the source of Theorem 8.4 can be turned into an explicit decision problem in U P ∩ c o U P \mathrm{UP}\cap\mathrm{coUP} UP ∩ coUP whose solvers need moment order v r / a vr/a v r / a , which is the exact exponent q ∗ ( a , r , v ) q^*(a,r,v) q ∗ ( a , r , v ) of Theorem 6.10 when r ≤ a r\leq a r ≤ a , under a stronger form of sequential hardness for repeated squaring. The verification table of Section 5.5 is replaced by the bits of a second squaring chain that starts at the first terminal. A solver that is correct on every input reconstructs the whole second output from polynomially many bit queries, so no hard-core predicate is needed. A fast but only computationally sound proof lets a decider discard most inputs cheaply, and exact certificates come from the group structure.
Definition 8.7. Let 0 < v ≤ a 0<v\leq a 0 < v ≤ a be rationals, h = ⌊ n ⌋ h=\lfloor\sqrt{n}\rfloor h = ⌊ n ⌋ , T ( n ) = 2 h T(n)=2^h T ( n ) = 2 h and H ( n ) = 2 ⌊ ( a / v ) h ⌋ H(n)=2^{\lfloor(a/v)h\rfloor} H ( n ) = 2 ⌊( a / v ) h ⌋ , so T ≤ H ≤ T a / v T\leq H\leq T^{a/v} T ≤ H ≤ T a / v . A certified two-stage chain consists of the following, all computable in polynomial time from 1 n 1^n 1 n or from the displayed inputs.
Groups G n G_n G n of order at most 2 poly ( n ) 2^{\operatorname{poly}(n)} 2 poly ( n ) with canonical encodings, membership, multiplication, equality and identity, and an element g n g_n g n . Put W ( n ) = g n 2 T ( n ) W(n)=g_n^{2^{T(n)}} W ( n ) = g n 2 T ( n ) , and let Y ( n ) ∈ { 0 , 1 } m ( n ) Y(n)\in\{0,1\}^{m(n)} Y ( n ) ∈ { 0 , 1 } m ( n ) , 1 ≤ m ( n ) ≤ n 1\leq m(n)\leq n 1 ≤ m ( n ) ≤ n , be the first m ( n ) m(n) m ( n ) bits of the encoding of W ( n ) 2 H ( n ) W(n)^{2^{H(n)}} W ( n ) 2 H ( n ) .
A canonical proof π ( n ) \pi(n) π ( n ) , computable from 1 n 1^n 1 n in time T ( n ) poly ( n ) T(n)\operatorname{poly}(n) T ( n ) poly ( n ) and space poly ( n ) \operatorname{poly}(n) poly ( n ) , and also in polynomial time from any d ≥ 1 d\geq1 d ≥ 1 with g n d = 1 g_n^d=1 g n d = 1 ; and a filter V ( 1 n , w , π ) V(1^n,w,\pi) V ( 1 n , w , π ) that accepts ( W ( n ) , π ( n ) ) (W(n),\pi(n)) ( W ( n ) , π ( n )) . The filter need not be sound.
A padded encoding z n , i ∈ { 0 , 1 } n z_{n,i}\in\{0,1\}^n z n , i ∈ { 0 , 1 } n of ( w , π , i ) (w,\pi,i) ( w , π , i ) for 1 ≤ i ≤ m ( n ) 1\leq i\leq m(n) 1 ≤ i ≤ m ( n ) . Let F n F_n F n be the set of encodings of triples with V ( 1 n , w , π ) = 1 V(1^n,w,\pi)=1 V ( 1 n , w , π ) = 1 .
The chain is tightly sequential if for every probabilistic machine M M M :
(a) there is a polynomial q M q_M q M such that, for all large n n n , the probability that M ( 1 n ) M(1^n) M ( 1 n ) outputs an element of F n F_n F n within T ( n ) / q M ( n ) T(n)/q_M(n) T ( n ) / q M ( n ) steps is at most T ( n ) − a T(n)^{-a} T ( n ) − a ;
(b) for every δ ∈ ( 0 , 1 ) \delta\in(0,1) δ ∈ ( 0 , 1 ) there are infinitely many n n n at which M ( 1 n , W ( n ) , π ( n ) ) M(1^n,W(n),\pi(n)) M ( 1 n , W ( n ) , π ( n )) outputs Y ( n ) Y(n) Y ( n ) within H ( n ) 1 − δ H(n)^{1-\delta} H ( n ) 1 − δ steps with probability less than 1 / 2 1/2 1/2 .
Condition (b) is sequential hardness of the second chain with the first record given for free, at any polynomial speedup. Condition (a) is much stronger than Theorem 8.3: it fixes the delay T ( n ) T(n) T ( n ) up to polynomial factors, holds at every large length, covers every record that passes the filter, false proofs included, and asks for success probability below T − a T^{-a} T − a . By the padding example recorded in Section 10, Theorem 8.3 does not give it in general. A natural candidate is the class group of an imaginary quadratic order whose discriminant, of Θ ( n ) \Theta(n) Θ ( n ) bits, is computed from n n n , with the proof of Wesolowski [30 ] , a single group element, and challenges computed deterministically from the transcript; the group encoding is a small enough constant fraction of n n n that the record fits in n n n bits. Pietrzak’s proof [22 ] has Θ ( log T ) \Theta(\log T) Θ ( log T ) group elements and would need a different calibration. Given an annihilator d d d , every element of the proof lies in ⟨ g n ⟩ \langle g_n\rangle ⟨ g n ⟩ and its exponent can be reduced modulo d d d , as required in item 2; for Wesolowski’s quotient ⌊ 2 T / ℓ ⌋ \lfloor2^T/\ell\rfloor ⌊ 2 T / ℓ ⌋ , reduce 2 T 2^T 2 T modulo ℓ d \ell d ℓ d . The best known way to obtain an annihilator is to compute the class number, which known algorithms do in time 2 Θ ( n log n ) 2^{\Theta(\sqrt{n\log n})} 2 Θ ( n l o g n ) heuristically, more than H ( n ) H(n) H ( n ) for large n n n . This is an estimate for known attacks, not a lower bound, and tight sequentiality remains an assumption.
The proof below uses condition (a) only through its consequence that Pr [ Q ( 1 n ) ∈ F n ] ≤ poly Q ( n ) T ( n ) − a \Pr[Q(1^n) \in F_n] \le\operatorname{poly}_Q(n)T(n)^{-a} Pr [ Q ( 1 n ) ∈ F n ] ≤ poly Q ( n ) T ( n ) − a for every Q ∈ S a Q \in S_a Q ∈ S a . For a ≤ 1 a \le1 a ≤ 1 this consequence has a natural equivalent form.
Proposition 8.8. Let R n ⊂ { 0 , 1 } n R_n \subset\{0,1\}^n R n ⊂ { 0 , 1 } n be recognizable in polynomial time, let S ( n ) = 2 s ( n ) S(n)=2^{s(n)} S ( n ) = 2 s ( n ) with s ( n ) ≤ poly ( n ) s(n)\le\operatorname{poly}(n) s ( n ) ≤ poly ( n ) computable in polynomial time, and let 0 < a ≤ 1 0<a\le1 0 < a ≤ 1 be rational. The following are equivalent.
For every Q ∈ S a Q\in S_a Q ∈ S a there is c c c with Pr [ Q ( 1 n ) ∈ R n ] ≤ ( n + 2 ) c S ( n ) − a \Pr[Q(1^n)\in R_n]\le(n+2)^cS(n)^{-a} Pr [ Q ( 1 n ) ∈ R n ] ≤ ( n + 2 ) c S ( n ) − a for all large n n n .
For every probabilistic machine B B B there is c c c such that, for all large n n n , B ( 1 n ) B(1^n) B ( 1 n ) outputs an element of R n R_n R n within S ( n ) / ( n + 2 ) c S(n)/(n+2)^c S ( n ) / ( n + 2 ) c steps with probability less than 1 / 2 1/2 1/2 .
The implication from 1 to 2 holds for every rational a > 0 a>0 a > 0 .
Proof. Assume 1 and fix B B B . The sampler Q B Q_B Q B chooses j ∈ { 0 , … , s ( n ) } j\in\{0,\ldots,s(n)\} j ∈ { 0 , … , s ( n )} with probability at least 1 / ( 2 s ( n ) + 2 ) 1/(2s(n)+2) 1/ ( 2 s ( n ) + 2 ) , passes a gate of probability 2 − ⌈ a j ⌉ 2^{-\lceil aj\rceil} 2 − ⌈ aj ⌉ , and then runs B B B for 2 j 2^j 2 j steps, outputting its result. Then Q B ∈ S a Q_B\in S_a Q B ∈ S a , and if B B B succeeds within t = 2 j t=2^j t = 2 j steps with probability p p p , then Pr [ Q B ∈ R n ] ≥ p t − a / poly ( n ) \Pr[Q_B\in R_n]\ge pt^{-a}/\operatorname{poly}(n) Pr [ Q B ∈ R n ] ≥ p t − a / poly ( n ) . Hence p ≤ poly ( n ) ( t / S ) a p\le\operatorname{poly}(n)(t/S)^a p ≤ poly ( n ) ( t / S ) a , which is below 1 / 2 1/2 1/2 for t ≤ S / ( n + 2 ) c t\le S/(n+2)^c t ≤ S / ( n + 2 ) c with c c c large. Conversely, assume 2, fix Q Q Q with E [ T Q ] ≤ poly ( n ) \mathbb{E}[T_Q]\le\operatorname{poly}(n) E [ T Q ] ≤ poly ( n ) and put q = Pr [ Q ( 1 n ) ∈ R n ] q=\Pr[Q(1^n)\in R_n] q = Pr [ Q ( 1 n ) ∈ R n ] . The machine B Q B_Q B Q reruns Q Q Q until the output lies in R n R_n R n . By subadditivity of the a a a th power, which needs a ≤ 1 a\le1 a ≤ 1 , and independence of each trial from whether it is reached, E [ T B Q a ] ≤ poly ( n ) / q \mathbb{E}[T_{B_Q}^a]\le\operatorname{poly}(n)/q E [ T B Q a ] ≤ poly ( n ) / q . As B Q B_Q B Q outputs only elements of R n R_n R n , condition 2 gives Pr [ T B Q > S / ( n + 2 ) c ] > 1 / 2 \Pr[T_{B_Q}>S/(n+2)^c]>1/2 Pr [ T B Q > S / ( n + 2 ) c ] > 1/2 , and Markov’s inequality gives q ≤ 2 poly ( n ) ( n + 2 ) a c S − a q\le2\operatorname{poly}(n)(n+2)^{ac}S^{-a} q ≤ 2 poly ( n ) ( n + 2 ) a c S − a . □
Parallel search hardness. Suppose condition 2 holds for parallel algorithms: for every parallel algorithm B B B with S ( n ) O ( 1 ) S(n)^{O(1)} S ( n ) O ( 1 ) processors there is d d d such that, for all large n n n , B ( 1 n ) B(1^n) B ( 1 n ) outputs an element of R n R_n R n within parallel time S ( n ) / ( n + 2 ) d S(n)/(n+2)^d S ( n ) / ( n + 2 ) d with probability less than 1 / 2 1/2 1/2 . Then condition 1 follows for every rational a > 0 a>0 a > 0 . Let E [ T Q ( n ) a ] ≤ C ( n + 2 ) c 0 \mathbb{E}[T_Q(n)^a]\le C(n+2)^{c_0} E [ T Q ( n ) a ] ≤ C ( n + 2 ) c 0 , and let B B B run ⌈ S a ⌉ \lceil S^a\rceil ⌈ S a ⌉ independent copies of Q ( 1 n ) Q(1^n) Q ( 1 n ) , one per processor, and output the first output in R n R_n R n ; recognizing it and selecting the first costs parallel time ( n + 2 ) e (n+2)^e ( n + 2 ) e . Let d d d be the constant of the hypothesis for B B B and put t = S / ( n + 2 ) d + 1 t=S/(n+2)^{d+1} t = S / ( n + 2 ) d + 1 . At lengths with S ≤ 2 ( n + 2 ) d + 1 + e S\le2(n+2)^{d+1+e} S ≤ 2 ( n + 2 ) d + 1 + e the bound of condition 1 exceeds one once c ≥ a ( d + 2 + e ) c\ge a(d+2+e) c ≥ a ( d + 2 + e ) . At the other lengths t + ( n + 2 ) e ≤ S / ( n + 2 ) d t+(n+2)^e\le S/(n+2)^d t + ( n + 2 ) e ≤ S / ( n + 2 ) d , and a copy halts within t t t steps with an output in R n R_n R n with probability at least q − C ( n + 2 ) c 0 + a ( d + 1 ) S − a q-C(n+2)^{c_0+a(d+1)}S^{-a} q − C ( n + 2 ) c 0 + a ( d + 1 ) S − a , where q = Pr [ Q ( 1 n ) ∈ R n ] q=\Pr[Q(1^n)\in R_n] q = Pr [ Q ( 1 n ) ∈ R n ] . If q ≥ ( n + 2 ) c S − a q\ge(n+2)^cS^{-a} q ≥ ( n + 2 ) c S − a with c = max { c 0 + a ( d + 1 ) + 2 , a ( d + 2 + e ) } c=\max\{c_0+a(d+1)+2,\ a(d+2+e)\} c = max { c 0 + a ( d + 1 ) + 2 , a ( d + 2 + e )} , this is at least q / 2 ≥ S − a q/2\ge S^{-a} q /2 ≥ S − a for large n n n , so B B B succeeds within parallel time S / ( n + 2 ) d S/(n+2)^d S / ( n + 2 ) d with probability at least 1 − 1 / e > 1 / 2 1-1/e>1/2 1 − 1/ e > 1/2 , a contradiction. So Theorem 8.9 and Theorem 8.10 hold for every a a a with condition (a) replaced by parallel constant-success hardness of finding a record accepted by the filter, and (MFa _a a ) of Theorem 8.11 follows in the same way from its parallel multiscale form. This does not conflict with the oracle example below, which concerns sequential algorithms; there parallel repetition of the strict sampler finds the terminal.
So for a ≤ 1 a\le1 a ≤ 1 , Theorem 8.9 holds with condition (a) replaced by the requirement that no algorithm finds a record accepted by the filter, forgeries included, in time T ( n ) / poly ( n ) T(n)/\operatorname{poly}(n) T ( n ) / poly ( n ) with probability 1 / 2 1/2 1/2 , at every large length. For a > 1 a>1 a > 1 this reduction is not available: relative to an oracle there is a chain with exactly T ( n ) T(n) T ( n ) steps and an exact recognizer that satisfies Theorem 8.3 and constant-success search hardness at every large length, while for every a > 1 a>1 a > 1 a strict sampler puts mass far above T − a T^{-a} T − a on the terminal at infinitely many lengths, because the terminal has low entropy at those lengths. To build it, put at each length an independent random chain of exactly T T T steps with hidden 4 n 4n 4 n -bit labels and an exact terminal-equality test, in disjoint tagged tables. At odd lengths the terminal is uniform among the nonzero n n n -bit strings; at even lengths it is uniform in a public pool of T g ( n ) Tg(n) T g ( n ) nonzero strings, g ( n ) = 2 4 ⌈ log ( n + 2 ) ⌉ g(n)=2^{4\lceil\log(n+2)\rceil} g ( n ) = 2 4 ⌈ l o g ( n + 2 )⌉ . The exposure argument of Theorem 8.1 bounds the average success of a fixed machine before T / 2 T/2 T /2 steps by ( T / 2 + 1 ) / N n + 2 − Ω ( n ) (T/2+1)/N_n+2^{-\Omega(n)} ( T /2 + 1 ) / N n + 2 − Ω ( n ) , where N n N_n N n is the number of possible terminals. This is O ( 1 / g ( n ) ) O(1/g(n)) O ( 1/ g ( n )) at even lengths, which is summable, and 2 − n + O ( n ) 2^{-n+O(\sqrt n)} 2 − n + O ( n ) at odd lengths. Markov’s inequality, Borel–Cantelli and a countable intersection over machines give, with probability one, constant-success hardness at all large lengths and the bound of Theorem 8.3 at all large odd lengths. A strict sampler uniform on the pool gives the terminal probability 1 / ( T g ( n ) ) 1/(Tg(n)) 1/ ( T g ( n )) at every even length, and T a − 1 / g ( n ) T^{a-1}/g(n) T a − 1 / g ( n ) is superpolynomial for every a > 1 a>1 a > 1 .
Condition (a) also tolerates an explicit loss: if its bound is 2 λ ( n ) T ( n ) − a 2^{\lambda(n)}T(n)^{-a} 2 λ ( n ) T ( n ) − a with 0 ≤ λ ( n ) = o ( n ) 0\leq\lambda(n)=o(\sqrt n) 0 ≤ λ ( n ) = o ( n ) computable in polynomial time, shortening the second chain to H ( n ) = 2 ⌊ ( a h − λ ( n ) ) / v ⌋ H(n)=2^{\lfloor(ah-\lambda(n))/v\rfloor} H ( n ) = 2 ⌊( ah − λ ( n )) / v ⌋ , and assuming condition (b) for this H H H and its output Y Y Y , keeps H v 2 λ ≤ T a H^v2^\lambda\leq T^a H v 2 λ ≤ T a and H = T a / v − o ( 1 ) H=T^{a/v-o(1)} H = T a / v − o ( 1 ) , and the proof below goes through unchanged when v < a v<a v < a , since then H ≥ T H\geq T H ≥ T for large n n n . For v = a v=a v = a and λ = ω ( log n ) \lambda=\omega(\log n) λ = ω ( log n ) the recomputation of the first record, at cost T > H T>H T > H , leaves a factor 2 λ 2^\lambda 2 λ ; the extended language below avoids it.
Theorem 8.9 (An explicit problem on the solver frontier). Let 0 < r ≤ 1 0<r\leq1 0 < r ≤ 1 and 0 < v ≤ a 0<v\leq a 0 < v ≤ a be rationals, and assume that some certified two-stage chain is tightly sequential. Then there are an explicit language L ∈ U P ∩ c o U P L\in\mathrm{UP}\cap\mathrm{coUP} L ∈ UP ∩ coUP with at most n n n members of each length, a deterministic decider D D D for L L L , and a source A ∈ S r ∩ W A\in\mathcal{S}_r\cap\mathcal{W} A ∈ S r ∩ W with worst-case runtime 2 O ( n ) 2^{O(\sqrt n)} 2 O ( n ) , such that
E x ∼ P Q ( ⋅ ∣ n ) [ T D ( x ) v ] ≤ poly Q ( n ) \mathbb{E}_{x\sim P_Q(\cdot\mid n)}[T_D(x)^v]\leq\operatorname{poly}_Q(n) E x ∼ P Q ( ⋅ ∣ n ) [ T D ( x ) v ] ≤ poly Q ( n ) for every Q ∈ S a Q\in\mathcal{S}_a Q ∈ S a ;
E x ∼ P A ( ⋅ ∣ n ) [ T D ( x ) v r / a ] ≤ poly ( n ) \mathbb{E}_{x\sim P_A(\cdot\mid n)}[T_D(x)^{vr/a}]\leq\operatorname{poly}(n) E x ∼ P A ( ⋅ ∣ n ) [ T D ( x ) v r / a ] ≤ poly ( n ) ;
for every real w > v r / a w>vr/a w > v r / a and every randomized machine M M M that decides L L L with error at most 1 / 3 1/3 1/3 on every input, E x ∼ P A ( ⋅ ∣ n ) [ T M ( x ) w ] \mathbb{E}_{x\sim P_A(\cdot\mid n)}[T_M(x)^w] E x ∼ P A ( ⋅ ∣ n ) [ T M ( x ) w ] , over x x x and the coins of M M M , is not bounded by any polynomial in n n n .
Proof. Let L = { z n , i : ( w , π ) = ( W ( n ) , π ( n ) ) , Y ( n ) i = 1 } L=\{z_{n,i}:(w,\pi)=(W(n),\pi(n)),\ Y(n)_i=1\} L = { z n , i : ( w , π ) = ( W ( n ) , π ( n )) , Y ( n ) i = 1 } . The certificate is the order d d d of g n g_n g n with its prime factorization, checked as in Section 8; it is unique. From it one computes W ( n ) = g n 2 T m o d d W(n)=g_n^{2^T}\bmod d W ( n ) = g n 2 T mod d , π ( n ) \pi(n) π ( n ) , and W ( n ) 2 H = W ( n ) 2 H m o d d W(n)^{2^H}=W(n)^{2^H}\bmod d W ( n ) 2 H = W ( n ) 2 H mod d , and so decides membership exactly. Malformed inputs are rejected directly. So L ∈ U P ∩ c o U P L\in\mathrm{UP}\cap\mathrm{coUP} L ∈ UP ∩ coUP , and L L L has at most m ( n ) ≤ n m(n)\leq n m ( n ) ≤ n members of length n n n .
D D D rejects malformed inputs and inputs outside F n F_n F n in polynomial time. On an input in F n F_n F n it computes W ( n ) W(n) W ( n ) and π ( n ) \pi(n) π ( n ) in time T poly ( n ) T\operatorname{poly}(n) T poly ( n ) , rejects a mismatch, and otherwise computes Y ( n ) Y(n) Y ( n ) in time H poly ( n ) H\operatorname{poly}(n) H poly ( n ) and outputs the indicated bit. As T ≤ H T\leq H T ≤ H , T D ( x ) ≤ p 0 ( n ) ( 1 + H 1 [ x ∈ F n ] ) T_D(x)\leq p_0(n)(1+H\mathbf{1}[x\in F_n]) T D ( x ) ≤ p 0 ( n ) ( 1 + H 1 [ x ∈ F n ]) for a polynomial p 0 p_0 p 0 .
Part 1. Let E [ T Q ( n ) a ] ≤ C ( n + 2 ) c \mathbb{E}[T_Q(n)^a]\leq C(n+2)^c E [ T Q ( n ) a ] ≤ C ( n + 2 ) c . By (a) and Markov’s inequality at T / q Q T/q_Q T / q Q , P Q ( F n ∣ n ) ≤ T − a + C ( n + 2 ) c q Q ( n ) a T − a P_Q(F_n\mid n)\leq T^{-a}+C(n+2)^cq_Q(n)^aT^{-a} P Q ( F n ∣ n ) ≤ T − a + C ( n + 2 ) c q Q ( n ) a T − a for large n n n , and H v ≤ T a H^v\leq T^a H v ≤ T a gives E P Q [ T D v ] ≤ 2 v p 0 v ( 1 + P Q ( F n ) H v ) ≤ poly Q ( n ) \mathbb{E}_{P_Q}[T_D^v]\leq2^vp_0^v(1+P_Q(F_n)H^v)\leq\operatorname{poly}_Q(n) E P Q [ T D v ] ≤ 2 v p 0 v ( 1 + P Q ( F n ) H v ) ≤ poly Q ( n ) .
Part 2. A A A outputs 0 n 0^n 0 n unless r h r h r h coins are all zero; then it computes ( W ( n ) , π ( n ) ) (W(n),\pi(n)) ( W ( n ) , π ( n )) in time T poly ( n ) T\operatorname{poly}(n) T poly ( n ) and space poly ( n ) \operatorname{poly}(n) poly ( n ) , draws u u u uniform in { 0 , … , 2 ⌈ log m ⌉ − 1 } \{0,\ldots,2^{\lceil\log m\rceil}-1\} { 0 , … , 2 ⌈ l o g m ⌉ − 1 } , and outputs z n , i z_{n,i} z n , i with i = 1 + ( u m o d m ) i=1+(u\bmod m) i = 1 + ( u mod m ) , so each i i i has probability between 1 / ( 2 m ) 1/(2m) 1/ ( 2 m ) and 2 / m 2/m 2/ m given the gate. Then E [ T A r ] ≤ poly ( n ) ( 1 + T − r T r ) \mathbb{E}[T_A^r]\leq\operatorname{poly}(n)(1+T^{-r}T^r) E [ T A r ] ≤ poly ( n ) ( 1 + T − r T r ) , the gate has probability in [ T − r / 2 , T − r ] [T^{-r}/2,T^{-r}] [ T − r /2 , T − r ] , and H v r / a ≤ T r H^{vr/a}\leq T^r H v r / a ≤ T r gives E P A [ T D v r / a ] ≤ 2 v r / a p 0 v r / a ( 1 + T − r H v r / a ) ≤ poly ( n ) \mathbb{E}_{P_A}[T_D^{vr/a}]\leq2^{vr/a}p_0^{vr/a}(1+T^{-r}H^{vr/a})\leq\operatorname{poly}(n) E P A [ T D v r / a ] ≤ 2 v r / a p 0 v r / a ( 1 + T − r H v r / a ) ≤ poly ( n ) .
Part 3. Suppose a correct M M M has E P A [ T M w ] ≤ p M ( n ) \mathbb{E}_{P_A}[T_M^w]\leq p_M(n) E P A [ T M w ] ≤ p M ( n ) with w > v r / a w>vr/a w > v r / a . Each z n , i z_{n,i} z n , i has probability at least T − r / ( 4 m ) T^{-r}/(4m) T − r / ( 4 m ) , so E [ T M ( z n , i ) w ] ≤ 4 m p M ( n ) T r \mathbb{E}[T_M(z_{n,i})^w]\leq4mp_M(n)T^r E [ T M ( z n , i ) w ] ≤ 4 m p M ( n ) T r . Choose δ ∈ ( 0 , 1 ) \delta\in(0,1) δ ∈ ( 0 , 1 ) with ( 1 − δ ) w > v r / a (1-\delta)w>vr/a ( 1 − δ ) w > v r / a , put k = 72 ⌈ ln ( 4 m ) ⌉ k=72\lceil\ln(4m)\rceil k = 72 ⌈ ln ( 4 m )⌉ and t = ⌊ H 1 − δ / ( 4 k m ) ⌋ t=\lfloor H^{1-\delta}/(4km)\rfloor t = ⌊ H 1 − δ / ( 4 k m )⌋ . By Markov’s inequality and H ≥ T v r / a / 2 H\geq T^{vr/a}/2 H ≥ T v r / a /2 , $\Pr[T_M(z_{n,i})> t ] ≤ poly ( n ) T r − ( 1 − δ ) a w / v ≤ 1 / 12 t] \le\operatorname{poly}(n)T^{r-(1-\delta)aw/v} \le1/12 t ] ≤ poly ( n ) T r − ( 1 − δ ) a w / v ≤ 1/12 for large n n n . Let M ~ ( 1 n , W ( n ) , π ( n ) ) \widetilde{M}(1^n,W(n),\pi(n)) M ( 1 n , W ( n ) , π ( n )) run, for each i , k i,k i , k independent copies of M ( z n , i ) M(z_{n,i}) M ( z n , i ) truncated at t t t steps, with timeouts read as 0, and take majorities. A truncated copy errs with probability at most 1 / 3 + 1 / 12 = 5 / 12 1/3+1/12=5/12 1/3 + 1/12 = 5/12 , so by Hoeffding’s inequality a majority errs with probability at most e − k / 72 ≤ 1 / ( 4 m ) e^{-k/72}\le1/(4m) e − k /72 ≤ 1/ ( 4 m ) , and M ~ \widetilde{M} M outputs Y ( n ) Y(n) Y ( n ) with probability at least 3 / 4 3/4 3/4 in time H 1 − δ poly ( n ) ≤ H 1 − δ / 2 H^{1-\delta}\operatorname{poly}(n)\le H^{1-\delta/2} H 1 − δ poly ( n ) ≤ H 1 − δ /2 , at every large n n n . This contradicts (b) with δ / 2 \delta/2 δ /2 . □
The theorem needs v ≤ a v\le a v ≤ a because the decider pays T T T to recompute the canonical record on every input that passes the filter, which must fit inside T a T^a T a under the candidate and T r T^r T r under the source. The recomputation can be avoided by defining the language on every record the filter accepts: ⟨ w , π , i ⟩ ∈ L e x t \langle w,\pi,i\rangle\in L_{\mathrm{ext}} ⟨ w , π , i ⟩ ∈ L ext if w w w is the canonical encoding of an element of G n G_n G n , V ( 1 n , w , π ) = 1 V(1^n,w,\pi)=1 V ( 1 n , w , π ) = 1 , and bit i i i of w 2 H w^{2^H} w 2 H is 1; the membership check only shrinks the accepted set. The decider then checks the filter and squares the supplied w w w H H H times; the order of w w w with its factorization is a unique certificate for either answer, so L e x t ∈ U P ∩ c o U P L_{\mathrm{ext}}\in\mathrm{UP}\cap\mathrm{coUP} L ext ∈ UP ∩ coUP , and the proof above goes through for every v > 0 v>0 v > 0 , with condition (b) now about a second chain of length H H H , which for v > a v>a v > a is shorter than T T T . The canonical proof need no longer be computable from an annihilator. The price is sparsity: L e x t L_{\mathrm{ext}} L ext may contain noncanonical accepted records, although the source still has at most m ( n ) + 1 m(n)+1 m ( n ) + 1 outputs of each length. Our method would give a sparse language for v > a v>a v > a from a perfectly sound first-stage proof with public parameters, which we do not know.
Corollary 8.10 (The extended language). Let 0 < r ≤ 1 0<r\le1 0 < r ≤ 1 and a , v > 0 a,v>0 a , v > 0 be rationals. Define h h h , T T T and H H H as in Theorem 8.7, now allowing v > a v>a v > a , so that T a / v / 2 ≤ H ≤ T a / v T^{a/v}/2\le H\le T^{a/v} T a / v /2 ≤ H ≤ T a / v , and consider a chain with the data of Theorem 8.7 except that π ( n ) \pi(n) π ( n ) need not be computable from a d d d with g n d = 1 g_n^d=1 g n d = 1 . If it satisfies conditions (a) and (b), then L e x t ∈ U P ∩ c o U P L_{\mathrm{ext}}\in\mathrm{UP}\cap\mathrm{coUP} L ext ∈ UP ∩ coUP , with a deterministic decider D D D and a source A ∈ S r ∩ W A\in\mathcal{S}_r\cap\mathcal{W} A ∈ S r ∩ W with worst-case runtime 2 O ( n ) 2^{O(\sqrt n)} 2 O ( n ) , satisfies parts 1–3 of Theorem 8.9 . When r ≤ a r\le a r ≤ a or v > a v>a v > a , the exponent v r / a vr/a v r / a equals q ∗ ( a , r , v ) q^*(a,r,v) q ∗ ( a , r , v ) . In particular this holds in the amplification regime a < r ≤ 1 a<r\le1 a < r ≤ 1 , v > a v>a v > a , where a < 1 a<1 a < 1 and, by Theorem 8.8 , condition (a) may be replaced by constant-success search hardness at time T ( n ) / poly ( n ) T(n)/\operatorname{poly}(n) T ( n ) / poly ( n ) .
Proof. On an input in F n F_n F n the decider checks the filter and squares the supplied w w w H H H times, so T D ( x ) ≤ p 0 ( n ) ( 1 + H 1 [ x ∈ F n ] ) T_D(x)\le p_0(n)(1+H\,1[x\in F_n]) T D ( x ) ≤ p 0 ( n ) ( 1 + H 1 [ x ∈ F n ]) without the term T T T . Parts 1 and 2 then follow from the computations in the proof of Theorem 8.9 , which use only this bound, H v ≤ T a H^v\le T^a H v ≤ T a and the gate T − r T^{-r} T − r ; the source computes ( W ( n ) , π ( n ) ) (W(n),\pi(n)) ( W ( n ) , π ( n )) from g n g_n g n in time T poly ( n ) T\operatorname{poly}(n) T poly ( n ) and space poly ( n ) \operatorname{poly}(n) poly ( n ) . Part 3 is unchanged, since it uses only H ≥ T a / v / 2 H\ge T^{a/v}/2 H ≥ T a / v /2 , the probabilities of the source’s outputs z n , i z_{n,i} z n , i and condition (b). For membership, the order of w w w in G n G_n G n with the prime factorization of d d d is a unique certificate, checked by w d = 1 w^d=1 w d = 1 , w d / p ≠ 1 w^{d/p}\ne1 w d / p = 1 for each prime p ∣ d p\mid d p ∣ d and primality tests [2 ] ; it determines w 2 H = w 2 H m o d d w^{2^H}=w^{2^H}\bmod d w 2 H = w 2 H mod d in polynomial time and hence both answers. The values of q ∗ q^* q ∗ are read off its definition: for r ≤ 1 r\le1 r ≤ 1 , q ∗ = v / B ( a , r ) = v r / a q^*=v/B(a,r)=vr/a q ∗ = v / B ( a , r ) = v r / a when a ≥ r a\ge r a ≥ r , and q ∗ = v r / a q^*=vr/a q ∗ = v r / a when a < r a<r a < r and v > a v>a v > a . □
The second-stage hypothesis (b) can also be removed, at the price of requiring scarcity at every delay. For 0 ≤ j ≤ h ( n ) 0\le j\le h(n) 0 ≤ j ≤ h ( n ) let Z n , j Z_{n,j} Z n , j be the canonical record (terminal and proof) of the chain of delay 2 j 2^j 2 j from g n g_n g n , padded to a common length ℓ ( n ) ≤ poly ( n ) \ell(n)\le\operatorname{poly}(n) ℓ ( n ) ≤ poly ( n ) , with filter V n , j V_{n,j} V n , j . Assume, uniformly in j j j , that V n , j ( Z n , j ) = 1 V_{n,j}(Z_{n,j})=1 V n , j ( Z n , j ) = 1 , that Z n , j Z_{n,j} Z n , j is computable in time poly ( n ) \operatorname{poly}(n) poly ( n ) and polynomial space, and that it is computable in polynomial time from the order certificate of g n g_n g n . Here h ( n ) ≤ poly ( n ) h(n)\le\operatorname{poly}(n) h ( n ) ≤ poly ( n ) is computable in polynomial time with h ( n ) / log n → ∞ h(n)/\log n\to\infty h ( n ) / log n → ∞ . Inputs are padded encodings enc ( j , k , z , i ) \operatorname{enc}(j,k,z,i) enc ( j , k , z , i ) of a common length N ( n ) N(n) N ( n ) with n ≤ N ( n ) ≤ poly ( n ) n\le N(n)\le\operatorname{poly}(n) n ≤ N ( n ) ≤ poly ( n ) , strictly increasing, with 1 N ( n ) 1^{N(n)} 1 N ( n ) computable from 1 n 1^n 1 n and encoding and decoding in polynomial time; at lengths outside the image of N N N the source outputs the all-zero string and the language is empty, and parts 1–3 below refer to the lengths N ( n ) N(n) N ( n ) . The set F n , j F_{n,j} F n , j consists of the encodings with V n , j ( z ) = 1 V_{n,j}(z)=1 V n , j ( z ) = 1 , for any k k k and i i i . The multiscale scarcity hypothesis (MFa _a a ) says: for every Q ∈ S a Q \in S_a Q ∈ S a there is a polynomial p Q p_Q p Q with Pr [ Q ( 1 N ( n ) ) ∈ F n , j ] ≤ p Q ( n ) 2 − a j \Pr[Q(1^{N(n)}) \in F_{n,j}] \le p_Q(n)2^{-aj} Pr [ Q ( 1 N ( n ) ) ∈ F n , j ] ≤ p Q ( n ) 2 − aj for all large n n n and all 0 ≤ j ≤ h ( n ) 0 \le j \le h(n) 0 ≤ j ≤ h ( n ) .
Theorem 8.11 (The solver frontier from multiscale scarcity). Let 0 < r ≤ 1 0 < r \le1 0 < r ≤ 1 and 0 < v ≤ a 0 < v \le a 0 < v ≤ a be rationals, and assume (MFa _a a ) for such a family of records. Then there are an explicit sparse language L ∈ U P ∩ c o U P L \in\mathrm{UP} \cap\mathrm{coUP} L ∈ UP ∩ coUP , a deterministic decider D D D and a source A ∈ S r ∩ W A \in S_r \cap W A ∈ S r ∩ W satisfying parts 1–3 of Theorem 8.9 . No second-stage hypothesis is used.
Proof. Put κ = a / v ≥ 1 \kappa= a/v \ge1 κ = a / v ≥ 1 , so v r / a = r / κ vr/a = r/\kappa v r / a = r / κ , and call $(j,k)a d m i s s i b l e i f $ 0 ≤ j < k ≤ min { h ( n ) , κ j + 1 } admissible if \$0 \le j < k \le\min\{h(n), \kappa j + 1\} a d mi ss ib l e i f $0 ≤ j < k ≤ min { h ( n ) , κj + 1 } . Let L L L consist of the encodings enc n ( j , k , Z n , j , i ) \operatorname{enc}_n(j,k,Z_{n,j},i) enc n ( j , k , Z n , j , i ) with ( j , k ) (j,k) ( j , k ) admissible and bit i i i of Z n , k Z_{n,k} Z n , k equal to 1; it has at most ( h + 1 ) 2 ℓ ( n ) (h+1)^2\ell(n) ( h + 1 ) 2 ℓ ( n ) members of each length, and the order certificate of g n g_n g n , which determines Z n , j Z_{n,j} Z n , j and Z n , k Z_{n,k} Z n , k , puts it in U P ∩ c o U P \mathrm{UP}\cap\mathrm{coUP} UP ∩ coUP . The decider checks admissibility and V n , j ( z ) V_{n,j}(z) V n , j ( z ) , recomputes Z n , j Z_{n,j} Z n , j , rejects a mismatch, computes Z n , k Z_{n,k} Z n , k and answers; its time on an input in F n , j F_{n,j} F n , j is at most poly ( n ) 2 κ j \operatorname{poly}(n)2^{\kappa j} poly ( n ) 2 κj . So E Q [ T D v ] ≤ poly ( n ) ( 1 + ∑ j Pr Q [ F n , j ] 2 a j ) ≤ poly Q ( n ) \mathbb{E}_{Q}[T_D^v] \le\operatorname{poly}(n)(1+\sum_j \Pr_Q[F_{n,j}]2^{aj}) \le\operatorname{poly}_Q(n) E Q [ T D v ] ≤ poly ( n ) ( 1 + ∑ j Pr Q [ F n , j ] 2 aj ) ≤ poly Q ( n ) . The source picks ( j , k ) (j,k) ( j , k ) and a bit index, each pair and index with inverse-polynomial probability, outputs a default if ( j , k ) (j,k) ( j , k ) is not admissible, and otherwise passes a gate of probability $2^{-\lceil rj\rceil}$, computes Z n , j Z_{n,j} Z n , j and outputs the instance. Then E [ T A r ] ≤ poly ( n ) \mathbb{E}[T_A^r] \le\operatorname{poly}(n) E [ T A r ] ≤ poly ( n ) , each canonical admissible instance has probability at least 2 − r j / poly ( n ) 2^{-rj}/\operatorname{poly}(n) 2 − r j / poly ( n ) , and E A [ T D r ] ≤ poly ( n ) ∑ j 2 − r j 2 r j \mathbb{E}_A[T_D^r] \le\operatorname{poly}(n)\sum_j 2^{-rj}2^{rj} E A [ T D r ] ≤ poly ( n ) ∑ j 2 − r j 2 r j .
Suppose a correct M M M has E A [ T M w ] ≤ poly ( n ) \mathbb{E}_A[T_M^w] \le\operatorname{poly}(n) E A [ T M w ] ≤ poly ( n ) with w > r / κ w > r/\kappa w > r / κ ; then E [ T M ( x ) w ] ≤ P ( n ) 2 r j \mathbb{E}[T_M(x)^w] \le P(n)2^{rj} E [ T M ( x ) w ] ≤ P ( n ) 2 r j on every canonical admissible instance x x x at scale j j j . Choose rationals r / w < β < κ r/w < \beta< \kappa r / w < β < κ and β / κ < α < 1 \beta/\kappa< \alpha< 1 β / κ < α < 1 . For k ≥ 1 k \ge1 k ≥ 1 the pair ( ⌈ ( k − 1 ) / κ ⌉ , k ) (\lceil(k-1)/\kappa\rceil,k) (⌈( k − 1 ) / κ ⌉ , k ) is admissible, so a path of at most h h h admissible pairs leads from 0 to h h h , with every j ≤ h / κ + 1 j \le h/\kappa+1 j ≤ h / κ + 1 . Starting from Z n , 0 Z_{n,0} Z n , 0 , which is computable in polynomial time, reconstruct Z n , k Z_{n,k} Z n , k along the path by asking M M M about every bit of the next record, with O ( log n ) O(\log n) O ( log n ) repetitions and majorities, each run cut off at ( n + 2 ) c 2 ⌈ β j ⌉ (n+2)c2^{\lceil\beta j\rceil} ( n + 2 ) c 2 ⌈ β j ⌉ steps. By Markov’s inequality each cutoff is reached with probability at most P ( n ) ( n + 2 ) − c w 2 ( r − β w ) j P(n)(n+2)^{-cw2^{(r-\beta w)j}} P ( n ) ( n + 2 ) − c w 2 ( r − β w ) j , so for a large constant c c c the whole reconstruction succeeds with probability at least 0.98, in time poly ( n ) 2 ( β / κ ) h ≤ 2 α h \operatorname{poly}(n)2^{(\beta/\kappa)h} \le2^{\alpha h} poly ( n ) 2 ( β / κ ) h ≤ 2 α h for large n n n . The sampler that passes a gate of probability 2 − ⌈ a ⌈ α h ⌉ ⌉ 2^{-\lceil a\lceil\alpha h\rceil\rceil} 2 − ⌈ a ⌈ α h ⌉⌉ and then outputs enc n ( h , h , Z n , h , 1 ) ∈ F n , h \operatorname{enc}_n(h,h,Z_{n,h},1) \in F_{n,h} enc n ( h , h , Z n , h , 1 ) ∈ F n , h obtained this way lies in S a S_a S a and hits F n , h F_{n,h} F n , h with probability at least 2 − a α h − a − 2 2^{-a\alpha h-a-2} 2 − a α h − a − 2 , contradicting (MFa _a a ) because 2 a ( 1 − α ) h 2^{a(1-\alpha)h} 2 a ( 1 − α ) h exceeds every polynomial.
As in Theorem 8.8 , applied at every delay, for a ≤ 1 a \le1 a ≤ 1 the hypothesis (MFa _a a ) follows from multiscale constant-success hardness: for every machine B B B there is c c c such that, for all large n n n and all j ≤ h ( n ) j \le h(n) j ≤ h ( n ) , B B B on input 1 N ( n ) 1^{N(n)} 1 N ( n ) and j j j outputs an element of F n , j F_{n,j} F n , j within 2 j / ( n + 2 ) c 2^j/(n+2)^c 2 j / ( n + 2 ) c steps with probability less than 1 / 2 1/2 1/2 . So for r ≤ a ≤ 1 r \le a \le1 r ≤ a ≤ 1 and v ≤ a v \le a v ≤ a , one natural sequentiality assumption about repeated squaring with deterministic proofs gives an explicit sparse problem on the solver frontier. The bootstrap needs k ≥ 1 k \ge1 k ≥ 1 : for v > a v > a v > a admissible pairs cannot reach large delays.
Related work
Average-case complexity. Levin [15 ] introduced average polynomial time with a positive exponent on runtime, precisely so that the notion would be robust; Ben-David, Chor, Goldreich and Luby [5 ] developed the theory, including domination and samplable distributions. Their reductions use a pointwise domination condition on the induced query distribution. Gurevich [10 ] introduced the weaker domination on average and proved that average polynomial time transfers along it; Schuler and Yamakami [28 ] develop it further, Yamakami [31 ] treats it alongside polynomial domination for samplable distributions, and Aida and Tsukiji [3 ] use it to relax a hypothesis of Ben-David et al. Our moments are taken over a sampler’s coins at each length rather than over the input distribution, and the order is fixed in advance. The conclusions are pointwise domination in § 3 and § 6 , and in § 4.2 a sharp quantitative form of domination on average, with the Rénnyi order determined by the two moment orders. The robustness motivation is shared; the theorems are different. The nearly linear simulation convention matters here, since a general polynomial slowdown need not preserve a fixed moment order. In the proof of their Theorem 9, Ben-David et al. use padding to reduce arbitrary polynomial sampling bounds to a quadratic one; this changes the sampled strings and so does not give a universal sampler on a fixed output space. Impagliazzo and Levin [13 ] prove samplable-to-uniform reductions for NP and also study a universal time-restricted semimeasure with an explicit clock; again the relation is through reductions that transform instances.
Universal distributions. The universal enumerable semimeasure dominates every enumerable semimeasure, and Li and Vitányi showed that average-case complexity under it equals worst-case complexity [20 ] . Schuler studied universal distributions for the polynomial-time computable distributions [25 ] ; as recalled in [26 ] , for each fixed polynomial p p p there are polynomial-time computable distributions universal for the p p p -time computable ones. These concern computable distribution functions under a fixed time bound, not samplers under moment bounds. Yamakami [31 ] showed that every polynomial-time samplable distribution is polynomial-time computable if and only if every # P \#\mathrm{P} # P function is, and concluded that if F P = # P \mathrm{FP} = \#\mathrm{P} FP = # P the samplable distributions contain no universal member. His samplable distributions are global distributions approximated by sampling algorithms, not the exact length-conditioned samplers used here, so we do not cite his result for our model; Theorem I.9 gives the corresponding implication directly. Theorem I.4 shows that the obstacle disappears once the universal sampler may leave the strict class while keeping all moments polynomial. Antunes and Fortnow [1 ] show, under a hardness assumption, that time-bounded Kolmogorov distributions m t m^t m t dominate every samplable distribution, with t t t and the loss depending on the sampler; the universal object there is a family indexed by the time bound. Theorem F.1 is a characterization of worst-case running times in their style, unconditional and with one sampler for all positive moment orders, for source classes defined by moments rather than strict time.
Restarts and description. Luby, Sinclair and Zuckerman [18 ] give optimal universal restart schedules for Las Vegas algorithms; they aim at finding a valid answer, not at reproducing an output distribution pointwise, though restarting is also the core of Theorem 3.2; the trials are killed at a constant rate per step instead of following a restart schedule, which makes the total work geometric with mean about t t t . The positive oracle and Theorem 7.7 replace restarts by conditional sampling; for the latter we use uniform generation of NP witnesses with an NP oracle, due to Jerrum, Valiant and Vazirani [14 ] in almost-uniform form and to Bellare, Goldreich and Petrank [8 ] in exact form. Livne [16 ] studies universal samplers that also output witnesses, which is an extra requirement. The measure p K t \mathrm{pK}^t pK t is due to Goldberg, Kabanets, Lu and Oliveira [9 ] , and Lu, Oliveira and Zimand [17 ] prove optimal coding theorems for it for samplers with a time bound; Theorem E.2 treats moment-bounded samplers, charges time with weight a a a , and has an optimal coefficient relative to O O O (Theorem E.4 ).
Sequential functions. Time-lock puzzles [23 ] and verifiable delay functions [4 , 30 ] rest on functions that need many sequential steps; their security definitions concern parallel adversaries on random or trapdoor-generated instances. Theorem 8.3 needs a different form, with one public instance per length, total rather than parallel time, and success probability below 1 / T 1/T 1/ T . In the random oracle model iterated hashing has the parallel form [21 ] , and the sequential form by Theorem 8.1. Theorem 8.5 keeps the parallel, constant-success form on random instances, but with T o ( 1 ) T^{o(1)} T o ( 1 ) seeds and without the precomputation phase of [4 ] .
Priority. The countable interleaving used to obtain one oracle for all orders is standard, and so are the positive ingredients of § 19 . For § 4.2 , the transfer of average polynomial time along domination on average is Gurevich’s [10 ] , and the qualitative Theorems 4.9 and 4.10 already follow from a plain clock mixture; what we claim there is the construction attaining the frontier (3), its endpoint, and its optimality relative to O O O . The cited results establish the following and no more. Levin and Ben-David et al. transfer average polynomial time along pointwise domination [15 , 5 ] , and Gurevich along domination on average [10 ] , which Schuler and Yakamami and Aida and Tsukiji study further [28 , 3 ] ; none of them treats samplers under runtime-moment constraints or determines an optimal power or likelihood-ratio moment. Schuler’s universal distributions concern computable distributions under a fixed time bound [25 , 26 ] , Yakamami’s nonexistence result concerns strict samplers under F P = # P \mathrm{FP} = \#\mathrm{P} FP = # P [31 ] , and the coding theorems of Lu, Oliveira and Zimand concern samplers with a time bound [17 ] . The moment threshold, the frontier B ( a , r ) B(a,r) B ( a , r ) in both senses, the oracle constructions of § 5 and § 6 , and the profile of O ⋆ O_{\star} O ⋆ are not contained in these works.
Open questions
Unrelativized profile. Is there, unconditionally, a sampler with polynomial a a a th moment for some a > 1 a > 1 a > 1 that dominates every sampler with all polynomial moments? By Theorem 1.1 and Theorem 7.3 neither answer has a relativizing proof, and by Theorem 7.8 a negative answer would imply P ≠ N P \mathrm{P} \ne\mathrm{NP} P = NP . A negative answer under a cryptographic assumption would need a computational version of the bad world. Two observations limit the obvious routes. First, additive indistinguishability between a hidden singleton gate and a hidden affine superspace is not precise enough. The transfer needs a gap ε \varepsilon ε well below the good-world success probability, about 1 / N 1/N 1/ N , but a distinguisher that knows the singleton’s point and tests one other point already has advantage ( K − 1 ) / ( N − 1 ) (K-1)/(N-1) ( K − 1 ) / ( N − 1 ) , about 1 / V 1/V 1/ V . This floor is information-theoretic, so no stronger hardness assumption removes it. Second, what would suffice is a single simulator, valid in both density worlds and keeping the terminal hidden, whose number of block queries is L ≤ V 1 + o ( 1 ) poly ( n ) L \le V^{1+o(1)}\operatorname{poly}(n) L ≤ V 1 + o ( 1 ) poly ( n ) on runs at scale V V V . The amplification argument then gives a bad-world moment of order V a / ( L poly ( n ) ) V^a/(L\operatorname{poly}(n)) V a / ( L poly ( n )) , so query overhead V c V^c V c defeats only candidates of order a > c a > c a > c , and a generic polynomial overhead is useless. Even such a simulator would leave a uniformity problem: the candidate receives only 1 n 1^n 1 n , so the source would have to generate its hidden instances from its own description and coins.
Expected-polynomial-time sources. Theorems 8.4 and 8.6 show that no sampler of order above one dominates every member of S 1 S_1 S 1 if some public chain is sequentially hard, or if some delay function with short seeds resists parallel speedup, and Theorem 8.2 shows it relative to a random oracle. Does the standard definition of verifiable delay functions [4 ] suffice, with seeds of length ω ( log T ) \omega(\log T) ω ( log T ) and precomputation allowed, or do one-way functions? With seeds of O ( log T ) O(\log T) O ( log T ) bits the standard definition cannot hold, since a precomputation in time poly ( T ) \operatorname{poly}(T) poly ( T ) tabulates every answer. The obstacle is a quantifier: the candidate receives only 1 n 1^n 1 n , so the source must generate its hard instances from n n n and its own coins, and a puzzle whose instance comes with a trapdoor does not help. The proof of Theorem 8.6 turns a dominating candidate into an attack on a random seed by rerunning the candidate until it hits that seed, which takes about 2 β ℓ T β 2^{\beta\ell T^\beta} 2 β ℓ T β trials and so needs ℓ = O ( log T ) \ell= O(\log T) ℓ = O ( log T ) ; for such seeds precomputation must be excluded. Whether a different reduction works with long seeds is open. Is there an unconditional proof? No P versus NP barrier is known here; under P = N P P = NP P = N P , Theorem 7.9 gives only 1 ≤ U ( 1 ) ≤ C 1 \le U(1) \le C 1 ≤ U ( 1 ) ≤ C , while relative to O ⋆ O_{\star} O ⋆ , where P = N P P = NP P = N P , U O ⋆ ( 1 ) = 1 U^{O_{\star}}(1) = 1 U O ⋆ ( 1 ) = 1 . In the other direction, we know no oracle relative to which some sampler of order above one is universal for S 1 S_1 S 1 . An oracle that helps must not provide deterministic access to a CDF that majorizes the candidate’s short-run law, which is what defeats candidates relative to O ⋆ O_{\star} O ⋆ , and a diagonalization that sees the candidate only through finitely many samples does not suffice on the level of distributions: a Brouwer fixed point gives a distribution that dominates the procedure’s own output law up to a constant factor. Whether such a fixed point is the law of a uniform sampler with the required moment bound is the unresolved realization problem.
Exponent loss under P = N P P = NP P = N P . Does P = N P P = NP P = N P give a universal member of S r S_r S r itself for r > 1 r > 1 r > 1 , that is, ζ = 1 \zeta= 1 ζ = 1 in Theorem 7.7 ? This needs conditional sampling of surviving runs in time t ⋅ poly ( n ) t \cdot\operatorname{poly}(n) t ⋅ poly ( n ) rather than poly ( n , t ) \operatorname{poly}(n,t) poly ( n , t ) . Which weaker collapse, if any, gives order r / ζ r/\zeta r / ζ ? In the other direction, Theorem 7.9 gives U ( r ) ≤ C r U(r) \le Cr U ( r ) ≤ C r ; is U ( r ) = r U(r) = r U ( r ) = r under P = N P P = NP P = N P ? This would follow from light outputs in time h 1 + o ( 1 ) poly ( n ) h^{1+o(1)}\operatorname{poly}(n) h 1 + o ( 1 ) poly ( n ) . Relative to O ⋆ O_{\star} O ⋆ both answers are yes (Theorems 7.2 , 7.4 and 7.5 ), so a negative answer cannot relativize. Is there an oracle X X X with P X = N P X P^X = NP^X P X = N P X and U X ( r ) < r U^X(r) < r U X ( r ) < r for some r r r ? It cannot use the gated blocks of § 5 , since with P X = N P X P^X = NP^X P X = N P X a polynomial-time candidate finds a positive seed by search.
All-moments sources. Is there an oracle relative to which some sampler in S a l l S_{\mathrm{all}} S all is universal for S a l l S_{\mathrm{all}} S all ? It fails relative to O O O , O ⋆ O_{\star} O ⋆ and every oracle X X X with P X = N P X P^X = NP^X P X = N P X (Theorems 6.1 and 7.10 ). Relative to a PSPACE-complete oracle it holds against polynomial-space sources (Theorem I.1 ), but the sources of Theorem 7.10 defeat it there once they may use more space.
One negative oracle. Do Theorems 6.2 and 6.10 and the attainment results of Section A.2 hold relative to O i o O_{\mathrm{io}} O io , so that one oracle carries all the negative results at all large lengths? For the solver theorems the gated and power stages would need the terminal tests and verification tables of § 5.5 , which add live strings that the pools must also protect. For eventual domination the loss is understood: Theorem 6.7 gives the exact power, and against all-moments sources losses 2 ε n 2^{\varepsilon n} 2 ε n suffice for every ε > 0 \varepsilon> 0 ε > 0 while losses 2 n 1 − o ( 1 ) 2^{n^{1-o(1)}} 2 n 1 − o ( 1 ) do not (Theorem 6.4).
Transfer exponents for deciders. Theorem 6.12 determines, relative to oracles, the exact transfer exponent for running times of deterministic deciders for all rational orders. Without an oracle, Theorem 8.9 gives an explicit problem in U P ∩ c o U P \mathrm{UP} \cap\mathrm{coUP} UP ∩ coUP that meets the exponent for r ≤ min { a , 1 } r \le\min\{a,1\} r ≤ min { a , 1 } and v ≤ a v \le a v ≤ a , assuming tight sequentiality of repeated squaring (Theorem 8.7); for a ≤ 1 a \le1 a ≤ 1 the consequence of condition (a) that the proof uses is equivalent to constant-success search hardness at time T / poly ( n ) T/\operatorname{poly}(n) T / poly ( n ) (Theorem 8.8 ), and for a > 1 a > 1 a > 1 no relativizing argument derives it from sequential search hardness. For v > 1 v > 1 v > 1 , including the amplification regime a < r a < r a < r , the extended language of Theorem 8.10 meets it but is not known to be sparse; our method would give a sparse one from a perfectly sound first-stage proof with public parameters. For a ≤ 1 a \le1 a ≤ 1 , Theorem 8.11 needs only multiscale constant-success sequentiality. Can sources of order r > 1 r > 1 r > 1 be handled? Can the tightness be weakened? Theorem 8.3 does not give it in general. Suppose a chain with an exact polynomial-time terminal recognizer has true delay T ′ ( n ) = T ( n ) / 2 ⌊ n 1 / 4 ⌋ T'(n) = T(n)/2^{\lfloor n^{1/4}\rfloor} T ′ ( n ) = T ( n ) / 2 ⌊ n 1/4 ⌋ and success probability at most T ′ ( n ) − κ T'(n)^{-\kappa} T ′ ( n ) − κ within T ′ ( n ) 1 − δ T'(n)^{1-\delta} T ′ ( n ) 1 − δ steps, for some κ > 1 \kappa> 1 κ > 1 . Padding it with identity steps to nominal delay T ( n ) T(n) T ( n ) gives a chain that satisfies Theorem 8.3, because T 1 − δ ≤ T ′ 1 − δ T^{1-\delta} \le T'^{1-\delta} T 1 − δ ≤ T ′ 1 − δ for a suitable δ ′ \delta' δ ′ and T ′ − κ ≤ 1 / ( p ( n ) T ) T'^{-\kappa} \le1/(p(n)T) T ′ − κ ≤ 1/ ( p ( n ) T ) for large n n n . But a sampler of order a a a that passes a gate of probability T ′ − a = 2 a ⌊ n 1 / 4 ⌋ T − a T'^{-a} = 2^{a\lfloor n^{1/4}\rfloor}T^{-a} T ′ − a = 2 a ⌊ n 1/4 ⌋ T − a and then runs the T ′ T' T ′ active steps gives the terminal probability far above T − a T^{-a} T − a , so condition (a) fails. Can the likelihood ratios behind Theorem 4.4 be estimated efficiently, so that the bound becomes useful for importance sampling or compression?
Attainment at irrational orders
Below one the profile is min { r , 1 } = r \min\{r,1\}=r min { r , 1 } = r relative to O O O , and Theorem 3.4 attains it at every rational order. This appendix treats irrational orders: an extension of the positive construction to orders with fast enough approximations, and the limits of attainment relative to O O O .
Approximable orders
Theorem A.1 (Approximable real orders). Let r ∈ ( 0 , 1 ] r\in(0,1] r ∈ ( 0 , 1 ] , and suppose some algorithm, given m ≥ 0 m\geq0 m ≥ 0 , outputs a rational r ~ m \widetilde r_m r m with ∣ r ~ m − r ∣ ≤ 2 − m |\widetilde r_m-r|\leq2^{-m} ∣ r m − r ∣ ≤ 2 − m in time at most C 0 2 c 0 2 m C_0 2^{c_0 2^m} C 0 2 c 0 2 m , for constants C 0 , c 0 ≥ 1 C_0,c_0\geq1 C 0 , c 0 ≥ 1 . Then the conclusion of Theorem 3.4 holds for r r r , relative to every oracle.
The hypothesis holds for every r r r with polynomial-time rational approximations of accuracy O ( log n / n ) O(\log n/n) O ( log n / n ) : to get accuracy 2 − m 2^{-m} 2 − m it suffices to take n = O ( m 2 m ) n=O(m2^m) n = O ( m 2 m ) , which costs time 2 O ( m ) 2^{O(m)} 2 O ( m ) . It also holds for every real whose m m m -bit approximations take time 2 O ( 2 m ) 2^{O(2^m)} 2 O ( 2 m ) , which covers all the usual irrational constants.
Proof. Replace r ~ m \widetilde r_m r m by s m = r ~ m − 2 − m s_m=\widetilde r_m-2^{-m} s m = r m − 2 − m , so that r − 2 1 − m ≤ s m ≤ r r-2^{1-m}\leq s_m\leq r r − 2 1 − m ≤ s m ≤ r . Let d ≥ 1 d\geq1 d ≥ 1 be an integer with 2 d − 1 ≥ c 0 2^{d-1}\geq c_0 2 d − 1 ≥ c 0 . In the sampler of Theorem 3.3 with gate exponent r r r , only step 3 changes. For the chosen j ≤ n 2 j\leq n^2 j ≤ n 2 , first suppose j ≤ 2 d j\leq2^d j ≤ 2 d ; this includes j ∈ { 0 , 1 } j\in\{0,1\} j ∈ { 0 , 1 } . Then toss ⌈ r j ⌉ ≤ 2 d + 1 \lceil rj\rceil\leq2^d+1 ⌈ r j ⌉ ≤ 2 d + 1 coins, where the finitely many values ⌈ r j ⌉ \lceil rj\rceil ⌈ r j ⌉ , j ≤ 2 d j\leq2^d j ≤ 2 d , are hard-wired; probabilities and costs are as in Theorem 3.3 . Otherwise j > 2 d ≥ 2 j>2^d\geq2 j > 2 d ≥ 2 ; let K = ⌈ log j ⌉ K=\lceil\log j\rceil K = ⌈ log j ⌉ , so that K > d K>d K > d , j ≤ 2 K j\leq2^K j ≤ 2 K and 2 K − 1 < j 2^{K-1}<j 2 K − 1 < j , and run the following cascade, keeping a count c c c of coins tossed so far, initially 0.
For k = d + 1 , … , K − 1 k=d+1,\ldots,K-1 k = d + 1 , … , K − 1 : compute s k − d s_{k-d} s k − d , put g k = max { c , ⌊ s k − d 2 k ⌋ } g_k=\max\{c,\lfloor s_{k-d}2^k\rfloor\} g k = max { c , ⌊ s k − d 2 k ⌋} , toss g k − c g_k-c g k − c fresh coins, output 0 n 0^n 0 n unless all are zero, and set c = g k c=g_k c = g k .
At level K K K : compute s K − d s_{K-d} s K − d , put g K = max { c , ⌈ s K − d j ⌉ } g_K=\max\{c,\lceil s_{K-d}j\rceil\} g K = max { c , ⌈ s K − d j ⌉} , toss g K − c g_K-c g K − c fresh coins, output 0 n 0^n 0 n unless all are zero, and continue with step 4.
The cascade passes exactly when the first g K g_K g K coins are zero, so it passes with probability 2 − g K 2^{-g_K} 2 − g K .
The gate is right up to a constant. Before level K K K , c ≤ max k < K r 2 k < r j c\leq\max_{k<K}r2^k<rj c ≤ max k < K r 2 k < r j , and ⌈ s K − d j ⌉ ≤ r j + 1 \lceil s_{K-d}j\rceil\leq rj+1 ⌈ s K − d j ⌉ ≤ r j + 1 , so g K ≤ r j + 1 g_K\leq rj+1 g K ≤ r j + 1 . Also g K ≥ s K − d j ≥ ( r − 2 1 − K + d ) j ≥ r j − 2 1 + d g_K\geq s_{K-d}j\geq(r-2^{1-K+d})j\geq rj-2^{1+d} g K ≥ s K − d j ≥ ( r − 2 1 − K + d ) j ≥ r j − 2 1 + d , because j ≤ 2 K j\leq2^K j ≤ 2 K . Hence 2 − g K 2^{-g_K} 2 − g K is within the factor 2 1 + d 2^{1+d} 2 1 + d of 2 − r j 2^{-rj} 2 − r j in both directions, and (2) holds with a constant loss.
The moment. For d + 2 ≤ k ≤ K d+2\leq k\leq K d + 2 ≤ k ≤ K , level k k k is reached only if the first g k − 1 ≥ ⌊ s k − 1 − d 2 k − 1 ⌋ ≥ r 2 k − 1 − 2 1 + d − 1 g_{k-1}\geq\lfloor s_{k-1-d}2^{k-1}\rfloor\geq r2^{k-1}-2^{1+d}-1 g k − 1 ≥ ⌊ s k − 1 − d 2 k − 1 ⌋ ≥ r 2 k − 1 − 2 1 + d − 1 coins were zero, and it costs at most C 0 2 c 0 2 k − d + poly ( n ) C_0 2^{c_0 2^{k-d}}+\operatorname{poly}(n) C 0 2 c 0 2 k − d + poly ( n ) steps. Since c 0 2 k − d ≤ 2 k − 1 c_0 2^{k-d}\leq2^{k-1} c 0 2 k − d ≤ 2 k − 1 , its contribution to the r r r th moment is at most
2 − r 2 k − 1 + 2 1 + d + 1 ( C 0 2 c 0 2 k − d + poly ( n ) ) r ≤ 2 1 + d + 1 ( C 0 r + poly ( n ) ) . 2^{-r2^{k-1}+2^{1+d}+1}\left(C_0 2^{c_0 2^{k-d}}+\operatorname{poly}(n)\right)^r\leq2^{1+d+1}\left(C_0^r+\operatorname{poly}(n)\right). 2 − r 2 k − 1 + 2 1 + d + 1 ( C 0 2 c 0 2 k − d + poly ( n ) ) r ≤ 2 1 + d + 1 ( C 0 r + poly ( n ) ) .
Level d + 1 d+1 d + 1 costs O ( 1 ) O(1) O ( 1 ) , and there are O ( log n ) O(\log n) O ( log n ) levels. Step 4 is reached with probability at most 2 − r j + 2 1 + d 2^{-rj+2^{1+d}} 2 − r j + 2 1 + d and then has r r r th moment poly ( n ) 2 r j \operatorname{poly}(n)2^{rj} poly ( n ) 2 r j by Theorem 3.2. By subadditivity of u ↦ u r u\mapsto u^r u ↦ u r for r ≤ 1 r\leq1 r ≤ 1 , the r r r th moment of the whole procedure is polynomial. Nothing else uses an algorithm for r r r . □ \square □
The gain over a single gate is that a sampler which has already passed a gate of probability about 2 − r 2 k − 1 2^{-r2^{k-1}} 2 − r 2 k − 1 can afford about 2 2 k − 1 2^{2^{k-1}} 2 2 k − 1 steps to refine its knowledge of r r r . Some restriction remains necessary: relative to the oracle of Section 6, attainment fails for all but countably many orders in ( 0 , 1 ) (0,1) ( 0 , 1 ) , including some computable ones (Section A.2). For the candidate order in Theorem 3.3 , polynomial-time approximations a m a_m a m with ∣ a m − a ∣ = O ( log m / m ) |a_m-a|=O(\log m/m) ∣ a m − a ∣ = O ( log m / m ) suffice: use ⌈ a n 2 j ⌉ \lceil a_{n2^j}\rceil ⌈ a n 2 j ⌉ coins, which changes the exponent by O ( log n ) O(\log n) O ( log n ) .
Attainment relative to the negative oracle
Cost of the construction. We use one quantitative fact about the construction of § 6 : there is an absolute constant c c c such that O O O restricted to strings of length at most S s S_s S s is computable from s s s in time 2 2 c n s 2^{2^{c n_s}} 2 2 c n s . At every kind of stage T , N , S s ≤ 2 n s T,N,S_s\leq2^{n_s} T , N , S s ≤ 2 n s , by (5) , (6) and S s = T s / 2 S_s=T_s/2 S s = T s /2 at public-head stages. Every test at stage s s s concerns a machine Q i Q_i Q i with i ≤ s i\leq s i ≤ s on input 1 n s 1^{n_s} 1 n s , run for at most S s S_s S s steps against the oracle frozen so far plus a candidate block, or, for the witness of Theorem 5.9, a machine Q j Q_j Q j with j ≤ s j\leq s j ≤ s on input W s W_s W s , run for fewer than H s / 16 ≤ 2 n s / 4 H_s/16\leq2^{n_s/4} H s /16 ≤ 2 n s /4 steps. Every query such a run can write has length below S s S_s S s , so its answer is already determined, and the run is simulated on each of at most 2 S s 2^{S_s} 2 S s coin strings in poly ( S s ) \operatorname{poly}(S_s) poly ( S s ) steps. Probabilities in the tests are therefore dyadic rationals with denominator at most 2 S s 2^{S_s} 2 S s . Capped moments are tested only in floored form, as dyadic combinations of integers ⌊ τ p / q ⌋ = ⌊ ( τ p ) 1 / q ⌋ \lfloor\tau^{p/q}\rfloor=\lfloor(\tau^p)^{1/q}\rfloor ⌊ τ p / q ⌋ = ⌊( τ p ) 1/ q ⌋ with τ ≤ S s \tau\leq S_s τ ≤ S s and p , q p,q p , q of bit length poly ( log ( s + 2 ) ) \operatorname{poly}(\log(s+2)) poly ( log ( s + 2 )) . Each is an integer q q q th root, computed exactly by binary search in time poly ( S s ) \operatorname{poly}(S_s) poly ( S s ) . So every test is an exact comparison of rationals of bit length poly ( S s ) \operatorname{poly}(S_s) poly ( S s ) with thresholds of bit length O ( n s ) O(n_s) O ( n s ) , and costs 2 S s poly ( S s ) 2^{S_s}\operatorname{poly}(S_s) 2 S s poly ( S s ) , or 2 H s poly ( H s ) 2^{H_s}\operatorname{poly}(H_s) 2 H s poly ( H s ) for the witness, over at most 2 ℓ s + 1 2^{\ell_s+1} 2 ℓ s + 1 candidate witnesses. A block is described by its gate set, at most T T T labels of 4 n s 4n_s 4 n s bits and a terminal, so there are at most 2 N + 4 n s T + n s ≤ 2 2 3 n s 2^{N+4n_sT+n_s}\leq2^{2^{3n_s}} 2 N + 4 n s T + n s ≤ 2 2 3 n s candidates, and at most s + 1 s+1 s + 1 machines are tested against each. Stage s s s therefore costs at most 2 2 3 n s ( s + 1 ) 2 S s poly ( S s ) ≤ 2 2 4 n s 2^{2^{3n_s}}(s+1)2^{S_s}\operatorname{poly}(S_s)\leq2^{2^{4n_s}} 2 2 3 n s ( s + 1 ) 2 S s poly ( S s ) ≤ 2 2 4 n s for large s s s , and the stages up to s s s together cost at most ( s + 1 ) 2 2 4 n s ≤ 2 2 5 n s (s+1)2^{2^{4n_s}}\leq2^{2^{5n_s}} ( s + 1 ) 2 2 4 n s ≤ 2 2 5 n s .
The order matters. Each block is chosen after the oracle outside it is fixed, and its cutoff computations are frozen before later choices are made. Taking a disjoint join with a separately chosen random-chain oracle would not obviously give this, since the other component could encode chain terminals into short answers.
Say that the supremum is attained at r r r if some Q ∈ S r O Q\in S_r^O Q ∈ S r O polynomially dominates every member of S r O ∩ W O S_r^O\cap W^O S r O ∩ W O . Restricting the sources makes attainment easier, so the two results below are stronger in this form. For a sampler Q Q Q put σ ( Q ) = sup { a > 0 : Q ∈ S a O } \sigma(Q)=\sup\{a>0:Q\in S_a^O\} σ ( Q ) = sup { a > 0 : Q ∈ S a O } .
Theorem A.2. If the supremum is attained at r ∈ ( 0 , 1 ) r\in(0,1) r ∈ ( 0 , 1 ) by Q Q Q , then r = σ ( Q ) r=\sigma(Q) r = σ ( Q ) . In particular, the set of r ∈ ( 0 , 1 ) r\in(0,1) r ∈ ( 0 , 1 ) at which it is attained is countable.
Proof. Let Q ∈ S r O Q\in S_r^O Q ∈ S r O be universal for S r O ∩ W O S_r^O\cap W^O S r O ∩ W O , and let r ′ ∈ ( r , 1 ) r'\in(r,1) r ′ ∈ ( r , 1 ) . Choose a rational γ \gamma γ with r < γ < r ′ r<\gamma<r' r < γ < r ′ . The sampler A γ A_\gamma A γ of Theorem 6.5 lies in S γ O ∩ W O ⊆ S r ′ O ∩ W O S_\gamma^O\cap W^O\subseteq S_{r'}^O\cap W^O S γ O ∩ W O ⊆ S r ′ O ∩ W O , so Q Q Q dominates it, while by Theorem 6.5 no sampler in S r ′ O S_{r'}^O S r ′ O does. Hence Q ∉ S r ′ O Q\notin S_{r'}^O Q ∈ / S r ′ O for every r ′ > r r'>r r ′ > r , and σ ( Q ) = r \sigma(Q)=r σ ( Q ) = r . There are countably many samplers.
So attainment fails at uncountably many orders. It also fails at some computable ones; since every rational order is attained (Theorem 3.4 ), such orders are automatically irrational.
Theorem A.3. For every nonempty open interval I ⊆ ( 0 , 1 ) I\subseteq(0,1) I ⊆ ( 0 , 1 ) there is a computable r ∈ I r\in I r ∈ I at which the supremum is not attained. Every such r r r is irrational.
Proof. Fix a computable map π \pi π with π ( t ) ≤ t \pi(t)\leq t π ( t ) ≤ t that takes every value infinitely often, for instance π ( t ) = ν 2 ( t + 1 ) \pi(t)=\nu_2(t+1) π ( t ) = ν 2 ( t + 1 ) . For each t t t consider the public-head stage 3 t 3t 3 t , and write n = n 3 t n=n_{3t} n = n 3 t , h = h 3 t h=h_{3t} h = h 3 t , T = 2 h T=2^h T = 2 h , S = S 3 t = T / 2 S=S_{3t}=T/2 S = S 3 t = T /2 , i = π ( t ) i=\pi(t) i = π ( t ) and
q t = Pr [ T Q i ( n ) ≥ S ] , θ t = − 1 h log max { q t , 2 − 3 n / 4 } . q_t=\Pr\left[TQ_i(n)\geq S\right],\qquad\theta_t=-\frac{1}{h}\log\max\left\{q_t,2^{-3n/4}\right\}. q t = Pr [ T Q i ( n ) ≥ S ] , θ t = − h 1 log max { q t , 2 − 3 n /4 } .
These are determined by O O O restricted to strings of length at most S S S , so by the tie-breaking rule of Section 6 they are computable from t t t in time 2 2 O ( n ) 2^{2^{O(n)}} 2 2 O ( n ) .
Choose rational l 0 < u 0 l_0<u_0 l 0 < u 0 with [ l 0 , u 0 ] ⊆ I [l_0,u_0]\subseteq I [ l 0 , u 0 ] ⊆ I , and define nested intervals [ l t , u t ] [l_t,u_t] [ l t , u t ] of width δ t = ( u 0 − l 0 ) 3 − t \delta_t=(u_0-l_0)3^{-t} δ t = ( u 0 − l 0 ) 3 − t with midpoints m t m_t m t :
Case 1 , θ t < m t \theta_t<m_t θ t < m t : put [ l t + 1 , u t + 1 ] = [ u t − δ t / 3 , u t ] [l_{t+1},u_{t+1}]=[u_t-\delta_t/3,u_t] [ l t + 1 , u t + 1 ] = [ u t − δ t /3 , u t ] ;
Case 2 , θ t ≥ m t \theta_t\ge m_t θ t ≥ m t : put [ l t + 1 , u t + 1 ] = [ l t , l t + δ t / 3 ] [l_{t+1},u_{t+1}]=[l_t,l_t+\delta_t/3] [ l t + 1 , u t + 1 ] = [ l t , l t + δ t /3 ] .
With m t = a / b m_t=a/b m t = a / b , the test θ t < m t \theta_t<m_t θ t < m t reads max { q t , 2 − 3 n / 4 } b > 2 − a h \max\{q_t,2^{-3n/4}\}b>2^{-ah} max { q t , 2 − 3 n /4 } b > 2 − ah , an exact comparison of rationals.
Let r r r be the unique point of ⋂ t [ l t , u t ] \bigcap_t[l_t,u_t] ⋂ t [ l t , u t ] ; it is computable. Since h ≥ n / ( 3 t + 2 ) − 1 h\ge n/(3t+2)-1 h ≥ n / ( 3 t + 2 ) − 1 and n ≥ 2 ( 3 t + 2 ) 2 n\ge2^{(3t+2)^2} n ≥ 2 ( 3 t + 2 ) 2 , we have δ t h / log n → ∞ \delta_t h/\log n\to\infty δ t h / log n → ∞ .
Fix a sampler Q i Q_i Q i .
Case 1 at infinitely many t t t with π ( t ) = i \pi(t)=i π ( t ) = i . If the maximum defining θ t \theta_t θ t were 2 − 3 n / 4 2^{-3n/4} 2 − 3 n /4 , then θ t = 3 n / ( 4 h ) ≥ 1 > m t \theta_t=3n/(4h)\ge1>m_t θ t = 3 n / ( 4 h ) ≥ 1 > m t . So at such t t t the maximum is q t = 2 − θ t h q_t=2^{-\theta_t h} q t = 2 − θ t h . Since r ≥ u t − δ t / 3 = m t + δ t / 6 r\ge u_t-\delta_t/3=m_t+\delta_t/6 r ≥ u t − δ t /3 = m t + δ t /6 , we get r − θ t ≥ δ t / 6 r-\theta_t\ge\delta_t/6 r − θ t ≥ δ t /6 and
E [ ( T Q i ( n ) ) r ] ≥ q t S r = 2 − r 2 ( r − θ t ) h ≥ 1 2 2 δ t h / 6 . \mathbb{E}\left[(T_{Q_i}(n))^r\right]\ge q_t S^r=2^{-r}2^{(r-\theta_t)h}\ge\frac{1}{2}2^{\delta_t h/6}. E [ ( T Q i ( n ) ) r ] ≥ q t S r = 2 − r 2 ( r − θ t ) h ≥ 2 1 2 δ t h /6 .
which exceeds every polynomial in n n n along infinitely many lengths. So Q i ∉ S r O Q_i\notin S_r^O Q i ∈ / S r O .
Case 1 at only finitely many t t t with π ( t ) = i \pi(t)=i π ( t ) = i . Then Case 2 holds for all t ≥ t 0 t\ge t_0 t ≥ t 0 with π ( t ) = i \pi(t)=i π ( t ) = i . Define A i A_i A i as follows. At lengths other than n 3 t n_{3t} n 3 t with π ( t ) = i \pi(t)=i π ( t ) = i it outputs 0 n 0^n 0 n . At n = n 3 t n=n_{3t} n = n 3 t with π ( t ) = i \pi(t)=i π ( t ) = i it computes [ l t , u t ] [l_t,u_t] [ l t , u t ] , which needs q t ′ q_{t'} q t ′ only for t ′ < t t'<t t ′ < t and hence the oracle only up to stage 3 t − 3 3t-3 3 t − 3 . In detail, write n ′ = n 3 t − 3 n'=n_{3t-3} n ′ = n 3 t − 3 . By the cost bound above, O O O up to length S 3 t − 3 S_{3t-3} S 3 t − 3 takes time 2 2 5 n ′ 2^{2^{5n'}} 2 2 5 n ′ . Each q t ′ q_{t'} q t ′ is a dyadic rational read off the S 3 t ′ S_{3t'} S 3 t ′ -step tree of Q π ( t ′ ) Q_{\pi(t')} Q π ( t ′ ) on 1 n 3 t ′ 1^{n_{3t'}} 1 n 3 t ′ , in time 2 S 3 t ′ poly ( S 3 t ′ ) ≤ 2 2 2 n ′ 2^{S_{3t'}}\operatorname{poly}(S_{3t'})\le2^{2^{2n'}} 2 S 3 t ′ poly ( S 3 t ′ ) ≤ 2 2 2 n ′ . Each case test compares max { q t ′ , 2 − 3 n 3 t ′ / 4 } b \max\{q_{t'},2^{-3n_{3t'}/4}\}b max { q t ′ , 2 − 3 n 3 t ′ /4 } b with 2 − a h 2^{-ah} 2 − ah , where m t ′ = a / b m_{t'}=a/b m t ′ = a / b has b = O ( 3 t ′ ) b=O(3^{t'}) b = O ( 3 t ′ ) ; both sides are dyadic rationals of bit length O ( 3 t ′ n ′ ) O(3^{t'}n') O ( 3 t ′ n ′ ) , computed by repeated squaring. The total is at most t 2 2 6 n ′ t2^{2^{6n'}} t 2 2 6 n ′ . Since n ≥ 2 3 t − 1 ≥ 2 3 t − 2 n\ge2^{3t-1}\ge2^{3t-2} n ≥ 2 3 t − 1 ≥ 2 3 t − 2 and n 3 t − 2 ≥ n ′ ≥ 2 ( 3 t − 1 ) 2 n_{3t-2}\ge n'\ge2^{(3t-1)^2} n 3 t − 2 ≥ n ′ ≥ 2 ( 3 t − 1 ) 2 , we have 2 2 n 3 t − 2 ≥ 2 6 n ′ + log t 2^{2n_{3t-2}}\ge2^{6n'+\log t} 2 2 n 3 t − 2 ≥ 2 6 n ′ + l o g t , so this is at most n n n , so the computation takes polynomial time. It then puts γ t = l t + δ t / 3 \gamma_t=l_t+\delta_t/3 γ t = l t + δ t /3 , requires ⌈ γ t h ⌉ \lceil\gamma_t h\rceil ⌈ γ t h ⌉ coins to be zero, and if they are, follows the public-head chain for at most T T T links and outputs the terminal; otherwise it outputs 0 n 0^n 0 n .
For t ≥ t 0 t\ge t_0 t ≥ t 0 with π ( t ) = i \pi(t)=i π ( t ) = i , Case 2 gives r ≤ l t + δ t / 3 = γ t r\le l_t+\delta_t/3=\gamma_t r ≤ l t + δ t /3 = γ t , so the chain walk contributes at most poly ( n ) 2 − ⌈ γ t h ⌉ 2 r h ≤ poly ( n ) \operatorname{poly}(n)2^{-\lceil\gamma_t h\rceil}2^{rh}\le\operatorname{poly}(n) poly ( n ) 2 − ⌈ γ t h ⌉ 2 r h ≤ poly ( n ) to the r r r th moment; the finitely many earlier stages change only constants. So A i ∈ S r O ∩ W O A_i\in S_r^O\cap W^O A i ∈ S r O ∩ W O . At the same stages, Theorem 5.6 (which covers Q i Q_i Q i because i ≤ t ≤ 3 t i\le t\le3t i ≤ t ≤ 3 t ) and Markov’s inequality give
P Q i ( W ∣ n ) ≤ 2 − 3 n / 4 + q t ≤ 2 ⋅ 2 − θ t h , P A i ( W ∣ n ) ≥ 1 2 2 − γ t h . P_{Q_i}(W\mid n)\le2^{-3n/4}+q_t\le2\cdot2^{-\theta_t h},\qquad
P_{A_i}(W\mid n)\ge\frac{1}{2}2^{-\gamma_t h}. P Q i ( W ∣ n ) ≤ 2 − 3 n /4 + q t ≤ 2 ⋅ 2 − θ t h , P A i ( W ∣ n ) ≥ 2 1 2 − γ t h .
Case 2 gives θ t ≥ m t = γ t + δ t / 6 \theta_t\ge m_t=\gamma_t+\delta_t/6 θ t ≥ m t = γ t + δ t /6 , so the ratio P A i / P Q i P_{A_i}/P_{Q_i} P A i / P Q i is at least 1 4 2 δ t h / 6 \frac14 2^{\delta_t h/6} 4 1 2 δ t h /6 along infinitely many lengths, and Q i Q_i Q i does not dominate A i A_i A i .
In both cases Q i Q_i Q i does not witness attainment at r r r . Irrationality follows from Theorem 3.4. □
The order r r r constructed here is computable but extremely slowly approximable: determining its first t t t ternary digits requires the oracle up to stage 3 t 3t 3 t . By Theorem A.1, no order with m m m -bit approximations in time 2 O ( 2 m ) 2^{O(2^m)} 2 O ( 2 m ) can arise this way. Conversely, attained orders cannot be too complicated.
Proposition A.4. The oracle O O O is decidable. For every sampler Q Q Q , the set of rationals u < σ ( Q ) u<\sigma(Q) u < σ ( Q ) is Σ 2 0 \Sigma_2^0 Σ 2 0 , so σ ( Q ) \sigma(Q) σ ( Q ) , when finite, is computable from 0 ′ ′ 0'' 0 ′′ . Consequently every order in ( 0 , 1 ) (0,1) ( 0 , 1 ) at which the supremum is attained is computable from 0 ′ ′ 0'' 0 ′′ .
Proof. To decide a string w w w , find a stage s s s with S s ≥ ∣ w ∣ S_s \ge|w| S s ≥ ∣ w ∣ and compute O O O up to stage s s s by the tie-breaking rule. For rational q > 0 q > 0 q > 0 and integers n , M n, M n , M , the capped moment m q , n , M = E [ min { T Q ( n ) , M } q ] m_{q,n,M} = \mathbb{E}[\min\{T_Q(n), M\}^{q}] m q , n , M = E [ min { T Q ( n ) , M } q ] is a finite combination, with dyadic weights, of numbers k q k^{q} k q with k ≤ M k \le M k ≤ M , obtained from the M M M -step computation tree of Q O Q^O Q O on 1 n 1^n 1 n ; comparing it with a rational is decidable. By monotone convergence, and since a finite moment forces halting almost surely,
Q ∈ S q O ⟺ ∃ C , c ∀ n , M : m q , n , M ≤ C ( n + 2 ) c , Q \in S_q^O \Longleftrightarrow\exists C,c\ \forall n,M : m_{q,n,M} \le C(n+2)^c, Q ∈ S q O ⟺ ∃ C , c ∀ n , M : m q , n , M ≤ C ( n + 2 ) c ,
where malformed outputs are replaced by 0 n 0^n 0 n as in our convention, which does not affect runtimes. So membership is Σ 2 0 \Sigma^0_2 Σ 2 0 , and u < σ ( Q ) u < \sigma(Q) u < σ ( Q ) holds iff Q ∈ S q O Q \in S_q^O Q ∈ S q O for some rational q > u q > u q > u , which is again Σ 2 0 \Sigma^0_2 Σ 2 0 . With 0 ′ ′ 0^{\prime\prime} 0 ′′ one decides this lower cut and computes σ ( Q ) \sigma(Q) σ ( Q ) by bisection. The last claim follows from Theorem A.2 . □
Relative to O O O , then, the attained orders in ( 0 , 1 ) (0,1) ( 0 , 1 ) include every order with m m m -bit approximations in time 2 O ( 2 m ) 2^{O(2^m)} 2 O ( 2 m ) , are countably many, are all computable from 0 ′ ′ 0^{\prime\prime} 0 ′′ , and omit some computable orders.
Open question. Relative to O O O , the set of attained orders in ( 0 , 1 ) (0,1) ( 0 , 1 ) contains every order with m m m -bit approximations in time 2 O ( 2 m ) 2^{O(2^m)} 2 O ( 2 m ) (Theorem A.1 ), is countable and contained in the reals computable from 0 ′ ′ 0^{\prime\prime} 0 ′′ (Theorems A.2 and A.4 ), and misses some computable orders (Theorem A.3 ). Which orders between these bounds are attained? Is there a characterization in terms of the approximation complexity of r r r alone, independent of the oracle?
Proof of Theorem 6.13
Pooled blocks. Consider a gated block at length n n n with seeds [ N ] [N] [ N ] and labels { 0 , 1 } 4 n \{0,1\}^{4n} { 0 , 1 } 4 n . For P ⊆ [ N ] P \subseteq[N] P ⊆ [ N ] and L ⊆ { 0 , 1 } 4 n L \subseteq\{0,1\}^{4n} L ⊆ { 0 , 1 } 4 n , the ( P , L ) (P,L) ( P , L ) -pooled good experiment draws the positive seed uniformly from P P P , the chain labels uniformly without repetition from L L L , and W W W uniformly; the pooled bad experiment with K K K positive seeds draws G G G uniformly among the K K K -subsets of P P P . Seeds outside P P P and labels outside L L L answer ⊥ \perp ⊥ in both experiments. Theorems 5.1 and 5.2 hold for the pooled experiments with ∣ L ∣ |L| ∣ L ∣ in place of U U U and ∣ P ∣ |P| ∣ P ∣ in place of N N N . A query to a seed outside P P P or a label outside L L L answers ⊥ \perp ⊥ in both experiments, so it never hits a hidden node and contributes a factor one to the ratio in Theorem 5.2; and W 0 m − n W0^{m-n} W 0 m − n is guessed without exposure with probability at most 1 / ( 2 n − 1 ) 1/(2^n-1) 1/ ( 2 n − 1 ) .
Lemma B.1 (Pooled dichotomy). Let ρ > 1 \rho> 1 ρ > 1 and b ≥ 1 b \ge1 b ≥ 1 be rationals, T < S T < S T < S powers of two, N N N an integer, Φ ≥ 1 \Phi\ge1 Φ ≥ 1 and J = log ( S / T ) J = \log(S/T) J = log ( S / T ) , and let the pools satisfy
S ≤ N 16 , ∣ P ∣ ≥ 3 N 4 , ∣ L ∣ > T + S , T ρ − 1 N 1 − b > 128 Φ 2 J , S \le\frac{N}{16}, \qquad|P| \ge\frac{3N}{4}, \qquad|L| > T+S, \qquad T^{\rho-1}N^{1-b} > 128\Phi^2J, S ≤ 16 N , ∣ P ∣ ≥ 4 3 N , ∣ L ∣ > T + S , T ρ − 1 N 1 − b > 128 Φ 2 J , δ L : = S T ∣ L ∣ − T − S + 1 2 n − 1 ≤ 1 N b Φ . \delta_L := \frac{ST}{|L|-T-S}+\frac{1}{2^n-1} \le\frac{1}{N^b\Phi}. δ L := ∣ L ∣ − T − S S T + 2 n − 1 1 ≤ N b Φ 1 . Fix Q Q Q , an input length m ≥ n m \ge n m ≥ n and the oracle outside the block, and let q ≤ S ( B ) q_{\leq S}(B) q ≤ S ( B ) be the probability that Q ( 1 m ) Q(1^m) Q ( 1 m ) outputs W 0 m − n W0^{m-n} W 0 m − n in fewer than S S S steps. If the pooled good experiment has E [ q ≤ S ] ≥ 2 / ( N b Φ ) \mathbb{E}[q_{\leq S}] \ge2/(N^b\Phi) E [ q ≤ S ] ≥ 2/ ( N b Φ ) , then for some V ∈ { T , 2 T , … , S / 2 } V \in\{T,2T,\ldots,S/2\} V ∈ { T , 2 T , … , S /2 } some pooled bad block with K = ⌊ ∣ P ∣ / ( 8 V ) ⌋ K=\lfloor|P|/(8V)\rfloor K = ⌊ ∣ P ∣/ ( 8 V )⌋ positive seeds satisfies E [ min { T Q , S } ρ ] > Φ \mathbb{E}[\min\{T_Q,S\}^{\rho}]>\Phi E [ min { T Q , S } ρ ] > Φ .
Proof. Removing the shortcut event from the good-world successes leaves genuine traversals of probability at least 1 / ( N b Φ ) 1/(N^b\Phi) 1/ ( N b Φ ) , each touching the positive seed and halting at a time in [ T , S ) [T,S) [ T , S ) . Some
bucket [ V , 2 V ) [V,2V) [ V , 2 V ) carries probability at least 1 / ( N b Φ J ) 1/(N^{b}\Phi J) 1/ ( N b Φ J ) . Write N ′ = ∣ P ∣ N'=|P| N ′ = ∣ P ∣ , put B ∗ = 2 V ≤ S ≤ N ′ / 8 B^*=2V\le S\le N'/8 B ∗ = 2 V ≤ S ≤ N ′ /8 and K = ⌊ N ′ / ( 4 B ∗ ) ⌋ = ⌊ N ′ / ( 8 V ) ⌋ K=\lfloor N'/(4B^*)\rfloor=\lfloor N'/(8V)\rfloor K = ⌊ N ′ / ( 4 B ∗ )⌋ = ⌊ N ′ / ( 8 V )⌋ ; since N ′ / ( 8 V ) ≥ 2 N'/(8V)\ge2 N ′ / ( 8 V ) ≥ 2 , K ≥ N ′ / ( 16 V ) ≥ N / ( 32 V ) K\ge N'/(16V)\ge N/(32V) K ≥ N ′ / ( 16 V ) ≥ N / ( 32 V ) . The pooled form of Theorem 5.2 with cutoff B ∗ B^* B ∗ transfers these runs to the bad experiment with probability multiplied by at least K / 2 K/2 K /2 , keeping their runtimes, which are at least V V V . Since ⌊ y ⌋ ≥ y / 2 \lfloor y\rfloor\ge y/2 ⌊ y ⌋ ≥ y /2 for y ≥ 1 y\ge1 y ≥ 1 , the bad experiment’s average floored capped moment is at least
V ρ 2 ⋅ K 2 ⋅ 1 N b Φ J ≥ V ρ − 1 N 1 − b 128 Φ J ≥ T ρ − 1 N 1 − b 128 Φ J > Φ , \frac{V^{\rho}}{2}\cdot\frac{K}{2}\cdot\frac{1}{N^{b}\Phi J}\ge\frac{V^{\rho-1}N^{1-b}}{128\Phi J}\ge\frac{T^{\rho-1}N^{1-b}}{128\Phi J}>\Phi, 2 V ρ ⋅ 2 K ⋅ N b Φ J 1 ≥ 128Φ J V ρ − 1 N 1 − b ≥ 128Φ J T ρ − 1 N 1 − b > Φ ,
and some pooled bad block attains at least the average.
For b = 1 b=1 b = 1 this is the pooled form of Theorem 5.4, and for N = T R N=T^R N = T R the condition reads T η > 128 Φ 2 J T^\eta>128\Phi^2J T η > 128 Φ 2 J with η = ρ − 1 − R ( b − 1 ) \eta=\rho-1-R(b-1) η = ρ − 1 − R ( b − 1 ) , as in Theorem 5.5.
Proof of Theorem 6.13. Codes. Stages are s ≥ 1 s\ge1 s ≥ 1 , and stage s s s has code c s = ν 2 ( s ) c_s=\nu_2(s) c s = ν 2 ( s ) . The stages of code c c c are the odd multiples of 2 c 2^c 2 c ; write s + = s + 2 c s + 1 s^+=s+2^{c_s+1} s + = s + 2 c s + 1 for the next stage of the same code, and note s + ≤ 3 s s^+\le3s s + ≤ 3 s and c s ≤ log s c_s\le\log s c s ≤ log s . Decode each code by an elementary bijection as a triple ( τ , i , p ) (\tau,i,p) ( τ , i , p ) with τ ∈ { 0 , 1 , 2 } \tau\in\{0,1,2\} τ ∈ { 0 , 1 , 2 } and i , p ≤ c i,p\le c i , p ≤ c , and call stage s s s gated, head or power according to τ \tau τ . At a gated stage the candidate is Q i s Q_{i_s} Q i s with i s = i i_s=i i s = i , and k s = p + 1 ≤ log s + 1 k_s=p+1\le\log s+1 k s = p + 1 ≤ log s + 1 . At a head stage i i i is unused and p p p decodes to a rational γ s ∈ ( 0 , 1 ) \gamma_s\in(0,1) γ s ∈ ( 0 , 1 ) , by an elementary decoding in which every such rational occurs. At a power stage the candidate is Q i s Q_{i_s} Q i s and p p p decodes to a valid tuple ( R , ρ , b , θ ) (R,\rho,b,\theta) ( R , ρ , b , θ ) by the decoding of Section 6. All decoded components have bit length polynomial in log ( c s + 2 ) \log(c_s+2) log ( c s + 2 ) , so they, their reciprocals, and the gaps 1 − κ k s 1-\kappa_{k_s} 1 − κ k s , ρ − 1 − R ( b − 1 ) \rho-1-R(b-1) ρ − 1 − R ( b − 1 ) and R − θ R-\theta R − θ lie in [ s − o ( 1 ) , s o ( 1 ) ] [s^{-o(1)},s^{o(1)}] [ s − o ( 1 ) , s o ( 1 ) ] .
Parameters. Let D s D_s D s be D k s D_{k_s} D k s at gated stages, 1 1 1 at head stages, and the least common denominator of R R R , θ \theta θ , R b Rb R b and η = ρ − 1 − R ( b − 1 ) \eta=\rho-1-R(b-1) η = ρ − 1 − R ( b − 1 ) at power stages. Put R s = s + 3 R_s=s+3 R s = s + 3 and
n s = 2 s 3 , h s = D s ⌊ 2 s 3 − s D s ⌋ , T s = 2 h s , F s = 2 ⌊ h s / ( 2 s 2 ) ⌋ , Φ s = 2 ⌊ h s / s 2 ⌋ , n_s=2^{s^3},\qquad h_s=D_s\left\lfloor\frac{2^{s^3-s}}{D_s}\right\rfloor,\qquad T_s=2^{h_s},\qquad F_s=2^{\lfloor h_s/(2s^2)\rfloor},\qquad\Phi_s=2^{\lfloor h_s/s^2\rfloor}, n s = 2 s 3 , h s = D s ⌊ D s 2 s 3 − s ⌋ , T s = 2 h s , F s = 2 ⌊ h s / ( 2 s 2 )⌋ , Φ s = 2 ⌊ h s / s 2 ⌋ ,
and
at a gated stage, N s = T s R s N_s=T_s^{R_s} N s = T s R s , S s = T s κ k s R s Φ s 2 S_s=T_s^{\kappa_{k_s}R_s}\Phi_s^2 S s = T s κ k s R s Φ s 2 and ( ρ s , b s ) = ( ρ k s , 1 ) (\rho_s,b_s)=(\rho_{k_s},1) ( ρ s , b s ) = ( ρ k s , 1 ) ;
at a power stage, N s = T s R s N_s=T_s^{R_s} N s = T s R s , S s = T s θ Φ s 2 S_s=T_s^{\theta}\Phi_s^2 S s = T s θ Φ s 2 and ( ρ s , b s ) = ( ρ , b ) (\rho_s,b_s)=(\rho,b) ( ρ s , b s ) = ( ρ , b ) ;
at a head stage, g s = ⌈ γ s h s ⌉ g_s=\lceil\gamma_sh_s\rceil g s = ⌈ γ s h s ⌉ , N s = 2 g s N_s=2^{g_s} N s = 2 g s and S s = T s / 2 S_s=T_s/2 S s = T s /2 ;
and J s = log ( S s / T s ) J_s=\log(S_s/T_s) J s = log ( S s / T s ) at gated and power stages. Since D s D_s D s divides h s h_s h s and κ k D k = k ( 2 k + 1 ) \kappa_kD_k=k(2k+1) κ k D k = k ( 2 k + 1 ) , at gated and power stages T s T_s T s , N s N_s N s , N s b s N_s^{b_s} N s b s , S s S_s S s and T s ρ s − 1 N s 1 − b s = 2 η h s T_s^{\rho_s-1}N_s^{1-b_s}=2^{\eta h_s} T s ρ s − 1 N s 1 − b s = 2 η h s are powers of two, so the weights and tests below are exact. The lengths grow slowly enough that n s + ≤ n s 27 n_{s^+}\le n_s^{27} n s + ≤ n s 27 , while h s = n s 1 − o ( 1 ) h_s=n_s^{1-o(1)} h s = n s 1 − o ( 1 ) and h s / n s − 1 ≥ 2 3 s 2 − 4 s h_s/n_{s-1}\ge2^{3s^2-4s} h s / n s − 1 ≥ 2 3 s 2 − 4 s for large s s s ; the first fact gives losses 2 n s 1 − o ( 1 ) 2^{n_s^{1-o(1)}} 2 n s 1 − o ( 1 ) , the second the pools. Stage s s s carries a gated block B s B_s B s with tag 1 n s 1^{n_s} 1 n s , N s N_s N s seeds, chain length T s T_s T s , labels in { 0 , 1 } 4 n s \{0,1\}^{4n_s} { 0 , 1 } 4 n s and terminal W s ∈ { 0 , 1 } n s ∖ { 0 n s } W_s\in\{0,1\}^{n_s}\setminus\{0^{n_s}\} W s ∈ { 0 , 1 } n s ∖ { 0 n s } . It serves the lengths I s = [ n s , n s + ) I_s=[n_s,n_{s^+}) I s = [ n s , n s + ) . A head stage is thus gated as well, with only 2 ⌈ γ s h s ⌉ 2^{\lceil\gamma_sh_s\rceil} 2 ⌈ γ s h s ⌉ seeds; Theorem B.2 explains why its head is not public.
Runs and weights. A run of an earlier stage is a pair of a machine and an input length, with a cutoff and a weight. At a gated or power stage s 0 s_0 s 0 the runs are ( Q i s 0 , n ) (Q_{i_{s_0}},n) ( Q i s 0 , n ) for n ∈ I s 0 n\in I_{s_0} n ∈ I s 0 , with cutoff S s 0 S_{s_0} S s 0 and weight Λ s 0 = 2 s 0 + 3 N s 0 b s 0 F s 0 S s 0 ⌈ ρ s 0 ⌉ \Lambda_{s_0}=2^{s_0+3}N_{s_0}^{b_{s_0}}F_{s_0}S_{s_0}^{\lceil\rho_{s_0}\rceil} Λ s 0 = 2 s 0 + 3 N s 0 b s 0 F s 0 S s 0 ⌈ ρ s 0 ⌉ ; at a head stage s 0 s_0 s 0 they are ( Q j , n ) (Q_j,n) ( Q j , n ) for j ≤ s 0 j\le s_0 j ≤ s 0 and n ∈ I s 0 n\in I_{s_0} n ∈ I s 0 , with cutoff S s 0 S_{s_0} S s 0 and weight Λ s 0 = 2 n s 0 / 2 \Lambda_{s_0}=2^{n_{s_0}/2} Λ s 0 = 2 n s 0 /2 . Let Ω s 0 \Omega_{s_0} Ω s 0 be the number of runs of stage s 0 s_0 s 0 times Λ s 0 S s 0 \Lambda_{s_0}S_{s_0} Λ s 0 S s 0 . For an oracle X X X the values of a run are
q s 0 , n j ( X ) = Pr [ Q j X ( 1 n ) outputs W s 0 0 n − n s 0 in fewer than S s 0 steps ] , q^j_{s_0,n}(X)=\Pr[Q_j^X(1^n)\text{ outputs }W_{s_0}0^{n-n_{s_0}}\text{ in fewer than }S_{s_0}\text{ steps}], q s 0 , n j ( X ) = Pr [ Q j X ( 1 n ) outputs W s 0 0 n − n s 0 in fewer than S s 0 steps ] ,
M s 0 , n ( X ) = E [ [ min { T Q i s 0 X ( n ) , S s 0 } ] ρ s 0 ] . M_{s_0,n}(X)=\mathbb{E}\left[\left[\min\{T_{Q_{i_{s_0}}^X}(n),S_{s_0}\}\right]^{\rho_{s_0}}\right]. M s 0 , n ( X ) = E [ [ min { T Q i s 0 X ( n ) , S s 0 } ] ρ s 0 ] .
the second only at gated and power stages; there we write q s 0 , n q_{s_0,n} q s 0 , n for q s 0 , n i s 0 q^{i_{s_0}}_{s_0,n} q s 0 , n i s 0 .
Active stages. Call s s s active if h s ≥ 1 h_s \ge1 h s ≥ 1 , the block’s query encodings are shorter than S s S_s S s , S s T s ≤ 2 n s S_sT_s \le2^{n_s} S s T s ≤ 2 n s , Ω s ≤ 2 n s \Omega_s \le2^{n_s} Ω s ≤ 2 n s ,
h s ≥ n s − 1 + s + 3 , (9) h_s \ge n_{s-1}+s+3, \tag*{(9)} h s ≥ n s − 1 + s + 3 , (9)
and
at gated and power stages, S s ≤ N s / 16 S_s \le N_s/16 S s ≤ N s /16 , T s ρ s − 1 N s 1 − b s > 128 Φ s 2 J s T_s^{\rho_{s-1}}N_s^{1-b_s} > 128\Phi_s^2J_s T s ρ s − 1 N s 1 − b s > 128 Φ s 2 J s , N s b s Φ s ≤ 2 n s − 2 N_s^{b_s}\Phi_s \le2^{n_s-2} N s b s Φ s ≤ 2 n s − 2 and Φ s ≥ 4 n s + F s \Phi_s \ge4n_s+F_s Φ s ≥ 4 n s + F s ;
at head stages, g s ≥ n s − 1 + s + 6 g_s \ge n_{s-1}+s+6 g s ≥ n s − 1 + s + 6 and ( s + 1 ) n s + 2 2 − n s / 2 < 1 (s+1)n_{s+}2^{2-n_s/2}<1 ( s + 1 ) n s + 2 2 − n s /2 < 1 .
Every large s s s is active. Indeed D s ≤ 2 ( log s ) o ( 1 ) D_s \le2^{(\log s)^{o(1)}} D s ≤ 2 ( l o g s ) o ( 1 ) , so h s ≥ 2 s 3 − s − 1 h_s \ge2^{s^3-s-1} h s ≥ 2 s 3 − s − 1 , while log n s + ≤ 27 s 3 \log n_{s+} \le27s^3 log n s + ≤ 27 s 3 , log n s − 1 = ( s − 1 ) 3 \log n_{s-1}=(s-1)^3 log n s − 1 = ( s − 1 ) 3 , and h s ≤ n s 2 − s h_s \le n_s2^{-s} h s ≤ n s 2 − s . Each condition compares two exponents. For S s ≤ N s / 16 S_s \le N_s/16 S s ≤ N s /16 the margin is ( R − θ ) h s (R-\theta)h_s ( R − θ ) h s , respectively ( 1 − κ k ) R s h s ≥ h s (1-\kappa_k)R_sh_s \ge h_s ( 1 − κ k ) R s h s ≥ h s , against 2 h s / s 2 + 4 2h_s/s^2+4 2 h s / s 2 + 4 . For the second gated and power condition the left exponent is η h s ≥ h s s − o ( 1 ) \eta h_s \ge h_ss^{-o(1)} η h s ≥ h s s − o ( 1 ) , with η = 1 / k s \eta=1/k_s η = 1/ k s at gated stages, against 2 h s / s 2 + O ( log h s ) 2h_s/s^2+O(\log h_s) 2 h s / s 2 + O ( log h s ) . For the third, b s log N s + log Φ s ≤ ( s + 4 ) h s ≤ ( s + 4 ) n s 2 − s b_s\log N_s+\log\Phi_s\le(s+4)h_s\le(s+4)n_s2^{-s} b s log N s + log Φ s ≤ ( s + 4 ) h s ≤ ( s + 4 ) n s 2 − s . The fourth needs h s / ( 2 s 2 ) ≥ 27 s 3 + 4 h_s/(2s^2)\ge27s^3+4 h s / ( 2 s 2 ) ≥ 27 s 3 + 4 . For Ω s \Omega_s Ω s at gated and power stages, log Ω s ≤ b s log N s + ( ⌈ ρ s ⌉ + 1 ) log S s + O ( s 3 ) \log\Omega_s\le b_s\log N_s+(\lceil\rho_s\rceil+1)\log S_s+O(s^3) log Ω s ≤ b s log N s + (⌈ ρ s ⌉ + 1 ) log S s + O ( s 3 ) , which is at most s O ( 1 ) h s ≤ n s s^{O(1)}h_s\le n_s s O ( 1 ) h s ≤ n s . At head stages log Ω s ≤ n s / 2 + h s + O ( s 3 ) ≤ n s \log\Omega_s\le n_s/2+h_s+O(s^3)\le n_s log Ω s ≤ n s /2 + h s + O ( s 3 ) ≤ n s , and g s ≥ γ s h s ≥ n s − 1 + s + 6 g_s\ge\gamma_sh_s\ge n_{s-1}+s+6 g s ≥ γ s h s ≥ n s − 1 + s + 6 since γ s ≥ s − o ( 1 ) \gamma_s\ge s^{-o(1)} γ s ≥ s − o ( 1 ) . The remaining conditions are immediate. As in § 6 , every test compares integers of polynomial bit length: on input 1 n 1^n 1 n only the s ≤ ( log n ) 1 / 3 s\le(\log n)^{1/3} s ≤ ( log n ) 1/3 with n s ≤ n n_s\le n n s ≤ n matter, the numbers involved have O ( s 3 ) O(s^3) O ( s 3 ) -bit exponents, and n s + ≤ n 27 n_{s+}\le n^{27} n s + ≤ n 27 . So one finds in polynomial time the active stages s s s with n s ≤ n n_s\le n n s ≤ n and their parameters.
Construction. Inactive stages receive no block and contribute no runs. At an active stage s s s let O < s O_{<s} O < s consist of the blocks B s 0 ∗ B^*_{s_0} B s 0 ∗ already chosen, with every other answer zero. For a seed g g g and a label u ∈ { 0 , 1 } 4 n s u\in\{0,1\}^{4n_s} u ∈ { 0 , 1 } 4 n s of stage s s s let
w s ( g ) = ∑ runs ( Q j , n ) of active s 0 < s Λ s 0 Pr [ Q j O < s ( 1 n ) queries the gate g of stage s within S s 0 steps ] , w_s(g)=\sum_{\substack{\text{runs }(Q_j,n)\text{ of active }s_0<s}}\Lambda_{s_0}\Pr\left[Q_j^{O_{<s}}(1^n)\text{ queries the gate }g\text{ of stage }s\text{ within }S_{s_0}\text{ steps}\right], w s ( g ) = runs ( Q j , n ) of active s 0 < s ∑ Λ s 0 Pr [ Q j O < s ( 1 n ) queries the gate g of stage s within S s 0 steps ] ,
and define w s ( u ) w_s(u) w s ( u ) in the same way with chain queries. A run of fewer than S s 0 S_{s_0} S s 0 steps makes fewer than S s 0 S_{s_0} S s 0 queries, so the total weight is
∑ g w s ( g ) + ∑ u w s ( u ) ≤ ∑ s 0 < s Ω s 0 ≤ ∑ s 0 < s 2 n s 0 ≤ 2 n s − 1 + 1 . \sum_g w_s(g)+\sum_u w_s(u)\le\sum_{s_0<s}\Omega_{s_0}\le\sum_{s_0<s}2^{n_{s_0}}\le2^{n_{s-1}+1}. g ∑ w s ( g ) + u ∑ w s ( u ) ≤ s 0 < s ∑ Ω s 0 ≤ s 0 < s ∑ 2 n s 0 ≤ 2 n s − 1 + 1 .
Let K ˉ s = N s / ( 8 T s ) \bar K_s=N_s/(8T_s) K ˉ s = N s / ( 8 T s ) at gated and power stages and K ˉ s = 1 \bar K_s=1 K ˉ s = 1 at head stages, and put
P s = { g : w s ( g ) ≤ 2 − s − 3 / K ˉ s } , L s = { u : w s ( u ) ≤ 2 − s − 3 / T s } . P_s=\{g:w_s(g)\le2^{-s-3}/\bar K_s\},\qquad L_s=\{u:w_s(u)\le2^{-s-3}/T_s\}. P s = { g : w s ( g ) ≤ 2 − s − 3 / K ˉ s } , L s = { u : w s ( u ) ≤ 2 − s − 3 / T s } .
At most 2 n s − 1 + s + 4 K ˉ s 2^{n_{s-1}+s+4}\bar K_s 2 n s − 1 + s + 4 K ˉ s seeds lie outside P s P_s P s . This is at most N s / 4 N_s/4 N s /4 : at gated and power stages by (9) , and at head stages because g s ≥ n s − 1 + s + 6 g_s\ge n_{s-1}+s+6 g s ≥ n s − 1 + s + 6 . At most 2 n s − 1 + s + 4 T s ≤ 2 4 n s / 4 2^{n_{s-1}+s+4}T_s\le2^{4n_s}/4 2 n s − 1 + s + 4 T s ≤ 2 4 n s /4 labels lie outside L s L_s L s . So ∣ P s ∣ ≥ 3 N s / 4 |P_s|\ge3N_s/4 ∣ P s ∣ ≥ 3 N s /4 , ∣ L s ∣ ≥ 3 ⋅ 2 4 n s / 4 |L_s|\ge3\cdot2^{4n_s}/4 ∣ L s ∣ ≥ 3 ⋅ 2 4 n s /4 , and δ L s ≤ 2 2 − n s \delta_{L_s}\le2^{2-n_s} δ L s ≤ 2 2 − n s because S s T s ≤ 2 n s S_sT_s\le2^{n_s} S s T s ≤ 2 n s .
Protection. Let B B B be any block at stage s s s with at most K ˉ s \bar K_s K ˉ s positive seeds, all in P s P_s P s , and chain labels in L s L_s L s , and let X X X be O < s O_{<s} O < s with B B B added. For every run ( Q j , n ) (Q_j,n) ( Q j , n ) of an active s 0 < s s_0<s s 0 < s , the runs of Q j ( 1 n ) Q_j(1^n) Q j ( 1 n ) under O < s O_{<s} O < s and under X X X agree until the first query to a positive seed or a chain label of B B B . The probability of such a query within S s 0 S_{s_0} S s 0 steps under O < s O_{<s} O < s is at most
1 Λ s 0 ( K ˉ s ⋅ 2 − s − 3 K ˉ s + T s ⋅ 2 − s − 3 T s ) = 2 − s − 2 Λ s 0 . (10) \frac{1}{\Lambda_{s_0}}\left(\bar K_s\cdot\frac{2^{-s-3}}{\bar K_s}+T_s\cdot\frac{2^{-s-3}}{T_s}\right)=\frac{2^{-s-2}}{\Lambda_{s_0}}. \tag*{(10)} Λ s 0 1 ( K ˉ s ⋅ K ˉ s 2 − s − 3 + T s ⋅ T s 2 − s − 3 ) = Λ s 0 2 − s − 2 . (10)
Hence q s 0 , n j q^{j}_{s_0,n} q s 0 , n j changes by at most 2 − s − 2 / Λ s 0 2^{-s-2}/\Lambda_{s_0} 2 − s − 2 / Λ s 0 and M s 0 , n M_{s_0,n} M s 0 , n by at most S s 0 ρ s 0 2 − s − 2 / Λ s 0 S_{s_0}^{\rho_{s_0}}2^{-s-2}/\Lambda_{s_0} S s 0 ρ s 0 2 − s − 2 / Λ s 0 . This holds for every such B B B , not only for most.
Choice of B s ∗ B^*_s B s ∗ . Let μ \mu μ be the ( P s , L s ) (P_s,L_s) ( P s , L s ) -pooled good experiment, and write q s , n j ( B ) q^j_{s,n}(B) q s , n j ( B ) and M s , n ( B ) M_{s,n}(B) M s , n ( B ) for the values under O < s O_{<s} O < s with B B B added.
Good gated or power stage: if E μ [ q s , n ] < 1 / ( 2 n s + + N s b s F s ) \mathbb{E}_{\mu}[q_{s,n}] < 1/(2n_{s+}+N_s^{b_s}F_s) E μ [ q s , n ] < 1/ ( 2 n s + + N s b s F s ) for every n ∈ I s n \in I_s n ∈ I s , Markov’s inequality and a union bound over fewer than n s + n_{s+} n s + lengths give a pooled good block with q s , n < 1 / ( N s b s F s ) q_{s,n} < 1/(N_s^{b_s}F_s) q s , n < 1/ ( N s b s F s ) for all n ∈ I s n \in I_s n ∈ I s at once. Let B s ∗ B_s^* B s ∗ be the first one.
E μ [ q s , n ] ≥ 1 2 n s + + N s b s F s ≥ 2 N s b s Φ s . \mathbb{E}_{\mu}[q_{s,n}] \ge\frac{1}{2n_{s+}+N_s^{b_s}F_s} \ge\frac{2}{N_s^{b_s}\Phi_s}. E μ [ q s , n ] ≥ 2 n s + + N s b s F s 1 ≥ N s b s Φ s 2 .
Theorem B.1 with ( ρ , b ) = ( ρ s , b s ) (\rho,b)=(\rho_s,b_s) ( ρ , b ) = ( ρ s , b s ) , Φ = Φ s \Phi=\Phi_s Φ = Φ s and m = n s ∗ m=n_s^* m = n s ∗ gives a pooled bad block with M s , n s ∗ > Φ s M_{s,n_s^*}>\Phi_s M s , n s ∗ > Φ s and K = ⌊ ∣ P s ∣ / ( 8 V ) ⌋ ≤ N s / ( 8 T s ) K=\lfloor|P_s|/(8V)\rfloor\le N_s/(8T_s) K = ⌊ ∣ P s ∣/ ( 8 V )⌋ ≤ N s / ( 8 T s ) positive seeds. Let B s ∗ B_s^* B s ∗ be the first one.
Head stage: outside the shortcut event of the pooled Theorem 5.1, exposing the terminal requires at least T s T_s T s sequential chain queries, so no genuine traversal finishes before the cutoff S s = T s / 2 S_s=T_s/2 S s = T s /2 . So E μ [ q s , n j ] ≤ δ L s ≤ 2 − 2 n s \mathbb{E}_{\mu}[q_{s,n}^j]\le\delta_{L_s}\le2^{-2n_s} E μ [ q s , n j ] ≤ δ L s ≤ 2 − 2 n s for all j j j and n n n . By Markov’s inequality and a union bound over the at most ( s + 1 ) n s + (s+1)n_{s+} ( s + 1 ) n s + pairs ( j , n ) (j,n) ( j , n ) with j ≤ s j\le s j ≤ s and n ∈ I s n\in I_s n ∈ I s , some pooled good block has q s , n j ≤ 2 − n s / 2 q_{s,n}^j\le2^{-n_s/2} q s , n j ≤ 2 − n s /2 for all of them. Let B s ∗ B_s^* B s ∗ be the first one.
Either way B s ∗ B_s^* B s ∗ satisfies the hypothesis of the protection step. Every choice is a finite computation over finitely many coin strings and block descriptions, and every test compares rationals exactly, so the union O i o O_{io} O i o of the chosen blocks, with all other answers zero, is computable.
Preservation. Fix a run ( Q j , n ) (Q_j,n) ( Q j , n ) of an active stage s 0 s_0 s 0 . Its values depend only on strings shorter than S s 0 S_{s_0} S s 0 , hence on finitely many stages, and each later stage changes them by at most (10) . Summing over s > s 0 s>s_0 s > s 0 , the total change is at most 2 − s 0 − 1 / Λ s 0 2^{-s_0-1}/\Lambda_{s_0} 2 − s 0 − 1 / Λ s 0 in q q q , and at most S s 0 2 2 − s 0 − 1 / Λ s 0 ≤ 1 S_{s_0}^2 2^{-s_0-1}/\Lambda_{s_0}\le1 S s 0 2 2 − s 0 − 1 / Λ s 0 ≤ 1 in M M M .
With the weights above:
at a good gated or power stage s s s , q s , n ( O i o ) < 2 / ( N s b s F s ) q_{s,n}(O_{io})<2/(N_s^{b_s}F_s) q s , n ( O i o ) < 2/ ( N s b s F s ) for every n ∈ I s n\in I_s n ∈ I s ;
at a bad gated or power stage s s s , M s , n s ∗ ( O i o ) > Φ s − 1 ≥ F s M_{s,n_s^*}(O_{io})>\Phi_s-1\ge F_s M s , n s ∗ ( O i o ) > Φ s − 1 ≥ F s ;
at a head stage s s s , q s , n j ( O i o ) ≤ 2 1 − n s / 2 q_{s,n}^j(O_{io})\le2^{1-n_s/2} q s , n j ( O i o ) ≤ 2 1 − n s /2 for all j ≤ s j\le s j ≤ s and n ∈ I s n\in I_s n ∈ I s .
The sources. For a code c c c , let A c A_c A c on input 1 n 1^n 1 n find the largest active stage s s s of code c c c with n s ≤ n n_s\le n n s ≤ n , and output 0 n 0^n 0 n if there is none. Otherwise it picks a uniform seed among N s N_s N s using log N s \log N_s log N s fair bits, outputs 0 n 0^n 0 n if the gate is negative, and otherwise follows the chain for at most T s T_s T s links and outputs W s 0 n − n s W_s0^{n-n_s} W s 0 n − n s ; malformed answers or a timeout give 0 n 0^n 0 n . Since every large stage is active and the stages of a code are unbounded, n ∈ I s n\in I_s n ∈ I s for this s s s once n n n is large. A c A_c A c stores a seed, a constant number of 4 n s 4n_s 4 n s -bit labels and a counter, so A c ∈ W O i o A_c\in\mathcal{W}^{O_{io}} A c ∈ W O i o ; each link costs poly ( n s ) \operatorname{poly}(n_s) poly ( n s ) steps, so its worst-case time is poly ( n ) ( 1 + T s ) \operatorname{poly}(n)(1+T_s) poly ( n ) ( 1 + T s ) with log T s = h s ≤ n s 2 − s ≤ n 2 − s = o ( n ) \log T_s=h_s\le n_s2^{-s}\le n2^{-s}=o(n) log T s = h s ≤ n s 2 − s ≤ n 2 − s = o ( n ) . At a length served by a stage that is not bad, the gate is positive for exactly one seed, so P A c ( W s 0 n − n s ∣ n ) = 1 / N s P_{A_c}(W_s0^{n-n_s}\mid n)=1/N_s P A c ( W s 0 n − n s ∣ n ) = 1/ N s , and for every fixed r > 0 r>0 r > 0
E [ T A c ( n ) r ] ≤ poly c , r ( n ) ( 1 + T s r / N s ) . \mathbb{E}\left[T_{A_c}(n)^r\right]\le\operatorname{poly}_{c,r}(n)(1+T_s^r/N_s). E [ T A c ( n ) r ] ≤ poly c , r ( n ) ( 1 + T s r / N s ) .
This is poly ( n ) ( 1 + T s r − R s ) \operatorname{poly}(n)(1+T_s^{r-R_s}) poly ( n ) ( 1 + T s r − R s ) at gated stages, poly ( n ) ( 1 + T s r − R ) \operatorname{poly}(n)(1+T_s^{r-R}) poly ( n ) ( 1 + T s r − R ) at power stages, and at most 2 poly ( n ) 2\operatorname{poly}(n) 2 poly ( n ) for r = γ r=\gamma r = γ at head stages.
Analysis. Let Q = Q i ∈ S i o O i o Q=Q_i\in S_{io}^{O_{io}} Q = Q i ∈ S i o O i o with E [ T Q ( n ) a ] ≤ C ( n + 2 ) e \mathbb{E}[T_Q(n)^a]\le C(n+2)^e E [ T Q ( n ) a ] ≤ C ( n + 2 ) e for all n n n .
(i) Let c c c be a gated or power code with candidate i i i and ρ s < a \rho_s<a ρ s < a . At a bad stage s s s of code c c c , since n s ∗ < n s + n_s^*<n_{s+} n s ∗ < n s + ,
C ( n s ∗ + 2 ) e ≥ E [ T Q ( n s ∗ ) a ] ≥ M s , n s ∗ ( O i o ) > F s , C(n_s^*+2)^e\ge\mathbb{E}[T_Q(n_s^*)^a]\ge M_{s,n_s^*}(O_{io})>F_s, C ( n s ∗ + 2 ) e ≥ E [ T Q ( n s ∗ ) a ] ≥ M s , n s ∗ ( O i o ) > F s ,
which fails for large s s s , because n s ∗ < n s + ≤ n s 27 n_s^*<n_{s+}\le n_s^{27} n s ∗ < n s + ≤ n s 27 while log F s ≥ h s / ( 2 s 2 ) − 1 \log F_s\ge h_s/(2s^2)-1 log F s ≥ h s / ( 2 s 2 ) − 1 ; so only finitely many stages of code c c c are bad, and the sources above have the stated moments up to constants. At a large length n n n served by a good stage s s s , put x = W s 0 n − n s x=W_s0^{n-n_s} x = W s 0 n − n s , so P A c ( x ∣ n ) = 1 / N s P_{A_c}(x\mid n)=1/N_s P A c ( x ∣ n ) = 1/ N s . Write S s = T s ϑ Φ s 2 S_s=T_s^\vartheta\Phi_s^2 S s = T s ϑ Φ s 2 , with ϑ = κ κ R s \vartheta=\kappa_\kappa R_s ϑ = κ κ R s or ϑ = θ \vartheta=\theta ϑ = θ . Then ϑ a > ϑ ρ s > R ′ b s \vartheta a>\vartheta\rho_s>R'b_s ϑ a > ϑ ρ s > R ′ b s , where R ′ = R s R'=R_s R ′ = R s or R ′ = R R'=R R ′ = R , by κ κ ρ k > 1 \kappa_\kappa\rho_k>1 κ κ ρ k > 1 and by validity of the tuple. So S s a ≥ N s b s Φ s 2 S_s^a\ge N_s^{b_s}\Phi_s^2 S s a ≥ N s b s Φ s 2 , and Markov’s inequality gives
P Q ( x ∣ n ) ≤ q s , n ( O i o ) + C ( n + 2 ) e S s a ≤ 2 N s b s F s + C ( n + 2 ) e N s b s Φ s 2 ≤ 3 N s b s F s = 3 F s P A c ( x ∣ n ) b s , P_Q(x\mid n)\le q_{s,n}(O_{io})+\frac{C(n+2)^e}{S_s^a}\le\frac{2}{N_s^{b_s}F_s}+\frac{C(n+2)^e}{N_s^{b_s}\Phi_s^2}\le\frac{3}{N_s^{b_s}F_s}=\frac{3}{F_s}P_{A_c}(x\mid n)^{b_s}, P Q ( x ∣ n ) ≤ q s , n ( O i o ) + S s a C ( n + 2 ) e ≤ N s b s F s 2 + N s b s Φ s 2 C ( n + 2 ) e ≤ N s b s F s 3 = F s 3 P A c ( x ∣ n ) b s ,
using Φ s ≥ F s ≥ C ( n + 2 ) e \Phi_s \ge F_s \ge C(n+2)e Φ s ≥ F s ≥ C ( n + 2 ) e for large s s s . So P A c ( x ∣ n ) β / P Q ( x ∣ n ) ≥ F s / 3 P_{A_c}(x\mid n)^\beta/P_Q(x\mid n) \ge F_s/3 P A c ( x ∣ n ) β / P Q ( x ∣ n ) ≥ F s /3 for every β ≤ b s \beta\le b_s β ≤ b s . For a fixed code, s + − s s^+ - s s + − s is a constant C 0 C_0 C 0 , so log n < ( s + C 0 ) 3 \log n < (s+C_0)^3 log n < ( s + C 0 ) 3 , while log log F s ≥ s 3 − s − 2 log s − 3 \log\log F_s \ge s^3-s-2\log s-3 log log F s ≥ s 3 − s − 2 log s − 3 . Hence F s / 3 ≥ 2 n 1 − ε F_s/3 \ge2^{n^{1-\varepsilon}} F s /3 ≥ 2 n 1 − ε at all large n n n , for every ε > 0 \varepsilon>0 ε > 0 .
(ii) Let c c c be the head code with rational γ \gamma γ , and let β ≥ 1 \beta\ge1 β ≥ 1 with β γ < a \beta\gamma<a β γ < a . For every large n n n , the stage s s s serving n n n has s ≥ i s\ge i s ≥ i , so x = W s 0 n − n s x=W_s^{0n-ns} x = W s 0 n − n s satisfies
P Q ( x ∣ n ) P A c ( x ∣ n ) β ≤ 2 β T s β γ ( 2 1 − n s / 2 + 2 a C ( n + 2 ) e T s a ) ≤ 2 β + 1 2 β γ h s − n s / 2 + 2 a + β C ( n + 2 ) e 2 − ( a − β γ ) h s . \frac{P_Q(x\mid n)}{P_{A_c}(x\mid n)^\beta}
\le2^{\beta T_s^{\beta\gamma}}\left(2^{1-n_s/2}+\frac{2^aC(n+2)e}{T_s^a}\right)
\le2^{\beta+1}2^{\beta\gamma h_s-n_s/2}+2^{a+\beta}C(n+2)e\,2^{-(a-\beta\gamma)h_s}. P A c ( x ∣ n ) β P Q ( x ∣ n ) ≤ 2 β T s β γ ( 2 1 − n s /2 + T s a 2 a C ( n + 2 ) e ) ≤ 2 β + 1 2 β γ h s − n s /2 + 2 a + β C ( n + 2 ) e 2 − ( a − β γ ) h s .
by preservation, Markov’s inequality at S s = T s / 2 S_s=T_s/2 S s = T s /2 , which gives the factor 2 a 2^a 2 a , and P A c ( x ∣ n ) = 2 − g s ≥ T s − γ / 2 P_{A_c}(x\mid n)=2^{-g_s}\ge T_s^{-\gamma}/2 P A c ( x ∣ n ) = 2 − g s ≥ T s − γ /2 . Since h s ≤ n s 2 − s h_s\le n_s2^{-s} h s ≤ n s 2 − s , the first exponent is at most − n s / 4 -n_s/4 − n s /4 for large s s s ; since log n ≤ 27 s 3 \log n\le27s^3 log n ≤ 27 s 3 , the second term is at most 2 − ( a − β γ ) h s / 2 2^{-(a-\beta\gamma)h_s/2} 2 − ( a − β γ ) h s /2 . Both are below 2 − n 1 − ε / 2 2^{-n^{1-\varepsilon}/2} 2 − n 1 − ε /2 at all large n n n , as h s ≥ 2 s 3 − s − 1 h_s\ge2^{s^3-s-1} h s ≥ 2 s 3 − s − 1 and log n < ( s + C 0 ) 3 \log n<(s+C_0)^3 log n < ( s + C 0 ) 3 .
Conclusion. Part 1: given a > 1 a>1 a > 1 and Q = Q i Q=Q_i Q = Q i , choose k k k with ρ k < a \rho_k<a ρ k < a and let c c c be the gated code of ( i , k − 1 ) (i,k-1) ( i , k − 1 ) ; by (i) with β = 1 \beta=1 β = 1 , A c ∈ S O 1 i o ∩ W O i o A_c\in SO^{\mathrm{io}}_1\cap WO^{\mathrm{io}} A c ∈ S O 1 io ∩ W O io is as claimed, because R s → ∞ R_s\to\infty R s → ∞ . Part 2: let A γ = A c A_\gamma=A_c A γ = A c for the head code c c c of γ \gamma γ ; then A γ ∈ S O γ i o ∩ W O i o A_\gamma\in SO^{\mathrm{io}}_\gamma\cap WO^{\mathrm{io}} A γ ∈ S O γ io ∩ W O io , and (ii) applies to every Q Q Q of order a > γ a>\gamma a > γ and every β ∈ [ 1 , a / γ ) \beta\in[1,a/\gamma) β ∈ [ 1 , a / γ ) . Part 3: if r ≥ 1 r\ge1 r ≥ 1 , then a > 1 a>1 a > 1 and β < 1 + ( a − 1 ) / r \beta<1+(a-1)/r β < 1 + ( a − 1 ) / r ; choose the valid tuple of the proof of Theorem 6.6, with R > r R>r R > r , ρ < a \rho<a ρ < a and b > β b>\beta b > β , and let c c c be the power code of Q i Q_i Q i and this tuple. Then A c ∈ S O r i o ∩ W O i o A_c\in SO^{\mathrm{io}}_r\cap WO^{\mathrm{io}} A c ∈ S O r io ∩ W O io because R > r R>r R > r , and (i) applies with β < b \beta<b β < b . If r < 1 r<1 r < 1 , then β < a / r \beta<a/r β < a / r ; choose a rational γ \gamma γ with r < γ < min { 1 , a / β } r<\gamma<\min\{1,a/\beta\} r < γ < min { 1 , a / β } and use Part 2, as S γ ⊆ S r S_\gamma\subseteq S_r S γ ⊆ S r . The consequences follow as in Theorems 4.4, 6.7 and 6.8: the lower bounds hold relative to every oracle, and a Rényi bound D α ( P A ∥ P Q ) ≤ ℓ D_\alpha(P_A\mathbin\Vert P_Q)\le\ell D α ( P A ∥ P Q ) ≤ ℓ at some length n n n gives P Q ( x ∣ n ) ≥ P A ( x ∣ n ) α / ( α − 1 ) 2 − ℓ P_Q(x\mid n)\ge P_A(x\mid n)^{\alpha/(\alpha-1)}2^{-\ell} P Q ( x ∣ n ) ≥ P A ( x ∣ n ) α / ( α − 1 ) 2 − ℓ for all x x x at that length, which Parts 2 and 3 exclude for ℓ = n 1 − ε \ell=n^{1-\varepsilon} ℓ = n 1 − ε at all large lengths. □ \square □
Remark B.2 (What the pools buy). If later blocks are chosen at random, a bad block must be realized : an actual block must give the capped moment M M M a large value while the good requirements of other codes survive. From E [ M ] > 2 F \mathbb{E}[M]>2F E [ M ] > 2 F and M ≤ S ρ M\le S^\rho M ≤ S ρ one only gets Pr [ M > F ] ≥ F / S ρ \Pr[M>F]\ge F/S^\rho Pr [ M > F ] ≥ F / S ρ , which is far too small for a union bound against requirements that tolerate failure probability about n − O ( 1 ) n^{-O(1)} n − O ( 1 ) , and a winner can arrange its large moments to occur exactly on configurations that help another code. The pools remove the union bound altogether: by (8) every pooled block protects all earlier requirements, so whichever bad block attains the average in Theorem B.1 will do. A small machine that probes fixed positions of a later block to read a pointer from its positive seeds cannot do so, because the positions it probes heavily are excluded from the pool. The price is the separation (7): a later block has positive density at most 1 / ( 8 T s ) 1/(8T_s) 1/ ( 8 T s ) , which must be small against the total weight 2 n s − 1 + 1 2^{n_s-1+1} 2 n s − 1 + 1 of the earlier requirements. This is why each stage carries a single block.
The same protection requirement is why the head stages are gated. The public head 0 4 n s 0^{4n_s} 0 4 n s of Section 6 is one fixed string. Without tag gaps an earlier run can query it within its cutoff, its answer changes from ⊥ \perp ⊥ to u 1 u_1 u 1 when the block is installed, and no pool can exclude it. Publishing the head behind a tag longer than every earlier cutoff would restore protection, but writing that tag needs superpolynomial query-tape space, which would take the source out of W \mathcal{W} W . A gate with 2 γ h s 2^{\gamma h_s} 2 γ h s seeds spends the coins that the source spends anyway, and it turns the head into one pooled seed.
Proof of the profile of the positive oracle
Lemma C.1 (A canonical light point). Let μ \mu μ be a distribution on { 0 , 1 } n \{0,1\}^n { 0 , 1 } n , n ≥ 4 n\ge4 n ≥ 4 , whose CDF in lexicographic order can be evaluated deterministically with additive error at most 2 − 2 n 2^{-2n} 2 − 2 n . Then O ( n ) O(n) O ( n ) evaluations determine, deterministically, a string x x x whose first bit is one and with μ ( x ) ≤ 3 ⋅ 2 − n \mu(x)\le3\cdot2^{-n} μ ( x ) ≤ 3 ⋅ 2 − n . Proof. Start from the set of strings with first bit one. At a current prefix, estimate the masses of its two children as differences of two CDF values, each with error at most 2 ⋅ 2 − 2 n 2 \cdot2^{-2n} 2 ⋅ 2 − 2 n , and move to the child with the smaller estimate, ties broken by a fixed rule. The chosen child has true mass at most half the parent’s plus 2 ⋅ 2 − 2 n 2 \cdot2^{-2n} 2 ⋅ 2 − 2 n . After n − 1 n-1 n − 1 steps the mass is at most 2 − ( n − 1 ) + 4 ⋅ 2 − 2 n ≤ 3 ⋅ 2 − n 2^{-(n-1)}+4\cdot2^{-2n}\leq3\cdot2^{-n} 2 − ( n − 1 ) + 4 ⋅ 2 − 2 n ≤ 3 ⋅ 2 − n .
For the conditional laws of § 7 , binary search over u u u evaluates F p , n , t O ⋆ ( x ) F^{O^\star}_{p,n,t}(x) F p , n , t O ⋆ ( x ) with error 2 − 2 n 2^{-2n} 2 − 2 n in 2 n 2n 2 n queries.
Lemma C.2 (A majorant for short runs). For a machine Q Q Q and s ≥ n s\geq n s ≥ n , let p p p be the clocked program that runs Q ( 1 n ) Q(1^n) Q ( 1 n ) for s s s steps and outputs its result if it halts and 0 n 0^n 0 n otherwise, and let L = spoly ( n , ∣ Q ∣ , log s ) L=\operatorname{spoly}(n,|Q|,\log s) L = spoly ( n , ∣ Q ∣ , log s ) bound its runtime. With J = ⌈ log L ⌉ J=\lceil\log L\rceil J = ⌈ log L ⌉ , the distribution μ = 1 J + 1 ∑ j ≤ J D p , n , 2 j O ⋆ \mu=\frac{1}{J+1}\sum_{j\leq J}D^{O^\star}_{p,n,2^j} μ = J + 1 1 ∑ j ≤ J D p , n , 2 j O ⋆ satisfies Pr [ Q ( 1 n ) = x , T Q < s ] ≤ ( J + 1 ) μ ( x ) \Pr[Q(1^n)=x,T_Q<s]\leq(J+1)\mu(x) Pr [ Q ( 1 n ) = x , T Q < s ] ≤ ( J + 1 ) μ ( x ) for every x ≠ 0 n x\neq0^n x = 0 n .
Proof. Let π j ( x ) \pi_j(x) π j ( x ) be the probability that p p p outputs x x x with runtime in [ 2 j , 2 j + 1 ) [2^j,2^{j+1}) [ 2 j , 2 j + 1 ) and α j \alpha_j α j the probability that it survives to time 2 j 2^j 2 j . For x ≠ 0 n x\neq0^n x = 0 n , π j ( x ) ≤ π j ( x ) / α j = D p , n , 2 j O ⋆ ( x ) \pi_j(x)\leq\pi_j(x)/\alpha_j=D^{O^\star}_{p,n,2^j}(x) π j ( x ) ≤ π j ( x ) / α j = D p , n , 2 j O ⋆ ( x ) when α j > 0 \alpha_j>0 α j > 0 , and π j ( x ) = 0 \pi_j(x)=0 π j ( x ) = 0 otherwise. Summing over j ≤ J j\leq J j ≤ J covers every run of p p p , and p p p outputs x x x whenever Q Q Q does so before time s s s .
Proof of Theorem 7.5. Part 1. Let j ( n ) = ⌊ n ⌋ j(n)=\lfloor\sqrt{n}\rfloor j ( n ) = ⌊ n ⌋ and s = 2 j ( n ) s=2^{j(n)} s = 2 j ( n ) , choose a rational b b b with r < b < a r<b<a r < b < a , and let A A A on 1 n 1^n 1 n output 0 n 0^n 0 n unless ⌈ b j ( n ) ⌉ \lceil b j(n)\rceil ⌈ bj ( n )⌉ coins are all zero; then it computes the string x n x_n x n of Theorem C.1 for the majorant μ \mu μ of Theorem C.2, evaluating each CDF value of μ \mu μ as the average of J + 1 J+1 J + 1 approximate component values, and outputs x n x_n x n . The conditional queries have length O ( 2 j + n + ∣ p ∣ ) O(2^j+n+|p|) O ( 2 j + n + ∣ p ∣ ) for j ≤ J j\leq J j ≤ J , so this branch costs spoly Q ( n ) \operatorname{spoly}_Q(n) spoly Q ( n ) , and E [ T A b ] ≤ poly ( n ) + 2 − b j ( n ) ( spoly Q ( n ) ) b ≤ poly ( n ) \mathbb{E}[T_A^b]\leq\operatorname{poly}(n)+2^{-bj(n)}(\operatorname{spoly}_Q(n))^b\leq\operatorname{poly}(n) E [ T A b ] ≤ poly ( n ) + 2 − bj ( n ) ( spoly Q ( n ) ) b ≤ poly ( n ) ; hence A ∈ S b O ⋆ ⊆ S r O ⋆ A\in S_b^{O^\star}\subseteq S_r^{O^\star} A ∈ S b O ⋆ ⊆ S r O ⋆ . Since x n ≠ 0 n x_n\neq0^n x n = 0 n , P A ( x n ∣ n ) ≥ s − b / 2 P_A(x_n\mid n)\geq s^{-b/2} P A ( x n ∣ n ) ≥ s − b /2 . With E [ T Q a ] ≤ C ( n + 2 ) c \mathbb{E}[T_Q^a]\leq C(n+2)^c E [ T Q a ] ≤ C ( n + 2 ) c , Theorems C.1 and C.2 and Markov’s inequality give
P Q ( x n ∣ n ) ≤ 3 ( J + 1 ) 2 − n + C ( n + 2 ) c s − a , P_Q(x_n\mid n)\leq3(J+1)2^{-n}+C(n+2)^cs^{-a}, P Q ( x n ∣ n ) ≤ 3 ( J + 1 ) 2 − n + C ( n + 2 ) c s − a ,
so P Q ( x n ∣ n ) / P A ( x n ∣ n ) ≤ 6 ( J + 1 ) 2 − n s b + 2 C ( n + 2 ) c s b − a P_Q(x_n\mid n)/P_A(x_n\mid n)\leq6(J+1)2^{-n}s^b+2C(n+2)^cs^{b-a} P Q ( x n ∣ n ) / P A ( x n ∣ n ) ≤ 6 ( J + 1 ) 2 − n s b + 2 C ( n + 2 ) c s b − a , which is smaller than every inverse polynomial for large n n n , since J = O Q ( n ) J=O_Q(\sqrt{n}) J = O Q ( n ) and s = 2 ⌊ n ⌋ s=2^{\lfloor\sqrt{n}\rfloor} s = 2 ⌊ n ⌋ . This gives U O ⋆ ( r ) ≤ r \mathcal{U}^{O^\star}(r)\leq r U O ⋆ ( r ) ≤ r ; Theorem 7.2 gives the reverse inequality and attainment at rational r r r .
Part 2, upper bounds. Let Q a ⋆ Q_a^\star Q a ⋆ be the sampler of Theorem 7.2 with gate exponent a a a and clock indices j ≤ n 2 j\leq n^2 j ≤ n 2 instead of j ≤ j ˉ n j\leq\bar{j}_n j ≤ j ˉ n ; its a a a th moment is still polynomial. Fix A ∈ S r O ⋆ A\in S_r^{O^\star} A ∈ S r O ⋆ with μ = E [ T A r ] \mu=\mathbb{E}[T_A^r] μ = E [ T A r ] , and let π j \pi_j π j and α j \alpha_j α j be as in Theorem C.2 for A A A itself. As in the proof of Theorem 7.2, for large n n n and a polynomial K K K ,
q ( x ) : = P Q a ⋆ ( x ∣ n ) ≥ K − 1 ( 2 − n + ∑ j ≤ n 2 2 − a j π j ( x ) α j ) . q(x):=P_{Q_a^\star}(x\mid n)\geq K^{-1}\left(2^{-n}+\sum_{j\leq n^2}2^{-aj}\frac{\pi_j(x)}{\alpha_j}\right). q ( x ) := P Q a ⋆ ( x ∣ n ) ≥ K − 1 2 − n + j ≤ n 2 ∑ 2 − aj α j π j ( x ) .
For α = 1 + η > 1 \alpha=1+\eta>1 α = 1 + η > 1 , joint convexity and degree-one homogeneity, hence subadditivity, of ( u , v ) ↦ u α / v η (u,v)\mapsto u^\alpha/v^\eta ( u , v ) ↦ u α / v η bound R α ( P A ∥ q ) R_\alpha(P_A\Vert q) R α ( P A ∥ q ) by K η K^\eta K η times
∑ j ≤ n 2 ∑ x π j ( x ) ( α j 2 a j ) η + 2 η n ( μ 2 − r n 2 ) α ≤ μ α ∑ j ≤ n 2 2 j ( α η − r α ) + o ( 1 ) , \sum_{j\leq n^2}\sum_x\pi_j(x)(\alpha_j2^{aj})^\eta+2^{\eta n}(\mu2^{-rn^2})^\alpha\leq\mu^\alpha\sum_{j\leq n^2}2^{j(\alpha\eta-r\alpha)}+o(1), j ≤ n 2 ∑ x ∑ π j ( x ) ( α j 2 aj ) η + 2 η n ( μ 2 − r n 2 ) α ≤ μ α j ≤ n 2 ∑ 2 j ( α η − r α ) + o ( 1 ) ,
using ∑ x π j ( x ) ≤ α j ≤ μ 2 − r j \sum_x\pi_j(x)\leq\alpha_j\leq\mu2^{-rj} ∑ x π j ( x ) ≤ α j ≤ μ 2 − r j . This is polynomial when a η ≤ r α a\eta\leq r\alpha a η ≤ r α . If a > r a>r a > r , the choice α = a / ( a − r ) \alpha=a/(a-r) α = a / ( a − r ) is on this boundary, and a single summand of R α R_\alpha R α gives q ( x ) ≥ P A ( x ) α / ( α − 1 ) / poly ( n ) = P A ( x ) a / r / poly ( n ) q(x)\geq P_A(x)^{\alpha/(\alpha-1)}/\operatorname{poly}(n)=P_A(x)^{a/r}/\operatorname{poly}(n) q ( x ) ≥ P A ( x ) α / ( α − 1 ) / poly ( n ) = P A ( x ) a / r / poly ( n ) . If a ≤ r a\leq r a ≤ r , then α j 2 a j ≤ μ \alpha_j2^{aj}\leq\mu α j 2 aj ≤ μ and the displayed bound on q q q gives domination directly.
Part 2, lower bounds. Let a > r a>r a > r and Q ∈ S a O ⋆ Q\in S_a^{O^\star} Q ∈ S a O ⋆ . For a power β < a / r \beta<a/r β < a / r , choose a rational b b b with r < b < a / β r<b<a/\beta r < b < a / β and take the source of Part 1; then P A ( x n ) β / P Q ( x n ) ≥ s a − β b / poly ( n ) P_A(x_n)^\beta/P_Q(x_n)\geq s^{a-\beta b}/\operatorname{poly}(n) P A ( x n ) β / P Q ( x n ) ≥ s a − β b / poly ( n ) , which is superpolynomial. For a finite α \alpha α with a ( α − 1 ) > r α a(\alpha-1)>r\alpha a ( α − 1 ) > r α , choose a rational b b b with r < b < a ( α − 1 ) / α r<b<a(\alpha-1)/\alpha r < b < a ( α − 1 ) / α ; then R α ( P A ∥ P Q ) ≥ P A ( x n ) α / P Q ( x n ) α − 1 ≥ s a ( α − 1 ) − b α / poly ( n ) R_{\alpha}(P_A\Vert P_Q)\ge P_A(x_n)^\alpha/P_Q(x_n)^{\alpha-1}\ge s^{a(\alpha-1)-b\alpha}/\operatorname{poly}(n) R α ( P A ∥ P Q ) ≥ P A ( x n ) α / P Q ( x n ) α − 1 ≥ s a ( α − 1 ) − b α / poly ( n ) , so D α = Ω ( n ) D_\alpha=\Omega(\sqrt{n}) D α = Ω ( n ) .
Part 3. Let A † A^\dagger A † on 1 n 1^n 1 n run the source of Part 1 with b = 1 b=1 b = 1 against the candidate Q ν 2 ( n + 1 ) Q_{\nu_2(n+1)} Q ν 2 ( n + 1 ) . Each index occurs at infinitely many lengths, and the indices used at length n n n have descriptions of length O ( log n ) O(\log n) O ( log n ) , so the costly branch costs spoly ( n ) \operatorname{spoly}(n) spoly ( n ) uniformly and A † ∈ S 1 O ⋆ A^\dagger\in S_1^{O^\star} A † ∈ S 1 O ⋆ . For a fixed Q i Q_i Q i of order a > 1 a>1 a > 1 , the ratio estimate of Part 1 with b = 1 b=1 b = 1 holds at the infinitely many lengths where ν 2 ( n + 1 ) = i \nu_2(n+1)=i ν 2 ( n + 1 ) = i , so Q i Q_i Q i does not dominate A † A^\dagger A † . □
The sources of this proof write queries of length 2 Θ ( n ) 2^{\Theta(\sqrt{n})} 2 Θ ( n ) , so they are not polynomial-space sources; whether the profile of O ⋆ O_\star O ⋆ is also r r r against polynomial-space sources is not settled here.
Proof of Theorem 7.10
Fix a candidate Q Q Q . For h ≥ 1 h\ge1 h ≥ 1 let τ h = Pr [ T Q ( n ) ≥ h ] \tau_h=\Pr[T_Q(n)\ge h] τ h = Pr [ T Q ( n ) ≥ h ] , and let B h B_h B h be the law of the clocked run that simulates Q ( 1 n ) Q(1^n) Q ( 1 n ) for h h h steps and outputs its result if it halts and 0 n 0^n 0 n otherwise; so B h ( x ) = Pr [ Q ( 1 n ) = x , T Q < h ] B_h(x)=\Pr[Q(1^n)=x,T_Q<h] B h ( x ) = Pr [ Q ( 1 n ) = x , T Q < h ] for x ≠ 0 n x\ne0^n x = 0 n . A tail interface for Q Q Q is a deterministic procedure that, given 1 n 1^n 1 n and h h h , runs in time at most C Q ( n h ) ζ Q C_Q(nh)^{\zeta_Q} C Q ( nh ) ζ Q and returns
a rational τ ^ \hat{\tau} τ ^ with τ h ≤ τ ^ ≤ 4 3 τ h + 2 − 2 n \tau_h\le\hat{\tau}\le\frac{4}{3}\tau_h+2^{-2n} τ h ≤ τ ^ ≤ 3 4 τ h + 2 − 2 n , and
for n ≥ 4 n\ge4 n ≥ 4 , a string x ≠ 0 n x\ne0^n x = 0 n with B h ( x ) ≤ 2 − n / 2 B_h(x)\le2^{-n/2} B h ( x ) ≤ 2 − n /2 .
Lemma D.1. Relative to every oracle X X X with P X = N P X \mathrm{P}^X=\mathrm{NP}^X P X = NP X , in particular relative to O ⋆ O_\star O ⋆ , every candidate Q Q Q has a tail interface.
Proof. Relative to O ⋆ O_\star O ⋆ . Let p h p_h p h simulate Q ( 1 n ) Q(1^n) Q ( 1 n ) for h h h steps, output as B h B_h B h prescribes, and then idle until a step counter reaches a fixed value L ˉ = h poly ( n , ∣ Q ∣ , log h ) \bar{L}=h\operatorname{poly}(n,|Q|,\log h) L ˉ = h poly ( n , ∣ Q ∣ , log h ) , chosen so that every simulation of h h h steps finishes before it. Every run of p h p_h p h halts at exactly step L ˉ \bar{L} L ˉ , so with t t t the power of two in ( L ˉ / 2 , L ˉ ] (\bar{L}/2,\bar{L}] ( L ˉ /2 , L ˉ ] the survival event of Section 7 is certain and D p h , n , t O ⋆ = B h D^{O_\star}_{p_h,n,t}=B_h D p h , n , t O ⋆ = B h . Binary search over u u u with 2 n 2n 2 n queries evaluates each CDF value of B h B_h B h rounded up to a multiple of 2 − 2 n 2^{-2n} 2 − 2 n , and Theorem C.1 gives x x x with first bit one and B h ( x ) ≤ 3 ⋅ 2 − n ≤ 2 − n / 2 B_h(x)\le3\cdot2^{-n}\le2^{-n/2} B h ( x ) ≤ 3 ⋅ 2 − n ≤ 2 − n /2 for n ≥ 4 n\ge4 n ≥ 4 . For τ ^ \hat{\tau} τ ^ use the same construction with the program that outputs 0 n 0^n 0 n on timeout and 1 n 1^n 1 n otherwise, whose CDF at 0 n 0^n 0 n is τ h \tau_h τ h . Every query has length O ( t + n + ∣ Q ∣ + log h ) O(t+n+|Q|+\log h) O ( t + n + ∣ Q ∣ + log h ) , so the time bound holds.
Relative to X X X with P X = N P X \mathrm{P}^X=\mathrm{NP}^X P X = NP X . The number of h h h -bit coin strings on which the h h h -step run of Q X ( 1 n ) Q^X(1^n) Q X ( 1 n ) times out, or ends with an output that extends a given prefix, is a # P X \#\mathrm{P}^X # P X function of ( 1 n , 1 h , p r e f i x ) (1^n,1^h,\mathrm{prefix}) ( 1 n , 1 h , prefix ) . By Stockmeyer’s theorem [27 ] , which relativizes, such a function f f f can be approximated within any constant factor by a deterministic polynomial-time machine with a Σ 2 p \Sigma_2^p Σ 2 p oracle relative to X X X , hence in polynomial time relative to X X X ; scaling the approximation by its factor gives f ≤ f ^ ≤ 4 3 f f\le\hat{f}\le\frac{4}{3}f f ≤ f ^ ≤ 3 4 f , and f = 0 f=0 f = 0 is detected exactly. This gives τ ^ \hat{\tau} τ ^ . For x x x , start with the prefix 1 1 1 and move to the child with the smaller estimate. The chosen child has true mass m m m at most 4 7 \frac{4}{7} 7 4 times the other’s, hence at most 4 7 \frac{4}{7} 7 4 of the parent’s, so after n − 1 n-1 n − 1 steps B h ( x ) ≤ ( 4 / 7 ) n − 1 ≤ 2 − n / 2 B_h(x)\le(4/7)^{n-1}\le2^{-n/2} B h ( x ) ≤ ( 4/7 ) n − 1 ≤ 2 − n /2 for n ≥ 3 n\ge3 n ≥ 3 . □
The cascade. Let L = ⌈ log ( n + 2 ) ⌉ L=\lceil\log(n+2)\rceil L = ⌈ log ( n + 2 )⌉ and M = ⌊ n ⌋ M=\lfloor\sqrt{n}\rfloor M = ⌊ n ⌋ , let J J J be the least integer with 2 J L ≥ M 2^JL\ge M 2 J L ≥ M , and put m j = min { 2 j L , M } m_j=\min\{2^jL,M\} m j = min { 2 j L , M } and h j = 2 m j h_j=2^{m_j} h j = 2 m j for 0 ≤ j ≤ J 0\le j\le J 0 ≤ j ≤ J , so h 0 ≤ 2 ( n + 2 ) h_0\le2(n+2) h 0 ≤ 2 ( n + 2 ) , h j ≤ h j − 1 2 h_j\le h_{j-1}^2 h j ≤ h j − 1 2 and h J = 2 M h_J=2^M h J = 2 M . At large n n n , A A A proceeds through stages j = 0 , … , J j=0,\ldots,J j = 0 , … , J . At stage j j j it calls the tail interface at h j h_j h j to obtain τ ^ j \hat{\tau}_j τ ^ j , and computes
u j = min { 1 , τ ^ 0 , … , τ ^ j } , v j = max { u j , 2 − n / 4 } , z j = ⌊ log ( 1 / v j ) ⌋ , d j = ⌊ z j m j ⌋ , u_j=\min\{1,\hat{\tau}_0,\ldots,\hat{\tau}_j\},\qquad v_j=\max\{u_j,2^{-n/4}\},\qquad z_j=\lfloor\log(1/v_j)\rfloor,\qquad d_j=\left\lfloor\sqrt{z_jm_j}\right\rfloor, u j = min { 1 , τ ^ 0 , … , τ ^ j } , v j = max { u j , 2 − n /4 } , z j = ⌊ log ( 1/ v j )⌋ , d j = ⌊ z j m j ⌋ ,
with d − 1 = 0 d_{-1}=0 d − 1 = 0 . Then z j z_j z j , m j m_j m j and d j d_j d j are nondecreasing in j j j . It passes stage j j j if d j − d j − 1 d_j-d_{j-1} d j − d j − 1 fresh coins are all zero, and otherwise outputs 0 n 0^n 0 n . After stage J J J it calls the interface at h J h_J h J for the string x n x_n x n and outputs it. At the finitely many small n n n it outputs 0 n 0^n 0 n . Stage j j j is reached with probability 2 − d j − 1 2^{-d_{j-1}} 2 − d j − 1 , and since x n ≠ 0 n x_n\ne0^n x n = 0 n ,
P A ( x n ∣ n ) = 2 − d J ≥ 2 − z J M (11) P_A(x_n\mid n)=2^{-d_J}\ge2^{-\sqrt{z_JM}} \tag*{(11)} P A ( x n ∣ n ) = 2 − d J ≥ 2 − z J M (11)
Since τ h j ≤ τ h i ≤ τ ^ i \tau_{h_j}\le\tau_{h_i}\le\hat{\tau}_i τ h j ≤ τ h i ≤ τ ^ i for i ≤ j i\le j i ≤ j , also τ h j ≤ u j ≤ τ ^ j ≤ 4 3 τ h j + 2 − 2 n \tau_{h_j}\le u_j\le\hat{\tau}_j\le\frac{4}{3}\tau_{h_j}+2^{-2n} τ h j ≤ u j ≤ τ ^ j ≤ 3 4 τ h j + 2 − 2 n . Write μ K ( n ) = E [ T Q ( n ) K ] \mu_K(n)=\mathbb{E}[T_Q(n)^K] μ K ( n ) = E [ T Q ( n ) K ] ; by Markov's inequality, τ h ≤ μ K ( n ) h − K \tau_h\le\mu_K(n)h^{-K} τ h ≤ μ K ( n ) h − K .
Lemma D.2. If Q ∈ S a l l Q\in\mathcal{S}_{\mathrm{all}} Q ∈ S all , then A ∈ S a l l A\in\mathcal{S}_{\mathrm{all}} A ∈ S all .
Proof. Every stage, and the final call, costs at most C ( n h j ) ζ C(nh_j)^\zeta C ( n h j ) ζ with ζ = ζ Q \zeta=\zeta_Q ζ = ζ Q , plus coin tosses. Fix a > 0 a>0 a > 0 and an integer K ≥ 32 ( ζ a + 1 ) 2 K\ge32(\zeta a+1)^2 K ≥ 32 ( ζ a + 1 ) 2 , and let n n n be large enough that K M + 8 ≤ n / 2 KM+8\le n/2 K M + 8 ≤ n /2 . Consider a stage j ≥ 1 j\ge1 j ≥ 1 , put m = m j − 1 m=m_{j-1} m = m j − 1 , so that h j ≤ 2 2 m h_j\le2^{2m} h j ≤ 2 2 m . If m ≥ ( 2 / K ) log ( 8 μ K ( n ) ) m\ge(2/K)\log(8\mu_K(n)) m ≥ ( 2/ K ) log ( 8 μ K ( n )) , then
v j − 1 ≤ 4 3 μ K ( n ) 2 − K m + 2 − 2 n + 2 − n / 4 ≤ 2 − K m / 2 , v_{j-1}\le\frac{4}{3}\mu_K(n)2^{-Km}+2^{-2n}+2^{-n/4}\le2^{-Km/2}, v j − 1 ≤ 3 4 μ K ( n ) 2 − K m + 2 − 2 n + 2 − n /4 ≤ 2 − K m /2 ,
since μ K ( n ) 2 − K m / 2 ≤ 1 / 8 \mu_K(n)2^{-Km/2}\le1/8 μ K ( n ) 2 − K m /2 ≤ 1/8 and 2 − n / 4 ≤ 2 − K m / 2 − 2 2^{-n/4}\le2^{-Km/2-2} 2 − n /4 ≤ 2 − K m /2 − 2 . Then z j − 1 ≥ K m / 2 − 1 ≥ K m / 4 z_{j-1}\ge Km/2-1\ge Km/4 z j − 1 ≥ K m /2 − 1 ≥ K m /4 , so d j − 1 ≥ m K / 4 − 1 ≥ ( 2 ζ a + 2 ) m − 1 d_{j-1}\ge m\sqrt{K}/4-1\ge(2\zeta a+2)m-1 d j − 1 ≥ m K /4 − 1 ≥ ( 2 ζ a + 2 ) m − 1 , and the stage contributes at most 2 − d j − 1 ( C ( n 2 2 m ) ζ ) a ≤ 2 C a n ζ a 2^{-d_{j-1}}(C(n2^{2m})^\zeta)^a\le2C^a n^{\zeta a} 2 − d j − 1 ( C ( n 2 2 m ) ζ ) a ≤ 2 C a n ζ a to the a a a th moment. Otherwise it contributes at most C a n ζ a 2 2 ζ a m ≤ C a n ζ a ( 8 μ K ( n ) ) 4 ζ a / K C^a n^{\zeta a}2^{2\zeta am}\le C^a n^{\zeta a}(8\mu_K(n))^{4\zeta a/K} C a n ζ a 2 2 ζ am ≤ C a n ζ a ( 8 μ K ( n ) ) 4 ζ a / K , which is polynomial. Stage 0 costs poly ( n ) \operatorname{poly}(n) poly ( n ) , and the final call is reached with probability 2 − d J ≤ 2 − d J − 1 2^{-d_J}\le2^{-d_{J-1}} 2 − d J ≤ 2 − d J − 1 and costs at most the bound for stage J J J . The coin tosses cost d J + O ( J ) ≤ n d_J+O(J)\le n d J + O ( J ) ≤ n . There are J + 2 = O ( log n ) J+2=O(\log n) J + 2 = O ( log n ) terms, and ( ∑ i t i ) a ≤ ( J + 2 ) max { a − 1 , 0 } ∑ i t i a (\sum_i t_i)^a\le(J+2)^{\max\{a-1,0\}}\sum_i t_i^a ( ∑ i t i ) a ≤ ( J + 2 ) m a x { a − 1 , 0 } ∑ i t i a , so E [ T A ( n ) a ] \mathbb{E}[T_A(n)^a] E [ T A ( n ) a ] is polynomial. The algorithm never uses a a a or K K K .
Proof of Theorem 7.10. By Theorems D.1 and D.2, A ∈ S a l l A\in\mathcal{S}_{\mathrm{all}} A ∈ S all , and its worst-case runtime is 2 2 O Q ( M ) = 2 O Q ( n ) 2^{2^{O_Q(M)}}=2^{O_Q(\sqrt n)} 2 2 O Q ( M ) = 2 O Q ( n ) . For every fixed K K K , at large n n n the bound in the proof of Theorem D.2 at m = M m=M m = M gives v J ≤ 2 − K M / 2 v_J\le2^{-KM/2} v J ≤ 2 − K M /2 , so z J ≥ K M / 2 − 1 z_J\ge KM/2-1 z J ≥ K M /2 − 1 ; hence z J / M → ∞ z_J/M\to\infty z J / M → ∞ . Since x n ≠ 0 n x_n\ne0^n x n = 0 n and v J ≥ 2 − n / 4 v_J\ge2^{-n/4} v J ≥ 2 − n /4 ,
P Q ( x n ∣ n ) ≤ B h J ( x n ) + τ h J ≤ 2 − n / 2 + v J ≤ 2 v J ≤ 2 1 − z J . P_Q(x_n\mid n)\le B_{h_J}(x_n)+\tau_{h_J}\le2^{-n/2}+v_J\le2v_J\le2^{1-z_J}. P Q ( x n ∣ n ) ≤ B h J ( x n ) + τ h J ≤ 2 − n /2 + v J ≤ 2 v J ≤ 2 1 − z J .
With (9), for fixed β ≥ 1 \beta\ge1 β ≥ 1 ,
log P A ( x n ∣ n ) β P Q ( x n ∣ n ) ≥ z J − β z J M − 1 = z J ( 1 − β M z J ) − 1 ≥ z J / 2 \log\frac{P_A(x_n\mid n)^\beta}{P_Q(x_n\mid n)}
\ge z_J-\beta\sqrt{z_JM}-1
=z_J\left(1-\beta\sqrt{\frac{M}{z_J}}\right)-1
\ge z_J/2 log P Q ( x n ∣ n ) P A ( x n ∣ n ) β ≥ z J − β z J M − 1 = z J ( 1 − β z J M ) − 1 ≥ z J /2
at large n n n , and z J / 2 ≥ c n z_J/2\ge c\sqrt n z J /2 ≥ c n for every fixed c c c . For α > 1 \alpha>1 α > 1 , the summand of x n x_n x n in the Rényi sum gives
D α ( P A ∥ P Q ) ≥ α log P A ( x n ∣ n ) − ( α − 1 ) log P Q ( x n ∣ n ) α − 1 ≥ z J − 1 − α α − 1 z J M , D_\alpha(P_A\Vert P_Q)\ge
\frac{\alpha\log P_A(x_n\mid n)-(\alpha-1)\log P_Q(x_n\mid n)}{\alpha-1}
\ge z_J-1-\frac{\alpha}{\alpha-1}\sqrt{z_JM}, D α ( P A ∥ P Q ) ≥ α − 1 α log P A ( x n ∣ n ) − ( α − 1 ) log P Q ( x n ∣ n ) ≥ z J − 1 − α − 1 α z J M ,
which is at least z J / 2 z_J/2 z J /2 at large n n n . Domination on average in the sense of Gurevich asks for a polynomially bounded moment of P A / P Q P_A/P_Q P A / P Q of some positive order η \eta η under P A P_A P A , which is R 1 + η ( P A ∥ P Q ) R_{1+\eta}(P_A\Vert P_Q) R 1 + η ( P A ∥ P Q ) , so it fails too.
A sharp coding theorem for public-coin complexity
The frontier B ( a , r ) B(a,r) B ( a , r ) also appears as the optimal coefficient in a coding theorem for a standard time-bounded Kolmogorov measure. Relative to an oracle X X X , p K t X ( x ) \mathrm{pKt}^X(x) pKt X ( x ) is the least k k k such that, with probability at least 2 / 3 2/3 2/3 over a uniform public string w ∈ { 0 , 1 } t w\in\{0,1\}^t w ∈ { 0 , 1 } t , some program of length at most k k k outputs x x x on input w w w within t t t steps, with oracle X X X [9 , 17 ] ; the program may depend on w w w . For real a > 0 a>0 a > 0 put
κ a X ( x ) = min j ≥ 0 { p k 2 j , X ( x ) + a j } , \kappa_a^X(x)=\min_{j\ge0}\{p^{k2^j,X}(x)+aj\}, κ a X ( x ) = j ≥ 0 min { p k 2 j , X ( x ) + aj } ,
which charges a a a bits for every doubling of the time budget. We drop the superscript X X X when the oracle is fixed. The weighted minimum is not meant as a new measure; the point is its relation to runtime moments.
Lemma E.1 (Finite public streams). Let a procedure with parameters of O ( log n ) O(\log n) O ( log n ) -bit encodings run in time at most Γ ≥ n \Gamma\ge n Γ ≥ n , use at most m ≤ Γ m\le\Gamma m ≤ Γ random bits, and output x x x with probability at least p > 0 p>0 p > 0 , where log ( 1 / p ) = O ( n ) \log(1/p)=O(n) log ( 1/ p ) = O ( n ) . Put k = ⌈ log ( 4 / p ) ⌉ k=\lceil\log(4/p)\rceil k = ⌈ log ( 4/ p )⌉ . Then with probability at least 3 / 4 3/4 3/4 over a uniform public string of m ( k + 1 ) m(k+1) m ( k + 1 ) bits, some index z ∈ { 0 , 1 } k z\in\{0,1\}^k z ∈ { 0 , 1 } k makes the procedure output x x x when its coins are the stream H ( z ) H(z) H ( z ) below, and computing the procedure’s output from z z z , the parameters and the public string takes time Γ poly ( n ) \Gamma\operatorname{poly}(n) Γ poly ( n ) .
Proof. Read the public string as rows ( u i , b i ) ∈ { 0 , 1 } k × { 0 , 1 } (u_i,b_i)\in\{0,1\}^k\times\{0,1\} ( u i , b i ) ∈ { 0 , 1 } k × { 0 , 1 } , i ≤ m i\le m i ≤ m , and let H ( z ) i = ⟨ u i , z ⟩ + b i ( m o d 2 ) H(z)_i=\langle u_i,z\rangle+b_i\pmod2 H ( z ) i = ⟨ u i , z ⟩ + b i ( mod 2 ) . Each stream is uniform, and two distinct streams are independent, because ( z , 1 ) (z,1) ( z , 1 ) and ( z ′ , 1 ) (z',1) ( z ′ , 1 ) are linearly independent over F 2 \mathbb{F}_2 F 2 . Let Z Z Z count the indices whose streams make the procedure output x x x . Then E Z ≥ 2 k p ≥ 4 \mathbb{E}Z\ge2^kp\ge4 E Z ≥ 2 k p ≥ 4 , pairwise independence gives Var Z ≤ E Z \operatorname{Var}Z\le\mathbb{E}Z Var Z ≤ E Z , and Chebyshev’s inequality gives Pr [ Z = 0 ] ≤ 1 / E Z ≤ 1 / 4 \Pr[Z=0]\le1/\mathbb{E}Z\le1/4 Pr [ Z = 0 ] ≤ 1/ E Z ≤ 1/4 . Only the selected stream is evaluated, one inner product of length k + 1 = O ( n ) k+1=O(n) k + 1 = O ( n ) per coin.
Pairwise independence matters here. Disjoint public blocks, one per index, would need a public string of length 2 k Γ 2^k\Gamma 2 k Γ , and κ a \kappa_a κ a charges for the length of the public string through the time budget.
Theorem E.2 (Sharp runtime-moment coding). Fix an oracle and real a , r > 0 a,r>0 a , r > 0 . Let A A A halt almost surely on 1 n 1^n 1 n with μ = E [ T A ( n ) r ] < ∞ \mu=\mathbb{E}[T_A(n)^r]<\infty μ = E [ T A ( n ) r ] < ∞ . Every x x x with π = P A ( x ∣ n ) > 0 \pi=P_A(x\mid n)>0 π = P A ( x ∣ n ) > 0 satisfies
κ a ( x ) ≤ B ( a , r ) log ( μ / π ) + O A , a , r ( log ( n + 2 ) ) . \kappa_a(x)\le B(a,r)\log(\mu/\pi)+O_{A,a,r}(\log(n+2)). κ a ( x ) ≤ B ( a , r ) log ( μ / π ) + O A , a , r ( log ( n + 2 )) . In particular κ a ( x ) ≤ B ( a , r ) log ( 1 / P A ( x ∣ n ) ) + O A , a , r ( log ( n + 2 ) ) \kappa_a(x)\le B(a,r)\log(1/P_A(x\mid n))+O_{A,a,r}(\log(n+2)) κ a ( x ) ≤ B ( a , r ) log ( 1/ P A ( x ∣ n )) + O A , a , r ( log ( n + 2 )) for every A ∈ S r A\in S_r A ∈ S r .
Proof. A literal description gives κ a ( x ) ≤ n + O a ( log ( n + 2 ) ) \kappa_a(x)\le n+O_a(\log(n+2)) κ a ( x ) ≤ n + O a ( log ( n + 2 )) , so we may assume log ( μ / π ) < n \log(\mu/\pi)<n log ( μ / π ) < n . Let d = min { r , 1 } d=\min\{r,1\} d = min { r , 1 } and take t = 2 b t=2^b t = 2 b and π t ≥ 3 π / ( 4 M ) \pi_t\ge3\pi/(4M) π t ≥ 3 π / ( 4 M ) from Theorem 3.1, with M = O r ( n + 1 ) M=O_r(n+1) M = O r ( n + 1 ) . By Theorem 3.2, R t ( p A ) R_t(p_A) R t ( p A ) outputs x x x with probability at least s = π t t d / ( 6 μ ) s=\pi_t t^d/(6\mu) s = π t t d / ( 6 μ ) , and log ( 1 / s ) = O r ( n ) \log(1/s)=O_r(n) log ( 1/ s ) = O r ( n ) . Stop it after t ( n + 2 ) 2 t(n+2)^2 t ( n + 2 ) 2 attempted steps; by Theorem 3.2 this loses probability at most
( 1 − 1 / ( 2 t ) ) t ( n + 2 ) 2 ≤ e − ( n + 2 ) 2 / 2 ≤ s / 2 (1-1/(2t))^{t(n+2)^2}\le e^{-(n+2)^2/2}\le s/2 ( 1 − 1/ ( 2 t ) ) t ( n + 2 ) 2 ≤ e − ( n + 2 ) 2 /2 ≤ s /2
for large n n n . The truncated procedure runs in time Γ = t poly A , r ( n ) \Gamma=t\operatorname{poly}_{A,r}(n) Γ = t poly A , r ( n ) , uses at most Γ \Gamma Γ coins, and outputs x x x with probability at least s / 2 s/2 s /2 . Lemma E.1 gives an index of length log ( 8 / s ) + O ( 1 ) ≤ log ( μ / π t ) − d log t + O ( 1 ) \log(8/s)+O(1)\le\log(\mu/\pi_t)-d\log t+O(1) log ( 8/ s ) + O ( 1 ) ≤ log ( μ / π t ) − d log t + O ( 1 ) . A program consisting of this index, a description of A A A , and the numbers n n n , b b b and k k k outputs x x x with probability at least 3 / 4 > 2 / 3 3/4>2/3 3/4 > 2/3 over a public string of length at most 2 J 2^J 2 J , within 2 J 2^J 2 J steps, where J = b + O A , r ( log ( n + 2 ) ) J=b+O_{A,r}(\log(n+2)) J = b + O A , r ( log ( n + 2 )) . Hence
κ a ( x ) ≤ log ( μ / π ) + ( a − d ) log t + O A , a , r ( log ( n + 2 ) ) . \kappa_a(x)\le\log(\mu/\pi)+(a-d)\log t+O_{A,a,r}(\log(n+2)). κ a ( x ) ≤ log ( μ / π ) + ( a − d ) log t + O A , a , r ( log ( n + 2 )) .
If a ≤ d a\le d a ≤ d , drop the nonpositive middle term. Otherwise use t < H = ( 4 μ / π ) 1 / r t<H=(4\mu/\pi)^{1/r} t < H = ( 4 μ / π ) 1/ r , which gives
( a − d ) log t ≤ a − d r log ( 4 μ / π ) (a-d)\log t\le\frac{a-d}{r}\log(4\mu/\pi) ( a − d ) log t ≤ r a − d log ( 4 μ / π )
and the claimed coefficient 1 + ( a − d ) / r 1+(a-d)/r 1 + ( a − d ) / r .
For example, a = r = 2 a=r=2 a = r = 2 gives min j { p K 2 j ( x ) + 2 j } ≤ 3 2 log ( 1 / P A ( x ∣ n ) ) + O A ( log n ) \min_j\{p^{K2^j}(x)+2j\}\le\frac{3}{2}\log(1/P_A(x\mid n))+O_A(\log n) min j { p K 2 j ( x ) + 2 j } ≤ 2 3 log ( 1/ P A ( x ∣ n )) + O A ( log n ) for every source with polynomial second moment. A polynomial slowdown of the decoding would change the coefficient of log t \log t log t , which is why Theorem E.1 is careful about time.
Lemma E.3 (A converse). *For every oracle and rational a > 0 a > 0 a > 0 there is H a ∈ S a H_a \in\mathcal{S}_a H a ∈ S a with P H a ( x ∣ n ) ≥ 2 − κ a ( x ) / poly a ( n ) P_{H_a}(x \mid n) \ge2^{-\kappa_a(x)}/\operatorname{poly}_a(n) P H a ( x ∣ n ) ≥ 2 − κ a ( x ) / poly a ( n ) for all x ∈ { 0 , 1 } n x \in\{0,1\}^n x ∈ { 0 , 1 } n and large n n n .
Proof. On 1 n 1^n 1 n , H a H_a H a chooses λ , j ∈ { 0 , … , n 2 } \lambda,j \in\{0,\ldots,n^2\} λ , j ∈ { 0 , … , n 2 } with each pair having probability at least 1 / [ 4 ( n 2 + 1 ) 2 ] 1/[4(n^2+1)^2] 1/ [ 4 ( n 2 + 1 ) 2 ] , outputs 0 n 0^n 0 n unless ⌈ a j ⌉ \lceil aj\rceil ⌈ aj ⌉ coins are all zero, chooses a uniform λ \lambda λ -bit program p p p and a uniform w ∈ { 0 , 1 } 2 j w \in\{0,1\}^{2^j} w ∈ { 0 , 1 } 2 j , runs p p p on w w w for 2 j 2^j 2 j steps, and outputs the result if it is a string of length n n n , and 0 n 0^n 0 n otherwise. The cost after the gate is 2 j poly ( n ) 2^j\operatorname{poly}(n) 2 j poly ( n ) , so H a ∈ S a H_a \in\mathcal{S}_a H a ∈ S a . For a minimizing j j j and k = p K 2 j ( x ) k = pK^{2^j}(x) k = p K 2 j ( x ) we have j , k = O a ( n ) j,k = O_a(n) j , k = O a ( n ) by the literal bound. With probability at least 2 / 3 2/3 2/3 over w w w some program of length at most k k k outputs x x x , so ∑ λ ≤ k E w # { p ∈ { 0 , 1 } λ : p ( w ) = x within 2 j steps } ≥ 2 / 3 \sum_{\lambda\le k}\mathbb{E}_w\#\{p \in\{0,1\}^{\lambda}:p(w)=x\text{ within }2^j\text{ steps}\} \ge2/3 ∑ λ ≤ k E w # { p ∈ { 0 , 1 } λ : p ( w ) = x within 2 j steps } ≥ 2/3 , and choosing λ \lambda λ and then p p p uniformly hits such a program with probability at least 2 − k / [ 3 ( n 2 + 1 ) ] 2^{-k}/[3(n^2+1)] 2 − k / [ 3 ( n 2 + 1 )] . Multiplying by the selection and gate probabilities gives the bound.
Theorem E.4 (Optimality of the coefficient). Relative to the oracle O O O of § 6 , for all real a , r > 0 a,r>0 a , r > 0 and 1 ≤ β < B ( a , r ) 1 \le\beta< B(a,r) 1 ≤ β < B ( a , r ) there is A ∈ S r O ∩ W O A \in\mathcal{S}_r^O \cap\mathcal{W}^O A ∈ S r O ∩ W O with worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) such that, for every constant c c c , the bound κ a ( x ) ≤ β log ( 1 / P A ( x ∣ n ) ) + c log ( n + 2 ) \kappa_a(x) \le\beta\log(1/P_A(x\mid n))+c\log(n+2) κ a ( x ) ≤ β log ( 1/ P A ( x ∣ n )) + c log ( n + 2 ) fails for some x x x at infinitely many lengths.
Proof. For rational a a a , let A A A be the source of Theorem 6.6 against H a H_a H a with power β \beta β . If the bound held at all large lengths, Theorem E.3 would give P H a ≥ P A β / poly ( n ) P_{H_a} \ge P_A^\beta/\operatorname{poly}(n) P H a ≥ P A β / poly ( n ) , a contradiction. For real a a a , take a rational a ′ < a a' < a a ′ < a with β < B ( a ′ , r ) \beta< B(a',r) β < B ( a ′ , r ) and use κ a ′ ≤ κ a \kappa_{a'} \le\kappa_a κ a ′ ≤ κ a .
Coefficients below one are impossible for trivial reasons: for the uniform source, Theorem E.3 would give total mass 2 ( 1 − β ) n / poly ( n ) 2^{(1-\beta)n}/\operatorname{poly}(n) 2 ( 1 − β ) n / poly ( n ) . So the coefficient is exactly B ( a , r ) B(a,r) B ( a , r ) relative to O O O , including the cases B ( a , r ) = 1 B(a,r)=1 B ( a , r ) = 1 . For a > 1 a>1 a > 1 the gap between “every coefficient above one” and “coefficient one” is real: by Theorem 6.1 applied to H a ′ H_{a'} H a ′ for a rational 1 < a ′ ≤ a 1<a'\le a 1 < a ′ ≤ a , one polynomial-space source A ∈ S a l l O A\in\mathcal{S}_{\mathrm{all}}^O A ∈ S all O violates the coefficient-one bound for every additive O ( log n ) O(\log n) O ( log n ) , while Theorem E.2 with r r r large gives coefficient 1 + ε 1+\varepsilon 1 + ε for this same A A A and every ε > 0 \varepsilon>0 ε > 0 .
Worst-case running times
The transfer also yields a characterization of the worst-case running times of average-case algorithms in the style of Antunes and Fortnow [1 ] , with one sampler covering every positive moment order. Lu, Oliveira and Zimand [17 ] give an unconditional characterization of this kind for strict samplable distributions using p K t pK^t p K t . The difference here is a single sampler for source classes defined by moments; the qualitative statement does not need the sharp exponent. Fix a rational a > 0 a>0 a > 0 and put I a ( x ) = − log q a ( x ) I_a(x)=-\log q_a(x) I a ( x ) = − log q a ( x ) , where n = ∣ x ∣ n=|x| n = ∣ x ∣ , and Δ a ( x ) = I a ( x ) − K O ( x ) \Delta_a(x)=I_a(x)-K^O(x) Δ a ( x ) = I a ( x ) − K O ( x ) , with K O K^O K O prefix-free Kolmogorov complexity relative to O O O . Since Q a Q_a Q a halts almost surely, q a ( x ) q_a(x) q a ( x ) is a computable real relative to O O O ; Δ a \Delta_a Δ a is not computable, because K O K^O K O is not.
Proposition F.1. For a rational a > 0 a>0 a > 0 and a total deterministic oracle machine M M M , the following are equivalent.
M M M runs in average polynomial time under every sampler in ⋃ r > 0 S r O \bigcup_{r>0}\mathcal{S}_r^O ⋃ r > 0 S r O .
M M M runs in average polynomial time under Q a Q_a Q a .
There are constants C , c , e C,c,e C , c , e such that t M ( x ) ≤ C ( ∣ x ∣ + 2 ) e 2 c Δ a ( x ) t_M(x)\le C(|x|+2)^e2^{c\Delta_a(x)} t M ( x ) ≤ C ( ∣ x ∣ + 2 ) e 2 c Δ a ( x ) for every x x x .
Proof. (1) and (2) are equivalent by Theorem 4.6 and Q a ∈ S a O Q_a\in\mathcal{S}_a^O Q a ∈ S a O . If (2) holds with E Q a [ t M ε ] ≤ C 0 ( n + 2 ) e 0 \mathbb{E}_{Q_a}[t_M^\varepsilon]\le C_0(n+2)^{e_0} E Q a [ t M ε ] ≤ C 0 ( n + 2 ) e 0 for rational ε > 0 \varepsilon>0 ε > 0 , then ν ( x ) = q a ( x ) t M ( x ) ε / [ C 0 ( ∣ x ∣ + 2 ) e 0 + 2 ] \nu(x)=q_a(x)t_M(x)^\varepsilon/[C_0(|x|+2)^{e_0+2}] ν ( x ) = q a ( x ) t M ( x ) ε / [ C 0 ( ∣ x ∣ + 2 ) e 0 + 2 ] is a lower-semicomputable semimeasure relative to O O O , and the coding theorem gives
K O ( x ) ≤ − log ν ( x ) + O ( 1 ) = I a ( x ) − ε log t M ( x ) + O ( log ( ∣ x ∣ + 2 ) ) , K^O(x)\le-\log\nu(x)+O(1)=I_a(x)-\varepsilon\log t_M(x)+O(\log(|x|+2)), K O ( x ) ≤ − log ν ( x ) + O ( 1 ) = I a ( x ) − ε log t M ( x ) + O ( log ( ∣ x ∣ + 2 )) ,
which rearranges to (3) with c = 1 / ε c = 1/\varepsilon c = 1/ ε . Conversely, (3) gives ∑ ∣ x ∣ = n q a ( x ) t M ( x ) 1 / c ≤ C 1 / c ( n + 2 ) e / c ∑ x 2 − K O ( x ) ≤ C 1 / c ( n + 2 ) e / c \sum_{|x|=n} q_a(x)t_M(x)^{1/c} \le C^{1/c}(n + 2)^{e/c}\sum_x 2^{-K^{O}(x)} \le C^{1/c}(n + 2)^{e/c} ∑ ∣ x ∣ = n q a ( x ) t M ( x ) 1/ c ≤ C 1/ c ( n + 2 ) e / c ∑ x 2 − K O ( x ) ≤ C 1/ c ( n + 2 ) e / c , and Jensen’s inequality gives (2).
Proof of the amplification theorem
Fix n n n , A ∈ S r A \in S_r A ∈ S r and D D D , and put s = min { r , 1 } s = \min\{r,1\} s = min { r , 1 } , Z ( x ) = T D ( x ) Z(x) = T_D(x) Z ( x ) = T D ( x ) , μ s = E [ T A ( n ) s ] \mu_s = \mathbb{E}[T_A(n)^s] μ s = E [ T A ( n ) s ] , b = s v / a > s b = sv/a > s b = s v / a > s and M = max ∣ x ∣ = n Z ( x ) M = \max_{|x|=n} Z(x) M = max ∣ x ∣ = n Z ( x ) . Since D D D is total, M M M is finite, and the uniform branch gives q a ′ ( x ) ≥ 2 − n − 1 q'_a(x) \ge2^{-n-1} q a ′ ( x ) ≥ 2 − n − 1 , so with E q a ′ [ Z v ] ≤ P ( n ) \mathbb{E}_{q'_a}[Z^v] \le P(n) E q a ′ [ Z v ] ≤ P ( n ) ,
M v ≤ 2 n + 1 P ( n ) , log M = O ( n + 1 ) . (12) M^v \le2^{n+1}P(n), \qquad\log M = O(n+1). \tag*{(12)} M v ≤ 2 n + 1 P ( n ) , log M = O ( n + 1 ) . (12)
For t ≥ 1 t \ge1 t ≥ 1 let p ( t ) = Pr P A [ Z > t ] p(t) = \Pr_{P_A}[Z > t] p ( t ) = Pr P A [ Z > t ] and
F ( t ) = 1 + μ s + E P A min { Z , t } s = 2 + μ s + s ∫ 1 t z s − 1 p ( z ) d z . F(t) = 1 + \mu_s + \mathbb{E}_{P_A}\min\{Z,t\}^s = 2 + \mu_s + s\int_1^t z^{s-1}p(z)\,dz. F ( t ) = 1 + μ s + E P A min { Z , t } s = 2 + μ s + s ∫ 1 t z s − 1 p ( z ) d z .
Lemma G.1 (A clocked tail search). Fix a constant u > b u > b u > b . There is a polynomial C ( n ) C(n) C ( n ) such that for all large n n n and every dyadic t = 2 k ≤ M t = 2^k \le M t = 2 k ≤ M with p ( t ) ≥ t − u p(t) \ge t^{-u} p ( t ) ≥ t − u ,
q a ′ ( { x : Z ( x ) > t } ) ≥ C ( n ) − 1 ( p ( t ) F ( t ) ) a / s . q'_a(\{x: Z(x) > t\}) \ge C(n)^{-1}\left(\frac{p(t)}{F(t)}\right)^{a/s}. q a ′ ({ x : Z ( x ) > t }) ≥ C ( n ) − 1 ( F ( t ) p ( t ) ) a / s .
Proof. Consider the program that, given k k k , repeatedly draws x x x by running A ( 1 n ) A(1^n) A ( 1 n ) with fresh coins and runs D ( x ) D(x) D ( x ) for t = 2 k t = 2^k t = 2 k steps, and outputs the first x x x on which D D D has not halted. A trial succeeds with probability p = p ( t ) p = p(t) p = p ( t ) , and its cost C i C_i C i is at most poly ( n , k ) ( T A , i + min { Z ( x i ) , t } ) \operatorname{poly}(n,k)(T_{A,i} + \min\{Z(x_i),t\}) poly ( n , k ) ( T A , i + min { Z ( x i ) , t }) . Whether trial i i i is reached depends only on earlier trials, so with S S S the cost through the first success, subadditivity of the s s s th power gives
E S s ≤ ∑ i ≥ 1 E [ 1 { i reached } C i s ] = E C 1 s p ≤ poly ( n , k ) F ( t ) p . \mathbb{E}S^s \le\sum_{i\ge1}\mathbb{E}\left[1\{i\text{ reached}\}C_i^s\right] = \frac{\mathbb{E}C_1^s}{p} \le\operatorname{poly}(n,k)\frac{F(t)}{p}. E S s ≤ i ≥ 1 ∑ E [ 1 { i reached } C i s ] = p E C 1 s ≤ poly ( n , k ) p F ( t ) .
By Markov’s inequality, the program succeeds within K = ( 2 poly ( n , k ) F ( t ) / p ) 1 / s K = (2\operatorname{poly}(n,k)F(t)/p)^{1/s} K = ( 2 poly ( n , k ) F ( t ) / p ) 1/ s native steps with probability at least 1 / 2 1/2 1/2 . Since t ≤ M t \le M t ≤ M , p ≥ t − u p \ge t^{-u} p ≥ t − u , F ( t ) ≤ 2 + μ s + t s F(t) \le2 + \mu_s + t^s F ( t ) ≤ 2 + μ s + t s and μ s = poly ( n ) \mu_s = \operatorname{poly}(n) μ s = poly ( n ) , we have log K = O ( n + 1 ) \log K = O(n+1) log K = O ( n + 1 ) . The universal simulation of these K K K steps costs H ≤ K poly ( n , k , log K ) H \le K\operatorname{poly}(n,k,\log K) H ≤ K poly ( n , k , log K ) , so H ≤ poly ( n ) ( F ( t ) / p ) 1 / s H \le\operatorname{poly}(n)(F(t)/p)^{1/s} H ≤ poly ( n ) ( F ( t ) / p ) 1/ s ; Markov’s inequality is applied before the simulation, so no moment of T A T_A T A beyond the s s s th is used. The program consists of fixed descriptions of A A A and D D D and a self-delimiting encoding of k = O ( n ) k = O(n) k = O ( n ) , so it has length O ( log n ) O(\log n) O ( log n ) , and ⌈ log H ⌉ ≤ n 2 \lceil\log H\rceil\le n^2 ⌈ log H ⌉ ≤ n 2 for large n n n . Selecting this program and the clock ⌈ log H ⌉ \lceil\log H\rceil ⌈ log H ⌉ in Q a ′ Q'_a Q a ′ costs an inverse-polynomial factor, the gate costs H − a / 2 H^{-a/2} H − a /2 , and the run then outputs a string with Z > t Z > t Z > t with probability at least $1/2.
Proof of Theorem 4.8. On { Z > t } \{Z > t\} { Z > t } we have Z v > t v Z^v > t^v Z v > t v , so Theorem G.1 and E q a ′ Z v ≤ P ( n ) \mathbb{E}_{q'_a}Z^v \le P(n) E q a ′ Z v ≤ P ( n ) give p ( t ) ≤ poly ( n ) F ( t ) t − b p(t) \le\operatorname{poly}(n)F(t)t^{-b} p ( t ) ≤ poly ( n ) F ( t ) t − b at every dyadic t ≤ M t \le M t ≤ M with p ( t ) > t − u p(t) > t^{-u} p ( t ) > t − u . Hence p ( t ) ≤ t − u + C ( n ) F ( t ) t − b p(t) \le t^{-u} + C(n)F(t)t^{-b} p ( t ) ≤ t − u + C ( n ) F ( t ) t − b at every dyadic 1 ≤ t ≤ M 1 \le t \le M 1 ≤ t ≤ M , and, comparing t t t with its dyadic predecessor, p ( t ) ≤ 2 u t − u + C 1 ( n ) F ( t ) t − b p(t) \le2^u t^{-u} + C_1(n)F(t)t^{-b} p ( t ) ≤ 2 u t − u + C 1 ( n ) F ( t ) t − b for all real 1 ≤ t ≤ M 1 \le t \le M 1 ≤ t ≤ M .
Choose t 0 ≥ 1 t_0 \ge1 t 0 ≥ 1 polynomial in n n n with s C 1 ( n ) t 0 s − b / ( b − s ) ≤ 1 / 2 sC_1(n)t_0^{s-b}/(b-s) \le1/2 s C 1 ( n ) t 0 s − b / ( b − s ) ≤ 1/2 . For T ∈ [ t 0 , M ] T \in[t_0,M] T ∈ [ t 0 , M ] , substituting the tail bound into the integral defining F F F and using F ( t ) ≤ F ( T ) F(t) \le F(T) F ( t ) ≤ F ( T ) for t ≤ T t \le T t ≤ T ,
F ( T ) ≤ 2 + μ s + t 0 s + s 2 u ∫ t 0 ∞ z s − 1 − u d z + s C 1 ( n ) F ( T ) ∫ t 0 ∞ z s − 1 − b d z ≤ poly ( n ) + 1 2 F ( T ) , F(T) \le2 + \mu_s + t_0^s + s2^u\int_{t_0}^{\infty}z^{s-1-u}\,dz + sC_1(n)F(T)\int_{t_0}^{\infty}z^{s-1-b}\,dz \le\operatorname{poly}(n) + \frac{1}{2}F(T), F ( T ) ≤ 2 + μ s + t 0 s + s 2 u ∫ t 0 ∞ z s − 1 − u d z + s C 1 ( n ) F ( T ) ∫ t 0 ∞ z s − 1 − b d z ≤ poly ( n ) + 2 1 F ( T ) ,
since u > b > s u>b>s u > b > s . So F ( M ) ≤ R 1 ( n ) F(M)\le R_1(n) F ( M ) ≤ R 1 ( n ) for a polynomial R 1 R_1 R 1 (if M < t 0 M<t_0 M < t 0 , directly F ( M ) ≤ 2 + μ s + t 0 s F(M)\le2+\mu_s+t_0^s F ( M ) ≤ 2 + μ s + t 0 s ). Then p ( t ) ≤ 2 u t − u + C 1 ( n ) R 1 ( n ) t − b p(t)\le2^{u}t^{-u}+C_1(n)R_1(n)t^{-b} p ( t ) ≤ 2 u t − u + C 1 ( n ) R 1 ( n ) t − b on [ 1 , M ] [1,M] [ 1 , M ] , and
E P A Z b = 1 + b ∫ 1 M t b − 1 p ( t ) d t ≤ 1 + b 2 u u − b + b C 1 ( n ) R 1 ( n ) log e M , \mathbb{E}_{P_A} Z^b=1+b\int_1^M t^{b-1}p(t)\,dt\le1+\frac{b2^u}{u-b}+bC_1(n)R_1(n)\log_e M, E P A Z b = 1 + b ∫ 1 M t b − 1 p ( t ) d t ≤ 1 + u − b b 2 u + b C 1 ( n ) R 1 ( n ) log e M ,
which is polynomial by (10). The logarithm is the endpoint: a tail bound t − b t^{-b} t − b on an unbounded range would only give moments below b b b , and the uniform branch is what bounds the range.
Proof of Theorem 6.11
Fix a rational 0 < v ≤ 1 0<v\le1 0 < v ≤ 1 and a rational ε > 0 \varepsilon>0 ε > 0 with ε v < 1 \varepsilon v<1 ε v < 1 . For each n n n put J = ⌊ ε n ⌋ J=\lfloor\varepsilon n\rfloor J = ⌊ ε n ⌋ , H = 2 J H=2^J H = 2 J and N = 2 n N=2^n N = 2 n . Independently for every x ∈ { 0 , 1 } n x\in\{0,1\}^n x ∈ { 0 , 1 } n , choose a delay L x L_x L x with
Pr [ L x = 2 j ] = ( 1 − 2 − v ) 2 − j v ( 0 ≤ j < J ) , Pr [ L x = H ] = 2 − J v , \Pr[L_x=2^j]=(1-2^{-v})2^{-jv}\quad(0\le j<J),\qquad\Pr[L_x=H]=2^{-Jv}, Pr [ L x = 2 j ] = ( 1 − 2 − v ) 2 − j v ( 0 ≤ j < J ) , Pr [ L x = H ] = 2 − J v ,
so Pr [ L x ≥ 2 j ] = 2 − j v \Pr[L_x\ge2^j]=2^{-jv} Pr [ L x ≥ 2 j ] = 2 − j v for j ≤ J j\le J j ≤ J . Let S n = { x : L x = H } S_n=\{x:L_x=H\} S n = { x : L x = H } and K = ∣ S n ∣ K=|S_n| K = ∣ S n ∣ . If S n ≠ ∅ S_n\ne\varnothing S n = ∅ , choose W n W_n W n uniformly in S n S_n S n , and put B x = 1 [ x = W n ] B_x=1[x=W_n] B x = 1 [ x = W n ] ; otherwise all B x = 0 B_x=0 B x = 0 . Choose independent uniform C x ∈ { 0 , 1 } n 2 C_x\in\{0,1\}^{n^2} C x ∈ { 0 , 1 } n 2 . The oracle X X X answers three query types with tag 1 n 1^n 1 n : the threshold query ( 0 , x , 1 t ) ↦ 1 [ L x > t ] (0,x,1^t)\mapsto1[L_x>t] ( 0 , x , 1 t ) ↦ 1 [ L x > t ] , the reveal query ( 1 , x , 1 t ) ↦ 1 [ L x ≤ t ] B x (1,x,1^t)\mapsto1[L_x\le t]B_x ( 1 , x , 1 t ) ↦ 1 [ L x ≤ t ] B x , and the certificate query ( 2 , x , b , c ) ↦ 1 [ c = C x , b = B x ] (2,x,b,c)\mapsto1[c=C_x,b=B_x] ( 2 , x , b , c ) ↦ 1 [ c = C x , b = B x ] ; malformed queries answer zero, and different lengths use independent data. Writing a threshold or reveal query costs at least t t t steps. Let L = { W n } L=\{W_n\} L = { W n } ; the unique string C x C_x C x certifies membership or nonmembership of x x x , so L ∈ U P X ∩ c o U P X L\in\mathrm{UP}^X\cap\mathrm{coUP}^X L ∈ UP X ∩ coUP X .
D D D asks threshold queries with t = 1 , 2 , 4 , … t=1,2,4,\ldots t = 1 , 2 , 4 , … until one answers zero, which determines L x L_x L x , and then asks the reveal query with t = L x t=L_x t = L x . So L x ≤ T D ( x ) ≤ p ( n ) L x L_x\le T_D(x)\le p(n)L_x L x ≤ T D ( x ) ≤ p ( n ) L x for a polynomial p p p , and, averaged over the oracle, under the uniform sampler E X E [ T D ] ≤ p ( n ) v E X E x [ L x v ] = p ( n ) v ( ( 1 − 2 − v ) J + 1 ) \mathbb{E}_X\mathbb{E}[T_D]\le p(n)^v\mathbb{E}_X\mathbb{E}_x[L_x^v]=p(n)^v((1-2^{-v})J+1) E X E [ T D ] ≤ p ( n ) v E X E x [ L x v ] = p ( n ) v (( 1 − 2 − v ) J + 1 ) . The bound for the fixed oracle follows from the argument for candidates below, since the uniform sampler is one of them.
Candidates. Let Q v Q_v Q v be the sampler of Theorem 3.4 , whose v v v th moment is at most a polynomial P ( n ) P(n) P ( n ) relative to every oracle. Fix n n n , and let the baseline oracle answer every length-n n n reveal and certificate query by zero. The baseline run of Q v Q_v Q v is independent of W n W_n W n and of the strings C x C_x C x , and its only information about the length-n n n delays comes from threshold queries, each costing at least its threshold. So a complete baseline transcript with runtime τ \tau τ and output x x x determines an interval ( u , U ] (u,U] ( u , U ] for L x L_x L x with u ≤ τ u\le\tau u ≤ τ , and, the delays being independent, the posterior of L x L_x L x is the prior conditioned on this interval. For 0 ≤ u < H 0\le u<H 0 ≤ u < H and j = ⌈ log ( u + 1 ) ⌉ j=\lceil\log(u+1)\rceil j = ⌈ log ( u + 1 )⌉ ,
E [ L x v ∣ L x > u ] ≤ 2 j v ( ( J − j ) ( 1 − 2 − v ) + 1 ) ≤ 2 v ( J + 1 ) ( u + 1 ) v , \mathbb{E}[L_x^v\mid L_x>u]\le2^{jv}((J-j)(1-2^{-v})+1)\le2^v(J+1)(u+1)^v, E [ L x v ∣ L x > u ] ≤ 2 j v (( J − j ) ( 1 − 2 − v ) + 1 ) ≤ 2 v ( J + 1 ) ( u + 1 ) v ,
and an upper truncation only decreases this. Hence the baseline output X X X satisfies E [ L X v ] ≤ 2 v ( J + 1 ) E [ ( τ + 1 ) v ] ≤ poly ( n ) \mathbb{E}[L_X^v]\le2^v(J+1)\mathbb{E}[(\tau+1)^v]\le\operatorname{poly}(n) E [ L X v ] ≤ 2 v ( J + 1 ) E [( τ + 1 ) v ] ≤ poly ( n ) . Now compare with the real oracle on the same coins. On runs with τ ≥ H \tau\ge H τ ≥ H , L X ≤ H v ≤ τ v L_X\le H^v\le\tau^v L X ≤ H v ≤ τ v , which contributes at most P ( n ) P(n) P ( n ) . Before time H H H every length-n n n reveal query answers zero in the real oracle too, since a nonzero answer needs t ≥ L W n = H t\ge L_{W_n}=H t ≥ L W n = H ; so the runs differ before time H H H only if a certificate query names some C y C_y C y , which has probability at most H 2 − n 2 H2^{-n^2} H 2 − n 2 . So E X E Q v [ T D v ] ≤ poly ( n ) \mathbb{E}_X\mathbb{E}_{Q_v}[T_D^v]\le\operatorname{poly}(n) E X E Q v [ T D v ] ≤ poly ( n ) , and by Markov’s inequality and the Borel–Cantelli lemma, with probability 1 1 1 over X X X , E Q v [ T D v ] ≤ poly ( n ) \mathbb{E}_{Q_v}[T_D^v]\le\operatorname{poly}(n) E Q v [ T D v ] ≤ poly ( n ) at all large n n n . If Q ∈ S a X Q\in S_a^X Q ∈ S a X with a ≥ v a\ge v a ≥ v , then Q ∈ S v X Q\in S_v^X Q ∈ S v X , and Q v Q_v Q v dominates Q Q Q by Theorem 3.4 , so E Q [ T D v ] ≤ poly Q ( n ) \mathbb{E}_Q[T_D^v]\le\operatorname{poly}_Q(n) E Q [ T D v ] ≤ poly Q ( n ) .
Solvers. Fix a randomized machine M M M and a length n n n with K > 0 K>0 K > 0 , and condition on all data except W n W_n W n and the length-n n n strings C x C_x C x . For runs shorter than H H H , the baseline that answers length-n n n certificate queries by zero is independent of W n W_n W n and of these strings. For x ∈ S n x\in S_n x ∈ S n let σ x \sigma_x σ x be baseline probability of not halting before H H H , p x p_x p x the baseline probability of outputting 1 before H H H , and δ x \delta_x δ x the baseline probability of naming some C y C_y C y before H H H ; real and baseline runs before H H H differ with probability at most δ x \delta_x δ x , and E ∑ x ∈ S n δ x ≤ K H N 2 − n \mathbb{E}\sum_{x\in S_n}\delta_x \le KHN2^{-n} E ∑ x ∈ S n δ x ≤ K H N 2 − n . Put η = ( n + 2 ) − 3 \eta=(n+2)^{-3} η = ( n + 2 ) − 3 . Except with probability η − 1 N 2 H 2 − n \eta^{-1}N^2H2^{-n} η − 1 N 2 H 2 − n , every δ x ≤ η \delta_x\le\eta δ x ≤ η . Suppose also that M M M is correct on every input of length n n n and that its real probabilities θ x \theta_x θ x of running at least H H H steps satisfy K − 1 ∑ x ∈ S n θ x ≤ η K^{-1}\sum_{x\in S_n}\theta_x\le\eta K − 1 ∑ x ∈ S n θ x ≤ η . Then K − 1 ∑ σ x ≤ 2 η K^{-1}\sum\sigma_x\le2\eta K − 1 ∑ σ x ≤ 2 η , so the baseline-determined set F = { x ∈ S n : σ x > 1 / 6 } F=\{x\in S_n:\sigma_x>1/6\} F = { x ∈ S n : σ x > 1/6 } has at most 12 η K 12\eta K 12 η K elements. If W n ∉ F W_n\notin F W n ∈ / F , correctness gives p W n ≥ 2 / 3 − σ W n − δ W n ≥ 1 / 2 − η p_{W_n}\ge2/3-\sigma_{W_n}-\delta_{W_n}\ge1/2-\eta p W n ≥ 2/3 − σ W n − δ W n ≥ 1/2 − η , while every other x ∈ S n x\in S_n x ∈ S n has p x ≤ 1 / 3 + η p_x\le1/3+\eta p x ≤ 1/3 + η . So W n W_n W n lies in F F F or is the unique element of S n ∖ F S_n\setminus F S n ∖ F with p x ≥ 1 / 2 − η p_x\ge1/2-\eta p x ≥ 1/2 − η , a set determined by the baseline. As W n W_n W n is uniform in S n S_n S n given the baseline, this has probability at most 12 η + 1 / K 12\eta+1/K 12 η + 1/ K . With μ = N H − v \mu=NH^{-v} μ = N H − v , Pr [ K < μ / 2 ] ≤ e − μ / 8 \Pr[K<\mu/2]\le e^{-\mu/8} Pr [ K < μ /2 ] ≤ e − μ /8 . The total
e − μ / 8 + η − 1 N 2 H 2 − n + 12 η + 2 / μ e^{-\mu/8}+\eta^{-1}N^2H2^{-n}+12\eta+2/\mu e − μ /8 + η − 1 N 2 H 2 − n + 12 η + 2/ μ
is summable in n n n , since ε v < 1 \varepsilon v<1 ε v < 1 . By the Borel–Cantelli lemma and countability, with probability 1, for every M M M that is correct with error at most 1 / 3 1/3 1/3 , at all large n n n , K ≥ μ / 2 K\ge\mu/2 K ≥ μ /2 and K − 1 ∑ x ∈ S n θ x > η K^{-1}\sum_{x\in S_n}\theta_x>\eta K − 1 ∑ x ∈ S n θ x > η . Then for every w > v w>v w > v ,
E x ∼ A [ T M ( x ) w ] ≥ 1 N ∑ x ∈ S n θ x H w ≥ K N η H w ≥ n 2 H w − v = 2 Ω ( n ) . \mathbb{E}_{x\sim A}[T_M(x)^w]\ge\frac{1}{N}\sum_{x\in S_n}\theta_xH^w\ge\frac{K}{N}\eta H^w\ge\frac{n}{2}H^{w-v}=2^{\Omega(n)}. E x ∼ A [ T M ( x ) w ] ≥ N 1 x ∈ S n ∑ θ x H w ≥ N K η H w ≥ 2 n H w − v = 2 Ω ( n ) .
Intersecting the probability-one events for the candidates and the solvers gives the oracle X X X .
Polynomial-space sources
A positive oracle
Theorem I.1. Let O + O_+ O + be any PSPACE-complete language under polynomial-time many-one reductions. There is one sampler Q Q Q such that Q ∈ S r O + Q\in S^{O_+}_r Q ∈ S r O + for every real r > 0 r>0 r > 0 and Q Q Q polynomially dominates every A ∈ W O + A\in W^{O_+} A ∈ W O + .
The sources in W O + W^{O_+} W O + need not satisfy any moment bound. The sampler Q Q Q uses more than polynomial space, and it must: by Theorem I.5, relative to every oracle no member of W W W dominates every member of W W W . The proof has two parts: each polynomial-space law is dominated within a factor of two by a strict law, and one sampler with all moments dominates every strict law.
Lemma I.2 (Threshold queries). Fix A ∈ W O + A\in W^{O_+} A ∈ W O + and let F A ( x ∣ n ) = Pr [ A ( 1 n ) ≤ x ] F_A(x\mid n)=\Pr[A(1^n)\le x] F A ( x ∣ n ) = Pr [ A ( 1 n ) ≤ x ] in lexicographic order. The predicate F A ( x ∣ n ) > u / 2 n F_A(x\mid n)>u/2^n F A ( x ∣ n ) > u / 2 n , on inputs 1 n 1^n 1 n , x x x and an integer 0 ≤ u < 2 n 0\le u<2^n 0 ≤ u < 2 n , is in PSPACE, hence in P O + P^{O_+} P O + .
Proof. Replace each oracle call of A A A by a deterministic polynomial-space procedure for O + O_+ O + ; since queries have polynomial length, this gives an ordinary probabilistic polynomial-space machine, possibly with unbounded runtime, that accepts when A A A halts with output at most x x x . Flip a fair coin: on one branch run this machine, on the other accept with probability 1 − u / 2 n 1-u/2^n 1 − u / 2 n using n n n fair bits. The probability of ever accepting is 1 2 ( F A ( x ∣ n ) + 1 − u / 2 n ) \frac{1}{2}(F_A(x\mid n)+1-u/2^n) 2 1 ( F A ( x ∣ n ) + 1 − u / 2 n ) , which exceeds 1 / 2 1/2 1/2 exactly when F A ( x ∣ n ) > u / 2 n F_A(x\mid n)>u/2^n F A ( x ∣ n ) > u / 2 n . Unbounded-error probabilistic space s s s , with acceptance defined as the probability of ever accepting, is contained in deterministic space O ( s 2 ) O(s^2) O ( s 2 ) [6 Proposition 6.2] ; see also [24 ] . Since A A A halts almost surely, the halting convention plays no role. □
Lemma I.3 (Grid inverse sampling). For each A ∈ W O + A\in W^{O_+} A ∈ W O + there is a strict sampler B A ∈ P O + B_A\in P^{O_+} B A ∈ P O + with P B A ( x ∣ n ) ≥ 1 2 P A ( x ∣ n ) P_{B_A}(x\mid n)\ge\frac{1}{2}P_A(x\mid n) P B A ( x ∣ n ) ≥ 2 1 P A ( x ∣ n ) for all n n n and x x x .
Proof. Draw u u u uniformly from { 0 , … , 2 n − 1 } \{0,\ldots,2^n-1\} { 0 , … , 2 n − 1 } and binary-search, with n n n calls to Theorem I.2, for the least x x x with F A ( x ∣ n ) > u / 2 n F_A(x\mid n)>u/2^n F A ( x ∣ n ) > u / 2 n ; it exists because F A F_A F A equals one at the last string. Writing F A ( x − ∣ n ) F_A(x^{-}\mid n) F A ( x − ∣ n ) for the value at the predecessor (zero at the first string), the search returns x x x exactly when 2 n F A ( x − ∣ n ) ≤ u < 2 n F A ( x ∣ n ) 2^nF_A(x^{-}\mid n)\le u<2^nF_A(x\mid n) 2 n F A ( x − ∣ n ) ≤ u < 2 n F A ( x ∣ n ) . A half-open interval of length h h h contains at least h − 1 h-1 h − 1 integers, so the resulting law G A G_A G A satisfies G A ( x ∣ n ) ≥ P A ( x ∣ n ) − 2 − n G_A(x\mid n)\ge P_A(x\mid n)-2^{-n} G A ( x ∣ n ) ≥ P A ( x ∣ n ) − 2 − n , ties included. With probability 1 / 2 1/2 1/2 use this procedure and otherwise output a uniform string; then P B A ( x ∣ n ) = 1 2 G A ( x ∣ n ) + 2 − n − 1 ≥ 1 2 P A ( x ∣ n ) P_{B_A}(x\mid n)=\frac{1}{2}G_A(x\mid n)+2^{-n-1}\ge\frac{1}{2}P_A(x\mid n) P B A ( x ∣ n ) = 2 1 G A ( x ∣ n ) + 2 − n − 1 ≥ 2 1 P A ( x ∣ n ) .
Lemma I.4 (One sampler with all moments for strict samplers). For every oracle O O O there is one sampler in ⋂ r > 0 S r O \bigcap_{r>0}S^O_r ⋂ r > 0 S r O that polynomially dominates every member of P O P^O P O .
Proof. Let L = ⌈ log ( n + 2 ) ⌉ L=\lceil\log(n+2)\rceil L = ⌈ log ( n + 2 )⌉ . Choose independent integers λ ≥ 0 \lambda\ge0 λ ≥ 0 and e ≥ 1 e\ge1 e ≥ 1 with probabilities 2 − λ − 1 2^{-\lambda-1} 2 − λ − 1 and 2 − e 2^{-e} 2 − e by geometric coin tossing, a uniform λ \lambda λ -bit description p p p , and put j = e + λ + 1 j=e+\lambda+1 j = e + λ + 1 . Require j 2 L j^2L j 2 L fresh coins to be zero, and otherwise output 0 n 0^n 0 n . If they are, simulate p p p on 1 n 1^n 1 n for 2 e L 2^{eL} 2 e L steps with fresh coins and output its result if it halts in time with an n n n -bit output, 0 n 0^n 0 n otherwise.
There is a constant ξ \xi ξ with simulation and bookkeeping cost at most C 2 ξ j L C2^{\xi jL} C 2 ξ j L after a successful gate; selection and gate generation cost poly ( n + j ) \operatorname{poly}(n+j) poly ( n + j ) , which has polynomial moments of every order because λ \lambda λ and e e e have geometric tails. For fixed r > 0 r>0 r > 0 and fixed choices, the gated execution contributes at most
2 − j 2 L ( C 2 ξ j L ) r = C r 2 ( ξ r − j ) j L ≤ C r 2 ( ξ r ) 2 L / 4 ≤ C r ( 2 ( n + 2 ) ) ( ξ r ) 2 / 4 2^{-j^2L}(C2^{\xi jL})^r= C^r2^{(\xi r-j)jL}\le C^r2^{(\xi r)^2L/4}\le C^r(2(n+2))^{(\xi r)^2/4} 2 − j 2 L ( C 2 ξ j L ) r = C r 2 ( ξ r − j ) j L ≤ C r 2 ( ξ r ) 2 L /4 ≤ C r ( 2 ( n + 2 ) ) ( ξ r ) 2 /4
to the r r r th moment, and averaging over the choices keeps this bound. Combining with ( u + v ) r ≤ max { 1 , 2 r − 1 } ( u r + v r ) (u+v)^r\le\max\{1,2^{r-1}\}(u^r+v^r) ( u + v ) r ≤ max { 1 , 2 r − 1 } ( u r + v r ) gives a polynomial r r r th moment for every r r r ; the algorithm never uses r r r .
If B ∈ P O B\in P^O B ∈ P O has a description p p p of length λ \lambda λ and halts within n c ≤ 2 e L n^c\le2^{eL} n c ≤ 2 e L steps for a fixed e e e and large n n n , then selecting ( p , e ) (p,e) ( p , e ) and passing the gate reproduces B B B exactly, so
P Q ( x ∣ n ) ≥ 2 − 2 λ − 1 − e 2 − j 2 L P B ( x ∣ n ) ≥ 2 − 2 λ − 1 − e − j 2 ( n + 2 ) − j 2 P B ( x ∣ n ) . P_Q(x\mid n)\ge2^{-2\lambda-1-e}2^{-j^2L}P_B(x\mid n)\ge2^{-2\lambda-1-e-j^2}(n+2)^{-j^2}P_B(x\mid n). P Q ( x ∣ n ) ≥ 2 − 2 λ − 1 − e 2 − j 2 L P B ( x ∣ n ) ≥ 2 − 2 λ − 1 − e − j 2 ( n + 2 ) − j 2 P B ( x ∣ n ) .
Proof of Theorem I.1. Apply Theorem I.4 with O = O + O=O_+ O = O + and compose with Theorem I.3; a factor of two does not affect polynomial domination.
The argument is elementary and the ingredients are classical. Its role here is to show that the polynomial-space version of the question cannot be settled by relativizing methods.
Proposition I.5. For every oracle X X X and every Q ∈ W X Q\in W^X Q ∈ W X there are a deterministic sampler A ∈ W X A\in W^X A ∈ W X and strings x n ∈ { 0 , 1 } n x_n\in\{0,1\}^n x n ∈ { 0 , 1 } n with P A ( x n ∣ n ) = 1 P_A(x_n\mid n)=1 P A ( x n ∣ n ) = 1 and P Q ( x n ∣ n ) ≤ 3 ⋅ 2 − n P_Q(x_n\mid n)\le3\cdot2^{-n} P Q ( x n ∣ n ) ≤ 3 ⋅ 2 − n for every n ≥ 1 n\ge1 n ≥ 1 . So no member of W X W^X W X polynomially dominates every member of W X W^X W X , even infinitely often.
Proof. The proof of Theorem I.2, with the calls to X X X kept as oracle calls and the grid 2 − 2 n 2^{-2n} 2 − 2 n in place of 2 − n 2^{-n} 2 − n , shows that F Q ( x ∣ n ) > u / 2 2 n F_Q(x\mid n)>u/2^{2n} F Q ( x ∣ n ) > u / 2 2 n is decidable in deterministic polynomial space relative to X X X : the simulation of [6 ] relativizes, because each transition of Q Q Q depends on one oracle answer to a query of polynomial length written in the configuration. Binary search over u u u then gives F ~ ( x ) \widetilde F(x) F ( x ) with ∣ F ~ ( x ) − F Q ( x ∣ n ) ∣ ≤ 2 − 2 n |\widetilde F(x)-F_Q(x\mid n)|\le2^{-2n} ∣ F ( x ) − F Q ( x ∣ n ) ∣ ≤ 2 − 2 n , and hence an estimate of the mass m ( y ) = Pr [ Q ( 1 n ) m(y)=\Pr[Q(1^n) m ( y ) = Pr [ Q ( 1 n ) has prefix y ] y] y ] within ε = 2 ⋅ 2 − 2 n \varepsilon=2\cdot2^{-2n} ε = 2 ⋅ 2 − 2 n for every prefix y y y . The machine A A A starts from the empty prefix and n n n times extends y y y by the bit whose child has the smaller estimate, then outputs x n = y x_n=y x n = y . If c c c is the chosen child and c ′ c' c ′ the other, then m ( c ) − ε ≤ m ( c ′ ) + ε m(c)-\varepsilon\le m(c')+\varepsilon m ( c ) − ε ≤ m ( c ′ ) + ε , so m ( c ) ≤ m ( y ) / 2 + ε m(c)\le m(y)/2+\varepsilon m ( c ) ≤ m ( y ) /2 + ε . After n n n steps m ( x n ) ≤ 2 − n + 2 ε ≤ 3 ⋅ 2 − n m(x_n)\le2^{-n}+2\varepsilon\le3\cdot2^{-n} m ( x n ) ≤ 2 − n + 2 ε ≤ 3 ⋅ 2 − n . The machine A A A is deterministic, uses polynomial work and query space, and halts, so A ∈ W X A\in W^X A ∈ W X and P A ( x n ∣ n ) = 1 P_A(x_n\mid n)=1 P A ( x n ∣ n ) = 1 .
Opposing oracles and a complexity-class consequence
For r > 0 r > 0 r > 0 consider the property
U r p s ( O ) : ∃ Q ∈ S r O ∀ A ∈ S r O ∩ W O : Q ⪰ A . \mathrm{U}^{\mathrm{ps}}_{r}(O) : \quad\exists Q \in\mathcal{S}^{O}_{r}\ \forall A \in\mathcal{S}^{O}_{r} \cap\mathcal{W}^{O} : Q \succeq A. U r ps ( O ) : ∃ Q ∈ S r O ∀ A ∈ S r O ∩ W O : Q ⪰ A .
The space restriction applies to the sources only.
Corollary I.6 (Opposing oracles). Simultaneously for every real r > 1 r > 1 r > 1 , U r p s ( O + ) \mathrm{U}^{\mathrm{ps}}_{r}(O_{+}) U r ps ( O + ) holds and U r p s ( O ) \mathrm{U}^{\mathrm{ps}}_{r}(O) U r ps ( O ) fails, where O O O is the oracle of Section 6. For O + O_{+} O + one sampler works for every order and every polynomial-space source; for O O O the failure persists for sources in S a l l O ∩ W O \mathcal{S}^{O}_{\mathrm{all}} \cap\mathcal{W}^{O} S all O ∩ W O .
Proof. The positive part is Theorem I.1. The negative part is Theorem 6.1, whose competitors lie in S a l l O ∩ W O ⊆ S r O ∩ W O \mathcal{S}^{O}_{\mathrm{all}} \cap\mathcal{W}^{O} \subseteq\mathcal{S}^{O}_{r} \cap\mathcal{W}^{O} S all O ∩ W O ⊆ S r O ∩ W O .
Corollary I.7. If P = P S P A C E \mathrm{P} = \mathrm{PSPACE} P = PSPACE , there is one unrelativized sampler with polynomial runtime moments of every order that polynomially dominates every almost-surely halting polynomial-space source. Consequently an unrelativized refutation of U r p s \mathrm{U}^{\mathrm{ps}}_{r} U r ps for any real r > 1 r > 1 r > 1 would imply P ≠ P S P A C E \mathrm{P} \ne\mathrm{PSPACE} P = PSPACE .
Proof. Without an oracle the predicate of Theorem I.2 is in PSPACE, hence in P under the hypothesis. Theorem I.3 then gives a strict dominating sampler for every polynomial-space source, and Theorem I.4 with the empty oracle gives the universal sampler.
By Theorem I.6, for each r > 1 r > 1 r > 1 neither U r p s \mathrm{U}^{\mathrm{ps}}_{r} U r ps nor its negation has a proof that relativizes to all oracles. For unrestricted sources the corresponding statement is Theorem 7.3; compared with Theorem 7.8, the space restriction buys a universal sampler with all moments under the stronger collapse P = P S P A C E \mathrm{P} = \mathrm{PSPACE} P = PSPACE , instead of a sampler of order r / ζ r/\zeta r / ζ under P = N P \mathrm{P} = \mathrm{NP} P = NP .
Moment-bounded versus strict sampling
Proposition I.8. Relative to the oracle O O O of Section 6, there is one sampler A ∗ ∈ S a l l O ∩ W O A^{*} \in\mathcal{S}^{O}_{\mathrm{all}} \cap\mathcal{W}^{O} A ∗ ∈ S all O ∩ W O with worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) that no strict polynomial-time sampler polynomially dominates. Relative to O + O_{+} O + , every source in W O + \mathcal{W}^{O_{+}} W O + is dominated within a factor of two by a strict sampler.
Proof. Let Q Q Q be the sampler of Theorem I.4 relative to O O O . It lies in S 2 O \mathcal{S}^{O}_{2} S 2 O and dominates every member of P O \mathcal{P}^{O} P O . Applying Theorem 6.1 once, with a = 2 a = 2 a = 2 , to this Q Q Q gives one A ∗ ∈ S a l l O ∩ W O A^{*} \in\mathcal{S}^{O}_{\mathrm{all}} \cap\mathcal{W}^{O} A ∗ ∈ S all O ∩ W O with worst-case runtime 2 o ( n ) 2^{o(n)} 2 o ( n ) that Q Q Q does not dominate. If some B ∈ P O B \in\mathcal{P}^{O} B ∈ P O dominated A ∗ A^{*} A ∗ , then Q ⪰ B ⪰ A ∗ Q \succeq B \succeq A^{*} Q ⪰ B ⪰ A ∗ and transitivity would give Q ⪰ A ∗ Q \succeq A^{*} Q ⪰ A ∗ , a contradiction. The order of quantifiers is: one A ∗ A^{*} A ∗ for all strict B B B . The second statement is Theorem I.3.
The separation itself is cheap; what makes it worth stating is the contrast with Theorem I.7. An unrelativized version, a polynomial-space sampler with polynomial moments that no strict sampler dominates, would imply P ≠ P S P A C E \mathrm{P} \ne\mathrm{PSPACE} P = PSPACE .
Inside the strict class, universality already fails under a counting collapse. The following is the analogue, in the present exact length-conditioned model, of Yamakami’s conclusion for his model of samplable distributions [31 ] .
Proposition I.9. If F P = # P \mathrm{FP} = \mathord{\#}\mathrm{P} FP = # P , no strict polynomial-time sampler polynomially dominates every strict polynomial-time sampler. The same holds relative to any oracle O O O with F P O = # P O \mathrm{FP}^{O} = \mathord{\#}\mathrm{P}^{O} FP O = # P O .
Proof. Let Q Q Q be a strict sampler; we may assume it reads exactly n c n^c n c coins on every path. For a prefix y y y of length at most n n n , the number of coin strings ω ∈ { 0 , 1 } n c \omega\in\{0,1\}^{n^c} ω ∈ { 0 , 1 } n c for which Q ( 1 n ; ω ) Q(1^n;\omega) Q ( 1 n ; ω ) begins with y y y is a #P function of ( 1 n , y ) (1^n,y) ( 1 n , y ) , so under the hypothesis it is computable in polynomial time, and so is P Q ( y { 0 , 1 } n − ∣ y ∣ ∣ n ) P_Q(y\{0,1\}^{n-|y|}\mid n) P Q ( y { 0 , 1 } n − ∣ y ∣ ∣ n ) exactly. Build x n x_n x n bit by bit: having fixed a prefix y y y , append the bit b b b that minimizes the probability of the prefix y b yb y b , breaking ties toward 0. Each step at least halves the prefix probability, so P Q ( x n ∣ n ) ≤ 2 − n P_Q(x_n\mid n)\le2^{-n} P Q ( x n ∣ n ) ≤ 2 − n . The deterministic source A Q A_Q A Q that outputs x n x_n x n on 1 n 1^n 1 n runs in polynomial time and has P A Q ( x n ∣ n ) = 1 P_{A_Q}(x_n\mid n)=1 P A Q ( x n ∣ n ) = 1 . The ratio 2 n 2^n 2 n exceeds every polynomial at every large n n n , so Q Q Q does not dominate A Q A_Q A Q . The argument relativizes.
Theorem I.4 shows that this obstacle disappears as soon as the universal sampler may leave the strict class while keeping all moments polynomial.
Limits of the CDF route
The hypothesis P = P S P A C E \mathrm{P}=\mathrm{PSPACE} P = PSPACE in Theorem I.7 enters only through exact CDF thresholds. Weaker collapses do not obviously suffice for that step.
Proposition I.10. There is an unrelativized source A ∈ S a l l ∩ W A\in S_{\mathrm{all}}\cap\mathcal{W} A ∈ S all ∩ W whose grid-threshold language { ( 1 n , x , u ) : F A ( x ∣ n ) > u / 2 n } \{(1^n,x,u):F_A(x\mid n)>u/2^n\} {( 1 n , x , u ) : F A ( x ∣ n ) > u / 2 n } is PSPACE-hard under polynomial-time many-one reductions, and for which additive 2 − n 2^{-n} 2 − n -approximation of F A F_A F A in polynomial time would imply P = P S P A C E \mathrm{P}=\mathrm{PSPACE} P = PSPACE . Even deciding whether P A ( x ∣ n ) > 0 P_A(x\mid n)>0 P A ( x ∣ n ) > 0 is PSPACE-hard, so approximating P A ( x ∣ n ) P_A(x\mid n) P A ( x ∣ n ) within any multiplicative factor is as hard. Nevertheless a strict sampler dominates A A A within a factor of two.
Proof. Fix a decider for true quantified Boolean formulas on m m m -bit encodings that uses polynomial space and time 2 O ( m ) 2^{O(m)} 2 O ( m ) , and let b ( z ) = 0 b(z)=0 b ( z ) = 0 if z z z encodes a true formula and 1 otherwise. At lengths n = m 2 + m + 3 n=m^2+m+3 n = m 2 + m + 3 , A A A outputs 0 n 0^n 0 n with probability 1 − 2 − m 2 1-2^{-m^2} 1 − 2 − m 2 ; with the remaining probability it picks a uniform z ∈ { 0 , 1 } m z\in\{0,1\}^m z ∈ { 0 , 1 } m , computes b ( z ) b(z) b ( z ) and outputs y z = 1 z b ( z ) 0 n − m − 2 y_z=1zb(z)0^{n-m-2} y z = 1 z b ( z ) 0 n − m − 2 . At other lengths it outputs 0 n 0^n 0 n . The gate uses m 2 m^2 m 2 coins, the source uses polynomial space, and for every fixed r r r the long computations contribute poly ( n ) 2 − m 2 + O ( r m ) = O ( poly ( n ) ) \operatorname{poly}(n)2^{-m^2+O(rm)}=O(\operatorname{poly}(n)) poly ( n ) 2 − m 2 + O ( r m ) = O ( poly ( n )) to the r r r th moment, so A ∈ S a l l A\in S_{\mathrm{all}} A ∈ S all .
Each z z z has mass ν = 2 − m 2 − m = 8 ⋅ 2 − n \nu=2^{-m^2-m}=8\cdot2^{-n} ν = 2 − m 2 − m = 8 ⋅ 2 − n . Let ι ( z ) \iota(z) ι ( z ) be the integer encoded by z z z and x z = 1 z 00 n − m − 2 x_z=1z00^{n-m-2} x z = 1 z 0 0 n − m − 2 . All outputs from earlier z z z precede x z x_z x z , so F A ( x z ∣ n ) = 1 − 2 − m 2 + ι ( z ) ν + ν 1 { b ( z ) = 0 } F_A(x_z\mid n)=1-2^{-m^2}+\iota(z)\nu+\nu\mathbf{1}\{b(z)=0\} F A ( x z ∣ n ) = 1 − 2 − m 2 + ι ( z ) ν + ν 1 { b ( z ) = 0 } . The midpoint between the two possible values is a multiple of 2 − n 2^{-n} 2 − n with numerator 2 n − 2 m + 3 + 8 ι ( z ) + 4 2^n-2^{m+3}+8\iota(z)+4 2 n − 2 m + 3 + 8 ι ( z ) + 4 , and comparing F A ( x z ∣ n ) F_A(x_z\mid n) F A ( x z ∣ n ) with it decides whether z z z is true. The two values differ by 8 ⋅ 2 − n 8\cdot2^{-n} 8 ⋅ 2 − n , so an additive 2 − n 2^{-n} 2 − n approximation also decides it. Directly, P A ( x z ∣ n ) P_A(x_z\mid n) P A ( x z ∣ n ) equals ν \nu ν if z z z is true and 0 otherwise. Finally, replacing b ( z ) b(z) b ( z ) by a fresh coin gives a strict sampler that assigns each rare output exactly half its original probability and 0 n 0^n 0 n the same probability.
So placing all these thresholds in PP would give PSPACE ⊆ \subseteq ⊆ PP, and combined with P = P P \mathrm{P}=\mathrm{PP} P = PP it would give P = P S P A C E \mathrm{P}=\mathrm{PSPACE} P = PSPACE . This limits only the CDF route: the source that makes the thresholds hard has an elementary strict dominator, and we do not know whether P = P P \mathrm{P}=\mathrm{PP} P = PP suffices for domination by other means.
Remark I.11 (Space on rare runs). The proof above does not establish universality for unrestricted S r S_r S r , because moment bounds permit large workspace on rare runs; the oracle O ⋆ O_\star O ⋆ of Section 7 handles unrestricted sources by a different route. If V A ( n ) ≤ T A ( n ) V_A(n)\le T_A(n) V A ( n ) ≤ T A ( n ) is the charged workspace and q σ ( x , n ) = Pr [ A ( 1 n ) = x , V A ( n ) ≥ σ ] q_\sigma(x,n)=\Pr[A(1^n)=x,\ V_A(n)\ge\sigma] q σ ( x , n ) = Pr [ A ( 1 n ) = x , V A ( n ) ≥ σ ] , then q σ ( x , n ) σ r ≤ E [ T A ( n ) r ] q_\sigma(x,n)\sigma^r\le\mathbb{E}[T_A(n)^r] q σ ( x , n ) σ r ≤ E [ T A ( n ) r ] . When a constant fraction of the mass P A ( x ∣ n ) ≈ 2 − n P_A(x\mid n)\approx2^{-n} P A ( x ∣ n ) ≈ 2 − n sits on such runs, σ \sigma σ may be as large as ( poly ( n ) 2 n ) 1 / r (\operatorname{poly}(n)2^n)^{1/r} ( poly ( n ) 2 n ) 1/ r , exponential in n n n . This identifies the range the moment bound allows; it does not show that such space is needed.
Open question. Does P = P P P = PP P = P P imply universality for polynomial-space sources by a route that avoids exact CDF thresholds? (This is the same as asking about P = # P P = \#P P = # P , since counting values can be recovered from P P PP P P by binary search.)
AI methodology statement
Large language models, namely Claude (Anthropic) and ChatGPT and Codex (OpenAI), were used in preparing this paper: to propose and develop results in Sections 4 and the appendices; to check proofs and parameter conditions, including a numerical check of the stage conditions of Section B and independent re-derivations of the newer results; to compile and check the comparison with prior work; to review drafts; and to restructure the manuscript and draft and revise its exposition. Gemini (Google) was used to suggest ideas for unrelativized results, and Deepreview (Google) was used to help with presentation and spot gaps in the proofs. The author is responsible for all content and has verified the mathematical claims.