Skip to content

Research note (no κ; bit headroom): helper-deletion ladder under optimal window-respecting re-hosting — ≈ +0.082% c per deletion (d=0..6, certified) - #2465

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
thakrarsagar:research/bit-deletion-ladder
Oct 16, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
thakrarsagar:research/bit-deletion-ladder

Conversation

@thakrarsagar

Copy link
Copy Markdown
Contributor

Research note (bit headroom only); no κ claim. This answers an open question from #2423: what is each further width-8 helper deletion worth on the bit supplier, once the freed slack is re-hosted optimally while respecting stage windows? #1043's R438 is d = 1. #1250 shows that helper 470 is the only removable helper on the fixed word, so d ≥ 2 prices changed words.

d R slack S certified optimum (unique) c TEMPLATE (#1043's measured delta) vs #589
0 439 45 9×(42,5) 0.001733427039589844234749 0
1 438 54 10×(42,5)+1×(42,4) 0.001734802047828389852783 +0.079%
2 437 63 12×(42,5)+1×(28,3) 0.001736238589146810207048 +0.162%
3 436 72 14×(42,5)+1×(28,2) 0.001737652736279473456500 +0.244%
4 435 81 16×(42,5)+1×(14,1) 0.001739118212671177105905 +0.328%
5 434 90 18×(42,5) 0.001740604775296424266918 +0.414%
6 433 99 19×(42,5)+1×(42,4) 0.001741991196114600260000 +0.494%

Shape of the result.

  • About +0.082% c per deletion, nearly linear. The steps alternate with S mod 5, which sets the partial slot.
  • The optimum is always fully idle 42-slots first, with one partial slot.
  • Two more illustrative per-deletion models are reported, RANK1 {1:−8} and RANK7 {7:−1, 1:−1}. Neither is an envelope, as the README explains.

How it was checked (deletion_ladder.py, reusing the pinned verify_rehost machinery of #2423):

python3 -I -B research/bit-deletion-ladder/deletion_ladder.py --check research/bit-deletion-ladder/RECEIPT.json   # ~80 s
# PASS_BIT_DELETION_LADDER d=0..6 exhaustive=21/21 windows_feasible=7/7 c_template(d=6)=0.001741991196114600260000 ... no_new_kappa

Scope.

Credits.

Prepared with substantial AI assistance (Claude Code, Anthropic, Claude Opus 5.5): an AI builder and an adversarial AI verifier. No independent human review is claimed. Apache-2.0.

🤖 Generated with Claude Code

… (d = 0..6)

Prices d further width-8 helper deletions on the bit supplier after
PR1043's R438 and PR2423's re-hosting.

- For each slack S = 45..99 there is a unique optimal slot layout: the
  exact DP plus an exhaustive cross-check of up to 728,466,365 layouts.
- All window splits are feasible, and the placements are audited.
- 21 certified endpoints under three declared local-profile models.

Under PR1043's measured per-deletion delta, each deletion is worth
about +0.082% c, reaching +0.494% at d = 6. The controls reproduce the
PR589, PR1043 and PR2423 endpoints. An adversarial verifier recomputed
all 21 rows independently.

Bit headroom only; no kappa claim (the complex supplier binds).

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
@Mister-Meeseeks
Mister-Meeseeks merged commit b1f581c into CrocSwap:main Oct 16, 2026
55 of 61 checks passed
@thakrarsagar
thakrarsagar deleted the research/bit-deletion-ladder branch October 18, 2026 08:08
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