Repository navigation
Conversation
…= 5.901881e-4 compile_graph accepts a carrier arc only if the donor's coordinate-padded maximal frame already lies inside the receiving frame. That pre-test is sufficient, not necessary. research/extended-links compiles with the condition the construction uses: the dependency graph with the arcs is acyclic and every value span lies in its full backward-intersection frame. Every arc of CrocSwap#161 is kept and 48 are added; the physical layer is rebuilt under CrocSwap#161's rules. CrocSwap#161 is not on main, so the package carries the 32 files of CrocSwap#161 it reads as a pinned archive (sha256 of each file from commit d14e291) and rebuilds them in a temporary directory, as research/coordinated-frames-and-entrance-banks does. No existing file changes.
1e8140f to
279b2ff
Compare
|
Thank you @DaysSky. This contribution is now recorded on main in the scoped reconciliation review and contributor credits. Contribution: Expanded legal carrier relation with full backward containment. Review and limits: Fresh full replay; acyclic relation and all 48 arcs paid. The complete original source, proof/research notes, notices and relevant replay/CI evidence are retained through the pinned source archive. The review distinguishes fresh runs, exact-head historical CI and prior integration evidence. Closing this historical PR as reconciled; its obsolete headline does not replace the current selected bound, and draft/retracted claims retain their explicit qualifications. Reviewed head: |
Built on #161 (eumemic,
d14e291). #161 was closed in favour of #168 and is not on main, so this package carries the 32 files of #161 it reads (scripts, frozen arcs and physical layer, module sources and certificates) as a pinned archive,baseline-pr161.tar.gz(0.3 MB). It rebuilds them in a temporary directory, followingresearch/coordinated-frames-and-entrance-banks. Each file's sha256 is pinned inSOURCE.jsonto commitd14e291; a tampered archive is rejected. No existing file changes. The compiler introduced here (compile_closure) has since been adopted into #168'sscripts/paired_cube/closure.py.Under #161's retained interfaces, this certifies
That is +0.394% over #161 (5878747/10^10). #161 is complex-bound, so a complex-side change moves κ directly.
What changes
Only the complex word's carrier arcs and its physical layer change. The graph, the gauges, the bit supplier, the phase stop, the atom exponent and the assembly are #161's.
compile_graphaccepts an arc only if the donor's coordinate-padded maximal frame already lies inside the receiving frame. That pre-test is sufficient, not necessary. The construction needs less: the dependency graph with the arcs is acyclic, and every value span still lies in its full backward-intersection frame.cxlinks.compile_closurecompiles with that condition. Every arc of Merged complex outputs and an annealed bit pair module on paired cubes: conditional κ = 5.878747e-4 #161 is kept, and 48 that the pre-test rejects are added.The deficit per vertex (1,320) and the largest child (20) are unchanged. The complex side still binds; #161's bit supplier sits at 5.9308e-4.
Verify
compile_closurereturns Merged complex outputs and an annealed bit pair module on paired cubes: conditional κ = 5.878747e-4 #161's certified complex record exactly, and Merged complex outputs and an annealed bit pair module on paired cubes: conditional κ = 5.878747e-4 #161's frozen physical record prices to 5885669/10^10 and 5878747/10^10.scripts/paired_cube/verify.pypasses unchanged on the extended word: 1,742,400 signed scalar pairs, K, full backward intersections, the physical replay of every frame movement, 2,970 rank-18 gauges and the target chains. That checker has no pre-test.scripts/paired_cube_physical.pypasses unchanged on the new frames and pairs: value spans, nested spliced chains, pair chronology, target chains in read order, the telescoping deficit, and the exact aliased replay with its three controls rejected.exact_moment,finite_bridgeand 47-constraint assembly give both values as the largest points of the 10^-10 grid, with the next points rejected.One check of #161's code is relaxed in
verify.py: the complex role count is not pinned to 16,011; it must equalc + q − matchedand not exceed 16,011.Run before opening:
verify.pypasses on this branch from the archive alone (Python 3.14, macOS); it also passed on 3.12 against the original Merged complex outputs and an annealed bit pair module on paired cubes: conditional κ = 5.878747e-4 #161 tree.make_plan.pyregenerates the three data files byte for byte.-Ois refused.tests/test_recycled_bit_integration.pypasses on this branch.Not run: the complete
make verify, the formal targets, and any Linux run. The new workflow runsverify.pyand the plan regeneration on Python 3.11 and 3.14.Scope and limits
PROOF.md gives the argument. Every interface #161 retains stays an assumption. Beyond that:
d14e291. The package stays valid for that commit.s,w12, and a pair-level merge of face 1 with edge 01) are cost-neutral, and two other all-but-one modules are worse.Credits
The closure-condition compile, the extended arcs and this physical layer were prepared by DaysSky, assisted with Claude. No priority over concurrent work is claimed.