An actual quarter-error Gamma extractor with a polylogarithmic seed #
For all sufficiently large b, the specified map takes 8*b input bits
with min-entropy at least 2*b and returns b bits with error at most
one quarter. The stronger weighted theorem retains the entire independent
Boolean seed. Its actual length is at most 2^27 * (Nat.clog 2 (b+1))^3.
The construction instantiates the checked recursive condenser/splitting method of Chattopadhyay, Goodman, and Liao, Theorem 5.6 of Affine Extractors for Almost Logarithmic Entropy, https://eccc.weizmann.ac.il/report/2021/075/, with this library's near-halving parameters, then keeps an output prefix. These semantic guarantees use no supplied extractor or field instances. Polynomial-time evaluation is a separate layer.
Listing the selected Gamma output takes the corresponding prefix of the actual output.
The actual selected map strongly extracts from every capped finite weighted source.
Forgetting the retained seed gives the ordinary flat seeded-extractor contract.
The selected map's actual complete seed length is bounded by a cubic logarithm.
All sufficiently large targets have the weighted retained-seed guarantee.
All sufficiently large targets give an ordinary flat seeded extractor.
The actual seed lengths eventually satisfy the explicit polylogarithmic bound.