Skip to content

Record the uniform reservoir constant 3 r_max / p (no new κ) - #4923

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
jwr404:research/crt-reservoir-uniform-constant
Oct 23, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
jwr404:research/crt-reservoir-uniform-constant

Conversation

@jwr404

@jwr404 jwr404 commented Oct 22, 2026

Copy link
Copy Markdown
Contributor

Change and mathematical scope

Scoped comparison. No new κ. The selected conditional exponent stays 60403/20000000, and PR #4100 is not accepted.

Every layout accepted by the #4174 constructor has G ≥ 256. The constructor requires p ≥ 1 and ell ≥ max(2, ceil(log2(p+2))), and ceil(log2(p+2)) ≥ 2, so

G = 64 (ell + ceil(log2(p+2))) ≥ 256.

The floor is achieved at p = 1, ell = 2, and 65,536 widths of 1: G = 256, L = 65536, r_max = 2.

For G ≥ 256 the factored sharp term 2 + 2^{1−62G} − 2^{2−63G} is strictly less than 3. At r = r_max,

r (2/B + β) < (3 r_max / p) p 2^{-G}.

The same bound covers the published window term. On the equality case the constant is 6, and both C = 1 and C = 1/6400 fail. When the layout also has L ≤ p, 3 r_max / p ≤ 3/25600 < 1/6400, so the older constant still covers those layouts. The production plan r_max = 5, p = 9240576 satisfies the tighter majorant.

Task and overlap

Validation

Python 3.12, standard library only:

python3.12 -B scripts/research_package.py --package research/crt-reservoir-uniform-constant

Observed PASS_CRT_RESERVOIR_UNIFORM_CONSTANT G_min=256 equality_p=1 equality_r=2 integer_factor=3, then PASS_REGISTERED_RESEARCH_PACKAGE research/crt-reservoir-uniform-constant outcome=completed.

Not run: a layout census, the 104,864-plan schedule, the E product, Lean, and Docker.

Credit

Hiroki KUMAZAKI, PR #4174, for the constructor. PR #4646 for the factored window term. PR #4921 for the constant 3 on one layout. Cinna Davis, PR #4100, for the CRT parameters.

Prepared by James Reed with substantial Cursor Grok 4.7 assistance. Apache-2.0. No independent human review and no formal-kernel acceptance are claimed.

Open next questions

  1. On the equality-case layout p = 1, ell = 2, r_max = 2, G = 256, what does 3 r_max 2^{-G} times the printed E envelope become? First step: multiply 6 · 2^{-256} by 2^{4 ell} (p+2)^{16} and compare with 2^{-60 ell} (p+2)^{-48}.

Every layout the CrocSwap#4174 constructor accepts has G >= 256, so the
factored window term is strictly less than 3. Then C = 3 r_max / p
suffices at r = r_max. No new kappa.

Co-authored-by: Cursor <cursoragent@cursor.com>
@Mister-Meeseeks
Mister-Meeseeks merged commit aa1018d into CrocSwap:main Oct 23, 2026
2 checks passed
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