Finite parameters for the sumset source reduction #
One global affine breaker handles every parity of at most four outer coordinates and all their candidate calls. Its error pays for the union of those tests. The resulting parity bias and discarded-coordinate allowance are chosen for the checked moment and majority bounds.
These are conservative finite choices for the strategy in Chattopadhyay-- Liao, Extractors for Sum of Two Sources, Lemma 5.4 and equation (5): https://arxiv.org/pdf/2110.12652. The choices alone do not assert the sampler guards, source entropy, asymptotics, or a uniform evaluator.
Bit width of the outer sampler index.
Equations
Instances For
Bit width of the candidate index, using the actual padded Gamma seed budget.
Equations
Instances For
Number of outer coordinates in the final majority.
Equations
Instances For
Number of affine calls XORed at each outer coordinate.
Equations
Instances For
One honest call and enough tampered slots for every parity of order at most four.
Equations
Instances For
An injective advice word records the outer and candidate indices.
Equations
Instances For
Local dyadic error exponent of the single selected affine breaker.
Equations
Instances For
Size allowance for the common sampler test.
Equations
Instances For
Discrepancy threshold defining each bad-seed test.
Instances For
Low-order sign-parity bias furnished outside the bad-seed tests.