[rohanarun]

Change and mathematical scope

Replace the legacy ordinary routine at stopped bit leaves with PR182's already completed ordinary supplier, then apply three fixed acyclic wrapper levels. This gives conditional

kappa = 660627334074291/10^18 = 0.000660627334074291,

0.062219% above PR182's 0.000660216552061722 at af90b94783f7d104a0be75c762ade758bec75855.

The physical complex/bit words, matching, terminal sinks, frames, prime witnesses and histograms are unchanged. For coarse saving c = 0.000661064051056, atom exponent theta = c, and immutable PR182 ordinary saving a_0, each level has a_(j+1) = (1-c)c + c a_j. The finite three-level chain pays strict adapter and internal-borrowing tolls and feeds the retained paid balanced 47-constraint assembly. It never calls itself at the same level or claims to attain the infinite-depth limit.

The compositional proof checks weighted leaves, arbitrary complete spectators, nested borrowed-row restoration, radix padding, fixed tape constants and all-size uniformity. Existing hypotheses remain conditional; finite arithmetic and replay do not prove those interfaces. The retained 252 external reserve is conservative slack, not a bound on new internal borrowing.

This is a modest improvement. PR183's ceiling observation concerns fixed suppliers; this change increases the ordinary supplier through finite composition. The package preserves all prerequisite files.

Validation

• Exact paid supplier moments, three finite bootstrap levels, 47 strict inequalities and seven margins pass; adjacent bit/final grid points are rejected.
• Adversarial controls reject fictional leaves, invalid bootstrap depth, unpaid atom tolls, row/scalar omissions and overstated suppliers.
• Independent composition review and rational recurrence agree. Independent prime-power weighted-leaf algebra covers 178 unit cases and rejects six mutations.
• Fresh underlying PR182 complete complex and bit word replay passed, including full formal columns, signed/defining-integer checks, frames, prime witnesses and 21 inherited assembly controls. The package validation receipt records the log hash.
• Full verification passed on research head 32daefe471e1e41926971747bb901e2839938b43: all 14 native Makefile groups on Python 3.11/3.13/3.14, all three formal packages, and the selected gate, for 46 successful jobs. Native jobs also passed git diff --exit-code. Native/formal run and selected/physical replay. Downloaded log archives were independently hash- and integrity-checked. The follow-up commit changes only this package's validation receipt, README status and corresponding README source hash; mathematical sources are unchanged.

Run python3 -B research/bit-leaf-bootstrap182/verify.py.

Prepared by Rohan Arun with OpenAI Codex assistance. Credit Chafik Boukhalfa's PR181/182, eumemic's PR168, icekylinx's PR144 and stopped-wrapper lineage, James Chang's PR166 and balanced assembly, RaD, Zhihao Chen, and all predecessor attributions retained in NOTICE and the unchanged prerequisite packages.

[Mister-Meeseeks]

Thank you @rohanarun. This contribution is now recorded on main in the scoped reconciliation review and contributor credits.

Contribution: Finite three-level ordinary-leaf bootstrap.

Review and limits: Fresh verifier; exactly three levels, not a new infinite fixed-point theorem.

The complete original source, proof/research notes, notices and relevant replay/CI evidence are retained through the pinned source archive. The review distinguishes fresh runs, exact-head historical CI and prior integration evidence. Closing this historical PR as reconciled; its obsolete headline does not replace the current selected bound, and draft/retracted claims retain their explicit qualifications.

Reviewed head: 561d6ecbbeb94a11b67862ccedd32bfcbad2cae0. Publication: b84ba67156a01f9c2cb34fe1e3cb1dcdeab00d9c.