Skip to content

Reduce sufficient uniform-rank exponent 18.28× with net taxes and log moments - #4480

Merged
Mister-Meeseeks merged 14 commits into
CrocSwap:mainfrom
zxv:codex/net-tax-rank-compiler
Oct 22, 2026
Merged

Mister-Meeseeks merged 14 commits into
CrocSwap:mainfrom
zxv:codex/net-tax-rank-compiler

Conversation

@zxv

@zxv zxv commented Oct 22, 2026 •

Copy link
Copy Markdown
Contributor

My native profile in #4453 required a sufficient uniform rank of 2^2299850000000. This reusable compiler reduces it to 2^125790000000, an 18.2832× reduction in the exponent, while retaining conditional κ = 0.00300120. Tensor power falls from 675 to 260. At the unchanged tested saving, the new bounds already reduce the exponent by 12.146×; balancing the certified slack gives the headline result.

The new package is research/net-tax-rank-compiler/. It proves net splitting/completion tax bounds, a normalized logarithmic majorant, the separated compiler's exact paid exit law, and a concentration/Bell-polynomial certificate using paid logarithmic moments. A generic exact checker accepts future paid/target profiles and witnesses without emitting the product histogram. A second p7 profile reproduces the method's applicability beyond one invoice.

Verification passes: seven exact benchmark certificates, nine mathematical tests, nine invalid-witness controls, six literal pinned-flow comparisons, registered metadata/pins, committed-byte preflight, and a Git-free isolated/optimized export replay. Separate Sol 6.1 xhigh agents audited the mathematics and recovered Bell coefficients through iid convolution and Newton differences. These are author-side AI checks, not formal or independent human acceptance. The optional ancestry preflight is unavailable in this shallow checkout; exact bytes and portable replay were checked separately.

python3.12 -B scripts/research_package.py --package research/net-tax-rank-compiler
python3.12 -I -O -B research/net-tax-rank-compiler/verify.py

This branch is stacked on #4453 at de6869e2e4d9c6f630bac5de4a919d99a2cb884b. New work is confined to the package above; inherited #4440/#4441/#4453 research files retain their predecessor status. Shared documentation matches canonical main. See the source pins and VALIDATION.md. The newer pending #4470/#4479 construction is acknowledged; this PR makes no strongest-κ or cross-profile rank claim.

Native and outer producer receipts are inherited rather than rerun. The new uniform saving supplies the retained outer point by monotonicity. All-column correctness, whole-job adapters, owned erasure, finite native closure, analytic, physical tape, stock, precision, prime-avoidance and exact-recovery premises remain. No new κ, selected-frontier update, materialized word size or runtime speedup is claimed.

Credit Jacob Alan Sussman's finite integer compiler, Cinna Davis's thinning and fresh-helper work, my κ=.0023/native/controller/higher-moment/logarithmic contributions, and the full retained predecessor lineage. Substantial OpenAI Codex assistance; Apache-2.0. Open next questions include exact raw log moments, a changed native paid profile for κ, and productive-width/physical-constant bounds.

Hosted CI status

The new net-tax package and six inherited scientific replays passed at head 896b877eae0b297c6da1ee78c6dd6a94a9c5868f. After excluding inherited shared-documentation edits, run 39701477284 stops in onboarding planning: four existing current-status/navigation tests fail. The same four failures reproduce from canonical main 2a13eb1827784206202db90e5dc8327cf8a250db using its unchanged test, selected record and documentation. The current head scientific matrix is therefore skipped; this is not an all-green hosted CI claim. No historical frozen source or verifier was changed to bypass those checks.

@Mister-Meeseeks
Mister-Meeseeks merged commit bbde3b0 into CrocSwap:main Oct 22, 2026
1 of 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.

3 participants