Skip to content

Conditional κ = 6.83847872497761e-4: five-level bootstrap on PR211 cascade frames - #213

Closed
sennemmi wants to merge 4 commits into
CrocSwap:mainfrom
sennemmi:codex/five-level-cascade-frames-20261010
Closed

sennemmi wants to merge 4 commits into
CrocSwap:mainfrom
sennemmi:codex/five-level-cascade-frames-20261010

Conversation

@sennemmi

@sennemmi sennemmi commented Oct 9, 2026

Copy link
Copy Markdown

Five-level finite bootstrap on the PR211 cascade-frame supplier

Result

Starting from open PR211's exact conditional exponent 683847872495777/10^18, this follow-up adds two fixed stopped-leaf levels and obtains

kappa = 683847872497761/10^18
      = 0.000683847872497761.

The exact gain over PR211 is 1984/10^18. The fifth level adds the last 10^-18 grid step over the four-level version. The bit supplier still binds. The regenerated certificate stores all 47 exact positive assembly margins, and the independent audit rejects the adjacent final grid point.

Mechanism and inherited construction

The finite supplier and physical frames are PR211's frozen cascade-optimized PR200 bit word: 6,191 changed operation frames, the same terminal-modified word, 1,760 compensated aliases, completed banks, and PR193 complex supplier. We do not overwrite that layout with an older frame candidate. In an explicit comparison, PR211 already uses the same first-frame minimum joins at all 17 pairs found in our prior local search, while its second frames are smaller than that earlier candidate. The stronger cascade schedule is retained intact.

Let c be the newly priced packed bit saving and let a_0 be the fully paid ordinary saving from the admitted PR200 word. Five fixed recurrences use

a_j = (1-c)c + c a_(j-1),  j=1,2,3,4,5.

The exact rational verifier checks every recurrence, a_(j-1) < a_j < c < 1-a_j, the two-supplier paid moments, and the unchanged 47-constraint assembly with eta=beta=10^-24 and weakening 10^-30. The finite depth is five, independent of input size. For the fixed suppliers, the exact assembly ceiling at the unattained limit a=c has the same 10^-18 grid floor as the fifth level; since every finite a_j<c and the ceiling is increasing, no deeper fixed level can raise the reported grid value. The limiting value is only an upper-bound check, not an input supplier.

Reproduction and validation

python -B research/cascade-frames-bit/verify.py \
  --complex-root .dependencies/pr193 \
  --bit-root .dependencies/pr200 \
  --full

The existing workflow checks out the pinned PR193 and PR200 sources, reruns the PR193 complex verifier, re-admits all PR200 frames and terminal columns, rebuilds banks, recomputes the exact certificate and independent moment audit, and compares the regenerated certificate byte for byte. The root Verify workflow also covers the repository Makefile matrix and formal jobs.

The local exact-arithmetic replay used PR211's frozen admitted physical record and the byte-pinned PR193 assembly/certificate. It produced five levels, 47 positive exact assembly margins, an independent moment audit PASS, and the exact limiting-grid upper bound. At Draft creation, this follow-up's GitHub Actions runs have not yet completed; the submitted branch reruns the complete frame/source verification.

Conditions and limits

The conclusion remains conditional on the inherited all-width compiler, completed weighted/restored selector, routing, prime supply, precision/recovery, fixed analytic tape, and finite bridge hypotheses. PR211's cascade search is heuristic and does not prove a frame optimum. Finite verification does not prove the inherited all-size interfaces or the multiplication theorem unconditionally; this adds no Lean proof and makes no practical-speedup claim.

Attribution

The cascade frame layout and its verification belong to PR211 (Rohan Arun, with Anthropic Claude assistance). The bit word/checkers are from PR200, banks from PR197, complex supplier from PR193, and finite-composition work from PR185/187/210; their licenses and source notices are retained. The fifth-level arithmetic extension and independent audit were prepared with substantial OpenAI Codex assistance. No inherited construction is claimed as new or exclusive work.

Frontier snapshot at Draft submission

The public list was refreshed immediately before opening this Draft.

rohanarun and others added 4 commits October 9, 2026 11:33
…plier: kappa = 6.830613e-4

Apply PR197's completed-bank packing (Evan McKinney) to PR200's
terminal-modified fixed-coordinate/face-diagonal bit word (Chafik
Boukhalfa): exact charts for its 220 distinct rank-20 gauge frames, 45,842
rank-72 banks with a proper 9-edge-colouring of all 154,026 incidences,
and three copies of PR200's recounted histogram without its 6,600 rank-60
exterior children (W = 56,402, deficit 5,808, largest child 22). The bit
coarse saving rises to 683528191056257/10^18; three finite ordinary-leaf
levels and PR193's unchanged balanced assembly certify
kappa = 683061299399923/10^18, +0.913% over PR202, exactly the value
PR204 modelled. The bit branch binds.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_011S35E2acyQDaVRjPRw4TDy
6,191 operation frames re-optimized by cascading raise/lower moves under the
first-order paid moment, admitted through PR200's own exact checkers
(F2/integer columns, terminal sinks, prime witnesses), then packed into
completed banks and composed with PR193's complex supplier.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_011S35E2acyQDaVRjPRw4TDy
@ghost

ghost commented Oct 9, 2026

Copy link
Copy Markdown

Verification receipt + one portability note (Linux / Python 3.12, this session):

Also verified in the same session: #200 full replay PASS and #212's ceiling.py --check PASS — consistent with this PR's claim sitting at ~98% of the banked-ledger frame ceiling. #219 pursues the lever that escapes that ceiling (child-ledger absorption), priced in #208.

@sennemmi

Copy link
Copy Markdown
Author

Archiving this Draft as part of the research closeout. It adds a five-level bootstrap to the cascade-frame work in #211. The cascade-specific replay and targeted terminal/recycled-bit workflows passed at head b7af6934299024e04555929c13640cf2342613f4; the root research-artifact workflow was cancelled, and the existing verification comment records the inherited PR193 portability limit for --full. PR #211 remains open. The earlier verification receipt and this branch history are retained; no further maintenance is planned. See #261.

@sennemmi sennemmi closed this Oct 10, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants