Pull Request #4441 in the CrocSwap/integer-mult-bounds repository applies verified fresh-helper retiming to all 19 full native calls of the query-thinned complex controller introduced in #4440. The author reports that all 16 paid query shears, whole idle calls, main operators and the stronger BIT supplier are retained.
The resulting author-checked conditional bound is T(n) = O(n (log n)^(1 - 0.00300105)). This raises κ by 0.00004105 (+1.3868%) over #4440's 0.00296, 11.7098% over #4416's 0.00268647, and 30.4804% over the pinned selected 0.0023. Paid calls fall from 72,902 to 69,273, saving 3,629, while productive and paid rank masses become 260,798 and 259,998, preserving a surplus of 800.
The author states that exact interval bounds place the fixed-profile root between 0.0030010541830 and 0.0030010541834, and that an interval proof covers every real 0<C<1. The new moment requires a repaired paid-tail limit of gamma < 97/100, since #4440's 31/32 fails on this profile. The stronger BIT construction is unchanged, and all nine outer rows, 54 current predicates and four functional guards are reported to pass.
The work is an author-checked conditional construction awaiting review. Its premises remain unverified by independent parties, and the author claims no unconditional theorem, practical runtime result, global optimum or formal acceptance. Overall CI remains red on three archived source-pin checks.
Source: Hacker News · Summarized by HeadlinesBriefing