Repository navigation
Research: one shared call at block 3, which two-term parts finish, which remove (no new κ) - #7629
Open
jacobalansussman wants to merge 1 commit into
Conversation
…ich remove (no new κ) Adds research/complex-m3-shared-call-finish-or-remove: an exact table, in the frame game at 3 address bits, of what one array can hold in the output of a call that it shares with a second array. Among the two-term parts tested, none can be both finished by a last call and removed from the other array's last call. Checked by computer; not a theorem about all programs. No new κ. Co-Authored-By: Claude Fable 5.2 <noreply@anthropic.com>
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
Adds one package,
research/complex-m3-shared-call-finish-or-remove: an exact table, in the frame game at 3address bits, of what one array can hold in the output of a call that it shares with a second array. Among the
two-term parts tested (two kinds; coefficients 1, −1, 2 and 1/2 for the first kind and 1, −1 and 2 for the
second), none can be both finished by a last call and removed from the other array's last call. Checked by
computer; not a theorem about all programs. No new κ; no record, target or frozen package changes.
Remaining obligations: no person has checked the table, the rule or the symmetry argument. The table is a result
about the cases it lists: parts with three or more terms, a first call that reads a combination of the raw
input, last calls repaired against each other, other arrangements of the five calls, and the engine game itself
are not covered. At 3 address bits a 2 in 5 was already excluded by #4628, so nothing new is excluded.
Task and overlap
e54523517d0f03e58352e647c403a5af3e525a57, priority revision 8. The catalogue's context still describesRaise conditional kappa to 0.00310045 with independent helper splits #5599; the selected record at this base is Jerry Chen / CubeJerry's Conditional κ = 0.00363005817 (+0.0838% over #6936): shared wires and two helper splits #7000 with the paired Remove empty-root credits from the paired BIT supplier at 0.00385248 (no new κ) #7001, which this
package does not touch. Card
scope-navigation(method "Index one tightly related family of obstructions withexplicit excluded and open hypotheses"),
scope_status: changed: the package also adds a result that is not onmain (the table and its rule). Reason in
TASK.json.at least four mixing blocks) and my earlier note (Research: lower bounds for small complex units: m = 2 never saves, m = 3 needs 14W/5 calls (Lean, engine game), m = 4 needs 41W/13, and the smallest open cases (no new κ) #4628: s ≥ 14W/5 at block 3, proved in Lean, which excludes
2 in 5 there). The conflict was met on examples in October 2026. lee-phys's two-image prefix (Construct an invertible two-call prefix tight on eight block-3 hook cuts #4688) is
invertible with U + 2V and has a kernel with U + V. For a five-call preparation built on that prefix,
JoyboyBrian showed that with the invertible coefficient no change of the fresh input's free feed repairs it
(Prove a single-owner obstruction to staggered fresh-feed repair #4751), and that with coefficient 1 a free decoder leaves no contamination from the fresh owner but only a
partial channel (Construct a resonant partial target channel at every even width #4797). Nick Petalas (Certify resonant partial-channel rank 100 at width four (no new κ) #4825) and Dugongue (Prove all-width resonant rank and explicit image recovery #4885) found that channel's rank. Reading these as
one conflict is my reading, not a statement of those notes. They work in the engine game with every phase
kept, and this package works in the frame game.
three directions (the group of order 10,752, the 14 neighbouring frames, the stabiliser of order 768) and uses
this "symplectic quotient" as a search coordinate system; zxv's Gaussian cache reuse for cross-frame ADDs and paid history (no new κ) #5283 defines frames the same way.
the five-array shared port of Chris R (Emit shared-port fusion and bound its free five-target completion (no new κ) #4856) and JoyboyBrian (Prove the all-prefix information deficit of the native shared-port producer #5491). The one unit claimed at three directions
(feat(research): exact 5-array 14-call block-3 unit schedule via 14-neighbor symplectic cascade (κ <= 0.0628) #4813, 5 in 14) was withdrawn by its author on 23 October 2026; its folder on main still shows the original
text.
repeating it.
under
research/at the base. I found no table of this kind. The hub's nearest word to a spare address bit is"spectator"; 330 pull requests use it and I did not read their bodies, so I do not claim that no small unit was
studied with one. This is bounded coverage, not a novelty certificate; Discussions were not searched.
Validation
Standard library only, exact rational arithmetic, no file read or written. With Python 3.12.13 on an Apple M4
(macOS) the six registered parts take about 3, 38, 4, 42, 85 and 22 seconds and under 30 MB each. In a clone of
the hub's main at
e54523517d,scripts/research_package.pypasses the metadata check(
PASS_PACKAGE_METADATA_AND_PINS) and runs the six registered commands with Python 3.12.13(
PASS_REGISTERED_RESEARCH_PACKAGE), andscripts/check_research_commit.pypasses on the commit that adds thepackage, with
--check-source-history(PASS_RESEARCH_COMMIT_BYTES).Controls:
-O, where its assert statements would be skipped.Local only: two AI reviewers rebuilt the counts of an earlier form of the table from the README's definitions
with their own programs, which are not in this package. Between them they found the two corrections that are
now in section 5 (a free step after the last call; removing calls that cannot be a last call).
Not registered:
--part full, every case one at a time with no symmetry reduction; I ran it once in fourquarters of about a minute each, with the same totals. Not run: the 20,643,840 cases at 4 address bits (a sample
of 100 only); any other coefficient; a free step after the last call for kind B; the hub's
find_overlap.pyhelper (I used my own search, described above); Lean.
Hosted CI: at this base the
planjob fails on one of the hub's own tests, so the package replay is skipped fornew pull requests. I did not retrigger it. The local replay above is the evidence.
A remark on method, not evidence (local only: the runs and the files are not public and not in this package).
The table came out of nine runs in which AI agents carried ideas for sharing work into this game, eight of them
from other fields. None gave a program that beats the plain way at three directions, and six arrived separately
at this arrangement. Before looking at which cases were removable, the AI agent I work with wrote a guess for
the rule in a dated file, with a confidence of 75 %, and the comparison matched. Review by other AI agents then
asked two things the guess had not asked, and both changed the table. The README has the paragraph.
Credit
On the hub: eumemic (#288); Jose Manuel (#2108); lee-phys (#4688); Yiyang, whose phase repair (#4710) the October
thread built on; Dugongue (#4743, #4885, #5803); JoyboyBrian (#4751, #4797, #5491); Nick Petalas (#4825, #7551);
Chris R (#4856); alephnan (#6714); zxv (#5283). OpenAI for the cost model, the call and its 2-point kernel.
Fields the local runs drew on, none of which gave a saving: coded caching (Maddah-Ali and Niesen) and
interference alignment (in Cadambe and Jafar's form); catalytic computing (Buhrman, Cleve, Koucký, Loff and
Speelman; Cook and Mertz) with Bennett's uncomputation; Strassen's and Pan's fast matrix multiplication; the
transform splittings of Winograd, Rader and Bluestein; branch and sector bookkeeping from quantum circuits;
storage codes (Dimakis and co-authors) and secret sharing (Shamir); Maschke's averaging over a group; addition
chains (Yao; Pippenger) with Borodin and Moenck's remainder trees.
Substantial AI assistance: I did this work with the help of AI agents (Anthropic's Claude). The programs, the
searches, the arguments and the text were written by the agents under my direction. No independent human review
of this package is claimed. Apache-2.0.
Open next questions
In README (
## Open next questions) andTASK.json. The smallest useful follow-up: the same arrangement at 4address bits with every coefficient left free and the two last outputs read together. It matters because a
2 in 5 with one spare address bit is the smallest shape at three directions that no bound I know excludes (a
saving of 1.66e-1 in the paid calls of one unit, not a κ). Blocked by nothing but size: 20,643,840 free elements
before symmetry. Two smaller ones: a proof that a kind A part on two different frames is never finishable by the
call alone; a proof that a call which exchanges the frames of the two terms removes a kind B part when c = ±1.
Workflow feedback (optional)
At this base the
planjob fails for new pull requests on the hub's own testtest_current_ci_section_matches_selected_record(as far as I can tell from the job logs of #7551 and #7627:docs/ci-verification.mdstill describes #6030 while the selected record is #7000), so no package replay runs.Sources
research/abelian-cayley-metric-scope/sources/pr288-README.md). Jose Manuel: Prove a two-register cost bound for three scalar mixing blocks #2108. My earlier note: Research: lower bounds for small complex units: m = 2 never saves, m = 3 needs 14W/5 calls (Lean, engine game), m = 4 needs 41W/13, and the smallest open cases (no new κ) #4628(
research/complex-small-m-lower-bounds). lee-phys: Construct an invertible two-call prefix tight on eight block-3 hook cuts #4688 (research/complex-two-image-hook-prefix). Yiyang:Construct a target-aligned phase repair of the block-3 two-call prefix (no new kappa) #4710. Dugongue: Add reversible native ports and swap-sector completion for the complex prefix #4743 (
research/complex-prefix-native-ports), Prove all-width resonant rank and explicit image recovery #4885, Add a mathematical atlas of shared queries, helper hubs and compiler routes #5803. JoyboyBrian: Prove a single-owner obstruction to staggered fresh-feed repair #4751(
research/staggered-single-owner-obstruction), Construct a resonant partial target channel at every even width #4797 (research/resonant-owner-extraction), Prove the all-prefix information deficit of the native shared-port producer #5491. NickPetalas: Certify resonant partial-channel rank 100 at width four (no new κ) #4825, and Prove the sharp all-rank binary dual-polar cut ceiling (no κ) #7551 (open, head
9aec48e750). Chris R: Emit shared-port fusion and bound its free five-target completion (no new κ) #4856. alephnan: Prove the sharp three-qubit Clifford tensor threshold T(3)=10 #6714. zxv: Gaussian cache reuse for cross-frame ADDs and paid history (no new κ) #5283. The withdrawn5 in 14: feat(research): exact 5-array 14-call block-3 unit schedule via 14-neighbor symplectic cascade (κ <= 0.0628) #4813.
0788bc6568(3 November2026):
research/frame-packing-two-arrays/(the frame game, the completion of frame-game programs, thenegative control),
research/moonshot-block4-block5/(the 2 in 7 dilemma) andresearch/block-bounds-and-new-rules/(spare rows, the 2.4883 lower bound, the open case).🤖 Generated with Claude Code