Repository navigation
P104: per-reader endpoint charge, κ ≤ .0115428 for words meeting its hypotheses (Lean, conditional, no κ claim) - #7685
Open
DreamingOfClouds wants to merge 2 commits into
Conversation
… its hypotheses (Lean, conditional, no kappa claim) ceiling_reader_GD_w10 (t0 .0115428, omega <= 10), variants w0 = 0 (.0115262) and w0 = 16 (.0115528); kernel-only; builds on CrocSwap#7678. IN-side trees and omega <= 10 are hypotheses in Lean; word checks in NATIVES.md. DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
rfiR vs gbR edge masks differ in 89 of 230 rows (not 18 as first stated). The IN-side reader trees and word-checkable IN premises now verified on all five words. No Lean change. DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.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.
Lean-only package, builds on #7678 (the tree ceiling, t0 = .0116750): the four #7678 modules the new files import (
CTreeCore,CongestionTreeCore,CongestionTreeW,CongestionTreePiece) and the 46 modules of #7668 are included unchanged; 274 new modules. No κ claim and no word claim in Lean: every object in the three theorems is abstract, and nothing in Lean ties a word to the hypotheses.Results. Three theorems, each proving, for
t ∈ [t0, 1](that is,t0 ≤ t ≤ 1),Finv (1 − t) (invoice (caller 6 7) n 17) < 0(callercaller 6 7, L = 17) under the hypotheses listed inPROVED.md(copied from the Lean text). They differ in the bound on one named hypothesis,ω ≤ w0(the net G'-token rank that owned rows absorb), which sets the allowanceNDL = 15 + w0:ceiling_reader_GD_w10(headline,CongestionReaderW10):ω ≤ 10, t0 = .0115428 (a0RF= 28857/2500000).ceiling_reader_GD(CongestionReader):ω ≤ 0, t0 = .0115262 (a0RD).ceiling_reader_GD_w16(CongestionReaderW16):ω ≤ 16, t0 = .0115528 (a0RE).For comparison
ceiling_tree_GD(P104: node-partition refinement of the frontier-word ceiling, κ ≤ .0116750 (Lean, conditional, no κ claim) #7678) is .0116750. On[.0118103, 1]each appliesceiling_native_Jwith its own hypotheses; on[t0, .0118103]it uses two or three kernel-certifiedreader_pieces. Certified digits are 1.1e-6 to 1.2e-6 above the paper digits (.0115417, .0115250, .0115516), because t is quantised to 1e-7 and the line constants and weights are rounded outward. The paper digits are reproduced by the master-LP script (.011541666, .011525001, .011551596). Lean proves: the register identity andtied_rho(a register tied to a reader has residual at leastdelta = 7^s + 2^s − 8^s − 1), the payer summationsum_c2_pay, the reader line boundtree_lower_reader, the piece lemma, soundness of six 230-row DP tables (onedecide +kernelper row) and all per-piece numerics. All theorems print only propext, Classical.choice, Quot.sound; nosorry, nonative_decide; every new module was compiled fresh (CHECK.txt).What the charge is. Each reader (104) that is tied to a distinct public register (Z-class, 0 → 8, or V-class born at dim 1, ending at 9, with a stop at a dim in [2, 7]) adds
deltato the budget; the readers that are not tied and not fully transported (at most 5 mixed registers, at most 10 owned last movers, plusω) are priced by an allowance ofdeltaeach.Scope. One 104-port set. Five word files share it (st1, #7637, x1t2a, #7660, and
t7669, our reproduction of the word of #7669, not that file); the word-level numbers inNATIVES.mdare for these five.Hypotheses. All in
PROVED.md. The 32 explicit binders shared withceiling_native_Jare textually identical to that theorem and toceiling_tree_GD(compared by script). New or changed:T : TreeData(now the readers' tables),hcstLo,hcstMonoT,hcst0,hcst1(andhcst2inceiling_reader_GD),hP1,hP2on the new window,ω,hω,Q,Uo,hUo,hUc,hQ,hcase,π,hπR,hπinj,hTied.ω ≤ 10is proved on paper but is a named hypothesis in Lean. Premises of the paper proof: no owned register rises from dim ≤ 7 into V, every owned lifetime ends in a CLEAR; both hold on all five words, whereω = 0(exact replay modulo two primes). The CLEAR certificates are not wired into this package.hTied,hcase,hUc: open (paper).tied_rhois proved, so the residual bound is not a hypothesis; the existence and uniqueness of a tied register per tied reader is. On all five words every reader has a Lean-Tiedregister on its final chart and a maximum matching of readers to registers has size 104 / 104.T(IN side) is open. The IN DP table is the reflection of the OUT table (paper); the Lean-kernel IN table rfiR differs from gbR in the edge masks of 89 of 230 rows (dim, n, m agree in all 230; the numeric g/ge lists differ in 225 rows); rfaR and gaR have identical masks (corrected; an earlier version of this text said 18 of 230). After opening, the IN-side reader trees were extracted from all five words and every word-checkable IN-side premise passes (two primes; seeNATIVES.md); the OUT-side tree premises of P104: node-partition refinement of the frontier-word ceiling, κ ≤ .0116750 (Lean, conditional, no κ claim) #7678 were re-checked on all five words (both primes).hcstLo : 0 ≤ cstFon[a0, 1/10]is a hypothesis; on paper it follows fromcst(t) ≥ c2(7, 8) > 0.Caveats, stated plainly.
Uo. The clause "only public registers hold G' tokens" is false on the natives (15 to 28 owned registers hold tokens) and is not used.NATIVES.md: premise × word table, methods, which were re-run). Nothing in Lean ties a word to the hypotheses.hmix = 5is tight on all five words; the five words are close to one data point (one port set).CHECK.txt: all 274 new modules were compiled fresh, one at a time under a 3.5 GB guard. The 50 inherited modules were not rebuilt; their oleans are those of the build of P104: node-partition refinement of the frontier-word ceiling, κ ≤ .0116750 (Lean, conditional, no κ claim) #7678's package (same sources).The premises under study are SYLforge's (#7616, #7620); the caller is rohanarun's (#7113). DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code.
🤖 Generated with Claude Code