Skip to content

Outer retune of #2260: #1673 capped phase-cell fusion outer on the selective-borrowing supplier, conditional κ = 0.00168341258854… - #2265

Merged
Mister-Meeseeks merged 2 commits into
CrocSwap:mainfrom
DreamingOfClouds:research/selective-borrowing-outer-retune
Oct 16, 2026
Merged

Mister-Meeseeks merged 2 commits into
CrocSwap:mainfrom
DreamingOfClouds:research/selective-borrowing-outer-retune

Conversation

@DreamingOfClouds

@DreamingOfClouds DreamingOfClouds commented Oct 15, 2026 •

Copy link
Copy Markdown
Contributor

Outer retune of #2260 (no new construction): conditional κ = 0.00168341258854260746233031974039993696…

What this is. #2260 (Dugongue) built a new finite complex supplier and assembled it with the retained balanced-prefix outer, whose final κ ≈ b/(1+b): 3361/2000000. #2220 (jeremykothe2) instead applied #1673's capped phase-cell fusion outer to its supplier, with strict slacks retuned to the fixed-grid maximum (#2180 / #2161). This package applies that same outer, with #2220's ledger code (formulas unchanged), to #2260's supplier. Nothing in the finite construction is new.

Result (research/selective-borrowing-outer-retune/):

Verify (≈75 s; assertions on; numpy and SymPy needed, as for #2220's outer evidence):

python3 -B research/selective-borrowing-outer-retune/verify.py

This replays #2260's supplier from scratch from a verbatim vendored copy at fde6b107, using #2260's own steps:

It then binds #2260's recounted profile to the retune's SPEC, certifies the endpoint, and regenerates the outer ledger byte-identically.

Caveats

Credits

Prepared by DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code; Apache-2.0.
🤖 Generated with Claude Code

@DreamingOfClouds
DreamingOfClouds force-pushed the research/selective-borrowing-outer-retune branch from 06e62f2 to 9c55971 Compare October 15, 2026 02:54
…selective-borrowing supplier

Applies PR2220's retuned PR1673 outer ledger (fixed-grid maximum, PR2180/PR2161)
to PR2260's finite complex supplier (vendored at fde6b10). Certifies the supplier
endpoint to 1e-200 (native and conservative moments) and derives conditional
kappa = C - 1e-246 - 1e-222 = 0.00168341258854260746233031974039993696...
(+0.1733% over PR2260, +0.2177% over PR2220). No new finite construction.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
@DreamingOfClouds
DreamingOfClouds force-pushed the research/selective-borrowing-outer-retune branch from 9c55971 to 49ce38f Compare October 15, 2026 02:59
@DreamingOfClouds
DreamingOfClouds marked this pull request as ready for review October 15, 2026 02:59
thakrarsagar added a commit to thakrarsagar/integer-mult-bounds that referenced this pull request Oct 15, 2026
Independent re-audit: PR2260's local/check_trace.py (run by local/verify.py)
and owners/verify.py, both rerun by CrocSwap#2265 (verify.py:43-44), already enforce
event closure and the owner-row facts. Limit A1's TRUE-unencoded label to the
namespace/metadata sub-facts (warps = WITNESS pairs, active = namespace minus
removed aliases, owned arrays outside the namespace, handoffs exactly on the
borrowed sources) and move the owner-row facts to A3. Align the INVENTORY
class definition with the README. Update TASK.json evidence (15 of 15,
9/1/5) and replace its pre-review open questions with the README's. Move the
orphaned MISSING-PROOF/FALSE row into the Result table and correct the
provenance of the D5 engine comment (PR361 / e8-r740 lineage, predates
PR2260). Counts, verify.py and EXPECTED.json are unchanged.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Mister-Meeseeks pushed a commit that referenced this pull request Oct 15, 2026
Adversarial audit / research note (no new kappa). Inventories 15 supplier-
admission premises of the #2265 substitution (PR1673 capped-fusion outer on
the PR2260 selective-borrowing supplier) with file:line pins and checks the
finite ones with independent stdlib code on pinned PR blobs: call closure of
the 44 borrowed aliases, an exact free-group restoration replay of both
orientations, owner hosting and residual recount, finite constants, bit and
complex endpoint moments, rate ordering. 6 COVERED, 4 TRUE-unencoded,
5 INHERITED-traced, 0 MISSING-PROOF, 0 FALSE; 13 negative controls rejected.

Prepared by thakrarsagar with substantial AI assistance from Claude
(Anthropic, Claude Opus 5.5).

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Mister-Meeseeks pushed a commit that referenced this pull request Oct 15, 2026
…den controls

- B1: report the literal-prefix threshold (lambda <= 8), state that both
  self-consistent readings pass, and check that the same mixed-reading
  thresholds bind the selected #1094 (pinned verify_frontier1094.py).
- A2/B2/B3 reclassified COVERED (#2265 reruns PR2260 local/verify.py and
  local/invoice.py); D5 restated as a disjunction with the PR559 license.
- Credit PR2226's witness for the X_73 borrow; cite PROOF-LOCAL:22.
- Replace the tautological lambda control with two invoice-data mutations;
  add a backward-orientation replay control (15 controls).
- Fall back to fetching pinned SHAs if a PR head moves; author credits.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
@Mister-Meeseeks

Copy link
Copy Markdown
Contributor

Maintainer progress at 49ce38fee91f33edb54645724e7be9530f5631f6: the full registered replay passes (48.655 seconds here), including the supplier replay with the stated canonical-payload comparison, the 200-digit endpoint, 54 outer rows/17 rejection controls, and the 19 inherited finite evidence replays. All 70 vendored supplier files match #2260 exactly; the independently published decompressed-factor hash also matches our separate reconstruction. This is finite evidence, not completion of the shared analytic/tape proof review.

One concrete packaging correction: outer/FINE-PADDING-COMPOSITION.md says that vendor/pr1786/FINE-PRIME-PADDING.md is vendored verbatim and uses it as the proof of the prime/precision/locality statements, but that path is absent from this package (and its manifest). The source is available in #2220 at fc09a70baf7d6bcff935df226f6fc9e6c6c0131d:research/capped-fusion-t74-k554/vendor/pr1786/FINE-PRIME-PADDING.md, SHA256 47d1b1b4df28aadda3cd6bdeb1fbc47290595e9208cd09c1a1f338520d33fdce; it matches #1786's c52345caa318fc6b1b6e2659c57d746317a72823:research/fine-prime-padding/FINE-PRIME-PADDING.md exactly. Please include the proof and its retained notice with manifest coverage, or replace the nonexistent local link with a precise pinned external dependency and accurately describe what is bundled.

The shared accretive-circuit statement also needs the scale qualification described in the #1758 review. This appears repairable for the normalized Gaussian application; it is not a rejection of that application.

The shared #1673/#1758/#1786 all-size analytic and fixed-tape composition is still under review. No selected-frontier change follows from this replay. Credit for the supplier and outer refinements remains as recorded in your package.

- vendor/pr1786/FINE-PRIME-PADDING.md and NOTICE.md vendored verbatim from
  PR2220 fc09a70 (proof identical to PR1786 c52345c), with manifest coverage.
- outer/ACCRETIVE-SCALE.md: erratum to GAUGEFREE-INTERIORS Thm 4.1 per the
  PR1758 review (general log(2+Lambda+1/mu) form; ratio form for unit-diagonal
  kernels), carried through truncation/rounding, descendants and pivots;
  pointer note prepended to the inherited GAUGEFREE text (body unchanged).
- outer/check_accretive_scale.py: exact checks, run by outer/run_outer.py.
No ledger number or kappa changes.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
@DreamingOfClouds

Copy link
Copy Markdown
Contributor Author

Thanks for the replay and for both corrections, and apologies for the oversight: the package cited a vendored proof that it didn't actually contain. Both are fixed at 6b09c565887c400ca01fafb067bc9d855f1ef9fc (one commit on top of 49ce38fe).

1. Packaging (vendored, not an external pin)

2. Scale qualification of the accretive circuit theorem

  • New file outer/ACCRETIVE-SCALE.md (8b449cbd…) is our own text. It states the corrected theorem and carries it through.
    • General form (Thm 4.1'): log(max prefix / suffix / inverse-prefix norm) = O(log N · log(2 + Λ + 1/μ) + log N). The precision statement becomes p + O(log N · log(2 + Λ + 1/μ)) bits. This is the absolute-scale guard of the vendored SHALLOW-TOEPLITZ §9.
    • Proof change: step (d) uses the pair (Λ′, 1/μ) instead of the ratio Λ′/μ, and log(2 + Λ′ + 1/μ) = O(log(2 + Λ + 1/μ)).
    • Ratio form for unit-diagonal kernels (Cor 4.1''): h₀ = 1 gives Λ ≥ |h₀| = 1 and μ ≤ Re⟨He₀, e₀⟩ = 1. So Λ + 1/μ ≤ 2Λ/μ, because 2Λ/μ − Λ − 1/μ = (Λ−1)/μ + Λ(1−μ)/μ ≥ 0.
    • Descendants and shears: the hypothesis is needed only at the root kernel. The descendant and shear bounds are stated in root quantities, and on a unit diagonal they satisfy Λ′ + 1/μ ≤ 3(Λ/μ)², 1/μ ≤ Λ/μ and shears ≤ Λ/μ. So each per-node log factor is ≤ 2·log(2 + Λ/μ) + log 4.
    • Truncated/rounded kernels (Cor 4.2): band truncation and rounding leave the diagonal at exactly 1. There is also a near-unit fallback with constant 7/2 for |h₀ − 1| ≤ 1/2.
    • Boundary pivots (Cor 4.3): the pivot bounds are absolute and stay true. Where they feed a guard, they convert to the ratio form in the same way.
  • Why our application satisfies the restricted form: both circuits apply the normalised kernel G′ₛ(u) = exp(−γu² + 2γsu), whose diagonal is G′ₛ(0) = 1. The narrow block has N_ii = 1. The chirps and the e^{γs²} constants sit outside the circuit. With Λ ≤ 3 + √(2π/γ) and μ ≥ p^{−O(1)}, we get log(2 + Λ + 1/μ) ≤ log 2 + log(2 + Λ/μ) = O(log p), so the guard is O(log N log p) bits per axis, as stated before.
  • New script outer/check_accretive_scale.py (ec6e7bee…) runs 188 exact checks using Fractions/SymPy, and outer/run_outer.py now calls it. It covers:
    • the N = 2, H = tI counterexample;
    • the inequalities above, as polynomials with nonnegative coefficients;
    • G′ₛ(0) = 1 and N_ii = 1, checked symbolically;
    • exact rational truncated/rounded sections (γ ∈ {1/2, 2, 20}, s ∈ {0, 1/4, ±0.499}, n ∈ {2, 4, 8}): unit diagonal, e₀*He₀ = 1, ‖He₀‖² ≥ 1, and a positive-definite Hermitian part by exact LDLᵀ.
  • Inherited texts are not edited. outer/GAUGEFREE-INTERIORS.md gets a pointer note at the top, following Conditional κ = 0.001679754956125544521335670993920702576998311438502580295460327520162864548260325638826305656132844: recertified 1e-60000 supplier endpoint, fixed-grid-maximum kappa C - 1/F - B at 1e-60080 slacks (PR2180 / PR2161 retune)… #2220's existing package-note precedent; the body is byte-for-byte unchanged, including its CRLF line endings. outer/FINE-PADDING-COMPOSITION.md and vendor/pr1786/FINE-PRIME-PADDING.md §3 still cite the uncorrected form verbatim. ACCRETIVE-SCALE.md lists them and says this package relies on the corrected form wherever they cite the theorem.

Effect on numbers: none. The circuit guard enters the ledger only as an additive g·polylog(p) bit term. check_ledger.py and independent_check.py take no Λ or μ input, and the binding inequality β + 2ξ − ε ≤ 1 − r − ζ is unchanged. LEDGER.json and INDEPENDENT.json still regenerate byte-identically, and κ is unchanged. The theorem form the package relies on is now the restricted one. This addresses only the scale issue; the shared #1673/#1758/#1786 analytic and fixed-tape review stays open as before.

Verify: I ran python3 -B verify.py from a fresh git archive export of 6b09c565 under nice 10, in 59 s. Every step passed: PASS_MANIFEST 285, the PR2260 supplier replay and binding, PASS_ENDPOINT, PASS_ACCRETIVE_SCALE 188, PASS_EXACT_REPLAY 19, PASS_OUTER and PASS_COMPLETE. κ = 0.00168341258854260746233031974039993696050370972245… is identical to the 49ce38fe run.

Prepared by DreamingOfClouds with Claude Opus 5.5 (Anthropic), via Claude Code; Apache-2.0.

@Mister-Meeseeks
Mister-Meeseeks merged commit aed132b into CrocSwap:main Oct 16, 2026
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