From b154350fbf1e7d49118851ab899a733727483289 Mon Sep 17 00:00:00 2001 From: Mihir Srivastava Date: Thu, 22 Oct 2026 01:05:16 -0700 Subject: [PATCH] Certify all-length receiver-window costs by exact rank dominance --- .../README.md | 252 + .../RESULT.json | 10742 ++++++++++++++++ .../SOURCES.json | 60 + .../TASK.json | 106 + .../VERIFY.json | 26 + .../verify.py | 329 + 6 files changed, 11515 insertions(+) create mode 100644 research/receiver-window-all-length-floor/README.md create mode 100644 research/receiver-window-all-length-floor/RESULT.json create mode 100644 research/receiver-window-all-length-floor/SOURCES.json create mode 100644 research/receiver-window-all-length-floor/TASK.json create mode 100644 research/receiver-window-all-length-floor/VERIFY.json create mode 100644 research/receiver-window-all-length-floor/verify.py diff --git a/research/receiver-window-all-length-floor/README.md b/research/receiver-window-all-length-floor/README.md new file mode 100644 index 0000000000..9b367f8b39 --- /dev/null +++ b/research/receiver-window-all-length-floor/README.md @@ -0,0 +1,252 @@ +# All-length cost floor for the 128 PR4470 receiver windows + +For each of the **128 adjacent receiver windows** extracted from the pinned +PR4470 constructor, the incumbent minimizes the paid rank cost among **all +finite shear words on the same three persistent fields**, with the same scalar +endpoint and monotone fixed entrance/exit frames. There is **no length or +rational-coefficient cap**. The conclusion holds for every price `r^p`, +`0 < p < 1`, hence every saving `0 < C < 1` with `p = 1-C`. + +This is a computer-assisted, scoped cost-floor proof, not a new kappa, +physical supplier, global optimum, or selected-frontier change. The finite part +has **1,303 reachable states and 239 window/profile pairs**, checked with exact +integers. All seven constructor inputs are SHA256-pinned at canonical main +`f626db5c3a3d781d8f7695038776c621651f75e1`. Every boundary, incumbent and terminal +rank partition is in [RESULT.json](RESULT.json). The written reduction below +is essential: a finite calculation alone does not establish an all-length result. + +## Delta and coordination + +Clear1nsight's [#4546](https://github.com/CrocSwap/integer-mult-bounds/pull/4546) +at `55b8d34c82fc4df6499c5037e156db6e990b96fe` tested words through four unit +shears in twelve windows. Ryanson Jonathan's +[#4567](https://github.com/CrocSwap/integer-mult-bounds/pull/4567) at +`50fedd98cda709707e4291c542e20ead96bcc786` extends the census to all 128 windows, +length six and bounded nonunit alphabets; its README explicitly asks for a +length-independence proof. This package answers the **cost-floor** part with a +different relaxation: directed potential source dependence and frame dimensions. +It imports neither predecessor's search/checking code and does not assume their +finite results. It reuses Cinna Davis's credited #4470 constructor for native data. +Separate implementation does not mean independent human or formal review. + +The `independent-moment` card is refined from its older named suppliers to this +live handoff. Closing an unbounded search direction in a fixed invoice model +identifies which premises must change before further construction searches. +[Discussion #4577](https://github.com/CrocSwap/integer-mult-bounds/discussions/4577) +is the canonical investigation thread. + +**Concurrent work.** The submission refresh discovered +[#4573](https://github.com/CrocSwap/integer-mult-bounds/discussions/4573) and +[#4574](https://github.com/CrocSwap/integer-mult-bounds/discussions/4574), posted +after the initial overlap snapshot, investigating the same all-length question. +#4573 also proposes a dimension/temporal-contact relaxation; #4574 proposes +mandatory-contact bounds. This package is an **independent certificate +implementation and corroborating proof**, not a claim of priority or an +exclusive new question. Its specific evidence is the complete integer +capped-rank comparison for every concave price, with geometric and +premise-removal controls. Coordination updates were posted in both threads. + +## Model and theorem + +Label the persistent fields `a,b,x` by `0,1,2`. Their arbitrary initial scalar +values are independent formal variables. The required scalar endpoint is + +``` +a <- a + ca*x, b <- b + cb*x, x <- x, +``` + +where the source windows have `ca,cb` in `{+1,-1}`. A replacement is any finite +word `y_i <- y_i + c*y_j`, `i != j`, with rational coefficients and that exact +endpoint. Both operands of every gate have one common binary frame in `F2^9`. +Each field's frames grow by inclusion from fixed `S_i` to fixed `E_i`. Every +positive dimension increment, including the exit gap, is charged by its rank. +No extra/owned field, frame decrease, free transport or changed boundary is +allowed. Scalar-height charges are omitted in the replacement's favor; adding +nonnegative charges cannot defeat the lower bound. The common moment +normalization does not affect this local comparison. + +**Theorem.** In each extracted window, every replacement in this model costs +at least the incumbent under `r^p` for every `0