Skip to content

Bit c = 0.001733052823: #545's punctured unit on the R420 skeleton (111 live ports, +4.79% over #543) - #555

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
eumemic:research/e8-bit-p111
Oct 12, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
eumemic:research/e8-bit-p111

Conversation

@eumemic

@eumemic eumemic commented Oct 12, 2026

Copy link
Copy Markdown
Contributor

Bit c = 1733052823330162099157/10²⁴ = 0.001733052823330162099157 at nine stages (R = 439 helpers, v = 111 live ports, decoder constant 63). That is +4.79% over #543's R420 word in the same pipeline and +4.43% over #545's punctured R489 unit. Every cited complex supplier binds: with #548's b the conditional κ = 49718254847979/31250000000000000 = 0.001590984155135328 (complex-bound; #548 is an open PR). The value of this word is bit headroom: κ stays complex-bound until a complex b exceeds 0.00173.

Concurrent PRs. While this was being verified, #551 (chafreaky) and #552 (Dugongue) reported κ = 0.001591968902833346 with stronger complex suppliers, #551 paired with #543's R420 word. Any of those complex suppliers is also complex-bound with this word, so they set κ. This PR does not claim a κ above them; it raises the bit ceiling from 0.00165383 (#543) to 0.00173305.

This PR stacks the punctured-star unit of #545 (DreamingOfClouds) on the R420 L3 skeleton of #543. Nine E8 lines are neither sources nor targets, and each of the nine retained totals is a pseudo-target that reads what the removed target would read, at frame rank 7.

quantity value
bit c, nine stages (#510's chain, parameterised for v ≤ 120; 10⁻²⁴ grid) 0.001733052823330162099157
bit c, eleven stages (#493's chain as parameterised by #545's adapt.py, run unchanged) 427652201524503168379/(2.5·10²³) = 0.001710608806098012673516
#543's R420 word, nine stages 0.001653826988146798944268
#545's punctured R489 word, eleven stages (reproduced as a control) 0.00165947204563779652541
complex supplier (cited from its receipt) complex b κ binds
#548 (Dugongue; open) 796759709641153381751/(5·10²³) = 0.001593519419282307 49718254847979/31250000000000000 = 0.001590984155135328 complex
#544 (chafreaky; open) 31864911873350496687/(2·10²²) 397677800014309/(2.5·10¹⁷) = 0.001590711200057236 complex
#535 (icekylinx; open) 1589991533606044174031/10²⁴ 793733736881443/(5·10¹⁷) = 0.001587467473762886 complex
#531 (icekylinx; merged) 304013615566499291631/(2·10²³) 1517760977820331/10¹⁸ = 0.001517760977820331 complex

The same κ values hold with #543's word, since its c is also above every cited b (#547 reports the #548 value with it).

Why #545's construction needed a change on L3

In #493's skeleton the Q-node runs in phase A, so a pseudo-target can read everything a target reads before the scatter. In L3 the block node runs in phase B, after the targets have read its source registers at their cells. A retained total is read at the scatter, at the end of phase A, so the part of a target's sum that the block node delivers (the live lines of the complementary block B) is not available to a pseudo-target. In a 4-frame with one punctured line, the pseudo-target also needs an odd number of single d-line reads.

The pseudo-target total of a punctured line p (a fresh helper):

  • reads the source of kline(p) at its line frame, before that line's cell gate;
  • reads o1 at D6[p, qhost(p)] (it takes the place of the third register qdel[p]);
  • reads p's needers at its two (z,z) D6s at p⊥. One of them is a free keeper of B that a phase-A mini-node at the block frame D4(B) rewrote to carry the pseudo-target's B-part. The mini-node reads the other free keepers of B, the sources of B that no target reads (the source in a punctured target's d-single cell), and extra carriers (helpers that read a source of B at its line frame) for the remaining lines.

The 9 totals are fresh helpers and 10 extra carriers are needed, so R = 420 + 9 + 10 = 439. The extra carriers also serve as junk wires of the block nodes. The decoder needs the classes of P in E8/2E8 to be affinely independent. A complementary D4 pair spans only 6 dimensions (affine rank 7), so P meets two block pairs: P = [10, 15, 51, 53, 56, 66, 72, 89, 111] in blocks (0,1) and (3,5). #545's own P is not eligible under #543's plan, because the frame (z,z) structure of its line 39 does not fit.

Rank-mass identity. At nine stages it reads T(8v − 9·cst) = 32·321 = 10,272. The hosting wall R ≤ 4v = 444 admits R = 439, and all 126,432 residuals are hosted whole with no banks.

Checks (bash research/e8-bit-p111/verify.sh DIR, about 4 minutes)

Retained assumptions

As for #543 (mutable-basis realization, interleaved interface lemma) and #545 (a 111-port bit supplier in the outer assembly; #442 whole-call hosting). Complex savings are cited from receipts. #548, #544 and #535 are open PRs, and #548 also retains #539's bad-class transport as a premise. This is a conditional finite construction, not a Lean proof.

Credits

Prepared by eumemic with substantial Anthropic Claude assistance. Apache-2.0.

🤖 Generated with Claude Code

… R420 skeleton, c 0.001733052823

Stacks CrocSwap#545's punctured-star unit (DreamingOfClouds) on CrocSwap#543's R420 L3 skeleton: nine E8 lines
(P = 10, 15, 51, 53, 56, 66, 72, 89, 111) are neither sources nor targets, and the nine retained totals
are pseudo-targets at frame rank 7 (decoder constant 63). Because L3 delivers the Q-part in phase B, each
pseudo-target gets it through a free keeper rewritten in a phase-A mini-node at the complementary block
frame (with extra carriers for missing lines); R = 439, v = 111. Priced by CrocSwap#510's nine-stage chain,
parameterised for v <= 120 (code/adapt9p.py): c = 1733052823330162099157/10^24, +4.79% over CrocSwap#543's word;
by CrocSwap#493's eleven-stage chain as parameterised by CrocSwap#545's adapt.py: c = 0.001710608806098012673516. Every
cited complex supplier binds: kappa = 0.001590984155135328 with CrocSwap#548's b. Controls reproduce CrocSwap#510's R480
outputs byte for byte through the parameterised files, and CrocSwap#545's c and program hash through CrocSwap#545's files.

Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com>
@Mister-Meeseeks

Copy link
Copy Markdown
Contributor

Thank you @eumemic. This contribution at 65a6bc19f820c8b1873f65a517bcf70cd6887223 is incorporated in the reviewed family through #588, published in 9594b61.

Combines puncture with delayed block-node skeleton by adding phase-A mini-nodes and carriers, rather than assuming removed targets can read future phase-B values. H1-H5 includes phase-B helper writes as z updates; exact decoder and COPY rank63 checked. Pooled-cell/all-size contracts retained.

Preserved implementation and research:

The family review and individual disposition record the scope, evidence and attribution. Parallel and intermediate contributions remain credited even where a later composition has a stronger bound. The published multiplication bound remains conditional on the documented compiler, realization, hosting and analytic assumptions; these finite checks are not a full Lean multiplication proof.

Mister-Meeseeks pushed a commit that referenced this pull request Oct 12, 2026
… nine-stage c 0.001733427039589844234749

Hoist one summand of a D4 mini-node gate to its rank-1 frame and sink another to
the rank-7 pseudo-total frame (tune/moves.json, tune/apply.py), found by running
the mechanisms of PR #541, #542 and #548 as generic searches on PR #555's word.
Nine-stage c +0.0216% (eleven-stage 0.001710951900777583975622, +0.0201%); kappa
unchanged (complex-bound). tune/verify.sh replays the stacked word through
PR #555's chains; PR #555's verify.sh is unchanged. MANIFEST.sha256 lists tune/.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Mister-Meeseeks pushed a commit that referenced this pull request Oct 12, 2026
…tural lemmas, helper bounds

research/format-limits records results about the limits of the current format, each with
its scope and with a machine check where one is possible (verify.sh: 298 claims).

- Format ceiling, rev. 2: under the accounting axioms (pressure identity, deficit, window,
  B_K schedule, batching, hosting) every supplier has a <= X(s, h/k, x); on the punctured
  units (bit 111/63, complex 112/64) kappa <= 5.1595e-3, complex binding. Axioms checked
  on #555/#568, gap decomposition, scope multipliers; the x = 3/5 scope of rev. 1 is
  superseded.
- Spec versus convention census: 25 rules with file:line anchors in the upstream paper and
  the hub's checkers (checked), and the corrections found.
- Structural lemmas with exact toys: frame sandwich, port gauge (Lemma N), complement
  sinks pinned (Lemma R), quotient domination (Lemma Q), lambda = +-i (Lemma lambda),
  pairing uniqueness at the E8 pattern, per-call descent pricing.
- Design-free helper floors (bit 212/138, complex 107/0), coupling adds 0, carriers
  register-neutral; complex helper prices by class and width on #569 and the moment-cost
  census on #555/#569.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Mister-Meeseeks added a commit that referenced this pull request Oct 13, 2026
…ling contributions

Select conditional kappa 0.001661634653669567 from Jeremy Kothe's #799 on Chafik's #741 and the #589/#555 bit supplier. Preserve the previous checkpoint and cumulative attribution. Complete #795, #777, six #681 component reviews, and five exact tooling reviews. Integrate #806 as a scoped hash-substitution diagnostic with an adversarial counterexample to timing-only attribution. Retain source-pinned evidence and separate publication/CI state.
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