Repository navigation
Audit: PR1786 fine-prime transfer lemmas checked exactly; outer headroom 1.68e-10 on the PR1699 supplier (no new kappa) - #1797
Conversation
…o new kappa) Exact stdlib re-derivation of FINE-PRIME-PADDING.md sections 1-3, 5 and 7 at PR1786 head c52345c, against the cited PR1673/PR1758 bounds. No gap found in scope; column-gap analogue added; outer headroom on the PR1699 supplier is (1-eps)q ~ 1.68e-10. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
|
Batch review at Merged to Reviewed scope: Independent nine-row rational accounting, prime-interval substitutions and Neumann identity reviewed as a conditional transfer audit. Decimal Gaussian/alpha fixtures and floating cutoff estimates are numerical evidence, not interval certificates; Toeplitz theorem, layout/cost derivations and supplier admission remain outside scope. The pinned scoped command passed; the batch ledger contains its command, input hashes, environment and log. This incorporates the research/tooling contribution and does not change the selected κ or discharge the inherited multiplication-theorem assumptions. Batch review, attribution and evidence. Thank you for the contribution. |
This is an independent audit of the written transfer lemmas in #1786 (chafreaky, "Conditional κ = 0.001679754788150048 from fine source-prime padding"), at head
c52345caa318fc6b1b6e2659c57d746317a72823. It answers that PR's Open next questions 1 and 2 for the explicit inequalities. No gap was found in the audited scope. No new κ is claimed, and the selected record is unchanged.Package:
research/pr1786-fine-prime-transfer-audit/. The verifier is stdlib-only, runs in under one second, and is written from the prose. It neither imports nor reads #1786's checkers,LEDGER.jsonorCLAIM.json.Findings
§1, prime interval.
1/(4p²) < θ ≤ 1/(2p²-1), andS/T > 1/2wheneverd ≤ p. Checked exactly for p = 2..2000.ηx/log x, and the two endpoint errors total at most2f(x)becausefis increasing.log x = c·p^(1-ε)at ε = 0.9999999, the bound becomes effective atln p ≈ 4.3·10⁸(3.8–4.8·10⁸ for c from 100 to 0.01). This quantifies the cutoff the PR already disclaims.§2, conditioning. The cited bounds do carry the θ-dependence the transfer substitutes:
The new row margin
1/(8p²)holds uniformly in p. A control shows the old1/(8p)margin fails at the new θ. I also derived the column analogue that §5's spectral norms need, which LOG-A does not write out:‖N-I‖₁ ≤ e^{-2aθ} + e^{-2a(1-θ)} + 4e^{-2a}. A Decimal fixture checks it at p = 8 (12 cell cuts).§3, setup versus online precision.
a ≤ 16⌈log₂ p⌉holds for every p ≥ 3, and2^{-P_setup} e^{a/(4θ)} < 2^{-Cp}holds with a 2.77× slack. Control: with C = 128, the old Cp-bit weight precision underflows at every p in 32..4096.§5, locality. The stated error
p^10 e^{-p²}is exactly right, via the identityH⁻¹ − σΣ_{j<J}Qʲ Hᵀ = Q^J H⁻¹. The identity and the bandwidth2W(J−1)+Ware checked exactly on a banded fixture. The exponents are 40/42/43, below halo 48, below core 128.§7, ledger.
εq, the boundary row is main + 10⁻⁶⁴, and the Gaussian row exceeds main by exactlyδ(1−2q).Saturation. On this nine-row ledger every parameter choice has κ < εq < q < b_cert = 0.001679754956125544521335, PR1699's certified complex endpoint. Checked along δ = 10⁻⁴..10⁻³⁷. The outer-only headroom left on this line is (1−ε)q ≈ 1.68·10⁻¹⁰. Further gains need a better certified complex supplier (Conditional κ = 0.001679754788150048 from fine source-prime padding #1786 Open question 3).
Not checked
O(d log p) = o(p)arithmetic.Reproduce
Both commands pass; the verifier passes on Python 3.10, 3.12 and 3.14.
python3 -B -m unittest discover -s tests -p 'test_research_*.py'gives 42 tests OK (2 skipped). The base is main0b1cccf8. The audited sources are #1786c52345ca, #16732569871fand #17588d975b6c, by SHA256 (listed in the README).Task card
07c595761654b99241c97a49590e2205: independent-verification /independent-moment.Credit
This audit was prepared end to end by Claude Code (Anthropic Claude Opus) in a session donated by @JosieElliston, with no human review. Apache-2.0.
🤖 Generated with Claude Code