Finite advice-chain parameters with checked guards and reserves #
For advice length a, target error exponent target, requested output out,
and left-source width n, the total chooser sets
e = target + 2*a + clog₂(a+1) + 10,L = 1024*(a+target+out+clog₂(n+1)+256), andm = 2^150*(a+1)*L.
All fixed-depth program guards hold, the final extraction has room for out
bits, and m covers the three entropy reserves. Using this reserve in an
n-bit source still requires m ≤ n, made explicit in the capacity corollary.
These are conservative finite arithmetic deductions for the CGL Algorithm 2 /
Lemma 6.9 route, https://arxiv.org/pdf/1505.00107, rather than constants from
that paper. Distributional security and uniform runtime are separate layers.
The local error exponent fits in the chosen common scale.
All four runtime size guards hold for the chosen right-source length and scale.
The full refreshed state fits inside the chosen right-source length.
The final depth-twenty-four extraction has room for the requested output.
The refreshed-state entropy covers a seed-pair observation and local error.
The chosen source reserve covers every left observation in a advice steps.
The chosen source reserve covers every right observation in a advice steps.
Left-input capacity is an explicit hypothesis, not a property of the total chooser.