Repository navigation
Conversation
…s: kappa = 5.878747e-4 Complex: PR144's paired cubes at p = 11 with a searched triple module and an annealed pair module; the face-2 and edge-02 outputs of each port are merged into one signed node per (b0, b2); 7,880 operation frames moved by physical descent and 2,970 gauged roles placed in dead donors' slots with deadline reads (AC 5885669/10^10). Bit: the paired-cube bit word with an annealed pair module (COARSE 5936323/10^10). Phase stop 1e-9. The complex side binds and the 47-constraint assembly gives kappa = 5878747/10^10. Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com>
…the balanced prefix on paired cubes: kappa = 6.096379e-4 Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com>
… on paired cubes: kappa = 6.457084e-4 Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com>
…es: kappa = 6.489120e-4 Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com>
…derived terminal sinks: kappa = 6.558894e-4 Co-Authored-By: Claude Opus 5.5 (1M context) <noreply@anthropic.com>
…on PR168 v4: kappa = 6.602166e-4 Complex: the direction-0 shared-edge local circuit of PR181 (13,042 virtual roles, 44 terminal sinks). Bit: 556 connected-component endpoint frame changes on PR168 v4's physical bit layer and 34 PR166 terminal sinks on face0 roots, rechecked on the overridden word with exact prime witnesses for all 24,577 used frames. Both suppliers and the paid balanced composition are independently certified above PR168 at 4a3c769: kappa = 330108276030861/(5*10^17). The bit branch still binds. The exact four-file PR175 overlay is retained. Prepared by Chafik Boukhalfa with substantial Anthropic Claude and OpenAI Codex assistance.
PR184 edits README.md, Makefile, NOTICE, SOURCES.json, the verify workflow, docs/reproducibility.md and the joint-dual source manifest. PR182 and PR185 pin those files, so their manifests go stale after the merge. This commit updates only the stale hash values: - certificates/joint-dual-kappa.json: source_manifest_sha256 - certificates/joint-dual-validation.json: certificate_sha256 - research/paired-cube-local-bit-168/SOURCE.json: nine shared files - research/bit-leaf-bootstrap182/SOURCE.json: regenerated with its own pin_sources.py No certificate value, construction file or package file changes. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Apply PR184's source-parity local word and source-assisted frame flow to PR168 v4's query modules and physical layer instead of the older fd25adb modules. The complex supplier now has R = 10,824, W = 13,464, 1,412 source-controlled erasures and 707 kernel reuses. Its saving is 3315351/(5*10^9) = 6.630702e-4, about 0.91% above PR184's complex saving and 0.113% above PR186's. PR184's bit supplier is larger, so the complex side binds. PR184's unchanged finite bridge and 47-constraint assembly give kappa = 6626307/10^10 = 6.626307e-4, about 0.1126% above PR186 (6.61885549259598e-4). verify.py regenerates the v4 cache, the new local word, the flow, the exact lift, the contract checks and the assembly, and compares the result with certificate.json. A workflow runs it in CI. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
PR184 pairs each live gauge with a donor by a plain maximum matching. source_aligned_local_v4.py --avoid-parity-erasure instead takes a minimum-weight full matching that avoids pairs PR184's parity purification would erase. With the frozen result in data/physical-pairs.json the flow has 8,116 dependent outgoing values instead of 10,364 and needs 1,412 fewer dirty births: R = 9,412, W = 12,052. PR184's exact lift and contract checks pass unchanged. The complex saving rises to 219037/312500000 = 7.009184e-4. PR184's effective bit saving (6.6523e-4) now binds, and the unchanged assembly gives kappa = 103873/156250000 = 6.647872e-4: +0.438% over PR186 and +0.325% over PR191. verify.py now records the binding supplier and rounds binary-float diagnostics in the certificate, so last-digit libm differences between platforms cannot change the comparison. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
… kappa = 6.617552e-4 Complex: the direction-0 shared-edge local circuit of PR181 (13,042 virtual roles, 44 terminal sinks). Bit: assemble A[2,0] and A[2,1] from the two face diagonals (19,348 virtual roles), with a fresh carrier matching and gauge selection by the retained generator rules, our own physical layer (6,138 descended frames, 1,760 compensated handoffs) and 34 PR166 terminal sinks on face0 roots. Both suppliers are independently certified above PR168 at 4a3c769 with the paid balanced composition: kappa = 330877589979561/(5*10^17); the complex branch binds. The exact four-file PR175 overlay is retained. Prepared by Chafik Boukhalfa with substantial Anthropic Claude and OpenAI Codex assistance.
…ppa = 6.674324e-4 The complex saving of the v4 source-assisted word (7.009184e-4) exceeds every published bit supplier, so the bit side binds. assemble.py prices PR189's certified face-diagonal bit profile (R = 17,554, W = 21,074) with PR184's unchanged select() and assemble(): coarse 6682989/10^10, effective 6.678782e-4, 47 strict constraints and seven margins. kappa = 1668581/2500000000 = 6.674324e-4: +0.398% over PR193 and +0.838% over PR186. PR189's manifest pins README.md, Makefile, NOTICE, SOURCES.json, the verify workflow, docs/reproducibility.md and the joint-dual files; this commit updates those nine stale hash values. PR189's verify.py passes on this branch, and the workflow now runs it. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…er: kappa = 6.768823e-4 Stacked on PR194 (ikeboy; icekylinx's PR184 source-assisted method on PR168 v4 modules). Only the bit certificate that assemble.py reads changes: the PR200 bit supplier (research/paired-cube-diagonal-bit-168, effective saving about 6.7734e-4) replaces PR189's. The bit branch still binds: kappa = 6768823/10^10, 1.416% above PR194. PR194's manifest pins and its workflow are updated for the new bit package; the complex supplier, tools, finite bridge and assembly are unchanged. Prepared by Chafik Boukhalfa with substantial Anthropic Claude assistance.
PR202's certificate.json carried complex lift hashes from a different zlib build, so research/source-assisted-v4/verify.py failed in CI with "Canonical certificate does not reproduce". The complex side did not change. Regenerated on amd64 Ubuntu 24.04 with Python 3.13 (zlib 1.3), the lift certificate (1d81a79b...), lift.json (c41fee34...) and complex source hash (7374c75b...) return to a8c8778's values; kappa stays 6768823/10^10. PR200's SOURCE.json pins this file, so its one entry is repinned. Both verifiers pass on that Linux image. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
…lier: kappa = 6.830611e-4 Applies PR186's (Dugongue) stage-private 18x4 / 3x24 completed entrance banks, scheduled by the round-8 BANK-SCHEDULE supplement, to PR200's (chafreaky) physical bit word as composed in PR202. The 2,200 rank-60 entrance exteriors are removed: W 20,634 -> 56402/3, largest child 60 -> 22, deficit 1,936. Deleted terminal sinks have no register, so the live chains are 18,908 - 1,760 splices - 34 sinks = 17,114. verify.py reruns PR200's terminal prover on the literal word (F2 and integer columns), rebuilds the bank inventory, exact charts for the 220 entrance frames (PR197's inverse_integer, entries <= 18), PR186's projector checks and paid moments (AST-identical to upstream), an independent base-two moment, and PR184's 47-constraint assembly with PR185's 3-level finite leaf. It reproduces PR202 (6768823/10^10) and PR199 (1693287/2500000000) as controls and rejects five mutations. kappa = 6830611/10^10 (6826211/10^10 without the leaf): +0.913% over PR202 and +2.342% over PR194. The bit supplier binds; the complex saving is 219037/312500000. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Author
|
Closing this because #205 already covers the same construction: PR186's completed entrance banks applied to PR200's bit word, with the same packed profile and the same κ up to grid precision. #205 was opened first, so this PR is not needed. 🤖 Commented by Claude Code |
Author
|
This branch stacks on #202 and conflicts with
🤖 Commented by Claude Code |
maxime-fleury
added a commit
to maxime-fleury/integer-mult-bounds
that referenced
this pull request
Oct 9, 2026
The lever model's prediction was built within the half hour: audit.py prices CrocSwap#205's, CrocSwap#206's and CrocSwap#207's banked rows from byte-identical copies of their certificates and reproduces each author's coarse saving to the last digit, confirming every one sits at its own word's ceiling. The cheapest admissible ledger of the frontier row's mass would lift it 76.6%, which bounds the room a better schedule can still buy.
This was referenced Oct 9, 2026
This was referenced Oct 9, 2026
Closed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Change and mathematical scope
This PR applies PR186's completed entrance banks to PR200's physical bit word and prices the result against the v4 source-assisted complex supplier, as composed in PR202. The new package is
research/pr200-entrance-banks/.κ = 6830611/10^10 ≈ 6.830611e-4. That is +0.913% over PR202 (6768823/10^10) and +2.342% over PR194. Without the finite leaf, κ = 6826211/10^10. The bit supplier still binds; the complex saving is 219037/312500000 ≈ 7.009184e-4.
Construction:
BANK-SCHEDULE.mdsupplement.inverse_integer. Every entry and denominator is at most 18. Charts for distinct slots of one bank differ by a nonzero integer matrix with entries below 2^80. So no prime q > 2^80 identifies two charts of one group, which discharges the round-8 prime exclusion for these charts.select()and 47-constraintassemble(), and PR185's 3-level finite leaf, composed as in PR199.Separate commit: PR202's
research/source-assisted-v4/certificate.jsonwas written off Linux. Its gzip-dependent lift hashes therefore failed PR202's own workflow ("Canonical certificate does not reproduce"). Regenerated on amd64 Ubuntu 24.04 with Python 3.13, the hashes return to a8c8778's values and κ is unchanged. That commit also repins the single matching entry in PR200'sSOURCE.json.Stacking: this branch stacks on PR202, which stacks on PR194, so like those PRs it is not mergeable onto current
main. PR200, PR202, PR197 and PR199 have no maintainer review yet.Scope: a conditional finite witness. These stay inherited conditional contracts:
No optimality is claimed.
NOTICEcredits every borrowed piece. The package's files underreferences/are byte-identical upstream copies, and their commits and blob ids are inreferences/manifest.json.Validation
python3 -B research/pr200-entrance-banks/verify.py [--full]does the following:Results:
--fullon amd64 Ubuntu 24.04 with Python 3.11, 3.13 and 3.14, and locally on macOS with Python 3.13.verify.pyand v4'sverify.pyboth pass after the certificate fix..github/workflows/pr200-entrance-banks.ymlrunsverify.py --fullon that matrix and thengit diff --exit-code.These are finite certificate checks, not formal verification of the multiplication theorem.
🤖 Generated with Claude Code