Repository navigation
Research: certified format ceilings for Eisenstein/Gaussian/Hurwitz E8 copy floors (no κ claim) - #801
Merged
Mister-Meeseeks merged 2 commits intoOct 16, 2026
Conversation
…kappa claim) Credits: Rohan Guliani (@Rohansguliani). Prepared with AI assistance.
…wap#738/CrocSwap#770/CrocSwap#798); add certified copy-cost sweep
Contributor
|
100-PR batch review at This remains open after scoped triage. Next review step: Label-field census and conditional format ceilings need a dedicated proof/pricing audit; no target-strength construction inferred. This is a specific continuation point, not a rejection or a request to redo already recorded checks. Completed local evidence is retained separately from outstanding whole-head obligations. Batch review, attribution and evidence. Thank you for the contribution. |
Mister-Meeseeks
pushed a commit
that referenced
this pull request
Oct 14, 2026
… the F4/Eisenstein decoder route Certifies, under the inherited format-limits accounting (#801) and the abstract pairing-rank charge (#798), that any Eisenstein-supplied decoder beating the selected complex supplier needs total copy cost C <= 31 at some stage count (sup bracket 31.0635 at s=7, window h=7; with the minrank-10 window, C <= 29 at s <= 35), while every clean support alphabet costs exactly 40 (two sharp witnesses). The remaining upside of the route is the non-clean window C in [22,31]; the prize for any complex-only win is capped by the selected assembly bit side at kappa <= 0.001730427469823602 (+3.45%). No supplier is built and no kappa changes. Verifier: stdlib-only, exact, four negative controls, ~21s; registered replay passes. Co-authored-by: penguin-agent[bot] <penguin-agent[bot]@users.noreply.github.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Research note and tooling. No κ claim and no word. Contributed by Rohan Guliani (@Rohansguliani), with substantial AI assistance.
Builds on the extension-ring E8 floors already proved: #620 (screen), #703 (Hurwitz cost exactly 10), #738/#770/#767 (Gaussian floor 40), #798 (Eisenstein cost ≥22, open in [22,40]) and #765. It does not re-prove them. It turns them into certified B_K format ceilings using the unchanged
research/format-limits-correctedengine.Findings
Reproduce
python3 -B research/label-field-census/census.py --json out.jsonruns in about 4 minutes with numpy only and reproducesRESULT.json. Not covered: s ≥ 15, non-coordinate decoders in the clique table, realisability of Q(ω) frames, and helper/hosting/analytic obligations.