Repository navigation
Conditional kappa = 0.001274032592088050: sharper bit bad-class charge on #458 - #461
Srikrishnabalaji wants to merge 1 commit into
Conversation
The proved fallback count and prime bound are strictly tighter than the round 10^-16 times 32 m^2 envelope, so the same histogram and assembly yield a larger exponent. Co-authored-by: Cursor <cursoragent@cursor.com>
|
Thank you @Srikrishnabalaji. Your work and attribution are retained in the published 100-PR review, credits and complete original source. Covered: Sharper proposed bad-class charge on the hosted bit moment. Arithmetic is distinct from applicability of the proposed 2m^3/q probability law to the retained orthogonal cover. The later count-only correction explicitly withdraws that probability transfer. Keeping this PR open: The claimed sharper 2*m^3/2^80 exceptional fraction is a GL-cover estimate, while the supplier retains the orthogonal-cover invoice. PR491 explicitly withdraws this probability transfer. Supply a valid bound for the actual cover or revert to the retained bad fraction and reprice; arithmetic alone does not discharge this obligation. The source archive preserves the entire submission; it does not substitute for the remaining execution or review. The batch's machine-readable disposition records this as partial coverage. Reviewed head: |
Summary
(2 m^3 / 2^80) * (6 N (N - 1) + 3 N + 6 (N - 1))rank-one children, withN = 2 m. Atm = 78that is strictly below the round10^-16 * 32 m^2envelope.1274032589159993/10^18. The sharp charge gives kappa25480651841761/20000000000000000(0.001274032592088050), a gain of2928057/10^18. The assembly remains bit-bound. Both moment engines certify the new root, all 47 outer inequalities hold, and the next10^-18grid point is rejected.Test plan
python research/sharp-bit-bad-fraction/prove.pyprintsPASSand the kappa above