claimroutineinferred_dep
Early-word payment at early input places
Early-word queries at pay for the long word via
gives the early-word clause of the reciprocal bound
Statement (paper)
Every original-input query made during the formation of the coefficient word has input place . Hence there are fixed constants such that at all such queries, and since the enclosing gate path has length , the complete suspended local record satisfies the required bound there.
In plain English
Every query to the original input while forming the coefficient word is at a place . So holds at those queries for fixed constants , and the whole suspended local record meets the required bound there.
Why it's here
Since the previous claim shows all input queries occur at places up to , and is about , the -bit coefficient word is only held while is linearly large, so its size is paid for by the term. Adding the gate-path length keeps the same bound, which gives the early-word clause of the reciprocal lemma and lets the suffix-branch claim treat separately.
Classified routine:
Direct bookkeeping consequence of the preceding claim (queries only at places up to k ≈ t/2), so t−j is linearly large and absorbs the O(t+1)-bit word and gate-path length; this is a simple inequality calculation.
Uses
Used by
Sources
PaperOpen
- Section
- §10.4 Reciprocals and the early-word convention
- Page
- —
- Label
—- Line
sections/arithmetic.tex:506
Leannot aligned
Phase 2 aligns this node to a Lean declaration.
Friction
- infoinferred_depoutline: "Early-word payment at early input places" rests on claim-lem-arith-reciprocal-3