Skip to content

The complex row coefficient of the selected outer reserve is one (log2 C −64 bits, no new κ) - #4972

Merged
Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
jwr404:research/selected-complex-row-coefficient
Oct 23, 2026
Merged

Mister-Meeseeks merged 1 commit into
CrocSwap:mainfrom
jwr404:research/selected-complex-row-coefficient

Conversation

@jwr404

@jwr404 jwr404 commented Oct 23, 2026

Copy link
Copy Markdown
Contributor

Result

This answers the c_row half of research/lockstep-live-role-audit open question 1. The complex row proportionality in the #4470 outer-reserve constant C is exactly 1. It was previously assumed ≤ 2^64.

The chain, with every link a verbatim phrase checked against a pinned source:

  1. notes/batched-complex-rows.tex reserves q_0 = ⌈log2 W⌉·D_c(d) row chunks, which is the same unit as OUTER-TRANSFER-AUDIT §5's q0.
  2. AUDIT.md §6 says "The row stock is based on B, not B+O", with child ratio 1/N and f = ⌊e/N⌋.
  3. FINITE-PRECOMPILATION says "the only remaining paid children have rank one". So exit batches add no outer depth, and D_c(d) = ⌊log_N d⌋.

Hence q_0 ≤ ⌈log2 B_c⌉·log_{N_c} d, and c_row = 1.

Recomputation. The verifier authenticates lockstep's constant_c.py and reruns it unchanged, reproducing its published values. It then reruns it with exactly one substituted assumption line, log2_c_row = 64 → 0, in memory only.

assumed derived
log2 C upper bound 64,215,200,000,088 64,215,200,000,024
fit point log2 p 64,473,100,659,114 64,473,100,659,050
upper − lower complex share 132 bits 68 bits

All of lockstep's internal threshold checks still pass. The A_old term never binds, because C is a maximum dominated by the complex share. #4970 separately derives S_old = 1.

No new κ. The selected exponent stays 60403/20000000.

Task and overlap

Card selected-stock-envelope, scope refined (see TASK.json). Base: canonical main b91956876e5b4122fd89179f1b57557ff8378f15, priority revision 7. CLAIM.

The old-lineage "row coefficient 20,161" was a κ≈0.0015-era allowance for a different reservation. It is not a coefficient of this formula.

Not covered:

  • B_c and the compiled ranks;
  • the router;
  • the BIT share;
  • the analytic premises.

This is a source-bound reading of the retained reservation, not a new proof of it.

Test plan

python3.12 -B scripts/research_package.py --package research/selected-complex-row-coefficient --check-only
python3.12 -B scripts/research_package.py --package research/selected-complex-row-coefficient
python3.12 -I -O -W error -B research/selected-complex-row-coefficient/verify.py
python3.12 -B scripts/check_research_commit.py --package research/selected-complex-row-coefficient
  • All four pass locally on Linux with Python 3.12, in under a second.
  • Three mutations make the verifier fail: the derived log2 C, log2_c_row = 1, and a perturbed depth recursion.
  • --check-source-history was not run locally because the checkout is shallow.

Open next questions

Close the remaining 68-bit gap between the upper and lower complex shares of C.

Credit

Prepared by James Reed with substantial Anthropic Claude (Claude Code) assistance. Apache-2.0. No independent human review.

🤖 Generated with Claude Code

The CrocSwap#4470 complex row field is q_0 = ceil(log2 B_c) floor(log_N d)
chunks (batched-complex-rows, AUDIT s6, rank-one compiled children), so
the proportionality assumed as c_row <= 2^64 in lockstep-live-role-audit
is exactly one. Rerunning the pinned constant computation gives
log2 C <= 64,215,200,000,024 (64 bits lower) and fit log2 p =
64,473,100,659,050. The A_old term never binds. No new kappa.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.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