| Small next-block pseudoentropy gap gives samplers | statement | lemma 3.5 | arxiv |
| Batched table lookup | statement | corollary 2.15 | arxiv |
| Characterization of stateless sequential sampling | statement | theorem 3.3 | arxiv |
| 45F9MJ9JFF | statement | fact 2.13 | arxiv |
| Sample lower bound for estimating the state distribution | statement | proposition 4.4 | arxiv |
| $(\ell, s, B)$-Sequential Sampling Algorithm | definition | definition 3.1 | arxiv |
| Nonnegativity of KL divergence; see Theorem 2.6.3 | statement | fact 2.4 | arxiv |
| Public-key steganography | statement | corollary 8.4 | arxiv |
| Data processing inequality | statement | fact 2.9 | arxiv |
| Separating insertional from next-block pseudoentropy gaps | statement | corollary 7.3 | arxiv |
| KL chain rule; Theorem 2.5.3 | statement | fact 2.7 | arxiv |
| 8DZC27GRFP | statement | theorem 1.3 | arxiv |
| Pseudorandom generation | statement | corollary 8.2 | arxiv |
| Insertional decomposition | definition | definition 5.2 | arxiv |
| Distinct one-symbol insertions | statement | lemma 5.8 | arxiv |
| Small insertional pseudoentropy gives conditional samplers | statement | lemma 5.11 | arxiv |
| Laplace estimator | definition | definition 2.10 | arxiv |
| Markov chain; see Chapter 4 | definition | definition 2.6 | arxiv |
| One-way functions against circuits | definition | definition 2.18 | arxiv |
| Batched Laplace sampling from selected samples | statement | corollary 2.17 | arxiv |
| General consequence for samplers with logarithmic state | statement | corollary 8.1 | arxiv |
| G4F5GD5MXH | statement | theorem 1.2 | arxiv |
| Insertional Pseudoentropy | definition | definition 5.3 | arxiv |
| Characterizing conditional pseudoentropy, nonuniform setting | statement | theorem 2.23 | arxiv |
| GNRHVJX9RA | statement | theorem 1.5 | arxiv |
| Conditional and final KL-divergence | statement | lemma 5.9 | arxiv |
| Pinsker's inequality; Lemma 11.6.1 | statement | fact 2.5 | arxiv |
| Sequential sampler with $k$ bits of state | definition | definition 4.1 | arxiv |
| KL-hardness for conditional sampling | definition | definition 2.22 | arxiv |
| Characterization of stateless insertional sampling | statement | theorem 5.6 | arxiv |
| Markov chain of sequential sampling states | statement | lemma 4.2 | arxiv |
| MY125M11N9 | statement | theorem 1.4 | arxiv |
| Next-block pseudoentropy | definition | definition 2.21 | arxiv |
| General sampling is stronger than insertional sampling | statement | theorem 7.2 | arxiv |
| P5XD719MWR | statement | lemma 2.11 | arxiv |
| Sorting networks | statement | theorem 2.14 | arxiv |
| Batched sampling from a Laplace estimate | statement | corollary 2.16 | arxiv |
| KL chain rule for Markov chains | statement | fact 2.8 | arxiv |
| Shannon entropy | definition | definition 2.1 | arxiv |
| PWVXJ4F64E | statement | theorem 1.1 | arxiv |
| Binary entropy | definition | definition 2.2 | arxiv |
| Stateless Insertional Sampler | definition | definition 5.1 | arxiv |
| Public-key encryption | statement | corollary 8.3 | arxiv |
| Insertional sampling is stronger than sequential sampling | statement | proposition 7.1 | arxiv |
| Pseudoentropy, nonuniform setting | definition | definition 2.19 | arxiv |
| Conditional pseudoentropy, nonuniform setting | definition | definition 2.20 | arxiv |
| Next-block pseudoentropy implies conditional sampling hardness | statement | lemma 3.4 | arxiv |
| Separating insertional from ordinary pseudoentropy gaps | statement | corollary 7.4 | arxiv |
| Insertional pseudoentropy implies conditional sampling hardness | statement | lemma 5.10 | arxiv |
| Insertionally samplable pseudorandom generators | statement | theorem 6.1 | arxiv |
| KL divergence | definition | definition 2.3 | arxiv |
| State elimination for sequential samplers (small KL | statement | theorem 4.3 | arxiv |
| Conditional KL bound from joint Laplace estimation | statement | lemma 2.12 | arxiv |
