Skip to content

Build #208's bank-absorption target: rank-22 residual absorption — certified accounting κ = 7.00427501305159e-4 (R1–R4 open; not a completed witness) - #219

Closed
ghost wants to merge 1 commit into
mainfrom
unknown repository
Closed

ghost wants to merge 1 commit into
mainfrom
unknown repository

Conversation

@ghost

@ghost ghost commented Oct 9, 2026

Copy link
Copy Markdown

What this builds

The accounting construction of #208's priced bank-absorption target — the rank-22 residual family absorbed into the banks — certified to the exact grid point, with the remaining physical realization stated as a closed checklist.

$$\kappa=\frac{700427501305159}{10^{18}}=0.000700427501305159$$

conditional on obligations R1–R4 (research/residual-bank-run1/obligations.json). The complex supplier binds; the adjacent $10^{-18}$ grid point is rejected by the unchanged 47-constraint assembly. This sharpens #208's 10⁻¹⁰-grid rung-1 target 7004273/10^10 and is +2.42% over the #210 frontier, +5.82% over main.

Scope — read this before treating the number as a witness

This is an accounting construction and a certified target, not a completed finite witness. The rank-22 bin is frame-transition increments (enumerated below), not the gauge-exterior family the current bank construction absorbs; non-gauge chains already bank their residual projectors and keep every increment child. The physical realization of the new residual type is exactly the "future genuinely different residual type" #207's crossover notes reserve. It is stated as a closed one-to-one checklist against the gauge precedent:

  • R1 block assignment / normalizers for the new residual type (admissible tilings of width 72 over families {4, 24, 22} are enumerated by schedule.py)
  • R2 formal-column replay of the modified word (F2 identity + defining-integer decoder) under bank re-assignment at the enumerated transitions
  • R3 exact charts, incidence colouring, prime witnesses for the new blocks
  • R4 moment-envelope parity (any completion child R1 introduces must re-enter the ledger and re-price κ)

Until R1–R4 verify, κ above is conditional on them — stricter than the published witnesses, which have their physical realizations built and replayed. All retained analytic / uniform-recursion / fixed-tape / finite-bridge interfaces are inherited as usual; no unconditional theorem, no benchmark.

What is machine-checked (python3 -B research/residual-bank-run1/verify.py, offline, ~1 min)

  1. Absorbed family with provenance — every rank-22 ledger child traced in the pinned PR200 word (inputs/absorbed-occurrences.json): 1,320 physical-chain frame jumps + 24 copied-centre children + 880 source-chain jumps per vertex = the full hist[22] = 6,672 bin; no other bin touched.
  2. Whole-bank schedule — volume $22 \times 20{,}016 = 440{,}352 = 72 \times 6{,}116$ whole banks; stock drop equals bank count; retained ledger 857,622 children, largest 21; row identity $72 \cdot 50{,}286 - 3{,}614{,}784 = 5{,}808$ with deficit unchanged.
  3. Exact arithmetic — both rational interval moment engines, three-level finite ordinary composition from PR200's completed ordinary supplier, unchanged balanced assembly (η = β = 10⁻²⁴). Validation against a published certificate: before the absorption is applied the same pipeline reproduces PR205's certified packed coarse saving 683528191056257/10^18 to the digit. After absorption the bit coarse saving is 728251090009891/10^18, clearing the complex cap 7.009184e-4.

Verification receipts from this session (same environment, Python 3.12 / Linux)

Credits

Word and checkers: Chafik Boukhalfa (#200). Complex supplier: ikeboy (#193). Bank mechanism: Evan McKinney (#197), realized on this word by rohanarun (#205); completed entrance banks: #186/#207 (Dugongue) and BANK-PROOF-PR200.md. The pricing model this builds: maxime-fleury (#204, #208). Ceiling context: DaysSky (#192/#201/#212). Frontier verification receipts above concern rohanarun (#211/#213), eumemic (#210), chafreaky (#200). All retained upstream attributions stand. Prepared with OpenAI Codex assistance; disclosure in NOTICE.md.

…edule and certified accounting kappa

Enumerates the bit word's rank-22 residual family with chain/frame provenance
(1,320 physical-chain jumps + 24 copied-centre children + 880 source-chain jumps
per vertex), builds the whole-bank absorption schedule (volume 22*20,016 =
440,352 = 72*6,116 whole banks; retained ledger 857,622 children; row identity
72*50,286 - 3,614,784 = 5,808), and certifies the exact accounting to

    kappa = 700427501305159/10^18 = 0.000700427501305159

with the complex supplier binding and the adjacent grid point rejected. The
moment engine reproduces PR205's certified packed coarse saving to the digit
before the absorption is applied.

Conditional on the physical realization obligations R1-R4 (obligations.json):
the rank-22 bin is frame-transition increments, not the bankable gauge-exterior
family, so the residual-type realization (block assignment, formal columns,
charts/colouring/prime witnesses, moment parity) is stated as a closed checklist
and is NOT claimed here. Accounting construction and certified target, not a
completed finite witness.
ghost

This comment was marked as off-topic.

maxime-fleury added a commit to maxime-fleury/integer-mult-bounds that referenced this pull request Oct 9, 2026
…s closed by the pins

Asked whether C1-C7 and R1-R4 can be discharged and whether the kappa can then be made
unconditional. The first is yes and the second is no, and both are readings of pinned bytes
rather than positions, so the answer is now recorded with its evidence and checked back by
verify.py.

The eleven items are one missing artifact seen from eleven rungs: the literal operation program,
then the columns, charts, witnesses and envelope re-run on the word it banks. The supplier this
whole ladder is priced on certifies its flow and all-column fresh identity and states in the same
breath that a literal globally renumbered operation program is not exported, with its receipts
calling the literal program a downstream integration task. So C1's normalizer has to move
projectors that exist only there, C2 re-runs a word that program defines, C3 charts the frames it
creates, and C5-C7 need each child's frame/chain identity where the pins export a count per bin
and not an identity. C4 is the one item closable from the pins alone once C1's completion
children are named; R1 is the exception on the other side, with a pinned precedent to extend.

Unconditional is closed three times over: the supplier is published as a PASS conditional finite
witness, the vendored CrocSwap#219 package states that discharging R1-R4 buys a completed finite witness
and that the result is not an unconditional multiplication theorem in any case, and this
package's own scope says the same of the finite bridge and all-size interfaces it inherits.
Discharging the eleven raises the kappa from a scheduled target to the house-standard conditional
finite witness, which is the whole of what the work buys.

🤖 Generated with Codebuff
Co-Authored-By: Codebuff <noreply@codebuff.com>
Repository owner closed this by deleting the head repository Oct 9, 2026
@chafreaky

Copy link
Copy Markdown
Contributor

FYI for the rung pricing here: #233 certifies a stronger complex supplier on the same lineage, complex saving 3549537/5000000000 = 7.0991·10⁻⁴ (#194's source-assisted word with #200's maximum-weight reuse pairing in place of #168's; frames unchanged; verified through #200's complex checker, #184's flow/exact lift/contract and #194's assembly). The complex budget these rungs are priced against moves from 7.0092·10⁻⁴ to 7.0991·10⁻⁴.

maxime-fleury pushed a commit to maxime-fleury/integer-mult-bounds that referenced this pull request Oct 10, 2026
…7211262868e-4

The package vendors every input it reads by sha256 -- the rung-1 package of CrocSwap#219, the
frontier certificate of CrocSwap#207 and the unmerged source-assisted v4 row of CrocSwap#233, its earlier
heads included -- and re-derives the whole complex-side ladder offline: both paid moments per
rung, the 47-constraint assembly with adjacent-grid rejection, the padded width-66 schedule,
the three export contracts and their import gate.

On CrocSwap#233's row the first whole-bank family of the ledger is rank 3, not rank 16: 66 = 22 * 3
makes its bank exactly filled, so the T1 padding obligation does not arise, and the point
prices 1819302815717/25*10^14 = 7.277211262868e-4, bit-bound, above the ladder top and above
the pinned frontier. The rung is row-dependent and that is measured: its stability is re-taken
on all six ranked heads of CrocSwap#233 and all nine width-66 rows of this repository, and the rung
above it is a recorded negative.

Verification is wired into the repository: a Makefile target in the aggregate, its own CI group
in the Python matrix, an exact-bytes .gitattributes carve-out so committed digests survive a
clean checkout, and a test module whose pin controls check the digest gate fails closed.

Generated with Codebuff 🤖
Co-Authored-By: Codebuff <noreply@codebuff.com>
maxime-fleury pushed a commit to maxime-fleury/integer-mult-bounds that referenced this pull request Oct 10, 2026
…7211262868e-4

The package vendors every input it reads by sha256 -- the rung-1 package of CrocSwap#219, the frontier
certificate of CrocSwap#207 and the unmerged source-assisted v4 row of CrocSwap#233, its earlier heads included --
and re-derives the whole complex-side ladder offline: both paid moments per rung, the 47-constraint
assembly with adjacent-grid rejection, the padded width-66 schedule, the three export contracts and
their import gate.

On CrocSwap#233's row the first whole-bank family of the ledger is rank 3, not rank 16: 66 = 22 * 3 makes
its bank exactly filled, so the T1 padding obligation does not arise, and the point prices
1819302815717/25*10^14 = 7.277211262868e-4, bit-bound, above the ladder top and above the pinned
frontier. The rung is row-dependent and that is measured: its stability is re-taken on all six
ranked heads of CrocSwap#233 and all nine width-66 rows of this repository, and the rung above it is a
recorded negative.

The change adds three things and edits nothing: the package, a test module whose pin controls check
the digest gate fails closed, and the package's own workflow. It deliberately does not take a
Makefile target in the aggregate, because `Makefile` and `.gitattributes` are recorded by other
packages' manifests (the joint-dual and round-8 certificates among them) and editing either moves
their digests; the workflow runs the same commands on 3.11, 3.13 and 3.14 and then requires
`git diff --exit-code`.

Generated with Codebuff 🤖
Co-Authored-By: Codebuff <noreply@codebuff.com>
maxime-fleury added a commit to maxime-fleury/integer-mult-bounds that referenced this pull request Oct 10, 2026
…the padding named item by item

bitrung.py measured the rung this package's top stands on -- three families leaving CrocSwap#219's rung-1
retained bit row -- but left its items unnamed, which is what B1 owes. bitinstance.py instances it
the way instantiate66.py instances the complex ladder: every item of ranks 7, 8 and 20 is given
bank i // k_f, block i % k_f and offset (i % k_f) * rank, over 1,224 banks of 10 rank-7 blocks,
838 of 9 rank-8 blocks and 5,280 of 3 rank-20 blocks, 35,622 items one per block, every bank
exactly filled by the family's blocks plus the padding it draws.

The padding is a partial removal from the retained singleton bin, exactly as T1's is on the
complex side, and it is named rather than counted: 2,448 rank-7 and 63,360 rank-20 registers -- the
first 65,808 children of the 377,316-child bin, in index order, uniform per bank, digested --
leaving the 311,508 the measured rung's retained histogram holds. Each family's bank table is
digested, and the ledger the assignment induces is re-derived from the pinned packed certificate
with plain integer arithmetic: stock 50,286 -> 42,944 with the drop equal to the 7,342 banks, rank
mass 3,614,784 -> 3,086,160, 857,622 children -> 756,192 over 18 families, cross-checked against
the vendored schedule's own retained profile.

verify.py -> check_bit_instancing rebuilds the whole instancing, compares it with
occurrences-bitrung.json, recomputes both digests from the addressing rule instead of trusting
them, re-checks the padding draw, and asserts that the induced ledger is the row check_bit_rung
prices. It also asserts that the pins still export no block and no occurrence of this word and
that the packed certificate's single 'assign' key is its own rejection control, not an item
assignment -- which is why B1 moves to INVENTORY_INSTANCED_AT_SCHEDULE_LEVEL with its provenance
half (each child's frame/chain identity) open, and not to closed.

Generated with Codebuff 🤖
Co-Authored-By: Codebuff <noreply@codebuff.com>
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